1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent, but occasionally
28 calls language-dependent routines defined (for C) in typecheck.c. */
32 #include "coretypes.h"
38 #include "double-int.h"
45 #include "fold-const.h"
46 #include "stor-layout.h"
52 #include "hard-reg-set.h"
55 #include "toplev.h" /* get_random_seed */
56 #include "filenames.h"
59 #include "common/common-target.h"
60 #include "langhooks.h"
61 #include "tree-inline.h"
62 #include "tree-iterator.h"
64 #include "dominance.h"
66 #include "basic-block.h"
68 #include "tree-ssa-alias.h"
69 #include "internal-fn.h"
70 #include "gimple-expr.h"
73 #include "gimple-iterator.h"
75 #include "gimple-ssa.h"
77 #include "plugin-api.h"
80 #include "tree-phinodes.h"
81 #include "stringpool.h"
82 #include "tree-ssanames.h"
84 #include "statistics.h"
86 #include "fixed-value.h"
87 #include "insn-config.h"
96 #include "tree-pass.h"
97 #include "langhooks-def.h"
98 #include "diagnostic.h"
99 #include "tree-diagnostic.h"
100 #include "tree-pretty-print.h"
104 #include "builtins.h"
105 #include "print-tree.h"
106 #include "ipa-utils.h"
108 /* Tree code classes. */
110 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
111 #define END_OF_BASE_TREE_CODES tcc_exceptional,
113 const enum tree_code_class tree_code_type
[] = {
114 #include "all-tree.def"
118 #undef END_OF_BASE_TREE_CODES
120 /* Table indexed by tree code giving number of expression
121 operands beyond the fixed part of the node structure.
122 Not used for types or decls. */
124 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
125 #define END_OF_BASE_TREE_CODES 0,
127 const unsigned char tree_code_length
[] = {
128 #include "all-tree.def"
132 #undef END_OF_BASE_TREE_CODES
134 /* Names of tree components.
135 Used for printing out the tree and error messages. */
136 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
137 #define END_OF_BASE_TREE_CODES "@dummy",
139 static const char *const tree_code_name
[] = {
140 #include "all-tree.def"
144 #undef END_OF_BASE_TREE_CODES
146 /* Each tree code class has an associated string representation.
147 These must correspond to the tree_code_class entries. */
149 const char *const tree_code_class_strings
[] =
164 /* obstack.[ch] explicitly declined to prototype this. */
165 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
167 /* Statistics-gathering stuff. */
169 static int tree_code_counts
[MAX_TREE_CODES
];
170 int tree_node_counts
[(int) all_kinds
];
171 int tree_node_sizes
[(int) all_kinds
];
173 /* Keep in sync with tree.h:enum tree_node_kind. */
174 static const char * const tree_node_kind_names
[] = {
193 /* Unique id for next decl created. */
194 static GTY(()) int next_decl_uid
;
195 /* Unique id for next type created. */
196 static GTY(()) int next_type_uid
= 1;
197 /* Unique id for next debug decl created. Use negative numbers,
198 to catch erroneous uses. */
199 static GTY(()) int next_debug_decl_uid
;
201 /* Since we cannot rehash a type after it is in the table, we have to
202 keep the hash code. */
204 struct GTY((for_user
)) type_hash
{
209 /* Initial size of the hash table (rounded to next prime). */
210 #define TYPE_HASH_INITIAL_SIZE 1000
212 struct type_cache_hasher
: ggc_cache_hasher
<type_hash
*>
214 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
215 static bool equal (type_hash
*a
, type_hash
*b
);
218 handle_cache_entry (type_hash
*&t
)
220 extern void gt_ggc_mx (type_hash
*&);
221 if (t
== HTAB_DELETED_ENTRY
|| t
== HTAB_EMPTY_ENTRY
)
223 else if (ggc_marked_p (t
->type
))
226 t
= static_cast<type_hash
*> (HTAB_DELETED_ENTRY
);
230 /* Now here is the hash table. When recording a type, it is added to
231 the slot whose index is the hash code. Note that the hash table is
232 used for several kinds of types (function types, array types and
233 array index range types, for now). While all these live in the
234 same table, they are completely independent, and the hash code is
235 computed differently for each of these. */
237 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
239 /* Hash table and temporary node for larger integer const values. */
240 static GTY (()) tree int_cst_node
;
242 struct int_cst_hasher
: ggc_cache_hasher
<tree
>
244 static hashval_t
hash (tree t
);
245 static bool equal (tree x
, tree y
);
248 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
250 /* Hash table for optimization flags and target option flags. Use the same
251 hash table for both sets of options. Nodes for building the current
252 optimization and target option nodes. The assumption is most of the time
253 the options created will already be in the hash table, so we avoid
254 allocating and freeing up a node repeatably. */
255 static GTY (()) tree cl_optimization_node
;
256 static GTY (()) tree cl_target_option_node
;
258 struct cl_option_hasher
: ggc_cache_hasher
<tree
>
260 static hashval_t
hash (tree t
);
261 static bool equal (tree x
, tree y
);
264 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
266 /* General tree->tree mapping structure for use in hash tables. */
270 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
273 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
275 struct tree_vec_map_cache_hasher
: ggc_cache_hasher
<tree_vec_map
*>
277 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
280 equal (tree_vec_map
*a
, tree_vec_map
*b
)
282 return a
->base
.from
== b
->base
.from
;
286 handle_cache_entry (tree_vec_map
*&m
)
288 extern void gt_ggc_mx (tree_vec_map
*&);
289 if (m
== HTAB_EMPTY_ENTRY
|| m
== HTAB_DELETED_ENTRY
)
291 else if (ggc_marked_p (m
->base
.from
))
294 m
= static_cast<tree_vec_map
*> (HTAB_DELETED_ENTRY
);
299 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
301 static void set_type_quals (tree
, int);
302 static void print_type_hash_statistics (void);
303 static void print_debug_expr_statistics (void);
304 static void print_value_expr_statistics (void);
305 static void type_hash_list (const_tree
, inchash::hash
&);
306 static void attribute_hash_list (const_tree
, inchash::hash
&);
308 tree global_trees
[TI_MAX
];
309 tree integer_types
[itk_none
];
311 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
312 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
314 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
316 /* Number of operands for each OpenMP clause. */
317 unsigned const char omp_clause_num_ops
[] =
319 0, /* OMP_CLAUSE_ERROR */
320 1, /* OMP_CLAUSE_PRIVATE */
321 1, /* OMP_CLAUSE_SHARED */
322 1, /* OMP_CLAUSE_FIRSTPRIVATE */
323 2, /* OMP_CLAUSE_LASTPRIVATE */
324 4, /* OMP_CLAUSE_REDUCTION */
325 1, /* OMP_CLAUSE_COPYIN */
326 1, /* OMP_CLAUSE_COPYPRIVATE */
327 3, /* OMP_CLAUSE_LINEAR */
328 2, /* OMP_CLAUSE_ALIGNED */
329 1, /* OMP_CLAUSE_DEPEND */
330 1, /* OMP_CLAUSE_UNIFORM */
331 2, /* OMP_CLAUSE_FROM */
332 2, /* OMP_CLAUSE_TO */
333 2, /* OMP_CLAUSE_MAP */
334 2, /* OMP_CLAUSE__CACHE_ */
335 1, /* OMP_CLAUSE_DEVICE_RESIDENT */
336 1, /* OMP_CLAUSE_USE_DEVICE */
337 2, /* OMP_CLAUSE_GANG */
338 1, /* OMP_CLAUSE_ASYNC */
339 1, /* OMP_CLAUSE_WAIT */
340 0, /* OMP_CLAUSE_AUTO */
341 0, /* OMP_CLAUSE_SEQ */
342 1, /* OMP_CLAUSE__LOOPTEMP_ */
343 1, /* OMP_CLAUSE_IF */
344 1, /* OMP_CLAUSE_NUM_THREADS */
345 1, /* OMP_CLAUSE_SCHEDULE */
346 0, /* OMP_CLAUSE_NOWAIT */
347 0, /* OMP_CLAUSE_ORDERED */
348 0, /* OMP_CLAUSE_DEFAULT */
349 3, /* OMP_CLAUSE_COLLAPSE */
350 0, /* OMP_CLAUSE_UNTIED */
351 1, /* OMP_CLAUSE_FINAL */
352 0, /* OMP_CLAUSE_MERGEABLE */
353 1, /* OMP_CLAUSE_DEVICE */
354 1, /* OMP_CLAUSE_DIST_SCHEDULE */
355 0, /* OMP_CLAUSE_INBRANCH */
356 0, /* OMP_CLAUSE_NOTINBRANCH */
357 1, /* OMP_CLAUSE_NUM_TEAMS */
358 1, /* OMP_CLAUSE_THREAD_LIMIT */
359 0, /* OMP_CLAUSE_PROC_BIND */
360 1, /* OMP_CLAUSE_SAFELEN */
361 1, /* OMP_CLAUSE_SIMDLEN */
362 0, /* OMP_CLAUSE_FOR */
363 0, /* OMP_CLAUSE_PARALLEL */
364 0, /* OMP_CLAUSE_SECTIONS */
365 0, /* OMP_CLAUSE_TASKGROUP */
366 1, /* OMP_CLAUSE__SIMDUID_ */
367 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
368 0, /* OMP_CLAUSE_INDEPENDENT */
369 1, /* OMP_CLAUSE_WORKER */
370 1, /* OMP_CLAUSE_VECTOR */
371 1, /* OMP_CLAUSE_NUM_GANGS */
372 1, /* OMP_CLAUSE_NUM_WORKERS */
373 1, /* OMP_CLAUSE_VECTOR_LENGTH */
376 const char * const omp_clause_code_name
[] =
436 /* Return the tree node structure used by tree code CODE. */
438 static inline enum tree_node_structure_enum
439 tree_node_structure_for_code (enum tree_code code
)
441 switch (TREE_CODE_CLASS (code
))
443 case tcc_declaration
:
448 return TS_FIELD_DECL
;
454 return TS_LABEL_DECL
;
456 return TS_RESULT_DECL
;
457 case DEBUG_EXPR_DECL
:
460 return TS_CONST_DECL
;
464 return TS_FUNCTION_DECL
;
465 case TRANSLATION_UNIT_DECL
:
466 return TS_TRANSLATION_UNIT_DECL
;
468 return TS_DECL_NON_COMMON
;
472 return TS_TYPE_NON_COMMON
;
481 default: /* tcc_constant and tcc_exceptional */
486 /* tcc_constant cases. */
487 case VOID_CST
: return TS_TYPED
;
488 case INTEGER_CST
: return TS_INT_CST
;
489 case REAL_CST
: return TS_REAL_CST
;
490 case FIXED_CST
: return TS_FIXED_CST
;
491 case COMPLEX_CST
: return TS_COMPLEX
;
492 case VECTOR_CST
: return TS_VECTOR
;
493 case STRING_CST
: return TS_STRING
;
494 /* tcc_exceptional cases. */
495 case ERROR_MARK
: return TS_COMMON
;
496 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
497 case TREE_LIST
: return TS_LIST
;
498 case TREE_VEC
: return TS_VEC
;
499 case SSA_NAME
: return TS_SSA_NAME
;
500 case PLACEHOLDER_EXPR
: return TS_COMMON
;
501 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
502 case BLOCK
: return TS_BLOCK
;
503 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
504 case TREE_BINFO
: return TS_BINFO
;
505 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
506 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
507 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
515 /* Initialize tree_contains_struct to describe the hierarchy of tree
519 initialize_tree_contains_struct (void)
523 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
526 enum tree_node_structure_enum ts_code
;
528 code
= (enum tree_code
) i
;
529 ts_code
= tree_node_structure_for_code (code
);
531 /* Mark the TS structure itself. */
532 tree_contains_struct
[code
][ts_code
] = 1;
534 /* Mark all the structures that TS is derived from. */
552 case TS_STATEMENT_LIST
:
553 MARK_TS_TYPED (code
);
557 case TS_DECL_MINIMAL
:
563 case TS_OPTIMIZATION
:
564 case TS_TARGET_OPTION
:
565 MARK_TS_COMMON (code
);
568 case TS_TYPE_WITH_LANG_SPECIFIC
:
569 MARK_TS_TYPE_COMMON (code
);
572 case TS_TYPE_NON_COMMON
:
573 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
577 MARK_TS_DECL_MINIMAL (code
);
582 MARK_TS_DECL_COMMON (code
);
585 case TS_DECL_NON_COMMON
:
586 MARK_TS_DECL_WITH_VIS (code
);
589 case TS_DECL_WITH_VIS
:
593 MARK_TS_DECL_WRTL (code
);
597 MARK_TS_DECL_COMMON (code
);
601 MARK_TS_DECL_WITH_VIS (code
);
605 case TS_FUNCTION_DECL
:
606 MARK_TS_DECL_NON_COMMON (code
);
609 case TS_TRANSLATION_UNIT_DECL
:
610 MARK_TS_DECL_COMMON (code
);
618 /* Basic consistency checks for attributes used in fold. */
619 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
620 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
621 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
622 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
623 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
624 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
625 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
626 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
631 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
632 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
633 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
634 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
635 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
636 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
637 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
638 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
639 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
640 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
645 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
646 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
647 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
648 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
649 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
650 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
651 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
652 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
653 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
654 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
655 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
656 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
657 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
658 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
667 /* Initialize the hash table of types. */
669 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
672 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
675 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
677 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
679 int_cst_node
= make_int_cst (1, 1);
681 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
683 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
684 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
686 /* Initialize the tree_contains_struct array. */
687 initialize_tree_contains_struct ();
688 lang_hooks
.init_ts ();
692 /* The name of the object as the assembler will see it (but before any
693 translations made by ASM_OUTPUT_LABELREF). Often this is the same
694 as DECL_NAME. It is an IDENTIFIER_NODE. */
696 decl_assembler_name (tree decl
)
698 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
699 lang_hooks
.set_decl_assembler_name (decl
);
700 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
703 /* When the target supports COMDAT groups, this indicates which group the
704 DECL is associated with. This can be either an IDENTIFIER_NODE or a
705 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
707 decl_comdat_group (const_tree node
)
709 struct symtab_node
*snode
= symtab_node::get (node
);
712 return snode
->get_comdat_group ();
715 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
717 decl_comdat_group_id (const_tree node
)
719 struct symtab_node
*snode
= symtab_node::get (node
);
722 return snode
->get_comdat_group_id ();
725 /* When the target supports named section, return its name as IDENTIFIER_NODE
726 or NULL if it is in no section. */
728 decl_section_name (const_tree node
)
730 struct symtab_node
*snode
= symtab_node::get (node
);
733 return snode
->get_section ();
736 /* Set section section name of NODE to VALUE (that is expected to
737 be identifier node) */
739 set_decl_section_name (tree node
, const char *value
)
741 struct symtab_node
*snode
;
745 snode
= symtab_node::get (node
);
749 else if (TREE_CODE (node
) == VAR_DECL
)
750 snode
= varpool_node::get_create (node
);
752 snode
= cgraph_node::get_create (node
);
753 snode
->set_section (value
);
756 /* Return TLS model of a variable NODE. */
758 decl_tls_model (const_tree node
)
760 struct varpool_node
*snode
= varpool_node::get (node
);
762 return TLS_MODEL_NONE
;
763 return snode
->tls_model
;
766 /* Set TLS model of variable NODE to MODEL. */
768 set_decl_tls_model (tree node
, enum tls_model model
)
770 struct varpool_node
*vnode
;
772 if (model
== TLS_MODEL_NONE
)
774 vnode
= varpool_node::get (node
);
779 vnode
= varpool_node::get_create (node
);
780 vnode
->tls_model
= model
;
783 /* Compute the number of bytes occupied by a tree with code CODE.
784 This function cannot be used for nodes that have variable sizes,
785 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
787 tree_code_size (enum tree_code code
)
789 switch (TREE_CODE_CLASS (code
))
791 case tcc_declaration
: /* A decl node */
796 return sizeof (struct tree_field_decl
);
798 return sizeof (struct tree_parm_decl
);
800 return sizeof (struct tree_var_decl
);
802 return sizeof (struct tree_label_decl
);
804 return sizeof (struct tree_result_decl
);
806 return sizeof (struct tree_const_decl
);
808 return sizeof (struct tree_type_decl
);
810 return sizeof (struct tree_function_decl
);
811 case DEBUG_EXPR_DECL
:
812 return sizeof (struct tree_decl_with_rtl
);
813 case TRANSLATION_UNIT_DECL
:
814 return sizeof (struct tree_translation_unit_decl
);
818 return sizeof (struct tree_decl_non_common
);
820 return lang_hooks
.tree_size (code
);
824 case tcc_type
: /* a type node */
825 return sizeof (struct tree_type_non_common
);
827 case tcc_reference
: /* a reference */
828 case tcc_expression
: /* an expression */
829 case tcc_statement
: /* an expression with side effects */
830 case tcc_comparison
: /* a comparison expression */
831 case tcc_unary
: /* a unary arithmetic expression */
832 case tcc_binary
: /* a binary arithmetic expression */
833 return (sizeof (struct tree_exp
)
834 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
836 case tcc_constant
: /* a constant */
839 case VOID_CST
: return sizeof (struct tree_typed
);
840 case INTEGER_CST
: gcc_unreachable ();
841 case REAL_CST
: return sizeof (struct tree_real_cst
);
842 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
843 case COMPLEX_CST
: return sizeof (struct tree_complex
);
844 case VECTOR_CST
: return sizeof (struct tree_vector
);
845 case STRING_CST
: gcc_unreachable ();
847 return lang_hooks
.tree_size (code
);
850 case tcc_exceptional
: /* something random, like an identifier. */
853 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
854 case TREE_LIST
: return sizeof (struct tree_list
);
857 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
860 case OMP_CLAUSE
: gcc_unreachable ();
862 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
864 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
865 case BLOCK
: return sizeof (struct tree_block
);
866 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
867 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
868 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
871 return lang_hooks
.tree_size (code
);
879 /* Compute the number of bytes occupied by NODE. This routine only
880 looks at TREE_CODE, except for those nodes that have variable sizes. */
882 tree_size (const_tree node
)
884 const enum tree_code code
= TREE_CODE (node
);
888 return (sizeof (struct tree_int_cst
)
889 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
892 return (offsetof (struct tree_binfo
, base_binfos
)
894 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
897 return (sizeof (struct tree_vec
)
898 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
901 return (sizeof (struct tree_vector
)
902 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
905 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
908 return (sizeof (struct tree_omp_clause
)
909 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
913 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
914 return (sizeof (struct tree_exp
)
915 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
917 return tree_code_size (code
);
921 /* Record interesting allocation statistics for a tree node with CODE
925 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
926 size_t length ATTRIBUTE_UNUSED
)
928 enum tree_code_class type
= TREE_CODE_CLASS (code
);
931 if (!GATHER_STATISTICS
)
936 case tcc_declaration
: /* A decl node */
940 case tcc_type
: /* a type node */
944 case tcc_statement
: /* an expression with side effects */
948 case tcc_reference
: /* a reference */
952 case tcc_expression
: /* an expression */
953 case tcc_comparison
: /* a comparison expression */
954 case tcc_unary
: /* a unary arithmetic expression */
955 case tcc_binary
: /* a binary arithmetic expression */
959 case tcc_constant
: /* a constant */
963 case tcc_exceptional
: /* something random, like an identifier. */
966 case IDENTIFIER_NODE
:
979 kind
= ssa_name_kind
;
991 kind
= omp_clause_kind
;
1008 tree_code_counts
[(int) code
]++;
1009 tree_node_counts
[(int) kind
]++;
1010 tree_node_sizes
[(int) kind
] += length
;
1013 /* Allocate and return a new UID from the DECL_UID namespace. */
1016 allocate_decl_uid (void)
1018 return next_decl_uid
++;
1021 /* Return a newly allocated node of code CODE. For decl and type
1022 nodes, some other fields are initialized. The rest of the node is
1023 initialized to zero. This function cannot be used for TREE_VEC,
1024 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1027 Achoo! I got a code in the node. */
1030 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1033 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1034 size_t length
= tree_code_size (code
);
1036 record_node_allocation_statistics (code
, length
);
1038 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1039 TREE_SET_CODE (t
, code
);
1044 TREE_SIDE_EFFECTS (t
) = 1;
1047 case tcc_declaration
:
1048 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1050 if (code
== FUNCTION_DECL
)
1052 DECL_ALIGN (t
) = FUNCTION_BOUNDARY
;
1053 DECL_MODE (t
) = FUNCTION_MODE
;
1058 DECL_SOURCE_LOCATION (t
) = input_location
;
1059 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1060 DECL_UID (t
) = --next_debug_decl_uid
;
1063 DECL_UID (t
) = allocate_decl_uid ();
1064 SET_DECL_PT_UID (t
, -1);
1066 if (TREE_CODE (t
) == LABEL_DECL
)
1067 LABEL_DECL_UID (t
) = -1;
1072 TYPE_UID (t
) = next_type_uid
++;
1073 TYPE_ALIGN (t
) = BITS_PER_UNIT
;
1074 TYPE_USER_ALIGN (t
) = 0;
1075 TYPE_MAIN_VARIANT (t
) = t
;
1076 TYPE_CANONICAL (t
) = t
;
1078 /* Default to no attributes for type, but let target change that. */
1079 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1080 targetm
.set_default_type_attributes (t
);
1082 /* We have not yet computed the alias set for this type. */
1083 TYPE_ALIAS_SET (t
) = -1;
1087 TREE_CONSTANT (t
) = 1;
1090 case tcc_expression
:
1096 case PREDECREMENT_EXPR
:
1097 case PREINCREMENT_EXPR
:
1098 case POSTDECREMENT_EXPR
:
1099 case POSTINCREMENT_EXPR
:
1100 /* All of these have side-effects, no matter what their
1102 TREE_SIDE_EFFECTS (t
) = 1;
1111 /* Other classes need no special treatment. */
1118 /* Return a new node with the same contents as NODE except that its
1119 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1122 copy_node_stat (tree node MEM_STAT_DECL
)
1125 enum tree_code code
= TREE_CODE (node
);
1128 gcc_assert (code
!= STATEMENT_LIST
);
1130 length
= tree_size (node
);
1131 record_node_allocation_statistics (code
, length
);
1132 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1133 memcpy (t
, node
, length
);
1135 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1137 TREE_ASM_WRITTEN (t
) = 0;
1138 TREE_VISITED (t
) = 0;
1140 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1142 if (code
== DEBUG_EXPR_DECL
)
1143 DECL_UID (t
) = --next_debug_decl_uid
;
1146 DECL_UID (t
) = allocate_decl_uid ();
1147 if (DECL_PT_UID_SET_P (node
))
1148 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1150 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1151 && DECL_HAS_VALUE_EXPR_P (node
))
1153 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1154 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1156 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1157 if (TREE_CODE (node
) == VAR_DECL
)
1159 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1160 t
->decl_with_vis
.symtab_node
= NULL
;
1162 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1164 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1165 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1167 if (TREE_CODE (node
) == FUNCTION_DECL
)
1169 DECL_STRUCT_FUNCTION (t
) = NULL
;
1170 t
->decl_with_vis
.symtab_node
= NULL
;
1173 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1175 TYPE_UID (t
) = next_type_uid
++;
1176 /* The following is so that the debug code for
1177 the copy is different from the original type.
1178 The two statements usually duplicate each other
1179 (because they clear fields of the same union),
1180 but the optimizer should catch that. */
1181 TYPE_SYMTAB_POINTER (t
) = 0;
1182 TYPE_SYMTAB_ADDRESS (t
) = 0;
1184 /* Do not copy the values cache. */
1185 if (TYPE_CACHED_VALUES_P (t
))
1187 TYPE_CACHED_VALUES_P (t
) = 0;
1188 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1195 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1196 For example, this can copy a list made of TREE_LIST nodes. */
1199 copy_list (tree list
)
1207 head
= prev
= copy_node (list
);
1208 next
= TREE_CHAIN (list
);
1211 TREE_CHAIN (prev
) = copy_node (next
);
1212 prev
= TREE_CHAIN (prev
);
1213 next
= TREE_CHAIN (next
);
1219 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1220 INTEGER_CST with value CST and type TYPE. */
1223 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1225 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1226 /* We need an extra zero HWI if CST is an unsigned integer with its
1227 upper bit set, and if CST occupies a whole number of HWIs. */
1228 if (TYPE_UNSIGNED (type
)
1230 && (cst
.get_precision () % HOST_BITS_PER_WIDE_INT
) == 0)
1231 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1232 return cst
.get_len ();
1235 /* Return a new INTEGER_CST with value CST and type TYPE. */
1238 build_new_int_cst (tree type
, const wide_int
&cst
)
1240 unsigned int len
= cst
.get_len ();
1241 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1242 tree nt
= make_int_cst (len
, ext_len
);
1247 TREE_INT_CST_ELT (nt
, ext_len
) = 0;
1248 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1249 TREE_INT_CST_ELT (nt
, i
) = -1;
1251 else if (TYPE_UNSIGNED (type
)
1252 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1255 TREE_INT_CST_ELT (nt
, len
)
1256 = zext_hwi (cst
.elt (len
),
1257 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1260 for (unsigned int i
= 0; i
< len
; i
++)
1261 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1262 TREE_TYPE (nt
) = type
;
1266 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1269 build_int_cst (tree type
, HOST_WIDE_INT low
)
1271 /* Support legacy code. */
1273 type
= integer_type_node
;
1275 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1279 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1281 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1284 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1287 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1290 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1293 /* Constructs tree in type TYPE from with value given by CST. Signedness
1294 of CST is assumed to be the same as the signedness of TYPE. */
1297 double_int_to_tree (tree type
, double_int cst
)
1299 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1302 /* We force the wide_int CST to the range of the type TYPE by sign or
1303 zero extending it. OVERFLOWABLE indicates if we are interested in
1304 overflow of the value, when >0 we are only interested in signed
1305 overflow, for <0 we are interested in any overflow. OVERFLOWED
1306 indicates whether overflow has already occurred. CONST_OVERFLOWED
1307 indicates whether constant overflow has already occurred. We force
1308 T's value to be within range of T's type (by setting to 0 or 1 all
1309 the bits outside the type's range). We set TREE_OVERFLOWED if,
1310 OVERFLOWED is nonzero,
1311 or OVERFLOWABLE is >0 and signed overflow occurs
1312 or OVERFLOWABLE is <0 and any overflow occurs
1313 We return a new tree node for the extended wide_int. The node
1314 is shared if no overflow flags are set. */
1318 force_fit_type (tree type
, const wide_int_ref
&cst
,
1319 int overflowable
, bool overflowed
)
1321 signop sign
= TYPE_SIGN (type
);
1323 /* If we need to set overflow flags, return a new unshared node. */
1324 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1328 || (overflowable
> 0 && sign
== SIGNED
))
1330 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1331 tree t
= build_new_int_cst (type
, tmp
);
1332 TREE_OVERFLOW (t
) = 1;
1337 /* Else build a shared node. */
1338 return wide_int_to_tree (type
, cst
);
1341 /* These are the hash table functions for the hash table of INTEGER_CST
1342 nodes of a sizetype. */
1344 /* Return the hash code code X, an INTEGER_CST. */
1347 int_cst_hasher::hash (tree x
)
1349 const_tree
const t
= x
;
1350 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1353 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1354 code
^= TREE_INT_CST_ELT (t
, i
);
1359 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1360 is the same as that given by *Y, which is the same. */
1363 int_cst_hasher::equal (tree x
, tree y
)
1365 const_tree
const xt
= x
;
1366 const_tree
const yt
= y
;
1368 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1369 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1370 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1373 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1374 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1380 /* Create an INT_CST node of TYPE and value CST.
1381 The returned node is always shared. For small integers we use a
1382 per-type vector cache, for larger ones we use a single hash table.
1383 The value is extended from its precision according to the sign of
1384 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1385 the upper bits and ensures that hashing and value equality based
1386 upon the underlying HOST_WIDE_INTs works without masking. */
1389 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1396 unsigned int prec
= TYPE_PRECISION (type
);
1397 signop sgn
= TYPE_SIGN (type
);
1399 /* Verify that everything is canonical. */
1400 int l
= pcst
.get_len ();
1403 if (pcst
.elt (l
- 1) == 0)
1404 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1405 if (pcst
.elt (l
- 1) == (HOST_WIDE_INT
) -1)
1406 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1409 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1410 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1414 /* We just need to store a single HOST_WIDE_INT. */
1416 if (TYPE_UNSIGNED (type
))
1417 hwi
= cst
.to_uhwi ();
1419 hwi
= cst
.to_shwi ();
1421 switch (TREE_CODE (type
))
1424 gcc_assert (hwi
== 0);
1428 case REFERENCE_TYPE
:
1429 case POINTER_BOUNDS_TYPE
:
1430 /* Cache NULL pointer and zero bounds. */
1439 /* Cache false or true. */
1447 if (TYPE_SIGN (type
) == UNSIGNED
)
1450 limit
= INTEGER_SHARE_LIMIT
;
1451 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1456 /* Cache [-1, N). */
1457 limit
= INTEGER_SHARE_LIMIT
+ 1;
1458 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1472 /* Look for it in the type's vector of small shared ints. */
1473 if (!TYPE_CACHED_VALUES_P (type
))
1475 TYPE_CACHED_VALUES_P (type
) = 1;
1476 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1479 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1481 /* Make sure no one is clobbering the shared constant. */
1482 gcc_checking_assert (TREE_TYPE (t
) == type
1483 && TREE_INT_CST_NUNITS (t
) == 1
1484 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1485 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1486 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1489 /* Create a new shared int. */
1490 t
= build_new_int_cst (type
, cst
);
1491 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1496 /* Use the cache of larger shared ints, using int_cst_node as
1499 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1500 TREE_TYPE (int_cst_node
) = type
;
1502 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1506 /* Insert this one into the hash table. */
1509 /* Make a new node for next time round. */
1510 int_cst_node
= make_int_cst (1, 1);
1516 /* The value either hashes properly or we drop it on the floor
1517 for the gc to take care of. There will not be enough of them
1520 tree nt
= build_new_int_cst (type
, cst
);
1521 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1525 /* Insert this one into the hash table. */
1535 cache_integer_cst (tree t
)
1537 tree type
= TREE_TYPE (t
);
1540 int prec
= TYPE_PRECISION (type
);
1542 gcc_assert (!TREE_OVERFLOW (t
));
1544 switch (TREE_CODE (type
))
1547 gcc_assert (integer_zerop (t
));
1551 case REFERENCE_TYPE
:
1552 /* Cache NULL pointer. */
1553 if (integer_zerop (t
))
1561 /* Cache false or true. */
1563 if (wi::ltu_p (t
, 2))
1564 ix
= TREE_INT_CST_ELT (t
, 0);
1569 if (TYPE_UNSIGNED (type
))
1572 limit
= INTEGER_SHARE_LIMIT
;
1574 /* This is a little hokie, but if the prec is smaller than
1575 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1576 obvious test will not get the correct answer. */
1577 if (prec
< HOST_BITS_PER_WIDE_INT
)
1579 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1580 ix
= tree_to_uhwi (t
);
1582 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1583 ix
= tree_to_uhwi (t
);
1588 limit
= INTEGER_SHARE_LIMIT
+ 1;
1590 if (integer_minus_onep (t
))
1592 else if (!wi::neg_p (t
))
1594 if (prec
< HOST_BITS_PER_WIDE_INT
)
1596 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1597 ix
= tree_to_shwi (t
) + 1;
1599 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1600 ix
= tree_to_shwi (t
) + 1;
1614 /* Look for it in the type's vector of small shared ints. */
1615 if (!TYPE_CACHED_VALUES_P (type
))
1617 TYPE_CACHED_VALUES_P (type
) = 1;
1618 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1621 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1622 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1626 /* Use the cache of larger shared ints. */
1627 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1628 /* If there is already an entry for the number verify it's the
1631 gcc_assert (wi::eq_p (tree (*slot
), t
));
1633 /* Otherwise insert this one into the hash table. */
1639 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1640 and the rest are zeros. */
1643 build_low_bits_mask (tree type
, unsigned bits
)
1645 gcc_assert (bits
<= TYPE_PRECISION (type
));
1647 return wide_int_to_tree (type
, wi::mask (bits
, false,
1648 TYPE_PRECISION (type
)));
1651 /* Checks that X is integer constant that can be expressed in (unsigned)
1652 HOST_WIDE_INT without loss of precision. */
1655 cst_and_fits_in_hwi (const_tree x
)
1657 if (TREE_CODE (x
) != INTEGER_CST
)
1660 if (TYPE_PRECISION (TREE_TYPE (x
)) > HOST_BITS_PER_WIDE_INT
)
1663 return TREE_INT_CST_NUNITS (x
) == 1;
1666 /* Build a newly constructed TREE_VEC node of length LEN. */
1669 make_vector_stat (unsigned len MEM_STAT_DECL
)
1672 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1674 record_node_allocation_statistics (VECTOR_CST
, length
);
1676 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1678 TREE_SET_CODE (t
, VECTOR_CST
);
1679 TREE_CONSTANT (t
) = 1;
1684 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1685 are in a list pointed to by VALS. */
1688 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1692 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1693 TREE_TYPE (v
) = type
;
1695 /* Iterate through elements and check for overflow. */
1696 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1698 tree value
= vals
[cnt
];
1700 VECTOR_CST_ELT (v
, cnt
) = value
;
1702 /* Don't crash if we get an address constant. */
1703 if (!CONSTANT_CLASS_P (value
))
1706 over
|= TREE_OVERFLOW (value
);
1709 TREE_OVERFLOW (v
) = over
;
1713 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1714 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1717 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1719 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1720 unsigned HOST_WIDE_INT idx
;
1723 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1725 for (; idx
< TYPE_VECTOR_SUBPARTS (type
); ++idx
)
1726 vec
[idx
] = build_zero_cst (TREE_TYPE (type
));
1728 return build_vector (type
, vec
);
1731 /* Build a vector of type VECTYPE where all the elements are SCs. */
1733 build_vector_from_val (tree vectype
, tree sc
)
1735 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1737 if (sc
== error_mark_node
)
1740 /* Verify that the vector type is suitable for SC. Note that there
1741 is some inconsistency in the type-system with respect to restrict
1742 qualifications of pointers. Vector types always have a main-variant
1743 element type and the qualification is applied to the vector-type.
1744 So TREE_TYPE (vector-type) does not return a properly qualified
1745 vector element-type. */
1746 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1747 TREE_TYPE (vectype
)));
1749 if (CONSTANT_CLASS_P (sc
))
1751 tree
*v
= XALLOCAVEC (tree
, nunits
);
1752 for (i
= 0; i
< nunits
; ++i
)
1754 return build_vector (vectype
, v
);
1758 vec
<constructor_elt
, va_gc
> *v
;
1759 vec_alloc (v
, nunits
);
1760 for (i
= 0; i
< nunits
; ++i
)
1761 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1762 return build_constructor (vectype
, v
);
1766 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1767 are in the vec pointed to by VALS. */
1769 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1771 tree c
= make_node (CONSTRUCTOR
);
1773 constructor_elt
*elt
;
1774 bool constant_p
= true;
1775 bool side_effects_p
= false;
1777 TREE_TYPE (c
) = type
;
1778 CONSTRUCTOR_ELTS (c
) = vals
;
1780 FOR_EACH_VEC_SAFE_ELT (vals
, i
, elt
)
1782 /* Mostly ctors will have elts that don't have side-effects, so
1783 the usual case is to scan all the elements. Hence a single
1784 loop for both const and side effects, rather than one loop
1785 each (with early outs). */
1786 if (!TREE_CONSTANT (elt
->value
))
1788 if (TREE_SIDE_EFFECTS (elt
->value
))
1789 side_effects_p
= true;
1792 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1793 TREE_CONSTANT (c
) = constant_p
;
1798 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1801 build_constructor_single (tree type
, tree index
, tree value
)
1803 vec
<constructor_elt
, va_gc
> *v
;
1804 constructor_elt elt
= {index
, value
};
1807 v
->quick_push (elt
);
1809 return build_constructor (type
, v
);
1813 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1814 are in a list pointed to by VALS. */
1816 build_constructor_from_list (tree type
, tree vals
)
1819 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1823 vec_alloc (v
, list_length (vals
));
1824 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1825 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1828 return build_constructor (type
, v
);
1831 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1832 of elements, provided as index/value pairs. */
1835 build_constructor_va (tree type
, int nelts
, ...)
1837 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1840 va_start (p
, nelts
);
1841 vec_alloc (v
, nelts
);
1844 tree index
= va_arg (p
, tree
);
1845 tree value
= va_arg (p
, tree
);
1846 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1849 return build_constructor (type
, v
);
1852 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1855 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1858 FIXED_VALUE_TYPE
*fp
;
1860 v
= make_node (FIXED_CST
);
1861 fp
= ggc_alloc
<fixed_value
> ();
1862 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1864 TREE_TYPE (v
) = type
;
1865 TREE_FIXED_CST_PTR (v
) = fp
;
1869 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1872 build_real (tree type
, REAL_VALUE_TYPE d
)
1875 REAL_VALUE_TYPE
*dp
;
1878 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1879 Consider doing it via real_convert now. */
1881 v
= make_node (REAL_CST
);
1882 dp
= ggc_alloc
<real_value
> ();
1883 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1885 TREE_TYPE (v
) = type
;
1886 TREE_REAL_CST_PTR (v
) = dp
;
1887 TREE_OVERFLOW (v
) = overflow
;
1891 /* Return a new REAL_CST node whose type is TYPE
1892 and whose value is the integer value of the INTEGER_CST node I. */
1895 real_value_from_int_cst (const_tree type
, const_tree i
)
1899 /* Clear all bits of the real value type so that we can later do
1900 bitwise comparisons to see if two values are the same. */
1901 memset (&d
, 0, sizeof d
);
1903 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1904 TYPE_SIGN (TREE_TYPE (i
)));
1908 /* Given a tree representing an integer constant I, return a tree
1909 representing the same value as a floating-point constant of type TYPE. */
1912 build_real_from_int_cst (tree type
, const_tree i
)
1915 int overflow
= TREE_OVERFLOW (i
);
1917 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1919 TREE_OVERFLOW (v
) |= overflow
;
1923 /* Return a newly constructed STRING_CST node whose value is
1924 the LEN characters at STR.
1925 Note that for a C string literal, LEN should include the trailing NUL.
1926 The TREE_TYPE is not initialized. */
1929 build_string (int len
, const char *str
)
1934 /* Do not waste bytes provided by padding of struct tree_string. */
1935 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1937 record_node_allocation_statistics (STRING_CST
, length
);
1939 s
= (tree
) ggc_internal_alloc (length
);
1941 memset (s
, 0, sizeof (struct tree_typed
));
1942 TREE_SET_CODE (s
, STRING_CST
);
1943 TREE_CONSTANT (s
) = 1;
1944 TREE_STRING_LENGTH (s
) = len
;
1945 memcpy (s
->string
.str
, str
, len
);
1946 s
->string
.str
[len
] = '\0';
1951 /* Return a newly constructed COMPLEX_CST node whose value is
1952 specified by the real and imaginary parts REAL and IMAG.
1953 Both REAL and IMAG should be constant nodes. TYPE, if specified,
1954 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
1957 build_complex (tree type
, tree real
, tree imag
)
1959 tree t
= make_node (COMPLEX_CST
);
1961 TREE_REALPART (t
) = real
;
1962 TREE_IMAGPART (t
) = imag
;
1963 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
1964 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
1968 /* Return a constant of arithmetic type TYPE which is the
1969 multiplicative identity of the set TYPE. */
1972 build_one_cst (tree type
)
1974 switch (TREE_CODE (type
))
1976 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
1977 case POINTER_TYPE
: case REFERENCE_TYPE
:
1979 return build_int_cst (type
, 1);
1982 return build_real (type
, dconst1
);
1984 case FIXED_POINT_TYPE
:
1985 /* We can only generate 1 for accum types. */
1986 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
1987 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
1991 tree scalar
= build_one_cst (TREE_TYPE (type
));
1993 return build_vector_from_val (type
, scalar
);
1997 return build_complex (type
,
1998 build_one_cst (TREE_TYPE (type
)),
1999 build_zero_cst (TREE_TYPE (type
)));
2006 /* Return an integer of type TYPE containing all 1's in as much precision as
2007 it contains, or a complex or vector whose subparts are such integers. */
2010 build_all_ones_cst (tree type
)
2012 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2014 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2015 return build_complex (type
, scalar
, scalar
);
2018 return build_minus_one_cst (type
);
2021 /* Return a constant of arithmetic type TYPE which is the
2022 opposite of the multiplicative identity of the set TYPE. */
2025 build_minus_one_cst (tree type
)
2027 switch (TREE_CODE (type
))
2029 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2030 case POINTER_TYPE
: case REFERENCE_TYPE
:
2032 return build_int_cst (type
, -1);
2035 return build_real (type
, dconstm1
);
2037 case FIXED_POINT_TYPE
:
2038 /* We can only generate 1 for accum types. */
2039 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2040 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2045 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2047 return build_vector_from_val (type
, scalar
);
2051 return build_complex (type
,
2052 build_minus_one_cst (TREE_TYPE (type
)),
2053 build_zero_cst (TREE_TYPE (type
)));
2060 /* Build 0 constant of type TYPE. This is used by constructor folding
2061 and thus the constant should be represented in memory by
2065 build_zero_cst (tree type
)
2067 switch (TREE_CODE (type
))
2069 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2070 case POINTER_TYPE
: case REFERENCE_TYPE
:
2071 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2072 return build_int_cst (type
, 0);
2075 return build_real (type
, dconst0
);
2077 case FIXED_POINT_TYPE
:
2078 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2082 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2084 return build_vector_from_val (type
, scalar
);
2089 tree zero
= build_zero_cst (TREE_TYPE (type
));
2091 return build_complex (type
, zero
, zero
);
2095 if (!AGGREGATE_TYPE_P (type
))
2096 return fold_convert (type
, integer_zero_node
);
2097 return build_constructor (type
, NULL
);
2102 /* Build a BINFO with LEN language slots. */
2105 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2108 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2109 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2111 record_node_allocation_statistics (TREE_BINFO
, length
);
2113 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2115 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2117 TREE_SET_CODE (t
, TREE_BINFO
);
2119 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2124 /* Create a CASE_LABEL_EXPR tree node and return it. */
2127 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2129 tree t
= make_node (CASE_LABEL_EXPR
);
2131 TREE_TYPE (t
) = void_type_node
;
2132 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2134 CASE_LOW (t
) = low_value
;
2135 CASE_HIGH (t
) = high_value
;
2136 CASE_LABEL (t
) = label_decl
;
2137 CASE_CHAIN (t
) = NULL_TREE
;
2142 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2143 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2144 The latter determines the length of the HOST_WIDE_INT vector. */
2147 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2150 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2151 + sizeof (struct tree_int_cst
));
2154 record_node_allocation_statistics (INTEGER_CST
, length
);
2156 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2158 TREE_SET_CODE (t
, INTEGER_CST
);
2159 TREE_INT_CST_NUNITS (t
) = len
;
2160 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2161 /* to_offset can only be applied to trees that are offset_int-sized
2162 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2163 must be exactly the precision of offset_int and so LEN is correct. */
2164 if (ext_len
<= OFFSET_INT_ELTS
)
2165 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2167 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2169 TREE_CONSTANT (t
) = 1;
2174 /* Build a newly constructed TREE_VEC node of length LEN. */
2177 make_tree_vec_stat (int len MEM_STAT_DECL
)
2180 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2182 record_node_allocation_statistics (TREE_VEC
, length
);
2184 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2186 TREE_SET_CODE (t
, TREE_VEC
);
2187 TREE_VEC_LENGTH (t
) = len
;
2192 /* Grow a TREE_VEC node to new length LEN. */
2195 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2197 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2199 int oldlen
= TREE_VEC_LENGTH (v
);
2200 gcc_assert (len
> oldlen
);
2202 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2203 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2205 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2207 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2209 TREE_VEC_LENGTH (v
) = len
;
2214 /* Return 1 if EXPR is the integer constant zero or a complex constant
2218 integer_zerop (const_tree expr
)
2222 switch (TREE_CODE (expr
))
2225 return wi::eq_p (expr
, 0);
2227 return (integer_zerop (TREE_REALPART (expr
))
2228 && integer_zerop (TREE_IMAGPART (expr
)));
2232 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2233 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2242 /* Return 1 if EXPR is the integer constant one or the corresponding
2243 complex constant. */
2246 integer_onep (const_tree expr
)
2250 switch (TREE_CODE (expr
))
2253 return wi::eq_p (wi::to_widest (expr
), 1);
2255 return (integer_onep (TREE_REALPART (expr
))
2256 && integer_zerop (TREE_IMAGPART (expr
)));
2260 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2261 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2270 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2271 return 1 if every piece is the integer constant one. */
2274 integer_each_onep (const_tree expr
)
2278 if (TREE_CODE (expr
) == COMPLEX_CST
)
2279 return (integer_onep (TREE_REALPART (expr
))
2280 && integer_onep (TREE_IMAGPART (expr
)));
2282 return integer_onep (expr
);
2285 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2286 it contains, or a complex or vector whose subparts are such integers. */
2289 integer_all_onesp (const_tree expr
)
2293 if (TREE_CODE (expr
) == COMPLEX_CST
2294 && integer_all_onesp (TREE_REALPART (expr
))
2295 && integer_all_onesp (TREE_IMAGPART (expr
)))
2298 else if (TREE_CODE (expr
) == VECTOR_CST
)
2301 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2302 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2307 else if (TREE_CODE (expr
) != INTEGER_CST
)
2310 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2313 /* Return 1 if EXPR is the integer constant minus one. */
2316 integer_minus_onep (const_tree expr
)
2320 if (TREE_CODE (expr
) == COMPLEX_CST
)
2321 return (integer_all_onesp (TREE_REALPART (expr
))
2322 && integer_zerop (TREE_IMAGPART (expr
)));
2324 return integer_all_onesp (expr
);
2327 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2331 integer_pow2p (const_tree expr
)
2335 if (TREE_CODE (expr
) == COMPLEX_CST
2336 && integer_pow2p (TREE_REALPART (expr
))
2337 && integer_zerop (TREE_IMAGPART (expr
)))
2340 if (TREE_CODE (expr
) != INTEGER_CST
)
2343 return wi::popcount (expr
) == 1;
2346 /* Return 1 if EXPR is an integer constant other than zero or a
2347 complex constant other than zero. */
2350 integer_nonzerop (const_tree expr
)
2354 return ((TREE_CODE (expr
) == INTEGER_CST
2355 && !wi::eq_p (expr
, 0))
2356 || (TREE_CODE (expr
) == COMPLEX_CST
2357 && (integer_nonzerop (TREE_REALPART (expr
))
2358 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2361 /* Return 1 if EXPR is the integer constant one. For vector,
2362 return 1 if every piece is the integer constant minus one
2363 (representing the value TRUE). */
2366 integer_truep (const_tree expr
)
2370 if (TREE_CODE (expr
) == VECTOR_CST
)
2371 return integer_all_onesp (expr
);
2372 return integer_onep (expr
);
2375 /* Return 1 if EXPR is the fixed-point constant zero. */
2378 fixed_zerop (const_tree expr
)
2380 return (TREE_CODE (expr
) == FIXED_CST
2381 && TREE_FIXED_CST (expr
).data
.is_zero ());
2384 /* Return the power of two represented by a tree node known to be a
2388 tree_log2 (const_tree expr
)
2392 if (TREE_CODE (expr
) == COMPLEX_CST
)
2393 return tree_log2 (TREE_REALPART (expr
));
2395 return wi::exact_log2 (expr
);
2398 /* Similar, but return the largest integer Y such that 2 ** Y is less
2399 than or equal to EXPR. */
2402 tree_floor_log2 (const_tree expr
)
2406 if (TREE_CODE (expr
) == COMPLEX_CST
)
2407 return tree_log2 (TREE_REALPART (expr
));
2409 return wi::floor_log2 (expr
);
2412 /* Return number of known trailing zero bits in EXPR, or, if the value of
2413 EXPR is known to be zero, the precision of it's type. */
2416 tree_ctz (const_tree expr
)
2418 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2419 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2422 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2423 switch (TREE_CODE (expr
))
2426 ret1
= wi::ctz (expr
);
2427 return MIN (ret1
, prec
);
2429 ret1
= wi::ctz (get_nonzero_bits (expr
));
2430 return MIN (ret1
, prec
);
2437 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2440 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2441 return MIN (ret1
, ret2
);
2442 case POINTER_PLUS_EXPR
:
2443 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2444 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2445 /* Second operand is sizetype, which could be in theory
2446 wider than pointer's precision. Make sure we never
2447 return more than prec. */
2448 ret2
= MIN (ret2
, prec
);
2449 return MIN (ret1
, ret2
);
2451 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2452 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2453 return MAX (ret1
, ret2
);
2455 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2456 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2457 return MIN (ret1
+ ret2
, prec
);
2459 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2460 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2461 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2463 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2464 return MIN (ret1
+ ret2
, prec
);
2468 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2469 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2471 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2472 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2477 case TRUNC_DIV_EXPR
:
2479 case FLOOR_DIV_EXPR
:
2480 case ROUND_DIV_EXPR
:
2481 case EXACT_DIV_EXPR
:
2482 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2483 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2485 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2488 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2496 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2497 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2499 return MIN (ret1
, prec
);
2501 return tree_ctz (TREE_OPERAND (expr
, 0));
2503 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2506 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2507 return MIN (ret1
, ret2
);
2509 return tree_ctz (TREE_OPERAND (expr
, 1));
2511 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2512 if (ret1
> BITS_PER_UNIT
)
2514 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2515 return MIN (ret1
, prec
);
2523 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2524 decimal float constants, so don't return 1 for them. */
2527 real_zerop (const_tree expr
)
2531 switch (TREE_CODE (expr
))
2534 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst0
)
2535 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2537 return real_zerop (TREE_REALPART (expr
))
2538 && real_zerop (TREE_IMAGPART (expr
));
2542 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2543 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2552 /* Return 1 if EXPR is the real constant one in real or complex form.
2553 Trailing zeroes matter for decimal float constants, so don't return
2557 real_onep (const_tree expr
)
2561 switch (TREE_CODE (expr
))
2564 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconst1
)
2565 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2567 return real_onep (TREE_REALPART (expr
))
2568 && real_zerop (TREE_IMAGPART (expr
));
2572 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2573 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2582 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2583 matter for decimal float constants, so don't return 1 for them. */
2586 real_minus_onep (const_tree expr
)
2590 switch (TREE_CODE (expr
))
2593 return REAL_VALUES_EQUAL (TREE_REAL_CST (expr
), dconstm1
)
2594 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2596 return real_minus_onep (TREE_REALPART (expr
))
2597 && real_zerop (TREE_IMAGPART (expr
));
2601 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2602 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2611 /* Nonzero if EXP is a constant or a cast of a constant. */
2614 really_constant_p (const_tree exp
)
2616 /* This is not quite the same as STRIP_NOPS. It does more. */
2617 while (CONVERT_EXPR_P (exp
)
2618 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2619 exp
= TREE_OPERAND (exp
, 0);
2620 return TREE_CONSTANT (exp
);
2623 /* Return first list element whose TREE_VALUE is ELEM.
2624 Return 0 if ELEM is not in LIST. */
2627 value_member (tree elem
, tree list
)
2631 if (elem
== TREE_VALUE (list
))
2633 list
= TREE_CHAIN (list
);
2638 /* Return first list element whose TREE_PURPOSE is ELEM.
2639 Return 0 if ELEM is not in LIST. */
2642 purpose_member (const_tree elem
, tree list
)
2646 if (elem
== TREE_PURPOSE (list
))
2648 list
= TREE_CHAIN (list
);
2653 /* Return true if ELEM is in V. */
2656 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2660 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2666 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2670 chain_index (int idx
, tree chain
)
2672 for (; chain
&& idx
> 0; --idx
)
2673 chain
= TREE_CHAIN (chain
);
2677 /* Return nonzero if ELEM is part of the chain CHAIN. */
2680 chain_member (const_tree elem
, const_tree chain
)
2686 chain
= DECL_CHAIN (chain
);
2692 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2693 We expect a null pointer to mark the end of the chain.
2694 This is the Lisp primitive `length'. */
2697 list_length (const_tree t
)
2700 #ifdef ENABLE_TREE_CHECKING
2708 #ifdef ENABLE_TREE_CHECKING
2711 gcc_assert (p
!= q
);
2719 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2720 UNION_TYPE TYPE, or NULL_TREE if none. */
2723 first_field (const_tree type
)
2725 tree t
= TYPE_FIELDS (type
);
2726 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2731 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2732 by modifying the last node in chain 1 to point to chain 2.
2733 This is the Lisp primitive `nconc'. */
2736 chainon (tree op1
, tree op2
)
2745 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2747 TREE_CHAIN (t1
) = op2
;
2749 #ifdef ENABLE_TREE_CHECKING
2752 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2753 gcc_assert (t2
!= t1
);
2760 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2763 tree_last (tree chain
)
2767 while ((next
= TREE_CHAIN (chain
)))
2772 /* Reverse the order of elements in the chain T,
2773 and return the new head of the chain (old last element). */
2778 tree prev
= 0, decl
, next
;
2779 for (decl
= t
; decl
; decl
= next
)
2781 /* We shouldn't be using this function to reverse BLOCK chains; we
2782 have blocks_nreverse for that. */
2783 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2784 next
= TREE_CHAIN (decl
);
2785 TREE_CHAIN (decl
) = prev
;
2791 /* Return a newly created TREE_LIST node whose
2792 purpose and value fields are PARM and VALUE. */
2795 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2797 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2798 TREE_PURPOSE (t
) = parm
;
2799 TREE_VALUE (t
) = value
;
2803 /* Build a chain of TREE_LIST nodes from a vector. */
2806 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2808 tree ret
= NULL_TREE
;
2812 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2814 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2815 pp
= &TREE_CHAIN (*pp
);
2820 /* Return a newly created TREE_LIST node whose
2821 purpose and value fields are PURPOSE and VALUE
2822 and whose TREE_CHAIN is CHAIN. */
2825 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2829 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2830 memset (node
, 0, sizeof (struct tree_common
));
2832 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2834 TREE_SET_CODE (node
, TREE_LIST
);
2835 TREE_CHAIN (node
) = chain
;
2836 TREE_PURPOSE (node
) = purpose
;
2837 TREE_VALUE (node
) = value
;
2841 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2845 ctor_to_vec (tree ctor
)
2847 vec
<tree
, va_gc
> *vec
;
2848 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2852 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2853 vec
->quick_push (val
);
2858 /* Return the size nominally occupied by an object of type TYPE
2859 when it resides in memory. The value is measured in units of bytes,
2860 and its data type is that normally used for type sizes
2861 (which is the first type created by make_signed_type or
2862 make_unsigned_type). */
2865 size_in_bytes (const_tree type
)
2869 if (type
== error_mark_node
)
2870 return integer_zero_node
;
2872 type
= TYPE_MAIN_VARIANT (type
);
2873 t
= TYPE_SIZE_UNIT (type
);
2877 lang_hooks
.types
.incomplete_type_error (NULL_TREE
, type
);
2878 return size_zero_node
;
2884 /* Return the size of TYPE (in bytes) as a wide integer
2885 or return -1 if the size can vary or is larger than an integer. */
2888 int_size_in_bytes (const_tree type
)
2892 if (type
== error_mark_node
)
2895 type
= TYPE_MAIN_VARIANT (type
);
2896 t
= TYPE_SIZE_UNIT (type
);
2898 if (t
&& tree_fits_uhwi_p (t
))
2899 return TREE_INT_CST_LOW (t
);
2904 /* Return the maximum size of TYPE (in bytes) as a wide integer
2905 or return -1 if the size can vary or is larger than an integer. */
2908 max_int_size_in_bytes (const_tree type
)
2910 HOST_WIDE_INT size
= -1;
2913 /* If this is an array type, check for a possible MAX_SIZE attached. */
2915 if (TREE_CODE (type
) == ARRAY_TYPE
)
2917 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2919 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2920 size
= tree_to_uhwi (size_tree
);
2923 /* If we still haven't been able to get a size, see if the language
2924 can compute a maximum size. */
2928 size_tree
= lang_hooks
.types
.max_size (type
);
2930 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2931 size
= tree_to_uhwi (size_tree
);
2937 /* Return the bit position of FIELD, in bits from the start of the record.
2938 This is a tree of type bitsizetype. */
2941 bit_position (const_tree field
)
2943 return bit_from_pos (DECL_FIELD_OFFSET (field
),
2944 DECL_FIELD_BIT_OFFSET (field
));
2947 /* Return the byte position of FIELD, in bytes from the start of the record.
2948 This is a tree of type sizetype. */
2951 byte_position (const_tree field
)
2953 return byte_from_pos (DECL_FIELD_OFFSET (field
),
2954 DECL_FIELD_BIT_OFFSET (field
));
2957 /* Likewise, but return as an integer. It must be representable in
2958 that way (since it could be a signed value, we don't have the
2959 option of returning -1 like int_size_in_byte can. */
2962 int_byte_position (const_tree field
)
2964 return tree_to_shwi (byte_position (field
));
2967 /* Return the strictest alignment, in bits, that T is known to have. */
2970 expr_align (const_tree t
)
2972 unsigned int align0
, align1
;
2974 switch (TREE_CODE (t
))
2976 CASE_CONVERT
: case NON_LVALUE_EXPR
:
2977 /* If we have conversions, we know that the alignment of the
2978 object must meet each of the alignments of the types. */
2979 align0
= expr_align (TREE_OPERAND (t
, 0));
2980 align1
= TYPE_ALIGN (TREE_TYPE (t
));
2981 return MAX (align0
, align1
);
2983 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
2984 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
2985 case CLEANUP_POINT_EXPR
:
2986 /* These don't change the alignment of an object. */
2987 return expr_align (TREE_OPERAND (t
, 0));
2990 /* The best we can do is say that the alignment is the least aligned
2992 align0
= expr_align (TREE_OPERAND (t
, 1));
2993 align1
= expr_align (TREE_OPERAND (t
, 2));
2994 return MIN (align0
, align1
);
2996 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
2997 meaningfully, it's always 1. */
2998 case LABEL_DECL
: case CONST_DECL
:
2999 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3001 gcc_assert (DECL_ALIGN (t
) != 0);
3002 return DECL_ALIGN (t
);
3008 /* Otherwise take the alignment from that of the type. */
3009 return TYPE_ALIGN (TREE_TYPE (t
));
3012 /* Return, as a tree node, the number of elements for TYPE (which is an
3013 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3016 array_type_nelts (const_tree type
)
3018 tree index_type
, min
, max
;
3020 /* If they did it with unspecified bounds, then we should have already
3021 given an error about it before we got here. */
3022 if (! TYPE_DOMAIN (type
))
3023 return error_mark_node
;
3025 index_type
= TYPE_DOMAIN (type
);
3026 min
= TYPE_MIN_VALUE (index_type
);
3027 max
= TYPE_MAX_VALUE (index_type
);
3029 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3031 return error_mark_node
;
3033 return (integer_zerop (min
)
3035 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3038 /* If arg is static -- a reference to an object in static storage -- then
3039 return the object. This is not the same as the C meaning of `static'.
3040 If arg isn't static, return NULL. */
3045 switch (TREE_CODE (arg
))
3048 /* Nested functions are static, even though taking their address will
3049 involve a trampoline as we unnest the nested function and create
3050 the trampoline on the tree level. */
3054 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3055 && ! DECL_THREAD_LOCAL_P (arg
)
3056 && ! DECL_DLLIMPORT_P (arg
)
3060 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3064 return TREE_STATIC (arg
) ? arg
: NULL
;
3071 /* If the thing being referenced is not a field, then it is
3072 something language specific. */
3073 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3075 /* If we are referencing a bitfield, we can't evaluate an
3076 ADDR_EXPR at compile time and so it isn't a constant. */
3077 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3080 return staticp (TREE_OPERAND (arg
, 0));
3086 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3089 case ARRAY_RANGE_REF
:
3090 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3091 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3092 return staticp (TREE_OPERAND (arg
, 0));
3096 case COMPOUND_LITERAL_EXPR
:
3097 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3107 /* Return whether OP is a DECL whose address is function-invariant. */
3110 decl_address_invariant_p (const_tree op
)
3112 /* The conditions below are slightly less strict than the one in
3115 switch (TREE_CODE (op
))
3124 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3125 || DECL_THREAD_LOCAL_P (op
)
3126 || DECL_CONTEXT (op
) == current_function_decl
3127 || decl_function_context (op
) == current_function_decl
)
3132 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3133 || decl_function_context (op
) == current_function_decl
)
3144 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3147 decl_address_ip_invariant_p (const_tree op
)
3149 /* The conditions below are slightly less strict than the one in
3152 switch (TREE_CODE (op
))
3160 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3161 && !DECL_DLLIMPORT_P (op
))
3162 || DECL_THREAD_LOCAL_P (op
))
3167 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3179 /* Return true if T is function-invariant (internal function, does
3180 not handle arithmetic; that's handled in skip_simple_arithmetic and
3181 tree_invariant_p). */
3183 static bool tree_invariant_p (tree t
);
3186 tree_invariant_p_1 (tree t
)
3190 if (TREE_CONSTANT (t
)
3191 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3194 switch (TREE_CODE (t
))
3200 op
= TREE_OPERAND (t
, 0);
3201 while (handled_component_p (op
))
3203 switch (TREE_CODE (op
))
3206 case ARRAY_RANGE_REF
:
3207 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3208 || TREE_OPERAND (op
, 2) != NULL_TREE
3209 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3214 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3220 op
= TREE_OPERAND (op
, 0);
3223 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3232 /* Return true if T is function-invariant. */
3235 tree_invariant_p (tree t
)
3237 tree inner
= skip_simple_arithmetic (t
);
3238 return tree_invariant_p_1 (inner
);
3241 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3242 Do this to any expression which may be used in more than one place,
3243 but must be evaluated only once.
3245 Normally, expand_expr would reevaluate the expression each time.
3246 Calling save_expr produces something that is evaluated and recorded
3247 the first time expand_expr is called on it. Subsequent calls to
3248 expand_expr just reuse the recorded value.
3250 The call to expand_expr that generates code that actually computes
3251 the value is the first call *at compile time*. Subsequent calls
3252 *at compile time* generate code to use the saved value.
3253 This produces correct result provided that *at run time* control
3254 always flows through the insns made by the first expand_expr
3255 before reaching the other places where the save_expr was evaluated.
3256 You, the caller of save_expr, must make sure this is so.
3258 Constants, and certain read-only nodes, are returned with no
3259 SAVE_EXPR because that is safe. Expressions containing placeholders
3260 are not touched; see tree.def for an explanation of what these
3264 save_expr (tree expr
)
3266 tree t
= fold (expr
);
3269 /* If the tree evaluates to a constant, then we don't want to hide that
3270 fact (i.e. this allows further folding, and direct checks for constants).
3271 However, a read-only object that has side effects cannot be bypassed.
3272 Since it is no problem to reevaluate literals, we just return the
3274 inner
= skip_simple_arithmetic (t
);
3275 if (TREE_CODE (inner
) == ERROR_MARK
)
3278 if (tree_invariant_p_1 (inner
))
3281 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3282 it means that the size or offset of some field of an object depends on
3283 the value within another field.
3285 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3286 and some variable since it would then need to be both evaluated once and
3287 evaluated more than once. Front-ends must assure this case cannot
3288 happen by surrounding any such subexpressions in their own SAVE_EXPR
3289 and forcing evaluation at the proper time. */
3290 if (contains_placeholder_p (inner
))
3293 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3294 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3296 /* This expression might be placed ahead of a jump to ensure that the
3297 value was computed on both sides of the jump. So make sure it isn't
3298 eliminated as dead. */
3299 TREE_SIDE_EFFECTS (t
) = 1;
3303 /* Look inside EXPR into any simple arithmetic operations. Return the
3304 outermost non-arithmetic or non-invariant node. */
3307 skip_simple_arithmetic (tree expr
)
3309 /* We don't care about whether this can be used as an lvalue in this
3311 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3312 expr
= TREE_OPERAND (expr
, 0);
3314 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3315 a constant, it will be more efficient to not make another SAVE_EXPR since
3316 it will allow better simplification and GCSE will be able to merge the
3317 computations if they actually occur. */
3320 if (UNARY_CLASS_P (expr
))
3321 expr
= TREE_OPERAND (expr
, 0);
3322 else if (BINARY_CLASS_P (expr
))
3324 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3325 expr
= TREE_OPERAND (expr
, 0);
3326 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3327 expr
= TREE_OPERAND (expr
, 1);
3338 /* Look inside EXPR into simple arithmetic operations involving constants.
3339 Return the outermost non-arithmetic or non-constant node. */
3342 skip_simple_constant_arithmetic (tree expr
)
3344 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3345 expr
= TREE_OPERAND (expr
, 0);
3349 if (UNARY_CLASS_P (expr
))
3350 expr
= TREE_OPERAND (expr
, 0);
3351 else if (BINARY_CLASS_P (expr
))
3353 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3354 expr
= TREE_OPERAND (expr
, 0);
3355 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3356 expr
= TREE_OPERAND (expr
, 1);
3367 /* Return which tree structure is used by T. */
3369 enum tree_node_structure_enum
3370 tree_node_structure (const_tree t
)
3372 const enum tree_code code
= TREE_CODE (t
);
3373 return tree_node_structure_for_code (code
);
3376 /* Set various status flags when building a CALL_EXPR object T. */
3379 process_call_operands (tree t
)
3381 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3382 bool read_only
= false;
3383 int i
= call_expr_flags (t
);
3385 /* Calls have side-effects, except those to const or pure functions. */
3386 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3387 side_effects
= true;
3388 /* Propagate TREE_READONLY of arguments for const functions. */
3392 if (!side_effects
|| read_only
)
3393 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3395 tree op
= TREE_OPERAND (t
, i
);
3396 if (op
&& TREE_SIDE_EFFECTS (op
))
3397 side_effects
= true;
3398 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3402 TREE_SIDE_EFFECTS (t
) = side_effects
;
3403 TREE_READONLY (t
) = read_only
;
3406 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3407 size or offset that depends on a field within a record. */
3410 contains_placeholder_p (const_tree exp
)
3412 enum tree_code code
;
3417 code
= TREE_CODE (exp
);
3418 if (code
== PLACEHOLDER_EXPR
)
3421 switch (TREE_CODE_CLASS (code
))
3424 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3425 position computations since they will be converted into a
3426 WITH_RECORD_EXPR involving the reference, which will assume
3427 here will be valid. */
3428 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3430 case tcc_exceptional
:
3431 if (code
== TREE_LIST
)
3432 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3433 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3438 case tcc_comparison
:
3439 case tcc_expression
:
3443 /* Ignoring the first operand isn't quite right, but works best. */
3444 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3447 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3448 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3449 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3452 /* The save_expr function never wraps anything containing
3453 a PLACEHOLDER_EXPR. */
3460 switch (TREE_CODE_LENGTH (code
))
3463 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3465 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3466 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3477 const_call_expr_arg_iterator iter
;
3478 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3479 if (CONTAINS_PLACEHOLDER_P (arg
))
3493 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3494 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3498 type_contains_placeholder_1 (const_tree type
)
3500 /* If the size contains a placeholder or the parent type (component type in
3501 the case of arrays) type involves a placeholder, this type does. */
3502 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3503 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3504 || (!POINTER_TYPE_P (type
)
3506 && type_contains_placeholder_p (TREE_TYPE (type
))))
3509 /* Now do type-specific checks. Note that the last part of the check above
3510 greatly limits what we have to do below. */
3511 switch (TREE_CODE (type
))
3514 case POINTER_BOUNDS_TYPE
:
3520 case REFERENCE_TYPE
:
3529 case FIXED_POINT_TYPE
:
3530 /* Here we just check the bounds. */
3531 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3532 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3535 /* We have already checked the component type above, so just check the
3537 return type_contains_placeholder_p (TYPE_DOMAIN (type
));
3541 case QUAL_UNION_TYPE
:
3545 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3546 if (TREE_CODE (field
) == FIELD_DECL
3547 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3548 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3549 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3550 || type_contains_placeholder_p (TREE_TYPE (field
))))
3561 /* Wrapper around above function used to cache its result. */
3564 type_contains_placeholder_p (tree type
)
3568 /* If the contains_placeholder_bits field has been initialized,
3569 then we know the answer. */
3570 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3571 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3573 /* Indicate that we've seen this type node, and the answer is false.
3574 This is what we want to return if we run into recursion via fields. */
3575 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3577 /* Compute the real value. */
3578 result
= type_contains_placeholder_1 (type
);
3580 /* Store the real value. */
3581 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3586 /* Push tree EXP onto vector QUEUE if it is not already present. */
3589 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3594 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3595 if (simple_cst_equal (iter
, exp
) == 1)
3599 queue
->safe_push (exp
);
3602 /* Given a tree EXP, find all occurrences of references to fields
3603 in a PLACEHOLDER_EXPR and place them in vector REFS without
3604 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3605 we assume here that EXP contains only arithmetic expressions
3606 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3610 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3612 enum tree_code code
= TREE_CODE (exp
);
3616 /* We handle TREE_LIST and COMPONENT_REF separately. */
3617 if (code
== TREE_LIST
)
3619 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3620 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3622 else if (code
== COMPONENT_REF
)
3624 for (inner
= TREE_OPERAND (exp
, 0);
3625 REFERENCE_CLASS_P (inner
);
3626 inner
= TREE_OPERAND (inner
, 0))
3629 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3630 push_without_duplicates (exp
, refs
);
3632 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3635 switch (TREE_CODE_CLASS (code
))
3640 case tcc_declaration
:
3641 /* Variables allocated to static storage can stay. */
3642 if (!TREE_STATIC (exp
))
3643 push_without_duplicates (exp
, refs
);
3646 case tcc_expression
:
3647 /* This is the pattern built in ada/make_aligning_type. */
3648 if (code
== ADDR_EXPR
3649 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3651 push_without_duplicates (exp
, refs
);
3655 /* Fall through... */
3657 case tcc_exceptional
:
3660 case tcc_comparison
:
3662 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3663 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3667 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3668 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3676 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3677 return a tree with all occurrences of references to F in a
3678 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3679 CONST_DECLs. Note that we assume here that EXP contains only
3680 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3681 occurring only in their argument list. */
3684 substitute_in_expr (tree exp
, tree f
, tree r
)
3686 enum tree_code code
= TREE_CODE (exp
);
3687 tree op0
, op1
, op2
, op3
;
3690 /* We handle TREE_LIST and COMPONENT_REF separately. */
3691 if (code
== TREE_LIST
)
3693 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3694 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3695 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3698 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3700 else if (code
== COMPONENT_REF
)
3704 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3705 and it is the right field, replace it with R. */
3706 for (inner
= TREE_OPERAND (exp
, 0);
3707 REFERENCE_CLASS_P (inner
);
3708 inner
= TREE_OPERAND (inner
, 0))
3712 op1
= TREE_OPERAND (exp
, 1);
3714 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3717 /* If this expression hasn't been completed let, leave it alone. */
3718 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3721 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3722 if (op0
== TREE_OPERAND (exp
, 0))
3726 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3729 switch (TREE_CODE_CLASS (code
))
3734 case tcc_declaration
:
3740 case tcc_expression
:
3744 /* Fall through... */
3746 case tcc_exceptional
:
3749 case tcc_comparison
:
3751 switch (TREE_CODE_LENGTH (code
))
3757 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3758 if (op0
== TREE_OPERAND (exp
, 0))
3761 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3765 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3766 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3768 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3771 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3775 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3776 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3777 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3779 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3780 && op2
== TREE_OPERAND (exp
, 2))
3783 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3787 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3788 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3789 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3790 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3792 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3793 && op2
== TREE_OPERAND (exp
, 2)
3794 && op3
== TREE_OPERAND (exp
, 3))
3798 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3810 new_tree
= NULL_TREE
;
3812 /* If we are trying to replace F with a constant, inline back
3813 functions which do nothing else than computing a value from
3814 the arguments they are passed. This makes it possible to
3815 fold partially or entirely the replacement expression. */
3816 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3818 tree t
= maybe_inline_call_in_expr (exp
);
3820 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3823 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3825 tree op
= TREE_OPERAND (exp
, i
);
3826 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3830 new_tree
= copy_node (exp
);
3831 TREE_OPERAND (new_tree
, i
) = new_op
;
3837 new_tree
= fold (new_tree
);
3838 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3839 process_call_operands (new_tree
);
3850 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3852 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3853 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3858 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3859 for it within OBJ, a tree that is an object or a chain of references. */
3862 substitute_placeholder_in_expr (tree exp
, tree obj
)
3864 enum tree_code code
= TREE_CODE (exp
);
3865 tree op0
, op1
, op2
, op3
;
3868 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3869 in the chain of OBJ. */
3870 if (code
== PLACEHOLDER_EXPR
)
3872 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3875 for (elt
= obj
; elt
!= 0;
3876 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3877 || TREE_CODE (elt
) == COND_EXPR
)
3878 ? TREE_OPERAND (elt
, 1)
3879 : (REFERENCE_CLASS_P (elt
)
3880 || UNARY_CLASS_P (elt
)
3881 || BINARY_CLASS_P (elt
)
3882 || VL_EXP_CLASS_P (elt
)
3883 || EXPRESSION_CLASS_P (elt
))
3884 ? TREE_OPERAND (elt
, 0) : 0))
3885 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3888 for (elt
= obj
; elt
!= 0;
3889 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3890 || TREE_CODE (elt
) == COND_EXPR
)
3891 ? TREE_OPERAND (elt
, 1)
3892 : (REFERENCE_CLASS_P (elt
)
3893 || UNARY_CLASS_P (elt
)
3894 || BINARY_CLASS_P (elt
)
3895 || VL_EXP_CLASS_P (elt
)
3896 || EXPRESSION_CLASS_P (elt
))
3897 ? TREE_OPERAND (elt
, 0) : 0))
3898 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3899 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3901 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3903 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3904 survives until RTL generation, there will be an error. */
3908 /* TREE_LIST is special because we need to look at TREE_VALUE
3909 and TREE_CHAIN, not TREE_OPERANDS. */
3910 else if (code
== TREE_LIST
)
3912 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3913 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3914 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3917 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3920 switch (TREE_CODE_CLASS (code
))
3923 case tcc_declaration
:
3926 case tcc_exceptional
:
3929 case tcc_comparison
:
3930 case tcc_expression
:
3933 switch (TREE_CODE_LENGTH (code
))
3939 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3940 if (op0
== TREE_OPERAND (exp
, 0))
3943 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3947 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3948 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3950 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3953 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3957 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3958 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3959 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3961 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3962 && op2
== TREE_OPERAND (exp
, 2))
3965 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3969 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
3970 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
3971 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
3972 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
3974 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3975 && op2
== TREE_OPERAND (exp
, 2)
3976 && op3
== TREE_OPERAND (exp
, 3))
3980 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3992 new_tree
= NULL_TREE
;
3994 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3996 tree op
= TREE_OPERAND (exp
, i
);
3997 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4001 new_tree
= copy_node (exp
);
4002 TREE_OPERAND (new_tree
, i
) = new_op
;
4008 new_tree
= fold (new_tree
);
4009 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4010 process_call_operands (new_tree
);
4021 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4023 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4024 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4030 /* Subroutine of stabilize_reference; this is called for subtrees of
4031 references. Any expression with side-effects must be put in a SAVE_EXPR
4032 to ensure that it is only evaluated once.
4034 We don't put SAVE_EXPR nodes around everything, because assigning very
4035 simple expressions to temporaries causes us to miss good opportunities
4036 for optimizations. Among other things, the opportunity to fold in the
4037 addition of a constant into an addressing mode often gets lost, e.g.
4038 "y[i+1] += x;". In general, we take the approach that we should not make
4039 an assignment unless we are forced into it - i.e., that any non-side effect
4040 operator should be allowed, and that cse should take care of coalescing
4041 multiple utterances of the same expression should that prove fruitful. */
4044 stabilize_reference_1 (tree e
)
4047 enum tree_code code
= TREE_CODE (e
);
4049 /* We cannot ignore const expressions because it might be a reference
4050 to a const array but whose index contains side-effects. But we can
4051 ignore things that are actual constant or that already have been
4052 handled by this function. */
4054 if (tree_invariant_p (e
))
4057 switch (TREE_CODE_CLASS (code
))
4059 case tcc_exceptional
:
4061 case tcc_declaration
:
4062 case tcc_comparison
:
4064 case tcc_expression
:
4067 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4068 so that it will only be evaluated once. */
4069 /* The reference (r) and comparison (<) classes could be handled as
4070 below, but it is generally faster to only evaluate them once. */
4071 if (TREE_SIDE_EFFECTS (e
))
4072 return save_expr (e
);
4076 /* Constants need no processing. In fact, we should never reach
4081 /* Division is slow and tends to be compiled with jumps,
4082 especially the division by powers of 2 that is often
4083 found inside of an array reference. So do it just once. */
4084 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4085 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4086 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4087 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4088 return save_expr (e
);
4089 /* Recursively stabilize each operand. */
4090 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4091 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4095 /* Recursively stabilize each operand. */
4096 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4103 TREE_TYPE (result
) = TREE_TYPE (e
);
4104 TREE_READONLY (result
) = TREE_READONLY (e
);
4105 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4106 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4111 /* Stabilize a reference so that we can use it any number of times
4112 without causing its operands to be evaluated more than once.
4113 Returns the stabilized reference. This works by means of save_expr,
4114 so see the caveats in the comments about save_expr.
4116 Also allows conversion expressions whose operands are references.
4117 Any other kind of expression is returned unchanged. */
4120 stabilize_reference (tree ref
)
4123 enum tree_code code
= TREE_CODE (ref
);
4130 /* No action is needed in this case. */
4135 case FIX_TRUNC_EXPR
:
4136 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4140 result
= build_nt (INDIRECT_REF
,
4141 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4145 result
= build_nt (COMPONENT_REF
,
4146 stabilize_reference (TREE_OPERAND (ref
, 0)),
4147 TREE_OPERAND (ref
, 1), NULL_TREE
);
4151 result
= build_nt (BIT_FIELD_REF
,
4152 stabilize_reference (TREE_OPERAND (ref
, 0)),
4153 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4157 result
= build_nt (ARRAY_REF
,
4158 stabilize_reference (TREE_OPERAND (ref
, 0)),
4159 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4160 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4163 case ARRAY_RANGE_REF
:
4164 result
= build_nt (ARRAY_RANGE_REF
,
4165 stabilize_reference (TREE_OPERAND (ref
, 0)),
4166 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4167 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4171 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4172 it wouldn't be ignored. This matters when dealing with
4174 return stabilize_reference_1 (ref
);
4176 /* If arg isn't a kind of lvalue we recognize, make no change.
4177 Caller should recognize the error for an invalid lvalue. */
4182 return error_mark_node
;
4185 TREE_TYPE (result
) = TREE_TYPE (ref
);
4186 TREE_READONLY (result
) = TREE_READONLY (ref
);
4187 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4188 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4193 /* Low-level constructors for expressions. */
4195 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4196 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4199 recompute_tree_invariant_for_addr_expr (tree t
)
4202 bool tc
= true, se
= false;
4204 /* We started out assuming this address is both invariant and constant, but
4205 does not have side effects. Now go down any handled components and see if
4206 any of them involve offsets that are either non-constant or non-invariant.
4207 Also check for side-effects.
4209 ??? Note that this code makes no attempt to deal with the case where
4210 taking the address of something causes a copy due to misalignment. */
4212 #define UPDATE_FLAGS(NODE) \
4213 do { tree _node = (NODE); \
4214 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4215 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4217 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4218 node
= TREE_OPERAND (node
, 0))
4220 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4221 array reference (probably made temporarily by the G++ front end),
4222 so ignore all the operands. */
4223 if ((TREE_CODE (node
) == ARRAY_REF
4224 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4225 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4227 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4228 if (TREE_OPERAND (node
, 2))
4229 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4230 if (TREE_OPERAND (node
, 3))
4231 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4233 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4234 FIELD_DECL, apparently. The G++ front end can put something else
4235 there, at least temporarily. */
4236 else if (TREE_CODE (node
) == COMPONENT_REF
4237 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4239 if (TREE_OPERAND (node
, 2))
4240 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4244 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4246 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4247 the address, since &(*a)->b is a form of addition. If it's a constant, the
4248 address is constant too. If it's a decl, its address is constant if the
4249 decl is static. Everything else is not constant and, furthermore,
4250 taking the address of a volatile variable is not volatile. */
4251 if (TREE_CODE (node
) == INDIRECT_REF
4252 || TREE_CODE (node
) == MEM_REF
)
4253 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4254 else if (CONSTANT_CLASS_P (node
))
4256 else if (DECL_P (node
))
4257 tc
&= (staticp (node
) != NULL_TREE
);
4261 se
|= TREE_SIDE_EFFECTS (node
);
4265 TREE_CONSTANT (t
) = tc
;
4266 TREE_SIDE_EFFECTS (t
) = se
;
4270 /* Build an expression of code CODE, data type TYPE, and operands as
4271 specified. Expressions and reference nodes can be created this way.
4272 Constants, decls, types and misc nodes cannot be.
4274 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4275 enough for all extant tree codes. */
4278 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4282 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4284 t
= make_node_stat (code PASS_MEM_STAT
);
4291 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4293 int length
= sizeof (struct tree_exp
);
4296 record_node_allocation_statistics (code
, length
);
4298 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4300 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4302 memset (t
, 0, sizeof (struct tree_common
));
4304 TREE_SET_CODE (t
, code
);
4306 TREE_TYPE (t
) = type
;
4307 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4308 TREE_OPERAND (t
, 0) = node
;
4309 if (node
&& !TYPE_P (node
))
4311 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4312 TREE_READONLY (t
) = TREE_READONLY (node
);
4315 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4316 TREE_SIDE_EFFECTS (t
) = 1;
4320 /* All of these have side-effects, no matter what their
4322 TREE_SIDE_EFFECTS (t
) = 1;
4323 TREE_READONLY (t
) = 0;
4327 /* Whether a dereference is readonly has nothing to do with whether
4328 its operand is readonly. */
4329 TREE_READONLY (t
) = 0;
4334 recompute_tree_invariant_for_addr_expr (t
);
4338 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4339 && node
&& !TYPE_P (node
)
4340 && TREE_CONSTANT (node
))
4341 TREE_CONSTANT (t
) = 1;
4342 if (TREE_CODE_CLASS (code
) == tcc_reference
4343 && node
&& TREE_THIS_VOLATILE (node
))
4344 TREE_THIS_VOLATILE (t
) = 1;
4351 #define PROCESS_ARG(N) \
4353 TREE_OPERAND (t, N) = arg##N; \
4354 if (arg##N &&!TYPE_P (arg##N)) \
4356 if (TREE_SIDE_EFFECTS (arg##N)) \
4358 if (!TREE_READONLY (arg##N) \
4359 && !CONSTANT_CLASS_P (arg##N)) \
4360 (void) (read_only = 0); \
4361 if (!TREE_CONSTANT (arg##N)) \
4362 (void) (constant = 0); \
4367 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4369 bool constant
, read_only
, side_effects
;
4372 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4374 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4375 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4376 /* When sizetype precision doesn't match that of pointers
4377 we need to be able to build explicit extensions or truncations
4378 of the offset argument. */
4379 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4380 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4381 && TREE_CODE (arg1
) == INTEGER_CST
);
4383 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4384 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4385 && ptrofftype_p (TREE_TYPE (arg1
)));
4387 t
= make_node_stat (code PASS_MEM_STAT
);
4390 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4391 result based on those same flags for the arguments. But if the
4392 arguments aren't really even `tree' expressions, we shouldn't be trying
4395 /* Expressions without side effects may be constant if their
4396 arguments are as well. */
4397 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4398 || TREE_CODE_CLASS (code
) == tcc_binary
);
4400 side_effects
= TREE_SIDE_EFFECTS (t
);
4405 TREE_SIDE_EFFECTS (t
) = side_effects
;
4406 if (code
== MEM_REF
)
4408 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4410 tree o
= TREE_OPERAND (arg0
, 0);
4411 TREE_READONLY (t
) = TREE_READONLY (o
);
4412 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4417 TREE_READONLY (t
) = read_only
;
4418 TREE_CONSTANT (t
) = constant
;
4419 TREE_THIS_VOLATILE (t
)
4420 = (TREE_CODE_CLASS (code
) == tcc_reference
4421 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4429 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4430 tree arg2 MEM_STAT_DECL
)
4432 bool constant
, read_only
, side_effects
;
4435 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4436 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4438 t
= make_node_stat (code PASS_MEM_STAT
);
4443 /* As a special exception, if COND_EXPR has NULL branches, we
4444 assume that it is a gimple statement and always consider
4445 it to have side effects. */
4446 if (code
== COND_EXPR
4447 && tt
== void_type_node
4448 && arg1
== NULL_TREE
4449 && arg2
== NULL_TREE
)
4450 side_effects
= true;
4452 side_effects
= TREE_SIDE_EFFECTS (t
);
4458 if (code
== COND_EXPR
)
4459 TREE_READONLY (t
) = read_only
;
4461 TREE_SIDE_EFFECTS (t
) = side_effects
;
4462 TREE_THIS_VOLATILE (t
)
4463 = (TREE_CODE_CLASS (code
) == tcc_reference
4464 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4470 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4471 tree arg2
, tree arg3 MEM_STAT_DECL
)
4473 bool constant
, read_only
, side_effects
;
4476 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4478 t
= make_node_stat (code PASS_MEM_STAT
);
4481 side_effects
= TREE_SIDE_EFFECTS (t
);
4488 TREE_SIDE_EFFECTS (t
) = side_effects
;
4489 TREE_THIS_VOLATILE (t
)
4490 = (TREE_CODE_CLASS (code
) == tcc_reference
4491 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4497 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4498 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4500 bool constant
, read_only
, side_effects
;
4503 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4505 t
= make_node_stat (code PASS_MEM_STAT
);
4508 side_effects
= TREE_SIDE_EFFECTS (t
);
4516 TREE_SIDE_EFFECTS (t
) = side_effects
;
4517 if (code
== TARGET_MEM_REF
)
4519 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4521 tree o
= TREE_OPERAND (arg0
, 0);
4522 TREE_READONLY (t
) = TREE_READONLY (o
);
4523 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4527 TREE_THIS_VOLATILE (t
)
4528 = (TREE_CODE_CLASS (code
) == tcc_reference
4529 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4534 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4535 on the pointer PTR. */
4538 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4540 HOST_WIDE_INT offset
= 0;
4541 tree ptype
= TREE_TYPE (ptr
);
4543 /* For convenience allow addresses that collapse to a simple base
4545 if (TREE_CODE (ptr
) == ADDR_EXPR
4546 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4547 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4549 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4551 ptr
= build_fold_addr_expr (ptr
);
4552 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4554 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4555 ptr
, build_int_cst (ptype
, offset
));
4556 SET_EXPR_LOCATION (tem
, loc
);
4560 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4563 mem_ref_offset (const_tree t
)
4565 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4568 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4569 offsetted by OFFSET units. */
4572 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4574 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4575 build_fold_addr_expr (base
),
4576 build_int_cst (ptr_type_node
, offset
));
4577 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4578 recompute_tree_invariant_for_addr_expr (addr
);
4582 /* Similar except don't specify the TREE_TYPE
4583 and leave the TREE_SIDE_EFFECTS as 0.
4584 It is permissible for arguments to be null,
4585 or even garbage if their values do not matter. */
4588 build_nt (enum tree_code code
, ...)
4595 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4599 t
= make_node (code
);
4600 length
= TREE_CODE_LENGTH (code
);
4602 for (i
= 0; i
< length
; i
++)
4603 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4609 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4613 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4618 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4619 CALL_EXPR_FN (ret
) = fn
;
4620 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4621 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4622 CALL_EXPR_ARG (ret
, ix
) = t
;
4626 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4627 We do NOT enter this node in any sort of symbol table.
4629 LOC is the location of the decl.
4631 layout_decl is used to set up the decl's storage layout.
4632 Other slots are initialized to 0 or null pointers. */
4635 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4636 tree type MEM_STAT_DECL
)
4640 t
= make_node_stat (code PASS_MEM_STAT
);
4641 DECL_SOURCE_LOCATION (t
) = loc
;
4643 /* if (type == error_mark_node)
4644 type = integer_type_node; */
4645 /* That is not done, deliberately, so that having error_mark_node
4646 as the type can suppress useless errors in the use of this variable. */
4648 DECL_NAME (t
) = name
;
4649 TREE_TYPE (t
) = type
;
4651 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4657 /* Builds and returns function declaration with NAME and TYPE. */
4660 build_fn_decl (const char *name
, tree type
)
4662 tree id
= get_identifier (name
);
4663 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4665 DECL_EXTERNAL (decl
) = 1;
4666 TREE_PUBLIC (decl
) = 1;
4667 DECL_ARTIFICIAL (decl
) = 1;
4668 TREE_NOTHROW (decl
) = 1;
4673 vec
<tree
, va_gc
> *all_translation_units
;
4675 /* Builds a new translation-unit decl with name NAME, queues it in the
4676 global list of translation-unit decls and returns it. */
4679 build_translation_unit_decl (tree name
)
4681 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4683 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4684 vec_safe_push (all_translation_units
, tu
);
4689 /* BLOCK nodes are used to represent the structure of binding contours
4690 and declarations, once those contours have been exited and their contents
4691 compiled. This information is used for outputting debugging info. */
4694 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4696 tree block
= make_node (BLOCK
);
4698 BLOCK_VARS (block
) = vars
;
4699 BLOCK_SUBBLOCKS (block
) = subblocks
;
4700 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4701 BLOCK_CHAIN (block
) = chain
;
4706 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4708 LOC is the location to use in tree T. */
4711 protected_set_expr_location (tree t
, location_t loc
)
4713 if (CAN_HAVE_LOCATION_P (t
))
4714 SET_EXPR_LOCATION (t
, loc
);
4717 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4721 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4723 DECL_ATTRIBUTES (ddecl
) = attribute
;
4727 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4728 is ATTRIBUTE and its qualifiers are QUALS.
4730 Record such modified types already made so we don't make duplicates. */
4733 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4735 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4737 inchash::hash hstate
;
4741 enum tree_code code
= TREE_CODE (ttype
);
4743 /* Building a distinct copy of a tagged type is inappropriate; it
4744 causes breakage in code that expects there to be a one-to-one
4745 relationship between a struct and its fields.
4746 build_duplicate_type is another solution (as used in
4747 handle_transparent_union_attribute), but that doesn't play well
4748 with the stronger C++ type identity model. */
4749 if (TREE_CODE (ttype
) == RECORD_TYPE
4750 || TREE_CODE (ttype
) == UNION_TYPE
4751 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4752 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4754 warning (OPT_Wattributes
,
4755 "ignoring attributes applied to %qT after definition",
4756 TYPE_MAIN_VARIANT (ttype
));
4757 return build_qualified_type (ttype
, quals
);
4760 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4761 ntype
= build_distinct_type_copy (ttype
);
4763 TYPE_ATTRIBUTES (ntype
) = attribute
;
4765 hstate
.add_int (code
);
4766 if (TREE_TYPE (ntype
))
4767 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4768 attribute_hash_list (attribute
, hstate
);
4770 switch (TREE_CODE (ntype
))
4773 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4776 if (TYPE_DOMAIN (ntype
))
4777 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4780 t
= TYPE_MAX_VALUE (ntype
);
4781 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4782 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4785 case FIXED_POINT_TYPE
:
4787 unsigned int precision
= TYPE_PRECISION (ntype
);
4788 hstate
.add_object (precision
);
4795 ntype
= type_hash_canon (hstate
.end(), ntype
);
4797 /* If the target-dependent attributes make NTYPE different from
4798 its canonical type, we will need to use structural equality
4799 checks for this type. */
4800 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4801 || !comp_type_attributes (ntype
, ttype
))
4802 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4803 else if (TYPE_CANONICAL (ntype
) == ntype
)
4804 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4806 ttype
= build_qualified_type (ntype
, quals
);
4808 else if (TYPE_QUALS (ttype
) != quals
)
4809 ttype
= build_qualified_type (ttype
, quals
);
4814 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4818 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4821 for (cl1
= clauses1
, cl2
= clauses2
;
4823 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4825 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4827 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4829 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4830 OMP_CLAUSE_DECL (cl2
)) != 1)
4833 switch (OMP_CLAUSE_CODE (cl1
))
4835 case OMP_CLAUSE_ALIGNED
:
4836 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4837 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4840 case OMP_CLAUSE_LINEAR
:
4841 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4842 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4845 case OMP_CLAUSE_SIMDLEN
:
4846 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4847 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4856 /* Compare two constructor-element-type constants. Return 1 if the lists
4857 are known to be equal; otherwise return 0. */
4860 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4862 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4864 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4867 l1
= TREE_CHAIN (l1
);
4868 l2
= TREE_CHAIN (l2
);
4874 /* Compare two attributes for their value identity. Return true if the
4875 attribute values are known to be equal; otherwise return false.
4879 attribute_value_equal (const_tree attr1
, const_tree attr2
)
4881 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
4884 if (TREE_VALUE (attr1
) != NULL_TREE
4885 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
4886 && TREE_VALUE (attr2
) != NULL
4887 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
4888 return (simple_cst_list_equal (TREE_VALUE (attr1
),
4889 TREE_VALUE (attr2
)) == 1);
4891 if ((flag_openmp
|| flag_openmp_simd
)
4892 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
4893 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
4894 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
4895 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
4896 TREE_VALUE (attr2
));
4898 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
4901 /* Return 0 if the attributes for two types are incompatible, 1 if they
4902 are compatible, and 2 if they are nearly compatible (which causes a
4903 warning to be generated). */
4905 comp_type_attributes (const_tree type1
, const_tree type2
)
4907 const_tree a1
= TYPE_ATTRIBUTES (type1
);
4908 const_tree a2
= TYPE_ATTRIBUTES (type2
);
4913 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4915 const struct attribute_spec
*as
;
4918 as
= lookup_attribute_spec (get_attribute_name (a
));
4919 if (!as
|| as
->affects_type_identity
== false)
4922 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
4923 if (!attr
|| !attribute_value_equal (a
, attr
))
4928 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
4930 const struct attribute_spec
*as
;
4932 as
= lookup_attribute_spec (get_attribute_name (a
));
4933 if (!as
|| as
->affects_type_identity
== false)
4936 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
4938 /* We don't need to compare trees again, as we did this
4939 already in first loop. */
4941 /* All types - affecting identity - are equal, so
4942 there is no need to call target hook for comparison. */
4946 /* As some type combinations - like default calling-convention - might
4947 be compatible, we have to call the target hook to get the final result. */
4948 return targetm
.comp_type_attributes (type1
, type2
);
4951 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4954 Record such modified types already made so we don't make duplicates. */
4957 build_type_attribute_variant (tree ttype
, tree attribute
)
4959 return build_type_attribute_qual_variant (ttype
, attribute
,
4960 TYPE_QUALS (ttype
));
4964 /* Reset the expression *EXPR_P, a size or position.
4966 ??? We could reset all non-constant sizes or positions. But it's cheap
4967 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4969 We need to reset self-referential sizes or positions because they cannot
4970 be gimplified and thus can contain a CALL_EXPR after the gimplification
4971 is finished, which will run afoul of LTO streaming. And they need to be
4972 reset to something essentially dummy but not constant, so as to preserve
4973 the properties of the object they are attached to. */
4976 free_lang_data_in_one_sizepos (tree
*expr_p
)
4978 tree expr
= *expr_p
;
4979 if (CONTAINS_PLACEHOLDER_P (expr
))
4980 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4984 /* Reset all the fields in a binfo node BINFO. We only keep
4985 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4988 free_lang_data_in_binfo (tree binfo
)
4993 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4995 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4996 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4997 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4998 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5000 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5001 free_lang_data_in_binfo (t
);
5005 /* Reset all language specific information still present in TYPE. */
5008 free_lang_data_in_type (tree type
)
5010 gcc_assert (TYPE_P (type
));
5012 /* Give the FE a chance to remove its own data first. */
5013 lang_hooks
.free_lang_data (type
);
5015 TREE_LANG_FLAG_0 (type
) = 0;
5016 TREE_LANG_FLAG_1 (type
) = 0;
5017 TREE_LANG_FLAG_2 (type
) = 0;
5018 TREE_LANG_FLAG_3 (type
) = 0;
5019 TREE_LANG_FLAG_4 (type
) = 0;
5020 TREE_LANG_FLAG_5 (type
) = 0;
5021 TREE_LANG_FLAG_6 (type
) = 0;
5023 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5025 /* Remove the const and volatile qualifiers from arguments. The
5026 C++ front end removes them, but the C front end does not,
5027 leading to false ODR violation errors when merging two
5028 instances of the same function signature compiled by
5029 different front ends. */
5032 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5034 tree arg_type
= TREE_VALUE (p
);
5036 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5038 int quals
= TYPE_QUALS (arg_type
)
5040 & ~TYPE_QUAL_VOLATILE
;
5041 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5042 free_lang_data_in_type (TREE_VALUE (p
));
5044 /* C++ FE uses TREE_PURPOSE to store initial values. */
5045 TREE_PURPOSE (p
) = NULL
;
5047 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5048 TYPE_MINVAL (type
) = NULL
;
5050 if (TREE_CODE (type
) == METHOD_TYPE
)
5054 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5056 /* C++ FE uses TREE_PURPOSE to store initial values. */
5057 TREE_PURPOSE (p
) = NULL
;
5059 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5060 TYPE_MINVAL (type
) = NULL
;
5063 /* Remove members that are not actually FIELD_DECLs from the field
5064 list of an aggregate. These occur in C++. */
5065 if (RECORD_OR_UNION_TYPE_P (type
))
5069 /* Note that TYPE_FIELDS can be shared across distinct
5070 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5071 to be removed, we cannot set its TREE_CHAIN to NULL.
5072 Otherwise, we would not be able to find all the other fields
5073 in the other instances of this TREE_TYPE.
5075 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5077 member
= TYPE_FIELDS (type
);
5080 if (TREE_CODE (member
) == FIELD_DECL
5081 || TREE_CODE (member
) == TYPE_DECL
)
5084 TREE_CHAIN (prev
) = member
;
5086 TYPE_FIELDS (type
) = member
;
5090 member
= TREE_CHAIN (member
);
5094 TREE_CHAIN (prev
) = NULL_TREE
;
5096 TYPE_FIELDS (type
) = NULL_TREE
;
5098 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5099 and danagle the pointer from time to time. */
5100 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5101 TYPE_VFIELD (type
) = NULL_TREE
;
5103 /* Remove TYPE_METHODS list. While it would be nice to keep it
5104 to enable ODR warnings about different method lists, doing so
5105 seems to impractically increase size of LTO data streamed.
5106 Keep the infrmation if TYPE_METHODS was non-NULL. This is used
5107 by function.c and pretty printers. */
5108 if (TYPE_METHODS (type
))
5109 TYPE_METHODS (type
) = error_mark_node
;
5110 if (TYPE_BINFO (type
))
5112 free_lang_data_in_binfo (TYPE_BINFO (type
));
5113 /* We need to preserve link to bases and virtual table for all
5114 polymorphic types to make devirtualization machinery working.
5115 Debug output cares only about bases, but output also
5116 virtual table pointers so merging of -fdevirtualize and
5117 -fno-devirtualize units is easier. */
5118 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5119 || !flag_devirtualize
)
5120 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5121 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5122 || debug_info_level
!= DINFO_LEVEL_NONE
))
5123 TYPE_BINFO (type
) = NULL
;
5128 /* For non-aggregate types, clear out the language slot (which
5129 overloads TYPE_BINFO). */
5130 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5132 if (INTEGRAL_TYPE_P (type
)
5133 || SCALAR_FLOAT_TYPE_P (type
)
5134 || FIXED_POINT_TYPE_P (type
))
5136 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5137 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5141 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5142 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5144 if (TYPE_CONTEXT (type
)
5145 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5147 tree ctx
= TYPE_CONTEXT (type
);
5150 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5152 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5153 TYPE_CONTEXT (type
) = ctx
;
5158 /* Return true if DECL may need an assembler name to be set. */
5161 need_assembler_name_p (tree decl
)
5163 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition Rule
5165 if (flag_lto_odr_type_mering
5166 && TREE_CODE (decl
) == TYPE_DECL
5168 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5169 && !is_lang_specific (TREE_TYPE (decl
))
5170 /* Save some work. Names of builtin types are always derived from
5171 properties of its main variant. A special case are integer types
5172 where mangling do make differences between char/signed char/unsigned
5173 char etc. Storing name for these makes e.g.
5174 -fno-signed-char/-fsigned-char mismatches to be handled well.
5176 See cp/mangle.c:write_builtin_type for details. */
5177 && (TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
5178 && TREE_CODE (TREE_TYPE (decl
)) != BOOLEAN_TYPE
5179 && TREE_CODE (TREE_TYPE (decl
)) != REAL_TYPE
5180 && TREE_CODE (TREE_TYPE (decl
)) != FIXED_POINT_TYPE
)
5181 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5182 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
)
5183 && !type_in_anonymous_namespace_p (TREE_TYPE (decl
)))
5184 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5185 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5186 if (TREE_CODE (decl
) != FUNCTION_DECL
5187 && TREE_CODE (decl
) != VAR_DECL
)
5190 /* If DECL already has its assembler name set, it does not need a
5192 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5193 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5196 /* Abstract decls do not need an assembler name. */
5197 if (DECL_ABSTRACT_P (decl
))
5200 /* For VAR_DECLs, only static, public and external symbols need an
5202 if (TREE_CODE (decl
) == VAR_DECL
5203 && !TREE_STATIC (decl
)
5204 && !TREE_PUBLIC (decl
)
5205 && !DECL_EXTERNAL (decl
))
5208 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5210 /* Do not set assembler name on builtins. Allow RTL expansion to
5211 decide whether to expand inline or via a regular call. */
5212 if (DECL_BUILT_IN (decl
)
5213 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5216 /* Functions represented in the callgraph need an assembler name. */
5217 if (cgraph_node::get (decl
) != NULL
)
5220 /* Unused and not public functions don't need an assembler name. */
5221 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5229 /* Reset all language specific information still present in symbol
5233 free_lang_data_in_decl (tree decl
)
5235 gcc_assert (DECL_P (decl
));
5237 /* Give the FE a chance to remove its own data first. */
5238 lang_hooks
.free_lang_data (decl
);
5240 TREE_LANG_FLAG_0 (decl
) = 0;
5241 TREE_LANG_FLAG_1 (decl
) = 0;
5242 TREE_LANG_FLAG_2 (decl
) = 0;
5243 TREE_LANG_FLAG_3 (decl
) = 0;
5244 TREE_LANG_FLAG_4 (decl
) = 0;
5245 TREE_LANG_FLAG_5 (decl
) = 0;
5246 TREE_LANG_FLAG_6 (decl
) = 0;
5248 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5249 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5250 if (TREE_CODE (decl
) == FIELD_DECL
)
5252 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5253 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5254 DECL_QUALIFIER (decl
) = NULL_TREE
;
5257 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5259 struct cgraph_node
*node
;
5260 if (!(node
= cgraph_node::get (decl
))
5261 || (!node
->definition
&& !node
->clones
))
5264 node
->release_body ();
5267 release_function_body (decl
);
5268 DECL_ARGUMENTS (decl
) = NULL
;
5269 DECL_RESULT (decl
) = NULL
;
5270 DECL_INITIAL (decl
) = error_mark_node
;
5273 if (gimple_has_body_p (decl
))
5277 /* If DECL has a gimple body, then the context for its
5278 arguments must be DECL. Otherwise, it doesn't really
5279 matter, as we will not be emitting any code for DECL. In
5280 general, there may be other instances of DECL created by
5281 the front end and since PARM_DECLs are generally shared,
5282 their DECL_CONTEXT changes as the replicas of DECL are
5283 created. The only time where DECL_CONTEXT is important
5284 is for the FUNCTION_DECLs that have a gimple body (since
5285 the PARM_DECL will be used in the function's body). */
5286 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5287 DECL_CONTEXT (t
) = decl
;
5288 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5289 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5290 = target_option_default_node
;
5291 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5292 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5293 = optimization_default_node
;
5296 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5297 At this point, it is not needed anymore. */
5298 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5300 /* Clear the abstract origin if it refers to a method. Otherwise
5301 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5302 origin will not be output correctly. */
5303 if (DECL_ABSTRACT_ORIGIN (decl
)
5304 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5305 && RECORD_OR_UNION_TYPE_P
5306 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5307 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5309 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5310 DECL_VINDEX referring to itself into a vtable slot number as it
5311 should. Happens with functions that are copied and then forgotten
5312 about. Just clear it, it won't matter anymore. */
5313 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5314 DECL_VINDEX (decl
) = NULL_TREE
;
5316 else if (TREE_CODE (decl
) == VAR_DECL
)
5318 if ((DECL_EXTERNAL (decl
)
5319 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5320 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5321 DECL_INITIAL (decl
) = NULL_TREE
;
5323 else if (TREE_CODE (decl
) == TYPE_DECL
5324 || TREE_CODE (decl
) == FIELD_DECL
)
5325 DECL_INITIAL (decl
) = NULL_TREE
;
5326 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5327 && DECL_INITIAL (decl
)
5328 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5330 /* Strip builtins from the translation-unit BLOCK. We still have targets
5331 without builtin_decl_explicit support and also builtins are shared
5332 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5333 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5337 if (TREE_CODE (var
) == FUNCTION_DECL
5338 && DECL_BUILT_IN (var
))
5339 *nextp
= TREE_CHAIN (var
);
5341 nextp
= &TREE_CHAIN (var
);
5347 /* Data used when collecting DECLs and TYPEs for language data removal. */
5349 struct free_lang_data_d
5351 /* Worklist to avoid excessive recursion. */
5354 /* Set of traversed objects. Used to avoid duplicate visits. */
5355 hash_set
<tree
> *pset
;
5357 /* Array of symbols to process with free_lang_data_in_decl. */
5360 /* Array of types to process with free_lang_data_in_type. */
5365 /* Save all language fields needed to generate proper debug information
5366 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5369 save_debug_info_for_decl (tree t
)
5371 /*struct saved_debug_info_d *sdi;*/
5373 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5375 /* FIXME. Partial implementation for saving debug info removed. */
5379 /* Save all language fields needed to generate proper debug information
5380 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5383 save_debug_info_for_type (tree t
)
5385 /*struct saved_debug_info_d *sdi;*/
5387 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5389 /* FIXME. Partial implementation for saving debug info removed. */
5393 /* Add type or decl T to one of the list of tree nodes that need their
5394 language data removed. The lists are held inside FLD. */
5397 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5401 fld
->decls
.safe_push (t
);
5402 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5403 save_debug_info_for_decl (t
);
5405 else if (TYPE_P (t
))
5407 fld
->types
.safe_push (t
);
5408 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5409 save_debug_info_for_type (t
);
5415 /* Push tree node T into FLD->WORKLIST. */
5418 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5420 if (t
&& !is_lang_specific (t
) && !fld
->pset
->contains (t
))
5421 fld
->worklist
.safe_push ((t
));
5425 /* Operand callback helper for free_lang_data_in_node. *TP is the
5426 subtree operand being considered. */
5429 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5432 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5434 if (TREE_CODE (t
) == TREE_LIST
)
5437 /* Language specific nodes will be removed, so there is no need
5438 to gather anything under them. */
5439 if (is_lang_specific (t
))
5447 /* Note that walk_tree does not traverse every possible field in
5448 decls, so we have to do our own traversals here. */
5449 add_tree_to_fld_list (t
, fld
);
5451 fld_worklist_push (DECL_NAME (t
), fld
);
5452 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5453 fld_worklist_push (DECL_SIZE (t
), fld
);
5454 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5456 /* We are going to remove everything under DECL_INITIAL for
5457 TYPE_DECLs. No point walking them. */
5458 if (TREE_CODE (t
) != TYPE_DECL
)
5459 fld_worklist_push (DECL_INITIAL (t
), fld
);
5461 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5462 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5464 if (TREE_CODE (t
) == FUNCTION_DECL
)
5466 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5467 fld_worklist_push (DECL_RESULT (t
), fld
);
5469 else if (TREE_CODE (t
) == TYPE_DECL
)
5471 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5473 else if (TREE_CODE (t
) == FIELD_DECL
)
5475 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5476 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5477 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5478 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5481 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5482 && DECL_HAS_VALUE_EXPR_P (t
))
5483 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5485 if (TREE_CODE (t
) != FIELD_DECL
5486 && TREE_CODE (t
) != TYPE_DECL
)
5487 fld_worklist_push (TREE_CHAIN (t
), fld
);
5490 else if (TYPE_P (t
))
5492 /* Note that walk_tree does not traverse every possible field in
5493 types, so we have to do our own traversals here. */
5494 add_tree_to_fld_list (t
, fld
);
5496 if (!RECORD_OR_UNION_TYPE_P (t
))
5497 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5498 fld_worklist_push (TYPE_SIZE (t
), fld
);
5499 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5500 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5501 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5502 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5503 fld_worklist_push (TYPE_NAME (t
), fld
);
5504 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5505 them and thus do not and want not to reach unused pointer types
5507 if (!POINTER_TYPE_P (t
))
5508 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5509 if (!RECORD_OR_UNION_TYPE_P (t
))
5510 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5511 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5512 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5513 do not and want not to reach unused variants this way. */
5514 if (TYPE_CONTEXT (t
))
5516 tree ctx
= TYPE_CONTEXT (t
);
5517 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5518 So push that instead. */
5519 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5520 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5521 fld_worklist_push (ctx
, fld
);
5523 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5524 and want not to reach unused types this way. */
5526 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5530 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5531 fld_worklist_push (TREE_TYPE (tem
), fld
);
5532 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5534 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5535 && TREE_CODE (tem
) == TREE_LIST
)
5538 fld_worklist_push (TREE_VALUE (tem
), fld
);
5539 tem
= TREE_CHAIN (tem
);
5543 if (RECORD_OR_UNION_TYPE_P (t
))
5546 /* Push all TYPE_FIELDS - there can be interleaving interesting
5547 and non-interesting things. */
5548 tem
= TYPE_FIELDS (t
);
5551 if (TREE_CODE (tem
) == FIELD_DECL
5552 || TREE_CODE (tem
) == TYPE_DECL
)
5553 fld_worklist_push (tem
, fld
);
5554 tem
= TREE_CHAIN (tem
);
5558 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5561 else if (TREE_CODE (t
) == BLOCK
)
5564 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5565 fld_worklist_push (tem
, fld
);
5566 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5567 fld_worklist_push (tem
, fld
);
5568 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5571 if (TREE_CODE (t
) != IDENTIFIER_NODE
5572 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5573 fld_worklist_push (TREE_TYPE (t
), fld
);
5579 /* Find decls and types in T. */
5582 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5586 if (!fld
->pset
->contains (t
))
5587 walk_tree (&t
, find_decls_types_r
, fld
, fld
->pset
);
5588 if (fld
->worklist
.is_empty ())
5590 t
= fld
->worklist
.pop ();
5594 /* Translate all the types in LIST with the corresponding runtime
5598 get_eh_types_for_runtime (tree list
)
5602 if (list
== NULL_TREE
)
5605 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5607 list
= TREE_CHAIN (list
);
5610 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5611 TREE_CHAIN (prev
) = n
;
5612 prev
= TREE_CHAIN (prev
);
5613 list
= TREE_CHAIN (list
);
5620 /* Find decls and types referenced in EH region R and store them in
5621 FLD->DECLS and FLD->TYPES. */
5624 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5635 /* The types referenced in each catch must first be changed to the
5636 EH types used at runtime. This removes references to FE types
5638 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5640 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5641 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, fld
->pset
);
5646 case ERT_ALLOWED_EXCEPTIONS
:
5647 r
->u
.allowed
.type_list
5648 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5649 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, fld
->pset
);
5652 case ERT_MUST_NOT_THROW
:
5653 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5654 find_decls_types_r
, fld
, fld
->pset
);
5660 /* Find decls and types referenced in cgraph node N and store them in
5661 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5662 look for *every* kind of DECL and TYPE node reachable from N,
5663 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5664 NAMESPACE_DECLs, etc). */
5667 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5670 struct function
*fn
;
5674 find_decls_types (n
->decl
, fld
);
5676 if (!gimple_has_body_p (n
->decl
))
5679 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5681 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5683 /* Traverse locals. */
5684 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5685 find_decls_types (t
, fld
);
5687 /* Traverse EH regions in FN. */
5690 FOR_ALL_EH_REGION_FN (r
, fn
)
5691 find_decls_types_in_eh_region (r
, fld
);
5694 /* Traverse every statement in FN. */
5695 FOR_EACH_BB_FN (bb
, fn
)
5698 gimple_stmt_iterator si
;
5701 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5703 gphi
*phi
= psi
.phi ();
5705 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5707 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5708 find_decls_types (*arg_p
, fld
);
5712 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5714 gimple stmt
= gsi_stmt (si
);
5716 if (is_gimple_call (stmt
))
5717 find_decls_types (gimple_call_fntype (stmt
), fld
);
5719 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5721 tree arg
= gimple_op (stmt
, i
);
5722 find_decls_types (arg
, fld
);
5729 /* Find decls and types referenced in varpool node N and store them in
5730 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5731 look for *every* kind of DECL and TYPE node reachable from N,
5732 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5733 NAMESPACE_DECLs, etc). */
5736 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5738 find_decls_types (v
->decl
, fld
);
5741 /* If T needs an assembler name, have one created for it. */
5744 assign_assembler_name_if_neeeded (tree t
)
5746 if (need_assembler_name_p (t
))
5748 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5749 diagnostics that use input_location to show locus
5750 information. The problem here is that, at this point,
5751 input_location is generally anchored to the end of the file
5752 (since the parser is long gone), so we don't have a good
5753 position to pin it to.
5755 To alleviate this problem, this uses the location of T's
5756 declaration. Examples of this are
5757 testsuite/g++.dg/template/cond2.C and
5758 testsuite/g++.dg/template/pr35240.C. */
5759 location_t saved_location
= input_location
;
5760 input_location
= DECL_SOURCE_LOCATION (t
);
5762 decl_assembler_name (t
);
5764 input_location
= saved_location
;
5769 /* Free language specific information for every operand and expression
5770 in every node of the call graph. This process operates in three stages:
5772 1- Every callgraph node and varpool node is traversed looking for
5773 decls and types embedded in them. This is a more exhaustive
5774 search than that done by find_referenced_vars, because it will
5775 also collect individual fields, decls embedded in types, etc.
5777 2- All the decls found are sent to free_lang_data_in_decl.
5779 3- All the types found are sent to free_lang_data_in_type.
5781 The ordering between decls and types is important because
5782 free_lang_data_in_decl sets assembler names, which includes
5783 mangling. So types cannot be freed up until assembler names have
5787 free_lang_data_in_cgraph (void)
5789 struct cgraph_node
*n
;
5791 struct free_lang_data_d fld
;
5796 /* Initialize sets and arrays to store referenced decls and types. */
5797 fld
.pset
= new hash_set
<tree
>;
5798 fld
.worklist
.create (0);
5799 fld
.decls
.create (100);
5800 fld
.types
.create (100);
5802 /* Find decls and types in the body of every function in the callgraph. */
5803 FOR_EACH_FUNCTION (n
)
5804 find_decls_types_in_node (n
, &fld
);
5806 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5807 find_decls_types (p
->decl
, &fld
);
5809 /* Find decls and types in every varpool symbol. */
5810 FOR_EACH_VARIABLE (v
)
5811 find_decls_types_in_var (v
, &fld
);
5813 /* Set the assembler name on every decl found. We need to do this
5814 now because free_lang_data_in_decl will invalidate data needed
5815 for mangling. This breaks mangling on interdependent decls. */
5816 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5817 assign_assembler_name_if_neeeded (t
);
5819 /* Traverse every decl found freeing its language data. */
5820 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5821 free_lang_data_in_decl (t
);
5823 /* Traverse every type found freeing its language data. */
5824 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5825 free_lang_data_in_type (t
);
5826 #ifdef ENABLE_CHECKING
5827 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5832 fld
.worklist
.release ();
5833 fld
.decls
.release ();
5834 fld
.types
.release ();
5838 /* Free resources that are used by FE but are not needed once they are done. */
5841 free_lang_data (void)
5845 /* If we are the LTO frontend we have freed lang-specific data already. */
5847 || (!flag_generate_lto
&& !flag_generate_offload
))
5850 /* Allocate and assign alias sets to the standard integer types
5851 while the slots are still in the way the frontends generated them. */
5852 for (i
= 0; i
< itk_none
; ++i
)
5853 if (integer_types
[i
])
5854 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5856 /* Traverse the IL resetting language specific information for
5857 operands, expressions, etc. */
5858 free_lang_data_in_cgraph ();
5860 /* Create gimple variants for common types. */
5861 ptrdiff_type_node
= integer_type_node
;
5862 fileptr_type_node
= ptr_type_node
;
5864 /* Reset some langhooks. Do not reset types_compatible_p, it may
5865 still be used indirectly via the get_alias_set langhook. */
5866 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5867 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5868 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5870 /* We do not want the default decl_assembler_name implementation,
5871 rather if we have fixed everything we want a wrapper around it
5872 asserting that all non-local symbols already got their assembler
5873 name and only produce assembler names for local symbols. Or rather
5874 make sure we never call decl_assembler_name on local symbols and
5875 devise a separate, middle-end private scheme for it. */
5877 /* Reset diagnostic machinery. */
5878 tree_diagnostics_defaults (global_dc
);
5886 const pass_data pass_data_ipa_free_lang_data
=
5888 SIMPLE_IPA_PASS
, /* type */
5889 "*free_lang_data", /* name */
5890 OPTGROUP_NONE
, /* optinfo_flags */
5891 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5892 0, /* properties_required */
5893 0, /* properties_provided */
5894 0, /* properties_destroyed */
5895 0, /* todo_flags_start */
5896 0, /* todo_flags_finish */
5899 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5902 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5903 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5906 /* opt_pass methods: */
5907 virtual unsigned int execute (function
*) { return free_lang_data (); }
5909 }; // class pass_ipa_free_lang_data
5913 simple_ipa_opt_pass
*
5914 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5916 return new pass_ipa_free_lang_data (ctxt
);
5919 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
5920 ATTR_NAME. Also used internally by remove_attribute(). */
5922 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
5924 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
5926 if (ident_len
== attr_len
)
5928 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
5931 else if (ident_len
== attr_len
+ 4)
5933 /* There is the possibility that ATTR is 'text' and IDENT is
5935 const char *p
= IDENTIFIER_POINTER (ident
);
5936 if (p
[0] == '_' && p
[1] == '_'
5937 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5938 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5945 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
5946 of ATTR_NAME, and LIST is not NULL_TREE. */
5948 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
5952 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5954 if (ident_len
== attr_len
)
5956 if (!strcmp (attr_name
,
5957 IDENTIFIER_POINTER (get_attribute_name (list
))))
5960 /* TODO: If we made sure that attributes were stored in the
5961 canonical form without '__...__' (ie, as in 'text' as opposed
5962 to '__text__') then we could avoid the following case. */
5963 else if (ident_len
== attr_len
+ 4)
5965 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5966 if (p
[0] == '_' && p
[1] == '_'
5967 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
5968 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
5971 list
= TREE_CHAIN (list
);
5977 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
5978 return a pointer to the attribute's list first element if the attribute
5979 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
5983 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
5988 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
5990 if (attr_len
> ident_len
)
5992 list
= TREE_CHAIN (list
);
5996 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
5998 if (strncmp (attr_name
, p
, attr_len
) == 0)
6001 /* TODO: If we made sure that attributes were stored in the
6002 canonical form without '__...__' (ie, as in 'text' as opposed
6003 to '__text__') then we could avoid the following case. */
6004 if (p
[0] == '_' && p
[1] == '_' &&
6005 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6008 list
= TREE_CHAIN (list
);
6015 /* A variant of lookup_attribute() that can be used with an identifier
6016 as the first argument, and where the identifier can be either
6017 'text' or '__text__'.
6019 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6020 return a pointer to the attribute's list element if the attribute
6021 is part of the list, or NULL_TREE if not found. If the attribute
6022 appears more than once, this only returns the first occurrence; the
6023 TREE_CHAIN of the return value should be passed back in if further
6024 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6025 can be in the form 'text' or '__text__'. */
6027 lookup_ident_attribute (tree attr_identifier
, tree list
)
6029 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6033 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6034 == IDENTIFIER_NODE
);
6036 /* Identifiers can be compared directly for equality. */
6037 if (attr_identifier
== get_attribute_name (list
))
6040 /* If they are not equal, they may still be one in the form
6041 'text' while the other one is in the form '__text__'. TODO:
6042 If we were storing attributes in normalized 'text' form, then
6043 this could all go away and we could take full advantage of
6044 the fact that we're comparing identifiers. :-) */
6046 size_t attr_len
= IDENTIFIER_LENGTH (attr_identifier
);
6047 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6049 if (ident_len
== attr_len
+ 4)
6051 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6052 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
6053 if (p
[0] == '_' && p
[1] == '_'
6054 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6055 && strncmp (q
, p
+ 2, attr_len
) == 0)
6058 else if (ident_len
+ 4 == attr_len
)
6060 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6061 const char *q
= IDENTIFIER_POINTER (attr_identifier
);
6062 if (q
[0] == '_' && q
[1] == '_'
6063 && q
[attr_len
- 2] == '_' && q
[attr_len
- 1] == '_'
6064 && strncmp (q
+ 2, p
, ident_len
) == 0)
6068 list
= TREE_CHAIN (list
);
6074 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6078 remove_attribute (const char *attr_name
, tree list
)
6081 size_t attr_len
= strlen (attr_name
);
6083 gcc_checking_assert (attr_name
[0] != '_');
6085 for (p
= &list
; *p
; )
6088 /* TODO: If we were storing attributes in normalized form, here
6089 we could use a simple strcmp(). */
6090 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6091 *p
= TREE_CHAIN (l
);
6093 p
= &TREE_CHAIN (l
);
6099 /* Return an attribute list that is the union of a1 and a2. */
6102 merge_attributes (tree a1
, tree a2
)
6106 /* Either one unset? Take the set one. */
6108 if ((attributes
= a1
) == 0)
6111 /* One that completely contains the other? Take it. */
6113 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6115 if (attribute_list_contained (a2
, a1
))
6119 /* Pick the longest list, and hang on the other list. */
6121 if (list_length (a1
) < list_length (a2
))
6122 attributes
= a2
, a2
= a1
;
6124 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6127 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6129 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6130 a
= lookup_ident_attribute (get_attribute_name (a2
),
6135 a1
= copy_node (a2
);
6136 TREE_CHAIN (a1
) = attributes
;
6145 /* Given types T1 and T2, merge their attributes and return
6149 merge_type_attributes (tree t1
, tree t2
)
6151 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6152 TYPE_ATTRIBUTES (t2
));
6155 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6159 merge_decl_attributes (tree olddecl
, tree newdecl
)
6161 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6162 DECL_ATTRIBUTES (newdecl
));
6165 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6167 /* Specialization of merge_decl_attributes for various Windows targets.
6169 This handles the following situation:
6171 __declspec (dllimport) int foo;
6174 The second instance of `foo' nullifies the dllimport. */
6177 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6180 int delete_dllimport_p
= 1;
6182 /* What we need to do here is remove from `old' dllimport if it doesn't
6183 appear in `new'. dllimport behaves like extern: if a declaration is
6184 marked dllimport and a definition appears later, then the object
6185 is not dllimport'd. We also remove a `new' dllimport if the old list
6186 contains dllexport: dllexport always overrides dllimport, regardless
6187 of the order of declaration. */
6188 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6189 delete_dllimport_p
= 0;
6190 else if (DECL_DLLIMPORT_P (new_tree
)
6191 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6193 DECL_DLLIMPORT_P (new_tree
) = 0;
6194 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6195 "dllimport ignored", new_tree
);
6197 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6199 /* Warn about overriding a symbol that has already been used, e.g.:
6200 extern int __attribute__ ((dllimport)) foo;
6201 int* bar () {return &foo;}
6204 if (TREE_USED (old
))
6206 warning (0, "%q+D redeclared without dllimport attribute "
6207 "after being referenced with dll linkage", new_tree
);
6208 /* If we have used a variable's address with dllimport linkage,
6209 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6210 decl may already have had TREE_CONSTANT computed.
6211 We still remove the attribute so that assembler code refers
6212 to '&foo rather than '_imp__foo'. */
6213 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6214 DECL_DLLIMPORT_P (new_tree
) = 1;
6217 /* Let an inline definition silently override the external reference,
6218 but otherwise warn about attribute inconsistency. */
6219 else if (TREE_CODE (new_tree
) == VAR_DECL
6220 || !DECL_DECLARED_INLINE_P (new_tree
))
6221 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6222 "previous dllimport ignored", new_tree
);
6225 delete_dllimport_p
= 0;
6227 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6229 if (delete_dllimport_p
)
6230 a
= remove_attribute ("dllimport", a
);
6235 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6236 struct attribute_spec.handler. */
6239 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6245 /* These attributes may apply to structure and union types being created,
6246 but otherwise should pass to the declaration involved. */
6249 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6250 | (int) ATTR_FLAG_ARRAY_NEXT
))
6252 *no_add_attrs
= true;
6253 return tree_cons (name
, args
, NULL_TREE
);
6255 if (TREE_CODE (node
) == RECORD_TYPE
6256 || TREE_CODE (node
) == UNION_TYPE
)
6258 node
= TYPE_NAME (node
);
6264 warning (OPT_Wattributes
, "%qE attribute ignored",
6266 *no_add_attrs
= true;
6271 if (TREE_CODE (node
) != FUNCTION_DECL
6272 && TREE_CODE (node
) != VAR_DECL
6273 && TREE_CODE (node
) != TYPE_DECL
)
6275 *no_add_attrs
= true;
6276 warning (OPT_Wattributes
, "%qE attribute ignored",
6281 if (TREE_CODE (node
) == TYPE_DECL
6282 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6283 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6285 *no_add_attrs
= true;
6286 warning (OPT_Wattributes
, "%qE attribute ignored",
6291 is_dllimport
= is_attribute_p ("dllimport", name
);
6293 /* Report error on dllimport ambiguities seen now before they cause
6297 /* Honor any target-specific overrides. */
6298 if (!targetm
.valid_dllimport_attribute_p (node
))
6299 *no_add_attrs
= true;
6301 else if (TREE_CODE (node
) == FUNCTION_DECL
6302 && DECL_DECLARED_INLINE_P (node
))
6304 warning (OPT_Wattributes
, "inline function %q+D declared as "
6305 " dllimport: attribute ignored", node
);
6306 *no_add_attrs
= true;
6308 /* Like MS, treat definition of dllimported variables and
6309 non-inlined functions on declaration as syntax errors. */
6310 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6312 error ("function %q+D definition is marked dllimport", node
);
6313 *no_add_attrs
= true;
6316 else if (TREE_CODE (node
) == VAR_DECL
)
6318 if (DECL_INITIAL (node
))
6320 error ("variable %q+D definition is marked dllimport",
6322 *no_add_attrs
= true;
6325 /* `extern' needn't be specified with dllimport.
6326 Specify `extern' now and hope for the best. Sigh. */
6327 DECL_EXTERNAL (node
) = 1;
6328 /* Also, implicitly give dllimport'd variables declared within
6329 a function global scope, unless declared static. */
6330 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6331 TREE_PUBLIC (node
) = 1;
6334 if (*no_add_attrs
== false)
6335 DECL_DLLIMPORT_P (node
) = 1;
6337 else if (TREE_CODE (node
) == FUNCTION_DECL
6338 && DECL_DECLARED_INLINE_P (node
)
6339 && flag_keep_inline_dllexport
)
6340 /* An exported function, even if inline, must be emitted. */
6341 DECL_EXTERNAL (node
) = 0;
6343 /* Report error if symbol is not accessible at global scope. */
6344 if (!TREE_PUBLIC (node
)
6345 && (TREE_CODE (node
) == VAR_DECL
6346 || TREE_CODE (node
) == FUNCTION_DECL
))
6348 error ("external linkage required for symbol %q+D because of "
6349 "%qE attribute", node
, name
);
6350 *no_add_attrs
= true;
6353 /* A dllexport'd entity must have default visibility so that other
6354 program units (shared libraries or the main executable) can see
6355 it. A dllimport'd entity must have default visibility so that
6356 the linker knows that undefined references within this program
6357 unit can be resolved by the dynamic linker. */
6360 if (DECL_VISIBILITY_SPECIFIED (node
)
6361 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6362 error ("%qE implies default visibility, but %qD has already "
6363 "been declared with a different visibility",
6365 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6366 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6372 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6374 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6375 of the various TYPE_QUAL values. */
6378 set_type_quals (tree type
, int type_quals
)
6380 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6381 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6382 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6383 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6384 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6387 /* Returns true iff unqualified CAND and BASE are equivalent. */
6390 check_base_type (const_tree cand
, const_tree base
)
6392 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6393 /* Apparently this is needed for Objective-C. */
6394 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6395 /* Check alignment. */
6396 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6397 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6398 TYPE_ATTRIBUTES (base
)));
6401 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6404 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6406 return (TYPE_QUALS (cand
) == type_quals
6407 && check_base_type (cand
, base
));
6410 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6413 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6415 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6416 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6417 /* Apparently this is needed for Objective-C. */
6418 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6419 /* Check alignment. */
6420 && TYPE_ALIGN (cand
) == align
6421 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6422 TYPE_ATTRIBUTES (base
)));
6425 /* This function checks to see if TYPE matches the size one of the built-in
6426 atomic types, and returns that core atomic type. */
6429 find_atomic_core_type (tree type
)
6431 tree base_atomic_type
;
6433 /* Only handle complete types. */
6434 if (TYPE_SIZE (type
) == NULL_TREE
)
6437 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6441 base_atomic_type
= atomicQI_type_node
;
6445 base_atomic_type
= atomicHI_type_node
;
6449 base_atomic_type
= atomicSI_type_node
;
6453 base_atomic_type
= atomicDI_type_node
;
6457 base_atomic_type
= atomicTI_type_node
;
6461 base_atomic_type
= NULL_TREE
;
6464 return base_atomic_type
;
6467 /* Return a version of the TYPE, qualified as indicated by the
6468 TYPE_QUALS, if one exists. If no qualified version exists yet,
6469 return NULL_TREE. */
6472 get_qualified_type (tree type
, int type_quals
)
6476 if (TYPE_QUALS (type
) == type_quals
)
6479 /* Search the chain of variants to see if there is already one there just
6480 like the one we need to have. If so, use that existing one. We must
6481 preserve the TYPE_NAME, since there is code that depends on this. */
6482 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6483 if (check_qualified_type (t
, type
, type_quals
))
6489 /* Like get_qualified_type, but creates the type if it does not
6490 exist. This function never returns NULL_TREE. */
6493 build_qualified_type (tree type
, int type_quals
)
6497 /* See if we already have the appropriate qualified variant. */
6498 t
= get_qualified_type (type
, type_quals
);
6500 /* If not, build it. */
6503 t
= build_variant_type_copy (type
);
6504 set_type_quals (t
, type_quals
);
6506 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6508 /* See if this object can map to a basic atomic type. */
6509 tree atomic_type
= find_atomic_core_type (type
);
6512 /* Ensure the alignment of this type is compatible with
6513 the required alignment of the atomic type. */
6514 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6515 TYPE_ALIGN (t
) = TYPE_ALIGN (atomic_type
);
6519 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6520 /* Propagate structural equality. */
6521 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6522 else if (TYPE_CANONICAL (type
) != type
)
6523 /* Build the underlying canonical type, since it is different
6526 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6527 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6530 /* T is its own canonical type. */
6531 TYPE_CANONICAL (t
) = t
;
6538 /* Create a variant of type T with alignment ALIGN. */
6541 build_aligned_type (tree type
, unsigned int align
)
6545 if (TYPE_PACKED (type
)
6546 || TYPE_ALIGN (type
) == align
)
6549 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6550 if (check_aligned_type (t
, type
, align
))
6553 t
= build_variant_type_copy (type
);
6554 TYPE_ALIGN (t
) = align
;
6559 /* Create a new distinct copy of TYPE. The new type is made its own
6560 MAIN_VARIANT. If TYPE requires structural equality checks, the
6561 resulting type requires structural equality checks; otherwise, its
6562 TYPE_CANONICAL points to itself. */
6565 build_distinct_type_copy (tree type
)
6567 tree t
= copy_node (type
);
6569 TYPE_POINTER_TO (t
) = 0;
6570 TYPE_REFERENCE_TO (t
) = 0;
6572 /* Set the canonical type either to a new equivalence class, or
6573 propagate the need for structural equality checks. */
6574 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6575 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6577 TYPE_CANONICAL (t
) = t
;
6579 /* Make it its own variant. */
6580 TYPE_MAIN_VARIANT (t
) = t
;
6581 TYPE_NEXT_VARIANT (t
) = 0;
6583 /* We do not record methods in type copies nor variants
6584 so we do not need to keep them up to date when new method
6586 if (RECORD_OR_UNION_TYPE_P (t
))
6587 TYPE_METHODS (t
) = NULL_TREE
;
6589 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6590 whose TREE_TYPE is not t. This can also happen in the Ada
6591 frontend when using subtypes. */
6596 /* Create a new variant of TYPE, equivalent but distinct. This is so
6597 the caller can modify it. TYPE_CANONICAL for the return type will
6598 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6599 are considered equal by the language itself (or that both types
6600 require structural equality checks). */
6603 build_variant_type_copy (tree type
)
6605 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6607 t
= build_distinct_type_copy (type
);
6609 /* Since we're building a variant, assume that it is a non-semantic
6610 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6611 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6613 /* Add the new type to the chain of variants of TYPE. */
6614 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6615 TYPE_NEXT_VARIANT (m
) = t
;
6616 TYPE_MAIN_VARIANT (t
) = m
;
6621 /* Return true if the from tree in both tree maps are equal. */
6624 tree_map_base_eq (const void *va
, const void *vb
)
6626 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6627 *const b
= (const struct tree_map_base
*) vb
;
6628 return (a
->from
== b
->from
);
6631 /* Hash a from tree in a tree_base_map. */
6634 tree_map_base_hash (const void *item
)
6636 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6639 /* Return true if this tree map structure is marked for garbage collection
6640 purposes. We simply return true if the from tree is marked, so that this
6641 structure goes away when the from tree goes away. */
6644 tree_map_base_marked_p (const void *p
)
6646 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6649 /* Hash a from tree in a tree_map. */
6652 tree_map_hash (const void *item
)
6654 return (((const struct tree_map
*) item
)->hash
);
6657 /* Hash a from tree in a tree_decl_map. */
6660 tree_decl_map_hash (const void *item
)
6662 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6665 /* Return the initialization priority for DECL. */
6668 decl_init_priority_lookup (tree decl
)
6670 symtab_node
*snode
= symtab_node::get (decl
);
6673 return DEFAULT_INIT_PRIORITY
;
6675 snode
->get_init_priority ();
6678 /* Return the finalization priority for DECL. */
6681 decl_fini_priority_lookup (tree decl
)
6683 cgraph_node
*node
= cgraph_node::get (decl
);
6686 return DEFAULT_INIT_PRIORITY
;
6688 node
->get_fini_priority ();
6691 /* Set the initialization priority for DECL to PRIORITY. */
6694 decl_init_priority_insert (tree decl
, priority_type priority
)
6696 struct symtab_node
*snode
;
6698 if (priority
== DEFAULT_INIT_PRIORITY
)
6700 snode
= symtab_node::get (decl
);
6704 else if (TREE_CODE (decl
) == VAR_DECL
)
6705 snode
= varpool_node::get_create (decl
);
6707 snode
= cgraph_node::get_create (decl
);
6708 snode
->set_init_priority (priority
);
6711 /* Set the finalization priority for DECL to PRIORITY. */
6714 decl_fini_priority_insert (tree decl
, priority_type priority
)
6716 struct cgraph_node
*node
;
6718 if (priority
== DEFAULT_INIT_PRIORITY
)
6720 node
= cgraph_node::get (decl
);
6725 node
= cgraph_node::get_create (decl
);
6726 node
->set_fini_priority (priority
);
6729 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6732 print_debug_expr_statistics (void)
6734 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6735 (long) debug_expr_for_decl
->size (),
6736 (long) debug_expr_for_decl
->elements (),
6737 debug_expr_for_decl
->collisions ());
6740 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6743 print_value_expr_statistics (void)
6745 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6746 (long) value_expr_for_decl
->size (),
6747 (long) value_expr_for_decl
->elements (),
6748 value_expr_for_decl
->collisions ());
6751 /* Lookup a debug expression for FROM, and return it if we find one. */
6754 decl_debug_expr_lookup (tree from
)
6756 struct tree_decl_map
*h
, in
;
6757 in
.base
.from
= from
;
6759 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6765 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6768 decl_debug_expr_insert (tree from
, tree to
)
6770 struct tree_decl_map
*h
;
6772 h
= ggc_alloc
<tree_decl_map
> ();
6773 h
->base
.from
= from
;
6775 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6778 /* Lookup a value expression for FROM, and return it if we find one. */
6781 decl_value_expr_lookup (tree from
)
6783 struct tree_decl_map
*h
, in
;
6784 in
.base
.from
= from
;
6786 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6792 /* Insert a mapping FROM->TO in the value expression hashtable. */
6795 decl_value_expr_insert (tree from
, tree to
)
6797 struct tree_decl_map
*h
;
6799 h
= ggc_alloc
<tree_decl_map
> ();
6800 h
->base
.from
= from
;
6802 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6805 /* Lookup a vector of debug arguments for FROM, and return it if we
6809 decl_debug_args_lookup (tree from
)
6811 struct tree_vec_map
*h
, in
;
6813 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6815 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6816 in
.base
.from
= from
;
6817 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6823 /* Insert a mapping FROM->empty vector of debug arguments in the value
6824 expression hashtable. */
6827 decl_debug_args_insert (tree from
)
6829 struct tree_vec_map
*h
;
6832 if (DECL_HAS_DEBUG_ARGS_P (from
))
6833 return decl_debug_args_lookup (from
);
6834 if (debug_args_for_decl
== NULL
)
6835 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6836 h
= ggc_alloc
<tree_vec_map
> ();
6837 h
->base
.from
= from
;
6839 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6841 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6845 /* Hashing of types so that we don't make duplicates.
6846 The entry point is `type_hash_canon'. */
6848 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6849 with types in the TREE_VALUE slots), by adding the hash codes
6850 of the individual types. */
6853 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6857 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6858 if (TREE_VALUE (tail
) != error_mark_node
)
6859 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6862 /* These are the Hashtable callback functions. */
6864 /* Returns true iff the types are equivalent. */
6867 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6869 /* First test the things that are the same for all types. */
6870 if (a
->hash
!= b
->hash
6871 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6872 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6873 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6874 TYPE_ATTRIBUTES (b
->type
))
6875 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6876 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6879 /* Be careful about comparing arrays before and after the element type
6880 has been completed; don't compare TYPE_ALIGN unless both types are
6882 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6883 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6884 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6887 switch (TREE_CODE (a
->type
))
6892 case REFERENCE_TYPE
:
6897 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6900 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6901 && !(TYPE_VALUES (a
->type
)
6902 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6903 && TYPE_VALUES (b
->type
)
6904 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6905 && type_list_equal (TYPE_VALUES (a
->type
),
6906 TYPE_VALUES (b
->type
))))
6909 /* ... fall through ... */
6914 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6916 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6917 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6918 TYPE_MAX_VALUE (b
->type
)))
6919 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6920 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6921 TYPE_MIN_VALUE (b
->type
))));
6923 case FIXED_POINT_TYPE
:
6924 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6927 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6930 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6931 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6932 || (TYPE_ARG_TYPES (a
->type
)
6933 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6934 && TYPE_ARG_TYPES (b
->type
)
6935 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6936 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6937 TYPE_ARG_TYPES (b
->type
)))))
6941 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
6945 case QUAL_UNION_TYPE
:
6946 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6947 || (TYPE_FIELDS (a
->type
)
6948 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6949 && TYPE_FIELDS (b
->type
)
6950 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6951 && type_list_equal (TYPE_FIELDS (a
->type
),
6952 TYPE_FIELDS (b
->type
))));
6955 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6956 || (TYPE_ARG_TYPES (a
->type
)
6957 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6958 && TYPE_ARG_TYPES (b
->type
)
6959 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6960 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6961 TYPE_ARG_TYPES (b
->type
))))
6969 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6970 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6975 /* Given TYPE, and HASHCODE its hash code, return the canonical
6976 object for an identical type if one already exists.
6977 Otherwise, return TYPE, and record it as the canonical object.
6979 To use this function, first create a type of the sort you want.
6980 Then compute its hash code from the fields of the type that
6981 make it different from other similar types.
6982 Then call this function and use the value. */
6985 type_hash_canon (unsigned int hashcode
, tree type
)
6990 /* The hash table only contains main variants, so ensure that's what we're
6992 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6994 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6995 must call that routine before comparing TYPE_ALIGNs. */
7001 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7004 tree t1
= ((type_hash
*) *loc
)->type
;
7005 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7006 if (GATHER_STATISTICS
)
7008 tree_code_counts
[(int) TREE_CODE (type
)]--;
7009 tree_node_counts
[(int) t_kind
]--;
7010 tree_node_sizes
[(int) t_kind
] -= sizeof (struct tree_type_non_common
);
7016 struct type_hash
*h
;
7018 h
= ggc_alloc
<type_hash
> ();
7028 print_type_hash_statistics (void)
7030 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7031 (long) type_hash_table
->size (),
7032 (long) type_hash_table
->elements (),
7033 type_hash_table
->collisions ());
7036 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7037 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7038 by adding the hash codes of the individual attributes. */
7041 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7045 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7046 /* ??? Do we want to add in TREE_VALUE too? */
7047 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7050 /* Given two lists of attributes, return true if list l2 is
7051 equivalent to l1. */
7054 attribute_list_equal (const_tree l1
, const_tree l2
)
7059 return attribute_list_contained (l1
, l2
)
7060 && attribute_list_contained (l2
, l1
);
7063 /* Given two lists of attributes, return true if list L2 is
7064 completely contained within L1. */
7065 /* ??? This would be faster if attribute names were stored in a canonicalized
7066 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7067 must be used to show these elements are equivalent (which they are). */
7068 /* ??? It's not clear that attributes with arguments will always be handled
7072 attribute_list_contained (const_tree l1
, const_tree l2
)
7076 /* First check the obvious, maybe the lists are identical. */
7080 /* Maybe the lists are similar. */
7081 for (t1
= l1
, t2
= l2
;
7083 && get_attribute_name (t1
) == get_attribute_name (t2
)
7084 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7085 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7088 /* Maybe the lists are equal. */
7089 if (t1
== 0 && t2
== 0)
7092 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7095 /* This CONST_CAST is okay because lookup_attribute does not
7096 modify its argument and the return value is assigned to a
7098 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7099 CONST_CAST_TREE (l1
));
7100 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7101 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7105 if (attr
== NULL_TREE
)
7112 /* Given two lists of types
7113 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7114 return 1 if the lists contain the same types in the same order.
7115 Also, the TREE_PURPOSEs must match. */
7118 type_list_equal (const_tree l1
, const_tree l2
)
7122 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7123 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7124 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7125 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7126 && (TREE_TYPE (TREE_PURPOSE (t1
))
7127 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7133 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7134 given by TYPE. If the argument list accepts variable arguments,
7135 then this function counts only the ordinary arguments. */
7138 type_num_arguments (const_tree type
)
7143 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7144 /* If the function does not take a variable number of arguments,
7145 the last element in the list will have type `void'. */
7146 if (VOID_TYPE_P (TREE_VALUE (t
)))
7154 /* Nonzero if integer constants T1 and T2
7155 represent the same constant value. */
7158 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7163 if (t1
== 0 || t2
== 0)
7166 if (TREE_CODE (t1
) == INTEGER_CST
7167 && TREE_CODE (t2
) == INTEGER_CST
7168 && wi::to_widest (t1
) == wi::to_widest (t2
))
7174 /* Return true if T is an INTEGER_CST whose numerical value (extended
7175 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7178 tree_fits_shwi_p (const_tree t
)
7180 return (t
!= NULL_TREE
7181 && TREE_CODE (t
) == INTEGER_CST
7182 && wi::fits_shwi_p (wi::to_widest (t
)));
7185 /* Return true if T is an INTEGER_CST whose numerical value (extended
7186 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7189 tree_fits_uhwi_p (const_tree t
)
7191 return (t
!= NULL_TREE
7192 && TREE_CODE (t
) == INTEGER_CST
7193 && wi::fits_uhwi_p (wi::to_widest (t
)));
7196 /* T is an INTEGER_CST whose numerical value (extended according to
7197 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7201 tree_to_shwi (const_tree t
)
7203 gcc_assert (tree_fits_shwi_p (t
));
7204 return TREE_INT_CST_LOW (t
);
7207 /* T is an INTEGER_CST whose numerical value (extended according to
7208 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7211 unsigned HOST_WIDE_INT
7212 tree_to_uhwi (const_tree t
)
7214 gcc_assert (tree_fits_uhwi_p (t
));
7215 return TREE_INT_CST_LOW (t
);
7218 /* Return the most significant (sign) bit of T. */
7221 tree_int_cst_sign_bit (const_tree t
)
7223 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7225 return wi::extract_uhwi (t
, bitno
, 1);
7228 /* Return an indication of the sign of the integer constant T.
7229 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7230 Note that -1 will never be returned if T's type is unsigned. */
7233 tree_int_cst_sgn (const_tree t
)
7235 if (wi::eq_p (t
, 0))
7237 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7239 else if (wi::neg_p (t
))
7245 /* Return the minimum number of bits needed to represent VALUE in a
7246 signed or unsigned type, UNSIGNEDP says which. */
7249 tree_int_cst_min_precision (tree value
, signop sgn
)
7251 /* If the value is negative, compute its negative minus 1. The latter
7252 adjustment is because the absolute value of the largest negative value
7253 is one larger than the largest positive value. This is equivalent to
7254 a bit-wise negation, so use that operation instead. */
7256 if (tree_int_cst_sgn (value
) < 0)
7257 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7259 /* Return the number of bits needed, taking into account the fact
7260 that we need one more bit for a signed than unsigned type.
7261 If value is 0 or -1, the minimum precision is 1 no matter
7262 whether unsignedp is true or false. */
7264 if (integer_zerop (value
))
7267 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7270 /* Return truthvalue of whether T1 is the same tree structure as T2.
7271 Return 1 if they are the same.
7272 Return 0 if they are understandably different.
7273 Return -1 if either contains tree structure not understood by
7277 simple_cst_equal (const_tree t1
, const_tree t2
)
7279 enum tree_code code1
, code2
;
7285 if (t1
== 0 || t2
== 0)
7288 code1
= TREE_CODE (t1
);
7289 code2
= TREE_CODE (t2
);
7291 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7293 if (CONVERT_EXPR_CODE_P (code2
)
7294 || code2
== NON_LVALUE_EXPR
)
7295 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7297 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7300 else if (CONVERT_EXPR_CODE_P (code2
)
7301 || code2
== NON_LVALUE_EXPR
)
7302 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7310 return wi::to_widest (t1
) == wi::to_widest (t2
);
7313 return REAL_VALUES_IDENTICAL (TREE_REAL_CST (t1
), TREE_REAL_CST (t2
));
7316 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7319 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7320 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7321 TREE_STRING_LENGTH (t1
)));
7325 unsigned HOST_WIDE_INT idx
;
7326 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7327 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7329 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7332 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7333 /* ??? Should we handle also fields here? */
7334 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7340 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7343 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7346 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7349 const_tree arg1
, arg2
;
7350 const_call_expr_arg_iterator iter1
, iter2
;
7351 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7352 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7354 arg1
= next_const_call_expr_arg (&iter1
),
7355 arg2
= next_const_call_expr_arg (&iter2
))
7357 cmp
= simple_cst_equal (arg1
, arg2
);
7361 return arg1
== arg2
;
7365 /* Special case: if either target is an unallocated VAR_DECL,
7366 it means that it's going to be unified with whatever the
7367 TARGET_EXPR is really supposed to initialize, so treat it
7368 as being equivalent to anything. */
7369 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7370 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7371 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7372 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7373 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7374 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7377 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7382 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7384 case WITH_CLEANUP_EXPR
:
7385 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7389 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7392 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7393 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7407 /* This general rule works for most tree codes. All exceptions should be
7408 handled above. If this is a language-specific tree code, we can't
7409 trust what might be in the operand, so say we don't know
7411 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7414 switch (TREE_CODE_CLASS (code1
))
7418 case tcc_comparison
:
7419 case tcc_expression
:
7423 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7425 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7437 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7438 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7439 than U, respectively. */
7442 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7444 if (tree_int_cst_sgn (t
) < 0)
7446 else if (!tree_fits_uhwi_p (t
))
7448 else if (TREE_INT_CST_LOW (t
) == u
)
7450 else if (TREE_INT_CST_LOW (t
) < u
)
7456 /* Return true if SIZE represents a constant size that is in bounds of
7457 what the middle-end and the backend accepts (covering not more than
7458 half of the address-space). */
7461 valid_constant_size_p (const_tree size
)
7463 if (! tree_fits_uhwi_p (size
)
7464 || TREE_OVERFLOW (size
)
7465 || tree_int_cst_sign_bit (size
) != 0)
7470 /* Return the precision of the type, or for a complex or vector type the
7471 precision of the type of its elements. */
7474 element_precision (const_tree type
)
7476 enum tree_code code
= TREE_CODE (type
);
7477 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7478 type
= TREE_TYPE (type
);
7480 return TYPE_PRECISION (type
);
7483 /* Return true if CODE represents an associative tree code. Otherwise
7486 associative_tree_code (enum tree_code code
)
7505 /* Return true if CODE represents a commutative tree code. Otherwise
7508 commutative_tree_code (enum tree_code code
)
7514 case MULT_HIGHPART_EXPR
:
7522 case UNORDERED_EXPR
:
7526 case TRUTH_AND_EXPR
:
7527 case TRUTH_XOR_EXPR
:
7529 case WIDEN_MULT_EXPR
:
7530 case VEC_WIDEN_MULT_HI_EXPR
:
7531 case VEC_WIDEN_MULT_LO_EXPR
:
7532 case VEC_WIDEN_MULT_EVEN_EXPR
:
7533 case VEC_WIDEN_MULT_ODD_EXPR
:
7542 /* Return true if CODE represents a ternary tree code for which the
7543 first two operands are commutative. Otherwise return false. */
7545 commutative_ternary_tree_code (enum tree_code code
)
7549 case WIDEN_MULT_PLUS_EXPR
:
7550 case WIDEN_MULT_MINUS_EXPR
:
7564 /* Generate a hash value for an expression. This can be used iteratively
7565 by passing a previous result as the HSTATE argument.
7567 This function is intended to produce the same hash for expressions which
7568 would compare equal using operand_equal_p. */
7570 add_expr (const_tree t
, inchash::hash
&hstate
)
7573 enum tree_code code
;
7574 enum tree_code_class tclass
;
7578 hstate
.merge_hash (0);
7582 code
= TREE_CODE (t
);
7586 /* Alas, constants aren't shared, so we can't rely on pointer
7589 hstate
.merge_hash (0);
7592 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
7593 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7597 unsigned int val2
= real_hash (TREE_REAL_CST_PTR (t
));
7598 hstate
.merge_hash (val2
);
7603 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7604 hstate
.merge_hash (val2
);
7608 hstate
.add ((const void *) TREE_STRING_POINTER (t
), TREE_STRING_LENGTH (t
));
7611 inchash::add_expr (TREE_REALPART (t
), hstate
);
7612 inchash::add_expr (TREE_IMAGPART (t
), hstate
);
7617 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7618 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
);
7622 /* We can just compare by pointer. */
7623 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7625 case PLACEHOLDER_EXPR
:
7626 /* The node itself doesn't matter. */
7629 /* A list of expressions, for a CALL_EXPR or as the elements of a
7631 for (; t
; t
= TREE_CHAIN (t
))
7632 inchash::add_expr (TREE_VALUE (t
), hstate
);
7636 unsigned HOST_WIDE_INT idx
;
7638 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7640 inchash::add_expr (field
, hstate
);
7641 inchash::add_expr (value
, hstate
);
7646 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7647 Otherwise nodes that compare equal according to operand_equal_p might
7648 get different hash codes. However, don't do this for machine specific
7649 or front end builtins, since the function code is overloaded in those
7651 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7652 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7654 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7655 code
= TREE_CODE (t
);
7659 tclass
= TREE_CODE_CLASS (code
);
7661 if (tclass
== tcc_declaration
)
7663 /* DECL's have a unique ID */
7664 hstate
.add_wide_int (DECL_UID (t
));
7668 gcc_assert (IS_EXPR_CODE_CLASS (tclass
));
7670 hstate
.add_object (code
);
7672 /* Don't hash the type, that can lead to having nodes which
7673 compare equal according to operand_equal_p, but which
7674 have different hash codes. */
7675 if (CONVERT_EXPR_CODE_P (code
)
7676 || code
== NON_LVALUE_EXPR
)
7678 /* Make sure to include signness in the hash computation. */
7679 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7680 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
);
7683 else if (commutative_tree_code (code
))
7685 /* It's a commutative expression. We want to hash it the same
7686 however it appears. We do this by first hashing both operands
7687 and then rehashing based on the order of their independent
7689 inchash::hash one
, two
;
7690 inchash::add_expr (TREE_OPERAND (t
, 0), one
);
7691 inchash::add_expr (TREE_OPERAND (t
, 1), two
);
7692 hstate
.add_commutative (one
, two
);
7695 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7696 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
);
7704 /* Constructors for pointer, array and function types.
7705 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7706 constructed by language-dependent code, not here.) */
7708 /* Construct, lay out and return the type of pointers to TO_TYPE with
7709 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7710 reference all of memory. If such a type has already been
7711 constructed, reuse it. */
7714 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7719 if (to_type
== error_mark_node
)
7720 return error_mark_node
;
7722 /* If the pointed-to type has the may_alias attribute set, force
7723 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7724 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7725 can_alias_all
= true;
7727 /* In some cases, languages will have things that aren't a POINTER_TYPE
7728 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7729 In that case, return that type without regard to the rest of our
7732 ??? This is a kludge, but consistent with the way this function has
7733 always operated and there doesn't seem to be a good way to avoid this
7735 if (TYPE_POINTER_TO (to_type
) != 0
7736 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7737 return TYPE_POINTER_TO (to_type
);
7739 /* First, if we already have a type for pointers to TO_TYPE and it's
7740 the proper mode, use it. */
7741 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7742 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7745 t
= make_node (POINTER_TYPE
);
7747 TREE_TYPE (t
) = to_type
;
7748 SET_TYPE_MODE (t
, mode
);
7749 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7750 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7751 TYPE_POINTER_TO (to_type
) = t
;
7753 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7754 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7755 else if (TYPE_CANONICAL (to_type
) != to_type
)
7757 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7760 /* Lay out the type. This function has many callers that are concerned
7761 with expression-construction, and this simplifies them all. */
7767 /* By default build pointers in ptr_mode. */
7770 build_pointer_type (tree to_type
)
7772 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7773 : TYPE_ADDR_SPACE (to_type
);
7774 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7775 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7778 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7781 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7786 if (to_type
== error_mark_node
)
7787 return error_mark_node
;
7789 /* If the pointed-to type has the may_alias attribute set, force
7790 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7791 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7792 can_alias_all
= true;
7794 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7795 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7796 In that case, return that type without regard to the rest of our
7799 ??? This is a kludge, but consistent with the way this function has
7800 always operated and there doesn't seem to be a good way to avoid this
7802 if (TYPE_REFERENCE_TO (to_type
) != 0
7803 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7804 return TYPE_REFERENCE_TO (to_type
);
7806 /* First, if we already have a type for pointers to TO_TYPE and it's
7807 the proper mode, use it. */
7808 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7809 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7812 t
= make_node (REFERENCE_TYPE
);
7814 TREE_TYPE (t
) = to_type
;
7815 SET_TYPE_MODE (t
, mode
);
7816 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7817 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7818 TYPE_REFERENCE_TO (to_type
) = t
;
7820 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
))
7821 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7822 else if (TYPE_CANONICAL (to_type
) != to_type
)
7824 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7833 /* Build the node for the type of references-to-TO_TYPE by default
7837 build_reference_type (tree to_type
)
7839 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7840 : TYPE_ADDR_SPACE (to_type
);
7841 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7842 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7845 #define MAX_INT_CACHED_PREC \
7846 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7847 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7849 /* Builds a signed or unsigned integer type of precision PRECISION.
7850 Used for C bitfields whose precision does not match that of
7851 built-in target types. */
7853 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7859 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7861 if (precision
<= MAX_INT_CACHED_PREC
)
7863 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7868 itype
= make_node (INTEGER_TYPE
);
7869 TYPE_PRECISION (itype
) = precision
;
7872 fixup_unsigned_type (itype
);
7874 fixup_signed_type (itype
);
7877 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7878 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7879 if (precision
<= MAX_INT_CACHED_PREC
)
7880 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7885 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7886 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7887 is true, reuse such a type that has already been constructed. */
7890 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7892 tree itype
= make_node (INTEGER_TYPE
);
7893 inchash::hash hstate
;
7895 TREE_TYPE (itype
) = type
;
7897 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7898 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7900 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7901 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7902 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7903 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7904 TYPE_ALIGN (itype
) = TYPE_ALIGN (type
);
7905 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7910 if ((TYPE_MIN_VALUE (itype
)
7911 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7912 || (TYPE_MAX_VALUE (itype
)
7913 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7915 /* Since we cannot reliably merge this type, we need to compare it using
7916 structural equality checks. */
7917 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7921 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
7922 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7923 hstate
.merge_hash (TYPE_HASH (type
));
7924 itype
= type_hash_canon (hstate
.end (), itype
);
7929 /* Wrapper around build_range_type_1 with SHARED set to true. */
7932 build_range_type (tree type
, tree lowval
, tree highval
)
7934 return build_range_type_1 (type
, lowval
, highval
, true);
7937 /* Wrapper around build_range_type_1 with SHARED set to false. */
7940 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7942 return build_range_type_1 (type
, lowval
, highval
, false);
7945 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7946 MAXVAL should be the maximum value in the domain
7947 (one less than the length of the array).
7949 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7950 We don't enforce this limit, that is up to caller (e.g. language front end).
7951 The limit exists because the result is a signed type and we don't handle
7952 sizes that use more than one HOST_WIDE_INT. */
7955 build_index_type (tree maxval
)
7957 return build_range_type (sizetype
, size_zero_node
, maxval
);
7960 /* Return true if the debug information for TYPE, a subtype, should be emitted
7961 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7962 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7963 debug info and doesn't reflect the source code. */
7966 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7968 tree base_type
= TREE_TYPE (type
), low
, high
;
7970 /* Subrange types have a base type which is an integral type. */
7971 if (!INTEGRAL_TYPE_P (base_type
))
7974 /* Get the real bounds of the subtype. */
7975 if (lang_hooks
.types
.get_subrange_bounds
)
7976 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7979 low
= TYPE_MIN_VALUE (type
);
7980 high
= TYPE_MAX_VALUE (type
);
7983 /* If the type and its base type have the same representation and the same
7984 name, then the type is not a subrange but a copy of the base type. */
7985 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7986 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7987 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7988 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7989 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7990 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8000 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8001 and number of elements specified by the range of values of INDEX_TYPE.
8002 If SHARED is true, reuse such a type that has already been constructed. */
8005 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8009 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8011 error ("arrays of functions are not meaningful");
8012 elt_type
= integer_type_node
;
8015 t
= make_node (ARRAY_TYPE
);
8016 TREE_TYPE (t
) = elt_type
;
8017 TYPE_DOMAIN (t
) = index_type
;
8018 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8021 /* If the element type is incomplete at this point we get marked for
8022 structural equality. Do not record these types in the canonical
8024 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8029 inchash::hash hstate
;
8030 hstate
.add_object (TYPE_HASH (elt_type
));
8032 hstate
.add_object (TYPE_HASH (index_type
));
8033 t
= type_hash_canon (hstate
.end (), t
);
8036 if (TYPE_CANONICAL (t
) == t
)
8038 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8039 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
)))
8040 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8041 else if (TYPE_CANONICAL (elt_type
) != elt_type
8042 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8044 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8046 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8053 /* Wrapper around build_array_type_1 with SHARED set to true. */
8056 build_array_type (tree elt_type
, tree index_type
)
8058 return build_array_type_1 (elt_type
, index_type
, true);
8061 /* Wrapper around build_array_type_1 with SHARED set to false. */
8064 build_nonshared_array_type (tree elt_type
, tree index_type
)
8066 return build_array_type_1 (elt_type
, index_type
, false);
8069 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8073 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8075 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8078 /* Recursively examines the array elements of TYPE, until a non-array
8079 element type is found. */
8082 strip_array_types (tree type
)
8084 while (TREE_CODE (type
) == ARRAY_TYPE
)
8085 type
= TREE_TYPE (type
);
8090 /* Computes the canonical argument types from the argument type list
8093 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8094 on entry to this function, or if any of the ARGTYPES are
8097 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8098 true on entry to this function, or if any of the ARGTYPES are
8101 Returns a canonical argument list, which may be ARGTYPES when the
8102 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8103 true) or would not differ from ARGTYPES. */
8106 maybe_canonicalize_argtypes (tree argtypes
,
8107 bool *any_structural_p
,
8108 bool *any_noncanonical_p
)
8111 bool any_noncanonical_argtypes_p
= false;
8113 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8115 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8116 /* Fail gracefully by stating that the type is structural. */
8117 *any_structural_p
= true;
8118 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8119 *any_structural_p
= true;
8120 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8121 || TREE_PURPOSE (arg
))
8122 /* If the argument has a default argument, we consider it
8123 non-canonical even though the type itself is canonical.
8124 That way, different variants of function and method types
8125 with default arguments will all point to the variant with
8126 no defaults as their canonical type. */
8127 any_noncanonical_argtypes_p
= true;
8130 if (*any_structural_p
)
8133 if (any_noncanonical_argtypes_p
)
8135 /* Build the canonical list of argument types. */
8136 tree canon_argtypes
= NULL_TREE
;
8137 bool is_void
= false;
8139 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8141 if (arg
== void_list_node
)
8144 canon_argtypes
= tree_cons (NULL_TREE
,
8145 TYPE_CANONICAL (TREE_VALUE (arg
)),
8149 canon_argtypes
= nreverse (canon_argtypes
);
8151 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8153 /* There is a non-canonical type. */
8154 *any_noncanonical_p
= true;
8155 return canon_argtypes
;
8158 /* The canonical argument types are the same as ARGTYPES. */
8162 /* Construct, lay out and return
8163 the type of functions returning type VALUE_TYPE
8164 given arguments of types ARG_TYPES.
8165 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8166 are data type nodes for the arguments of the function.
8167 If such a type has already been constructed, reuse it. */
8170 build_function_type (tree value_type
, tree arg_types
)
8173 inchash::hash hstate
;
8174 bool any_structural_p
, any_noncanonical_p
;
8175 tree canon_argtypes
;
8177 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8179 error ("function return type cannot be function");
8180 value_type
= integer_type_node
;
8183 /* Make a node of the sort we want. */
8184 t
= make_node (FUNCTION_TYPE
);
8185 TREE_TYPE (t
) = value_type
;
8186 TYPE_ARG_TYPES (t
) = arg_types
;
8188 /* If we already have such a type, use the old one. */
8189 hstate
.add_object (TYPE_HASH (value_type
));
8190 type_hash_list (arg_types
, hstate
);
8191 t
= type_hash_canon (hstate
.end (), t
);
8193 /* Set up the canonical type. */
8194 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8195 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8196 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8198 &any_noncanonical_p
);
8199 if (any_structural_p
)
8200 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8201 else if (any_noncanonical_p
)
8202 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8205 if (!COMPLETE_TYPE_P (t
))
8210 /* Build a function type. The RETURN_TYPE is the type returned by the
8211 function. If VAARGS is set, no void_type_node is appended to the
8212 the list. ARGP must be always be terminated be a NULL_TREE. */
8215 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8219 t
= va_arg (argp
, tree
);
8220 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8221 args
= tree_cons (NULL_TREE
, t
, args
);
8226 if (args
!= NULL_TREE
)
8227 args
= nreverse (args
);
8228 gcc_assert (last
!= void_list_node
);
8230 else if (args
== NULL_TREE
)
8231 args
= void_list_node
;
8235 args
= nreverse (args
);
8236 TREE_CHAIN (last
) = void_list_node
;
8238 args
= build_function_type (return_type
, args
);
8243 /* Build a function type. The RETURN_TYPE is the type returned by the
8244 function. If additional arguments are provided, they are
8245 additional argument types. The list of argument types must always
8246 be terminated by NULL_TREE. */
8249 build_function_type_list (tree return_type
, ...)
8254 va_start (p
, return_type
);
8255 args
= build_function_type_list_1 (false, return_type
, p
);
8260 /* Build a variable argument function type. The RETURN_TYPE is the
8261 type returned by the function. If additional arguments are provided,
8262 they are additional argument types. The list of argument types must
8263 always be terminated by NULL_TREE. */
8266 build_varargs_function_type_list (tree return_type
, ...)
8271 va_start (p
, return_type
);
8272 args
= build_function_type_list_1 (true, return_type
, p
);
8278 /* Build a function type. RETURN_TYPE is the type returned by the
8279 function; VAARGS indicates whether the function takes varargs. The
8280 function takes N named arguments, the types of which are provided in
8284 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8288 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8290 for (i
= n
- 1; i
>= 0; i
--)
8291 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8293 return build_function_type (return_type
, t
);
8296 /* Build a function type. RETURN_TYPE is the type returned by the
8297 function. The function takes N named arguments, the types of which
8298 are provided in ARG_TYPES. */
8301 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8303 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8306 /* Build a variable argument function type. RETURN_TYPE is the type
8307 returned by the function. The function takes N named arguments, the
8308 types of which are provided in ARG_TYPES. */
8311 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8313 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8316 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8317 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8318 for the method. An implicit additional parameter (of type
8319 pointer-to-BASETYPE) is added to the ARGTYPES. */
8322 build_method_type_directly (tree basetype
,
8328 inchash::hash hstate
;
8329 bool any_structural_p
, any_noncanonical_p
;
8330 tree canon_argtypes
;
8332 /* Make a node of the sort we want. */
8333 t
= make_node (METHOD_TYPE
);
8335 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8336 TREE_TYPE (t
) = rettype
;
8337 ptype
= build_pointer_type (basetype
);
8339 /* The actual arglist for this function includes a "hidden" argument
8340 which is "this". Put it into the list of argument types. */
8341 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8342 TYPE_ARG_TYPES (t
) = argtypes
;
8344 /* If we already have such a type, use the old one. */
8345 hstate
.add_object (TYPE_HASH (basetype
));
8346 hstate
.add_object (TYPE_HASH (rettype
));
8347 type_hash_list (argtypes
, hstate
);
8348 t
= type_hash_canon (hstate
.end (), t
);
8350 /* Set up the canonical type. */
8352 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8353 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8355 = (TYPE_CANONICAL (basetype
) != basetype
8356 || TYPE_CANONICAL (rettype
) != rettype
);
8357 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8359 &any_noncanonical_p
);
8360 if (any_structural_p
)
8361 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8362 else if (any_noncanonical_p
)
8364 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8365 TYPE_CANONICAL (rettype
),
8367 if (!COMPLETE_TYPE_P (t
))
8373 /* Construct, lay out and return the type of methods belonging to class
8374 BASETYPE and whose arguments and values are described by TYPE.
8375 If that type exists already, reuse it.
8376 TYPE must be a FUNCTION_TYPE node. */
8379 build_method_type (tree basetype
, tree type
)
8381 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8383 return build_method_type_directly (basetype
,
8385 TYPE_ARG_TYPES (type
));
8388 /* Construct, lay out and return the type of offsets to a value
8389 of type TYPE, within an object of type BASETYPE.
8390 If a suitable offset type exists already, reuse it. */
8393 build_offset_type (tree basetype
, tree type
)
8396 inchash::hash hstate
;
8398 /* Make a node of the sort we want. */
8399 t
= make_node (OFFSET_TYPE
);
8401 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8402 TREE_TYPE (t
) = type
;
8404 /* If we already have such a type, use the old one. */
8405 hstate
.add_object (TYPE_HASH (basetype
));
8406 hstate
.add_object (TYPE_HASH (type
));
8407 t
= type_hash_canon (hstate
.end (), t
);
8409 if (!COMPLETE_TYPE_P (t
))
8412 if (TYPE_CANONICAL (t
) == t
)
8414 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8415 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8416 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8417 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8418 || TYPE_CANONICAL (type
) != type
)
8420 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8421 TYPE_CANONICAL (type
));
8427 /* Create a complex type whose components are COMPONENT_TYPE. */
8430 build_complex_type (tree component_type
)
8433 inchash::hash hstate
;
8435 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8436 || SCALAR_FLOAT_TYPE_P (component_type
)
8437 || FIXED_POINT_TYPE_P (component_type
));
8439 /* Make a node of the sort we want. */
8440 t
= make_node (COMPLEX_TYPE
);
8442 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8444 /* If we already have such a type, use the old one. */
8445 hstate
.add_object (TYPE_HASH (component_type
));
8446 t
= type_hash_canon (hstate
.end (), t
);
8448 if (!COMPLETE_TYPE_P (t
))
8451 if (TYPE_CANONICAL (t
) == t
)
8453 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8454 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8455 else if (TYPE_CANONICAL (component_type
) != component_type
)
8457 = build_complex_type (TYPE_CANONICAL (component_type
));
8460 /* We need to create a name, since complex is a fundamental type. */
8461 if (! TYPE_NAME (t
))
8464 if (component_type
== char_type_node
)
8465 name
= "complex char";
8466 else if (component_type
== signed_char_type_node
)
8467 name
= "complex signed char";
8468 else if (component_type
== unsigned_char_type_node
)
8469 name
= "complex unsigned char";
8470 else if (component_type
== short_integer_type_node
)
8471 name
= "complex short int";
8472 else if (component_type
== short_unsigned_type_node
)
8473 name
= "complex short unsigned int";
8474 else if (component_type
== integer_type_node
)
8475 name
= "complex int";
8476 else if (component_type
== unsigned_type_node
)
8477 name
= "complex unsigned int";
8478 else if (component_type
== long_integer_type_node
)
8479 name
= "complex long int";
8480 else if (component_type
== long_unsigned_type_node
)
8481 name
= "complex long unsigned int";
8482 else if (component_type
== long_long_integer_type_node
)
8483 name
= "complex long long int";
8484 else if (component_type
== long_long_unsigned_type_node
)
8485 name
= "complex long long unsigned int";
8490 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8491 get_identifier (name
), t
);
8494 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8497 /* If TYPE is a real or complex floating-point type and the target
8498 does not directly support arithmetic on TYPE then return the wider
8499 type to be used for arithmetic on TYPE. Otherwise, return
8503 excess_precision_type (tree type
)
8505 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8507 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8508 switch (TREE_CODE (type
))
8511 switch (flt_eval_method
)
8514 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8515 return double_type_node
;
8518 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8519 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8520 return long_double_type_node
;
8527 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8529 switch (flt_eval_method
)
8532 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8533 return complex_double_type_node
;
8536 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8537 || (TYPE_MODE (TREE_TYPE (type
))
8538 == TYPE_MODE (double_type_node
)))
8539 return complex_long_double_type_node
;
8552 /* Return OP, stripped of any conversions to wider types as much as is safe.
8553 Converting the value back to OP's type makes a value equivalent to OP.
8555 If FOR_TYPE is nonzero, we return a value which, if converted to
8556 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8558 OP must have integer, real or enumeral type. Pointers are not allowed!
8560 There are some cases where the obvious value we could return
8561 would regenerate to OP if converted to OP's type,
8562 but would not extend like OP to wider types.
8563 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8564 For example, if OP is (unsigned short)(signed char)-1,
8565 we avoid returning (signed char)-1 if FOR_TYPE is int,
8566 even though extending that to an unsigned short would regenerate OP,
8567 since the result of extending (signed char)-1 to (int)
8568 is different from (int) OP. */
8571 get_unwidened (tree op
, tree for_type
)
8573 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8574 tree type
= TREE_TYPE (op
);
8576 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8578 = (for_type
!= 0 && for_type
!= type
8579 && final_prec
> TYPE_PRECISION (type
)
8580 && TYPE_UNSIGNED (type
));
8583 while (CONVERT_EXPR_P (op
))
8587 /* TYPE_PRECISION on vector types has different meaning
8588 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8589 so avoid them here. */
8590 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8593 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8594 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8596 /* Truncations are many-one so cannot be removed.
8597 Unless we are later going to truncate down even farther. */
8599 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8602 /* See what's inside this conversion. If we decide to strip it,
8604 op
= TREE_OPERAND (op
, 0);
8606 /* If we have not stripped any zero-extensions (uns is 0),
8607 we can strip any kind of extension.
8608 If we have previously stripped a zero-extension,
8609 only zero-extensions can safely be stripped.
8610 Any extension can be stripped if the bits it would produce
8611 are all going to be discarded later by truncating to FOR_TYPE. */
8615 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8617 /* TYPE_UNSIGNED says whether this is a zero-extension.
8618 Let's avoid computing it if it does not affect WIN
8619 and if UNS will not be needed again. */
8621 || CONVERT_EXPR_P (op
))
8622 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8630 /* If we finally reach a constant see if it fits in for_type and
8631 in that case convert it. */
8633 && TREE_CODE (win
) == INTEGER_CST
8634 && TREE_TYPE (win
) != for_type
8635 && int_fits_type_p (win
, for_type
))
8636 win
= fold_convert (for_type
, win
);
8641 /* Return OP or a simpler expression for a narrower value
8642 which can be sign-extended or zero-extended to give back OP.
8643 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8644 or 0 if the value should be sign-extended. */
8647 get_narrower (tree op
, int *unsignedp_ptr
)
8652 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8654 while (TREE_CODE (op
) == NOP_EXPR
)
8657 = (TYPE_PRECISION (TREE_TYPE (op
))
8658 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8660 /* Truncations are many-one so cannot be removed. */
8664 /* See what's inside this conversion. If we decide to strip it,
8669 op
= TREE_OPERAND (op
, 0);
8670 /* An extension: the outermost one can be stripped,
8671 but remember whether it is zero or sign extension. */
8673 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8674 /* Otherwise, if a sign extension has been stripped,
8675 only sign extensions can now be stripped;
8676 if a zero extension has been stripped, only zero-extensions. */
8677 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8681 else /* bitschange == 0 */
8683 /* A change in nominal type can always be stripped, but we must
8684 preserve the unsignedness. */
8686 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8688 op
= TREE_OPERAND (op
, 0);
8689 /* Keep trying to narrow, but don't assign op to win if it
8690 would turn an integral type into something else. */
8691 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8698 if (TREE_CODE (op
) == COMPONENT_REF
8699 /* Since type_for_size always gives an integer type. */
8700 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8701 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8702 /* Ensure field is laid out already. */
8703 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8704 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8706 unsigned HOST_WIDE_INT innerprec
8707 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8708 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8709 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8710 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8712 /* We can get this structure field in a narrower type that fits it,
8713 but the resulting extension to its nominal type (a fullword type)
8714 must satisfy the same conditions as for other extensions.
8716 Do this only for fields that are aligned (not bit-fields),
8717 because when bit-field insns will be used there is no
8718 advantage in doing this. */
8720 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8721 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8722 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8726 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8727 win
= fold_convert (type
, op
);
8731 *unsignedp_ptr
= uns
;
8735 /* Returns true if integer constant C has a value that is permissible
8736 for type TYPE (an INTEGER_TYPE). */
8739 int_fits_type_p (const_tree c
, const_tree type
)
8741 tree type_low_bound
, type_high_bound
;
8742 bool ok_for_low_bound
, ok_for_high_bound
;
8743 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8746 type_low_bound
= TYPE_MIN_VALUE (type
);
8747 type_high_bound
= TYPE_MAX_VALUE (type
);
8749 /* If at least one bound of the type is a constant integer, we can check
8750 ourselves and maybe make a decision. If no such decision is possible, but
8751 this type is a subtype, try checking against that. Otherwise, use
8752 fits_to_tree_p, which checks against the precision.
8754 Compute the status for each possibly constant bound, and return if we see
8755 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8756 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8757 for "constant known to fit". */
8759 /* Check if c >= type_low_bound. */
8760 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8762 if (tree_int_cst_lt (c
, type_low_bound
))
8764 ok_for_low_bound
= true;
8767 ok_for_low_bound
= false;
8769 /* Check if c <= type_high_bound. */
8770 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8772 if (tree_int_cst_lt (type_high_bound
, c
))
8774 ok_for_high_bound
= true;
8777 ok_for_high_bound
= false;
8779 /* If the constant fits both bounds, the result is known. */
8780 if (ok_for_low_bound
&& ok_for_high_bound
)
8783 /* Perform some generic filtering which may allow making a decision
8784 even if the bounds are not constant. First, negative integers
8785 never fit in unsigned types, */
8786 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8789 /* Second, narrower types always fit in wider ones. */
8790 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8793 /* Third, unsigned integers with top bit set never fit signed types. */
8794 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8796 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
8797 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8799 /* When a tree_cst is converted to a wide-int, the precision
8800 is taken from the type. However, if the precision of the
8801 mode underneath the type is smaller than that, it is
8802 possible that the value will not fit. The test below
8803 fails if any bit is set between the sign bit of the
8804 underlying mode and the top bit of the type. */
8805 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8808 else if (wi::neg_p (c
))
8812 /* If we haven't been able to decide at this point, there nothing more we
8813 can check ourselves here. Look at the base type if we have one and it
8814 has the same precision. */
8815 if (TREE_CODE (type
) == INTEGER_TYPE
8816 && TREE_TYPE (type
) != 0
8817 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8819 type
= TREE_TYPE (type
);
8823 /* Or to fits_to_tree_p, if nothing else. */
8824 return wi::fits_to_tree_p (c
, type
);
8827 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8828 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8829 represented (assuming two's-complement arithmetic) within the bit
8830 precision of the type are returned instead. */
8833 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8835 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8836 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8837 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8840 if (TYPE_UNSIGNED (type
))
8841 mpz_set_ui (min
, 0);
8844 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8845 wi::to_mpz (mn
, min
, SIGNED
);
8849 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8850 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8851 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8854 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8855 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8859 /* Return true if VAR is an automatic variable defined in function FN. */
8862 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8864 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8865 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
8866 || TREE_CODE (var
) == PARM_DECL
)
8867 && ! TREE_STATIC (var
))
8868 || TREE_CODE (var
) == LABEL_DECL
8869 || TREE_CODE (var
) == RESULT_DECL
));
8872 /* Subprogram of following function. Called by walk_tree.
8874 Return *TP if it is an automatic variable or parameter of the
8875 function passed in as DATA. */
8878 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8880 tree fn
= (tree
) data
;
8885 else if (DECL_P (*tp
)
8886 && auto_var_in_fn_p (*tp
, fn
))
8892 /* Returns true if T is, contains, or refers to a type with variable
8893 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8894 arguments, but not the return type. If FN is nonzero, only return
8895 true if a modifier of the type or position of FN is a variable or
8896 parameter inside FN.
8898 This concept is more general than that of C99 'variably modified types':
8899 in C99, a struct type is never variably modified because a VLA may not
8900 appear as a structure member. However, in GNU C code like:
8902 struct S { int i[f()]; };
8904 is valid, and other languages may define similar constructs. */
8907 variably_modified_type_p (tree type
, tree fn
)
8911 /* Test if T is either variable (if FN is zero) or an expression containing
8912 a variable in FN. If TYPE isn't gimplified, return true also if
8913 gimplify_one_sizepos would gimplify the expression into a local
8915 #define RETURN_TRUE_IF_VAR(T) \
8916 do { tree _t = (T); \
8917 if (_t != NULL_TREE \
8918 && _t != error_mark_node \
8919 && TREE_CODE (_t) != INTEGER_CST \
8920 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8922 || (!TYPE_SIZES_GIMPLIFIED (type) \
8923 && !is_gimple_sizepos (_t)) \
8924 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8925 return true; } while (0)
8927 if (type
== error_mark_node
)
8930 /* If TYPE itself has variable size, it is variably modified. */
8931 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8932 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8934 switch (TREE_CODE (type
))
8937 case REFERENCE_TYPE
:
8939 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8945 /* If TYPE is a function type, it is variably modified if the
8946 return type is variably modified. */
8947 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8953 case FIXED_POINT_TYPE
:
8956 /* Scalar types are variably modified if their end points
8958 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8959 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8964 case QUAL_UNION_TYPE
:
8965 /* We can't see if any of the fields are variably-modified by the
8966 definition we normally use, since that would produce infinite
8967 recursion via pointers. */
8968 /* This is variably modified if some field's type is. */
8969 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8970 if (TREE_CODE (t
) == FIELD_DECL
)
8972 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8973 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8974 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8976 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8977 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8982 /* Do not call ourselves to avoid infinite recursion. This is
8983 variably modified if the element type is. */
8984 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8985 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8992 /* The current language may have other cases to check, but in general,
8993 all other types are not variably modified. */
8994 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8996 #undef RETURN_TRUE_IF_VAR
8999 /* Given a DECL or TYPE, return the scope in which it was declared, or
9000 NULL_TREE if there is no containing scope. */
9003 get_containing_scope (const_tree t
)
9005 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9008 /* Return the innermost context enclosing DECL that is
9009 a FUNCTION_DECL, or zero if none. */
9012 decl_function_context (const_tree decl
)
9016 if (TREE_CODE (decl
) == ERROR_MARK
)
9019 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9020 where we look up the function at runtime. Such functions always take
9021 a first argument of type 'pointer to real context'.
9023 C++ should really be fixed to use DECL_CONTEXT for the real context,
9024 and use something else for the "virtual context". */
9025 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9028 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9030 context
= DECL_CONTEXT (decl
);
9032 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9034 if (TREE_CODE (context
) == BLOCK
)
9035 context
= BLOCK_SUPERCONTEXT (context
);
9037 context
= get_containing_scope (context
);
9043 /* Return the innermost context enclosing DECL that is
9044 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9045 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9048 decl_type_context (const_tree decl
)
9050 tree context
= DECL_CONTEXT (decl
);
9053 switch (TREE_CODE (context
))
9055 case NAMESPACE_DECL
:
9056 case TRANSLATION_UNIT_DECL
:
9061 case QUAL_UNION_TYPE
:
9066 context
= DECL_CONTEXT (context
);
9070 context
= BLOCK_SUPERCONTEXT (context
);
9080 /* CALL is a CALL_EXPR. Return the declaration for the function
9081 called, or NULL_TREE if the called function cannot be
9085 get_callee_fndecl (const_tree call
)
9089 if (call
== error_mark_node
)
9090 return error_mark_node
;
9092 /* It's invalid to call this function with anything but a
9094 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9096 /* The first operand to the CALL is the address of the function
9098 addr
= CALL_EXPR_FN (call
);
9100 /* If there is no function, return early. */
9101 if (addr
== NULL_TREE
)
9106 /* If this is a readonly function pointer, extract its initial value. */
9107 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9108 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9109 && DECL_INITIAL (addr
))
9110 addr
= DECL_INITIAL (addr
);
9112 /* If the address is just `&f' for some function `f', then we know
9113 that `f' is being called. */
9114 if (TREE_CODE (addr
) == ADDR_EXPR
9115 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9116 return TREE_OPERAND (addr
, 0);
9118 /* We couldn't figure out what was being called. */
9122 /* Print debugging information about tree nodes generated during the compile,
9123 and any language-specific information. */
9126 dump_tree_statistics (void)
9128 if (GATHER_STATISTICS
)
9131 int total_nodes
, total_bytes
;
9132 fprintf (stderr
, "Kind Nodes Bytes\n");
9133 fprintf (stderr
, "---------------------------------------\n");
9134 total_nodes
= total_bytes
= 0;
9135 for (i
= 0; i
< (int) all_kinds
; i
++)
9137 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9138 tree_node_counts
[i
], tree_node_sizes
[i
]);
9139 total_nodes
+= tree_node_counts
[i
];
9140 total_bytes
+= tree_node_sizes
[i
];
9142 fprintf (stderr
, "---------------------------------------\n");
9143 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9144 fprintf (stderr
, "---------------------------------------\n");
9145 fprintf (stderr
, "Code Nodes\n");
9146 fprintf (stderr
, "----------------------------\n");
9147 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9148 fprintf (stderr
, "%-20s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9149 tree_code_counts
[i
]);
9150 fprintf (stderr
, "----------------------------\n");
9151 ssanames_print_statistics ();
9152 phinodes_print_statistics ();
9155 fprintf (stderr
, "(No per-node statistics)\n");
9157 print_type_hash_statistics ();
9158 print_debug_expr_statistics ();
9159 print_value_expr_statistics ();
9160 lang_hooks
.print_statistics ();
9163 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9165 /* Generate a crc32 of a byte. */
9168 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9172 for (ix
= bits
; ix
--; value
<<= 1)
9176 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9183 /* Generate a crc32 of a 32-bit unsigned. */
9186 crc32_unsigned (unsigned chksum
, unsigned value
)
9188 return crc32_unsigned_bits (chksum
, value
, 32);
9191 /* Generate a crc32 of a byte. */
9194 crc32_byte (unsigned chksum
, char byte
)
9196 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9199 /* Generate a crc32 of a string. */
9202 crc32_string (unsigned chksum
, const char *string
)
9206 chksum
= crc32_byte (chksum
, *string
);
9212 /* P is a string that will be used in a symbol. Mask out any characters
9213 that are not valid in that context. */
9216 clean_symbol_name (char *p
)
9220 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9223 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9230 /* Generate a name for a special-purpose function.
9231 The generated name may need to be unique across the whole link.
9232 Changes to this function may also require corresponding changes to
9233 xstrdup_mask_random.
9234 TYPE is some string to identify the purpose of this function to the
9235 linker or collect2; it must start with an uppercase letter,
9237 I - for constructors
9239 N - for C++ anonymous namespaces
9240 F - for DWARF unwind frame information. */
9243 get_file_function_name (const char *type
)
9249 /* If we already have a name we know to be unique, just use that. */
9250 if (first_global_object_name
)
9251 p
= q
= ASTRDUP (first_global_object_name
);
9252 /* If the target is handling the constructors/destructors, they
9253 will be local to this file and the name is only necessary for
9255 We also assign sub_I and sub_D sufixes to constructors called from
9256 the global static constructors. These are always local. */
9257 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9258 || (strncmp (type
, "sub_", 4) == 0
9259 && (type
[4] == 'I' || type
[4] == 'D')))
9261 const char *file
= main_input_filename
;
9263 file
= LOCATION_FILE (input_location
);
9264 /* Just use the file's basename, because the full pathname
9265 might be quite long. */
9266 p
= q
= ASTRDUP (lbasename (file
));
9270 /* Otherwise, the name must be unique across the entire link.
9271 We don't have anything that we know to be unique to this translation
9272 unit, so use what we do have and throw in some randomness. */
9274 const char *name
= weak_global_object_name
;
9275 const char *file
= main_input_filename
;
9280 file
= LOCATION_FILE (input_location
);
9282 len
= strlen (file
);
9283 q
= (char *) alloca (9 + 17 + len
+ 1);
9284 memcpy (q
, file
, len
+ 1);
9286 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9287 crc32_string (0, name
), get_random_seed (false));
9292 clean_symbol_name (q
);
9293 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9296 /* Set up the name of the file-level functions we may need.
9297 Use a global object (which is already required to be unique over
9298 the program) rather than the file name (which imposes extra
9300 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9302 return get_identifier (buf
);
9305 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9307 /* Complain that the tree code of NODE does not match the expected 0
9308 terminated list of trailing codes. The trailing code list can be
9309 empty, for a more vague error message. FILE, LINE, and FUNCTION
9310 are of the caller. */
9313 tree_check_failed (const_tree node
, const char *file
,
9314 int line
, const char *function
, ...)
9318 unsigned length
= 0;
9319 enum tree_code code
;
9321 va_start (args
, function
);
9322 while ((code
= (enum tree_code
) va_arg (args
, int)))
9323 length
+= 4 + strlen (get_tree_code_name (code
));
9328 va_start (args
, function
);
9329 length
+= strlen ("expected ");
9330 buffer
= tmp
= (char *) alloca (length
);
9332 while ((code
= (enum tree_code
) va_arg (args
, int)))
9334 const char *prefix
= length
? " or " : "expected ";
9336 strcpy (tmp
+ length
, prefix
);
9337 length
+= strlen (prefix
);
9338 strcpy (tmp
+ length
, get_tree_code_name (code
));
9339 length
+= strlen (get_tree_code_name (code
));
9344 buffer
= "unexpected node";
9346 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9347 buffer
, get_tree_code_name (TREE_CODE (node
)),
9348 function
, trim_filename (file
), line
);
9351 /* Complain that the tree code of NODE does match the expected 0
9352 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9356 tree_not_check_failed (const_tree node
, const char *file
,
9357 int line
, const char *function
, ...)
9361 unsigned length
= 0;
9362 enum tree_code code
;
9364 va_start (args
, function
);
9365 while ((code
= (enum tree_code
) va_arg (args
, int)))
9366 length
+= 4 + strlen (get_tree_code_name (code
));
9368 va_start (args
, function
);
9369 buffer
= (char *) alloca (length
);
9371 while ((code
= (enum tree_code
) va_arg (args
, int)))
9375 strcpy (buffer
+ length
, " or ");
9378 strcpy (buffer
+ length
, get_tree_code_name (code
));
9379 length
+= strlen (get_tree_code_name (code
));
9383 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9384 buffer
, get_tree_code_name (TREE_CODE (node
)),
9385 function
, trim_filename (file
), line
);
9388 /* Similar to tree_check_failed, except that we check for a class of tree
9389 code, given in CL. */
9392 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9393 const char *file
, int line
, const char *function
)
9396 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9397 TREE_CODE_CLASS_STRING (cl
),
9398 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9399 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9402 /* Similar to tree_check_failed, except that instead of specifying a
9403 dozen codes, use the knowledge that they're all sequential. */
9406 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9407 const char *function
, enum tree_code c1
,
9411 unsigned length
= 0;
9414 for (c
= c1
; c
<= c2
; ++c
)
9415 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9417 length
+= strlen ("expected ");
9418 buffer
= (char *) alloca (length
);
9421 for (c
= c1
; c
<= c2
; ++c
)
9423 const char *prefix
= length
? " or " : "expected ";
9425 strcpy (buffer
+ length
, prefix
);
9426 length
+= strlen (prefix
);
9427 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9428 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9431 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9432 buffer
, get_tree_code_name (TREE_CODE (node
)),
9433 function
, trim_filename (file
), line
);
9437 /* Similar to tree_check_failed, except that we check that a tree does
9438 not have the specified code, given in CL. */
9441 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9442 const char *file
, int line
, const char *function
)
9445 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9446 TREE_CODE_CLASS_STRING (cl
),
9447 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9448 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9452 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9455 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9456 const char *function
, enum omp_clause_code code
)
9458 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9459 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9460 function
, trim_filename (file
), line
);
9464 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9467 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9468 const char *function
, enum omp_clause_code c1
,
9469 enum omp_clause_code c2
)
9472 unsigned length
= 0;
9475 for (c
= c1
; c
<= c2
; ++c
)
9476 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9478 length
+= strlen ("expected ");
9479 buffer
= (char *) alloca (length
);
9482 for (c
= c1
; c
<= c2
; ++c
)
9484 const char *prefix
= length
? " or " : "expected ";
9486 strcpy (buffer
+ length
, prefix
);
9487 length
+= strlen (prefix
);
9488 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9489 length
+= strlen (omp_clause_code_name
[c
]);
9492 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9493 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9494 function
, trim_filename (file
), line
);
9498 #undef DEFTREESTRUCT
9499 #define DEFTREESTRUCT(VAL, NAME) NAME,
9501 static const char *ts_enum_names
[] = {
9502 #include "treestruct.def"
9504 #undef DEFTREESTRUCT
9506 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9508 /* Similar to tree_class_check_failed, except that we check for
9509 whether CODE contains the tree structure identified by EN. */
9512 tree_contains_struct_check_failed (const_tree node
,
9513 const enum tree_node_structure_enum en
,
9514 const char *file
, int line
,
9515 const char *function
)
9518 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9520 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9524 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9525 (dynamically sized) vector. */
9528 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9529 const char *function
)
9532 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9533 idx
+ 1, len
, function
, trim_filename (file
), line
);
9536 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9537 (dynamically sized) vector. */
9540 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9541 const char *function
)
9544 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9545 idx
+ 1, len
, function
, trim_filename (file
), line
);
9548 /* Similar to above, except that the check is for the bounds of the operand
9549 vector of an expression node EXP. */
9552 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9553 int line
, const char *function
)
9555 enum tree_code code
= TREE_CODE (exp
);
9557 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9558 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9559 function
, trim_filename (file
), line
);
9562 /* Similar to above, except that the check is for the number of
9563 operands of an OMP_CLAUSE node. */
9566 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9567 int line
, const char *function
)
9570 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9571 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9572 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9573 trim_filename (file
), line
);
9575 #endif /* ENABLE_TREE_CHECKING */
9577 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9578 and mapped to the machine mode MODE. Initialize its fields and build
9579 the information necessary for debugging output. */
9582 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9585 inchash::hash hstate
;
9587 t
= make_node (VECTOR_TYPE
);
9588 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (innertype
);
9589 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9590 SET_TYPE_MODE (t
, mode
);
9592 if (TYPE_STRUCTURAL_EQUALITY_P (innertype
))
9593 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9594 else if (TYPE_CANONICAL (innertype
) != innertype
9595 || mode
!= VOIDmode
)
9597 = make_vector_type (TYPE_CANONICAL (innertype
), nunits
, VOIDmode
);
9601 hstate
.add_wide_int (VECTOR_TYPE
);
9602 hstate
.add_wide_int (nunits
);
9603 hstate
.add_wide_int (mode
);
9604 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
9605 t
= type_hash_canon (hstate
.end (), t
);
9607 /* We have built a main variant, based on the main variant of the
9608 inner type. Use it to build the variant we return. */
9609 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9610 && TREE_TYPE (t
) != innertype
)
9611 return build_type_attribute_qual_variant (t
,
9612 TYPE_ATTRIBUTES (innertype
),
9613 TYPE_QUALS (innertype
));
9619 make_or_reuse_type (unsigned size
, int unsignedp
)
9623 if (size
== INT_TYPE_SIZE
)
9624 return unsignedp
? unsigned_type_node
: integer_type_node
;
9625 if (size
== CHAR_TYPE_SIZE
)
9626 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9627 if (size
== SHORT_TYPE_SIZE
)
9628 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9629 if (size
== LONG_TYPE_SIZE
)
9630 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9631 if (size
== LONG_LONG_TYPE_SIZE
)
9632 return (unsignedp
? long_long_unsigned_type_node
9633 : long_long_integer_type_node
);
9635 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9636 if (size
== int_n_data
[i
].bitsize
9637 && int_n_enabled_p
[i
])
9638 return (unsignedp
? int_n_trees
[i
].unsigned_type
9639 : int_n_trees
[i
].signed_type
);
9642 return make_unsigned_type (size
);
9644 return make_signed_type (size
);
9647 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9650 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9654 if (size
== SHORT_FRACT_TYPE_SIZE
)
9655 return unsignedp
? sat_unsigned_short_fract_type_node
9656 : sat_short_fract_type_node
;
9657 if (size
== FRACT_TYPE_SIZE
)
9658 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9659 if (size
== LONG_FRACT_TYPE_SIZE
)
9660 return unsignedp
? sat_unsigned_long_fract_type_node
9661 : sat_long_fract_type_node
;
9662 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9663 return unsignedp
? sat_unsigned_long_long_fract_type_node
9664 : sat_long_long_fract_type_node
;
9668 if (size
== SHORT_FRACT_TYPE_SIZE
)
9669 return unsignedp
? unsigned_short_fract_type_node
9670 : short_fract_type_node
;
9671 if (size
== FRACT_TYPE_SIZE
)
9672 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9673 if (size
== LONG_FRACT_TYPE_SIZE
)
9674 return unsignedp
? unsigned_long_fract_type_node
9675 : long_fract_type_node
;
9676 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9677 return unsignedp
? unsigned_long_long_fract_type_node
9678 : long_long_fract_type_node
;
9681 return make_fract_type (size
, unsignedp
, satp
);
9684 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9687 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9691 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9692 return unsignedp
? sat_unsigned_short_accum_type_node
9693 : sat_short_accum_type_node
;
9694 if (size
== ACCUM_TYPE_SIZE
)
9695 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9696 if (size
== LONG_ACCUM_TYPE_SIZE
)
9697 return unsignedp
? sat_unsigned_long_accum_type_node
9698 : sat_long_accum_type_node
;
9699 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9700 return unsignedp
? sat_unsigned_long_long_accum_type_node
9701 : sat_long_long_accum_type_node
;
9705 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9706 return unsignedp
? unsigned_short_accum_type_node
9707 : short_accum_type_node
;
9708 if (size
== ACCUM_TYPE_SIZE
)
9709 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9710 if (size
== LONG_ACCUM_TYPE_SIZE
)
9711 return unsignedp
? unsigned_long_accum_type_node
9712 : long_accum_type_node
;
9713 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9714 return unsignedp
? unsigned_long_long_accum_type_node
9715 : long_long_accum_type_node
;
9718 return make_accum_type (size
, unsignedp
, satp
);
9722 /* Create an atomic variant node for TYPE. This routine is called
9723 during initialization of data types to create the 5 basic atomic
9724 types. The generic build_variant_type function requires these to
9725 already be set up in order to function properly, so cannot be
9726 called from there. If ALIGN is non-zero, then ensure alignment is
9727 overridden to this value. */
9730 build_atomic_base (tree type
, unsigned int align
)
9734 /* Make sure its not already registered. */
9735 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9738 t
= build_variant_type_copy (type
);
9739 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9742 TYPE_ALIGN (t
) = align
;
9747 /* Create nodes for all integer types (and error_mark_node) using the sizes
9748 of C datatypes. SIGNED_CHAR specifies whether char is signed,
9749 SHORT_DOUBLE specifies whether double should be of the same precision
9753 build_common_tree_nodes (bool signed_char
, bool short_double
)
9757 error_mark_node
= make_node (ERROR_MARK
);
9758 TREE_TYPE (error_mark_node
) = error_mark_node
;
9760 initialize_sizetypes ();
9762 /* Define both `signed char' and `unsigned char'. */
9763 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9764 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9765 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9766 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9768 /* Define `char', which is like either `signed char' or `unsigned char'
9769 but not the same as either. */
9772 ? make_signed_type (CHAR_TYPE_SIZE
)
9773 : make_unsigned_type (CHAR_TYPE_SIZE
));
9774 TYPE_STRING_FLAG (char_type_node
) = 1;
9776 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9777 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9778 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9779 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9780 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9781 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9782 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9783 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9785 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9787 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9788 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9789 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9790 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9792 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9793 && int_n_enabled_p
[i
])
9795 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9796 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9800 /* Define a boolean type. This type only represents boolean values but
9801 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9802 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9803 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9804 TYPE_PRECISION (boolean_type_node
) = 1;
9805 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9807 /* Define what type to use for size_t. */
9808 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9809 size_type_node
= unsigned_type_node
;
9810 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9811 size_type_node
= long_unsigned_type_node
;
9812 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9813 size_type_node
= long_long_unsigned_type_node
;
9814 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9815 size_type_node
= short_unsigned_type_node
;
9820 size_type_node
= NULL_TREE
;
9821 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9822 if (int_n_enabled_p
[i
])
9825 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9827 if (strcmp (name
, SIZE_TYPE
) == 0)
9829 size_type_node
= int_n_trees
[i
].unsigned_type
;
9832 if (size_type_node
== NULL_TREE
)
9836 /* Fill in the rest of the sized types. Reuse existing type nodes
9838 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9839 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9840 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9841 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9842 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9844 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9845 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9846 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9847 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9848 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9850 /* Don't call build_qualified type for atomics. That routine does
9851 special processing for atomics, and until they are initialized
9852 it's better not to make that call.
9854 Check to see if there is a target override for atomic types. */
9856 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9857 targetm
.atomic_align_for_mode (QImode
));
9858 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9859 targetm
.atomic_align_for_mode (HImode
));
9860 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9861 targetm
.atomic_align_for_mode (SImode
));
9862 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9863 targetm
.atomic_align_for_mode (DImode
));
9864 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9865 targetm
.atomic_align_for_mode (TImode
));
9867 access_public_node
= get_identifier ("public");
9868 access_protected_node
= get_identifier ("protected");
9869 access_private_node
= get_identifier ("private");
9871 /* Define these next since types below may used them. */
9872 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9873 integer_one_node
= build_int_cst (integer_type_node
, 1);
9874 integer_three_node
= build_int_cst (integer_type_node
, 3);
9875 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9877 size_zero_node
= size_int (0);
9878 size_one_node
= size_int (1);
9879 bitsize_zero_node
= bitsize_int (0);
9880 bitsize_one_node
= bitsize_int (1);
9881 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9883 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9884 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9886 void_type_node
= make_node (VOID_TYPE
);
9887 layout_type (void_type_node
);
9889 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9891 /* We are not going to have real types in C with less than byte alignment,
9892 so we might as well not have any types that claim to have it. */
9893 TYPE_ALIGN (void_type_node
) = BITS_PER_UNIT
;
9894 TYPE_USER_ALIGN (void_type_node
) = 0;
9896 void_node
= make_node (VOID_CST
);
9897 TREE_TYPE (void_node
) = void_type_node
;
9899 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9900 layout_type (TREE_TYPE (null_pointer_node
));
9902 ptr_type_node
= build_pointer_type (void_type_node
);
9904 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9905 fileptr_type_node
= ptr_type_node
;
9907 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9909 float_type_node
= make_node (REAL_TYPE
);
9910 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9911 layout_type (float_type_node
);
9913 double_type_node
= make_node (REAL_TYPE
);
9915 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
9917 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9918 layout_type (double_type_node
);
9920 long_double_type_node
= make_node (REAL_TYPE
);
9921 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9922 layout_type (long_double_type_node
);
9924 float_ptr_type_node
= build_pointer_type (float_type_node
);
9925 double_ptr_type_node
= build_pointer_type (double_type_node
);
9926 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9927 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9929 /* Fixed size integer types. */
9930 uint16_type_node
= make_or_reuse_type (16, 1);
9931 uint32_type_node
= make_or_reuse_type (32, 1);
9932 uint64_type_node
= make_or_reuse_type (64, 1);
9934 /* Decimal float types. */
9935 dfloat32_type_node
= make_node (REAL_TYPE
);
9936 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9937 layout_type (dfloat32_type_node
);
9938 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9939 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9941 dfloat64_type_node
= make_node (REAL_TYPE
);
9942 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9943 layout_type (dfloat64_type_node
);
9944 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9945 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9947 dfloat128_type_node
= make_node (REAL_TYPE
);
9948 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9949 layout_type (dfloat128_type_node
);
9950 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9951 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9953 complex_integer_type_node
= build_complex_type (integer_type_node
);
9954 complex_float_type_node
= build_complex_type (float_type_node
);
9955 complex_double_type_node
= build_complex_type (double_type_node
);
9956 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
9958 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9959 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9960 sat_ ## KIND ## _type_node = \
9961 make_sat_signed_ ## KIND ## _type (SIZE); \
9962 sat_unsigned_ ## KIND ## _type_node = \
9963 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9964 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9965 unsigned_ ## KIND ## _type_node = \
9966 make_unsigned_ ## KIND ## _type (SIZE);
9968 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9969 sat_ ## WIDTH ## KIND ## _type_node = \
9970 make_sat_signed_ ## KIND ## _type (SIZE); \
9971 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9972 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9973 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9974 unsigned_ ## WIDTH ## KIND ## _type_node = \
9975 make_unsigned_ ## KIND ## _type (SIZE);
9977 /* Make fixed-point type nodes based on four different widths. */
9978 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9979 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9980 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9981 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9982 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9984 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9985 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9986 NAME ## _type_node = \
9987 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9988 u ## NAME ## _type_node = \
9989 make_or_reuse_unsigned_ ## KIND ## _type \
9990 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9991 sat_ ## NAME ## _type_node = \
9992 make_or_reuse_sat_signed_ ## KIND ## _type \
9993 (GET_MODE_BITSIZE (MODE ## mode)); \
9994 sat_u ## NAME ## _type_node = \
9995 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9996 (GET_MODE_BITSIZE (U ## MODE ## mode));
9998 /* Fixed-point type and mode nodes. */
9999 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10000 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10001 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10002 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10003 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10004 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10005 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10006 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10007 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10008 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10009 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10012 tree t
= targetm
.build_builtin_va_list ();
10014 /* Many back-ends define record types without setting TYPE_NAME.
10015 If we copied the record type here, we'd keep the original
10016 record type without a name. This breaks name mangling. So,
10017 don't copy record types and let c_common_nodes_and_builtins()
10018 declare the type to be __builtin_va_list. */
10019 if (TREE_CODE (t
) != RECORD_TYPE
)
10020 t
= build_variant_type_copy (t
);
10022 va_list_type_node
= t
;
10026 /* Modify DECL for given flags.
10027 TM_PURE attribute is set only on types, so the function will modify
10028 DECL's type when ECF_TM_PURE is used. */
10031 set_call_expr_flags (tree decl
, int flags
)
10033 if (flags
& ECF_NOTHROW
)
10034 TREE_NOTHROW (decl
) = 1;
10035 if (flags
& ECF_CONST
)
10036 TREE_READONLY (decl
) = 1;
10037 if (flags
& ECF_PURE
)
10038 DECL_PURE_P (decl
) = 1;
10039 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10040 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10041 if (flags
& ECF_NOVOPS
)
10042 DECL_IS_NOVOPS (decl
) = 1;
10043 if (flags
& ECF_NORETURN
)
10044 TREE_THIS_VOLATILE (decl
) = 1;
10045 if (flags
& ECF_MALLOC
)
10046 DECL_IS_MALLOC (decl
) = 1;
10047 if (flags
& ECF_RETURNS_TWICE
)
10048 DECL_IS_RETURNS_TWICE (decl
) = 1;
10049 if (flags
& ECF_LEAF
)
10050 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10051 NULL
, DECL_ATTRIBUTES (decl
));
10052 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10053 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10054 /* Looping const or pure is implied by noreturn.
10055 There is currently no way to declare looping const or looping pure alone. */
10056 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10057 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10061 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10064 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10065 const char *library_name
, int ecf_flags
)
10069 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10070 library_name
, NULL_TREE
);
10071 set_call_expr_flags (decl
, ecf_flags
);
10073 set_builtin_decl (code
, decl
, true);
10076 /* Call this function after instantiating all builtins that the language
10077 front end cares about. This will build the rest of the builtins
10078 and internal functions that are relied upon by the tree optimizers and
10082 build_common_builtin_nodes (void)
10087 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10089 ftype
= build_function_type (void_type_node
, void_list_node
);
10090 local_define_builtin ("__builtin_unreachable", ftype
, BUILT_IN_UNREACHABLE
,
10091 "__builtin_unreachable",
10092 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10096 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10097 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10099 ftype
= build_function_type_list (ptr_type_node
,
10100 ptr_type_node
, const_ptr_type_node
,
10101 size_type_node
, NULL_TREE
);
10103 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10104 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10105 "memcpy", ECF_NOTHROW
| ECF_LEAF
);
10106 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10107 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10108 "memmove", ECF_NOTHROW
| ECF_LEAF
);
10111 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10113 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10114 const_ptr_type_node
, size_type_node
,
10116 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10117 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10120 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10122 ftype
= build_function_type_list (ptr_type_node
,
10123 ptr_type_node
, integer_type_node
,
10124 size_type_node
, NULL_TREE
);
10125 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10126 "memset", ECF_NOTHROW
| ECF_LEAF
);
10129 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10131 ftype
= build_function_type_list (ptr_type_node
,
10132 size_type_node
, NULL_TREE
);
10133 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10134 "alloca", ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10137 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10138 size_type_node
, NULL_TREE
);
10139 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10140 BUILT_IN_ALLOCA_WITH_ALIGN
,
10141 "__builtin_alloca_with_align",
10142 ECF_MALLOC
| ECF_NOTHROW
| ECF_LEAF
);
10144 /* If we're checking the stack, `alloca' can throw. */
10145 if (flag_stack_check
)
10147 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA
)) = 0;
10148 TREE_NOTHROW (builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
)) = 0;
10151 ftype
= build_function_type_list (void_type_node
,
10152 ptr_type_node
, ptr_type_node
,
10153 ptr_type_node
, NULL_TREE
);
10154 local_define_builtin ("__builtin_init_trampoline", ftype
,
10155 BUILT_IN_INIT_TRAMPOLINE
,
10156 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10157 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10158 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10159 "__builtin_init_heap_trampoline",
10160 ECF_NOTHROW
| ECF_LEAF
);
10162 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10163 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10164 BUILT_IN_ADJUST_TRAMPOLINE
,
10165 "__builtin_adjust_trampoline",
10166 ECF_CONST
| ECF_NOTHROW
);
10168 ftype
= build_function_type_list (void_type_node
,
10169 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10170 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10171 BUILT_IN_NONLOCAL_GOTO
,
10172 "__builtin_nonlocal_goto",
10173 ECF_NORETURN
| ECF_NOTHROW
);
10175 ftype
= build_function_type_list (void_type_node
,
10176 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10177 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10178 BUILT_IN_SETJMP_SETUP
,
10179 "__builtin_setjmp_setup", ECF_NOTHROW
);
10181 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10182 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10183 BUILT_IN_SETJMP_RECEIVER
,
10184 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10186 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10187 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10188 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10190 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10191 local_define_builtin ("__builtin_stack_restore", ftype
,
10192 BUILT_IN_STACK_RESTORE
,
10193 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10195 /* If there's a possibility that we might use the ARM EABI, build the
10196 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10197 if (targetm
.arm_eabi_unwinder
)
10199 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10200 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10201 BUILT_IN_CXA_END_CLEANUP
,
10202 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10205 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10206 local_define_builtin ("__builtin_unwind_resume", ftype
,
10207 BUILT_IN_UNWIND_RESUME
,
10208 ((targetm_common
.except_unwind_info (&global_options
)
10210 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10213 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10215 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10217 local_define_builtin ("__builtin_return_address", ftype
,
10218 BUILT_IN_RETURN_ADDRESS
,
10219 "__builtin_return_address",
10223 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10224 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10226 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10227 ptr_type_node
, NULL_TREE
);
10228 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10229 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10230 BUILT_IN_PROFILE_FUNC_ENTER
,
10231 "__cyg_profile_func_enter", 0);
10232 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10233 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10234 BUILT_IN_PROFILE_FUNC_EXIT
,
10235 "__cyg_profile_func_exit", 0);
10238 /* The exception object and filter values from the runtime. The argument
10239 must be zero before exception lowering, i.e. from the front end. After
10240 exception lowering, it will be the region number for the exception
10241 landing pad. These functions are PURE instead of CONST to prevent
10242 them from being hoisted past the exception edge that will initialize
10243 its value in the landing pad. */
10244 ftype
= build_function_type_list (ptr_type_node
,
10245 integer_type_node
, NULL_TREE
);
10246 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10247 /* Only use TM_PURE if we we have TM language support. */
10248 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10249 ecf_flags
|= ECF_TM_PURE
;
10250 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10251 "__builtin_eh_pointer", ecf_flags
);
10253 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10254 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10255 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10256 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10258 ftype
= build_function_type_list (void_type_node
,
10259 integer_type_node
, integer_type_node
,
10261 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10262 BUILT_IN_EH_COPY_VALUES
,
10263 "__builtin_eh_copy_values", ECF_NOTHROW
);
10265 /* Complex multiplication and division. These are handled as builtins
10266 rather than optabs because emit_library_call_value doesn't support
10267 complex. Further, we can do slightly better with folding these
10268 beasties if the real and complex parts of the arguments are separate. */
10272 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10274 char mode_name_buf
[4], *q
;
10276 enum built_in_function mcode
, dcode
;
10277 tree type
, inner_type
;
10278 const char *prefix
= "__";
10280 if (targetm
.libfunc_gnu_prefix
)
10283 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10286 inner_type
= TREE_TYPE (type
);
10288 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10289 inner_type
, inner_type
, NULL_TREE
);
10291 mcode
= ((enum built_in_function
)
10292 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10293 dcode
= ((enum built_in_function
)
10294 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10296 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10300 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10302 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10303 built_in_names
[mcode
],
10304 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10306 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10308 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10309 built_in_names
[dcode
],
10310 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10314 init_internal_fns ();
10317 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10320 If we requested a pointer to a vector, build up the pointers that
10321 we stripped off while looking for the inner type. Similarly for
10322 return values from functions.
10324 The argument TYPE is the top of the chain, and BOTTOM is the
10325 new type which we will point to. */
10328 reconstruct_complex_type (tree type
, tree bottom
)
10332 if (TREE_CODE (type
) == POINTER_TYPE
)
10334 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10335 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10336 TYPE_REF_CAN_ALIAS_ALL (type
));
10338 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10340 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10341 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10342 TYPE_REF_CAN_ALIAS_ALL (type
));
10344 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10346 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10347 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10349 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10351 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10352 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10354 else if (TREE_CODE (type
) == METHOD_TYPE
)
10356 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10357 /* The build_method_type_directly() routine prepends 'this' to argument list,
10358 so we must compensate by getting rid of it. */
10360 = build_method_type_directly
10361 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10363 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10365 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10367 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10368 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10373 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10374 TYPE_QUALS (type
));
10377 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10380 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10384 switch (GET_MODE_CLASS (mode
))
10386 case MODE_VECTOR_INT
:
10387 case MODE_VECTOR_FLOAT
:
10388 case MODE_VECTOR_FRACT
:
10389 case MODE_VECTOR_UFRACT
:
10390 case MODE_VECTOR_ACCUM
:
10391 case MODE_VECTOR_UACCUM
:
10392 nunits
= GET_MODE_NUNITS (mode
);
10396 /* Check that there are no leftover bits. */
10397 gcc_assert (GET_MODE_BITSIZE (mode
)
10398 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10400 nunits
= GET_MODE_BITSIZE (mode
)
10401 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10405 gcc_unreachable ();
10408 return make_vector_type (innertype
, nunits
, mode
);
10411 /* Similarly, but takes the inner type and number of units, which must be
10415 build_vector_type (tree innertype
, int nunits
)
10417 return make_vector_type (innertype
, nunits
, VOIDmode
);
10420 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10423 build_opaque_vector_type (tree innertype
, int nunits
)
10425 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10427 /* We always build the non-opaque variant before the opaque one,
10428 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10429 cand
= TYPE_NEXT_VARIANT (t
);
10431 && TYPE_VECTOR_OPAQUE (cand
)
10432 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10434 /* Othewise build a variant type and make sure to queue it after
10435 the non-opaque type. */
10436 cand
= build_distinct_type_copy (t
);
10437 TYPE_VECTOR_OPAQUE (cand
) = true;
10438 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10439 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10440 TYPE_NEXT_VARIANT (t
) = cand
;
10441 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10446 /* Given an initializer INIT, return TRUE if INIT is zero or some
10447 aggregate of zeros. Otherwise return FALSE. */
10449 initializer_zerop (const_tree init
)
10455 switch (TREE_CODE (init
))
10458 return integer_zerop (init
);
10461 /* ??? Note that this is not correct for C4X float formats. There,
10462 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10463 negative exponent. */
10464 return real_zerop (init
)
10465 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10468 return fixed_zerop (init
);
10471 return integer_zerop (init
)
10472 || (real_zerop (init
)
10473 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10474 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10479 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10480 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10487 unsigned HOST_WIDE_INT idx
;
10489 if (TREE_CLOBBER_P (init
))
10491 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10492 if (!initializer_zerop (elt
))
10501 /* We need to loop through all elements to handle cases like
10502 "\0" and "\0foobar". */
10503 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10504 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10515 /* Check if vector VEC consists of all the equal elements and
10516 that the number of elements corresponds to the type of VEC.
10517 The function returns first element of the vector
10518 or NULL_TREE if the vector is not uniform. */
10520 uniform_vector_p (const_tree vec
)
10525 if (vec
== NULL_TREE
)
10528 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10530 if (TREE_CODE (vec
) == VECTOR_CST
)
10532 first
= VECTOR_CST_ELT (vec
, 0);
10533 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10534 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10540 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10542 first
= error_mark_node
;
10544 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10551 if (!operand_equal_p (first
, t
, 0))
10554 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10563 /* Build an empty statement at location LOC. */
10566 build_empty_stmt (location_t loc
)
10568 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10569 SET_EXPR_LOCATION (t
, loc
);
10574 /* Build an OpenMP clause with code CODE. LOC is the location of the
10578 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10583 length
= omp_clause_num_ops
[code
];
10584 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10586 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10588 t
= (tree
) ggc_internal_alloc (size
);
10589 memset (t
, 0, size
);
10590 TREE_SET_CODE (t
, OMP_CLAUSE
);
10591 OMP_CLAUSE_SET_CODE (t
, code
);
10592 OMP_CLAUSE_LOCATION (t
) = loc
;
10597 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10598 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10599 Except for the CODE and operand count field, other storage for the
10600 object is initialized to zeros. */
10603 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
10606 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10608 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10609 gcc_assert (len
>= 1);
10611 record_node_allocation_statistics (code
, length
);
10613 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10615 TREE_SET_CODE (t
, code
);
10617 /* Can't use TREE_OPERAND to store the length because if checking is
10618 enabled, it will try to check the length before we store it. :-P */
10619 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10624 /* Helper function for build_call_* functions; build a CALL_EXPR with
10625 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10626 the argument slots. */
10629 build_call_1 (tree return_type
, tree fn
, int nargs
)
10633 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10634 TREE_TYPE (t
) = return_type
;
10635 CALL_EXPR_FN (t
) = fn
;
10636 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10641 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10642 FN and a null static chain slot. NARGS is the number of call arguments
10643 which are specified as "..." arguments. */
10646 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10650 va_start (args
, nargs
);
10651 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10656 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10657 FN and a null static chain slot. NARGS is the number of call arguments
10658 which are specified as a va_list ARGS. */
10661 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10666 t
= build_call_1 (return_type
, fn
, nargs
);
10667 for (i
= 0; i
< nargs
; i
++)
10668 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10669 process_call_operands (t
);
10673 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10674 FN and a null static chain slot. NARGS is the number of call arguments
10675 which are specified as a tree array ARGS. */
10678 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10679 int nargs
, const tree
*args
)
10684 t
= build_call_1 (return_type
, fn
, nargs
);
10685 for (i
= 0; i
< nargs
; i
++)
10686 CALL_EXPR_ARG (t
, i
) = args
[i
];
10687 process_call_operands (t
);
10688 SET_EXPR_LOCATION (t
, loc
);
10692 /* Like build_call_array, but takes a vec. */
10695 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10700 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10701 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10702 CALL_EXPR_ARG (ret
, ix
) = t
;
10703 process_call_operands (ret
);
10707 /* Conveniently construct a function call expression. FNDECL names the
10708 function to be called and N arguments are passed in the array
10712 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10714 tree fntype
= TREE_TYPE (fndecl
);
10715 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10717 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10720 /* Conveniently construct a function call expression. FNDECL names the
10721 function to be called and the arguments are passed in the vector
10725 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10727 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10728 vec_safe_address (vec
));
10732 /* Conveniently construct a function call expression. FNDECL names the
10733 function to be called, N is the number of arguments, and the "..."
10734 parameters are the argument expressions. */
10737 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10740 tree
*argarray
= XALLOCAVEC (tree
, n
);
10744 for (i
= 0; i
< n
; i
++)
10745 argarray
[i
] = va_arg (ap
, tree
);
10747 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10750 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10751 varargs macros aren't supported by all bootstrap compilers. */
10754 build_call_expr (tree fndecl
, int n
, ...)
10757 tree
*argarray
= XALLOCAVEC (tree
, n
);
10761 for (i
= 0; i
< n
; i
++)
10762 argarray
[i
] = va_arg (ap
, tree
);
10764 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10767 /* Build internal call expression. This is just like CALL_EXPR, except
10768 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10769 internal function. */
10772 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10773 tree type
, int n
, ...)
10778 tree fn
= build_call_1 (type
, NULL_TREE
, n
);
10780 for (i
= 0; i
< n
; i
++)
10781 CALL_EXPR_ARG (fn
, i
) = va_arg (ap
, tree
);
10783 SET_EXPR_LOCATION (fn
, loc
);
10784 CALL_EXPR_IFN (fn
) = ifn
;
10788 /* Create a new constant string literal and return a char* pointer to it.
10789 The STRING_CST value is the LEN characters at STR. */
10791 build_string_literal (int len
, const char *str
)
10793 tree t
, elem
, index
, type
;
10795 t
= build_string (len
, str
);
10796 elem
= build_type_variant (char_type_node
, 1, 0);
10797 index
= build_index_type (size_int (len
- 1));
10798 type
= build_array_type (elem
, index
);
10799 TREE_TYPE (t
) = type
;
10800 TREE_CONSTANT (t
) = 1;
10801 TREE_READONLY (t
) = 1;
10802 TREE_STATIC (t
) = 1;
10804 type
= build_pointer_type (elem
);
10805 t
= build1 (ADDR_EXPR
, type
,
10806 build4 (ARRAY_REF
, elem
,
10807 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10813 /* Return true if T (assumed to be a DECL) must be assigned a memory
10817 needs_to_live_in_memory (const_tree t
)
10819 return (TREE_ADDRESSABLE (t
)
10820 || is_global_var (t
)
10821 || (TREE_CODE (t
) == RESULT_DECL
10822 && !DECL_BY_REFERENCE (t
)
10823 && aggregate_value_p (t
, current_function_decl
)));
10826 /* Return value of a constant X and sign-extend it. */
10829 int_cst_value (const_tree x
)
10831 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10832 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10834 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10835 gcc_assert (cst_and_fits_in_hwi (x
));
10837 if (bits
< HOST_BITS_PER_WIDE_INT
)
10839 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10841 val
|= (~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1;
10843 val
&= ~((~(unsigned HOST_WIDE_INT
) 0) << (bits
- 1) << 1);
10849 /* If TYPE is an integral or pointer type, return an integer type with
10850 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10851 if TYPE is already an integer type of signedness UNSIGNEDP. */
10854 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10856 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10859 if (TREE_CODE (type
) == VECTOR_TYPE
)
10861 tree inner
= TREE_TYPE (type
);
10862 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10865 if (inner
== inner2
)
10867 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10870 if (!INTEGRAL_TYPE_P (type
)
10871 && !POINTER_TYPE_P (type
)
10872 && TREE_CODE (type
) != OFFSET_TYPE
)
10875 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10878 /* If TYPE is an integral or pointer type, return an integer type with
10879 the same precision which is unsigned, or itself if TYPE is already an
10880 unsigned integer type. */
10883 unsigned_type_for (tree type
)
10885 return signed_or_unsigned_type_for (1, type
);
10888 /* If TYPE is an integral or pointer type, return an integer type with
10889 the same precision which is signed, or itself if TYPE is already a
10890 signed integer type. */
10893 signed_type_for (tree type
)
10895 return signed_or_unsigned_type_for (0, type
);
10898 /* If TYPE is a vector type, return a signed integer vector type with the
10899 same width and number of subparts. Otherwise return boolean_type_node. */
10902 truth_type_for (tree type
)
10904 if (TREE_CODE (type
) == VECTOR_TYPE
)
10906 tree elem
= lang_hooks
.types
.type_for_size
10907 (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (type
))), 0);
10908 return build_opaque_vector_type (elem
, TYPE_VECTOR_SUBPARTS (type
));
10911 return boolean_type_node
;
10914 /* Returns the largest value obtainable by casting something in INNER type to
10918 upper_bound_in_type (tree outer
, tree inner
)
10920 unsigned int det
= 0;
10921 unsigned oprec
= TYPE_PRECISION (outer
);
10922 unsigned iprec
= TYPE_PRECISION (inner
);
10925 /* Compute a unique number for every combination. */
10926 det
|= (oprec
> iprec
) ? 4 : 0;
10927 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10928 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10930 /* Determine the exponent to use. */
10935 /* oprec <= iprec, outer: signed, inner: don't care. */
10940 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10944 /* oprec > iprec, outer: signed, inner: signed. */
10948 /* oprec > iprec, outer: signed, inner: unsigned. */
10952 /* oprec > iprec, outer: unsigned, inner: signed. */
10956 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10960 gcc_unreachable ();
10963 return wide_int_to_tree (outer
,
10964 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10967 /* Returns the smallest value obtainable by casting something in INNER type to
10971 lower_bound_in_type (tree outer
, tree inner
)
10973 unsigned oprec
= TYPE_PRECISION (outer
);
10974 unsigned iprec
= TYPE_PRECISION (inner
);
10976 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10978 if (TYPE_UNSIGNED (outer
)
10979 /* If we are widening something of an unsigned type, OUTER type
10980 contains all values of INNER type. In particular, both INNER
10981 and OUTER types have zero in common. */
10982 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10983 return build_int_cst (outer
, 0);
10986 /* If we are widening a signed type to another signed type, we
10987 want to obtain -2^^(iprec-1). If we are keeping the
10988 precision or narrowing to a signed type, we want to obtain
10990 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10991 return wide_int_to_tree (outer
,
10992 wi::mask (prec
- 1, true,
10993 TYPE_PRECISION (outer
)));
10997 /* Return nonzero if two operands that are suitable for PHI nodes are
10998 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10999 SSA_NAME or invariant. Note that this is strictly an optimization.
11000 That is, callers of this function can directly call operand_equal_p
11001 and get the same result, only slower. */
11004 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11008 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11010 return operand_equal_p (arg0
, arg1
, 0);
11013 /* Returns number of zeros at the end of binary representation of X. */
11016 num_ending_zeros (const_tree x
)
11018 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11022 #define WALK_SUBTREE(NODE) \
11025 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11031 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11032 be walked whenever a type is seen in the tree. Rest of operands and return
11033 value are as for walk_tree. */
11036 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11037 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11039 tree result
= NULL_TREE
;
11041 switch (TREE_CODE (type
))
11044 case REFERENCE_TYPE
:
11046 /* We have to worry about mutually recursive pointers. These can't
11047 be written in C. They can in Ada. It's pathological, but
11048 there's an ACATS test (c38102a) that checks it. Deal with this
11049 by checking if we're pointing to another pointer, that one
11050 points to another pointer, that one does too, and we have no htab.
11051 If so, get a hash table. We check three levels deep to avoid
11052 the cost of the hash table if we don't need one. */
11053 if (POINTER_TYPE_P (TREE_TYPE (type
))
11054 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11055 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11058 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11066 /* ... fall through ... */
11069 WALK_SUBTREE (TREE_TYPE (type
));
11073 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11075 /* Fall through. */
11077 case FUNCTION_TYPE
:
11078 WALK_SUBTREE (TREE_TYPE (type
));
11082 /* We never want to walk into default arguments. */
11083 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11084 WALK_SUBTREE (TREE_VALUE (arg
));
11089 /* Don't follow this nodes's type if a pointer for fear that
11090 we'll have infinite recursion. If we have a PSET, then we
11093 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11094 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11095 WALK_SUBTREE (TREE_TYPE (type
));
11096 WALK_SUBTREE (TYPE_DOMAIN (type
));
11100 WALK_SUBTREE (TREE_TYPE (type
));
11101 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11111 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11112 called with the DATA and the address of each sub-tree. If FUNC returns a
11113 non-NULL value, the traversal is stopped, and the value returned by FUNC
11114 is returned. If PSET is non-NULL it is used to record the nodes visited,
11115 and to avoid visiting a node more than once. */
11118 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11119 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11121 enum tree_code code
;
11125 #define WALK_SUBTREE_TAIL(NODE) \
11129 goto tail_recurse; \
11134 /* Skip empty subtrees. */
11138 /* Don't walk the same tree twice, if the user has requested
11139 that we avoid doing so. */
11140 if (pset
&& pset
->add (*tp
))
11143 /* Call the function. */
11145 result
= (*func
) (tp
, &walk_subtrees
, data
);
11147 /* If we found something, return it. */
11151 code
= TREE_CODE (*tp
);
11153 /* Even if we didn't, FUNC may have decided that there was nothing
11154 interesting below this point in the tree. */
11155 if (!walk_subtrees
)
11157 /* But we still need to check our siblings. */
11158 if (code
== TREE_LIST
)
11159 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11160 else if (code
== OMP_CLAUSE
)
11161 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11168 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11169 if (result
|| !walk_subtrees
)
11176 case IDENTIFIER_NODE
:
11183 case PLACEHOLDER_EXPR
:
11187 /* None of these have subtrees other than those already walked
11192 WALK_SUBTREE (TREE_VALUE (*tp
));
11193 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11198 int len
= TREE_VEC_LENGTH (*tp
);
11203 /* Walk all elements but the first. */
11205 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11207 /* Now walk the first one as a tail call. */
11208 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11212 WALK_SUBTREE (TREE_REALPART (*tp
));
11213 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11217 unsigned HOST_WIDE_INT idx
;
11218 constructor_elt
*ce
;
11220 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11222 WALK_SUBTREE (ce
->value
);
11227 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11232 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11234 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11235 into declarations that are just mentioned, rather than
11236 declared; they don't really belong to this part of the tree.
11237 And, we can see cycles: the initializer for a declaration
11238 can refer to the declaration itself. */
11239 WALK_SUBTREE (DECL_INITIAL (decl
));
11240 WALK_SUBTREE (DECL_SIZE (decl
));
11241 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11243 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11246 case STATEMENT_LIST
:
11248 tree_stmt_iterator i
;
11249 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11250 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11255 switch (OMP_CLAUSE_CODE (*tp
))
11257 case OMP_CLAUSE_GANG
:
11258 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11261 case OMP_CLAUSE_DEVICE_RESIDENT
:
11262 case OMP_CLAUSE_USE_DEVICE
:
11263 case OMP_CLAUSE_ASYNC
:
11264 case OMP_CLAUSE_WAIT
:
11265 case OMP_CLAUSE_WORKER
:
11266 case OMP_CLAUSE_VECTOR
:
11267 case OMP_CLAUSE_NUM_GANGS
:
11268 case OMP_CLAUSE_NUM_WORKERS
:
11269 case OMP_CLAUSE_VECTOR_LENGTH
:
11270 case OMP_CLAUSE_PRIVATE
:
11271 case OMP_CLAUSE_SHARED
:
11272 case OMP_CLAUSE_FIRSTPRIVATE
:
11273 case OMP_CLAUSE_COPYIN
:
11274 case OMP_CLAUSE_COPYPRIVATE
:
11275 case OMP_CLAUSE_FINAL
:
11276 case OMP_CLAUSE_IF
:
11277 case OMP_CLAUSE_NUM_THREADS
:
11278 case OMP_CLAUSE_SCHEDULE
:
11279 case OMP_CLAUSE_UNIFORM
:
11280 case OMP_CLAUSE_DEPEND
:
11281 case OMP_CLAUSE_NUM_TEAMS
:
11282 case OMP_CLAUSE_THREAD_LIMIT
:
11283 case OMP_CLAUSE_DEVICE
:
11284 case OMP_CLAUSE_DIST_SCHEDULE
:
11285 case OMP_CLAUSE_SAFELEN
:
11286 case OMP_CLAUSE_SIMDLEN
:
11287 case OMP_CLAUSE__LOOPTEMP_
:
11288 case OMP_CLAUSE__SIMDUID_
:
11289 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11290 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11293 case OMP_CLAUSE_INDEPENDENT
:
11294 case OMP_CLAUSE_NOWAIT
:
11295 case OMP_CLAUSE_ORDERED
:
11296 case OMP_CLAUSE_DEFAULT
:
11297 case OMP_CLAUSE_UNTIED
:
11298 case OMP_CLAUSE_MERGEABLE
:
11299 case OMP_CLAUSE_PROC_BIND
:
11300 case OMP_CLAUSE_INBRANCH
:
11301 case OMP_CLAUSE_NOTINBRANCH
:
11302 case OMP_CLAUSE_FOR
:
11303 case OMP_CLAUSE_PARALLEL
:
11304 case OMP_CLAUSE_SECTIONS
:
11305 case OMP_CLAUSE_TASKGROUP
:
11306 case OMP_CLAUSE_AUTO
:
11307 case OMP_CLAUSE_SEQ
:
11308 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11310 case OMP_CLAUSE_LASTPRIVATE
:
11311 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11312 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11313 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11315 case OMP_CLAUSE_COLLAPSE
:
11318 for (i
= 0; i
< 3; i
++)
11319 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11320 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11323 case OMP_CLAUSE_LINEAR
:
11324 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11325 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11326 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11327 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11329 case OMP_CLAUSE_ALIGNED
:
11330 case OMP_CLAUSE_FROM
:
11331 case OMP_CLAUSE_TO
:
11332 case OMP_CLAUSE_MAP
:
11333 case OMP_CLAUSE__CACHE_
:
11334 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11335 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11336 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11338 case OMP_CLAUSE_REDUCTION
:
11341 for (i
= 0; i
< 4; i
++)
11342 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11343 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11347 gcc_unreachable ();
11355 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11356 But, we only want to walk once. */
11357 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11358 for (i
= 0; i
< len
; ++i
)
11359 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11360 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11364 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11365 defining. We only want to walk into these fields of a type in this
11366 case and not in the general case of a mere reference to the type.
11368 The criterion is as follows: if the field can be an expression, it
11369 must be walked only here. This should be in keeping with the fields
11370 that are directly gimplified in gimplify_type_sizes in order for the
11371 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11372 variable-sized types.
11374 Note that DECLs get walked as part of processing the BIND_EXPR. */
11375 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11377 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11378 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11381 /* Call the function for the type. See if it returns anything or
11382 doesn't want us to continue. If we are to continue, walk both
11383 the normal fields and those for the declaration case. */
11384 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11385 if (result
|| !walk_subtrees
)
11388 /* But do not walk a pointed-to type since it may itself need to
11389 be walked in the declaration case if it isn't anonymous. */
11390 if (!POINTER_TYPE_P (*type_p
))
11392 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11397 /* If this is a record type, also walk the fields. */
11398 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11402 for (field
= TYPE_FIELDS (*type_p
); field
;
11403 field
= DECL_CHAIN (field
))
11405 /* We'd like to look at the type of the field, but we can
11406 easily get infinite recursion. So assume it's pointed
11407 to elsewhere in the tree. Also, ignore things that
11409 if (TREE_CODE (field
) != FIELD_DECL
)
11412 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11413 WALK_SUBTREE (DECL_SIZE (field
));
11414 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11415 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11416 WALK_SUBTREE (DECL_QUALIFIER (field
));
11420 /* Same for scalar types. */
11421 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11422 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11423 || TREE_CODE (*type_p
) == INTEGER_TYPE
11424 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11425 || TREE_CODE (*type_p
) == REAL_TYPE
)
11427 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11428 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11431 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11432 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11437 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11441 /* Walk over all the sub-trees of this operand. */
11442 len
= TREE_OPERAND_LENGTH (*tp
);
11444 /* Go through the subtrees. We need to do this in forward order so
11445 that the scope of a FOR_EXPR is handled properly. */
11448 for (i
= 0; i
< len
- 1; ++i
)
11449 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11450 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11453 /* If this is a type, walk the needed fields in the type. */
11454 else if (TYPE_P (*tp
))
11455 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11459 /* We didn't find what we were looking for. */
11462 #undef WALK_SUBTREE_TAIL
11464 #undef WALK_SUBTREE
11466 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11469 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11474 hash_set
<tree
> pset
;
11475 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11481 tree_block (tree t
)
11483 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11485 if (IS_EXPR_CODE_CLASS (c
))
11486 return LOCATION_BLOCK (t
->exp
.locus
);
11487 gcc_unreachable ();
11492 tree_set_block (tree t
, tree b
)
11494 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11496 if (IS_EXPR_CODE_CLASS (c
))
11499 t
->exp
.locus
= COMBINE_LOCATION_DATA (line_table
, t
->exp
.locus
, b
);
11501 t
->exp
.locus
= LOCATION_LOCUS (t
->exp
.locus
);
11504 gcc_unreachable ();
11507 /* Create a nameless artificial label and put it in the current
11508 function context. The label has a location of LOC. Returns the
11509 newly created label. */
11512 create_artificial_label (location_t loc
)
11514 tree lab
= build_decl (loc
,
11515 LABEL_DECL
, NULL_TREE
, void_type_node
);
11517 DECL_ARTIFICIAL (lab
) = 1;
11518 DECL_IGNORED_P (lab
) = 1;
11519 DECL_CONTEXT (lab
) = current_function_decl
;
11523 /* Given a tree, try to return a useful variable name that we can use
11524 to prefix a temporary that is being assigned the value of the tree.
11525 I.E. given <temp> = &A, return A. */
11530 tree stripped_decl
;
11533 STRIP_NOPS (stripped_decl
);
11534 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11535 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11536 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11538 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11541 return IDENTIFIER_POINTER (name
);
11545 switch (TREE_CODE (stripped_decl
))
11548 return get_name (TREE_OPERAND (stripped_decl
, 0));
11555 /* Return true if TYPE has a variable argument list. */
11558 stdarg_p (const_tree fntype
)
11560 function_args_iterator args_iter
;
11561 tree n
= NULL_TREE
, t
;
11566 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11571 return n
!= NULL_TREE
&& n
!= void_type_node
;
11574 /* Return true if TYPE has a prototype. */
11577 prototype_p (tree fntype
)
11581 gcc_assert (fntype
!= NULL_TREE
);
11583 t
= TYPE_ARG_TYPES (fntype
);
11584 return (t
!= NULL_TREE
);
11587 /* If BLOCK is inlined from an __attribute__((__artificial__))
11588 routine, return pointer to location from where it has been
11591 block_nonartificial_location (tree block
)
11593 location_t
*ret
= NULL
;
11595 while (block
&& TREE_CODE (block
) == BLOCK
11596 && BLOCK_ABSTRACT_ORIGIN (block
))
11598 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11600 while (TREE_CODE (ao
) == BLOCK
11601 && BLOCK_ABSTRACT_ORIGIN (ao
)
11602 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11603 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11605 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11607 /* If AO is an artificial inline, point RET to the
11608 call site locus at which it has been inlined and continue
11609 the loop, in case AO's caller is also an artificial
11611 if (DECL_DECLARED_INLINE_P (ao
)
11612 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11613 ret
= &BLOCK_SOURCE_LOCATION (block
);
11617 else if (TREE_CODE (ao
) != BLOCK
)
11620 block
= BLOCK_SUPERCONTEXT (block
);
11626 /* If EXP is inlined from an __attribute__((__artificial__))
11627 function, return the location of the original call expression. */
11630 tree_nonartificial_location (tree exp
)
11632 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11637 return EXPR_LOCATION (exp
);
11641 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11644 /* Return the hash code code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11647 cl_option_hasher::hash (tree x
)
11649 const_tree
const t
= x
;
11653 hashval_t hash
= 0;
11655 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11657 p
= (const char *)TREE_OPTIMIZATION (t
);
11658 len
= sizeof (struct cl_optimization
);
11661 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11662 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11665 gcc_unreachable ();
11667 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11669 for (i
= 0; i
< len
; i
++)
11671 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11676 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11677 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11681 cl_option_hasher::equal (tree x
, tree y
)
11683 const_tree
const xt
= x
;
11684 const_tree
const yt
= y
;
11689 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11692 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11694 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11695 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11696 len
= sizeof (struct cl_optimization
);
11699 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11701 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11702 TREE_TARGET_OPTION (yt
));
11706 gcc_unreachable ();
11708 return (memcmp (xp
, yp
, len
) == 0);
11711 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11714 build_optimization_node (struct gcc_options
*opts
)
11718 /* Use the cache of optimization nodes. */
11720 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11723 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11727 /* Insert this one into the hash table. */
11728 t
= cl_optimization_node
;
11731 /* Make a new node for next time round. */
11732 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11738 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11741 build_target_option_node (struct gcc_options
*opts
)
11745 /* Use the cache of optimization nodes. */
11747 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11750 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11754 /* Insert this one into the hash table. */
11755 t
= cl_target_option_node
;
11758 /* Make a new node for next time round. */
11759 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11765 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11766 so that they aren't saved during PCH writing. */
11769 prepare_target_option_nodes_for_pch (void)
11771 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11772 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11773 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11774 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11777 /* Determine the "ultimate origin" of a block. The block may be an inlined
11778 instance of an inlined instance of a block which is local to an inline
11779 function, so we have to trace all of the way back through the origin chain
11780 to find out what sort of node actually served as the original seed for the
11784 block_ultimate_origin (const_tree block
)
11786 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11788 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11789 we're trying to output the abstract instance of this function. */
11790 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11793 if (immediate_origin
== NULL_TREE
)
11798 tree lookahead
= immediate_origin
;
11802 ret_val
= lookahead
;
11803 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11804 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11806 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11808 /* The block's abstract origin chain may not be the *ultimate* origin of
11809 the block. It could lead to a DECL that has an abstract origin set.
11810 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11811 will give us if it has one). Note that DECL's abstract origins are
11812 supposed to be the most distant ancestor (or so decl_ultimate_origin
11813 claims), so we don't need to loop following the DECL origins. */
11814 if (DECL_P (ret_val
))
11815 return DECL_ORIGIN (ret_val
);
11821 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11825 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11827 /* Use precision rather then machine mode when we can, which gives
11828 the correct answer even for submode (bit-field) types. */
11829 if ((INTEGRAL_TYPE_P (outer_type
)
11830 || POINTER_TYPE_P (outer_type
)
11831 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11832 && (INTEGRAL_TYPE_P (inner_type
)
11833 || POINTER_TYPE_P (inner_type
)
11834 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11835 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11837 /* Otherwise fall back on comparing machine modes (e.g. for
11838 aggregate types, floats). */
11839 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11842 /* Return true iff conversion in EXP generates no instruction. Mark
11843 it inline so that we fully inline into the stripping functions even
11844 though we have two uses of this function. */
11847 tree_nop_conversion (const_tree exp
)
11849 tree outer_type
, inner_type
;
11851 if (!CONVERT_EXPR_P (exp
)
11852 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11854 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11857 outer_type
= TREE_TYPE (exp
);
11858 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11863 return tree_nop_conversion_p (outer_type
, inner_type
);
11866 /* Return true iff conversion in EXP generates no instruction. Don't
11867 consider conversions changing the signedness. */
11870 tree_sign_nop_conversion (const_tree exp
)
11872 tree outer_type
, inner_type
;
11874 if (!tree_nop_conversion (exp
))
11877 outer_type
= TREE_TYPE (exp
);
11878 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11880 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11881 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11884 /* Strip conversions from EXP according to tree_nop_conversion and
11885 return the resulting expression. */
11888 tree_strip_nop_conversions (tree exp
)
11890 while (tree_nop_conversion (exp
))
11891 exp
= TREE_OPERAND (exp
, 0);
11895 /* Strip conversions from EXP according to tree_sign_nop_conversion
11896 and return the resulting expression. */
11899 tree_strip_sign_nop_conversions (tree exp
)
11901 while (tree_sign_nop_conversion (exp
))
11902 exp
= TREE_OPERAND (exp
, 0);
11906 /* Avoid any floating point extensions from EXP. */
11908 strip_float_extensions (tree exp
)
11910 tree sub
, expt
, subt
;
11912 /* For floating point constant look up the narrowest type that can hold
11913 it properly and handle it like (type)(narrowest_type)constant.
11914 This way we can optimize for instance a=a*2.0 where "a" is float
11915 but 2.0 is double constant. */
11916 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11918 REAL_VALUE_TYPE orig
;
11921 orig
= TREE_REAL_CST (exp
);
11922 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11923 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11924 type
= float_type_node
;
11925 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11926 > TYPE_PRECISION (double_type_node
)
11927 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11928 type
= double_type_node
;
11930 return build_real (type
, real_value_truncate (TYPE_MODE (type
), orig
));
11933 if (!CONVERT_EXPR_P (exp
))
11936 sub
= TREE_OPERAND (exp
, 0);
11937 subt
= TREE_TYPE (sub
);
11938 expt
= TREE_TYPE (exp
);
11940 if (!FLOAT_TYPE_P (subt
))
11943 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11946 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11949 return strip_float_extensions (sub
);
11952 /* Strip out all handled components that produce invariant
11956 strip_invariant_refs (const_tree op
)
11958 while (handled_component_p (op
))
11960 switch (TREE_CODE (op
))
11963 case ARRAY_RANGE_REF
:
11964 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11965 || TREE_OPERAND (op
, 2) != NULL_TREE
11966 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11970 case COMPONENT_REF
:
11971 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11977 op
= TREE_OPERAND (op
, 0);
11983 static GTY(()) tree gcc_eh_personality_decl
;
11985 /* Return the GCC personality function decl. */
11988 lhd_gcc_personality (void)
11990 if (!gcc_eh_personality_decl
)
11991 gcc_eh_personality_decl
= build_personality_function ("gcc");
11992 return gcc_eh_personality_decl
;
11995 /* TARGET is a call target of GIMPLE call statement
11996 (obtained by gimple_call_fn). Return true if it is
11997 OBJ_TYPE_REF representing an virtual call of C++ method.
11998 (As opposed to OBJ_TYPE_REF representing objc calls
11999 through a cast where middle-end devirtualization machinery
12003 virtual_method_call_p (tree target
)
12005 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12007 tree t
= TREE_TYPE (target
);
12008 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12010 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12012 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12013 /* If we do not have BINFO associated, it means that type was built
12014 without devirtualization enabled. Do not consider this a virtual
12016 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12021 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12024 obj_type_ref_class (tree ref
)
12026 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12027 ref
= TREE_TYPE (ref
);
12028 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12029 ref
= TREE_TYPE (ref
);
12030 /* We look for type THIS points to. ObjC also builds
12031 OBJ_TYPE_REF with non-method calls, Their first parameter
12032 ID however also corresponds to class type. */
12033 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12034 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12035 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12036 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12037 return TREE_TYPE (ref
);
12040 /* Return true if T is in anonymous namespace. */
12043 type_in_anonymous_namespace_p (const_tree t
)
12045 /* TREE_PUBLIC of TYPE_STUB_DECL may not be properly set for
12046 bulitin types; those have CONTEXT NULL. */
12047 if (!TYPE_CONTEXT (t
))
12049 return (TYPE_STUB_DECL (t
) && !TREE_PUBLIC (TYPE_STUB_DECL (t
)));
12052 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12055 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12058 tree base_binfo
, b
;
12060 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12061 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12062 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12064 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12069 /* Try to find a base info of BINFO that would have its field decl at offset
12070 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12071 found, return, otherwise return NULL_TREE. */
12074 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12076 tree type
= BINFO_TYPE (binfo
);
12080 HOST_WIDE_INT pos
, size
;
12084 if (types_same_for_odr (type
, expected_type
))
12089 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12091 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12094 pos
= int_bit_position (fld
);
12095 size
= tree_to_uhwi (DECL_SIZE (fld
));
12096 if (pos
<= offset
&& (pos
+ size
) > offset
)
12099 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12102 /* Offset 0 indicates the primary base, whose vtable contents are
12103 represented in the binfo for the derived class. */
12104 else if (offset
!= 0)
12106 tree found_binfo
= NULL
, base_binfo
;
12107 /* Offsets in BINFO are in bytes relative to the whole structure
12108 while POS is in bits relative to the containing field. */
12109 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12112 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12113 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12114 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12116 found_binfo
= base_binfo
;
12120 binfo
= found_binfo
;
12122 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12126 type
= TREE_TYPE (fld
);
12131 /* Returns true if X is a typedef decl. */
12134 is_typedef_decl (tree x
)
12136 return (x
&& TREE_CODE (x
) == TYPE_DECL
12137 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12140 /* Returns true iff TYPE is a type variant created for a typedef. */
12143 typedef_variant_p (tree type
)
12145 return is_typedef_decl (TYPE_NAME (type
));
12148 /* Warn about a use of an identifier which was marked deprecated. */
12150 warn_deprecated_use (tree node
, tree attr
)
12154 if (node
== 0 || !warn_deprecated_decl
)
12160 attr
= DECL_ATTRIBUTES (node
);
12161 else if (TYPE_P (node
))
12163 tree decl
= TYPE_STUB_DECL (node
);
12165 attr
= lookup_attribute ("deprecated",
12166 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12171 attr
= lookup_attribute ("deprecated", attr
);
12174 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12182 w
= warning (OPT_Wdeprecated_declarations
,
12183 "%qD is deprecated: %s", node
, msg
);
12185 w
= warning (OPT_Wdeprecated_declarations
,
12186 "%qD is deprecated", node
);
12188 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12190 else if (TYPE_P (node
))
12192 tree what
= NULL_TREE
;
12193 tree decl
= TYPE_STUB_DECL (node
);
12195 if (TYPE_NAME (node
))
12197 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12198 what
= TYPE_NAME (node
);
12199 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12200 && DECL_NAME (TYPE_NAME (node
)))
12201 what
= DECL_NAME (TYPE_NAME (node
));
12209 w
= warning (OPT_Wdeprecated_declarations
,
12210 "%qE is deprecated: %s", what
, msg
);
12212 w
= warning (OPT_Wdeprecated_declarations
,
12213 "%qE is deprecated", what
);
12218 w
= warning (OPT_Wdeprecated_declarations
,
12219 "type is deprecated: %s", msg
);
12221 w
= warning (OPT_Wdeprecated_declarations
,
12222 "type is deprecated");
12225 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12232 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12235 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12240 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12243 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12249 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12250 somewhere in it. */
12253 contains_bitfld_component_ref_p (const_tree ref
)
12255 while (handled_component_p (ref
))
12257 if (TREE_CODE (ref
) == COMPONENT_REF
12258 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12260 ref
= TREE_OPERAND (ref
, 0);
12266 /* Try to determine whether a TRY_CATCH expression can fall through.
12267 This is a subroutine of block_may_fallthru. */
12270 try_catch_may_fallthru (const_tree stmt
)
12272 tree_stmt_iterator i
;
12274 /* If the TRY block can fall through, the whole TRY_CATCH can
12276 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12279 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12280 switch (TREE_CODE (tsi_stmt (i
)))
12283 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12284 catch expression and a body. The whole TRY_CATCH may fall
12285 through iff any of the catch bodies falls through. */
12286 for (; !tsi_end_p (i
); tsi_next (&i
))
12288 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12293 case EH_FILTER_EXPR
:
12294 /* The exception filter expression only matters if there is an
12295 exception. If the exception does not match EH_FILTER_TYPES,
12296 we will execute EH_FILTER_FAILURE, and we will fall through
12297 if that falls through. If the exception does match
12298 EH_FILTER_TYPES, the stack unwinder will continue up the
12299 stack, so we will not fall through. We don't know whether we
12300 will throw an exception which matches EH_FILTER_TYPES or not,
12301 so we just ignore EH_FILTER_TYPES and assume that we might
12302 throw an exception which doesn't match. */
12303 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12306 /* This case represents statements to be executed when an
12307 exception occurs. Those statements are implicitly followed
12308 by a RESX statement to resume execution after the exception.
12309 So in this case the TRY_CATCH never falls through. */
12314 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12315 need not be 100% accurate; simply be conservative and return true if we
12316 don't know. This is used only to avoid stupidly generating extra code.
12317 If we're wrong, we'll just delete the extra code later. */
12320 block_may_fallthru (const_tree block
)
12322 /* This CONST_CAST is okay because expr_last returns its argument
12323 unmodified and we assign it to a const_tree. */
12324 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12326 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12330 /* Easy cases. If the last statement of the block implies
12331 control transfer, then we can't fall through. */
12335 /* If SWITCH_LABELS is set, this is lowered, and represents a
12336 branch to a selected label and hence can not fall through.
12337 Otherwise SWITCH_BODY is set, and the switch can fall
12339 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12342 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12344 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12347 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12349 case TRY_CATCH_EXPR
:
12350 return try_catch_may_fallthru (stmt
);
12352 case TRY_FINALLY_EXPR
:
12353 /* The finally clause is always executed after the try clause,
12354 so if it does not fall through, then the try-finally will not
12355 fall through. Otherwise, if the try clause does not fall
12356 through, then when the finally clause falls through it will
12357 resume execution wherever the try clause was going. So the
12358 whole try-finally will only fall through if both the try
12359 clause and the finally clause fall through. */
12360 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12361 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12364 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12365 stmt
= TREE_OPERAND (stmt
, 1);
12371 /* Functions that do not return do not fall through. */
12372 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12374 case CLEANUP_POINT_EXPR
:
12375 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12378 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12384 return lang_hooks
.block_may_fallthru (stmt
);
12388 /* True if we are using EH to handle cleanups. */
12389 static bool using_eh_for_cleanups_flag
= false;
12391 /* This routine is called from front ends to indicate eh should be used for
12394 using_eh_for_cleanups (void)
12396 using_eh_for_cleanups_flag
= true;
12399 /* Query whether EH is used for cleanups. */
12401 using_eh_for_cleanups_p (void)
12403 return using_eh_for_cleanups_flag
;
12406 /* Wrapper for tree_code_name to ensure that tree code is valid */
12408 get_tree_code_name (enum tree_code code
)
12410 const char *invalid
= "<invalid tree code>";
12412 if (code
>= MAX_TREE_CODES
)
12415 return tree_code_name
[code
];
12418 /* Drops the TREE_OVERFLOW flag from T. */
12421 drop_tree_overflow (tree t
)
12423 gcc_checking_assert (TREE_OVERFLOW (t
));
12425 /* For tree codes with a sharing machinery re-build the result. */
12426 if (TREE_CODE (t
) == INTEGER_CST
)
12427 return wide_int_to_tree (TREE_TYPE (t
), t
);
12429 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12430 and drop the flag. */
12432 TREE_OVERFLOW (t
) = 0;
12436 /* Given a memory reference expression T, return its base address.
12437 The base address of a memory reference expression is the main
12438 object being referenced. For instance, the base address for
12439 'array[i].fld[j]' is 'array'. You can think of this as stripping
12440 away the offset part from a memory address.
12442 This function calls handled_component_p to strip away all the inner
12443 parts of the memory reference until it reaches the base object. */
12446 get_base_address (tree t
)
12448 while (handled_component_p (t
))
12449 t
= TREE_OPERAND (t
, 0);
12451 if ((TREE_CODE (t
) == MEM_REF
12452 || TREE_CODE (t
) == TARGET_MEM_REF
)
12453 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12454 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12456 /* ??? Either the alias oracle or all callers need to properly deal
12457 with WITH_SIZE_EXPRs before we can look through those. */
12458 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12464 /* Return the machine mode of T. For vectors, returns the mode of the
12465 inner type. The main use case is to feed the result to HONOR_NANS,
12466 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12469 element_mode (const_tree t
)
12473 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12475 return TYPE_MODE (t
);
12478 /* Veirfy that basic properties of T match TV and thus T can be a variant of
12479 TV. TV should be the more specified variant (i.e. the main variant). */
12482 verify_type_variant (const_tree t
, tree tv
)
12484 if (TREE_CODE (t
) != TREE_CODE (tv
))
12486 error ("type variant has different TREE_CODE");
12490 if (COMPLETE_TYPE_P (t
) && TYPE_SIZE (t
) != TYPE_SIZE (tv
))
12492 error ("type variant has different TYPE_SIZE");
12494 error ("type variant's TYPE_SIZE");
12495 debug_tree (TYPE_SIZE (tv
));
12496 error ("type's TYPE_SIZE");
12497 debug_tree (TYPE_SIZE (t
));
12500 if (COMPLETE_TYPE_P (t
)
12501 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
12502 /* FIXME: ideally we should compare pointer equality, but java FE produce
12503 variants where size is INTEGER_CST of different type (int wrt size_type)
12504 during libjava biuld. */
12505 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
12507 error ("type variant has different TYPE_SIZE_UNIT");
12509 error ("type variant's TYPE_SIZE_UNIT");
12510 debug_tree (TYPE_SIZE_UNIT (tv
));
12511 error ("type's TYPE_SIZE_UNIT");
12512 debug_tree (TYPE_SIZE_UNIT (t
));
12515 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12516 and danagle the pointer from time to time. */
12517 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12518 && (!TYPE_VFIELD (tv
) || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
12520 error ("type variant has different TYPE_VFIELD");
12524 if (((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
12525 || TREE_CODE (t
) == INTEGER_TYPE
12526 || TREE_CODE (t
) == BOOLEAN_TYPE
12527 || TREE_CODE (t
) == REAL_TYPE
12528 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12529 && (TYPE_MAX_VALUE (t
) != TYPE_MAX_VALUE (tv
)
12530 || TYPE_MIN_VALUE (t
) != TYPE_MIN_VALUE (tv
)))
12532 error ("type variant has different TYPE_MAX_VALUE or TYPE_MIN_VALUE");
12536 if (TREE_CODE (t
) == METHOD_TYPE
12537 && TYPE_METHOD_BASETYPE (t
) != TYPE_METHOD_BASETYPE (tv
))
12539 error ("type variant has different TYPE_METHOD_BASETYPE");
12543 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
12545 error ("type variant has TYPE_METHODS");
12549 if (TREE_CODE (t
) == OFFSET_TYPE
12550 && TYPE_OFFSET_BASETYPE (t
) != TYPE_OFFSET_BASETYPE (tv
))
12552 error ("type variant has different TYPE_OFFSET_BASETYPE");
12556 if (TREE_CODE (t
) == ARRAY_TYPE
12557 && TYPE_ARRAY_MAX_SIZE (t
) != TYPE_ARRAY_MAX_SIZE (tv
))
12559 error ("type variant has different TYPE_ARRAY_MAX_SIZE");
12563 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12564 or even type's main variant. This is needed to make bootstrap pass
12565 and the bug seems new in GCC 5.
12566 C++ FE should be updated to make this consistent and we should check
12567 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12568 is a match with main variant.
12570 Also disable the check for Java for now because of parser hack that builds
12571 first an dummy BINFO and then sometimes replace it by real BINFO in some
12573 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
12574 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
12575 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12576 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12577 at LTO time only. */
12578 && (in_lto_p
&& odr_type_p (t
)))
12580 error ("type variant has different TYPE_BINFO");
12582 error ("type variant's TYPE_BINFO");
12583 debug_tree (TYPE_BINFO (tv
));
12584 error ("type's TYPE_BINFO");
12585 debug_tree (TYPE_BINFO (t
));
12589 /* Check various uses of TYPE_VALUES_RAW. */
12590 if (TREE_CODE (t
) == ENUMERAL_TYPE
12591 && TYPE_VALUES (t
) != TYPE_VALUES (tv
))
12593 error ("type variant has different TYPE_VALUES");
12595 error ("type variant's TYPE_VALUES");
12596 debug_tree (TYPE_VALUES (tv
));
12597 error ("type's TYPE_VALUES");
12598 debug_tree (TYPE_VALUES (t
));
12601 else if (TREE_CODE (t
) == ARRAY_TYPE
12602 && TYPE_DOMAIN (t
) != TYPE_DOMAIN (tv
))
12604 error ("type variant has different TYPE_DOMAIN");
12606 error ("type variant's TYPE_DOMAIN");
12607 debug_tree (TYPE_DOMAIN (tv
));
12608 error ("type's TYPE_DOMAIN");
12609 debug_tree (TYPE_DOMAIN (t
));
12612 /* Permit incomplete variants of complete type. While FEs may complete
12613 all variants, this does not happen for C++ templates in all cases. */
12614 else if (RECORD_OR_UNION_TYPE_P (t
)
12615 && COMPLETE_TYPE_P (t
)
12616 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
12620 /* Fortran builds qualified variants as new records with items of
12621 qualified type. Verify that they looks same. */
12622 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
12624 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
12625 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
12626 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
12627 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
12628 /* FIXME: gfc_nonrestricted_type builds all types as variants
12629 with exception of pointer types. It deeply copies the type
12630 which means that we may end up with a variant type
12631 referring non-variant pointer. We may change it to
12632 produce types as variants, too, like
12633 objc_get_protocol_qualified_type does. */
12634 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
12635 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
12636 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
12640 error ("type variant has different TYPE_FIELDS");
12642 error ("first mismatch is field");
12644 error ("and field");
12649 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
12650 && TYPE_ARG_TYPES (t
) != TYPE_ARG_TYPES (tv
))
12652 error ("type variant has different TYPE_ARG_TYPES");
12656 /* For C++ the qualified variant of array type is really an array type
12657 of qualified TREE_TYPE.
12658 objc builds variants of pointer where pointer to type is a variant, too
12659 in objc_get_protocol_qualified_type. */
12660 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
12661 && ((TREE_CODE (t
) != ARRAY_TYPE
12662 && !POINTER_TYPE_P (t
))
12663 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
12664 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
12666 error ("type variant has different TREE_TYPE");
12668 error ("type variant's TREE_TYPE");
12669 debug_tree (TREE_TYPE (tv
));
12670 error ("type's TREE_TYPE");
12671 debug_tree (TREE_TYPE (t
));
12674 if (TYPE_PRECISION (t
) != TYPE_PRECISION (tv
))
12676 error ("type variant has different TYPE_PRECISION");
12683 /* Verify type T. */
12686 verify_type (const_tree t
)
12688 bool error_found
= false;
12689 tree mv
= TYPE_MAIN_VARIANT (t
);
12692 error ("Main variant is not defined");
12693 error_found
= true;
12695 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
12697 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
12699 error_found
= true;
12701 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
12702 error_found
= true;
12704 /* Check various uses of TYPE_MINVAL. */
12705 if (RECORD_OR_UNION_TYPE_P (t
))
12707 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12708 and danagle the pointer from time to time. */
12709 if (TYPE_VFIELD (t
)
12710 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
12711 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
12713 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
12714 debug_tree (TYPE_VFIELD (t
));
12715 error_found
= true;
12718 else if (TREE_CODE (t
) == POINTER_TYPE
)
12720 if (TYPE_NEXT_PTR_TO (t
)
12721 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
12723 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
12724 debug_tree (TYPE_NEXT_PTR_TO (t
));
12725 error_found
= true;
12728 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
12730 if (TYPE_NEXT_REF_TO (t
)
12731 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
12733 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
12734 debug_tree (TYPE_NEXT_REF_TO (t
));
12735 error_found
= true;
12738 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
12739 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12741 /* FIXME: The following check should pass:
12742 useless_type_conversion_p (const_cast <tree> (t),
12743 TREE_TYPE (TYPE_MIN_VALUE (t))
12744 but does not for C sizetypes in LTO. */
12746 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
12747 else if (TYPE_MINVAL (t
)
12748 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
12751 error ("TYPE_MINVAL non-NULL");
12752 debug_tree (TYPE_MINVAL (t
));
12753 error_found
= true;
12756 /* Check various uses of TYPE_MAXVAL. */
12757 if (RECORD_OR_UNION_TYPE_P (t
))
12759 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
12760 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
12761 && TYPE_METHODS (t
) != error_mark_node
)
12763 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
12764 debug_tree (TYPE_METHODS (t
));
12765 error_found
= true;
12768 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
12770 if (TYPE_METHOD_BASETYPE (t
)
12771 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
12772 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
12774 error ("TYPE_METHOD_BASETYPE is not record nor union");
12775 debug_tree (TYPE_METHOD_BASETYPE (t
));
12776 error_found
= true;
12779 else if (TREE_CODE (t
) == OFFSET_TYPE
)
12781 if (TYPE_OFFSET_BASETYPE (t
)
12782 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
12783 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
12785 error ("TYPE_OFFSET_BASETYPE is not record nor union");
12786 debug_tree (TYPE_OFFSET_BASETYPE (t
));
12787 error_found
= true;
12790 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
12791 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12793 /* FIXME: The following check should pass:
12794 useless_type_conversion_p (const_cast <tree> (t),
12795 TREE_TYPE (TYPE_MAX_VALUE (t))
12796 but does not for C sizetypes in LTO. */
12798 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12800 if (TYPE_ARRAY_MAX_SIZE (t
)
12801 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
12803 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
12804 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
12805 error_found
= true;
12808 else if (TYPE_MAXVAL (t
))
12810 error ("TYPE_MAXVAL non-NULL");
12811 debug_tree (TYPE_MAXVAL (t
));
12812 error_found
= true;
12815 /* Check various uses of TYPE_BINFO. */
12816 if (RECORD_OR_UNION_TYPE_P (t
))
12818 if (!TYPE_BINFO (t
))
12820 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
12822 error ("TYPE_BINFO is not TREE_BINFO");
12823 debug_tree (TYPE_BINFO (t
));
12824 error_found
= true;
12826 /* FIXME: Java builds invalid empty binfos that do not have
12828 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
12830 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
12831 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
12832 error_found
= true;
12835 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
12837 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
12838 debug_tree (TYPE_LANG_SLOT_1 (t
));
12839 error_found
= true;
12842 /* Check various uses of TYPE_VALUES_RAW. */
12843 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
12844 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
12846 tree value
= TREE_VALUE (l
);
12847 tree name
= TREE_PURPOSE (l
);
12849 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
12850 CONST_DECL of ENUMERAL TYPE. */
12851 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
12853 error ("Enum value is not CONST_DECL or INTEGER_CST");
12854 debug_tree (value
);
12856 error_found
= true;
12858 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
12859 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
12861 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
12862 debug_tree (value
);
12864 error_found
= true;
12866 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
12868 error ("Enum value name is not IDENTIFIER_NODE");
12869 debug_tree (value
);
12871 error_found
= true;
12874 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12876 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
12878 error ("Array TYPE_DOMAIN is not integer type");
12879 debug_tree (TYPE_DOMAIN (t
));
12880 error_found
= true;
12883 else if (RECORD_OR_UNION_TYPE_P (t
))
12884 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
12886 /* TODO: verify properties of decls. */
12887 if (TREE_CODE (fld
) == FIELD_DECL
)
12889 else if (TREE_CODE (fld
) == TYPE_DECL
)
12891 else if (TREE_CODE (fld
) == CONST_DECL
)
12893 else if (TREE_CODE (fld
) == VAR_DECL
)
12895 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
12897 else if (TREE_CODE (fld
) == USING_DECL
)
12901 error ("Wrong tree in TYPE_FIELDS list");
12903 error_found
= true;
12906 else if (TREE_CODE (t
) == INTEGER_TYPE
12907 || TREE_CODE (t
) == BOOLEAN_TYPE
12908 || TREE_CODE (t
) == OFFSET_TYPE
12909 || TREE_CODE (t
) == REFERENCE_TYPE
12910 || TREE_CODE (t
) == NULLPTR_TYPE
12911 || TREE_CODE (t
) == POINTER_TYPE
)
12913 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
12915 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
12916 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
12917 error_found
= true;
12919 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
12921 error ("TYPE_CACHED_VALUES is not TREE_VEC");
12922 debug_tree (TYPE_CACHED_VALUES (t
));
12923 error_found
= true;
12925 /* Verify just enough of cache to ensure that no one copied it to new type.
12926 All copying should go by copy_node that should clear it. */
12927 else if (TYPE_CACHED_VALUES_P (t
))
12930 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
12931 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
12932 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
12934 error ("wrong TYPE_CACHED_VALUES entry");
12935 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
12936 error_found
= true;
12941 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
12942 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
12944 /* C++ FE uses TREE_PURPOSE to store initial values. */
12945 if (TREE_PURPOSE (l
) && in_lto_p
)
12947 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
12949 error_found
= true;
12951 if (!TYPE_P (TREE_VALUE (l
)))
12953 error ("Wrong entry in TYPE_ARG_TYPES list");
12955 error_found
= true;
12958 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
12960 error ("TYPE_VALUES_RAW field is non-NULL");
12961 debug_tree (TYPE_VALUES_RAW (t
));
12962 error_found
= true;
12964 if (TREE_CODE (t
) != INTEGER_TYPE
12965 && TREE_CODE (t
) != BOOLEAN_TYPE
12966 && TREE_CODE (t
) != OFFSET_TYPE
12967 && TREE_CODE (t
) != REFERENCE_TYPE
12968 && TREE_CODE (t
) != NULLPTR_TYPE
12969 && TREE_CODE (t
) != POINTER_TYPE
12970 && TYPE_CACHED_VALUES_P (t
))
12972 error ("TYPE_CACHED_VALUES_P is set while it should not");
12973 error_found
= true;
12979 debug_tree (const_cast <tree
> (t
));
12980 internal_error ("verify_type failed");
12984 #include "gt-tree.h"