1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2018 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 can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
65 #include "stringpool.h"
69 #include "tree-vector-builder.h"
71 /* Tree code classes. */
73 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
74 #define END_OF_BASE_TREE_CODES tcc_exceptional,
76 const enum tree_code_class tree_code_type
[] = {
77 #include "all-tree.def"
81 #undef END_OF_BASE_TREE_CODES
83 /* Table indexed by tree code giving number of expression
84 operands beyond the fixed part of the node structure.
85 Not used for types or decls. */
87 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
88 #define END_OF_BASE_TREE_CODES 0,
90 const unsigned char tree_code_length
[] = {
91 #include "all-tree.def"
95 #undef END_OF_BASE_TREE_CODES
97 /* Names of tree components.
98 Used for printing out the tree and error messages. */
99 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
100 #define END_OF_BASE_TREE_CODES "@dummy",
102 static const char *const tree_code_name
[] = {
103 #include "all-tree.def"
107 #undef END_OF_BASE_TREE_CODES
109 /* Each tree code class has an associated string representation.
110 These must correspond to the tree_code_class entries. */
112 const char *const tree_code_class_strings
[] =
127 /* obstack.[ch] explicitly declined to prototype this. */
128 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
130 /* Statistics-gathering stuff. */
132 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
133 uint64_t tree_node_counts
[(int) all_kinds
];
134 uint64_t tree_node_sizes
[(int) all_kinds
];
136 /* Keep in sync with tree.h:enum tree_node_kind. */
137 static const char * const tree_node_kind_names
[] = {
156 /* Unique id for next decl created. */
157 static GTY(()) int next_decl_uid
;
158 /* Unique id for next type created. */
159 static GTY(()) unsigned next_type_uid
= 1;
160 /* Unique id for next debug decl created. Use negative numbers,
161 to catch erroneous uses. */
162 static GTY(()) int next_debug_decl_uid
;
164 /* Since we cannot rehash a type after it is in the table, we have to
165 keep the hash code. */
167 struct GTY((for_user
)) type_hash
{
172 /* Initial size of the hash table (rounded to next prime). */
173 #define TYPE_HASH_INITIAL_SIZE 1000
175 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
177 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
178 static bool equal (type_hash
*a
, type_hash
*b
);
181 keep_cache_entry (type_hash
*&t
)
183 return ggc_marked_p (t
->type
);
187 /* Now here is the hash table. When recording a type, it is added to
188 the slot whose index is the hash code. Note that the hash table is
189 used for several kinds of types (function types, array types and
190 array index range types, for now). While all these live in the
191 same table, they are completely independent, and the hash code is
192 computed differently for each of these. */
194 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
196 /* Hash table and temporary node for larger integer const values. */
197 static GTY (()) tree int_cst_node
;
199 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
201 static hashval_t
hash (tree t
);
202 static bool equal (tree x
, tree y
);
205 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
207 /* Class and variable for making sure that there is a single POLY_INT_CST
208 for a given value. */
209 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
211 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
212 static hashval_t
hash (tree t
);
213 static bool equal (tree x
, const compare_type
&y
);
216 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
218 /* Hash table for optimization flags and target option flags. Use the same
219 hash table for both sets of options. Nodes for building the current
220 optimization and target option nodes. The assumption is most of the time
221 the options created will already be in the hash table, so we avoid
222 allocating and freeing up a node repeatably. */
223 static GTY (()) tree cl_optimization_node
;
224 static GTY (()) tree cl_target_option_node
;
226 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
228 static hashval_t
hash (tree t
);
229 static bool equal (tree x
, tree y
);
232 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
234 /* General tree->tree mapping structure for use in hash tables. */
238 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
241 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
243 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
245 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
248 equal (tree_vec_map
*a
, tree_vec_map
*b
)
250 return a
->base
.from
== b
->base
.from
;
254 keep_cache_entry (tree_vec_map
*&m
)
256 return ggc_marked_p (m
->base
.from
);
261 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
263 static void set_type_quals (tree
, int);
264 static void print_type_hash_statistics (void);
265 static void print_debug_expr_statistics (void);
266 static void print_value_expr_statistics (void);
268 tree global_trees
[TI_MAX
];
269 tree integer_types
[itk_none
];
271 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
272 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
274 bool tree_contains_struct
[MAX_TREE_CODES
][64];
276 /* Number of operands for each OpenMP clause. */
277 unsigned const char omp_clause_num_ops
[] =
279 0, /* OMP_CLAUSE_ERROR */
280 1, /* OMP_CLAUSE_PRIVATE */
281 1, /* OMP_CLAUSE_SHARED */
282 1, /* OMP_CLAUSE_FIRSTPRIVATE */
283 2, /* OMP_CLAUSE_LASTPRIVATE */
284 5, /* OMP_CLAUSE_REDUCTION */
285 1, /* OMP_CLAUSE_COPYIN */
286 1, /* OMP_CLAUSE_COPYPRIVATE */
287 3, /* OMP_CLAUSE_LINEAR */
288 2, /* OMP_CLAUSE_ALIGNED */
289 1, /* OMP_CLAUSE_DEPEND */
290 1, /* OMP_CLAUSE_UNIFORM */
291 1, /* OMP_CLAUSE_TO_DECLARE */
292 1, /* OMP_CLAUSE_LINK */
293 2, /* OMP_CLAUSE_FROM */
294 2, /* OMP_CLAUSE_TO */
295 2, /* OMP_CLAUSE_MAP */
296 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
297 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
298 2, /* OMP_CLAUSE__CACHE_ */
299 2, /* OMP_CLAUSE_GANG */
300 1, /* OMP_CLAUSE_ASYNC */
301 1, /* OMP_CLAUSE_WAIT */
302 0, /* OMP_CLAUSE_AUTO */
303 0, /* OMP_CLAUSE_SEQ */
304 1, /* OMP_CLAUSE__LOOPTEMP_ */
305 1, /* OMP_CLAUSE_IF */
306 1, /* OMP_CLAUSE_NUM_THREADS */
307 1, /* OMP_CLAUSE_SCHEDULE */
308 0, /* OMP_CLAUSE_NOWAIT */
309 1, /* OMP_CLAUSE_ORDERED */
310 0, /* OMP_CLAUSE_DEFAULT */
311 3, /* OMP_CLAUSE_COLLAPSE */
312 0, /* OMP_CLAUSE_UNTIED */
313 1, /* OMP_CLAUSE_FINAL */
314 0, /* OMP_CLAUSE_MERGEABLE */
315 1, /* OMP_CLAUSE_DEVICE */
316 1, /* OMP_CLAUSE_DIST_SCHEDULE */
317 0, /* OMP_CLAUSE_INBRANCH */
318 0, /* OMP_CLAUSE_NOTINBRANCH */
319 1, /* OMP_CLAUSE_NUM_TEAMS */
320 1, /* OMP_CLAUSE_THREAD_LIMIT */
321 0, /* OMP_CLAUSE_PROC_BIND */
322 1, /* OMP_CLAUSE_SAFELEN */
323 1, /* OMP_CLAUSE_SIMDLEN */
324 0, /* OMP_CLAUSE_FOR */
325 0, /* OMP_CLAUSE_PARALLEL */
326 0, /* OMP_CLAUSE_SECTIONS */
327 0, /* OMP_CLAUSE_TASKGROUP */
328 1, /* OMP_CLAUSE_PRIORITY */
329 1, /* OMP_CLAUSE_GRAINSIZE */
330 1, /* OMP_CLAUSE_NUM_TASKS */
331 0, /* OMP_CLAUSE_NOGROUP */
332 0, /* OMP_CLAUSE_THREADS */
333 0, /* OMP_CLAUSE_SIMD */
334 1, /* OMP_CLAUSE_HINT */
335 0, /* OMP_CLAUSE_DEFALTMAP */
336 1, /* OMP_CLAUSE__SIMDUID_ */
337 0, /* OMP_CLAUSE__SIMT_ */
338 0, /* OMP_CLAUSE_INDEPENDENT */
339 1, /* OMP_CLAUSE_WORKER */
340 1, /* OMP_CLAUSE_VECTOR */
341 1, /* OMP_CLAUSE_NUM_GANGS */
342 1, /* OMP_CLAUSE_NUM_WORKERS */
343 1, /* OMP_CLAUSE_VECTOR_LENGTH */
344 3, /* OMP_CLAUSE_TILE */
345 2, /* OMP_CLAUSE__GRIDDIM_ */
346 0, /* OMP_CLAUSE_IF_PRESENT */
347 0, /* OMP_CLAUSE_FINALIZE */
350 const char * const omp_clause_code_name
[] =
424 /* Return the tree node structure used by tree code CODE. */
426 static inline enum tree_node_structure_enum
427 tree_node_structure_for_code (enum tree_code code
)
429 switch (TREE_CODE_CLASS (code
))
431 case tcc_declaration
:
436 return TS_FIELD_DECL
;
442 return TS_LABEL_DECL
;
444 return TS_RESULT_DECL
;
445 case DEBUG_EXPR_DECL
:
448 return TS_CONST_DECL
;
452 return TS_FUNCTION_DECL
;
453 case TRANSLATION_UNIT_DECL
:
454 return TS_TRANSLATION_UNIT_DECL
;
456 return TS_DECL_NON_COMMON
;
460 return TS_TYPE_NON_COMMON
;
469 default: /* tcc_constant and tcc_exceptional */
474 /* tcc_constant cases. */
475 case VOID_CST
: return TS_TYPED
;
476 case INTEGER_CST
: return TS_INT_CST
;
477 case POLY_INT_CST
: return TS_POLY_INT_CST
;
478 case REAL_CST
: return TS_REAL_CST
;
479 case FIXED_CST
: return TS_FIXED_CST
;
480 case COMPLEX_CST
: return TS_COMPLEX
;
481 case VECTOR_CST
: return TS_VECTOR
;
482 case STRING_CST
: return TS_STRING
;
483 /* tcc_exceptional cases. */
484 case ERROR_MARK
: return TS_COMMON
;
485 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
486 case TREE_LIST
: return TS_LIST
;
487 case TREE_VEC
: return TS_VEC
;
488 case SSA_NAME
: return TS_SSA_NAME
;
489 case PLACEHOLDER_EXPR
: return TS_COMMON
;
490 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
491 case BLOCK
: return TS_BLOCK
;
492 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
493 case TREE_BINFO
: return TS_BINFO
;
494 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
495 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
496 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
504 /* Initialize tree_contains_struct to describe the hierarchy of tree
508 initialize_tree_contains_struct (void)
512 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
515 enum tree_node_structure_enum ts_code
;
517 code
= (enum tree_code
) i
;
518 ts_code
= tree_node_structure_for_code (code
);
520 /* Mark the TS structure itself. */
521 tree_contains_struct
[code
][ts_code
] = 1;
523 /* Mark all the structures that TS is derived from. */
528 case TS_OPTIMIZATION
:
529 case TS_TARGET_OPTION
:
535 case TS_POLY_INT_CST
:
544 case TS_STATEMENT_LIST
:
545 MARK_TS_TYPED (code
);
549 case TS_DECL_MINIMAL
:
555 MARK_TS_COMMON (code
);
558 case TS_TYPE_WITH_LANG_SPECIFIC
:
559 MARK_TS_TYPE_COMMON (code
);
562 case TS_TYPE_NON_COMMON
:
563 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
567 MARK_TS_DECL_MINIMAL (code
);
572 MARK_TS_DECL_COMMON (code
);
575 case TS_DECL_NON_COMMON
:
576 MARK_TS_DECL_WITH_VIS (code
);
579 case TS_DECL_WITH_VIS
:
583 MARK_TS_DECL_WRTL (code
);
587 MARK_TS_DECL_COMMON (code
);
591 MARK_TS_DECL_WITH_VIS (code
);
595 case TS_FUNCTION_DECL
:
596 MARK_TS_DECL_NON_COMMON (code
);
599 case TS_TRANSLATION_UNIT_DECL
:
600 MARK_TS_DECL_COMMON (code
);
608 /* Basic consistency checks for attributes used in fold. */
609 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
610 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
611 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
612 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
613 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
614 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
615 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
616 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
617 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
618 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
619 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
620 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
621 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
622 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
623 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
624 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
625 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
627 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
628 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
629 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
630 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
631 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
632 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
633 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
634 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
635 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
636 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
637 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
638 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
639 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
640 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
641 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
642 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
643 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
644 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
645 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
647 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
657 /* Initialize the hash table of types. */
659 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
662 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
665 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
667 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
669 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
671 int_cst_node
= make_int_cst (1, 1);
673 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
675 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
676 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
678 /* Initialize the tree_contains_struct array. */
679 initialize_tree_contains_struct ();
680 lang_hooks
.init_ts ();
684 /* The name of the object as the assembler will see it (but before any
685 translations made by ASM_OUTPUT_LABELREF). Often this is the same
686 as DECL_NAME. It is an IDENTIFIER_NODE. */
688 decl_assembler_name (tree decl
)
690 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
691 lang_hooks
.set_decl_assembler_name (decl
);
692 return DECL_ASSEMBLER_NAME_RAW (decl
);
695 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
696 (either of which may be NULL). Inform the FE, if this changes the
700 overwrite_decl_assembler_name (tree decl
, tree name
)
702 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
703 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
706 /* When the target supports COMDAT groups, this indicates which group the
707 DECL is associated with. This can be either an IDENTIFIER_NODE or a
708 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
710 decl_comdat_group (const_tree node
)
712 struct symtab_node
*snode
= symtab_node::get (node
);
715 return snode
->get_comdat_group ();
718 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
720 decl_comdat_group_id (const_tree node
)
722 struct symtab_node
*snode
= symtab_node::get (node
);
725 return snode
->get_comdat_group_id ();
728 /* When the target supports named section, return its name as IDENTIFIER_NODE
729 or NULL if it is in no section. */
731 decl_section_name (const_tree node
)
733 struct symtab_node
*snode
= symtab_node::get (node
);
736 return snode
->get_section ();
739 /* Set section name of NODE to VALUE (that is expected to be
742 set_decl_section_name (tree node
, const char *value
)
744 struct symtab_node
*snode
;
748 snode
= symtab_node::get (node
);
752 else if (VAR_P (node
))
753 snode
= varpool_node::get_create (node
);
755 snode
= cgraph_node::get_create (node
);
756 snode
->set_section (value
);
759 /* Return TLS model of a variable NODE. */
761 decl_tls_model (const_tree node
)
763 struct varpool_node
*snode
= varpool_node::get (node
);
765 return TLS_MODEL_NONE
;
766 return snode
->tls_model
;
769 /* Set TLS model of variable NODE to MODEL. */
771 set_decl_tls_model (tree node
, enum tls_model model
)
773 struct varpool_node
*vnode
;
775 if (model
== TLS_MODEL_NONE
)
777 vnode
= varpool_node::get (node
);
782 vnode
= varpool_node::get_create (node
);
783 vnode
->tls_model
= model
;
786 /* Compute the number of bytes occupied by a tree with code CODE.
787 This function cannot be used for nodes that have variable sizes,
788 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
790 tree_code_size (enum tree_code code
)
792 switch (TREE_CODE_CLASS (code
))
794 case tcc_declaration
: /* A decl node */
797 case FIELD_DECL
: return sizeof (tree_field_decl
);
798 case PARM_DECL
: return sizeof (tree_parm_decl
);
799 case VAR_DECL
: return sizeof (tree_var_decl
);
800 case LABEL_DECL
: return sizeof (tree_label_decl
);
801 case RESULT_DECL
: return sizeof (tree_result_decl
);
802 case CONST_DECL
: return sizeof (tree_const_decl
);
803 case TYPE_DECL
: return sizeof (tree_type_decl
);
804 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
805 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
806 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
809 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
811 gcc_checking_assert (code
>= NUM_TREE_CODES
);
812 return lang_hooks
.tree_size (code
);
815 case tcc_type
: /* a type node */
826 case FIXED_POINT_TYPE
:
832 case QUAL_UNION_TYPE
:
836 case LANG_TYPE
: return sizeof (tree_type_non_common
);
838 gcc_checking_assert (code
>= NUM_TREE_CODES
);
839 return lang_hooks
.tree_size (code
);
842 case tcc_reference
: /* a reference */
843 case tcc_expression
: /* an expression */
844 case tcc_statement
: /* an expression with side effects */
845 case tcc_comparison
: /* a comparison expression */
846 case tcc_unary
: /* a unary arithmetic expression */
847 case tcc_binary
: /* a binary arithmetic expression */
848 return (sizeof (struct tree_exp
)
849 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
851 case tcc_constant
: /* a constant */
854 case VOID_CST
: return sizeof (tree_typed
);
855 case INTEGER_CST
: gcc_unreachable ();
856 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
857 case REAL_CST
: return sizeof (tree_real_cst
);
858 case FIXED_CST
: return sizeof (tree_fixed_cst
);
859 case COMPLEX_CST
: return sizeof (tree_complex
);
860 case VECTOR_CST
: gcc_unreachable ();
861 case STRING_CST
: gcc_unreachable ();
863 gcc_checking_assert (code
>= NUM_TREE_CODES
);
864 return lang_hooks
.tree_size (code
);
867 case tcc_exceptional
: /* something random, like an identifier. */
870 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
871 case TREE_LIST
: return sizeof (tree_list
);
874 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
876 case TREE_VEC
: gcc_unreachable ();
877 case OMP_CLAUSE
: gcc_unreachable ();
879 case SSA_NAME
: return sizeof (tree_ssa_name
);
881 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
882 case BLOCK
: return sizeof (struct tree_block
);
883 case CONSTRUCTOR
: return sizeof (tree_constructor
);
884 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
885 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
888 gcc_checking_assert (code
>= NUM_TREE_CODES
);
889 return lang_hooks
.tree_size (code
);
897 /* Compute the number of bytes occupied by NODE. This routine only
898 looks at TREE_CODE, except for those nodes that have variable sizes. */
900 tree_size (const_tree node
)
902 const enum tree_code code
= TREE_CODE (node
);
906 return (sizeof (struct tree_int_cst
)
907 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
910 return (offsetof (struct tree_binfo
, base_binfos
)
912 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
915 return (sizeof (struct tree_vec
)
916 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
919 return (sizeof (struct tree_vector
)
920 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
923 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
926 return (sizeof (struct tree_omp_clause
)
927 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
931 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
932 return (sizeof (struct tree_exp
)
933 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
935 return tree_code_size (code
);
939 /* Return tree node kind based on tree CODE. */
941 static tree_node_kind
942 get_stats_node_kind (enum tree_code code
)
944 enum tree_code_class type
= TREE_CODE_CLASS (code
);
948 case tcc_declaration
: /* A decl node */
950 case tcc_type
: /* a type node */
952 case tcc_statement
: /* an expression with side effects */
954 case tcc_reference
: /* a reference */
956 case tcc_expression
: /* an expression */
957 case tcc_comparison
: /* a comparison expression */
958 case tcc_unary
: /* a unary arithmetic expression */
959 case tcc_binary
: /* a binary arithmetic expression */
961 case tcc_constant
: /* a constant */
963 case tcc_exceptional
: /* something random, like an identifier. */
966 case IDENTIFIER_NODE
:
973 return ssa_name_kind
;
979 return omp_clause_kind
;
991 /* Record interesting allocation statistics for a tree node with CODE
995 record_node_allocation_statistics (enum tree_code code
, size_t length
)
997 if (!GATHER_STATISTICS
)
1000 tree_node_kind kind
= get_stats_node_kind (code
);
1002 tree_code_counts
[(int) code
]++;
1003 tree_node_counts
[(int) kind
]++;
1004 tree_node_sizes
[(int) kind
] += length
;
1007 /* Allocate and return a new UID from the DECL_UID namespace. */
1010 allocate_decl_uid (void)
1012 return next_decl_uid
++;
1015 /* Return a newly allocated node of code CODE. For decl and type
1016 nodes, some other fields are initialized. The rest of the node is
1017 initialized to zero. This function cannot be used for TREE_VEC,
1018 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1021 Achoo! I got a code in the node. */
1024 make_node (enum tree_code code MEM_STAT_DECL
)
1027 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1028 size_t length
= tree_code_size (code
);
1030 record_node_allocation_statistics (code
, length
);
1032 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1033 TREE_SET_CODE (t
, code
);
1038 if (code
!= DEBUG_BEGIN_STMT
)
1039 TREE_SIDE_EFFECTS (t
) = 1;
1042 case tcc_declaration
:
1043 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1045 if (code
== FUNCTION_DECL
)
1047 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1048 SET_DECL_MODE (t
, FUNCTION_MODE
);
1051 SET_DECL_ALIGN (t
, 1);
1053 DECL_SOURCE_LOCATION (t
) = input_location
;
1054 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1055 DECL_UID (t
) = --next_debug_decl_uid
;
1058 DECL_UID (t
) = allocate_decl_uid ();
1059 SET_DECL_PT_UID (t
, -1);
1061 if (TREE_CODE (t
) == LABEL_DECL
)
1062 LABEL_DECL_UID (t
) = -1;
1067 TYPE_UID (t
) = next_type_uid
++;
1068 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1069 TYPE_USER_ALIGN (t
) = 0;
1070 TYPE_MAIN_VARIANT (t
) = t
;
1071 TYPE_CANONICAL (t
) = t
;
1073 /* Default to no attributes for type, but let target change that. */
1074 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1075 targetm
.set_default_type_attributes (t
);
1077 /* We have not yet computed the alias set for this type. */
1078 TYPE_ALIAS_SET (t
) = -1;
1082 TREE_CONSTANT (t
) = 1;
1085 case tcc_expression
:
1091 case PREDECREMENT_EXPR
:
1092 case PREINCREMENT_EXPR
:
1093 case POSTDECREMENT_EXPR
:
1094 case POSTINCREMENT_EXPR
:
1095 /* All of these have side-effects, no matter what their
1097 TREE_SIDE_EFFECTS (t
) = 1;
1105 case tcc_exceptional
:
1108 case TARGET_OPTION_NODE
:
1109 TREE_TARGET_OPTION(t
)
1110 = ggc_cleared_alloc
<struct cl_target_option
> ();
1113 case OPTIMIZATION_NODE
:
1114 TREE_OPTIMIZATION (t
)
1115 = ggc_cleared_alloc
<struct cl_optimization
> ();
1124 /* Other classes need no special treatment. */
1131 /* Free tree node. */
1134 free_node (tree node
)
1136 enum tree_code code
= TREE_CODE (node
);
1137 if (GATHER_STATISTICS
)
1139 enum tree_node_kind kind
= get_stats_node_kind (code
);
1141 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1142 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1143 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1145 tree_code_counts
[(int) TREE_CODE (node
)]--;
1146 tree_node_counts
[(int) kind
]--;
1147 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1149 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1150 vec_free (CONSTRUCTOR_ELTS (node
));
1151 else if (code
== BLOCK
)
1152 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1153 else if (code
== TREE_BINFO
)
1154 vec_free (BINFO_BASE_ACCESSES (node
));
1158 /* Return a new node with the same contents as NODE except that its
1159 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1162 copy_node (tree node MEM_STAT_DECL
)
1165 enum tree_code code
= TREE_CODE (node
);
1168 gcc_assert (code
!= STATEMENT_LIST
);
1170 length
= tree_size (node
);
1171 record_node_allocation_statistics (code
, length
);
1172 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1173 memcpy (t
, node
, length
);
1175 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1177 TREE_ASM_WRITTEN (t
) = 0;
1178 TREE_VISITED (t
) = 0;
1180 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1182 if (code
== DEBUG_EXPR_DECL
)
1183 DECL_UID (t
) = --next_debug_decl_uid
;
1186 DECL_UID (t
) = allocate_decl_uid ();
1187 if (DECL_PT_UID_SET_P (node
))
1188 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1190 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1191 && DECL_HAS_VALUE_EXPR_P (node
))
1193 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1194 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1196 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1199 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1200 t
->decl_with_vis
.symtab_node
= NULL
;
1202 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1204 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1205 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1207 if (TREE_CODE (node
) == FUNCTION_DECL
)
1209 DECL_STRUCT_FUNCTION (t
) = NULL
;
1210 t
->decl_with_vis
.symtab_node
= NULL
;
1213 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1215 TYPE_UID (t
) = next_type_uid
++;
1216 /* The following is so that the debug code for
1217 the copy is different from the original type.
1218 The two statements usually duplicate each other
1219 (because they clear fields of the same union),
1220 but the optimizer should catch that. */
1221 TYPE_SYMTAB_ADDRESS (t
) = 0;
1222 TYPE_SYMTAB_DIE (t
) = 0;
1224 /* Do not copy the values cache. */
1225 if (TYPE_CACHED_VALUES_P (t
))
1227 TYPE_CACHED_VALUES_P (t
) = 0;
1228 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1231 else if (code
== TARGET_OPTION_NODE
)
1233 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1234 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1235 sizeof (struct cl_target_option
));
1237 else if (code
== OPTIMIZATION_NODE
)
1239 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1240 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1241 sizeof (struct cl_optimization
));
1247 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1248 For example, this can copy a list made of TREE_LIST nodes. */
1251 copy_list (tree list
)
1259 head
= prev
= copy_node (list
);
1260 next
= TREE_CHAIN (list
);
1263 TREE_CHAIN (prev
) = copy_node (next
);
1264 prev
= TREE_CHAIN (prev
);
1265 next
= TREE_CHAIN (next
);
1271 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1272 INTEGER_CST with value CST and type TYPE. */
1275 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1277 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1278 /* We need extra HWIs if CST is an unsigned integer with its
1280 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1281 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1282 return cst
.get_len ();
1285 /* Return a new INTEGER_CST with value CST and type TYPE. */
1288 build_new_int_cst (tree type
, const wide_int
&cst
)
1290 unsigned int len
= cst
.get_len ();
1291 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1292 tree nt
= make_int_cst (len
, ext_len
);
1297 TREE_INT_CST_ELT (nt
, ext_len
)
1298 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1299 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1300 TREE_INT_CST_ELT (nt
, i
) = -1;
1302 else if (TYPE_UNSIGNED (type
)
1303 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1306 TREE_INT_CST_ELT (nt
, len
)
1307 = zext_hwi (cst
.elt (len
),
1308 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1311 for (unsigned int i
= 0; i
< len
; i
++)
1312 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1313 TREE_TYPE (nt
) = type
;
1317 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1320 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1323 size_t length
= sizeof (struct tree_poly_int_cst
);
1324 record_node_allocation_statistics (POLY_INT_CST
, length
);
1326 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1328 TREE_SET_CODE (t
, POLY_INT_CST
);
1329 TREE_CONSTANT (t
) = 1;
1330 TREE_TYPE (t
) = type
;
1331 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1332 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1336 /* Create a constant tree that contains CST sign-extended to TYPE. */
1339 build_int_cst (tree type
, poly_int64 cst
)
1341 /* Support legacy code. */
1343 type
= integer_type_node
;
1345 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1348 /* Create a constant tree that contains CST zero-extended to TYPE. */
1351 build_int_cstu (tree type
, poly_uint64 cst
)
1353 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1356 /* Create a constant tree that contains CST sign-extended to TYPE. */
1359 build_int_cst_type (tree type
, poly_int64 cst
)
1362 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1365 /* Constructs tree in type TYPE from with value given by CST. Signedness
1366 of CST is assumed to be the same as the signedness of TYPE. */
1369 double_int_to_tree (tree type
, double_int cst
)
1371 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1374 /* We force the wide_int CST to the range of the type TYPE by sign or
1375 zero extending it. OVERFLOWABLE indicates if we are interested in
1376 overflow of the value, when >0 we are only interested in signed
1377 overflow, for <0 we are interested in any overflow. OVERFLOWED
1378 indicates whether overflow has already occurred. CONST_OVERFLOWED
1379 indicates whether constant overflow has already occurred. We force
1380 T's value to be within range of T's type (by setting to 0 or 1 all
1381 the bits outside the type's range). We set TREE_OVERFLOWED if,
1382 OVERFLOWED is nonzero,
1383 or OVERFLOWABLE is >0 and signed overflow occurs
1384 or OVERFLOWABLE is <0 and any overflow occurs
1385 We return a new tree node for the extended wide_int. The node
1386 is shared if no overflow flags are set. */
1390 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1391 int overflowable
, bool overflowed
)
1393 signop sign
= TYPE_SIGN (type
);
1395 /* If we need to set overflow flags, return a new unshared node. */
1396 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1400 || (overflowable
> 0 && sign
== SIGNED
))
1402 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1405 if (tmp
.is_constant ())
1406 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1409 tree coeffs
[NUM_POLY_INT_COEFFS
];
1410 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1412 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1413 TREE_OVERFLOW (coeffs
[i
]) = 1;
1415 t
= build_new_poly_int_cst (type
, coeffs
);
1417 TREE_OVERFLOW (t
) = 1;
1422 /* Else build a shared node. */
1423 return wide_int_to_tree (type
, cst
);
1426 /* These are the hash table functions for the hash table of INTEGER_CST
1427 nodes of a sizetype. */
1429 /* Return the hash code X, an INTEGER_CST. */
1432 int_cst_hasher::hash (tree x
)
1434 const_tree
const t
= x
;
1435 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1438 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1439 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1444 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1445 is the same as that given by *Y, which is the same. */
1448 int_cst_hasher::equal (tree x
, tree y
)
1450 const_tree
const xt
= x
;
1451 const_tree
const yt
= y
;
1453 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1454 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1455 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1458 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1459 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1465 /* Create an INT_CST node of TYPE and value CST.
1466 The returned node is always shared. For small integers we use a
1467 per-type vector cache, for larger ones we use a single hash table.
1468 The value is extended from its precision according to the sign of
1469 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1470 the upper bits and ensures that hashing and value equality based
1471 upon the underlying HOST_WIDE_INTs works without masking. */
1474 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1481 unsigned int prec
= TYPE_PRECISION (type
);
1482 signop sgn
= TYPE_SIGN (type
);
1484 /* Verify that everything is canonical. */
1485 int l
= pcst
.get_len ();
1488 if (pcst
.elt (l
- 1) == 0)
1489 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1490 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1491 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1494 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1495 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1499 /* We just need to store a single HOST_WIDE_INT. */
1501 if (TYPE_UNSIGNED (type
))
1502 hwi
= cst
.to_uhwi ();
1504 hwi
= cst
.to_shwi ();
1506 switch (TREE_CODE (type
))
1509 gcc_assert (hwi
== 0);
1513 case REFERENCE_TYPE
:
1514 /* Cache NULL pointer and zero bounds. */
1523 /* Cache false or true. */
1525 if (IN_RANGE (hwi
, 0, 1))
1531 if (TYPE_SIGN (type
) == UNSIGNED
)
1534 limit
= INTEGER_SHARE_LIMIT
;
1535 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1540 /* Cache [-1, N). */
1541 limit
= INTEGER_SHARE_LIMIT
+ 1;
1542 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1556 /* Look for it in the type's vector of small shared ints. */
1557 if (!TYPE_CACHED_VALUES_P (type
))
1559 TYPE_CACHED_VALUES_P (type
) = 1;
1560 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1563 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1565 /* Make sure no one is clobbering the shared constant. */
1566 gcc_checking_assert (TREE_TYPE (t
) == type
1567 && TREE_INT_CST_NUNITS (t
) == 1
1568 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1569 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1570 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1573 /* Create a new shared int. */
1574 t
= build_new_int_cst (type
, cst
);
1575 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1580 /* Use the cache of larger shared ints, using int_cst_node as
1583 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1584 TREE_TYPE (int_cst_node
) = type
;
1586 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1590 /* Insert this one into the hash table. */
1593 /* Make a new node for next time round. */
1594 int_cst_node
= make_int_cst (1, 1);
1600 /* The value either hashes properly or we drop it on the floor
1601 for the gc to take care of. There will not be enough of them
1604 tree nt
= build_new_int_cst (type
, cst
);
1605 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1609 /* Insert this one into the hash table. */
1621 poly_int_cst_hasher::hash (tree t
)
1623 inchash::hash hstate
;
1625 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1626 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1627 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1629 return hstate
.end ();
1633 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1635 if (TREE_TYPE (x
) != y
.first
)
1637 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1638 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1643 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1644 The elements must also have type TYPE. */
1647 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1649 unsigned int prec
= TYPE_PRECISION (type
);
1650 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1651 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1654 h
.add_int (TYPE_UID (type
));
1655 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1656 h
.add_wide_int (c
.coeffs
[i
]);
1657 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1658 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1660 if (*slot
== NULL_TREE
)
1662 tree coeffs
[NUM_POLY_INT_COEFFS
];
1663 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1664 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1665 *slot
= build_new_poly_int_cst (type
, coeffs
);
1670 /* Create a constant tree with value VALUE in type TYPE. */
1673 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1675 if (value
.is_constant ())
1676 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1677 return build_poly_int_cst (type
, value
);
1681 cache_integer_cst (tree t
)
1683 tree type
= TREE_TYPE (t
);
1686 int prec
= TYPE_PRECISION (type
);
1688 gcc_assert (!TREE_OVERFLOW (t
));
1690 switch (TREE_CODE (type
))
1693 gcc_assert (integer_zerop (t
));
1697 case REFERENCE_TYPE
:
1698 /* Cache NULL pointer. */
1699 if (integer_zerop (t
))
1707 /* Cache false or true. */
1709 if (wi::ltu_p (wi::to_wide (t
), 2))
1710 ix
= TREE_INT_CST_ELT (t
, 0);
1715 if (TYPE_UNSIGNED (type
))
1718 limit
= INTEGER_SHARE_LIMIT
;
1720 /* This is a little hokie, but if the prec is smaller than
1721 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1722 obvious test will not get the correct answer. */
1723 if (prec
< HOST_BITS_PER_WIDE_INT
)
1725 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1726 ix
= tree_to_uhwi (t
);
1728 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1729 ix
= tree_to_uhwi (t
);
1734 limit
= INTEGER_SHARE_LIMIT
+ 1;
1736 if (integer_minus_onep (t
))
1738 else if (!wi::neg_p (wi::to_wide (t
)))
1740 if (prec
< HOST_BITS_PER_WIDE_INT
)
1742 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1743 ix
= tree_to_shwi (t
) + 1;
1745 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1746 ix
= tree_to_shwi (t
) + 1;
1760 /* Look for it in the type's vector of small shared ints. */
1761 if (!TYPE_CACHED_VALUES_P (type
))
1763 TYPE_CACHED_VALUES_P (type
) = 1;
1764 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1767 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1768 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1772 /* Use the cache of larger shared ints. */
1773 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1774 /* If there is already an entry for the number verify it's the
1777 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1779 /* Otherwise insert this one into the hash table. */
1785 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1786 and the rest are zeros. */
1789 build_low_bits_mask (tree type
, unsigned bits
)
1791 gcc_assert (bits
<= TYPE_PRECISION (type
));
1793 return wide_int_to_tree (type
, wi::mask (bits
, false,
1794 TYPE_PRECISION (type
)));
1797 /* Checks that X is integer constant that can be expressed in (unsigned)
1798 HOST_WIDE_INT without loss of precision. */
1801 cst_and_fits_in_hwi (const_tree x
)
1803 return (TREE_CODE (x
) == INTEGER_CST
1804 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1807 /* Build a newly constructed VECTOR_CST with the given values of
1808 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1811 make_vector (unsigned log2_npatterns
,
1812 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1814 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1816 unsigned npatterns
= 1 << log2_npatterns
;
1817 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1818 unsigned length
= (sizeof (struct tree_vector
)
1819 + (encoded_nelts
- 1) * sizeof (tree
));
1821 record_node_allocation_statistics (VECTOR_CST
, length
);
1823 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1825 TREE_SET_CODE (t
, VECTOR_CST
);
1826 TREE_CONSTANT (t
) = 1;
1827 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1828 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1833 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1834 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1837 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1839 unsigned HOST_WIDE_INT idx
, nelts
;
1842 /* We can't construct a VECTOR_CST for a variable number of elements. */
1843 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1844 tree_vector_builder
vec (type
, nelts
, 1);
1845 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1847 if (TREE_CODE (value
) == VECTOR_CST
)
1849 /* If NELTS is constant then this must be too. */
1850 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1851 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1852 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1855 vec
.quick_push (value
);
1857 while (vec
.length () < nelts
)
1858 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1860 return vec
.build ();
1863 /* Build a vector of type VECTYPE where all the elements are SCs. */
1865 build_vector_from_val (tree vectype
, tree sc
)
1867 unsigned HOST_WIDE_INT i
, nunits
;
1869 if (sc
== error_mark_node
)
1872 /* Verify that the vector type is suitable for SC. Note that there
1873 is some inconsistency in the type-system with respect to restrict
1874 qualifications of pointers. Vector types always have a main-variant
1875 element type and the qualification is applied to the vector-type.
1876 So TREE_TYPE (vector-type) does not return a properly qualified
1877 vector element-type. */
1878 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1879 TREE_TYPE (vectype
)));
1881 if (CONSTANT_CLASS_P (sc
))
1883 tree_vector_builder
v (vectype
, 1, 1);
1887 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1888 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1891 vec
<constructor_elt
, va_gc
> *v
;
1892 vec_alloc (v
, nunits
);
1893 for (i
= 0; i
< nunits
; ++i
)
1894 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1895 return build_constructor (vectype
, v
);
1899 /* Build a vector series of type TYPE in which element I has the value
1900 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1901 and a VEC_SERIES_EXPR otherwise. */
1904 build_vec_series (tree type
, tree base
, tree step
)
1906 if (integer_zerop (step
))
1907 return build_vector_from_val (type
, base
);
1908 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1910 tree_vector_builder
builder (type
, 1, 3);
1911 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1912 wi::to_wide (base
) + wi::to_wide (step
));
1913 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1914 wi::to_wide (elt1
) + wi::to_wide (step
));
1915 builder
.quick_push (base
);
1916 builder
.quick_push (elt1
);
1917 builder
.quick_push (elt2
);
1918 return builder
.build ();
1920 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1923 /* Return a vector with the same number of units and number of bits
1924 as VEC_TYPE, but in which the elements are a linear series of unsigned
1925 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1928 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1930 tree index_vec_type
= vec_type
;
1931 tree index_elt_type
= TREE_TYPE (vec_type
);
1932 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1933 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1935 index_elt_type
= build_nonstandard_integer_type
1936 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1937 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1940 tree_vector_builder
v (index_vec_type
, 1, 3);
1941 for (unsigned int i
= 0; i
< 3; ++i
)
1942 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1946 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1947 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1950 recompute_constructor_flags (tree c
)
1954 bool constant_p
= true;
1955 bool side_effects_p
= false;
1956 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1958 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1960 /* Mostly ctors will have elts that don't have side-effects, so
1961 the usual case is to scan all the elements. Hence a single
1962 loop for both const and side effects, rather than one loop
1963 each (with early outs). */
1964 if (!TREE_CONSTANT (val
))
1966 if (TREE_SIDE_EFFECTS (val
))
1967 side_effects_p
= true;
1970 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1971 TREE_CONSTANT (c
) = constant_p
;
1974 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1978 verify_constructor_flags (tree c
)
1982 bool constant_p
= TREE_CONSTANT (c
);
1983 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1984 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1986 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1988 if (constant_p
&& !TREE_CONSTANT (val
))
1989 internal_error ("non-constant element in constant CONSTRUCTOR");
1990 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1991 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1995 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1996 are in the vec pointed to by VALS. */
1998 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
2000 tree c
= make_node (CONSTRUCTOR
);
2002 TREE_TYPE (c
) = type
;
2003 CONSTRUCTOR_ELTS (c
) = vals
;
2005 recompute_constructor_flags (c
);
2010 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2013 build_constructor_single (tree type
, tree index
, tree value
)
2015 vec
<constructor_elt
, va_gc
> *v
;
2016 constructor_elt elt
= {index
, value
};
2019 v
->quick_push (elt
);
2021 return build_constructor (type
, v
);
2025 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2026 are in a list pointed to by VALS. */
2028 build_constructor_from_list (tree type
, tree vals
)
2031 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2035 vec_alloc (v
, list_length (vals
));
2036 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2037 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2040 return build_constructor (type
, v
);
2043 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2044 of elements, provided as index/value pairs. */
2047 build_constructor_va (tree type
, int nelts
, ...)
2049 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2052 va_start (p
, nelts
);
2053 vec_alloc (v
, nelts
);
2056 tree index
= va_arg (p
, tree
);
2057 tree value
= va_arg (p
, tree
);
2058 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2061 return build_constructor (type
, v
);
2064 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2067 build_clobber (tree type
)
2069 tree clobber
= build_constructor (type
, NULL
);
2070 TREE_THIS_VOLATILE (clobber
) = true;
2074 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2077 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2080 FIXED_VALUE_TYPE
*fp
;
2082 v
= make_node (FIXED_CST
);
2083 fp
= ggc_alloc
<fixed_value
> ();
2084 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2086 TREE_TYPE (v
) = type
;
2087 TREE_FIXED_CST_PTR (v
) = fp
;
2091 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2094 build_real (tree type
, REAL_VALUE_TYPE d
)
2097 REAL_VALUE_TYPE
*dp
;
2100 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2101 Consider doing it via real_convert now. */
2103 v
= make_node (REAL_CST
);
2104 dp
= ggc_alloc
<real_value
> ();
2105 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2107 TREE_TYPE (v
) = type
;
2108 TREE_REAL_CST_PTR (v
) = dp
;
2109 TREE_OVERFLOW (v
) = overflow
;
2113 /* Like build_real, but first truncate D to the type. */
2116 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2118 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2121 /* Return a new REAL_CST node whose type is TYPE
2122 and whose value is the integer value of the INTEGER_CST node I. */
2125 real_value_from_int_cst (const_tree type
, const_tree i
)
2129 /* Clear all bits of the real value type so that we can later do
2130 bitwise comparisons to see if two values are the same. */
2131 memset (&d
, 0, sizeof d
);
2133 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2134 TYPE_SIGN (TREE_TYPE (i
)));
2138 /* Given a tree representing an integer constant I, return a tree
2139 representing the same value as a floating-point constant of type TYPE. */
2142 build_real_from_int_cst (tree type
, const_tree i
)
2145 int overflow
= TREE_OVERFLOW (i
);
2147 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2149 TREE_OVERFLOW (v
) |= overflow
;
2153 /* Return a newly constructed STRING_CST node whose value is
2154 the LEN characters at STR.
2155 Note that for a C string literal, LEN should include the trailing NUL.
2156 The TREE_TYPE is not initialized. */
2159 build_string (int len
, const char *str
)
2164 /* Do not waste bytes provided by padding of struct tree_string. */
2165 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2167 record_node_allocation_statistics (STRING_CST
, length
);
2169 s
= (tree
) ggc_internal_alloc (length
);
2171 memset (s
, 0, sizeof (struct tree_typed
));
2172 TREE_SET_CODE (s
, STRING_CST
);
2173 TREE_CONSTANT (s
) = 1;
2174 TREE_STRING_LENGTH (s
) = len
;
2175 memcpy (s
->string
.str
, str
, len
);
2176 s
->string
.str
[len
] = '\0';
2181 /* Return a newly constructed COMPLEX_CST node whose value is
2182 specified by the real and imaginary parts REAL and IMAG.
2183 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2184 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2187 build_complex (tree type
, tree real
, tree imag
)
2189 tree t
= make_node (COMPLEX_CST
);
2191 TREE_REALPART (t
) = real
;
2192 TREE_IMAGPART (t
) = imag
;
2193 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2194 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2198 /* Build a complex (inf +- 0i), such as for the result of cproj.
2199 TYPE is the complex tree type of the result. If NEG is true, the
2200 imaginary zero is negative. */
2203 build_complex_inf (tree type
, bool neg
)
2205 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2209 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2210 build_real (TREE_TYPE (type
), rzero
));
2213 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2214 element is set to 1. In particular, this is 1 + i for complex types. */
2217 build_each_one_cst (tree type
)
2219 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2221 tree scalar
= build_one_cst (TREE_TYPE (type
));
2222 return build_complex (type
, scalar
, scalar
);
2225 return build_one_cst (type
);
2228 /* Return a constant of arithmetic type TYPE which is the
2229 multiplicative identity of the set TYPE. */
2232 build_one_cst (tree type
)
2234 switch (TREE_CODE (type
))
2236 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2237 case POINTER_TYPE
: case REFERENCE_TYPE
:
2239 return build_int_cst (type
, 1);
2242 return build_real (type
, dconst1
);
2244 case FIXED_POINT_TYPE
:
2245 /* We can only generate 1 for accum types. */
2246 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2247 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2251 tree scalar
= build_one_cst (TREE_TYPE (type
));
2253 return build_vector_from_val (type
, scalar
);
2257 return build_complex (type
,
2258 build_one_cst (TREE_TYPE (type
)),
2259 build_zero_cst (TREE_TYPE (type
)));
2266 /* Return an integer of type TYPE containing all 1's in as much precision as
2267 it contains, or a complex or vector whose subparts are such integers. */
2270 build_all_ones_cst (tree type
)
2272 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2274 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2275 return build_complex (type
, scalar
, scalar
);
2278 return build_minus_one_cst (type
);
2281 /* Return a constant of arithmetic type TYPE which is the
2282 opposite of the multiplicative identity of the set TYPE. */
2285 build_minus_one_cst (tree type
)
2287 switch (TREE_CODE (type
))
2289 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2290 case POINTER_TYPE
: case REFERENCE_TYPE
:
2292 return build_int_cst (type
, -1);
2295 return build_real (type
, dconstm1
);
2297 case FIXED_POINT_TYPE
:
2298 /* We can only generate 1 for accum types. */
2299 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2300 return build_fixed (type
,
2301 fixed_from_double_int (double_int_minus_one
,
2302 SCALAR_TYPE_MODE (type
)));
2306 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2308 return build_vector_from_val (type
, scalar
);
2312 return build_complex (type
,
2313 build_minus_one_cst (TREE_TYPE (type
)),
2314 build_zero_cst (TREE_TYPE (type
)));
2321 /* Build 0 constant of type TYPE. This is used by constructor folding
2322 and thus the constant should be represented in memory by
2326 build_zero_cst (tree type
)
2328 switch (TREE_CODE (type
))
2330 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2331 case POINTER_TYPE
: case REFERENCE_TYPE
:
2332 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2333 return build_int_cst (type
, 0);
2336 return build_real (type
, dconst0
);
2338 case FIXED_POINT_TYPE
:
2339 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2343 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2345 return build_vector_from_val (type
, scalar
);
2350 tree zero
= build_zero_cst (TREE_TYPE (type
));
2352 return build_complex (type
, zero
, zero
);
2356 if (!AGGREGATE_TYPE_P (type
))
2357 return fold_convert (type
, integer_zero_node
);
2358 return build_constructor (type
, NULL
);
2363 /* Build a BINFO with LEN language slots. */
2366 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2369 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2370 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2372 record_node_allocation_statistics (TREE_BINFO
, length
);
2374 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2376 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2378 TREE_SET_CODE (t
, TREE_BINFO
);
2380 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2385 /* Create a CASE_LABEL_EXPR tree node and return it. */
2388 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2390 tree t
= make_node (CASE_LABEL_EXPR
);
2392 TREE_TYPE (t
) = void_type_node
;
2393 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2395 CASE_LOW (t
) = low_value
;
2396 CASE_HIGH (t
) = high_value
;
2397 CASE_LABEL (t
) = label_decl
;
2398 CASE_CHAIN (t
) = NULL_TREE
;
2403 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2404 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2405 The latter determines the length of the HOST_WIDE_INT vector. */
2408 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2411 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2412 + sizeof (struct tree_int_cst
));
2415 record_node_allocation_statistics (INTEGER_CST
, length
);
2417 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2419 TREE_SET_CODE (t
, INTEGER_CST
);
2420 TREE_INT_CST_NUNITS (t
) = len
;
2421 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2422 /* to_offset can only be applied to trees that are offset_int-sized
2423 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2424 must be exactly the precision of offset_int and so LEN is correct. */
2425 if (ext_len
<= OFFSET_INT_ELTS
)
2426 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2428 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2430 TREE_CONSTANT (t
) = 1;
2435 /* Build a newly constructed TREE_VEC node of length LEN. */
2438 make_tree_vec (int len MEM_STAT_DECL
)
2441 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2443 record_node_allocation_statistics (TREE_VEC
, length
);
2445 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2447 TREE_SET_CODE (t
, TREE_VEC
);
2448 TREE_VEC_LENGTH (t
) = len
;
2453 /* Grow a TREE_VEC node to new length LEN. */
2456 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2458 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2460 int oldlen
= TREE_VEC_LENGTH (v
);
2461 gcc_assert (len
> oldlen
);
2463 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2464 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2466 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2468 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2470 TREE_VEC_LENGTH (v
) = len
;
2475 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2476 fixed, and scalar, complex or vector. */
2479 zerop (const_tree expr
)
2481 return (integer_zerop (expr
)
2482 || real_zerop (expr
)
2483 || fixed_zerop (expr
));
2486 /* Return 1 if EXPR is the integer constant zero or a complex constant
2490 integer_zerop (const_tree expr
)
2492 switch (TREE_CODE (expr
))
2495 return wi::to_wide (expr
) == 0;
2497 return (integer_zerop (TREE_REALPART (expr
))
2498 && integer_zerop (TREE_IMAGPART (expr
)));
2500 return (VECTOR_CST_NPATTERNS (expr
) == 1
2501 && VECTOR_CST_DUPLICATE_P (expr
)
2502 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2508 /* Return 1 if EXPR is the integer constant one or the corresponding
2509 complex constant. */
2512 integer_onep (const_tree expr
)
2514 switch (TREE_CODE (expr
))
2517 return wi::eq_p (wi::to_widest (expr
), 1);
2519 return (integer_onep (TREE_REALPART (expr
))
2520 && integer_zerop (TREE_IMAGPART (expr
)));
2522 return (VECTOR_CST_NPATTERNS (expr
) == 1
2523 && VECTOR_CST_DUPLICATE_P (expr
)
2524 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2530 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2531 return 1 if every piece is the integer constant one. */
2534 integer_each_onep (const_tree expr
)
2536 if (TREE_CODE (expr
) == COMPLEX_CST
)
2537 return (integer_onep (TREE_REALPART (expr
))
2538 && integer_onep (TREE_IMAGPART (expr
)));
2540 return integer_onep (expr
);
2543 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2544 it contains, or a complex or vector whose subparts are such integers. */
2547 integer_all_onesp (const_tree expr
)
2549 if (TREE_CODE (expr
) == COMPLEX_CST
2550 && integer_all_onesp (TREE_REALPART (expr
))
2551 && integer_all_onesp (TREE_IMAGPART (expr
)))
2554 else if (TREE_CODE (expr
) == VECTOR_CST
)
2555 return (VECTOR_CST_NPATTERNS (expr
) == 1
2556 && VECTOR_CST_DUPLICATE_P (expr
)
2557 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2559 else if (TREE_CODE (expr
) != INTEGER_CST
)
2562 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2563 == wi::to_wide (expr
));
2566 /* Return 1 if EXPR is the integer constant minus one. */
2569 integer_minus_onep (const_tree expr
)
2571 if (TREE_CODE (expr
) == COMPLEX_CST
)
2572 return (integer_all_onesp (TREE_REALPART (expr
))
2573 && integer_zerop (TREE_IMAGPART (expr
)));
2575 return integer_all_onesp (expr
);
2578 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2582 integer_pow2p (const_tree expr
)
2584 if (TREE_CODE (expr
) == COMPLEX_CST
2585 && integer_pow2p (TREE_REALPART (expr
))
2586 && integer_zerop (TREE_IMAGPART (expr
)))
2589 if (TREE_CODE (expr
) != INTEGER_CST
)
2592 return wi::popcount (wi::to_wide (expr
)) == 1;
2595 /* Return 1 if EXPR is an integer constant other than zero or a
2596 complex constant other than zero. */
2599 integer_nonzerop (const_tree expr
)
2601 return ((TREE_CODE (expr
) == INTEGER_CST
2602 && wi::to_wide (expr
) != 0)
2603 || (TREE_CODE (expr
) == COMPLEX_CST
2604 && (integer_nonzerop (TREE_REALPART (expr
))
2605 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2608 /* Return 1 if EXPR is the integer constant one. For vector,
2609 return 1 if every piece is the integer constant minus one
2610 (representing the value TRUE). */
2613 integer_truep (const_tree expr
)
2615 if (TREE_CODE (expr
) == VECTOR_CST
)
2616 return integer_all_onesp (expr
);
2617 return integer_onep (expr
);
2620 /* Return 1 if EXPR is the fixed-point constant zero. */
2623 fixed_zerop (const_tree expr
)
2625 return (TREE_CODE (expr
) == FIXED_CST
2626 && TREE_FIXED_CST (expr
).data
.is_zero ());
2629 /* Return the power of two represented by a tree node known to be a
2633 tree_log2 (const_tree expr
)
2635 if (TREE_CODE (expr
) == COMPLEX_CST
)
2636 return tree_log2 (TREE_REALPART (expr
));
2638 return wi::exact_log2 (wi::to_wide (expr
));
2641 /* Similar, but return the largest integer Y such that 2 ** Y is less
2642 than or equal to EXPR. */
2645 tree_floor_log2 (const_tree expr
)
2647 if (TREE_CODE (expr
) == COMPLEX_CST
)
2648 return tree_log2 (TREE_REALPART (expr
));
2650 return wi::floor_log2 (wi::to_wide (expr
));
2653 /* Return number of known trailing zero bits in EXPR, or, if the value of
2654 EXPR is known to be zero, the precision of it's type. */
2657 tree_ctz (const_tree expr
)
2659 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2660 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2663 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2664 switch (TREE_CODE (expr
))
2667 ret1
= wi::ctz (wi::to_wide (expr
));
2668 return MIN (ret1
, prec
);
2670 ret1
= wi::ctz (get_nonzero_bits (expr
));
2671 return MIN (ret1
, prec
);
2678 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2681 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2682 return MIN (ret1
, ret2
);
2683 case POINTER_PLUS_EXPR
:
2684 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2685 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2686 /* Second operand is sizetype, which could be in theory
2687 wider than pointer's precision. Make sure we never
2688 return more than prec. */
2689 ret2
= MIN (ret2
, prec
);
2690 return MIN (ret1
, ret2
);
2692 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2693 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2694 return MAX (ret1
, ret2
);
2696 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2697 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2698 return MIN (ret1
+ ret2
, prec
);
2700 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2701 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2702 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2704 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2705 return MIN (ret1
+ ret2
, prec
);
2709 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2710 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2712 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2713 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2718 case TRUNC_DIV_EXPR
:
2720 case FLOOR_DIV_EXPR
:
2721 case ROUND_DIV_EXPR
:
2722 case EXACT_DIV_EXPR
:
2723 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2724 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2726 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2729 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2737 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2738 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2740 return MIN (ret1
, prec
);
2742 return tree_ctz (TREE_OPERAND (expr
, 0));
2744 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2747 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2748 return MIN (ret1
, ret2
);
2750 return tree_ctz (TREE_OPERAND (expr
, 1));
2752 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2753 if (ret1
> BITS_PER_UNIT
)
2755 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2756 return MIN (ret1
, prec
);
2764 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2765 decimal float constants, so don't return 1 for them. */
2768 real_zerop (const_tree expr
)
2770 switch (TREE_CODE (expr
))
2773 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2774 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2776 return real_zerop (TREE_REALPART (expr
))
2777 && real_zerop (TREE_IMAGPART (expr
));
2780 /* Don't simply check for a duplicate because the predicate
2781 accepts both +0.0 and -0.0. */
2782 unsigned count
= vector_cst_encoded_nelts (expr
);
2783 for (unsigned int i
= 0; i
< count
; ++i
)
2784 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2793 /* Return 1 if EXPR is the real constant one in real or complex form.
2794 Trailing zeroes matter for decimal float constants, so don't return
2798 real_onep (const_tree expr
)
2800 switch (TREE_CODE (expr
))
2803 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2804 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2806 return real_onep (TREE_REALPART (expr
))
2807 && real_zerop (TREE_IMAGPART (expr
));
2809 return (VECTOR_CST_NPATTERNS (expr
) == 1
2810 && VECTOR_CST_DUPLICATE_P (expr
)
2811 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2817 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2818 matter for decimal float constants, so don't return 1 for them. */
2821 real_minus_onep (const_tree expr
)
2823 switch (TREE_CODE (expr
))
2826 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2827 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2829 return real_minus_onep (TREE_REALPART (expr
))
2830 && real_zerop (TREE_IMAGPART (expr
));
2832 return (VECTOR_CST_NPATTERNS (expr
) == 1
2833 && VECTOR_CST_DUPLICATE_P (expr
)
2834 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2840 /* Nonzero if EXP is a constant or a cast of a constant. */
2843 really_constant_p (const_tree exp
)
2845 /* This is not quite the same as STRIP_NOPS. It does more. */
2846 while (CONVERT_EXPR_P (exp
)
2847 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2848 exp
= TREE_OPERAND (exp
, 0);
2849 return TREE_CONSTANT (exp
);
2852 /* Return true if T holds a polynomial pointer difference, storing it in
2853 *VALUE if so. A true return means that T's precision is no greater
2854 than 64 bits, which is the largest address space we support, so *VALUE
2855 never loses precision. However, the signedness of the result does
2856 not necessarily match the signedness of T: sometimes an unsigned type
2857 like sizetype is used to encode a value that is actually negative. */
2860 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2864 if (TREE_CODE (t
) == INTEGER_CST
)
2866 if (!cst_and_fits_in_hwi (t
))
2868 *value
= int_cst_value (t
);
2871 if (POLY_INT_CST_P (t
))
2873 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2874 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2876 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2877 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2884 tree_to_poly_int64 (const_tree t
)
2886 gcc_assert (tree_fits_poly_int64_p (t
));
2887 if (POLY_INT_CST_P (t
))
2888 return poly_int_cst_value (t
).force_shwi ();
2889 return TREE_INT_CST_LOW (t
);
2893 tree_to_poly_uint64 (const_tree t
)
2895 gcc_assert (tree_fits_poly_uint64_p (t
));
2896 if (POLY_INT_CST_P (t
))
2897 return poly_int_cst_value (t
).force_uhwi ();
2898 return TREE_INT_CST_LOW (t
);
2901 /* Return first list element whose TREE_VALUE is ELEM.
2902 Return 0 if ELEM is not in LIST. */
2905 value_member (tree elem
, tree list
)
2909 if (elem
== TREE_VALUE (list
))
2911 list
= TREE_CHAIN (list
);
2916 /* Return first list element whose TREE_PURPOSE is ELEM.
2917 Return 0 if ELEM is not in LIST. */
2920 purpose_member (const_tree elem
, tree list
)
2924 if (elem
== TREE_PURPOSE (list
))
2926 list
= TREE_CHAIN (list
);
2931 /* Return true if ELEM is in V. */
2934 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2938 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2944 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2948 chain_index (int idx
, tree chain
)
2950 for (; chain
&& idx
> 0; --idx
)
2951 chain
= TREE_CHAIN (chain
);
2955 /* Return nonzero if ELEM is part of the chain CHAIN. */
2958 chain_member (const_tree elem
, const_tree chain
)
2964 chain
= DECL_CHAIN (chain
);
2970 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2971 We expect a null pointer to mark the end of the chain.
2972 This is the Lisp primitive `length'. */
2975 list_length (const_tree t
)
2978 #ifdef ENABLE_TREE_CHECKING
2986 #ifdef ENABLE_TREE_CHECKING
2989 gcc_assert (p
!= q
);
2997 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2998 UNION_TYPE TYPE, or NULL_TREE if none. */
3001 first_field (const_tree type
)
3003 tree t
= TYPE_FIELDS (type
);
3004 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3009 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3010 by modifying the last node in chain 1 to point to chain 2.
3011 This is the Lisp primitive `nconc'. */
3014 chainon (tree op1
, tree op2
)
3023 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3025 TREE_CHAIN (t1
) = op2
;
3027 #ifdef ENABLE_TREE_CHECKING
3030 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3031 gcc_assert (t2
!= t1
);
3038 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3041 tree_last (tree chain
)
3045 while ((next
= TREE_CHAIN (chain
)))
3050 /* Reverse the order of elements in the chain T,
3051 and return the new head of the chain (old last element). */
3056 tree prev
= 0, decl
, next
;
3057 for (decl
= t
; decl
; decl
= next
)
3059 /* We shouldn't be using this function to reverse BLOCK chains; we
3060 have blocks_nreverse for that. */
3061 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3062 next
= TREE_CHAIN (decl
);
3063 TREE_CHAIN (decl
) = prev
;
3069 /* Return a newly created TREE_LIST node whose
3070 purpose and value fields are PARM and VALUE. */
3073 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3075 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3076 TREE_PURPOSE (t
) = parm
;
3077 TREE_VALUE (t
) = value
;
3081 /* Build a chain of TREE_LIST nodes from a vector. */
3084 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3086 tree ret
= NULL_TREE
;
3090 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3092 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3093 pp
= &TREE_CHAIN (*pp
);
3098 /* Return a newly created TREE_LIST node whose
3099 purpose and value fields are PURPOSE and VALUE
3100 and whose TREE_CHAIN is CHAIN. */
3103 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3107 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3108 memset (node
, 0, sizeof (struct tree_common
));
3110 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3112 TREE_SET_CODE (node
, TREE_LIST
);
3113 TREE_CHAIN (node
) = chain
;
3114 TREE_PURPOSE (node
) = purpose
;
3115 TREE_VALUE (node
) = value
;
3119 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3123 ctor_to_vec (tree ctor
)
3125 vec
<tree
, va_gc
> *vec
;
3126 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3130 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3131 vec
->quick_push (val
);
3136 /* Return the size nominally occupied by an object of type TYPE
3137 when it resides in memory. The value is measured in units of bytes,
3138 and its data type is that normally used for type sizes
3139 (which is the first type created by make_signed_type or
3140 make_unsigned_type). */
3143 size_in_bytes_loc (location_t loc
, const_tree type
)
3147 if (type
== error_mark_node
)
3148 return integer_zero_node
;
3150 type
= TYPE_MAIN_VARIANT (type
);
3151 t
= TYPE_SIZE_UNIT (type
);
3155 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3156 return size_zero_node
;
3162 /* Return the size of TYPE (in bytes) as a wide integer
3163 or return -1 if the size can vary or is larger than an integer. */
3166 int_size_in_bytes (const_tree type
)
3170 if (type
== error_mark_node
)
3173 type
= TYPE_MAIN_VARIANT (type
);
3174 t
= TYPE_SIZE_UNIT (type
);
3176 if (t
&& tree_fits_uhwi_p (t
))
3177 return TREE_INT_CST_LOW (t
);
3182 /* Return the maximum size of TYPE (in bytes) as a wide integer
3183 or return -1 if the size can vary or is larger than an integer. */
3186 max_int_size_in_bytes (const_tree type
)
3188 HOST_WIDE_INT size
= -1;
3191 /* If this is an array type, check for a possible MAX_SIZE attached. */
3193 if (TREE_CODE (type
) == ARRAY_TYPE
)
3195 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3197 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3198 size
= tree_to_uhwi (size_tree
);
3201 /* If we still haven't been able to get a size, see if the language
3202 can compute a maximum size. */
3206 size_tree
= lang_hooks
.types
.max_size (type
);
3208 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3209 size
= tree_to_uhwi (size_tree
);
3215 /* Return the bit position of FIELD, in bits from the start of the record.
3216 This is a tree of type bitsizetype. */
3219 bit_position (const_tree field
)
3221 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3222 DECL_FIELD_BIT_OFFSET (field
));
3225 /* Return the byte position of FIELD, in bytes from the start of the record.
3226 This is a tree of type sizetype. */
3229 byte_position (const_tree field
)
3231 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3232 DECL_FIELD_BIT_OFFSET (field
));
3235 /* Likewise, but return as an integer. It must be representable in
3236 that way (since it could be a signed value, we don't have the
3237 option of returning -1 like int_size_in_byte can. */
3240 int_byte_position (const_tree field
)
3242 return tree_to_shwi (byte_position (field
));
3245 /* Return the strictest alignment, in bits, that T is known to have. */
3248 expr_align (const_tree t
)
3250 unsigned int align0
, align1
;
3252 switch (TREE_CODE (t
))
3254 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3255 /* If we have conversions, we know that the alignment of the
3256 object must meet each of the alignments of the types. */
3257 align0
= expr_align (TREE_OPERAND (t
, 0));
3258 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3259 return MAX (align0
, align1
);
3261 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3262 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3263 case CLEANUP_POINT_EXPR
:
3264 /* These don't change the alignment of an object. */
3265 return expr_align (TREE_OPERAND (t
, 0));
3268 /* The best we can do is say that the alignment is the least aligned
3270 align0
= expr_align (TREE_OPERAND (t
, 1));
3271 align1
= expr_align (TREE_OPERAND (t
, 2));
3272 return MIN (align0
, align1
);
3274 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3275 meaningfully, it's always 1. */
3276 case LABEL_DECL
: case CONST_DECL
:
3277 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3279 gcc_assert (DECL_ALIGN (t
) != 0);
3280 return DECL_ALIGN (t
);
3286 /* Otherwise take the alignment from that of the type. */
3287 return TYPE_ALIGN (TREE_TYPE (t
));
3290 /* Return, as a tree node, the number of elements for TYPE (which is an
3291 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3294 array_type_nelts (const_tree type
)
3296 tree index_type
, min
, max
;
3298 /* If they did it with unspecified bounds, then we should have already
3299 given an error about it before we got here. */
3300 if (! TYPE_DOMAIN (type
))
3301 return error_mark_node
;
3303 index_type
= TYPE_DOMAIN (type
);
3304 min
= TYPE_MIN_VALUE (index_type
);
3305 max
= TYPE_MAX_VALUE (index_type
);
3307 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3309 return error_mark_node
;
3311 return (integer_zerop (min
)
3313 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3316 /* If arg is static -- a reference to an object in static storage -- then
3317 return the object. This is not the same as the C meaning of `static'.
3318 If arg isn't static, return NULL. */
3323 switch (TREE_CODE (arg
))
3326 /* Nested functions are static, even though taking their address will
3327 involve a trampoline as we unnest the nested function and create
3328 the trampoline on the tree level. */
3332 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3333 && ! DECL_THREAD_LOCAL_P (arg
)
3334 && ! DECL_DLLIMPORT_P (arg
)
3338 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3342 return TREE_STATIC (arg
) ? arg
: NULL
;
3349 /* If the thing being referenced is not a field, then it is
3350 something language specific. */
3351 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3353 /* If we are referencing a bitfield, we can't evaluate an
3354 ADDR_EXPR at compile time and so it isn't a constant. */
3355 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3358 return staticp (TREE_OPERAND (arg
, 0));
3364 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3367 case ARRAY_RANGE_REF
:
3368 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3369 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3370 return staticp (TREE_OPERAND (arg
, 0));
3374 case COMPOUND_LITERAL_EXPR
:
3375 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3385 /* Return whether OP is a DECL whose address is function-invariant. */
3388 decl_address_invariant_p (const_tree op
)
3390 /* The conditions below are slightly less strict than the one in
3393 switch (TREE_CODE (op
))
3402 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3403 || DECL_THREAD_LOCAL_P (op
)
3404 || DECL_CONTEXT (op
) == current_function_decl
3405 || decl_function_context (op
) == current_function_decl
)
3410 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3411 || decl_function_context (op
) == current_function_decl
)
3422 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3425 decl_address_ip_invariant_p (const_tree op
)
3427 /* The conditions below are slightly less strict than the one in
3430 switch (TREE_CODE (op
))
3438 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3439 && !DECL_DLLIMPORT_P (op
))
3440 || DECL_THREAD_LOCAL_P (op
))
3445 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3457 /* Return true if T is function-invariant (internal function, does
3458 not handle arithmetic; that's handled in skip_simple_arithmetic and
3459 tree_invariant_p). */
3462 tree_invariant_p_1 (tree t
)
3466 if (TREE_CONSTANT (t
)
3467 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3470 switch (TREE_CODE (t
))
3476 op
= TREE_OPERAND (t
, 0);
3477 while (handled_component_p (op
))
3479 switch (TREE_CODE (op
))
3482 case ARRAY_RANGE_REF
:
3483 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3484 || TREE_OPERAND (op
, 2) != NULL_TREE
3485 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3490 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3496 op
= TREE_OPERAND (op
, 0);
3499 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3508 /* Return true if T is function-invariant. */
3511 tree_invariant_p (tree t
)
3513 tree inner
= skip_simple_arithmetic (t
);
3514 return tree_invariant_p_1 (inner
);
3517 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3518 Do this to any expression which may be used in more than one place,
3519 but must be evaluated only once.
3521 Normally, expand_expr would reevaluate the expression each time.
3522 Calling save_expr produces something that is evaluated and recorded
3523 the first time expand_expr is called on it. Subsequent calls to
3524 expand_expr just reuse the recorded value.
3526 The call to expand_expr that generates code that actually computes
3527 the value is the first call *at compile time*. Subsequent calls
3528 *at compile time* generate code to use the saved value.
3529 This produces correct result provided that *at run time* control
3530 always flows through the insns made by the first expand_expr
3531 before reaching the other places where the save_expr was evaluated.
3532 You, the caller of save_expr, must make sure this is so.
3534 Constants, and certain read-only nodes, are returned with no
3535 SAVE_EXPR because that is safe. Expressions containing placeholders
3536 are not touched; see tree.def for an explanation of what these
3540 save_expr (tree expr
)
3544 /* If the tree evaluates to a constant, then we don't want to hide that
3545 fact (i.e. this allows further folding, and direct checks for constants).
3546 However, a read-only object that has side effects cannot be bypassed.
3547 Since it is no problem to reevaluate literals, we just return the
3549 inner
= skip_simple_arithmetic (expr
);
3550 if (TREE_CODE (inner
) == ERROR_MARK
)
3553 if (tree_invariant_p_1 (inner
))
3556 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3557 it means that the size or offset of some field of an object depends on
3558 the value within another field.
3560 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3561 and some variable since it would then need to be both evaluated once and
3562 evaluated more than once. Front-ends must assure this case cannot
3563 happen by surrounding any such subexpressions in their own SAVE_EXPR
3564 and forcing evaluation at the proper time. */
3565 if (contains_placeholder_p (inner
))
3568 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3570 /* This expression might be placed ahead of a jump to ensure that the
3571 value was computed on both sides of the jump. So make sure it isn't
3572 eliminated as dead. */
3573 TREE_SIDE_EFFECTS (expr
) = 1;
3577 /* Look inside EXPR into any simple arithmetic operations. Return the
3578 outermost non-arithmetic or non-invariant node. */
3581 skip_simple_arithmetic (tree expr
)
3583 /* We don't care about whether this can be used as an lvalue in this
3585 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3586 expr
= TREE_OPERAND (expr
, 0);
3588 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3589 a constant, it will be more efficient to not make another SAVE_EXPR since
3590 it will allow better simplification and GCSE will be able to merge the
3591 computations if they actually occur. */
3594 if (UNARY_CLASS_P (expr
))
3595 expr
= TREE_OPERAND (expr
, 0);
3596 else if (BINARY_CLASS_P (expr
))
3598 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3599 expr
= TREE_OPERAND (expr
, 0);
3600 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3601 expr
= TREE_OPERAND (expr
, 1);
3612 /* Look inside EXPR into simple arithmetic operations involving constants.
3613 Return the outermost non-arithmetic or non-constant node. */
3616 skip_simple_constant_arithmetic (tree expr
)
3618 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3619 expr
= TREE_OPERAND (expr
, 0);
3623 if (UNARY_CLASS_P (expr
))
3624 expr
= TREE_OPERAND (expr
, 0);
3625 else if (BINARY_CLASS_P (expr
))
3627 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3628 expr
= TREE_OPERAND (expr
, 0);
3629 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3630 expr
= TREE_OPERAND (expr
, 1);
3641 /* Return which tree structure is used by T. */
3643 enum tree_node_structure_enum
3644 tree_node_structure (const_tree t
)
3646 const enum tree_code code
= TREE_CODE (t
);
3647 return tree_node_structure_for_code (code
);
3650 /* Set various status flags when building a CALL_EXPR object T. */
3653 process_call_operands (tree t
)
3655 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3656 bool read_only
= false;
3657 int i
= call_expr_flags (t
);
3659 /* Calls have side-effects, except those to const or pure functions. */
3660 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3661 side_effects
= true;
3662 /* Propagate TREE_READONLY of arguments for const functions. */
3666 if (!side_effects
|| read_only
)
3667 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3669 tree op
= TREE_OPERAND (t
, i
);
3670 if (op
&& TREE_SIDE_EFFECTS (op
))
3671 side_effects
= true;
3672 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3676 TREE_SIDE_EFFECTS (t
) = side_effects
;
3677 TREE_READONLY (t
) = read_only
;
3680 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3681 size or offset that depends on a field within a record. */
3684 contains_placeholder_p (const_tree exp
)
3686 enum tree_code code
;
3691 code
= TREE_CODE (exp
);
3692 if (code
== PLACEHOLDER_EXPR
)
3695 switch (TREE_CODE_CLASS (code
))
3698 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3699 position computations since they will be converted into a
3700 WITH_RECORD_EXPR involving the reference, which will assume
3701 here will be valid. */
3702 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3704 case tcc_exceptional
:
3705 if (code
== TREE_LIST
)
3706 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3707 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3712 case tcc_comparison
:
3713 case tcc_expression
:
3717 /* Ignoring the first operand isn't quite right, but works best. */
3718 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3721 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3722 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3723 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3726 /* The save_expr function never wraps anything containing
3727 a PLACEHOLDER_EXPR. */
3734 switch (TREE_CODE_LENGTH (code
))
3737 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3739 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3740 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3751 const_call_expr_arg_iterator iter
;
3752 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3753 if (CONTAINS_PLACEHOLDER_P (arg
))
3767 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3768 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3772 type_contains_placeholder_1 (const_tree type
)
3774 /* If the size contains a placeholder or the parent type (component type in
3775 the case of arrays) type involves a placeholder, this type does. */
3776 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3777 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3778 || (!POINTER_TYPE_P (type
)
3780 && type_contains_placeholder_p (TREE_TYPE (type
))))
3783 /* Now do type-specific checks. Note that the last part of the check above
3784 greatly limits what we have to do below. */
3785 switch (TREE_CODE (type
))
3793 case REFERENCE_TYPE
:
3802 case FIXED_POINT_TYPE
:
3803 /* Here we just check the bounds. */
3804 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3805 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3808 /* We have already checked the component type above, so just check
3809 the domain type. Flexible array members have a null domain. */
3810 return TYPE_DOMAIN (type
) ?
3811 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3815 case QUAL_UNION_TYPE
:
3819 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3820 if (TREE_CODE (field
) == FIELD_DECL
3821 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3822 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3823 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3824 || type_contains_placeholder_p (TREE_TYPE (field
))))
3835 /* Wrapper around above function used to cache its result. */
3838 type_contains_placeholder_p (tree type
)
3842 /* If the contains_placeholder_bits field has been initialized,
3843 then we know the answer. */
3844 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3845 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3847 /* Indicate that we've seen this type node, and the answer is false.
3848 This is what we want to return if we run into recursion via fields. */
3849 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3851 /* Compute the real value. */
3852 result
= type_contains_placeholder_1 (type
);
3854 /* Store the real value. */
3855 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3860 /* Push tree EXP onto vector QUEUE if it is not already present. */
3863 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3868 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3869 if (simple_cst_equal (iter
, exp
) == 1)
3873 queue
->safe_push (exp
);
3876 /* Given a tree EXP, find all occurrences of references to fields
3877 in a PLACEHOLDER_EXPR and place them in vector REFS without
3878 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3879 we assume here that EXP contains only arithmetic expressions
3880 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3884 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3886 enum tree_code code
= TREE_CODE (exp
);
3890 /* We handle TREE_LIST and COMPONENT_REF separately. */
3891 if (code
== TREE_LIST
)
3893 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3894 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3896 else if (code
== COMPONENT_REF
)
3898 for (inner
= TREE_OPERAND (exp
, 0);
3899 REFERENCE_CLASS_P (inner
);
3900 inner
= TREE_OPERAND (inner
, 0))
3903 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3904 push_without_duplicates (exp
, refs
);
3906 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3909 switch (TREE_CODE_CLASS (code
))
3914 case tcc_declaration
:
3915 /* Variables allocated to static storage can stay. */
3916 if (!TREE_STATIC (exp
))
3917 push_without_duplicates (exp
, refs
);
3920 case tcc_expression
:
3921 /* This is the pattern built in ada/make_aligning_type. */
3922 if (code
== ADDR_EXPR
3923 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3925 push_without_duplicates (exp
, refs
);
3931 case tcc_exceptional
:
3934 case tcc_comparison
:
3936 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3937 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3941 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3942 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3950 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3951 return a tree with all occurrences of references to F in a
3952 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3953 CONST_DECLs. Note that we assume here that EXP contains only
3954 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3955 occurring only in their argument list. */
3958 substitute_in_expr (tree exp
, tree f
, tree r
)
3960 enum tree_code code
= TREE_CODE (exp
);
3961 tree op0
, op1
, op2
, op3
;
3964 /* We handle TREE_LIST and COMPONENT_REF separately. */
3965 if (code
== TREE_LIST
)
3967 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3968 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3969 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3972 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3974 else if (code
== COMPONENT_REF
)
3978 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3979 and it is the right field, replace it with R. */
3980 for (inner
= TREE_OPERAND (exp
, 0);
3981 REFERENCE_CLASS_P (inner
);
3982 inner
= TREE_OPERAND (inner
, 0))
3986 op1
= TREE_OPERAND (exp
, 1);
3988 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3991 /* If this expression hasn't been completed let, leave it alone. */
3992 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3995 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3996 if (op0
== TREE_OPERAND (exp
, 0))
4000 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4003 switch (TREE_CODE_CLASS (code
))
4008 case tcc_declaration
:
4014 case tcc_expression
:
4020 case tcc_exceptional
:
4023 case tcc_comparison
:
4025 switch (TREE_CODE_LENGTH (code
))
4031 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4032 if (op0
== TREE_OPERAND (exp
, 0))
4035 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4039 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4040 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4042 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4045 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4049 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4050 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4051 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4053 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4054 && op2
== TREE_OPERAND (exp
, 2))
4057 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4061 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4062 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4063 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4064 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4066 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4067 && op2
== TREE_OPERAND (exp
, 2)
4068 && op3
== TREE_OPERAND (exp
, 3))
4072 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4084 new_tree
= NULL_TREE
;
4086 /* If we are trying to replace F with a constant or with another
4087 instance of one of the arguments of the call, inline back
4088 functions which do nothing else than computing a value from
4089 the arguments they are passed. This makes it possible to
4090 fold partially or entirely the replacement expression. */
4091 if (code
== CALL_EXPR
)
4093 bool maybe_inline
= false;
4094 if (CONSTANT_CLASS_P (r
))
4095 maybe_inline
= true;
4097 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4098 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4100 maybe_inline
= true;
4105 tree t
= maybe_inline_call_in_expr (exp
);
4107 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4111 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4113 tree op
= TREE_OPERAND (exp
, i
);
4114 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4118 new_tree
= copy_node (exp
);
4119 TREE_OPERAND (new_tree
, i
) = new_op
;
4125 new_tree
= fold (new_tree
);
4126 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4127 process_call_operands (new_tree
);
4138 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4140 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4141 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4146 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4147 for it within OBJ, a tree that is an object or a chain of references. */
4150 substitute_placeholder_in_expr (tree exp
, tree obj
)
4152 enum tree_code code
= TREE_CODE (exp
);
4153 tree op0
, op1
, op2
, op3
;
4156 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4157 in the chain of OBJ. */
4158 if (code
== PLACEHOLDER_EXPR
)
4160 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4163 for (elt
= obj
; elt
!= 0;
4164 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4165 || TREE_CODE (elt
) == COND_EXPR
)
4166 ? TREE_OPERAND (elt
, 1)
4167 : (REFERENCE_CLASS_P (elt
)
4168 || UNARY_CLASS_P (elt
)
4169 || BINARY_CLASS_P (elt
)
4170 || VL_EXP_CLASS_P (elt
)
4171 || EXPRESSION_CLASS_P (elt
))
4172 ? TREE_OPERAND (elt
, 0) : 0))
4173 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4176 for (elt
= obj
; elt
!= 0;
4177 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4178 || TREE_CODE (elt
) == COND_EXPR
)
4179 ? TREE_OPERAND (elt
, 1)
4180 : (REFERENCE_CLASS_P (elt
)
4181 || UNARY_CLASS_P (elt
)
4182 || BINARY_CLASS_P (elt
)
4183 || VL_EXP_CLASS_P (elt
)
4184 || EXPRESSION_CLASS_P (elt
))
4185 ? TREE_OPERAND (elt
, 0) : 0))
4186 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4187 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4189 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4191 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4192 survives until RTL generation, there will be an error. */
4196 /* TREE_LIST is special because we need to look at TREE_VALUE
4197 and TREE_CHAIN, not TREE_OPERANDS. */
4198 else if (code
== TREE_LIST
)
4200 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4201 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4202 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4205 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4208 switch (TREE_CODE_CLASS (code
))
4211 case tcc_declaration
:
4214 case tcc_exceptional
:
4217 case tcc_comparison
:
4218 case tcc_expression
:
4221 switch (TREE_CODE_LENGTH (code
))
4227 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4228 if (op0
== TREE_OPERAND (exp
, 0))
4231 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4235 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4236 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4238 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4241 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4245 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4246 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4247 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4249 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4250 && op2
== TREE_OPERAND (exp
, 2))
4253 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4257 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4258 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4259 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4260 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4262 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4263 && op2
== TREE_OPERAND (exp
, 2)
4264 && op3
== TREE_OPERAND (exp
, 3))
4268 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4280 new_tree
= NULL_TREE
;
4282 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4284 tree op
= TREE_OPERAND (exp
, i
);
4285 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4289 new_tree
= copy_node (exp
);
4290 TREE_OPERAND (new_tree
, i
) = new_op
;
4296 new_tree
= fold (new_tree
);
4297 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4298 process_call_operands (new_tree
);
4309 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4311 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4312 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4318 /* Subroutine of stabilize_reference; this is called for subtrees of
4319 references. Any expression with side-effects must be put in a SAVE_EXPR
4320 to ensure that it is only evaluated once.
4322 We don't put SAVE_EXPR nodes around everything, because assigning very
4323 simple expressions to temporaries causes us to miss good opportunities
4324 for optimizations. Among other things, the opportunity to fold in the
4325 addition of a constant into an addressing mode often gets lost, e.g.
4326 "y[i+1] += x;". In general, we take the approach that we should not make
4327 an assignment unless we are forced into it - i.e., that any non-side effect
4328 operator should be allowed, and that cse should take care of coalescing
4329 multiple utterances of the same expression should that prove fruitful. */
4332 stabilize_reference_1 (tree e
)
4335 enum tree_code code
= TREE_CODE (e
);
4337 /* We cannot ignore const expressions because it might be a reference
4338 to a const array but whose index contains side-effects. But we can
4339 ignore things that are actual constant or that already have been
4340 handled by this function. */
4342 if (tree_invariant_p (e
))
4345 switch (TREE_CODE_CLASS (code
))
4347 case tcc_exceptional
:
4348 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4349 have side-effects. */
4350 if (code
== STATEMENT_LIST
)
4351 return save_expr (e
);
4354 case tcc_declaration
:
4355 case tcc_comparison
:
4357 case tcc_expression
:
4360 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4361 so that it will only be evaluated once. */
4362 /* The reference (r) and comparison (<) classes could be handled as
4363 below, but it is generally faster to only evaluate them once. */
4364 if (TREE_SIDE_EFFECTS (e
))
4365 return save_expr (e
);
4369 /* Constants need no processing. In fact, we should never reach
4374 /* Division is slow and tends to be compiled with jumps,
4375 especially the division by powers of 2 that is often
4376 found inside of an array reference. So do it just once. */
4377 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4378 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4379 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4380 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4381 return save_expr (e
);
4382 /* Recursively stabilize each operand. */
4383 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4384 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4388 /* Recursively stabilize each operand. */
4389 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4396 TREE_TYPE (result
) = TREE_TYPE (e
);
4397 TREE_READONLY (result
) = TREE_READONLY (e
);
4398 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4399 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4404 /* Stabilize a reference so that we can use it any number of times
4405 without causing its operands to be evaluated more than once.
4406 Returns the stabilized reference. This works by means of save_expr,
4407 so see the caveats in the comments about save_expr.
4409 Also allows conversion expressions whose operands are references.
4410 Any other kind of expression is returned unchanged. */
4413 stabilize_reference (tree ref
)
4416 enum tree_code code
= TREE_CODE (ref
);
4423 /* No action is needed in this case. */
4428 case FIX_TRUNC_EXPR
:
4429 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4433 result
= build_nt (INDIRECT_REF
,
4434 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4438 result
= build_nt (COMPONENT_REF
,
4439 stabilize_reference (TREE_OPERAND (ref
, 0)),
4440 TREE_OPERAND (ref
, 1), NULL_TREE
);
4444 result
= build_nt (BIT_FIELD_REF
,
4445 stabilize_reference (TREE_OPERAND (ref
, 0)),
4446 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4447 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4451 result
= build_nt (ARRAY_REF
,
4452 stabilize_reference (TREE_OPERAND (ref
, 0)),
4453 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4454 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4457 case ARRAY_RANGE_REF
:
4458 result
= build_nt (ARRAY_RANGE_REF
,
4459 stabilize_reference (TREE_OPERAND (ref
, 0)),
4460 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4461 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4465 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4466 it wouldn't be ignored. This matters when dealing with
4468 return stabilize_reference_1 (ref
);
4470 /* If arg isn't a kind of lvalue we recognize, make no change.
4471 Caller should recognize the error for an invalid lvalue. */
4476 return error_mark_node
;
4479 TREE_TYPE (result
) = TREE_TYPE (ref
);
4480 TREE_READONLY (result
) = TREE_READONLY (ref
);
4481 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4482 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4487 /* Low-level constructors for expressions. */
4489 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4490 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4493 recompute_tree_invariant_for_addr_expr (tree t
)
4496 bool tc
= true, se
= false;
4498 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4500 /* We started out assuming this address is both invariant and constant, but
4501 does not have side effects. Now go down any handled components and see if
4502 any of them involve offsets that are either non-constant or non-invariant.
4503 Also check for side-effects.
4505 ??? Note that this code makes no attempt to deal with the case where
4506 taking the address of something causes a copy due to misalignment. */
4508 #define UPDATE_FLAGS(NODE) \
4509 do { tree _node = (NODE); \
4510 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4511 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4513 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4514 node
= TREE_OPERAND (node
, 0))
4516 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4517 array reference (probably made temporarily by the G++ front end),
4518 so ignore all the operands. */
4519 if ((TREE_CODE (node
) == ARRAY_REF
4520 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4521 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4523 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4524 if (TREE_OPERAND (node
, 2))
4525 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4526 if (TREE_OPERAND (node
, 3))
4527 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4529 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4530 FIELD_DECL, apparently. The G++ front end can put something else
4531 there, at least temporarily. */
4532 else if (TREE_CODE (node
) == COMPONENT_REF
4533 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4535 if (TREE_OPERAND (node
, 2))
4536 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4540 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4542 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4543 the address, since &(*a)->b is a form of addition. If it's a constant, the
4544 address is constant too. If it's a decl, its address is constant if the
4545 decl is static. Everything else is not constant and, furthermore,
4546 taking the address of a volatile variable is not volatile. */
4547 if (TREE_CODE (node
) == INDIRECT_REF
4548 || TREE_CODE (node
) == MEM_REF
)
4549 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4550 else if (CONSTANT_CLASS_P (node
))
4552 else if (DECL_P (node
))
4553 tc
&= (staticp (node
) != NULL_TREE
);
4557 se
|= TREE_SIDE_EFFECTS (node
);
4561 TREE_CONSTANT (t
) = tc
;
4562 TREE_SIDE_EFFECTS (t
) = se
;
4566 /* Build an expression of code CODE, data type TYPE, and operands as
4567 specified. Expressions and reference nodes can be created this way.
4568 Constants, decls, types and misc nodes cannot be.
4570 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4571 enough for all extant tree codes. */
4574 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4578 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4580 t
= make_node (code PASS_MEM_STAT
);
4587 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4589 int length
= sizeof (struct tree_exp
);
4592 record_node_allocation_statistics (code
, length
);
4594 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4596 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4598 memset (t
, 0, sizeof (struct tree_common
));
4600 TREE_SET_CODE (t
, code
);
4602 TREE_TYPE (t
) = type
;
4603 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4604 TREE_OPERAND (t
, 0) = node
;
4605 if (node
&& !TYPE_P (node
))
4607 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4608 TREE_READONLY (t
) = TREE_READONLY (node
);
4611 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4613 if (code
!= DEBUG_BEGIN_STMT
)
4614 TREE_SIDE_EFFECTS (t
) = 1;
4619 /* All of these have side-effects, no matter what their
4621 TREE_SIDE_EFFECTS (t
) = 1;
4622 TREE_READONLY (t
) = 0;
4626 /* Whether a dereference is readonly has nothing to do with whether
4627 its operand is readonly. */
4628 TREE_READONLY (t
) = 0;
4633 recompute_tree_invariant_for_addr_expr (t
);
4637 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4638 && node
&& !TYPE_P (node
)
4639 && TREE_CONSTANT (node
))
4640 TREE_CONSTANT (t
) = 1;
4641 if (TREE_CODE_CLASS (code
) == tcc_reference
4642 && node
&& TREE_THIS_VOLATILE (node
))
4643 TREE_THIS_VOLATILE (t
) = 1;
4650 #define PROCESS_ARG(N) \
4652 TREE_OPERAND (t, N) = arg##N; \
4653 if (arg##N &&!TYPE_P (arg##N)) \
4655 if (TREE_SIDE_EFFECTS (arg##N)) \
4657 if (!TREE_READONLY (arg##N) \
4658 && !CONSTANT_CLASS_P (arg##N)) \
4659 (void) (read_only = 0); \
4660 if (!TREE_CONSTANT (arg##N)) \
4661 (void) (constant = 0); \
4666 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4668 bool constant
, read_only
, side_effects
, div_by_zero
;
4671 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4673 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4674 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4675 /* When sizetype precision doesn't match that of pointers
4676 we need to be able to build explicit extensions or truncations
4677 of the offset argument. */
4678 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4679 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4680 && TREE_CODE (arg1
) == INTEGER_CST
);
4682 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4683 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4684 && ptrofftype_p (TREE_TYPE (arg1
)));
4686 t
= make_node (code PASS_MEM_STAT
);
4689 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4690 result based on those same flags for the arguments. But if the
4691 arguments aren't really even `tree' expressions, we shouldn't be trying
4694 /* Expressions without side effects may be constant if their
4695 arguments are as well. */
4696 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4697 || TREE_CODE_CLASS (code
) == tcc_binary
);
4699 side_effects
= TREE_SIDE_EFFECTS (t
);
4703 case TRUNC_DIV_EXPR
:
4705 case FLOOR_DIV_EXPR
:
4706 case ROUND_DIV_EXPR
:
4707 case EXACT_DIV_EXPR
:
4709 case FLOOR_MOD_EXPR
:
4710 case ROUND_MOD_EXPR
:
4711 case TRUNC_MOD_EXPR
:
4712 div_by_zero
= integer_zerop (arg1
);
4715 div_by_zero
= false;
4721 TREE_SIDE_EFFECTS (t
) = side_effects
;
4722 if (code
== MEM_REF
)
4724 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4726 tree o
= TREE_OPERAND (arg0
, 0);
4727 TREE_READONLY (t
) = TREE_READONLY (o
);
4728 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4733 TREE_READONLY (t
) = read_only
;
4734 /* Don't mark X / 0 as constant. */
4735 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4736 TREE_THIS_VOLATILE (t
)
4737 = (TREE_CODE_CLASS (code
) == tcc_reference
4738 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4746 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4747 tree arg2 MEM_STAT_DECL
)
4749 bool constant
, read_only
, side_effects
;
4752 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4753 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4755 t
= make_node (code PASS_MEM_STAT
);
4760 /* As a special exception, if COND_EXPR has NULL branches, we
4761 assume that it is a gimple statement and always consider
4762 it to have side effects. */
4763 if (code
== COND_EXPR
4764 && tt
== void_type_node
4765 && arg1
== NULL_TREE
4766 && arg2
== NULL_TREE
)
4767 side_effects
= true;
4769 side_effects
= TREE_SIDE_EFFECTS (t
);
4775 if (code
== COND_EXPR
)
4776 TREE_READONLY (t
) = read_only
;
4778 TREE_SIDE_EFFECTS (t
) = side_effects
;
4779 TREE_THIS_VOLATILE (t
)
4780 = (TREE_CODE_CLASS (code
) == tcc_reference
4781 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4787 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4788 tree arg2
, tree arg3 MEM_STAT_DECL
)
4790 bool constant
, read_only
, side_effects
;
4793 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4795 t
= make_node (code PASS_MEM_STAT
);
4798 side_effects
= TREE_SIDE_EFFECTS (t
);
4805 TREE_SIDE_EFFECTS (t
) = side_effects
;
4806 TREE_THIS_VOLATILE (t
)
4807 = (TREE_CODE_CLASS (code
) == tcc_reference
4808 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4814 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4815 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4817 bool constant
, read_only
, side_effects
;
4820 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4822 t
= make_node (code PASS_MEM_STAT
);
4825 side_effects
= TREE_SIDE_EFFECTS (t
);
4833 TREE_SIDE_EFFECTS (t
) = side_effects
;
4834 if (code
== TARGET_MEM_REF
)
4836 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4838 tree o
= TREE_OPERAND (arg0
, 0);
4839 TREE_READONLY (t
) = TREE_READONLY (o
);
4840 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4844 TREE_THIS_VOLATILE (t
)
4845 = (TREE_CODE_CLASS (code
) == tcc_reference
4846 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4851 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4852 on the pointer PTR. */
4855 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4857 poly_int64 offset
= 0;
4858 tree ptype
= TREE_TYPE (ptr
);
4860 /* For convenience allow addresses that collapse to a simple base
4862 if (TREE_CODE (ptr
) == ADDR_EXPR
4863 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4864 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4866 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4868 if (TREE_CODE (ptr
) == MEM_REF
)
4870 offset
+= mem_ref_offset (ptr
).force_shwi ();
4871 ptr
= TREE_OPERAND (ptr
, 0);
4874 ptr
= build_fold_addr_expr (ptr
);
4875 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4877 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4878 ptr
, build_int_cst (ptype
, offset
));
4879 SET_EXPR_LOCATION (tem
, loc
);
4883 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4886 mem_ref_offset (const_tree t
)
4888 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4892 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4893 offsetted by OFFSET units. */
4896 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4898 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4899 build_fold_addr_expr (base
),
4900 build_int_cst (ptr_type_node
, offset
));
4901 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4902 recompute_tree_invariant_for_addr_expr (addr
);
4906 /* Similar except don't specify the TREE_TYPE
4907 and leave the TREE_SIDE_EFFECTS as 0.
4908 It is permissible for arguments to be null,
4909 or even garbage if their values do not matter. */
4912 build_nt (enum tree_code code
, ...)
4919 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4923 t
= make_node (code
);
4924 length
= TREE_CODE_LENGTH (code
);
4926 for (i
= 0; i
< length
; i
++)
4927 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4933 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4937 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4942 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4943 CALL_EXPR_FN (ret
) = fn
;
4944 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4945 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4946 CALL_EXPR_ARG (ret
, ix
) = t
;
4950 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4951 We do NOT enter this node in any sort of symbol table.
4953 LOC is the location of the decl.
4955 layout_decl is used to set up the decl's storage layout.
4956 Other slots are initialized to 0 or null pointers. */
4959 build_decl (location_t loc
, enum tree_code code
, tree name
,
4960 tree type MEM_STAT_DECL
)
4964 t
= make_node (code PASS_MEM_STAT
);
4965 DECL_SOURCE_LOCATION (t
) = loc
;
4967 /* if (type == error_mark_node)
4968 type = integer_type_node; */
4969 /* That is not done, deliberately, so that having error_mark_node
4970 as the type can suppress useless errors in the use of this variable. */
4972 DECL_NAME (t
) = name
;
4973 TREE_TYPE (t
) = type
;
4975 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4981 /* Builds and returns function declaration with NAME and TYPE. */
4984 build_fn_decl (const char *name
, tree type
)
4986 tree id
= get_identifier (name
);
4987 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4989 DECL_EXTERNAL (decl
) = 1;
4990 TREE_PUBLIC (decl
) = 1;
4991 DECL_ARTIFICIAL (decl
) = 1;
4992 TREE_NOTHROW (decl
) = 1;
4997 vec
<tree
, va_gc
> *all_translation_units
;
4999 /* Builds a new translation-unit decl with name NAME, queues it in the
5000 global list of translation-unit decls and returns it. */
5003 build_translation_unit_decl (tree name
)
5005 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5007 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5008 vec_safe_push (all_translation_units
, tu
);
5013 /* BLOCK nodes are used to represent the structure of binding contours
5014 and declarations, once those contours have been exited and their contents
5015 compiled. This information is used for outputting debugging info. */
5018 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5020 tree block
= make_node (BLOCK
);
5022 BLOCK_VARS (block
) = vars
;
5023 BLOCK_SUBBLOCKS (block
) = subblocks
;
5024 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5025 BLOCK_CHAIN (block
) = chain
;
5030 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5032 LOC is the location to use in tree T. */
5035 protected_set_expr_location (tree t
, location_t loc
)
5037 if (CAN_HAVE_LOCATION_P (t
))
5038 SET_EXPR_LOCATION (t
, loc
);
5041 /* Reset the expression *EXPR_P, a size or position.
5043 ??? We could reset all non-constant sizes or positions. But it's cheap
5044 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5046 We need to reset self-referential sizes or positions because they cannot
5047 be gimplified and thus can contain a CALL_EXPR after the gimplification
5048 is finished, which will run afoul of LTO streaming. And they need to be
5049 reset to something essentially dummy but not constant, so as to preserve
5050 the properties of the object they are attached to. */
5053 free_lang_data_in_one_sizepos (tree
*expr_p
)
5055 tree expr
= *expr_p
;
5056 if (CONTAINS_PLACEHOLDER_P (expr
))
5057 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5061 /* Reset all the fields in a binfo node BINFO. We only keep
5062 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5065 free_lang_data_in_binfo (tree binfo
)
5070 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5072 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5073 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5074 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5075 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5076 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5078 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5079 free_lang_data_in_binfo (t
);
5083 /* Reset all language specific information still present in TYPE. */
5086 free_lang_data_in_type (tree type
)
5088 gcc_assert (TYPE_P (type
));
5090 /* Give the FE a chance to remove its own data first. */
5091 lang_hooks
.free_lang_data (type
);
5093 TREE_LANG_FLAG_0 (type
) = 0;
5094 TREE_LANG_FLAG_1 (type
) = 0;
5095 TREE_LANG_FLAG_2 (type
) = 0;
5096 TREE_LANG_FLAG_3 (type
) = 0;
5097 TREE_LANG_FLAG_4 (type
) = 0;
5098 TREE_LANG_FLAG_5 (type
) = 0;
5099 TREE_LANG_FLAG_6 (type
) = 0;
5101 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5103 /* Remove the const and volatile qualifiers from arguments. The
5104 C++ front end removes them, but the C front end does not,
5105 leading to false ODR violation errors when merging two
5106 instances of the same function signature compiled by
5107 different front ends. */
5108 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5110 tree arg_type
= TREE_VALUE (p
);
5112 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5114 int quals
= TYPE_QUALS (arg_type
)
5116 & ~TYPE_QUAL_VOLATILE
;
5117 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5118 free_lang_data_in_type (TREE_VALUE (p
));
5120 /* C++ FE uses TREE_PURPOSE to store initial values. */
5121 TREE_PURPOSE (p
) = NULL
;
5124 else if (TREE_CODE (type
) == METHOD_TYPE
)
5125 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5126 /* C++ FE uses TREE_PURPOSE to store initial values. */
5127 TREE_PURPOSE (p
) = NULL
;
5128 else if (RECORD_OR_UNION_TYPE_P (type
))
5130 /* Remove members that are not FIELD_DECLs from the field list
5131 of an aggregate. These occur in C++. */
5132 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5133 if (TREE_CODE (member
) == FIELD_DECL
)
5134 prev
= &DECL_CHAIN (member
);
5136 *prev
= DECL_CHAIN (member
);
5138 TYPE_VFIELD (type
) = NULL_TREE
;
5140 if (TYPE_BINFO (type
))
5142 free_lang_data_in_binfo (TYPE_BINFO (type
));
5143 /* We need to preserve link to bases and virtual table for all
5144 polymorphic types to make devirtualization machinery working. */
5145 if (!BINFO_VTABLE (TYPE_BINFO (type
))
5146 || !flag_devirtualize
)
5147 TYPE_BINFO (type
) = NULL
;
5150 else if (INTEGRAL_TYPE_P (type
)
5151 || SCALAR_FLOAT_TYPE_P (type
)
5152 || FIXED_POINT_TYPE_P (type
))
5154 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5155 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5158 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5160 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5161 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5163 if (TYPE_CONTEXT (type
)
5164 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5166 tree ctx
= TYPE_CONTEXT (type
);
5169 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5171 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5172 TYPE_CONTEXT (type
) = ctx
;
5175 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5176 TYPE_DECL if the type doesn't have linkage. */
5177 if (! type_with_linkage_p (type
))
5179 TYPE_NAME (type
) = TYPE_IDENTIFIER (type
);
5180 TYPE_STUB_DECL (type
) = NULL
;
5185 /* Return true if DECL may need an assembler name to be set. */
5188 need_assembler_name_p (tree decl
)
5190 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5191 Rule merging. This makes type_odr_p to return true on those types during
5192 LTO and by comparing the mangled name, we can say what types are intended
5193 to be equivalent across compilation unit.
5195 We do not store names of type_in_anonymous_namespace_p.
5197 Record, union and enumeration type have linkage that allows use
5198 to check type_in_anonymous_namespace_p. We do not mangle compound types
5199 that always can be compared structurally.
5201 Similarly for builtin types, we compare properties of their main variant.
5202 A special case are integer types where mangling do make differences
5203 between char/signed char/unsigned char etc. Storing name for these makes
5204 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5205 See cp/mangle.c:write_builtin_type for details. */
5207 if (flag_lto_odr_type_mering
5208 && TREE_CODE (decl
) == TYPE_DECL
5210 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5211 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5212 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5213 && (type_with_linkage_p (TREE_TYPE (decl
))
5214 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5215 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5216 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5217 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5218 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5221 /* If DECL already has its assembler name set, it does not need a
5223 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5224 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5227 /* Abstract decls do not need an assembler name. */
5228 if (DECL_ABSTRACT_P (decl
))
5231 /* For VAR_DECLs, only static, public and external symbols need an
5234 && !TREE_STATIC (decl
)
5235 && !TREE_PUBLIC (decl
)
5236 && !DECL_EXTERNAL (decl
))
5239 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5241 /* Do not set assembler name on builtins. Allow RTL expansion to
5242 decide whether to expand inline or via a regular call. */
5243 if (DECL_BUILT_IN (decl
)
5244 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5247 /* Functions represented in the callgraph need an assembler name. */
5248 if (cgraph_node::get (decl
) != NULL
)
5251 /* Unused and not public functions don't need an assembler name. */
5252 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5260 /* Reset all language specific information still present in symbol
5264 free_lang_data_in_decl (tree decl
)
5266 gcc_assert (DECL_P (decl
));
5268 /* Give the FE a chance to remove its own data first. */
5269 lang_hooks
.free_lang_data (decl
);
5271 TREE_LANG_FLAG_0 (decl
) = 0;
5272 TREE_LANG_FLAG_1 (decl
) = 0;
5273 TREE_LANG_FLAG_2 (decl
) = 0;
5274 TREE_LANG_FLAG_3 (decl
) = 0;
5275 TREE_LANG_FLAG_4 (decl
) = 0;
5276 TREE_LANG_FLAG_5 (decl
) = 0;
5277 TREE_LANG_FLAG_6 (decl
) = 0;
5279 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5280 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5281 if (TREE_CODE (decl
) == FIELD_DECL
)
5283 DECL_FCONTEXT (decl
) = NULL
;
5284 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5285 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5286 DECL_QUALIFIER (decl
) = NULL_TREE
;
5289 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5291 struct cgraph_node
*node
;
5292 if (!(node
= cgraph_node::get (decl
))
5293 || (!node
->definition
&& !node
->clones
))
5296 node
->release_body ();
5299 release_function_body (decl
);
5300 DECL_ARGUMENTS (decl
) = NULL
;
5301 DECL_RESULT (decl
) = NULL
;
5302 DECL_INITIAL (decl
) = error_mark_node
;
5305 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5309 /* If DECL has a gimple body, then the context for its
5310 arguments must be DECL. Otherwise, it doesn't really
5311 matter, as we will not be emitting any code for DECL. In
5312 general, there may be other instances of DECL created by
5313 the front end and since PARM_DECLs are generally shared,
5314 their DECL_CONTEXT changes as the replicas of DECL are
5315 created. The only time where DECL_CONTEXT is important
5316 is for the FUNCTION_DECLs that have a gimple body (since
5317 the PARM_DECL will be used in the function's body). */
5318 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5319 DECL_CONTEXT (t
) = decl
;
5320 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5321 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5322 = target_option_default_node
;
5323 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5324 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5325 = optimization_default_node
;
5328 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5329 At this point, it is not needed anymore. */
5330 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5332 /* Clear the abstract origin if it refers to a method.
5333 Otherwise dwarf2out.c will ICE as we splice functions out of
5334 TYPE_FIELDS and thus the origin will not be output
5336 if (DECL_ABSTRACT_ORIGIN (decl
)
5337 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5338 && RECORD_OR_UNION_TYPE_P
5339 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5340 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5342 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5343 DECL_VINDEX referring to itself into a vtable slot number as it
5344 should. Happens with functions that are copied and then forgotten
5345 about. Just clear it, it won't matter anymore. */
5346 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5347 DECL_VINDEX (decl
) = NULL_TREE
;
5349 else if (VAR_P (decl
))
5351 if ((DECL_EXTERNAL (decl
)
5352 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5353 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5354 DECL_INITIAL (decl
) = NULL_TREE
;
5356 else if (TREE_CODE (decl
) == TYPE_DECL
)
5358 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5359 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5360 DECL_INITIAL (decl
) = NULL_TREE
;
5361 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5363 else if (TREE_CODE (decl
) == FIELD_DECL
)
5364 DECL_INITIAL (decl
) = NULL_TREE
;
5365 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5366 && DECL_INITIAL (decl
)
5367 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5369 /* Strip builtins from the translation-unit BLOCK. We still have targets
5370 without builtin_decl_explicit support and also builtins are shared
5371 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5372 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5376 if (TREE_CODE (var
) == FUNCTION_DECL
5377 && DECL_BUILT_IN (var
))
5378 *nextp
= TREE_CHAIN (var
);
5380 nextp
= &TREE_CHAIN (var
);
5383 /* We need to keep field decls associated with their trees. Otherwise tree
5384 merging may merge some fileds and keep others disjoint wich in turn will
5385 not do well with TREE_CHAIN pointers linking them.
5387 Also do not drop containing types for virtual methods and tables because
5388 these are needed by devirtualization. */
5389 if (TREE_CODE (decl
) != FIELD_DECL
5390 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5391 || !DECL_VIRTUAL_P (decl
)))
5393 tree ctx
= DECL_CONTEXT (decl
);
5394 /* Variably modified types are needed for tree_is_indexable to decide
5395 whether the type needs to go to local or global section.
5396 This code is semi-broken but for now it is easiest to keep contexts
5398 if (ctx
&& TYPE_P (ctx
)
5399 && !variably_modified_type_p (ctx
, NULL_TREE
))
5401 while (ctx
&& TYPE_P (ctx
))
5402 ctx
= TYPE_CONTEXT (ctx
);
5403 DECL_CONTEXT (decl
) = ctx
;
5409 /* Data used when collecting DECLs and TYPEs for language data removal. */
5411 struct free_lang_data_d
5413 free_lang_data_d () : decls (100), types (100) {}
5415 /* Worklist to avoid excessive recursion. */
5416 auto_vec
<tree
> worklist
;
5418 /* Set of traversed objects. Used to avoid duplicate visits. */
5419 hash_set
<tree
> pset
;
5421 /* Array of symbols to process with free_lang_data_in_decl. */
5422 auto_vec
<tree
> decls
;
5424 /* Array of types to process with free_lang_data_in_type. */
5425 auto_vec
<tree
> types
;
5429 /* Add type or decl T to one of the list of tree nodes that need their
5430 language data removed. The lists are held inside FLD. */
5433 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5436 fld
->decls
.safe_push (t
);
5437 else if (TYPE_P (t
))
5438 fld
->types
.safe_push (t
);
5443 /* Push tree node T into FLD->WORKLIST. */
5446 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5448 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5449 fld
->worklist
.safe_push ((t
));
5453 /* Operand callback helper for free_lang_data_in_node. *TP is the
5454 subtree operand being considered. */
5457 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5460 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5462 if (TREE_CODE (t
) == TREE_LIST
)
5465 /* Language specific nodes will be removed, so there is no need
5466 to gather anything under them. */
5467 if (is_lang_specific (t
))
5475 /* Note that walk_tree does not traverse every possible field in
5476 decls, so we have to do our own traversals here. */
5477 add_tree_to_fld_list (t
, fld
);
5479 fld_worklist_push (DECL_NAME (t
), fld
);
5480 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5481 fld_worklist_push (DECL_SIZE (t
), fld
);
5482 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5484 /* We are going to remove everything under DECL_INITIAL for
5485 TYPE_DECLs. No point walking them. */
5486 if (TREE_CODE (t
) != TYPE_DECL
)
5487 fld_worklist_push (DECL_INITIAL (t
), fld
);
5489 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5490 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5492 if (TREE_CODE (t
) == FUNCTION_DECL
)
5494 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5495 fld_worklist_push (DECL_RESULT (t
), fld
);
5497 else if (TREE_CODE (t
) == FIELD_DECL
)
5499 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5500 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5501 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5502 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5505 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5506 && DECL_HAS_VALUE_EXPR_P (t
))
5507 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5509 if (TREE_CODE (t
) != FIELD_DECL
5510 && TREE_CODE (t
) != TYPE_DECL
)
5511 fld_worklist_push (TREE_CHAIN (t
), fld
);
5514 else if (TYPE_P (t
))
5516 /* Note that walk_tree does not traverse every possible field in
5517 types, so we have to do our own traversals here. */
5518 add_tree_to_fld_list (t
, fld
);
5520 if (!RECORD_OR_UNION_TYPE_P (t
))
5521 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5522 fld_worklist_push (TYPE_SIZE (t
), fld
);
5523 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5524 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5525 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5526 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5527 fld_worklist_push (TYPE_NAME (t
), fld
);
5528 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5529 them and thus do not and want not to reach unused pointer types
5531 if (!POINTER_TYPE_P (t
))
5532 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5533 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5534 if (!RECORD_OR_UNION_TYPE_P (t
))
5535 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5536 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5537 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5538 do not and want not to reach unused variants this way. */
5539 if (TYPE_CONTEXT (t
))
5541 tree ctx
= TYPE_CONTEXT (t
);
5542 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5543 So push that instead. */
5544 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5545 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5546 fld_worklist_push (ctx
, fld
);
5548 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5549 and want not to reach unused types this way. */
5551 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5555 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5556 fld_worklist_push (TREE_TYPE (tem
), fld
);
5557 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5558 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5560 if (RECORD_OR_UNION_TYPE_P (t
))
5563 /* Push all TYPE_FIELDS - there can be interleaving interesting
5564 and non-interesting things. */
5565 tem
= TYPE_FIELDS (t
);
5568 if (TREE_CODE (tem
) == FIELD_DECL
)
5569 fld_worklist_push (tem
, fld
);
5570 tem
= TREE_CHAIN (tem
);
5573 if (FUNC_OR_METHOD_TYPE_P (t
))
5574 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5576 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5579 else if (TREE_CODE (t
) == BLOCK
)
5581 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5583 if (TREE_CODE (*tem
) != VAR_DECL
5584 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
)))
5586 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5587 && TREE_CODE (*tem
) != PARM_DECL
);
5588 *tem
= TREE_CHAIN (*tem
);
5592 fld_worklist_push (*tem
, fld
);
5593 tem
= &TREE_CHAIN (*tem
);
5596 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5597 fld_worklist_push (tem
, fld
);
5598 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5601 if (TREE_CODE (t
) != IDENTIFIER_NODE
5602 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5603 fld_worklist_push (TREE_TYPE (t
), fld
);
5609 /* Find decls and types in T. */
5612 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5616 if (!fld
->pset
.contains (t
))
5617 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5618 if (fld
->worklist
.is_empty ())
5620 t
= fld
->worklist
.pop ();
5624 /* Translate all the types in LIST with the corresponding runtime
5628 get_eh_types_for_runtime (tree list
)
5632 if (list
== NULL_TREE
)
5635 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5637 list
= TREE_CHAIN (list
);
5640 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5641 TREE_CHAIN (prev
) = n
;
5642 prev
= TREE_CHAIN (prev
);
5643 list
= TREE_CHAIN (list
);
5650 /* Find decls and types referenced in EH region R and store them in
5651 FLD->DECLS and FLD->TYPES. */
5654 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5665 /* The types referenced in each catch must first be changed to the
5666 EH types used at runtime. This removes references to FE types
5668 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5670 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5671 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5676 case ERT_ALLOWED_EXCEPTIONS
:
5677 r
->u
.allowed
.type_list
5678 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5679 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5682 case ERT_MUST_NOT_THROW
:
5683 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5684 find_decls_types_r
, fld
, &fld
->pset
);
5690 /* Find decls and types referenced in cgraph node N and store them in
5691 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5692 look for *every* kind of DECL and TYPE node reachable from N,
5693 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5694 NAMESPACE_DECLs, etc). */
5697 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5700 struct function
*fn
;
5704 find_decls_types (n
->decl
, fld
);
5706 if (!gimple_has_body_p (n
->decl
))
5709 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5711 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5713 /* Traverse locals. */
5714 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5715 find_decls_types (t
, fld
);
5717 /* Traverse EH regions in FN. */
5720 FOR_ALL_EH_REGION_FN (r
, fn
)
5721 find_decls_types_in_eh_region (r
, fld
);
5724 /* Traverse every statement in FN. */
5725 FOR_EACH_BB_FN (bb
, fn
)
5728 gimple_stmt_iterator si
;
5731 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5733 gphi
*phi
= psi
.phi ();
5735 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5737 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5738 find_decls_types (*arg_p
, fld
);
5742 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5744 gimple
*stmt
= gsi_stmt (si
);
5746 if (is_gimple_call (stmt
))
5747 find_decls_types (gimple_call_fntype (stmt
), fld
);
5749 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5751 tree arg
= gimple_op (stmt
, i
);
5752 find_decls_types (arg
, fld
);
5759 /* Find decls and types referenced in varpool node N and store them in
5760 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5761 look for *every* kind of DECL and TYPE node reachable from N,
5762 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5763 NAMESPACE_DECLs, etc). */
5766 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5768 find_decls_types (v
->decl
, fld
);
5771 /* If T needs an assembler name, have one created for it. */
5774 assign_assembler_name_if_needed (tree t
)
5776 if (need_assembler_name_p (t
))
5778 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5779 diagnostics that use input_location to show locus
5780 information. The problem here is that, at this point,
5781 input_location is generally anchored to the end of the file
5782 (since the parser is long gone), so we don't have a good
5783 position to pin it to.
5785 To alleviate this problem, this uses the location of T's
5786 declaration. Examples of this are
5787 testsuite/g++.dg/template/cond2.C and
5788 testsuite/g++.dg/template/pr35240.C. */
5789 location_t saved_location
= input_location
;
5790 input_location
= DECL_SOURCE_LOCATION (t
);
5792 decl_assembler_name (t
);
5794 input_location
= saved_location
;
5799 /* Free language specific information for every operand and expression
5800 in every node of the call graph. This process operates in three stages:
5802 1- Every callgraph node and varpool node is traversed looking for
5803 decls and types embedded in them. This is a more exhaustive
5804 search than that done by find_referenced_vars, because it will
5805 also collect individual fields, decls embedded in types, etc.
5807 2- All the decls found are sent to free_lang_data_in_decl.
5809 3- All the types found are sent to free_lang_data_in_type.
5811 The ordering between decls and types is important because
5812 free_lang_data_in_decl sets assembler names, which includes
5813 mangling. So types cannot be freed up until assembler names have
5817 free_lang_data_in_cgraph (void)
5819 struct cgraph_node
*n
;
5821 struct free_lang_data_d fld
;
5826 /* Find decls and types in the body of every function in the callgraph. */
5827 FOR_EACH_FUNCTION (n
)
5828 find_decls_types_in_node (n
, &fld
);
5830 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5831 find_decls_types (p
->decl
, &fld
);
5833 /* Find decls and types in every varpool symbol. */
5834 FOR_EACH_VARIABLE (v
)
5835 find_decls_types_in_var (v
, &fld
);
5837 /* Set the assembler name on every decl found. We need to do this
5838 now because free_lang_data_in_decl will invalidate data needed
5839 for mangling. This breaks mangling on interdependent decls. */
5840 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5841 assign_assembler_name_if_needed (t
);
5843 /* Traverse every decl found freeing its language data. */
5844 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5845 free_lang_data_in_decl (t
);
5847 /* Traverse every type found freeing its language data. */
5848 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5849 free_lang_data_in_type (t
);
5852 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5858 /* Free resources that are used by FE but are not needed once they are done. */
5861 free_lang_data (void)
5865 /* If we are the LTO frontend we have freed lang-specific data already. */
5867 || (!flag_generate_lto
&& !flag_generate_offload
))
5870 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5871 if (vec_safe_is_empty (all_translation_units
))
5872 build_translation_unit_decl (NULL_TREE
);
5874 /* Allocate and assign alias sets to the standard integer types
5875 while the slots are still in the way the frontends generated them. */
5876 for (i
= 0; i
< itk_none
; ++i
)
5877 if (integer_types
[i
])
5878 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5880 /* Traverse the IL resetting language specific information for
5881 operands, expressions, etc. */
5882 free_lang_data_in_cgraph ();
5884 /* Create gimple variants for common types. */
5885 for (unsigned i
= 0;
5886 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5888 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5890 /* Reset some langhooks. Do not reset types_compatible_p, it may
5891 still be used indirectly via the get_alias_set langhook. */
5892 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5893 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5894 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5896 /* We do not want the default decl_assembler_name implementation,
5897 rather if we have fixed everything we want a wrapper around it
5898 asserting that all non-local symbols already got their assembler
5899 name and only produce assembler names for local symbols. Or rather
5900 make sure we never call decl_assembler_name on local symbols and
5901 devise a separate, middle-end private scheme for it. */
5903 /* Reset diagnostic machinery. */
5904 tree_diagnostics_defaults (global_dc
);
5906 rebuild_type_inheritance_graph ();
5914 const pass_data pass_data_ipa_free_lang_data
=
5916 SIMPLE_IPA_PASS
, /* type */
5917 "*free_lang_data", /* name */
5918 OPTGROUP_NONE
, /* optinfo_flags */
5919 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5920 0, /* properties_required */
5921 0, /* properties_provided */
5922 0, /* properties_destroyed */
5923 0, /* todo_flags_start */
5924 0, /* todo_flags_finish */
5927 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5930 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5931 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5934 /* opt_pass methods: */
5935 virtual unsigned int execute (function
*) { return free_lang_data (); }
5937 }; // class pass_ipa_free_lang_data
5941 simple_ipa_opt_pass
*
5942 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5944 return new pass_ipa_free_lang_data (ctxt
);
5947 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5948 of the various TYPE_QUAL values. */
5951 set_type_quals (tree type
, int type_quals
)
5953 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5954 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5955 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5956 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5957 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5960 /* Returns true iff CAND and BASE have equivalent language-specific
5964 check_lang_type (const_tree cand
, const_tree base
)
5966 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5968 /* type_hash_eq currently only applies to these types. */
5969 if (TREE_CODE (cand
) != FUNCTION_TYPE
5970 && TREE_CODE (cand
) != METHOD_TYPE
)
5972 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5975 /* Returns true iff unqualified CAND and BASE are equivalent. */
5978 check_base_type (const_tree cand
, const_tree base
)
5980 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5981 /* Apparently this is needed for Objective-C. */
5982 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5983 /* Check alignment. */
5984 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5985 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5986 TYPE_ATTRIBUTES (base
)));
5989 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5992 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5994 return (TYPE_QUALS (cand
) == type_quals
5995 && check_base_type (cand
, base
)
5996 && check_lang_type (cand
, base
));
5999 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6002 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6004 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6005 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6006 /* Apparently this is needed for Objective-C. */
6007 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6008 /* Check alignment. */
6009 && TYPE_ALIGN (cand
) == align
6010 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6011 TYPE_ATTRIBUTES (base
))
6012 && check_lang_type (cand
, base
));
6015 /* This function checks to see if TYPE matches the size one of the built-in
6016 atomic types, and returns that core atomic type. */
6019 find_atomic_core_type (tree type
)
6021 tree base_atomic_type
;
6023 /* Only handle complete types. */
6024 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6027 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6030 base_atomic_type
= atomicQI_type_node
;
6034 base_atomic_type
= atomicHI_type_node
;
6038 base_atomic_type
= atomicSI_type_node
;
6042 base_atomic_type
= atomicDI_type_node
;
6046 base_atomic_type
= atomicTI_type_node
;
6050 base_atomic_type
= NULL_TREE
;
6053 return base_atomic_type
;
6056 /* Return a version of the TYPE, qualified as indicated by the
6057 TYPE_QUALS, if one exists. If no qualified version exists yet,
6058 return NULL_TREE. */
6061 get_qualified_type (tree type
, int type_quals
)
6065 if (TYPE_QUALS (type
) == type_quals
)
6068 /* Search the chain of variants to see if there is already one there just
6069 like the one we need to have. If so, use that existing one. We must
6070 preserve the TYPE_NAME, since there is code that depends on this. */
6071 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6072 if (check_qualified_type (t
, type
, type_quals
))
6078 /* Like get_qualified_type, but creates the type if it does not
6079 exist. This function never returns NULL_TREE. */
6082 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6086 /* See if we already have the appropriate qualified variant. */
6087 t
= get_qualified_type (type
, type_quals
);
6089 /* If not, build it. */
6092 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6093 set_type_quals (t
, type_quals
);
6095 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6097 /* See if this object can map to a basic atomic type. */
6098 tree atomic_type
= find_atomic_core_type (type
);
6101 /* Ensure the alignment of this type is compatible with
6102 the required alignment of the atomic type. */
6103 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6104 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6108 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6109 /* Propagate structural equality. */
6110 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6111 else if (TYPE_CANONICAL (type
) != type
)
6112 /* Build the underlying canonical type, since it is different
6115 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6116 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6119 /* T is its own canonical type. */
6120 TYPE_CANONICAL (t
) = t
;
6127 /* Create a variant of type T with alignment ALIGN. */
6130 build_aligned_type (tree type
, unsigned int align
)
6134 if (TYPE_PACKED (type
)
6135 || TYPE_ALIGN (type
) == align
)
6138 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6139 if (check_aligned_type (t
, type
, align
))
6142 t
= build_variant_type_copy (type
);
6143 SET_TYPE_ALIGN (t
, align
);
6144 TYPE_USER_ALIGN (t
) = 1;
6149 /* Create a new distinct copy of TYPE. The new type is made its own
6150 MAIN_VARIANT. If TYPE requires structural equality checks, the
6151 resulting type requires structural equality checks; otherwise, its
6152 TYPE_CANONICAL points to itself. */
6155 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6157 tree t
= copy_node (type PASS_MEM_STAT
);
6159 TYPE_POINTER_TO (t
) = 0;
6160 TYPE_REFERENCE_TO (t
) = 0;
6162 /* Set the canonical type either to a new equivalence class, or
6163 propagate the need for structural equality checks. */
6164 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6165 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6167 TYPE_CANONICAL (t
) = t
;
6169 /* Make it its own variant. */
6170 TYPE_MAIN_VARIANT (t
) = t
;
6171 TYPE_NEXT_VARIANT (t
) = 0;
6173 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6174 whose TREE_TYPE is not t. This can also happen in the Ada
6175 frontend when using subtypes. */
6180 /* Create a new variant of TYPE, equivalent but distinct. This is so
6181 the caller can modify it. TYPE_CANONICAL for the return type will
6182 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6183 are considered equal by the language itself (or that both types
6184 require structural equality checks). */
6187 build_variant_type_copy (tree type MEM_STAT_DECL
)
6189 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6191 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6193 /* Since we're building a variant, assume that it is a non-semantic
6194 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6195 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6196 /* Type variants have no alias set defined. */
6197 TYPE_ALIAS_SET (t
) = -1;
6199 /* Add the new type to the chain of variants of TYPE. */
6200 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6201 TYPE_NEXT_VARIANT (m
) = t
;
6202 TYPE_MAIN_VARIANT (t
) = m
;
6207 /* Return true if the from tree in both tree maps are equal. */
6210 tree_map_base_eq (const void *va
, const void *vb
)
6212 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6213 *const b
= (const struct tree_map_base
*) vb
;
6214 return (a
->from
== b
->from
);
6217 /* Hash a from tree in a tree_base_map. */
6220 tree_map_base_hash (const void *item
)
6222 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6225 /* Return true if this tree map structure is marked for garbage collection
6226 purposes. We simply return true if the from tree is marked, so that this
6227 structure goes away when the from tree goes away. */
6230 tree_map_base_marked_p (const void *p
)
6232 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6235 /* Hash a from tree in a tree_map. */
6238 tree_map_hash (const void *item
)
6240 return (((const struct tree_map
*) item
)->hash
);
6243 /* Hash a from tree in a tree_decl_map. */
6246 tree_decl_map_hash (const void *item
)
6248 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6251 /* Return the initialization priority for DECL. */
6254 decl_init_priority_lookup (tree decl
)
6256 symtab_node
*snode
= symtab_node::get (decl
);
6259 return DEFAULT_INIT_PRIORITY
;
6261 snode
->get_init_priority ();
6264 /* Return the finalization priority for DECL. */
6267 decl_fini_priority_lookup (tree decl
)
6269 cgraph_node
*node
= cgraph_node::get (decl
);
6272 return DEFAULT_INIT_PRIORITY
;
6274 node
->get_fini_priority ();
6277 /* Set the initialization priority for DECL to PRIORITY. */
6280 decl_init_priority_insert (tree decl
, priority_type priority
)
6282 struct symtab_node
*snode
;
6284 if (priority
== DEFAULT_INIT_PRIORITY
)
6286 snode
= symtab_node::get (decl
);
6290 else if (VAR_P (decl
))
6291 snode
= varpool_node::get_create (decl
);
6293 snode
= cgraph_node::get_create (decl
);
6294 snode
->set_init_priority (priority
);
6297 /* Set the finalization priority for DECL to PRIORITY. */
6300 decl_fini_priority_insert (tree decl
, priority_type priority
)
6302 struct cgraph_node
*node
;
6304 if (priority
== DEFAULT_INIT_PRIORITY
)
6306 node
= cgraph_node::get (decl
);
6311 node
= cgraph_node::get_create (decl
);
6312 node
->set_fini_priority (priority
);
6315 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6318 print_debug_expr_statistics (void)
6320 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6321 (long) debug_expr_for_decl
->size (),
6322 (long) debug_expr_for_decl
->elements (),
6323 debug_expr_for_decl
->collisions ());
6326 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6329 print_value_expr_statistics (void)
6331 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6332 (long) value_expr_for_decl
->size (),
6333 (long) value_expr_for_decl
->elements (),
6334 value_expr_for_decl
->collisions ());
6337 /* Lookup a debug expression for FROM, and return it if we find one. */
6340 decl_debug_expr_lookup (tree from
)
6342 struct tree_decl_map
*h
, in
;
6343 in
.base
.from
= from
;
6345 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6351 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6354 decl_debug_expr_insert (tree from
, tree to
)
6356 struct tree_decl_map
*h
;
6358 h
= ggc_alloc
<tree_decl_map
> ();
6359 h
->base
.from
= from
;
6361 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6364 /* Lookup a value expression for FROM, and return it if we find one. */
6367 decl_value_expr_lookup (tree from
)
6369 struct tree_decl_map
*h
, in
;
6370 in
.base
.from
= from
;
6372 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6378 /* Insert a mapping FROM->TO in the value expression hashtable. */
6381 decl_value_expr_insert (tree from
, tree to
)
6383 struct tree_decl_map
*h
;
6385 h
= ggc_alloc
<tree_decl_map
> ();
6386 h
->base
.from
= from
;
6388 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6391 /* Lookup a vector of debug arguments for FROM, and return it if we
6395 decl_debug_args_lookup (tree from
)
6397 struct tree_vec_map
*h
, in
;
6399 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6401 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6402 in
.base
.from
= from
;
6403 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6409 /* Insert a mapping FROM->empty vector of debug arguments in the value
6410 expression hashtable. */
6413 decl_debug_args_insert (tree from
)
6415 struct tree_vec_map
*h
;
6418 if (DECL_HAS_DEBUG_ARGS_P (from
))
6419 return decl_debug_args_lookup (from
);
6420 if (debug_args_for_decl
== NULL
)
6421 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6422 h
= ggc_alloc
<tree_vec_map
> ();
6423 h
->base
.from
= from
;
6425 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6427 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6431 /* Hashing of types so that we don't make duplicates.
6432 The entry point is `type_hash_canon'. */
6434 /* Generate the default hash code for TYPE. This is designed for
6435 speed, rather than maximum entropy. */
6438 type_hash_canon_hash (tree type
)
6440 inchash::hash hstate
;
6442 hstate
.add_int (TREE_CODE (type
));
6444 if (TREE_TYPE (type
))
6445 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6447 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6448 /* Just the identifier is adequate to distinguish. */
6449 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6451 switch (TREE_CODE (type
))
6454 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6457 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6458 if (TREE_VALUE (t
) != error_mark_node
)
6459 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6463 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6468 if (TYPE_DOMAIN (type
))
6469 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6470 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6472 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6473 hstate
.add_object (typeless
);
6480 tree t
= TYPE_MAX_VALUE (type
);
6482 t
= TYPE_MIN_VALUE (type
);
6483 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6484 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6489 case FIXED_POINT_TYPE
:
6491 unsigned prec
= TYPE_PRECISION (type
);
6492 hstate
.add_object (prec
);
6497 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6504 return hstate
.end ();
6507 /* These are the Hashtable callback functions. */
6509 /* Returns true iff the types are equivalent. */
6512 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6514 /* First test the things that are the same for all types. */
6515 if (a
->hash
!= b
->hash
6516 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6517 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6518 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6519 TYPE_ATTRIBUTES (b
->type
))
6520 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6521 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6524 /* Be careful about comparing arrays before and after the element type
6525 has been completed; don't compare TYPE_ALIGN unless both types are
6527 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6528 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6529 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6532 switch (TREE_CODE (a
->type
))
6537 case REFERENCE_TYPE
:
6542 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6543 TYPE_VECTOR_SUBPARTS (b
->type
));
6546 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6547 && !(TYPE_VALUES (a
->type
)
6548 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6549 && TYPE_VALUES (b
->type
)
6550 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6551 && type_list_equal (TYPE_VALUES (a
->type
),
6552 TYPE_VALUES (b
->type
))))
6560 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6562 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6563 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6564 TYPE_MAX_VALUE (b
->type
)))
6565 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6566 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6567 TYPE_MIN_VALUE (b
->type
))));
6569 case FIXED_POINT_TYPE
:
6570 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6573 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6576 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6577 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6578 || (TYPE_ARG_TYPES (a
->type
)
6579 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6580 && TYPE_ARG_TYPES (b
->type
)
6581 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6582 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6583 TYPE_ARG_TYPES (b
->type
)))))
6587 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6588 where the flag should be inherited from the element type
6589 and can change after ARRAY_TYPEs are created; on non-aggregates
6590 compare it and hash it, scalars will never have that flag set
6591 and we need to differentiate between arrays created by different
6592 front-ends or middle-end created arrays. */
6593 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6594 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6595 || (TYPE_TYPELESS_STORAGE (a
->type
)
6596 == TYPE_TYPELESS_STORAGE (b
->type
))));
6600 case QUAL_UNION_TYPE
:
6601 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6602 || (TYPE_FIELDS (a
->type
)
6603 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6604 && TYPE_FIELDS (b
->type
)
6605 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6606 && type_list_equal (TYPE_FIELDS (a
->type
),
6607 TYPE_FIELDS (b
->type
))));
6610 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6611 || (TYPE_ARG_TYPES (a
->type
)
6612 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6613 && TYPE_ARG_TYPES (b
->type
)
6614 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6615 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6616 TYPE_ARG_TYPES (b
->type
))))
6624 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6625 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6630 /* Given TYPE, and HASHCODE its hash code, return the canonical
6631 object for an identical type if one already exists.
6632 Otherwise, return TYPE, and record it as the canonical object.
6634 To use this function, first create a type of the sort you want.
6635 Then compute its hash code from the fields of the type that
6636 make it different from other similar types.
6637 Then call this function and use the value. */
6640 type_hash_canon (unsigned int hashcode
, tree type
)
6645 /* The hash table only contains main variants, so ensure that's what we're
6647 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6649 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6650 must call that routine before comparing TYPE_ALIGNs. */
6656 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6659 tree t1
= ((type_hash
*) *loc
)->type
;
6660 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
6662 if (TYPE_UID (type
) + 1 == next_type_uid
)
6664 /* Free also min/max values and the cache for integer
6665 types. This can't be done in free_node, as LTO frees
6666 those on its own. */
6667 if (TREE_CODE (type
) == INTEGER_TYPE
)
6669 if (TYPE_MIN_VALUE (type
)
6670 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6672 /* Zero is always in TYPE_CACHED_VALUES. */
6673 if (! TYPE_UNSIGNED (type
))
6674 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6675 ggc_free (TYPE_MIN_VALUE (type
));
6677 if (TYPE_MAX_VALUE (type
)
6678 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6680 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6681 ggc_free (TYPE_MAX_VALUE (type
));
6683 if (TYPE_CACHED_VALUES_P (type
))
6684 ggc_free (TYPE_CACHED_VALUES (type
));
6691 struct type_hash
*h
;
6693 h
= ggc_alloc
<type_hash
> ();
6703 print_type_hash_statistics (void)
6705 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6706 (long) type_hash_table
->size (),
6707 (long) type_hash_table
->elements (),
6708 type_hash_table
->collisions ());
6711 /* Given two lists of types
6712 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6713 return 1 if the lists contain the same types in the same order.
6714 Also, the TREE_PURPOSEs must match. */
6717 type_list_equal (const_tree l1
, const_tree l2
)
6721 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6722 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6723 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6724 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6725 && (TREE_TYPE (TREE_PURPOSE (t1
))
6726 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6732 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6733 given by TYPE. If the argument list accepts variable arguments,
6734 then this function counts only the ordinary arguments. */
6737 type_num_arguments (const_tree type
)
6742 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6743 /* If the function does not take a variable number of arguments,
6744 the last element in the list will have type `void'. */
6745 if (VOID_TYPE_P (TREE_VALUE (t
)))
6753 /* Nonzero if integer constants T1 and T2
6754 represent the same constant value. */
6757 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6762 if (t1
== 0 || t2
== 0)
6765 if (TREE_CODE (t1
) == INTEGER_CST
6766 && TREE_CODE (t2
) == INTEGER_CST
6767 && wi::to_widest (t1
) == wi::to_widest (t2
))
6773 /* Return true if T is an INTEGER_CST whose numerical value (extended
6774 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6777 tree_fits_shwi_p (const_tree t
)
6779 return (t
!= NULL_TREE
6780 && TREE_CODE (t
) == INTEGER_CST
6781 && wi::fits_shwi_p (wi::to_widest (t
)));
6784 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6785 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6788 tree_fits_poly_int64_p (const_tree t
)
6792 if (POLY_INT_CST_P (t
))
6794 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6795 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
6799 return (TREE_CODE (t
) == INTEGER_CST
6800 && wi::fits_shwi_p (wi::to_widest (t
)));
6803 /* Return true if T is an INTEGER_CST whose numerical value (extended
6804 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6807 tree_fits_uhwi_p (const_tree t
)
6809 return (t
!= NULL_TREE
6810 && TREE_CODE (t
) == INTEGER_CST
6811 && wi::fits_uhwi_p (wi::to_widest (t
)));
6814 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6815 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6818 tree_fits_poly_uint64_p (const_tree t
)
6822 if (POLY_INT_CST_P (t
))
6824 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6825 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
6829 return (TREE_CODE (t
) == INTEGER_CST
6830 && wi::fits_uhwi_p (wi::to_widest (t
)));
6833 /* T is an INTEGER_CST whose numerical value (extended according to
6834 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6838 tree_to_shwi (const_tree t
)
6840 gcc_assert (tree_fits_shwi_p (t
));
6841 return TREE_INT_CST_LOW (t
);
6844 /* T is an INTEGER_CST whose numerical value (extended according to
6845 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6848 unsigned HOST_WIDE_INT
6849 tree_to_uhwi (const_tree t
)
6851 gcc_assert (tree_fits_uhwi_p (t
));
6852 return TREE_INT_CST_LOW (t
);
6855 /* Return the most significant (sign) bit of T. */
6858 tree_int_cst_sign_bit (const_tree t
)
6860 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6862 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6865 /* Return an indication of the sign of the integer constant T.
6866 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6867 Note that -1 will never be returned if T's type is unsigned. */
6870 tree_int_cst_sgn (const_tree t
)
6872 if (wi::to_wide (t
) == 0)
6874 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6876 else if (wi::neg_p (wi::to_wide (t
)))
6882 /* Return the minimum number of bits needed to represent VALUE in a
6883 signed or unsigned type, UNSIGNEDP says which. */
6886 tree_int_cst_min_precision (tree value
, signop sgn
)
6888 /* If the value is negative, compute its negative minus 1. The latter
6889 adjustment is because the absolute value of the largest negative value
6890 is one larger than the largest positive value. This is equivalent to
6891 a bit-wise negation, so use that operation instead. */
6893 if (tree_int_cst_sgn (value
) < 0)
6894 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6896 /* Return the number of bits needed, taking into account the fact
6897 that we need one more bit for a signed than unsigned type.
6898 If value is 0 or -1, the minimum precision is 1 no matter
6899 whether unsignedp is true or false. */
6901 if (integer_zerop (value
))
6904 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6907 /* Return truthvalue of whether T1 is the same tree structure as T2.
6908 Return 1 if they are the same.
6909 Return 0 if they are understandably different.
6910 Return -1 if either contains tree structure not understood by
6914 simple_cst_equal (const_tree t1
, const_tree t2
)
6916 enum tree_code code1
, code2
;
6922 if (t1
== 0 || t2
== 0)
6925 code1
= TREE_CODE (t1
);
6926 code2
= TREE_CODE (t2
);
6928 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6930 if (CONVERT_EXPR_CODE_P (code2
)
6931 || code2
== NON_LVALUE_EXPR
)
6932 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6934 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6937 else if (CONVERT_EXPR_CODE_P (code2
)
6938 || code2
== NON_LVALUE_EXPR
)
6939 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6947 return wi::to_widest (t1
) == wi::to_widest (t2
);
6950 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6953 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6956 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6957 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6958 TREE_STRING_LENGTH (t1
)));
6962 unsigned HOST_WIDE_INT idx
;
6963 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6964 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6966 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6969 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6970 /* ??? Should we handle also fields here? */
6971 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6977 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6980 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6983 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6986 const_tree arg1
, arg2
;
6987 const_call_expr_arg_iterator iter1
, iter2
;
6988 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6989 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6991 arg1
= next_const_call_expr_arg (&iter1
),
6992 arg2
= next_const_call_expr_arg (&iter2
))
6994 cmp
= simple_cst_equal (arg1
, arg2
);
6998 return arg1
== arg2
;
7002 /* Special case: if either target is an unallocated VAR_DECL,
7003 it means that it's going to be unified with whatever the
7004 TARGET_EXPR is really supposed to initialize, so treat it
7005 as being equivalent to anything. */
7006 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7007 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7008 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7009 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7010 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7011 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7014 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7019 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7021 case WITH_CLEANUP_EXPR
:
7022 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7026 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7029 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7030 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7041 if (POLY_INT_CST_P (t1
))
7042 /* A false return means maybe_ne rather than known_ne. */
7043 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7044 TYPE_SIGN (TREE_TYPE (t1
))),
7045 poly_widest_int::from (poly_int_cst_value (t2
),
7046 TYPE_SIGN (TREE_TYPE (t2
))));
7050 /* This general rule works for most tree codes. All exceptions should be
7051 handled above. If this is a language-specific tree code, we can't
7052 trust what might be in the operand, so say we don't know
7054 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7057 switch (TREE_CODE_CLASS (code1
))
7061 case tcc_comparison
:
7062 case tcc_expression
:
7066 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7068 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7080 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7081 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7082 than U, respectively. */
7085 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7087 if (tree_int_cst_sgn (t
) < 0)
7089 else if (!tree_fits_uhwi_p (t
))
7091 else if (TREE_INT_CST_LOW (t
) == u
)
7093 else if (TREE_INT_CST_LOW (t
) < u
)
7099 /* Return true if SIZE represents a constant size that is in bounds of
7100 what the middle-end and the backend accepts (covering not more than
7101 half of the address-space). */
7104 valid_constant_size_p (const_tree size
)
7106 if (POLY_INT_CST_P (size
))
7108 if (TREE_OVERFLOW (size
))
7110 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7111 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7115 if (! tree_fits_uhwi_p (size
)
7116 || TREE_OVERFLOW (size
)
7117 || tree_int_cst_sign_bit (size
) != 0)
7122 /* Return the precision of the type, or for a complex or vector type the
7123 precision of the type of its elements. */
7126 element_precision (const_tree type
)
7129 type
= TREE_TYPE (type
);
7130 enum tree_code code
= TREE_CODE (type
);
7131 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7132 type
= TREE_TYPE (type
);
7134 return TYPE_PRECISION (type
);
7137 /* Return true if CODE represents an associative tree code. Otherwise
7140 associative_tree_code (enum tree_code code
)
7159 /* Return true if CODE represents a commutative tree code. Otherwise
7162 commutative_tree_code (enum tree_code code
)
7168 case MULT_HIGHPART_EXPR
:
7176 case UNORDERED_EXPR
:
7180 case TRUTH_AND_EXPR
:
7181 case TRUTH_XOR_EXPR
:
7183 case WIDEN_MULT_EXPR
:
7184 case VEC_WIDEN_MULT_HI_EXPR
:
7185 case VEC_WIDEN_MULT_LO_EXPR
:
7186 case VEC_WIDEN_MULT_EVEN_EXPR
:
7187 case VEC_WIDEN_MULT_ODD_EXPR
:
7196 /* Return true if CODE represents a ternary tree code for which the
7197 first two operands are commutative. Otherwise return false. */
7199 commutative_ternary_tree_code (enum tree_code code
)
7203 case WIDEN_MULT_PLUS_EXPR
:
7204 case WIDEN_MULT_MINUS_EXPR
:
7214 /* Returns true if CODE can overflow. */
7217 operation_can_overflow (enum tree_code code
)
7225 /* Can overflow in various ways. */
7227 case TRUNC_DIV_EXPR
:
7228 case EXACT_DIV_EXPR
:
7229 case FLOOR_DIV_EXPR
:
7231 /* For INT_MIN / -1. */
7238 /* These operators cannot overflow. */
7243 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7244 ftrapv doesn't generate trapping insns for CODE. */
7247 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7249 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7251 /* We don't generate instructions that trap on overflow for complex or vector
7253 if (!INTEGRAL_TYPE_P (type
))
7256 if (!TYPE_OVERFLOW_TRAPS (type
))
7266 /* These operators can overflow, and -ftrapv generates trapping code for
7269 case TRUNC_DIV_EXPR
:
7270 case EXACT_DIV_EXPR
:
7271 case FLOOR_DIV_EXPR
:
7274 /* These operators can overflow, but -ftrapv does not generate trapping
7278 /* These operators cannot overflow. */
7286 /* Generate a hash value for an expression. This can be used iteratively
7287 by passing a previous result as the HSTATE argument.
7289 This function is intended to produce the same hash for expressions which
7290 would compare equal using operand_equal_p. */
7292 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7295 enum tree_code code
;
7296 enum tree_code_class tclass
;
7298 if (t
== NULL_TREE
|| t
== error_mark_node
)
7300 hstate
.merge_hash (0);
7304 if (!(flags
& OEP_ADDRESS_OF
))
7307 code
= TREE_CODE (t
);
7311 /* Alas, constants aren't shared, so we can't rely on pointer
7314 hstate
.merge_hash (0);
7317 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7318 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7319 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7324 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7327 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7328 hstate
.merge_hash (val2
);
7333 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7334 hstate
.merge_hash (val2
);
7338 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7339 TREE_STRING_LENGTH (t
));
7342 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7343 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7347 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7348 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7349 unsigned int count
= vector_cst_encoded_nelts (t
);
7350 for (unsigned int i
= 0; i
< count
; ++i
)
7351 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7355 /* We can just compare by pointer. */
7356 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7358 case PLACEHOLDER_EXPR
:
7359 /* The node itself doesn't matter. */
7366 /* A list of expressions, for a CALL_EXPR or as the elements of a
7368 for (; t
; t
= TREE_CHAIN (t
))
7369 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7373 unsigned HOST_WIDE_INT idx
;
7375 flags
&= ~OEP_ADDRESS_OF
;
7376 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7378 inchash::add_expr (field
, hstate
, flags
);
7379 inchash::add_expr (value
, hstate
, flags
);
7383 case STATEMENT_LIST
:
7385 tree_stmt_iterator i
;
7386 for (i
= tsi_start (CONST_CAST_TREE (t
));
7387 !tsi_end_p (i
); tsi_next (&i
))
7388 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7392 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7393 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7395 case IDENTIFIER_NODE
:
7396 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
7399 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7400 Otherwise nodes that compare equal according to operand_equal_p might
7401 get different hash codes. However, don't do this for machine specific
7402 or front end builtins, since the function code is overloaded in those
7404 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7405 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7407 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7408 code
= TREE_CODE (t
);
7412 if (POLY_INT_CST_P (t
))
7414 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7415 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7418 tclass
= TREE_CODE_CLASS (code
);
7420 if (tclass
== tcc_declaration
)
7422 /* DECL's have a unique ID */
7423 hstate
.add_hwi (DECL_UID (t
));
7425 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7427 /* For comparisons that can be swapped, use the lower
7429 enum tree_code ccode
= swap_tree_comparison (code
);
7432 hstate
.add_object (ccode
);
7433 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7434 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7436 else if (CONVERT_EXPR_CODE_P (code
))
7438 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7440 enum tree_code ccode
= NOP_EXPR
;
7441 hstate
.add_object (ccode
);
7443 /* Don't hash the type, that can lead to having nodes which
7444 compare equal according to operand_equal_p, but which
7445 have different hash codes. Make sure to include signedness
7446 in the hash computation. */
7447 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7448 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7450 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7451 else if (code
== MEM_REF
7452 && (flags
& OEP_ADDRESS_OF
) != 0
7453 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7454 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7455 && integer_zerop (TREE_OPERAND (t
, 1)))
7456 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7458 /* Don't ICE on FE specific trees, or their arguments etc.
7459 during operand_equal_p hash verification. */
7460 else if (!IS_EXPR_CODE_CLASS (tclass
))
7461 gcc_assert (flags
& OEP_HASH_CHECK
);
7464 unsigned int sflags
= flags
;
7466 hstate
.add_object (code
);
7471 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7472 flags
|= OEP_ADDRESS_OF
;
7478 case TARGET_MEM_REF
:
7479 flags
&= ~OEP_ADDRESS_OF
;
7484 case ARRAY_RANGE_REF
:
7487 sflags
&= ~OEP_ADDRESS_OF
;
7491 flags
&= ~OEP_ADDRESS_OF
;
7494 case WIDEN_MULT_PLUS_EXPR
:
7495 case WIDEN_MULT_MINUS_EXPR
:
7497 /* The multiplication operands are commutative. */
7498 inchash::hash one
, two
;
7499 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7500 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7501 hstate
.add_commutative (one
, two
);
7502 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7507 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7508 hstate
.add_int (CALL_EXPR_IFN (t
));
7512 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7513 Usually different TARGET_EXPRs just should use
7514 different temporaries in their slots. */
7515 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7522 /* Don't hash the type, that can lead to having nodes which
7523 compare equal according to operand_equal_p, but which
7524 have different hash codes. */
7525 if (code
== NON_LVALUE_EXPR
)
7527 /* Make sure to include signness in the hash computation. */
7528 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7529 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7532 else if (commutative_tree_code (code
))
7534 /* It's a commutative expression. We want to hash it the same
7535 however it appears. We do this by first hashing both operands
7536 and then rehashing based on the order of their independent
7538 inchash::hash one
, two
;
7539 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7540 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7541 hstate
.add_commutative (one
, two
);
7544 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7545 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7546 i
== 0 ? flags
: sflags
);
7554 /* Constructors for pointer, array and function types.
7555 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7556 constructed by language-dependent code, not here.) */
7558 /* Construct, lay out and return the type of pointers to TO_TYPE with
7559 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7560 reference all of memory. If such a type has already been
7561 constructed, reuse it. */
7564 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7568 bool could_alias
= can_alias_all
;
7570 if (to_type
== error_mark_node
)
7571 return error_mark_node
;
7573 /* If the pointed-to type has the may_alias attribute set, force
7574 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7575 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7576 can_alias_all
= true;
7578 /* In some cases, languages will have things that aren't a POINTER_TYPE
7579 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7580 In that case, return that type without regard to the rest of our
7583 ??? This is a kludge, but consistent with the way this function has
7584 always operated and there doesn't seem to be a good way to avoid this
7586 if (TYPE_POINTER_TO (to_type
) != 0
7587 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7588 return TYPE_POINTER_TO (to_type
);
7590 /* First, if we already have a type for pointers to TO_TYPE and it's
7591 the proper mode, use it. */
7592 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7593 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7596 t
= make_node (POINTER_TYPE
);
7598 TREE_TYPE (t
) = to_type
;
7599 SET_TYPE_MODE (t
, mode
);
7600 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7601 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7602 TYPE_POINTER_TO (to_type
) = t
;
7604 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7605 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7606 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7607 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7609 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7612 /* Lay out the type. This function has many callers that are concerned
7613 with expression-construction, and this simplifies them all. */
7619 /* By default build pointers in ptr_mode. */
7622 build_pointer_type (tree to_type
)
7624 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7625 : TYPE_ADDR_SPACE (to_type
);
7626 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7627 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7630 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7633 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7637 bool could_alias
= can_alias_all
;
7639 if (to_type
== error_mark_node
)
7640 return error_mark_node
;
7642 /* If the pointed-to type has the may_alias attribute set, force
7643 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7644 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7645 can_alias_all
= true;
7647 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7648 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7649 In that case, return that type without regard to the rest of our
7652 ??? This is a kludge, but consistent with the way this function has
7653 always operated and there doesn't seem to be a good way to avoid this
7655 if (TYPE_REFERENCE_TO (to_type
) != 0
7656 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7657 return TYPE_REFERENCE_TO (to_type
);
7659 /* First, if we already have a type for pointers to TO_TYPE and it's
7660 the proper mode, use it. */
7661 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7662 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7665 t
= make_node (REFERENCE_TYPE
);
7667 TREE_TYPE (t
) = to_type
;
7668 SET_TYPE_MODE (t
, mode
);
7669 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7670 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7671 TYPE_REFERENCE_TO (to_type
) = t
;
7673 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7674 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7675 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7676 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7678 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7687 /* Build the node for the type of references-to-TO_TYPE by default
7691 build_reference_type (tree to_type
)
7693 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7694 : TYPE_ADDR_SPACE (to_type
);
7695 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7696 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7699 #define MAX_INT_CACHED_PREC \
7700 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7701 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7703 /* Builds a signed or unsigned integer type of precision PRECISION.
7704 Used for C bitfields whose precision does not match that of
7705 built-in target types. */
7707 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7713 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7715 if (precision
<= MAX_INT_CACHED_PREC
)
7717 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7722 itype
= make_node (INTEGER_TYPE
);
7723 TYPE_PRECISION (itype
) = precision
;
7726 fixup_unsigned_type (itype
);
7728 fixup_signed_type (itype
);
7732 inchash::hash hstate
;
7733 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7734 ret
= type_hash_canon (hstate
.end (), itype
);
7735 if (precision
<= MAX_INT_CACHED_PREC
)
7736 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7741 #define MAX_BOOL_CACHED_PREC \
7742 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7743 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7745 /* Builds a boolean type of precision PRECISION.
7746 Used for boolean vectors to choose proper vector element size. */
7748 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7752 if (precision
<= MAX_BOOL_CACHED_PREC
)
7754 type
= nonstandard_boolean_type_cache
[precision
];
7759 type
= make_node (BOOLEAN_TYPE
);
7760 TYPE_PRECISION (type
) = precision
;
7761 fixup_signed_type (type
);
7763 if (precision
<= MAX_INT_CACHED_PREC
)
7764 nonstandard_boolean_type_cache
[precision
] = type
;
7769 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7770 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7771 is true, reuse such a type that has already been constructed. */
7774 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7776 tree itype
= make_node (INTEGER_TYPE
);
7778 TREE_TYPE (itype
) = type
;
7780 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7781 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7783 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7784 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7785 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7786 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7787 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7788 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7789 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7794 if ((TYPE_MIN_VALUE (itype
)
7795 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7796 || (TYPE_MAX_VALUE (itype
)
7797 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7799 /* Since we cannot reliably merge this type, we need to compare it using
7800 structural equality checks. */
7801 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7805 hashval_t hash
= type_hash_canon_hash (itype
);
7806 itype
= type_hash_canon (hash
, itype
);
7811 /* Wrapper around build_range_type_1 with SHARED set to true. */
7814 build_range_type (tree type
, tree lowval
, tree highval
)
7816 return build_range_type_1 (type
, lowval
, highval
, true);
7819 /* Wrapper around build_range_type_1 with SHARED set to false. */
7822 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7824 return build_range_type_1 (type
, lowval
, highval
, false);
7827 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7828 MAXVAL should be the maximum value in the domain
7829 (one less than the length of the array).
7831 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7832 We don't enforce this limit, that is up to caller (e.g. language front end).
7833 The limit exists because the result is a signed type and we don't handle
7834 sizes that use more than one HOST_WIDE_INT. */
7837 build_index_type (tree maxval
)
7839 return build_range_type (sizetype
, size_zero_node
, maxval
);
7842 /* Return true if the debug information for TYPE, a subtype, should be emitted
7843 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7844 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7845 debug info and doesn't reflect the source code. */
7848 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7850 tree base_type
= TREE_TYPE (type
), low
, high
;
7852 /* Subrange types have a base type which is an integral type. */
7853 if (!INTEGRAL_TYPE_P (base_type
))
7856 /* Get the real bounds of the subtype. */
7857 if (lang_hooks
.types
.get_subrange_bounds
)
7858 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7861 low
= TYPE_MIN_VALUE (type
);
7862 high
= TYPE_MAX_VALUE (type
);
7865 /* If the type and its base type have the same representation and the same
7866 name, then the type is not a subrange but a copy of the base type. */
7867 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7868 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7869 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7870 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7871 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7872 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7882 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7883 and number of elements specified by the range of values of INDEX_TYPE.
7884 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7885 If SHARED is true, reuse such a type that has already been constructed. */
7888 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7893 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7895 error ("arrays of functions are not meaningful");
7896 elt_type
= integer_type_node
;
7899 t
= make_node (ARRAY_TYPE
);
7900 TREE_TYPE (t
) = elt_type
;
7901 TYPE_DOMAIN (t
) = index_type
;
7902 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7903 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7906 /* If the element type is incomplete at this point we get marked for
7907 structural equality. Do not record these types in the canonical
7909 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7914 hashval_t hash
= type_hash_canon_hash (t
);
7915 t
= type_hash_canon (hash
, t
);
7918 if (TYPE_CANONICAL (t
) == t
)
7920 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7921 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7923 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7924 else if (TYPE_CANONICAL (elt_type
) != elt_type
7925 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7927 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7929 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7930 typeless_storage
, shared
);
7936 /* Wrapper around build_array_type_1 with SHARED set to true. */
7939 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7941 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7944 /* Wrapper around build_array_type_1 with SHARED set to false. */
7947 build_nonshared_array_type (tree elt_type
, tree index_type
)
7949 return build_array_type_1 (elt_type
, index_type
, false, false);
7952 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7956 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
7958 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7961 /* Recursively examines the array elements of TYPE, until a non-array
7962 element type is found. */
7965 strip_array_types (tree type
)
7967 while (TREE_CODE (type
) == ARRAY_TYPE
)
7968 type
= TREE_TYPE (type
);
7973 /* Computes the canonical argument types from the argument type list
7976 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7977 on entry to this function, or if any of the ARGTYPES are
7980 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7981 true on entry to this function, or if any of the ARGTYPES are
7984 Returns a canonical argument list, which may be ARGTYPES when the
7985 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7986 true) or would not differ from ARGTYPES. */
7989 maybe_canonicalize_argtypes (tree argtypes
,
7990 bool *any_structural_p
,
7991 bool *any_noncanonical_p
)
7994 bool any_noncanonical_argtypes_p
= false;
7996 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7998 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7999 /* Fail gracefully by stating that the type is structural. */
8000 *any_structural_p
= true;
8001 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8002 *any_structural_p
= true;
8003 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8004 || TREE_PURPOSE (arg
))
8005 /* If the argument has a default argument, we consider it
8006 non-canonical even though the type itself is canonical.
8007 That way, different variants of function and method types
8008 with default arguments will all point to the variant with
8009 no defaults as their canonical type. */
8010 any_noncanonical_argtypes_p
= true;
8013 if (*any_structural_p
)
8016 if (any_noncanonical_argtypes_p
)
8018 /* Build the canonical list of argument types. */
8019 tree canon_argtypes
= NULL_TREE
;
8020 bool is_void
= false;
8022 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8024 if (arg
== void_list_node
)
8027 canon_argtypes
= tree_cons (NULL_TREE
,
8028 TYPE_CANONICAL (TREE_VALUE (arg
)),
8032 canon_argtypes
= nreverse (canon_argtypes
);
8034 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8036 /* There is a non-canonical type. */
8037 *any_noncanonical_p
= true;
8038 return canon_argtypes
;
8041 /* The canonical argument types are the same as ARGTYPES. */
8045 /* Construct, lay out and return
8046 the type of functions returning type VALUE_TYPE
8047 given arguments of types ARG_TYPES.
8048 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8049 are data type nodes for the arguments of the function.
8050 If such a type has already been constructed, reuse it. */
8053 build_function_type (tree value_type
, tree arg_types
)
8056 inchash::hash hstate
;
8057 bool any_structural_p
, any_noncanonical_p
;
8058 tree canon_argtypes
;
8060 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8062 error ("function return type cannot be function");
8063 value_type
= integer_type_node
;
8066 /* Make a node of the sort we want. */
8067 t
= make_node (FUNCTION_TYPE
);
8068 TREE_TYPE (t
) = value_type
;
8069 TYPE_ARG_TYPES (t
) = arg_types
;
8071 /* If we already have such a type, use the old one. */
8072 hashval_t hash
= type_hash_canon_hash (t
);
8073 t
= type_hash_canon (hash
, t
);
8075 /* Set up the canonical type. */
8076 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8077 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8078 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8080 &any_noncanonical_p
);
8081 if (any_structural_p
)
8082 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8083 else if (any_noncanonical_p
)
8084 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8087 if (!COMPLETE_TYPE_P (t
))
8092 /* Build a function type. The RETURN_TYPE is the type returned by the
8093 function. If VAARGS is set, no void_type_node is appended to the
8094 list. ARGP must be always be terminated be a NULL_TREE. */
8097 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8101 t
= va_arg (argp
, tree
);
8102 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8103 args
= tree_cons (NULL_TREE
, t
, args
);
8108 if (args
!= NULL_TREE
)
8109 args
= nreverse (args
);
8110 gcc_assert (last
!= void_list_node
);
8112 else if (args
== NULL_TREE
)
8113 args
= void_list_node
;
8117 args
= nreverse (args
);
8118 TREE_CHAIN (last
) = void_list_node
;
8120 args
= build_function_type (return_type
, args
);
8125 /* Build a function type. The RETURN_TYPE is the type returned by the
8126 function. If additional arguments are provided, they are
8127 additional argument types. The list of argument types must always
8128 be terminated by NULL_TREE. */
8131 build_function_type_list (tree return_type
, ...)
8136 va_start (p
, return_type
);
8137 args
= build_function_type_list_1 (false, return_type
, p
);
8142 /* Build a variable argument function type. The RETURN_TYPE is the
8143 type returned by the function. If additional arguments are provided,
8144 they are additional argument types. The list of argument types must
8145 always be terminated by NULL_TREE. */
8148 build_varargs_function_type_list (tree return_type
, ...)
8153 va_start (p
, return_type
);
8154 args
= build_function_type_list_1 (true, return_type
, p
);
8160 /* Build a function type. RETURN_TYPE is the type returned by the
8161 function; VAARGS indicates whether the function takes varargs. The
8162 function takes N named arguments, the types of which are provided in
8166 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8170 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8172 for (i
= n
- 1; i
>= 0; i
--)
8173 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8175 return build_function_type (return_type
, t
);
8178 /* Build a function type. RETURN_TYPE is the type returned by the
8179 function. The function takes N named arguments, the types of which
8180 are provided in ARG_TYPES. */
8183 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8185 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8188 /* Build a variable argument function type. RETURN_TYPE is the type
8189 returned by the function. The function takes N named arguments, the
8190 types of which are provided in ARG_TYPES. */
8193 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8195 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8198 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8199 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8200 for the method. An implicit additional parameter (of type
8201 pointer-to-BASETYPE) is added to the ARGTYPES. */
8204 build_method_type_directly (tree basetype
,
8210 bool any_structural_p
, any_noncanonical_p
;
8211 tree canon_argtypes
;
8213 /* Make a node of the sort we want. */
8214 t
= make_node (METHOD_TYPE
);
8216 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8217 TREE_TYPE (t
) = rettype
;
8218 ptype
= build_pointer_type (basetype
);
8220 /* The actual arglist for this function includes a "hidden" argument
8221 which is "this". Put it into the list of argument types. */
8222 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8223 TYPE_ARG_TYPES (t
) = argtypes
;
8225 /* If we already have such a type, use the old one. */
8226 hashval_t hash
= type_hash_canon_hash (t
);
8227 t
= type_hash_canon (hash
, t
);
8229 /* Set up the canonical type. */
8231 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8232 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8234 = (TYPE_CANONICAL (basetype
) != basetype
8235 || TYPE_CANONICAL (rettype
) != rettype
);
8236 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8238 &any_noncanonical_p
);
8239 if (any_structural_p
)
8240 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8241 else if (any_noncanonical_p
)
8243 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8244 TYPE_CANONICAL (rettype
),
8246 if (!COMPLETE_TYPE_P (t
))
8252 /* Construct, lay out and return the type of methods belonging to class
8253 BASETYPE and whose arguments and values are described by TYPE.
8254 If that type exists already, reuse it.
8255 TYPE must be a FUNCTION_TYPE node. */
8258 build_method_type (tree basetype
, tree type
)
8260 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8262 return build_method_type_directly (basetype
,
8264 TYPE_ARG_TYPES (type
));
8267 /* Construct, lay out and return the type of offsets to a value
8268 of type TYPE, within an object of type BASETYPE.
8269 If a suitable offset type exists already, reuse it. */
8272 build_offset_type (tree basetype
, tree type
)
8276 /* Make a node of the sort we want. */
8277 t
= make_node (OFFSET_TYPE
);
8279 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8280 TREE_TYPE (t
) = type
;
8282 /* If we already have such a type, use the old one. */
8283 hashval_t hash
= type_hash_canon_hash (t
);
8284 t
= type_hash_canon (hash
, t
);
8286 if (!COMPLETE_TYPE_P (t
))
8289 if (TYPE_CANONICAL (t
) == t
)
8291 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8292 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8293 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8294 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8295 || TYPE_CANONICAL (type
) != type
)
8297 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8298 TYPE_CANONICAL (type
));
8304 /* Create a complex type whose components are COMPONENT_TYPE.
8306 If NAMED is true, the type is given a TYPE_NAME. We do not always
8307 do so because this creates a DECL node and thus make the DECL_UIDs
8308 dependent on the type canonicalization hashtable, which is GC-ed,
8309 so the DECL_UIDs would not be stable wrt garbage collection. */
8312 build_complex_type (tree component_type
, bool named
)
8314 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8315 || SCALAR_FLOAT_TYPE_P (component_type
)
8316 || FIXED_POINT_TYPE_P (component_type
));
8318 /* Make a node of the sort we want. */
8319 tree probe
= make_node (COMPLEX_TYPE
);
8321 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8323 /* If we already have such a type, use the old one. */
8324 hashval_t hash
= type_hash_canon_hash (probe
);
8325 tree t
= type_hash_canon (hash
, probe
);
8329 /* We created a new type. The hash insertion will have laid
8330 out the type. We need to check the canonicalization and
8331 maybe set the name. */
8332 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8334 && TYPE_CANONICAL (t
) == t
);
8336 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8337 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8338 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8340 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8342 /* We need to create a name, since complex is a fundamental type. */
8345 const char *name
= NULL
;
8347 if (TREE_TYPE (t
) == char_type_node
)
8348 name
= "complex char";
8349 else if (TREE_TYPE (t
) == signed_char_type_node
)
8350 name
= "complex signed char";
8351 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8352 name
= "complex unsigned char";
8353 else if (TREE_TYPE (t
) == short_integer_type_node
)
8354 name
= "complex short int";
8355 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8356 name
= "complex short unsigned int";
8357 else if (TREE_TYPE (t
) == integer_type_node
)
8358 name
= "complex int";
8359 else if (TREE_TYPE (t
) == unsigned_type_node
)
8360 name
= "complex unsigned int";
8361 else if (TREE_TYPE (t
) == long_integer_type_node
)
8362 name
= "complex long int";
8363 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8364 name
= "complex long unsigned int";
8365 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8366 name
= "complex long long int";
8367 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8368 name
= "complex long long unsigned int";
8371 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8372 get_identifier (name
), t
);
8376 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8379 /* If TYPE is a real or complex floating-point type and the target
8380 does not directly support arithmetic on TYPE then return the wider
8381 type to be used for arithmetic on TYPE. Otherwise, return
8385 excess_precision_type (tree type
)
8387 /* The target can give two different responses to the question of
8388 which excess precision mode it would like depending on whether we
8389 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8391 enum excess_precision_type requested_type
8392 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8393 ? EXCESS_PRECISION_TYPE_FAST
8394 : EXCESS_PRECISION_TYPE_STANDARD
);
8396 enum flt_eval_method target_flt_eval_method
8397 = targetm
.c
.excess_precision (requested_type
);
8399 /* The target should not ask for unpredictable float evaluation (though
8400 it might advertise that implicitly the evaluation is unpredictable,
8401 but we don't care about that here, it will have been reported
8402 elsewhere). If it does ask for unpredictable evaluation, we have
8403 nothing to do here. */
8404 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8406 /* Nothing to do. The target has asked for all types we know about
8407 to be computed with their native precision and range. */
8408 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8411 /* The target will promote this type in a target-dependent way, so excess
8412 precision ought to leave it alone. */
8413 if (targetm
.promoted_type (type
) != NULL_TREE
)
8416 machine_mode float16_type_mode
= (float16_type_node
8417 ? TYPE_MODE (float16_type_node
)
8419 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8420 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8422 switch (TREE_CODE (type
))
8426 machine_mode type_mode
= TYPE_MODE (type
);
8427 switch (target_flt_eval_method
)
8429 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8430 if (type_mode
== float16_type_mode
)
8431 return float_type_node
;
8433 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8434 if (type_mode
== float16_type_mode
8435 || type_mode
== float_type_mode
)
8436 return double_type_node
;
8438 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8439 if (type_mode
== float16_type_mode
8440 || type_mode
== float_type_mode
8441 || type_mode
== double_type_mode
)
8442 return long_double_type_node
;
8451 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8453 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8454 switch (target_flt_eval_method
)
8456 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8457 if (type_mode
== float16_type_mode
)
8458 return complex_float_type_node
;
8460 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8461 if (type_mode
== float16_type_mode
8462 || type_mode
== float_type_mode
)
8463 return complex_double_type_node
;
8465 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8466 if (type_mode
== float16_type_mode
8467 || type_mode
== float_type_mode
8468 || type_mode
== double_type_mode
)
8469 return complex_long_double_type_node
;
8483 /* Return OP, stripped of any conversions to wider types as much as is safe.
8484 Converting the value back to OP's type makes a value equivalent to OP.
8486 If FOR_TYPE is nonzero, we return a value which, if converted to
8487 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8489 OP must have integer, real or enumeral type. Pointers are not allowed!
8491 There are some cases where the obvious value we could return
8492 would regenerate to OP if converted to OP's type,
8493 but would not extend like OP to wider types.
8494 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8495 For example, if OP is (unsigned short)(signed char)-1,
8496 we avoid returning (signed char)-1 if FOR_TYPE is int,
8497 even though extending that to an unsigned short would regenerate OP,
8498 since the result of extending (signed char)-1 to (int)
8499 is different from (int) OP. */
8502 get_unwidened (tree op
, tree for_type
)
8504 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8505 tree type
= TREE_TYPE (op
);
8507 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8509 = (for_type
!= 0 && for_type
!= type
8510 && final_prec
> TYPE_PRECISION (type
)
8511 && TYPE_UNSIGNED (type
));
8514 while (CONVERT_EXPR_P (op
))
8518 /* TYPE_PRECISION on vector types has different meaning
8519 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8520 so avoid them here. */
8521 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8524 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8525 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8527 /* Truncations are many-one so cannot be removed.
8528 Unless we are later going to truncate down even farther. */
8530 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8533 /* See what's inside this conversion. If we decide to strip it,
8535 op
= TREE_OPERAND (op
, 0);
8537 /* If we have not stripped any zero-extensions (uns is 0),
8538 we can strip any kind of extension.
8539 If we have previously stripped a zero-extension,
8540 only zero-extensions can safely be stripped.
8541 Any extension can be stripped if the bits it would produce
8542 are all going to be discarded later by truncating to FOR_TYPE. */
8546 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8548 /* TYPE_UNSIGNED says whether this is a zero-extension.
8549 Let's avoid computing it if it does not affect WIN
8550 and if UNS will not be needed again. */
8552 || CONVERT_EXPR_P (op
))
8553 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8561 /* If we finally reach a constant see if it fits in sth smaller and
8562 in that case convert it. */
8563 if (TREE_CODE (win
) == INTEGER_CST
)
8565 tree wtype
= TREE_TYPE (win
);
8566 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8568 prec
= MAX (prec
, final_prec
);
8569 if (prec
< TYPE_PRECISION (wtype
))
8571 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8572 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8573 win
= fold_convert (t
, win
);
8580 /* Return OP or a simpler expression for a narrower value
8581 which can be sign-extended or zero-extended to give back OP.
8582 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8583 or 0 if the value should be sign-extended. */
8586 get_narrower (tree op
, int *unsignedp_ptr
)
8591 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8593 while (TREE_CODE (op
) == NOP_EXPR
)
8596 = (TYPE_PRECISION (TREE_TYPE (op
))
8597 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8599 /* Truncations are many-one so cannot be removed. */
8603 /* See what's inside this conversion. If we decide to strip it,
8608 op
= TREE_OPERAND (op
, 0);
8609 /* An extension: the outermost one can be stripped,
8610 but remember whether it is zero or sign extension. */
8612 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8613 /* Otherwise, if a sign extension has been stripped,
8614 only sign extensions can now be stripped;
8615 if a zero extension has been stripped, only zero-extensions. */
8616 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8620 else /* bitschange == 0 */
8622 /* A change in nominal type can always be stripped, but we must
8623 preserve the unsignedness. */
8625 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8627 op
= TREE_OPERAND (op
, 0);
8628 /* Keep trying to narrow, but don't assign op to win if it
8629 would turn an integral type into something else. */
8630 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8637 if (TREE_CODE (op
) == COMPONENT_REF
8638 /* Since type_for_size always gives an integer type. */
8639 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8640 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8641 /* Ensure field is laid out already. */
8642 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8643 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8645 unsigned HOST_WIDE_INT innerprec
8646 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8647 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8648 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8649 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8651 /* We can get this structure field in a narrower type that fits it,
8652 but the resulting extension to its nominal type (a fullword type)
8653 must satisfy the same conditions as for other extensions.
8655 Do this only for fields that are aligned (not bit-fields),
8656 because when bit-field insns will be used there is no
8657 advantage in doing this. */
8659 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8660 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8661 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8665 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8666 win
= fold_convert (type
, op
);
8670 *unsignedp_ptr
= uns
;
8674 /* Return true if integer constant C has a value that is permissible
8675 for TYPE, an integral type. */
8678 int_fits_type_p (const_tree c
, const_tree type
)
8680 tree type_low_bound
, type_high_bound
;
8681 bool ok_for_low_bound
, ok_for_high_bound
;
8682 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8684 /* Non-standard boolean types can have arbitrary precision but various
8685 transformations assume that they can only take values 0 and +/-1. */
8686 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8687 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8690 type_low_bound
= TYPE_MIN_VALUE (type
);
8691 type_high_bound
= TYPE_MAX_VALUE (type
);
8693 /* If at least one bound of the type is a constant integer, we can check
8694 ourselves and maybe make a decision. If no such decision is possible, but
8695 this type is a subtype, try checking against that. Otherwise, use
8696 fits_to_tree_p, which checks against the precision.
8698 Compute the status for each possibly constant bound, and return if we see
8699 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8700 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8701 for "constant known to fit". */
8703 /* Check if c >= type_low_bound. */
8704 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8706 if (tree_int_cst_lt (c
, type_low_bound
))
8708 ok_for_low_bound
= true;
8711 ok_for_low_bound
= false;
8713 /* Check if c <= type_high_bound. */
8714 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8716 if (tree_int_cst_lt (type_high_bound
, c
))
8718 ok_for_high_bound
= true;
8721 ok_for_high_bound
= false;
8723 /* If the constant fits both bounds, the result is known. */
8724 if (ok_for_low_bound
&& ok_for_high_bound
)
8727 /* Perform some generic filtering which may allow making a decision
8728 even if the bounds are not constant. First, negative integers
8729 never fit in unsigned types, */
8730 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8733 /* Second, narrower types always fit in wider ones. */
8734 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8737 /* Third, unsigned integers with top bit set never fit signed types. */
8738 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8740 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8741 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8743 /* When a tree_cst is converted to a wide-int, the precision
8744 is taken from the type. However, if the precision of the
8745 mode underneath the type is smaller than that, it is
8746 possible that the value will not fit. The test below
8747 fails if any bit is set between the sign bit of the
8748 underlying mode and the top bit of the type. */
8749 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8752 else if (wi::neg_p (wi::to_wide (c
)))
8756 /* If we haven't been able to decide at this point, there nothing more we
8757 can check ourselves here. Look at the base type if we have one and it
8758 has the same precision. */
8759 if (TREE_CODE (type
) == INTEGER_TYPE
8760 && TREE_TYPE (type
) != 0
8761 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8763 type
= TREE_TYPE (type
);
8767 /* Or to fits_to_tree_p, if nothing else. */
8768 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8771 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8772 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8773 represented (assuming two's-complement arithmetic) within the bit
8774 precision of the type are returned instead. */
8777 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8779 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8780 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8781 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8784 if (TYPE_UNSIGNED (type
))
8785 mpz_set_ui (min
, 0);
8788 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8789 wi::to_mpz (mn
, min
, SIGNED
);
8793 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8794 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8795 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8798 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8799 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8803 /* Return true if VAR is an automatic variable defined in function FN. */
8806 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8808 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8809 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8810 || TREE_CODE (var
) == PARM_DECL
)
8811 && ! TREE_STATIC (var
))
8812 || TREE_CODE (var
) == LABEL_DECL
8813 || TREE_CODE (var
) == RESULT_DECL
));
8816 /* Subprogram of following function. Called by walk_tree.
8818 Return *TP if it is an automatic variable or parameter of the
8819 function passed in as DATA. */
8822 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8824 tree fn
= (tree
) data
;
8829 else if (DECL_P (*tp
)
8830 && auto_var_in_fn_p (*tp
, fn
))
8836 /* Returns true if T is, contains, or refers to a type with variable
8837 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8838 arguments, but not the return type. If FN is nonzero, only return
8839 true if a modifier of the type or position of FN is a variable or
8840 parameter inside FN.
8842 This concept is more general than that of C99 'variably modified types':
8843 in C99, a struct type is never variably modified because a VLA may not
8844 appear as a structure member. However, in GNU C code like:
8846 struct S { int i[f()]; };
8848 is valid, and other languages may define similar constructs. */
8851 variably_modified_type_p (tree type
, tree fn
)
8855 /* Test if T is either variable (if FN is zero) or an expression containing
8856 a variable in FN. If TYPE isn't gimplified, return true also if
8857 gimplify_one_sizepos would gimplify the expression into a local
8859 #define RETURN_TRUE_IF_VAR(T) \
8860 do { tree _t = (T); \
8861 if (_t != NULL_TREE \
8862 && _t != error_mark_node \
8863 && !CONSTANT_CLASS_P (_t) \
8864 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8866 || (!TYPE_SIZES_GIMPLIFIED (type) \
8867 && (TREE_CODE (_t) != VAR_DECL \
8868 && !CONTAINS_PLACEHOLDER_P (_t))) \
8869 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8870 return true; } while (0)
8872 if (type
== error_mark_node
)
8875 /* If TYPE itself has variable size, it is variably modified. */
8876 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8877 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8879 switch (TREE_CODE (type
))
8882 case REFERENCE_TYPE
:
8884 /* Ada can have pointer types refering to themselves indirectly. */
8885 if (TREE_VISITED (type
))
8887 TREE_VISITED (type
) = true;
8888 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8890 TREE_VISITED (type
) = false;
8893 TREE_VISITED (type
) = false;
8898 /* If TYPE is a function type, it is variably modified if the
8899 return type is variably modified. */
8900 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8906 case FIXED_POINT_TYPE
:
8909 /* Scalar types are variably modified if their end points
8911 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8912 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8917 case QUAL_UNION_TYPE
:
8918 /* We can't see if any of the fields are variably-modified by the
8919 definition we normally use, since that would produce infinite
8920 recursion via pointers. */
8921 /* This is variably modified if some field's type is. */
8922 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8923 if (TREE_CODE (t
) == FIELD_DECL
)
8925 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8926 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8927 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8929 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8930 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8935 /* Do not call ourselves to avoid infinite recursion. This is
8936 variably modified if the element type is. */
8937 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8938 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8945 /* The current language may have other cases to check, but in general,
8946 all other types are not variably modified. */
8947 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8949 #undef RETURN_TRUE_IF_VAR
8952 /* Given a DECL or TYPE, return the scope in which it was declared, or
8953 NULL_TREE if there is no containing scope. */
8956 get_containing_scope (const_tree t
)
8958 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8961 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8964 get_ultimate_context (const_tree decl
)
8966 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8968 if (TREE_CODE (decl
) == BLOCK
)
8969 decl
= BLOCK_SUPERCONTEXT (decl
);
8971 decl
= get_containing_scope (decl
);
8976 /* Return the innermost context enclosing DECL that is
8977 a FUNCTION_DECL, or zero if none. */
8980 decl_function_context (const_tree decl
)
8984 if (TREE_CODE (decl
) == ERROR_MARK
)
8987 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8988 where we look up the function at runtime. Such functions always take
8989 a first argument of type 'pointer to real context'.
8991 C++ should really be fixed to use DECL_CONTEXT for the real context,
8992 and use something else for the "virtual context". */
8993 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8996 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8998 context
= DECL_CONTEXT (decl
);
9000 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9002 if (TREE_CODE (context
) == BLOCK
)
9003 context
= BLOCK_SUPERCONTEXT (context
);
9005 context
= get_containing_scope (context
);
9011 /* Return the innermost context enclosing DECL that is
9012 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9013 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9016 decl_type_context (const_tree decl
)
9018 tree context
= DECL_CONTEXT (decl
);
9021 switch (TREE_CODE (context
))
9023 case NAMESPACE_DECL
:
9024 case TRANSLATION_UNIT_DECL
:
9029 case QUAL_UNION_TYPE
:
9034 context
= DECL_CONTEXT (context
);
9038 context
= BLOCK_SUPERCONTEXT (context
);
9048 /* CALL is a CALL_EXPR. Return the declaration for the function
9049 called, or NULL_TREE if the called function cannot be
9053 get_callee_fndecl (const_tree call
)
9057 if (call
== error_mark_node
)
9058 return error_mark_node
;
9060 /* It's invalid to call this function with anything but a
9062 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9064 /* The first operand to the CALL is the address of the function
9066 addr
= CALL_EXPR_FN (call
);
9068 /* If there is no function, return early. */
9069 if (addr
== NULL_TREE
)
9074 /* If this is a readonly function pointer, extract its initial value. */
9075 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9076 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9077 && DECL_INITIAL (addr
))
9078 addr
= DECL_INITIAL (addr
);
9080 /* If the address is just `&f' for some function `f', then we know
9081 that `f' is being called. */
9082 if (TREE_CODE (addr
) == ADDR_EXPR
9083 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9084 return TREE_OPERAND (addr
, 0);
9086 /* We couldn't figure out what was being called. */
9090 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9091 return the associated function code, otherwise return CFN_LAST. */
9094 get_call_combined_fn (const_tree call
)
9096 /* It's invalid to call this function with anything but a CALL_EXPR. */
9097 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9099 if (!CALL_EXPR_FN (call
))
9100 return as_combined_fn (CALL_EXPR_IFN (call
));
9102 tree fndecl
= get_callee_fndecl (call
);
9103 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9104 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9109 #define TREE_MEM_USAGE_SPACES 40
9111 /* Print debugging information about tree nodes generated during the compile,
9112 and any language-specific information. */
9115 dump_tree_statistics (void)
9117 if (GATHER_STATISTICS
)
9120 uint64_t total_nodes
, total_bytes
;
9121 fprintf (stderr
, "\nKind Nodes Bytes\n");
9122 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9123 total_nodes
= total_bytes
= 0;
9124 for (i
= 0; i
< (int) all_kinds
; i
++)
9126 fprintf (stderr
, "%-20s %7" PRIu64
" %10" PRIu64
"\n",
9127 tree_node_kind_names
[i
], tree_node_counts
[i
],
9128 tree_node_sizes
[i
]);
9129 total_nodes
+= tree_node_counts
[i
];
9130 total_bytes
+= tree_node_sizes
[i
];
9132 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9133 fprintf (stderr
, "%-20s %7" PRIu64
" %10" PRIu64
"\n", "Total",
9134 total_nodes
, total_bytes
);
9135 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9136 fprintf (stderr
, "Code Nodes\n");
9137 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9138 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9139 fprintf (stderr
, "%-32s %7" PRIu64
"\n",
9140 get_tree_code_name ((enum tree_code
) i
), tree_code_counts
[i
]);
9141 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9142 fprintf (stderr
, "\n");
9143 ssanames_print_statistics ();
9144 fprintf (stderr
, "\n");
9145 phinodes_print_statistics ();
9146 fprintf (stderr
, "\n");
9149 fprintf (stderr
, "(No per-node statistics)\n");
9151 print_type_hash_statistics ();
9152 print_debug_expr_statistics ();
9153 print_value_expr_statistics ();
9154 lang_hooks
.print_statistics ();
9157 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9159 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9162 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9164 /* This relies on the raw feedback's top 4 bits being zero. */
9165 #define FEEDBACK(X) ((X) * 0x04c11db7)
9166 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9167 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9168 static const unsigned syndromes
[16] =
9170 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9171 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9172 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9173 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9178 value
<<= (32 - bytes
* 8);
9179 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9181 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9183 chksum
= (chksum
<< 4) ^ feedback
;
9189 /* Generate a crc32 of a string. */
9192 crc32_string (unsigned chksum
, const char *string
)
9195 chksum
= crc32_byte (chksum
, *string
);
9200 /* P is a string that will be used in a symbol. Mask out any characters
9201 that are not valid in that context. */
9204 clean_symbol_name (char *p
)
9208 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9211 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9218 /* For anonymous aggregate types, we need some sort of name to
9219 hold on to. In practice, this should not appear, but it should
9220 not be harmful if it does. */
9222 anon_aggrname_p(const_tree id_node
)
9224 #ifndef NO_DOT_IN_LABEL
9225 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9226 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9227 #else /* NO_DOT_IN_LABEL */
9228 #ifndef NO_DOLLAR_IN_LABEL
9229 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9230 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9231 #else /* NO_DOLLAR_IN_LABEL */
9232 #define ANON_AGGRNAME_PREFIX "__anon_"
9233 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9234 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9235 #endif /* NO_DOLLAR_IN_LABEL */
9236 #endif /* NO_DOT_IN_LABEL */
9239 /* Return a format for an anonymous aggregate name. */
9241 anon_aggrname_format()
9243 #ifndef NO_DOT_IN_LABEL
9245 #else /* NO_DOT_IN_LABEL */
9246 #ifndef NO_DOLLAR_IN_LABEL
9248 #else /* NO_DOLLAR_IN_LABEL */
9250 #endif /* NO_DOLLAR_IN_LABEL */
9251 #endif /* NO_DOT_IN_LABEL */
9254 /* Generate a name for a special-purpose function.
9255 The generated name may need to be unique across the whole link.
9256 Changes to this function may also require corresponding changes to
9257 xstrdup_mask_random.
9258 TYPE is some string to identify the purpose of this function to the
9259 linker or collect2; it must start with an uppercase letter,
9261 I - for constructors
9263 N - for C++ anonymous namespaces
9264 F - for DWARF unwind frame information. */
9267 get_file_function_name (const char *type
)
9273 /* If we already have a name we know to be unique, just use that. */
9274 if (first_global_object_name
)
9275 p
= q
= ASTRDUP (first_global_object_name
);
9276 /* If the target is handling the constructors/destructors, they
9277 will be local to this file and the name is only necessary for
9279 We also assign sub_I and sub_D sufixes to constructors called from
9280 the global static constructors. These are always local. */
9281 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9282 || (strncmp (type
, "sub_", 4) == 0
9283 && (type
[4] == 'I' || type
[4] == 'D')))
9285 const char *file
= main_input_filename
;
9287 file
= LOCATION_FILE (input_location
);
9288 /* Just use the file's basename, because the full pathname
9289 might be quite long. */
9290 p
= q
= ASTRDUP (lbasename (file
));
9294 /* Otherwise, the name must be unique across the entire link.
9295 We don't have anything that we know to be unique to this translation
9296 unit, so use what we do have and throw in some randomness. */
9298 const char *name
= weak_global_object_name
;
9299 const char *file
= main_input_filename
;
9304 file
= LOCATION_FILE (input_location
);
9306 len
= strlen (file
);
9307 q
= (char *) alloca (9 + 19 + len
+ 1);
9308 memcpy (q
, file
, len
+ 1);
9310 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9311 crc32_string (0, name
), get_random_seed (false));
9316 clean_symbol_name (q
);
9317 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9320 /* Set up the name of the file-level functions we may need.
9321 Use a global object (which is already required to be unique over
9322 the program) rather than the file name (which imposes extra
9324 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9326 return get_identifier (buf
);
9329 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9331 /* Complain that the tree code of NODE does not match the expected 0
9332 terminated list of trailing codes. The trailing code list can be
9333 empty, for a more vague error message. FILE, LINE, and FUNCTION
9334 are of the caller. */
9337 tree_check_failed (const_tree node
, const char *file
,
9338 int line
, const char *function
, ...)
9342 unsigned length
= 0;
9343 enum tree_code code
;
9345 va_start (args
, function
);
9346 while ((code
= (enum tree_code
) va_arg (args
, int)))
9347 length
+= 4 + strlen (get_tree_code_name (code
));
9352 va_start (args
, function
);
9353 length
+= strlen ("expected ");
9354 buffer
= tmp
= (char *) alloca (length
);
9356 while ((code
= (enum tree_code
) va_arg (args
, int)))
9358 const char *prefix
= length
? " or " : "expected ";
9360 strcpy (tmp
+ length
, prefix
);
9361 length
+= strlen (prefix
);
9362 strcpy (tmp
+ length
, get_tree_code_name (code
));
9363 length
+= strlen (get_tree_code_name (code
));
9368 buffer
= "unexpected node";
9370 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9371 buffer
, get_tree_code_name (TREE_CODE (node
)),
9372 function
, trim_filename (file
), line
);
9375 /* Complain that the tree code of NODE does match the expected 0
9376 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9380 tree_not_check_failed (const_tree node
, const char *file
,
9381 int line
, const char *function
, ...)
9385 unsigned length
= 0;
9386 enum tree_code code
;
9388 va_start (args
, function
);
9389 while ((code
= (enum tree_code
) va_arg (args
, int)))
9390 length
+= 4 + strlen (get_tree_code_name (code
));
9392 va_start (args
, function
);
9393 buffer
= (char *) alloca (length
);
9395 while ((code
= (enum tree_code
) va_arg (args
, int)))
9399 strcpy (buffer
+ length
, " or ");
9402 strcpy (buffer
+ length
, get_tree_code_name (code
));
9403 length
+= strlen (get_tree_code_name (code
));
9407 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9408 buffer
, get_tree_code_name (TREE_CODE (node
)),
9409 function
, trim_filename (file
), line
);
9412 /* Similar to tree_check_failed, except that we check for a class of tree
9413 code, given in CL. */
9416 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9417 const char *file
, int line
, const char *function
)
9420 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9421 TREE_CODE_CLASS_STRING (cl
),
9422 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9423 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9426 /* Similar to tree_check_failed, except that instead of specifying a
9427 dozen codes, use the knowledge that they're all sequential. */
9430 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9431 const char *function
, enum tree_code c1
,
9435 unsigned length
= 0;
9438 for (c
= c1
; c
<= c2
; ++c
)
9439 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9441 length
+= strlen ("expected ");
9442 buffer
= (char *) alloca (length
);
9445 for (c
= c1
; c
<= c2
; ++c
)
9447 const char *prefix
= length
? " or " : "expected ";
9449 strcpy (buffer
+ length
, prefix
);
9450 length
+= strlen (prefix
);
9451 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9452 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9455 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9456 buffer
, get_tree_code_name (TREE_CODE (node
)),
9457 function
, trim_filename (file
), line
);
9461 /* Similar to tree_check_failed, except that we check that a tree does
9462 not have the specified code, given in CL. */
9465 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9466 const char *file
, int line
, const char *function
)
9469 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9470 TREE_CODE_CLASS_STRING (cl
),
9471 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9472 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9476 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9479 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9480 const char *function
, enum omp_clause_code code
)
9482 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9483 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9484 function
, trim_filename (file
), line
);
9488 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9491 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9492 const char *function
, enum omp_clause_code c1
,
9493 enum omp_clause_code c2
)
9496 unsigned length
= 0;
9499 for (c
= c1
; c
<= c2
; ++c
)
9500 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9502 length
+= strlen ("expected ");
9503 buffer
= (char *) alloca (length
);
9506 for (c
= c1
; c
<= c2
; ++c
)
9508 const char *prefix
= length
? " or " : "expected ";
9510 strcpy (buffer
+ length
, prefix
);
9511 length
+= strlen (prefix
);
9512 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9513 length
+= strlen (omp_clause_code_name
[c
]);
9516 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9517 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9518 function
, trim_filename (file
), line
);
9522 #undef DEFTREESTRUCT
9523 #define DEFTREESTRUCT(VAL, NAME) NAME,
9525 static const char *ts_enum_names
[] = {
9526 #include "treestruct.def"
9528 #undef DEFTREESTRUCT
9530 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9532 /* Similar to tree_class_check_failed, except that we check for
9533 whether CODE contains the tree structure identified by EN. */
9536 tree_contains_struct_check_failed (const_tree node
,
9537 const enum tree_node_structure_enum en
,
9538 const char *file
, int line
,
9539 const char *function
)
9542 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9544 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9548 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9549 (dynamically sized) vector. */
9552 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9553 const char *function
)
9556 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9557 idx
+ 1, len
, function
, trim_filename (file
), line
);
9560 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9561 (dynamically sized) vector. */
9564 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9565 const char *function
)
9568 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9569 idx
+ 1, len
, function
, trim_filename (file
), line
);
9572 /* Similar to above, except that the check is for the bounds of the operand
9573 vector of an expression node EXP. */
9576 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9577 int line
, const char *function
)
9579 enum tree_code code
= TREE_CODE (exp
);
9581 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9582 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9583 function
, trim_filename (file
), line
);
9586 /* Similar to above, except that the check is for the number of
9587 operands of an OMP_CLAUSE node. */
9590 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9591 int line
, const char *function
)
9594 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9595 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9596 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9597 trim_filename (file
), line
);
9599 #endif /* ENABLE_TREE_CHECKING */
9601 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9602 and mapped to the machine mode MODE. Initialize its fields and build
9603 the information necessary for debugging output. */
9606 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9609 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9611 t
= make_node (VECTOR_TYPE
);
9612 TREE_TYPE (t
) = mv_innertype
;
9613 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9614 SET_TYPE_MODE (t
, mode
);
9616 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9617 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9618 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9619 || mode
!= VOIDmode
)
9620 && !VECTOR_BOOLEAN_TYPE_P (t
))
9622 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9626 hashval_t hash
= type_hash_canon_hash (t
);
9627 t
= type_hash_canon (hash
, t
);
9629 /* We have built a main variant, based on the main variant of the
9630 inner type. Use it to build the variant we return. */
9631 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9632 && TREE_TYPE (t
) != innertype
)
9633 return build_type_attribute_qual_variant (t
,
9634 TYPE_ATTRIBUTES (innertype
),
9635 TYPE_QUALS (innertype
));
9641 make_or_reuse_type (unsigned size
, int unsignedp
)
9645 if (size
== INT_TYPE_SIZE
)
9646 return unsignedp
? unsigned_type_node
: integer_type_node
;
9647 if (size
== CHAR_TYPE_SIZE
)
9648 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9649 if (size
== SHORT_TYPE_SIZE
)
9650 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9651 if (size
== LONG_TYPE_SIZE
)
9652 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9653 if (size
== LONG_LONG_TYPE_SIZE
)
9654 return (unsignedp
? long_long_unsigned_type_node
9655 : long_long_integer_type_node
);
9657 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9658 if (size
== int_n_data
[i
].bitsize
9659 && int_n_enabled_p
[i
])
9660 return (unsignedp
? int_n_trees
[i
].unsigned_type
9661 : int_n_trees
[i
].signed_type
);
9664 return make_unsigned_type (size
);
9666 return make_signed_type (size
);
9669 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9672 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9676 if (size
== SHORT_FRACT_TYPE_SIZE
)
9677 return unsignedp
? sat_unsigned_short_fract_type_node
9678 : sat_short_fract_type_node
;
9679 if (size
== FRACT_TYPE_SIZE
)
9680 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9681 if (size
== LONG_FRACT_TYPE_SIZE
)
9682 return unsignedp
? sat_unsigned_long_fract_type_node
9683 : sat_long_fract_type_node
;
9684 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9685 return unsignedp
? sat_unsigned_long_long_fract_type_node
9686 : sat_long_long_fract_type_node
;
9690 if (size
== SHORT_FRACT_TYPE_SIZE
)
9691 return unsignedp
? unsigned_short_fract_type_node
9692 : short_fract_type_node
;
9693 if (size
== FRACT_TYPE_SIZE
)
9694 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9695 if (size
== LONG_FRACT_TYPE_SIZE
)
9696 return unsignedp
? unsigned_long_fract_type_node
9697 : long_fract_type_node
;
9698 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9699 return unsignedp
? unsigned_long_long_fract_type_node
9700 : long_long_fract_type_node
;
9703 return make_fract_type (size
, unsignedp
, satp
);
9706 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9709 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9713 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9714 return unsignedp
? sat_unsigned_short_accum_type_node
9715 : sat_short_accum_type_node
;
9716 if (size
== ACCUM_TYPE_SIZE
)
9717 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9718 if (size
== LONG_ACCUM_TYPE_SIZE
)
9719 return unsignedp
? sat_unsigned_long_accum_type_node
9720 : sat_long_accum_type_node
;
9721 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9722 return unsignedp
? sat_unsigned_long_long_accum_type_node
9723 : sat_long_long_accum_type_node
;
9727 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9728 return unsignedp
? unsigned_short_accum_type_node
9729 : short_accum_type_node
;
9730 if (size
== ACCUM_TYPE_SIZE
)
9731 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9732 if (size
== LONG_ACCUM_TYPE_SIZE
)
9733 return unsignedp
? unsigned_long_accum_type_node
9734 : long_accum_type_node
;
9735 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9736 return unsignedp
? unsigned_long_long_accum_type_node
9737 : long_long_accum_type_node
;
9740 return make_accum_type (size
, unsignedp
, satp
);
9744 /* Create an atomic variant node for TYPE. This routine is called
9745 during initialization of data types to create the 5 basic atomic
9746 types. The generic build_variant_type function requires these to
9747 already be set up in order to function properly, so cannot be
9748 called from there. If ALIGN is non-zero, then ensure alignment is
9749 overridden to this value. */
9752 build_atomic_base (tree type
, unsigned int align
)
9756 /* Make sure its not already registered. */
9757 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9760 t
= build_variant_type_copy (type
);
9761 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9764 SET_TYPE_ALIGN (t
, align
);
9769 /* Information about the _FloatN and _FloatNx types. This must be in
9770 the same order as the corresponding TI_* enum values. */
9771 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9783 /* Create nodes for all integer types (and error_mark_node) using the sizes
9784 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9787 build_common_tree_nodes (bool signed_char
)
9791 error_mark_node
= make_node (ERROR_MARK
);
9792 TREE_TYPE (error_mark_node
) = error_mark_node
;
9794 initialize_sizetypes ();
9796 /* Define both `signed char' and `unsigned char'. */
9797 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9798 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9799 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9800 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9802 /* Define `char', which is like either `signed char' or `unsigned char'
9803 but not the same as either. */
9806 ? make_signed_type (CHAR_TYPE_SIZE
)
9807 : make_unsigned_type (CHAR_TYPE_SIZE
));
9808 TYPE_STRING_FLAG (char_type_node
) = 1;
9810 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9811 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9812 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9813 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9814 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9815 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9816 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9817 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9819 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9821 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9822 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9824 if (int_n_enabled_p
[i
])
9826 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9827 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9831 /* Define a boolean type. This type only represents boolean values but
9832 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9833 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9834 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9835 TYPE_PRECISION (boolean_type_node
) = 1;
9836 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9838 /* Define what type to use for size_t. */
9839 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9840 size_type_node
= unsigned_type_node
;
9841 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9842 size_type_node
= long_unsigned_type_node
;
9843 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9844 size_type_node
= long_long_unsigned_type_node
;
9845 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9846 size_type_node
= short_unsigned_type_node
;
9851 size_type_node
= NULL_TREE
;
9852 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9853 if (int_n_enabled_p
[i
])
9856 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9858 if (strcmp (name
, SIZE_TYPE
) == 0)
9860 size_type_node
= int_n_trees
[i
].unsigned_type
;
9863 if (size_type_node
== NULL_TREE
)
9867 /* Define what type to use for ptrdiff_t. */
9868 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9869 ptrdiff_type_node
= integer_type_node
;
9870 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9871 ptrdiff_type_node
= long_integer_type_node
;
9872 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9873 ptrdiff_type_node
= long_long_integer_type_node
;
9874 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9875 ptrdiff_type_node
= short_integer_type_node
;
9878 ptrdiff_type_node
= NULL_TREE
;
9879 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9880 if (int_n_enabled_p
[i
])
9883 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9884 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9885 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9887 if (ptrdiff_type_node
== NULL_TREE
)
9891 /* Fill in the rest of the sized types. Reuse existing type nodes
9893 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9894 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9895 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9896 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9897 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9899 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9900 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9901 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9902 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9903 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9905 /* Don't call build_qualified type for atomics. That routine does
9906 special processing for atomics, and until they are initialized
9907 it's better not to make that call.
9909 Check to see if there is a target override for atomic types. */
9911 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9912 targetm
.atomic_align_for_mode (QImode
));
9913 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9914 targetm
.atomic_align_for_mode (HImode
));
9915 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9916 targetm
.atomic_align_for_mode (SImode
));
9917 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9918 targetm
.atomic_align_for_mode (DImode
));
9919 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9920 targetm
.atomic_align_for_mode (TImode
));
9922 access_public_node
= get_identifier ("public");
9923 access_protected_node
= get_identifier ("protected");
9924 access_private_node
= get_identifier ("private");
9926 /* Define these next since types below may used them. */
9927 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9928 integer_one_node
= build_int_cst (integer_type_node
, 1);
9929 integer_three_node
= build_int_cst (integer_type_node
, 3);
9930 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9932 size_zero_node
= size_int (0);
9933 size_one_node
= size_int (1);
9934 bitsize_zero_node
= bitsize_int (0);
9935 bitsize_one_node
= bitsize_int (1);
9936 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9938 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9939 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9941 void_type_node
= make_node (VOID_TYPE
);
9942 layout_type (void_type_node
);
9944 /* We are not going to have real types in C with less than byte alignment,
9945 so we might as well not have any types that claim to have it. */
9946 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9947 TYPE_USER_ALIGN (void_type_node
) = 0;
9949 void_node
= make_node (VOID_CST
);
9950 TREE_TYPE (void_node
) = void_type_node
;
9952 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9953 layout_type (TREE_TYPE (null_pointer_node
));
9955 ptr_type_node
= build_pointer_type (void_type_node
);
9957 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9958 for (unsigned i
= 0;
9959 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9961 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9963 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9965 float_type_node
= make_node (REAL_TYPE
);
9966 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9967 layout_type (float_type_node
);
9969 double_type_node
= make_node (REAL_TYPE
);
9970 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9971 layout_type (double_type_node
);
9973 long_double_type_node
= make_node (REAL_TYPE
);
9974 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9975 layout_type (long_double_type_node
);
9977 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9979 int n
= floatn_nx_types
[i
].n
;
9980 bool extended
= floatn_nx_types
[i
].extended
;
9981 scalar_float_mode mode
;
9982 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9984 int precision
= GET_MODE_PRECISION (mode
);
9985 /* Work around the rs6000 KFmode having precision 113 not
9987 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9988 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9989 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9991 gcc_assert (min_precision
== n
);
9992 if (precision
< min_precision
)
9993 precision
= min_precision
;
9994 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9995 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9996 layout_type (FLOATN_NX_TYPE_NODE (i
));
9997 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10000 float_ptr_type_node
= build_pointer_type (float_type_node
);
10001 double_ptr_type_node
= build_pointer_type (double_type_node
);
10002 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10003 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10005 /* Fixed size integer types. */
10006 uint16_type_node
= make_or_reuse_type (16, 1);
10007 uint32_type_node
= make_or_reuse_type (32, 1);
10008 uint64_type_node
= make_or_reuse_type (64, 1);
10010 /* Decimal float types. */
10011 dfloat32_type_node
= make_node (REAL_TYPE
);
10012 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10013 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10014 layout_type (dfloat32_type_node
);
10015 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10017 dfloat64_type_node
= make_node (REAL_TYPE
);
10018 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10019 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10020 layout_type (dfloat64_type_node
);
10021 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10023 dfloat128_type_node
= make_node (REAL_TYPE
);
10024 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10025 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10026 layout_type (dfloat128_type_node
);
10027 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10029 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10030 complex_float_type_node
= build_complex_type (float_type_node
, true);
10031 complex_double_type_node
= build_complex_type (double_type_node
, true);
10032 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10035 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10037 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10038 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10039 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10042 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10043 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10044 sat_ ## KIND ## _type_node = \
10045 make_sat_signed_ ## KIND ## _type (SIZE); \
10046 sat_unsigned_ ## KIND ## _type_node = \
10047 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10048 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10049 unsigned_ ## KIND ## _type_node = \
10050 make_unsigned_ ## KIND ## _type (SIZE);
10052 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10053 sat_ ## WIDTH ## KIND ## _type_node = \
10054 make_sat_signed_ ## KIND ## _type (SIZE); \
10055 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10056 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10057 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10058 unsigned_ ## WIDTH ## KIND ## _type_node = \
10059 make_unsigned_ ## KIND ## _type (SIZE);
10061 /* Make fixed-point type nodes based on four different widths. */
10062 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10063 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10064 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10065 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10066 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10068 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10069 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10070 NAME ## _type_node = \
10071 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10072 u ## NAME ## _type_node = \
10073 make_or_reuse_unsigned_ ## KIND ## _type \
10074 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10075 sat_ ## NAME ## _type_node = \
10076 make_or_reuse_sat_signed_ ## KIND ## _type \
10077 (GET_MODE_BITSIZE (MODE ## mode)); \
10078 sat_u ## NAME ## _type_node = \
10079 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10080 (GET_MODE_BITSIZE (U ## MODE ## mode));
10082 /* Fixed-point type and mode nodes. */
10083 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10084 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10085 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10086 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10087 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10088 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10089 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10090 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10091 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10092 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10093 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10096 tree t
= targetm
.build_builtin_va_list ();
10098 /* Many back-ends define record types without setting TYPE_NAME.
10099 If we copied the record type here, we'd keep the original
10100 record type without a name. This breaks name mangling. So,
10101 don't copy record types and let c_common_nodes_and_builtins()
10102 declare the type to be __builtin_va_list. */
10103 if (TREE_CODE (t
) != RECORD_TYPE
)
10104 t
= build_variant_type_copy (t
);
10106 va_list_type_node
= t
;
10110 /* Modify DECL for given flags.
10111 TM_PURE attribute is set only on types, so the function will modify
10112 DECL's type when ECF_TM_PURE is used. */
10115 set_call_expr_flags (tree decl
, int flags
)
10117 if (flags
& ECF_NOTHROW
)
10118 TREE_NOTHROW (decl
) = 1;
10119 if (flags
& ECF_CONST
)
10120 TREE_READONLY (decl
) = 1;
10121 if (flags
& ECF_PURE
)
10122 DECL_PURE_P (decl
) = 1;
10123 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10124 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10125 if (flags
& ECF_NOVOPS
)
10126 DECL_IS_NOVOPS (decl
) = 1;
10127 if (flags
& ECF_NORETURN
)
10128 TREE_THIS_VOLATILE (decl
) = 1;
10129 if (flags
& ECF_MALLOC
)
10130 DECL_IS_MALLOC (decl
) = 1;
10131 if (flags
& ECF_RETURNS_TWICE
)
10132 DECL_IS_RETURNS_TWICE (decl
) = 1;
10133 if (flags
& ECF_LEAF
)
10134 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10135 NULL
, DECL_ATTRIBUTES (decl
));
10136 if (flags
& ECF_COLD
)
10137 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10138 NULL
, DECL_ATTRIBUTES (decl
));
10139 if (flags
& ECF_RET1
)
10140 DECL_ATTRIBUTES (decl
)
10141 = tree_cons (get_identifier ("fn spec"),
10142 build_tree_list (NULL_TREE
, build_string (1, "1")),
10143 DECL_ATTRIBUTES (decl
));
10144 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10145 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10146 /* Looping const or pure is implied by noreturn.
10147 There is currently no way to declare looping const or looping pure alone. */
10148 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10149 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10153 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10156 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10157 const char *library_name
, int ecf_flags
)
10161 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10162 library_name
, NULL_TREE
);
10163 set_call_expr_flags (decl
, ecf_flags
);
10165 set_builtin_decl (code
, decl
, true);
10168 /* Call this function after instantiating all builtins that the language
10169 front end cares about. This will build the rest of the builtins
10170 and internal functions that are relied upon by the tree optimizers and
10174 build_common_builtin_nodes (void)
10179 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10180 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10182 ftype
= build_function_type (void_type_node
, void_list_node
);
10183 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10184 local_define_builtin ("__builtin_unreachable", ftype
,
10185 BUILT_IN_UNREACHABLE
,
10186 "__builtin_unreachable",
10187 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10188 | ECF_CONST
| ECF_COLD
);
10189 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10190 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10192 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10195 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10196 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10198 ftype
= build_function_type_list (ptr_type_node
,
10199 ptr_type_node
, const_ptr_type_node
,
10200 size_type_node
, NULL_TREE
);
10202 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10203 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10204 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10205 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10206 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10207 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10210 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10212 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10213 const_ptr_type_node
, size_type_node
,
10215 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10216 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10219 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10221 ftype
= build_function_type_list (ptr_type_node
,
10222 ptr_type_node
, integer_type_node
,
10223 size_type_node
, NULL_TREE
);
10224 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10225 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10228 /* If we're checking the stack, `alloca' can throw. */
10229 const int alloca_flags
10230 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10232 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10234 ftype
= build_function_type_list (ptr_type_node
,
10235 size_type_node
, NULL_TREE
);
10236 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10237 "alloca", alloca_flags
);
10240 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10241 size_type_node
, NULL_TREE
);
10242 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10243 BUILT_IN_ALLOCA_WITH_ALIGN
,
10244 "__builtin_alloca_with_align",
10247 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10248 size_type_node
, size_type_node
, NULL_TREE
);
10249 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10250 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10251 "__builtin_alloca_with_align_and_max",
10254 ftype
= build_function_type_list (void_type_node
,
10255 ptr_type_node
, ptr_type_node
,
10256 ptr_type_node
, NULL_TREE
);
10257 local_define_builtin ("__builtin_init_trampoline", ftype
,
10258 BUILT_IN_INIT_TRAMPOLINE
,
10259 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10260 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10261 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10262 "__builtin_init_heap_trampoline",
10263 ECF_NOTHROW
| ECF_LEAF
);
10264 local_define_builtin ("__builtin_init_descriptor", ftype
,
10265 BUILT_IN_INIT_DESCRIPTOR
,
10266 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10268 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10269 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10270 BUILT_IN_ADJUST_TRAMPOLINE
,
10271 "__builtin_adjust_trampoline",
10272 ECF_CONST
| ECF_NOTHROW
);
10273 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10274 BUILT_IN_ADJUST_DESCRIPTOR
,
10275 "__builtin_adjust_descriptor",
10276 ECF_CONST
| ECF_NOTHROW
);
10278 ftype
= build_function_type_list (void_type_node
,
10279 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10280 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10281 BUILT_IN_NONLOCAL_GOTO
,
10282 "__builtin_nonlocal_goto",
10283 ECF_NORETURN
| ECF_NOTHROW
);
10285 ftype
= build_function_type_list (void_type_node
,
10286 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10287 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10288 BUILT_IN_SETJMP_SETUP
,
10289 "__builtin_setjmp_setup", ECF_NOTHROW
);
10291 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10292 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10293 BUILT_IN_SETJMP_RECEIVER
,
10294 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10296 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10297 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10298 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10300 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10301 local_define_builtin ("__builtin_stack_restore", ftype
,
10302 BUILT_IN_STACK_RESTORE
,
10303 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10305 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10306 const_ptr_type_node
, size_type_node
,
10308 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10309 "__builtin_memcmp_eq",
10310 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10312 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10313 "__builtin_strncmp_eq",
10314 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10316 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10317 "__builtin_strcmp_eq",
10318 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10320 /* If there's a possibility that we might use the ARM EABI, build the
10321 alternate __cxa_end_cleanup node used to resume from C++. */
10322 if (targetm
.arm_eabi_unwinder
)
10324 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10325 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10326 BUILT_IN_CXA_END_CLEANUP
,
10327 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10330 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10331 local_define_builtin ("__builtin_unwind_resume", ftype
,
10332 BUILT_IN_UNWIND_RESUME
,
10333 ((targetm_common
.except_unwind_info (&global_options
)
10335 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10338 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10340 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10342 local_define_builtin ("__builtin_return_address", ftype
,
10343 BUILT_IN_RETURN_ADDRESS
,
10344 "__builtin_return_address",
10348 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10349 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10351 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10352 ptr_type_node
, NULL_TREE
);
10353 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10354 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10355 BUILT_IN_PROFILE_FUNC_ENTER
,
10356 "__cyg_profile_func_enter", 0);
10357 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10358 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10359 BUILT_IN_PROFILE_FUNC_EXIT
,
10360 "__cyg_profile_func_exit", 0);
10363 /* The exception object and filter values from the runtime. The argument
10364 must be zero before exception lowering, i.e. from the front end. After
10365 exception lowering, it will be the region number for the exception
10366 landing pad. These functions are PURE instead of CONST to prevent
10367 them from being hoisted past the exception edge that will initialize
10368 its value in the landing pad. */
10369 ftype
= build_function_type_list (ptr_type_node
,
10370 integer_type_node
, NULL_TREE
);
10371 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10372 /* Only use TM_PURE if we have TM language support. */
10373 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10374 ecf_flags
|= ECF_TM_PURE
;
10375 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10376 "__builtin_eh_pointer", ecf_flags
);
10378 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10379 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10380 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10381 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10383 ftype
= build_function_type_list (void_type_node
,
10384 integer_type_node
, integer_type_node
,
10386 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10387 BUILT_IN_EH_COPY_VALUES
,
10388 "__builtin_eh_copy_values", ECF_NOTHROW
);
10390 /* Complex multiplication and division. These are handled as builtins
10391 rather than optabs because emit_library_call_value doesn't support
10392 complex. Further, we can do slightly better with folding these
10393 beasties if the real and complex parts of the arguments are separate. */
10397 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10399 char mode_name_buf
[4], *q
;
10401 enum built_in_function mcode
, dcode
;
10402 tree type
, inner_type
;
10403 const char *prefix
= "__";
10405 if (targetm
.libfunc_gnu_prefix
)
10408 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10411 inner_type
= TREE_TYPE (type
);
10413 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10414 inner_type
, inner_type
, NULL_TREE
);
10416 mcode
= ((enum built_in_function
)
10417 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10418 dcode
= ((enum built_in_function
)
10419 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10421 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10425 /* For -ftrapping-math these should throw from a former
10426 -fnon-call-exception stmt. */
10427 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10429 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10430 built_in_names
[mcode
],
10431 ECF_CONST
| ECF_LEAF
);
10433 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10435 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10436 built_in_names
[dcode
],
10437 ECF_CONST
| ECF_LEAF
);
10441 init_internal_fns ();
10444 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10447 If we requested a pointer to a vector, build up the pointers that
10448 we stripped off while looking for the inner type. Similarly for
10449 return values from functions.
10451 The argument TYPE is the top of the chain, and BOTTOM is the
10452 new type which we will point to. */
10455 reconstruct_complex_type (tree type
, tree bottom
)
10459 if (TREE_CODE (type
) == POINTER_TYPE
)
10461 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10462 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10463 TYPE_REF_CAN_ALIAS_ALL (type
));
10465 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10467 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10468 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10469 TYPE_REF_CAN_ALIAS_ALL (type
));
10471 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10473 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10474 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10476 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10478 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10479 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10481 else if (TREE_CODE (type
) == METHOD_TYPE
)
10483 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10484 /* The build_method_type_directly() routine prepends 'this' to argument list,
10485 so we must compensate by getting rid of it. */
10487 = build_method_type_directly
10488 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10490 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10492 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10494 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10495 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10500 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10501 TYPE_QUALS (type
));
10504 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10507 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10510 unsigned int bitsize
;
10512 switch (GET_MODE_CLASS (mode
))
10514 case MODE_VECTOR_BOOL
:
10515 case MODE_VECTOR_INT
:
10516 case MODE_VECTOR_FLOAT
:
10517 case MODE_VECTOR_FRACT
:
10518 case MODE_VECTOR_UFRACT
:
10519 case MODE_VECTOR_ACCUM
:
10520 case MODE_VECTOR_UACCUM
:
10521 nunits
= GET_MODE_NUNITS (mode
);
10525 /* Check that there are no leftover bits. */
10526 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10527 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10528 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10532 gcc_unreachable ();
10535 return make_vector_type (innertype
, nunits
, mode
);
10538 /* Similarly, but takes the inner type and number of units, which must be
10542 build_vector_type (tree innertype
, poly_int64 nunits
)
10544 return make_vector_type (innertype
, nunits
, VOIDmode
);
10547 /* Build truth vector with specified length and number of units. */
10550 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
10552 machine_mode mask_mode
10553 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10556 if (mask_mode
== BLKmode
)
10557 vsize
= vector_size
* BITS_PER_UNIT
;
10559 vsize
= GET_MODE_BITSIZE (mask_mode
);
10561 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10563 tree bool_type
= build_nonstandard_boolean_type (esize
);
10565 return make_vector_type (bool_type
, nunits
, mask_mode
);
10568 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10571 build_same_sized_truth_vector_type (tree vectype
)
10573 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10576 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10578 if (known_eq (size
, 0U))
10579 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10581 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10584 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10587 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10589 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10591 /* We always build the non-opaque variant before the opaque one,
10592 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10593 cand
= TYPE_NEXT_VARIANT (t
);
10595 && TYPE_VECTOR_OPAQUE (cand
)
10596 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10598 /* Othewise build a variant type and make sure to queue it after
10599 the non-opaque type. */
10600 cand
= build_distinct_type_copy (t
);
10601 TYPE_VECTOR_OPAQUE (cand
) = true;
10602 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10603 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10604 TYPE_NEXT_VARIANT (t
) = cand
;
10605 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10609 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10612 vector_cst_int_elt (const_tree t
, unsigned int i
)
10614 /* First handle elements that are directly encoded. */
10615 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10616 if (i
< encoded_nelts
)
10617 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10619 /* Identify the pattern that contains element I and work out the index of
10620 the last encoded element for that pattern. */
10621 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10622 unsigned int pattern
= i
% npatterns
;
10623 unsigned int count
= i
/ npatterns
;
10624 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10626 /* If there are no steps, the final encoded value is the right one. */
10627 if (!VECTOR_CST_STEPPED_P (t
))
10628 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10630 /* Otherwise work out the value from the last two encoded elements. */
10631 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10632 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10633 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10634 return wi::to_wide (v2
) + (count
- 2) * diff
;
10637 /* Return the value of element I of VECTOR_CST T. */
10640 vector_cst_elt (const_tree t
, unsigned int i
)
10642 /* First handle elements that are directly encoded. */
10643 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10644 if (i
< encoded_nelts
)
10645 return VECTOR_CST_ENCODED_ELT (t
, i
);
10647 /* If there are no steps, the final encoded value is the right one. */
10648 if (!VECTOR_CST_STEPPED_P (t
))
10650 /* Identify the pattern that contains element I and work out the index of
10651 the last encoded element for that pattern. */
10652 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10653 unsigned int pattern
= i
% npatterns
;
10654 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10655 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10658 /* Otherwise work out the value from the last two encoded elements. */
10659 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10660 vector_cst_int_elt (t
, i
));
10663 /* Given an initializer INIT, return TRUE if INIT is zero or some
10664 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10665 null, set *NONZERO if and only if INIT is known not to be all
10666 zeros. The combination of return value of false and *NONZERO
10667 false implies that INIT may but need not be all zeros. Other
10668 combinations indicate definitive answers. */
10671 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
10677 /* Conservatively clear NONZERO and set it only if INIT is definitely
10683 unsigned HOST_WIDE_INT off
= 0;
10685 switch (TREE_CODE (init
))
10688 if (integer_zerop (init
))
10695 /* ??? Note that this is not correct for C4X float formats. There,
10696 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10697 negative exponent. */
10698 if (real_zerop (init
)
10699 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
10706 if (fixed_zerop (init
))
10713 if (integer_zerop (init
)
10714 || (real_zerop (init
)
10715 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10716 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
10723 if (VECTOR_CST_NPATTERNS (init
) == 1
10724 && VECTOR_CST_DUPLICATE_P (init
)
10725 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
10733 if (TREE_CLOBBER_P (init
))
10736 unsigned HOST_WIDE_INT idx
;
10739 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10740 if (!initializer_zerop (elt
, nonzero
))
10748 tree arg
= TREE_OPERAND (init
, 0);
10749 if (TREE_CODE (arg
) != ADDR_EXPR
)
10751 tree offset
= TREE_OPERAND (init
, 1);
10752 if (TREE_CODE (offset
) != INTEGER_CST
10753 || !tree_fits_uhwi_p (offset
))
10755 off
= tree_to_uhwi (offset
);
10758 arg
= TREE_OPERAND (arg
, 0);
10759 if (TREE_CODE (arg
) != STRING_CST
)
10763 /* Fall through. */
10767 gcc_assert (off
<= INT_MAX
);
10770 int n
= TREE_STRING_LENGTH (init
);
10774 /* We need to loop through all elements to handle cases like
10775 "\0" and "\0foobar". */
10776 for (i
= 0; i
< n
; ++i
)
10777 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10791 /* Check if vector VEC consists of all the equal elements and
10792 that the number of elements corresponds to the type of VEC.
10793 The function returns first element of the vector
10794 or NULL_TREE if the vector is not uniform. */
10796 uniform_vector_p (const_tree vec
)
10799 unsigned HOST_WIDE_INT i
, nelts
;
10801 if (vec
== NULL_TREE
)
10804 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10806 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
10807 return TREE_OPERAND (vec
, 0);
10809 else if (TREE_CODE (vec
) == VECTOR_CST
)
10811 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
10812 return VECTOR_CST_ENCODED_ELT (vec
, 0);
10816 else if (TREE_CODE (vec
) == CONSTRUCTOR
10817 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
10819 first
= error_mark_node
;
10821 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10828 if (!operand_equal_p (first
, t
, 0))
10840 /* Build an empty statement at location LOC. */
10843 build_empty_stmt (location_t loc
)
10845 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10846 SET_EXPR_LOCATION (t
, loc
);
10851 /* Build an OpenMP clause with code CODE. LOC is the location of the
10855 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10860 length
= omp_clause_num_ops
[code
];
10861 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10863 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10865 t
= (tree
) ggc_internal_alloc (size
);
10866 memset (t
, 0, size
);
10867 TREE_SET_CODE (t
, OMP_CLAUSE
);
10868 OMP_CLAUSE_SET_CODE (t
, code
);
10869 OMP_CLAUSE_LOCATION (t
) = loc
;
10874 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10875 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10876 Except for the CODE and operand count field, other storage for the
10877 object is initialized to zeros. */
10880 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10883 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10885 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10886 gcc_assert (len
>= 1);
10888 record_node_allocation_statistics (code
, length
);
10890 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10892 TREE_SET_CODE (t
, code
);
10894 /* Can't use TREE_OPERAND to store the length because if checking is
10895 enabled, it will try to check the length before we store it. :-P */
10896 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10901 /* Helper function for build_call_* functions; build a CALL_EXPR with
10902 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10903 the argument slots. */
10906 build_call_1 (tree return_type
, tree fn
, int nargs
)
10910 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10911 TREE_TYPE (t
) = return_type
;
10912 CALL_EXPR_FN (t
) = fn
;
10913 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10918 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10919 FN and a null static chain slot. NARGS is the number of call arguments
10920 which are specified as "..." arguments. */
10923 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10927 va_start (args
, nargs
);
10928 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10933 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10934 FN and a null static chain slot. NARGS is the number of call arguments
10935 which are specified as a va_list ARGS. */
10938 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10943 t
= build_call_1 (return_type
, fn
, nargs
);
10944 for (i
= 0; i
< nargs
; i
++)
10945 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10946 process_call_operands (t
);
10950 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10951 FN and a null static chain slot. NARGS is the number of call arguments
10952 which are specified as a tree array ARGS. */
10955 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10956 int nargs
, const tree
*args
)
10961 t
= build_call_1 (return_type
, fn
, nargs
);
10962 for (i
= 0; i
< nargs
; i
++)
10963 CALL_EXPR_ARG (t
, i
) = args
[i
];
10964 process_call_operands (t
);
10965 SET_EXPR_LOCATION (t
, loc
);
10969 /* Like build_call_array, but takes a vec. */
10972 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10977 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10978 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10979 CALL_EXPR_ARG (ret
, ix
) = t
;
10980 process_call_operands (ret
);
10984 /* Conveniently construct a function call expression. FNDECL names the
10985 function to be called and N arguments are passed in the array
10989 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10991 tree fntype
= TREE_TYPE (fndecl
);
10992 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10994 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10997 /* Conveniently construct a function call expression. FNDECL names the
10998 function to be called and the arguments are passed in the vector
11002 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11004 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11005 vec_safe_address (vec
));
11009 /* Conveniently construct a function call expression. FNDECL names the
11010 function to be called, N is the number of arguments, and the "..."
11011 parameters are the argument expressions. */
11014 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11017 tree
*argarray
= XALLOCAVEC (tree
, n
);
11021 for (i
= 0; i
< n
; i
++)
11022 argarray
[i
] = va_arg (ap
, tree
);
11024 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11027 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11028 varargs macros aren't supported by all bootstrap compilers. */
11031 build_call_expr (tree fndecl
, int n
, ...)
11034 tree
*argarray
= XALLOCAVEC (tree
, n
);
11038 for (i
= 0; i
< n
; i
++)
11039 argarray
[i
] = va_arg (ap
, tree
);
11041 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11044 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11045 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11046 It will get gimplified later into an ordinary internal function. */
11049 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11050 tree type
, int n
, const tree
*args
)
11052 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11053 for (int i
= 0; i
< n
; ++i
)
11054 CALL_EXPR_ARG (t
, i
) = args
[i
];
11055 SET_EXPR_LOCATION (t
, loc
);
11056 CALL_EXPR_IFN (t
) = ifn
;
11060 /* Build internal call expression. This is just like CALL_EXPR, except
11061 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11062 internal function. */
11065 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11066 tree type
, int n
, ...)
11069 tree
*argarray
= XALLOCAVEC (tree
, n
);
11073 for (i
= 0; i
< n
; i
++)
11074 argarray
[i
] = va_arg (ap
, tree
);
11076 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11079 /* Return a function call to FN, if the target is guaranteed to support it,
11082 N is the number of arguments, passed in the "...", and TYPE is the
11083 type of the return value. */
11086 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11090 tree
*argarray
= XALLOCAVEC (tree
, n
);
11094 for (i
= 0; i
< n
; i
++)
11095 argarray
[i
] = va_arg (ap
, tree
);
11097 if (internal_fn_p (fn
))
11099 internal_fn ifn
= as_internal_fn (fn
);
11100 if (direct_internal_fn_p (ifn
))
11102 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11103 if (!direct_internal_fn_supported_p (ifn
, types
,
11104 OPTIMIZE_FOR_BOTH
))
11107 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11111 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11114 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11118 /* Return a function call to the appropriate builtin alloca variant.
11120 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11121 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11122 bound for SIZE in case it is not a fixed value. */
11125 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11129 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11131 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11133 else if (align
> 0)
11135 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11136 return build_call_expr (t
, 2, size
, size_int (align
));
11140 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11141 return build_call_expr (t
, 1, size
);
11145 /* Create a new constant string literal and return a char* pointer to it.
11146 The STRING_CST value is the LEN characters at STR. */
11148 build_string_literal (int len
, const char *str
)
11150 tree t
, elem
, index
, type
;
11152 t
= build_string (len
, str
);
11153 elem
= build_type_variant (char_type_node
, 1, 0);
11154 index
= build_index_type (size_int (len
- 1));
11155 type
= build_array_type (elem
, index
);
11156 TREE_TYPE (t
) = type
;
11157 TREE_CONSTANT (t
) = 1;
11158 TREE_READONLY (t
) = 1;
11159 TREE_STATIC (t
) = 1;
11161 type
= build_pointer_type (elem
);
11162 t
= build1 (ADDR_EXPR
, type
,
11163 build4 (ARRAY_REF
, elem
,
11164 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11170 /* Return true if T (assumed to be a DECL) must be assigned a memory
11174 needs_to_live_in_memory (const_tree t
)
11176 return (TREE_ADDRESSABLE (t
)
11177 || is_global_var (t
)
11178 || (TREE_CODE (t
) == RESULT_DECL
11179 && !DECL_BY_REFERENCE (t
)
11180 && aggregate_value_p (t
, current_function_decl
)));
11183 /* Return value of a constant X and sign-extend it. */
11186 int_cst_value (const_tree x
)
11188 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11189 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11191 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11192 gcc_assert (cst_and_fits_in_hwi (x
));
11194 if (bits
< HOST_BITS_PER_WIDE_INT
)
11196 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11198 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11200 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11206 /* If TYPE is an integral or pointer type, return an integer type with
11207 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11208 if TYPE is already an integer type of signedness UNSIGNEDP. */
11211 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11213 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11216 if (TREE_CODE (type
) == VECTOR_TYPE
)
11218 tree inner
= TREE_TYPE (type
);
11219 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11222 if (inner
== inner2
)
11224 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11227 if (!INTEGRAL_TYPE_P (type
)
11228 && !POINTER_TYPE_P (type
)
11229 && TREE_CODE (type
) != OFFSET_TYPE
)
11232 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11235 /* If TYPE is an integral or pointer type, return an integer type with
11236 the same precision which is unsigned, or itself if TYPE is already an
11237 unsigned integer type. */
11240 unsigned_type_for (tree type
)
11242 return signed_or_unsigned_type_for (1, type
);
11245 /* If TYPE is an integral or pointer type, return an integer type with
11246 the same precision which is signed, or itself if TYPE is already a
11247 signed integer type. */
11250 signed_type_for (tree type
)
11252 return signed_or_unsigned_type_for (0, type
);
11255 /* If TYPE is a vector type, return a signed integer vector type with the
11256 same width and number of subparts. Otherwise return boolean_type_node. */
11259 truth_type_for (tree type
)
11261 if (TREE_CODE (type
) == VECTOR_TYPE
)
11263 if (VECTOR_BOOLEAN_TYPE_P (type
))
11265 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11266 GET_MODE_SIZE (TYPE_MODE (type
)));
11269 return boolean_type_node
;
11272 /* Returns the largest value obtainable by casting something in INNER type to
11276 upper_bound_in_type (tree outer
, tree inner
)
11278 unsigned int det
= 0;
11279 unsigned oprec
= TYPE_PRECISION (outer
);
11280 unsigned iprec
= TYPE_PRECISION (inner
);
11283 /* Compute a unique number for every combination. */
11284 det
|= (oprec
> iprec
) ? 4 : 0;
11285 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11286 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11288 /* Determine the exponent to use. */
11293 /* oprec <= iprec, outer: signed, inner: don't care. */
11298 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11302 /* oprec > iprec, outer: signed, inner: signed. */
11306 /* oprec > iprec, outer: signed, inner: unsigned. */
11310 /* oprec > iprec, outer: unsigned, inner: signed. */
11314 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11318 gcc_unreachable ();
11321 return wide_int_to_tree (outer
,
11322 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11325 /* Returns the smallest value obtainable by casting something in INNER type to
11329 lower_bound_in_type (tree outer
, tree inner
)
11331 unsigned oprec
= TYPE_PRECISION (outer
);
11332 unsigned iprec
= TYPE_PRECISION (inner
);
11334 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11336 if (TYPE_UNSIGNED (outer
)
11337 /* If we are widening something of an unsigned type, OUTER type
11338 contains all values of INNER type. In particular, both INNER
11339 and OUTER types have zero in common. */
11340 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11341 return build_int_cst (outer
, 0);
11344 /* If we are widening a signed type to another signed type, we
11345 want to obtain -2^^(iprec-1). If we are keeping the
11346 precision or narrowing to a signed type, we want to obtain
11348 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11349 return wide_int_to_tree (outer
,
11350 wi::mask (prec
- 1, true,
11351 TYPE_PRECISION (outer
)));
11355 /* Return nonzero if two operands that are suitable for PHI nodes are
11356 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11357 SSA_NAME or invariant. Note that this is strictly an optimization.
11358 That is, callers of this function can directly call operand_equal_p
11359 and get the same result, only slower. */
11362 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11366 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11368 return operand_equal_p (arg0
, arg1
, 0);
11371 /* Returns number of zeros at the end of binary representation of X. */
11374 num_ending_zeros (const_tree x
)
11376 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11380 #define WALK_SUBTREE(NODE) \
11383 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11389 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11390 be walked whenever a type is seen in the tree. Rest of operands and return
11391 value are as for walk_tree. */
11394 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11395 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11397 tree result
= NULL_TREE
;
11399 switch (TREE_CODE (type
))
11402 case REFERENCE_TYPE
:
11404 /* We have to worry about mutually recursive pointers. These can't
11405 be written in C. They can in Ada. It's pathological, but
11406 there's an ACATS test (c38102a) that checks it. Deal with this
11407 by checking if we're pointing to another pointer, that one
11408 points to another pointer, that one does too, and we have no htab.
11409 If so, get a hash table. We check three levels deep to avoid
11410 the cost of the hash table if we don't need one. */
11411 if (POINTER_TYPE_P (TREE_TYPE (type
))
11412 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11413 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11416 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11427 WALK_SUBTREE (TREE_TYPE (type
));
11431 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11433 /* Fall through. */
11435 case FUNCTION_TYPE
:
11436 WALK_SUBTREE (TREE_TYPE (type
));
11440 /* We never want to walk into default arguments. */
11441 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11442 WALK_SUBTREE (TREE_VALUE (arg
));
11447 /* Don't follow this nodes's type if a pointer for fear that
11448 we'll have infinite recursion. If we have a PSET, then we
11451 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11452 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11453 WALK_SUBTREE (TREE_TYPE (type
));
11454 WALK_SUBTREE (TYPE_DOMAIN (type
));
11458 WALK_SUBTREE (TREE_TYPE (type
));
11459 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11469 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11470 called with the DATA and the address of each sub-tree. If FUNC returns a
11471 non-NULL value, the traversal is stopped, and the value returned by FUNC
11472 is returned. If PSET is non-NULL it is used to record the nodes visited,
11473 and to avoid visiting a node more than once. */
11476 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11477 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11479 enum tree_code code
;
11483 #define WALK_SUBTREE_TAIL(NODE) \
11487 goto tail_recurse; \
11492 /* Skip empty subtrees. */
11496 /* Don't walk the same tree twice, if the user has requested
11497 that we avoid doing so. */
11498 if (pset
&& pset
->add (*tp
))
11501 /* Call the function. */
11503 result
= (*func
) (tp
, &walk_subtrees
, data
);
11505 /* If we found something, return it. */
11509 code
= TREE_CODE (*tp
);
11511 /* Even if we didn't, FUNC may have decided that there was nothing
11512 interesting below this point in the tree. */
11513 if (!walk_subtrees
)
11515 /* But we still need to check our siblings. */
11516 if (code
== TREE_LIST
)
11517 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11518 else if (code
== OMP_CLAUSE
)
11519 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11526 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11527 if (result
|| !walk_subtrees
)
11534 case IDENTIFIER_NODE
:
11541 case PLACEHOLDER_EXPR
:
11545 /* None of these have subtrees other than those already walked
11550 WALK_SUBTREE (TREE_VALUE (*tp
));
11551 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11556 int len
= TREE_VEC_LENGTH (*tp
);
11561 /* Walk all elements but the first. */
11563 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11565 /* Now walk the first one as a tail call. */
11566 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11570 WALK_SUBTREE (TREE_REALPART (*tp
));
11571 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11575 unsigned HOST_WIDE_INT idx
;
11576 constructor_elt
*ce
;
11578 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11580 WALK_SUBTREE (ce
->value
);
11585 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11590 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11592 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11593 into declarations that are just mentioned, rather than
11594 declared; they don't really belong to this part of the tree.
11595 And, we can see cycles: the initializer for a declaration
11596 can refer to the declaration itself. */
11597 WALK_SUBTREE (DECL_INITIAL (decl
));
11598 WALK_SUBTREE (DECL_SIZE (decl
));
11599 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11601 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11604 case STATEMENT_LIST
:
11606 tree_stmt_iterator i
;
11607 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11608 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11613 switch (OMP_CLAUSE_CODE (*tp
))
11615 case OMP_CLAUSE_GANG
:
11616 case OMP_CLAUSE__GRIDDIM_
:
11617 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11620 case OMP_CLAUSE_ASYNC
:
11621 case OMP_CLAUSE_WAIT
:
11622 case OMP_CLAUSE_WORKER
:
11623 case OMP_CLAUSE_VECTOR
:
11624 case OMP_CLAUSE_NUM_GANGS
:
11625 case OMP_CLAUSE_NUM_WORKERS
:
11626 case OMP_CLAUSE_VECTOR_LENGTH
:
11627 case OMP_CLAUSE_PRIVATE
:
11628 case OMP_CLAUSE_SHARED
:
11629 case OMP_CLAUSE_FIRSTPRIVATE
:
11630 case OMP_CLAUSE_COPYIN
:
11631 case OMP_CLAUSE_COPYPRIVATE
:
11632 case OMP_CLAUSE_FINAL
:
11633 case OMP_CLAUSE_IF
:
11634 case OMP_CLAUSE_NUM_THREADS
:
11635 case OMP_CLAUSE_SCHEDULE
:
11636 case OMP_CLAUSE_UNIFORM
:
11637 case OMP_CLAUSE_DEPEND
:
11638 case OMP_CLAUSE_NUM_TEAMS
:
11639 case OMP_CLAUSE_THREAD_LIMIT
:
11640 case OMP_CLAUSE_DEVICE
:
11641 case OMP_CLAUSE_DIST_SCHEDULE
:
11642 case OMP_CLAUSE_SAFELEN
:
11643 case OMP_CLAUSE_SIMDLEN
:
11644 case OMP_CLAUSE_ORDERED
:
11645 case OMP_CLAUSE_PRIORITY
:
11646 case OMP_CLAUSE_GRAINSIZE
:
11647 case OMP_CLAUSE_NUM_TASKS
:
11648 case OMP_CLAUSE_HINT
:
11649 case OMP_CLAUSE_TO_DECLARE
:
11650 case OMP_CLAUSE_LINK
:
11651 case OMP_CLAUSE_USE_DEVICE_PTR
:
11652 case OMP_CLAUSE_IS_DEVICE_PTR
:
11653 case OMP_CLAUSE__LOOPTEMP_
:
11654 case OMP_CLAUSE__SIMDUID_
:
11655 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11658 case OMP_CLAUSE_INDEPENDENT
:
11659 case OMP_CLAUSE_NOWAIT
:
11660 case OMP_CLAUSE_DEFAULT
:
11661 case OMP_CLAUSE_UNTIED
:
11662 case OMP_CLAUSE_MERGEABLE
:
11663 case OMP_CLAUSE_PROC_BIND
:
11664 case OMP_CLAUSE_INBRANCH
:
11665 case OMP_CLAUSE_NOTINBRANCH
:
11666 case OMP_CLAUSE_FOR
:
11667 case OMP_CLAUSE_PARALLEL
:
11668 case OMP_CLAUSE_SECTIONS
:
11669 case OMP_CLAUSE_TASKGROUP
:
11670 case OMP_CLAUSE_NOGROUP
:
11671 case OMP_CLAUSE_THREADS
:
11672 case OMP_CLAUSE_SIMD
:
11673 case OMP_CLAUSE_DEFAULTMAP
:
11674 case OMP_CLAUSE_AUTO
:
11675 case OMP_CLAUSE_SEQ
:
11676 case OMP_CLAUSE_TILE
:
11677 case OMP_CLAUSE__SIMT_
:
11678 case OMP_CLAUSE_IF_PRESENT
:
11679 case OMP_CLAUSE_FINALIZE
:
11680 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11682 case OMP_CLAUSE_LASTPRIVATE
:
11683 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11684 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11685 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11687 case OMP_CLAUSE_COLLAPSE
:
11690 for (i
= 0; i
< 3; i
++)
11691 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11692 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11695 case OMP_CLAUSE_LINEAR
:
11696 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11697 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11698 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11699 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11701 case OMP_CLAUSE_ALIGNED
:
11702 case OMP_CLAUSE_FROM
:
11703 case OMP_CLAUSE_TO
:
11704 case OMP_CLAUSE_MAP
:
11705 case OMP_CLAUSE__CACHE_
:
11706 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11707 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11708 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11710 case OMP_CLAUSE_REDUCTION
:
11713 for (i
= 0; i
< 5; i
++)
11714 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11715 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11719 gcc_unreachable ();
11727 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11728 But, we only want to walk once. */
11729 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11730 for (i
= 0; i
< len
; ++i
)
11731 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11732 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11736 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11737 defining. We only want to walk into these fields of a type in this
11738 case and not in the general case of a mere reference to the type.
11740 The criterion is as follows: if the field can be an expression, it
11741 must be walked only here. This should be in keeping with the fields
11742 that are directly gimplified in gimplify_type_sizes in order for the
11743 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11744 variable-sized types.
11746 Note that DECLs get walked as part of processing the BIND_EXPR. */
11747 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11749 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11750 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11753 /* Call the function for the type. See if it returns anything or
11754 doesn't want us to continue. If we are to continue, walk both
11755 the normal fields and those for the declaration case. */
11756 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11757 if (result
|| !walk_subtrees
)
11760 /* But do not walk a pointed-to type since it may itself need to
11761 be walked in the declaration case if it isn't anonymous. */
11762 if (!POINTER_TYPE_P (*type_p
))
11764 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11769 /* If this is a record type, also walk the fields. */
11770 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11774 for (field
= TYPE_FIELDS (*type_p
); field
;
11775 field
= DECL_CHAIN (field
))
11777 /* We'd like to look at the type of the field, but we can
11778 easily get infinite recursion. So assume it's pointed
11779 to elsewhere in the tree. Also, ignore things that
11781 if (TREE_CODE (field
) != FIELD_DECL
)
11784 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11785 WALK_SUBTREE (DECL_SIZE (field
));
11786 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11787 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11788 WALK_SUBTREE (DECL_QUALIFIER (field
));
11792 /* Same for scalar types. */
11793 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11794 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11795 || TREE_CODE (*type_p
) == INTEGER_TYPE
11796 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11797 || TREE_CODE (*type_p
) == REAL_TYPE
)
11799 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11800 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11803 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11804 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11809 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11813 /* Walk over all the sub-trees of this operand. */
11814 len
= TREE_OPERAND_LENGTH (*tp
);
11816 /* Go through the subtrees. We need to do this in forward order so
11817 that the scope of a FOR_EXPR is handled properly. */
11820 for (i
= 0; i
< len
- 1; ++i
)
11821 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11822 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11825 /* If this is a type, walk the needed fields in the type. */
11826 else if (TYPE_P (*tp
))
11827 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11831 /* We didn't find what we were looking for. */
11834 #undef WALK_SUBTREE_TAIL
11836 #undef WALK_SUBTREE
11838 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11841 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11846 hash_set
<tree
> pset
;
11847 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11853 tree_block (tree t
)
11855 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11857 if (IS_EXPR_CODE_CLASS (c
))
11858 return LOCATION_BLOCK (t
->exp
.locus
);
11859 gcc_unreachable ();
11864 tree_set_block (tree t
, tree b
)
11866 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11868 if (IS_EXPR_CODE_CLASS (c
))
11870 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11873 gcc_unreachable ();
11876 /* Create a nameless artificial label and put it in the current
11877 function context. The label has a location of LOC. Returns the
11878 newly created label. */
11881 create_artificial_label (location_t loc
)
11883 tree lab
= build_decl (loc
,
11884 LABEL_DECL
, NULL_TREE
, void_type_node
);
11886 DECL_ARTIFICIAL (lab
) = 1;
11887 DECL_IGNORED_P (lab
) = 1;
11888 DECL_CONTEXT (lab
) = current_function_decl
;
11892 /* Given a tree, try to return a useful variable name that we can use
11893 to prefix a temporary that is being assigned the value of the tree.
11894 I.E. given <temp> = &A, return A. */
11899 tree stripped_decl
;
11902 STRIP_NOPS (stripped_decl
);
11903 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11904 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11905 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11907 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11910 return IDENTIFIER_POINTER (name
);
11914 switch (TREE_CODE (stripped_decl
))
11917 return get_name (TREE_OPERAND (stripped_decl
, 0));
11924 /* Return true if TYPE has a variable argument list. */
11927 stdarg_p (const_tree fntype
)
11929 function_args_iterator args_iter
;
11930 tree n
= NULL_TREE
, t
;
11935 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11940 return n
!= NULL_TREE
&& n
!= void_type_node
;
11943 /* Return true if TYPE has a prototype. */
11946 prototype_p (const_tree fntype
)
11950 gcc_assert (fntype
!= NULL_TREE
);
11952 t
= TYPE_ARG_TYPES (fntype
);
11953 return (t
!= NULL_TREE
);
11956 /* If BLOCK is inlined from an __attribute__((__artificial__))
11957 routine, return pointer to location from where it has been
11960 block_nonartificial_location (tree block
)
11962 location_t
*ret
= NULL
;
11964 while (block
&& TREE_CODE (block
) == BLOCK
11965 && BLOCK_ABSTRACT_ORIGIN (block
))
11967 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11969 while (TREE_CODE (ao
) == BLOCK
11970 && BLOCK_ABSTRACT_ORIGIN (ao
)
11971 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11972 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11974 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11976 /* If AO is an artificial inline, point RET to the
11977 call site locus at which it has been inlined and continue
11978 the loop, in case AO's caller is also an artificial
11980 if (DECL_DECLARED_INLINE_P (ao
)
11981 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11982 ret
= &BLOCK_SOURCE_LOCATION (block
);
11986 else if (TREE_CODE (ao
) != BLOCK
)
11989 block
= BLOCK_SUPERCONTEXT (block
);
11995 /* If EXP is inlined from an __attribute__((__artificial__))
11996 function, return the location of the original call expression. */
11999 tree_nonartificial_location (tree exp
)
12001 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12006 return EXPR_LOCATION (exp
);
12010 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12013 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12016 cl_option_hasher::hash (tree x
)
12018 const_tree
const t
= x
;
12022 hashval_t hash
= 0;
12024 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12026 p
= (const char *)TREE_OPTIMIZATION (t
);
12027 len
= sizeof (struct cl_optimization
);
12030 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12031 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12034 gcc_unreachable ();
12036 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12038 for (i
= 0; i
< len
; i
++)
12040 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12045 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12046 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12050 cl_option_hasher::equal (tree x
, tree y
)
12052 const_tree
const xt
= x
;
12053 const_tree
const yt
= y
;
12055 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12058 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12059 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12060 TREE_OPTIMIZATION (yt
));
12061 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12062 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12063 TREE_TARGET_OPTION (yt
));
12065 gcc_unreachable ();
12068 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12071 build_optimization_node (struct gcc_options
*opts
)
12075 /* Use the cache of optimization nodes. */
12077 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12080 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12084 /* Insert this one into the hash table. */
12085 t
= cl_optimization_node
;
12088 /* Make a new node for next time round. */
12089 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12095 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12098 build_target_option_node (struct gcc_options
*opts
)
12102 /* Use the cache of optimization nodes. */
12104 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12107 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12111 /* Insert this one into the hash table. */
12112 t
= cl_target_option_node
;
12115 /* Make a new node for next time round. */
12116 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12122 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12123 so that they aren't saved during PCH writing. */
12126 prepare_target_option_nodes_for_pch (void)
12128 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12129 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12130 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12131 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12134 /* Determine the "ultimate origin" of a block. The block may be an inlined
12135 instance of an inlined instance of a block which is local to an inline
12136 function, so we have to trace all of the way back through the origin chain
12137 to find out what sort of node actually served as the original seed for the
12141 block_ultimate_origin (const_tree block
)
12143 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12145 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12146 we're trying to output the abstract instance of this function. */
12147 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12150 if (immediate_origin
== NULL_TREE
)
12155 tree lookahead
= immediate_origin
;
12159 ret_val
= lookahead
;
12160 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12161 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12163 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12165 /* The block's abstract origin chain may not be the *ultimate* origin of
12166 the block. It could lead to a DECL that has an abstract origin set.
12167 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12168 will give us if it has one). Note that DECL's abstract origins are
12169 supposed to be the most distant ancestor (or so decl_ultimate_origin
12170 claims), so we don't need to loop following the DECL origins. */
12171 if (DECL_P (ret_val
))
12172 return DECL_ORIGIN (ret_val
);
12178 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12182 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12184 /* Do not strip casts into or out of differing address spaces. */
12185 if (POINTER_TYPE_P (outer_type
)
12186 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12188 if (!POINTER_TYPE_P (inner_type
)
12189 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12190 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12193 else if (POINTER_TYPE_P (inner_type
)
12194 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12196 /* We already know that outer_type is not a pointer with
12197 a non-generic address space. */
12201 /* Use precision rather then machine mode when we can, which gives
12202 the correct answer even for submode (bit-field) types. */
12203 if ((INTEGRAL_TYPE_P (outer_type
)
12204 || POINTER_TYPE_P (outer_type
)
12205 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12206 && (INTEGRAL_TYPE_P (inner_type
)
12207 || POINTER_TYPE_P (inner_type
)
12208 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12209 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12211 /* Otherwise fall back on comparing machine modes (e.g. for
12212 aggregate types, floats). */
12213 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12216 /* Return true iff conversion in EXP generates no instruction. Mark
12217 it inline so that we fully inline into the stripping functions even
12218 though we have two uses of this function. */
12221 tree_nop_conversion (const_tree exp
)
12223 tree outer_type
, inner_type
;
12225 if (location_wrapper_p (exp
))
12227 if (!CONVERT_EXPR_P (exp
)
12228 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12230 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12233 outer_type
= TREE_TYPE (exp
);
12234 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12239 return tree_nop_conversion_p (outer_type
, inner_type
);
12242 /* Return true iff conversion in EXP generates no instruction. Don't
12243 consider conversions changing the signedness. */
12246 tree_sign_nop_conversion (const_tree exp
)
12248 tree outer_type
, inner_type
;
12250 if (!tree_nop_conversion (exp
))
12253 outer_type
= TREE_TYPE (exp
);
12254 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12256 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12257 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12260 /* Strip conversions from EXP according to tree_nop_conversion and
12261 return the resulting expression. */
12264 tree_strip_nop_conversions (tree exp
)
12266 while (tree_nop_conversion (exp
))
12267 exp
= TREE_OPERAND (exp
, 0);
12271 /* Strip conversions from EXP according to tree_sign_nop_conversion
12272 and return the resulting expression. */
12275 tree_strip_sign_nop_conversions (tree exp
)
12277 while (tree_sign_nop_conversion (exp
))
12278 exp
= TREE_OPERAND (exp
, 0);
12282 /* Avoid any floating point extensions from EXP. */
12284 strip_float_extensions (tree exp
)
12286 tree sub
, expt
, subt
;
12288 /* For floating point constant look up the narrowest type that can hold
12289 it properly and handle it like (type)(narrowest_type)constant.
12290 This way we can optimize for instance a=a*2.0 where "a" is float
12291 but 2.0 is double constant. */
12292 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12294 REAL_VALUE_TYPE orig
;
12297 orig
= TREE_REAL_CST (exp
);
12298 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12299 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12300 type
= float_type_node
;
12301 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12302 > TYPE_PRECISION (double_type_node
)
12303 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12304 type
= double_type_node
;
12306 return build_real_truncate (type
, orig
);
12309 if (!CONVERT_EXPR_P (exp
))
12312 sub
= TREE_OPERAND (exp
, 0);
12313 subt
= TREE_TYPE (sub
);
12314 expt
= TREE_TYPE (exp
);
12316 if (!FLOAT_TYPE_P (subt
))
12319 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12322 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12325 return strip_float_extensions (sub
);
12328 /* Strip out all handled components that produce invariant
12332 strip_invariant_refs (const_tree op
)
12334 while (handled_component_p (op
))
12336 switch (TREE_CODE (op
))
12339 case ARRAY_RANGE_REF
:
12340 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12341 || TREE_OPERAND (op
, 2) != NULL_TREE
12342 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12346 case COMPONENT_REF
:
12347 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12353 op
= TREE_OPERAND (op
, 0);
12359 static GTY(()) tree gcc_eh_personality_decl
;
12361 /* Return the GCC personality function decl. */
12364 lhd_gcc_personality (void)
12366 if (!gcc_eh_personality_decl
)
12367 gcc_eh_personality_decl
= build_personality_function ("gcc");
12368 return gcc_eh_personality_decl
;
12371 /* TARGET is a call target of GIMPLE call statement
12372 (obtained by gimple_call_fn). Return true if it is
12373 OBJ_TYPE_REF representing an virtual call of C++ method.
12374 (As opposed to OBJ_TYPE_REF representing objc calls
12375 through a cast where middle-end devirtualization machinery
12379 virtual_method_call_p (const_tree target
)
12381 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12383 tree t
= TREE_TYPE (target
);
12384 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12386 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12388 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12389 /* If we do not have BINFO associated, it means that type was built
12390 without devirtualization enabled. Do not consider this a virtual
12392 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12397 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12400 obj_type_ref_class (const_tree ref
)
12402 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12403 ref
= TREE_TYPE (ref
);
12404 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12405 ref
= TREE_TYPE (ref
);
12406 /* We look for type THIS points to. ObjC also builds
12407 OBJ_TYPE_REF with non-method calls, Their first parameter
12408 ID however also corresponds to class type. */
12409 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12410 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12411 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12412 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12413 return TREE_TYPE (ref
);
12416 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12419 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12422 tree base_binfo
, b
;
12424 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12425 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12426 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12428 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12433 /* Try to find a base info of BINFO that would have its field decl at offset
12434 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12435 found, return, otherwise return NULL_TREE. */
12438 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12440 tree type
= BINFO_TYPE (binfo
);
12444 HOST_WIDE_INT pos
, size
;
12448 if (types_same_for_odr (type
, expected_type
))
12450 if (maybe_lt (offset
, 0))
12453 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12455 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12458 pos
= int_bit_position (fld
);
12459 size
= tree_to_uhwi (DECL_SIZE (fld
));
12460 if (known_in_range_p (offset
, pos
, size
))
12463 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12466 /* Offset 0 indicates the primary base, whose vtable contents are
12467 represented in the binfo for the derived class. */
12468 else if (maybe_ne (offset
, 0))
12470 tree found_binfo
= NULL
, base_binfo
;
12471 /* Offsets in BINFO are in bytes relative to the whole structure
12472 while POS is in bits relative to the containing field. */
12473 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12476 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12477 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12478 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12480 found_binfo
= base_binfo
;
12484 binfo
= found_binfo
;
12486 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12490 type
= TREE_TYPE (fld
);
12495 /* Returns true if X is a typedef decl. */
12498 is_typedef_decl (const_tree x
)
12500 return (x
&& TREE_CODE (x
) == TYPE_DECL
12501 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12504 /* Returns true iff TYPE is a type variant created for a typedef. */
12507 typedef_variant_p (const_tree type
)
12509 return is_typedef_decl (TYPE_NAME (type
));
12512 /* A class to handle converting a string that might contain
12513 control characters, (eg newline, form-feed, etc), into one
12514 in which contains escape sequences instead. */
12516 class escaped_string
12519 escaped_string () { m_owned
= false; m_str
= NULL
; };
12520 ~escaped_string () { if (m_owned
) free (m_str
); }
12521 operator const char *() const { return (const char *) m_str
; }
12522 void escape (const char *);
12528 /* PR 84195: Replace control characters in "unescaped" with their
12529 escaped equivalents. Allow newlines if -fmessage-length has
12530 been set to a non-zero value. This is done here, rather than
12531 where the attribute is recorded as the message length can
12532 change between these two locations. */
12535 escaped_string::escape (const char *unescaped
)
12538 size_t i
, new_i
, len
;
12543 m_str
= const_cast<char *> (unescaped
);
12546 if (unescaped
== NULL
|| *unescaped
== 0)
12549 len
= strlen (unescaped
);
12553 for (i
= 0; i
< len
; i
++)
12555 char c
= unescaped
[i
];
12560 escaped
[new_i
++] = c
;
12564 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
12566 if (escaped
== NULL
)
12568 /* We only allocate space for a new string if we
12569 actually encounter a control character that
12570 needs replacing. */
12571 escaped
= (char *) xmalloc (len
* 2 + 1);
12572 strncpy (escaped
, unescaped
, i
);
12576 escaped
[new_i
++] = '\\';
12580 case '\a': escaped
[new_i
++] = 'a'; break;
12581 case '\b': escaped
[new_i
++] = 'b'; break;
12582 case '\f': escaped
[new_i
++] = 'f'; break;
12583 case '\n': escaped
[new_i
++] = 'n'; break;
12584 case '\r': escaped
[new_i
++] = 'r'; break;
12585 case '\t': escaped
[new_i
++] = 't'; break;
12586 case '\v': escaped
[new_i
++] = 'v'; break;
12587 default: escaped
[new_i
++] = '?'; break;
12591 escaped
[new_i
++] = c
;
12596 escaped
[new_i
] = 0;
12602 /* Warn about a use of an identifier which was marked deprecated. Returns
12603 whether a warning was given. */
12606 warn_deprecated_use (tree node
, tree attr
)
12608 escaped_string msg
;
12610 if (node
== 0 || !warn_deprecated_decl
)
12616 attr
= DECL_ATTRIBUTES (node
);
12617 else if (TYPE_P (node
))
12619 tree decl
= TYPE_STUB_DECL (node
);
12621 attr
= lookup_attribute ("deprecated",
12622 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12627 attr
= lookup_attribute ("deprecated", attr
);
12630 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
12635 auto_diagnostic_group d
;
12637 w
= warning (OPT_Wdeprecated_declarations
,
12638 "%qD is deprecated: %s", node
, (const char *) msg
);
12640 w
= warning (OPT_Wdeprecated_declarations
,
12641 "%qD is deprecated", node
);
12643 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12645 else if (TYPE_P (node
))
12647 tree what
= NULL_TREE
;
12648 tree decl
= TYPE_STUB_DECL (node
);
12650 if (TYPE_NAME (node
))
12652 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12653 what
= TYPE_NAME (node
);
12654 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12655 && DECL_NAME (TYPE_NAME (node
)))
12656 what
= DECL_NAME (TYPE_NAME (node
));
12659 auto_diagnostic_group d
;
12663 w
= warning (OPT_Wdeprecated_declarations
,
12664 "%qE is deprecated: %s", what
, (const char *) msg
);
12666 w
= warning (OPT_Wdeprecated_declarations
,
12667 "%qE is deprecated", what
);
12672 w
= warning (OPT_Wdeprecated_declarations
,
12673 "type is deprecated: %s", (const char *) msg
);
12675 w
= warning (OPT_Wdeprecated_declarations
,
12676 "type is deprecated");
12680 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12686 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12687 somewhere in it. */
12690 contains_bitfld_component_ref_p (const_tree ref
)
12692 while (handled_component_p (ref
))
12694 if (TREE_CODE (ref
) == COMPONENT_REF
12695 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12697 ref
= TREE_OPERAND (ref
, 0);
12703 /* Try to determine whether a TRY_CATCH expression can fall through.
12704 This is a subroutine of block_may_fallthru. */
12707 try_catch_may_fallthru (const_tree stmt
)
12709 tree_stmt_iterator i
;
12711 /* If the TRY block can fall through, the whole TRY_CATCH can
12713 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12716 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12717 switch (TREE_CODE (tsi_stmt (i
)))
12720 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12721 catch expression and a body. The whole TRY_CATCH may fall
12722 through iff any of the catch bodies falls through. */
12723 for (; !tsi_end_p (i
); tsi_next (&i
))
12725 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12730 case EH_FILTER_EXPR
:
12731 /* The exception filter expression only matters if there is an
12732 exception. If the exception does not match EH_FILTER_TYPES,
12733 we will execute EH_FILTER_FAILURE, and we will fall through
12734 if that falls through. If the exception does match
12735 EH_FILTER_TYPES, the stack unwinder will continue up the
12736 stack, so we will not fall through. We don't know whether we
12737 will throw an exception which matches EH_FILTER_TYPES or not,
12738 so we just ignore EH_FILTER_TYPES and assume that we might
12739 throw an exception which doesn't match. */
12740 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12743 /* This case represents statements to be executed when an
12744 exception occurs. Those statements are implicitly followed
12745 by a RESX statement to resume execution after the exception.
12746 So in this case the TRY_CATCH never falls through. */
12751 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12752 need not be 100% accurate; simply be conservative and return true if we
12753 don't know. This is used only to avoid stupidly generating extra code.
12754 If we're wrong, we'll just delete the extra code later. */
12757 block_may_fallthru (const_tree block
)
12759 /* This CONST_CAST is okay because expr_last returns its argument
12760 unmodified and we assign it to a const_tree. */
12761 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12763 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12767 /* Easy cases. If the last statement of the block implies
12768 control transfer, then we can't fall through. */
12772 /* If there is a default: label or case labels cover all possible
12773 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12774 to some case label in all cases and all we care is whether the
12775 SWITCH_BODY falls through. */
12776 if (SWITCH_ALL_CASES_P (stmt
))
12777 return block_may_fallthru (SWITCH_BODY (stmt
));
12781 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12783 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12786 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12788 case TRY_CATCH_EXPR
:
12789 return try_catch_may_fallthru (stmt
);
12791 case TRY_FINALLY_EXPR
:
12792 /* The finally clause is always executed after the try clause,
12793 so if it does not fall through, then the try-finally will not
12794 fall through. Otherwise, if the try clause does not fall
12795 through, then when the finally clause falls through it will
12796 resume execution wherever the try clause was going. So the
12797 whole try-finally will only fall through if both the try
12798 clause and the finally clause fall through. */
12799 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12800 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12803 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12804 stmt
= TREE_OPERAND (stmt
, 1);
12810 /* Functions that do not return do not fall through. */
12811 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12813 case CLEANUP_POINT_EXPR
:
12814 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12817 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12823 return lang_hooks
.block_may_fallthru (stmt
);
12827 /* True if we are using EH to handle cleanups. */
12828 static bool using_eh_for_cleanups_flag
= false;
12830 /* This routine is called from front ends to indicate eh should be used for
12833 using_eh_for_cleanups (void)
12835 using_eh_for_cleanups_flag
= true;
12838 /* Query whether EH is used for cleanups. */
12840 using_eh_for_cleanups_p (void)
12842 return using_eh_for_cleanups_flag
;
12845 /* Wrapper for tree_code_name to ensure that tree code is valid */
12847 get_tree_code_name (enum tree_code code
)
12849 const char *invalid
= "<invalid tree code>";
12851 if (code
>= MAX_TREE_CODES
)
12854 return tree_code_name
[code
];
12857 /* Drops the TREE_OVERFLOW flag from T. */
12860 drop_tree_overflow (tree t
)
12862 gcc_checking_assert (TREE_OVERFLOW (t
));
12864 /* For tree codes with a sharing machinery re-build the result. */
12865 if (poly_int_tree_p (t
))
12866 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
12868 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12869 and canonicalize the result. */
12870 if (TREE_CODE (t
) == VECTOR_CST
)
12872 tree_vector_builder builder
;
12873 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12874 unsigned int count
= builder
.encoded_nelts ();
12875 for (unsigned int i
= 0; i
< count
; ++i
)
12877 tree elt
= VECTOR_CST_ELT (t
, i
);
12878 if (TREE_OVERFLOW (elt
))
12879 elt
= drop_tree_overflow (elt
);
12880 builder
.quick_push (elt
);
12882 return builder
.build ();
12885 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12886 and drop the flag. */
12888 TREE_OVERFLOW (t
) = 0;
12890 /* For constants that contain nested constants, drop the flag
12891 from those as well. */
12892 if (TREE_CODE (t
) == COMPLEX_CST
)
12894 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12895 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12896 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12897 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12903 /* Given a memory reference expression T, return its base address.
12904 The base address of a memory reference expression is the main
12905 object being referenced. For instance, the base address for
12906 'array[i].fld[j]' is 'array'. You can think of this as stripping
12907 away the offset part from a memory address.
12909 This function calls handled_component_p to strip away all the inner
12910 parts of the memory reference until it reaches the base object. */
12913 get_base_address (tree t
)
12915 while (handled_component_p (t
))
12916 t
= TREE_OPERAND (t
, 0);
12918 if ((TREE_CODE (t
) == MEM_REF
12919 || TREE_CODE (t
) == TARGET_MEM_REF
)
12920 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12921 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12923 /* ??? Either the alias oracle or all callers need to properly deal
12924 with WITH_SIZE_EXPRs before we can look through those. */
12925 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12931 /* Return a tree of sizetype representing the size, in bytes, of the element
12932 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12935 array_ref_element_size (tree exp
)
12937 tree aligned_size
= TREE_OPERAND (exp
, 3);
12938 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12939 location_t loc
= EXPR_LOCATION (exp
);
12941 /* If a size was specified in the ARRAY_REF, it's the size measured
12942 in alignment units of the element type. So multiply by that value. */
12945 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12946 sizetype from another type of the same width and signedness. */
12947 if (TREE_TYPE (aligned_size
) != sizetype
)
12948 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12949 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12950 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12953 /* Otherwise, take the size from that of the element type. Substitute
12954 any PLACEHOLDER_EXPR that we have. */
12956 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12959 /* Return a tree representing the lower bound of the array mentioned in
12960 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12963 array_ref_low_bound (tree exp
)
12965 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12967 /* If a lower bound is specified in EXP, use it. */
12968 if (TREE_OPERAND (exp
, 2))
12969 return TREE_OPERAND (exp
, 2);
12971 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12972 substituting for a PLACEHOLDER_EXPR as needed. */
12973 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12974 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12976 /* Otherwise, return a zero of the appropriate type. */
12977 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12980 /* Return a tree representing the upper bound of the array mentioned in
12981 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12984 array_ref_up_bound (tree exp
)
12986 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12988 /* If there is a domain type and it has an upper bound, use it, substituting
12989 for a PLACEHOLDER_EXPR as needed. */
12990 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12991 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12993 /* Otherwise fail. */
12997 /* Returns true if REF is an array reference or a component reference
12998 to an array at the end of a structure.
12999 If this is the case, the array may be allocated larger
13000 than its upper bound implies. */
13003 array_at_struct_end_p (tree ref
)
13007 if (TREE_CODE (ref
) == ARRAY_REF
13008 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13010 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13011 ref
= TREE_OPERAND (ref
, 0);
13013 else if (TREE_CODE (ref
) == COMPONENT_REF
13014 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13015 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13019 if (TREE_CODE (ref
) == STRING_CST
)
13022 tree ref_to_array
= ref
;
13023 while (handled_component_p (ref
))
13025 /* If the reference chain contains a component reference to a
13026 non-union type and there follows another field the reference
13027 is not at the end of a structure. */
13028 if (TREE_CODE (ref
) == COMPONENT_REF
)
13030 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13032 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13033 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13034 nextf
= DECL_CHAIN (nextf
);
13039 /* If we have a multi-dimensional array we do not consider
13040 a non-innermost dimension as flex array if the whole
13041 multi-dimensional array is at struct end.
13042 Same for an array of aggregates with a trailing array
13044 else if (TREE_CODE (ref
) == ARRAY_REF
)
13046 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13048 /* If we view an underlying object as sth else then what we
13049 gathered up to now is what we have to rely on. */
13050 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13053 gcc_unreachable ();
13055 ref
= TREE_OPERAND (ref
, 0);
13058 /* The array now is at struct end. Treat flexible arrays as
13059 always subject to extend, even into just padding constrained by
13060 an underlying decl. */
13061 if (! TYPE_SIZE (atype
)
13062 || ! TYPE_DOMAIN (atype
)
13063 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13066 if (TREE_CODE (ref
) == MEM_REF
13067 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13068 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13070 /* If the reference is based on a declared entity, the size of the array
13071 is constrained by its given domain. (Do not trust commons PR/69368). */
13073 && !(flag_unconstrained_commons
13074 && VAR_P (ref
) && DECL_COMMON (ref
))
13075 && DECL_SIZE_UNIT (ref
)
13076 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13078 /* Check whether the array domain covers all of the available
13081 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13082 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13083 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13085 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13088 /* If at least one extra element fits it is a flexarray. */
13089 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13090 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13092 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13093 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13102 /* Return a tree representing the offset, in bytes, of the field referenced
13103 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13106 component_ref_field_offset (tree exp
)
13108 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13109 tree field
= TREE_OPERAND (exp
, 1);
13110 location_t loc
= EXPR_LOCATION (exp
);
13112 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13113 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13115 if (aligned_offset
)
13117 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13118 sizetype from another type of the same width and signedness. */
13119 if (TREE_TYPE (aligned_offset
) != sizetype
)
13120 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13121 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13122 size_int (DECL_OFFSET_ALIGN (field
)
13126 /* Otherwise, take the offset from that of the field. Substitute
13127 any PLACEHOLDER_EXPR that we have. */
13129 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13132 /* Return the machine mode of T. For vectors, returns the mode of the
13133 inner type. The main use case is to feed the result to HONOR_NANS,
13134 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13137 element_mode (const_tree t
)
13141 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13143 return TYPE_MODE (t
);
13146 /* Vector types need to re-check the target flags each time we report
13147 the machine mode. We need to do this because attribute target can
13148 change the result of vector_mode_supported_p and have_regs_of_mode
13149 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13150 change on a per-function basis. */
13151 /* ??? Possibly a better solution is to run through all the types
13152 referenced by a function and re-compute the TYPE_MODE once, rather
13153 than make the TYPE_MODE macro call a function. */
13156 vector_type_mode (const_tree t
)
13160 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13162 mode
= t
->type_common
.mode
;
13163 if (VECTOR_MODE_P (mode
)
13164 && (!targetm
.vector_mode_supported_p (mode
)
13165 || !have_regs_of_mode
[mode
]))
13167 scalar_int_mode innermode
;
13169 /* For integers, try mapping it to a same-sized scalar mode. */
13170 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13172 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13173 * GET_MODE_BITSIZE (innermode
));
13174 scalar_int_mode mode
;
13175 if (int_mode_for_size (size
, 0).exists (&mode
)
13176 && have_regs_of_mode
[mode
])
13186 /* Verify that basic properties of T match TV and thus T can be a variant of
13187 TV. TV should be the more specified variant (i.e. the main variant). */
13190 verify_type_variant (const_tree t
, tree tv
)
13192 /* Type variant can differ by:
13194 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13195 ENCODE_QUAL_ADDR_SPACE.
13196 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13197 in this case some values may not be set in the variant types
13198 (see TYPE_COMPLETE_P checks).
13199 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13200 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13201 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13202 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13203 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13204 this is necessary to make it possible to merge types form different TUs
13205 - arrays, pointers and references may have TREE_TYPE that is a variant
13206 of TREE_TYPE of their main variants.
13207 - aggregates may have new TYPE_FIELDS list that list variants of
13208 the main variant TYPE_FIELDS.
13209 - vector types may differ by TYPE_VECTOR_OPAQUE
13212 /* Convenience macro for matching individual fields. */
13213 #define verify_variant_match(flag) \
13215 if (flag (tv) != flag (t)) \
13217 error ("type variant differs by %s", #flag); \
13223 /* tree_base checks. */
13225 verify_variant_match (TREE_CODE
);
13226 /* FIXME: Ada builds non-artificial variants of artificial types. */
13227 if (TYPE_ARTIFICIAL (tv
) && 0)
13228 verify_variant_match (TYPE_ARTIFICIAL
);
13229 if (POINTER_TYPE_P (tv
))
13230 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13231 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13232 verify_variant_match (TYPE_UNSIGNED
);
13233 verify_variant_match (TYPE_PACKED
);
13234 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13235 verify_variant_match (TYPE_REF_IS_RVALUE
);
13236 if (AGGREGATE_TYPE_P (t
))
13237 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13239 verify_variant_match (TYPE_SATURATING
);
13240 /* FIXME: This check trigger during libstdc++ build. */
13241 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13242 verify_variant_match (TYPE_FINAL_P
);
13244 /* tree_type_common checks. */
13246 if (COMPLETE_TYPE_P (t
))
13248 verify_variant_match (TYPE_MODE
);
13249 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13250 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13251 verify_variant_match (TYPE_SIZE
);
13252 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13253 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13254 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13256 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13257 TYPE_SIZE_UNIT (tv
), 0));
13258 error ("type variant has different TYPE_SIZE_UNIT");
13260 error ("type variant's TYPE_SIZE_UNIT");
13261 debug_tree (TYPE_SIZE_UNIT (tv
));
13262 error ("type's TYPE_SIZE_UNIT");
13263 debug_tree (TYPE_SIZE_UNIT (t
));
13267 verify_variant_match (TYPE_PRECISION
);
13268 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13269 if (RECORD_OR_UNION_TYPE_P (t
))
13270 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13271 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13272 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13273 /* During LTO we merge variant lists from diferent translation units
13274 that may differ BY TYPE_CONTEXT that in turn may point
13275 to TRANSLATION_UNIT_DECL.
13276 Ada also builds variants of types with different TYPE_CONTEXT. */
13277 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13278 verify_variant_match (TYPE_CONTEXT
);
13279 verify_variant_match (TYPE_STRING_FLAG
);
13280 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13282 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13287 /* tree_type_non_common checks. */
13289 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13290 and dangle the pointer from time to time. */
13291 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13292 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13293 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13295 error ("type variant has different TYPE_VFIELD");
13299 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13300 || TREE_CODE (t
) == INTEGER_TYPE
13301 || TREE_CODE (t
) == BOOLEAN_TYPE
13302 || TREE_CODE (t
) == REAL_TYPE
13303 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13305 verify_variant_match (TYPE_MAX_VALUE
);
13306 verify_variant_match (TYPE_MIN_VALUE
);
13308 if (TREE_CODE (t
) == METHOD_TYPE
)
13309 verify_variant_match (TYPE_METHOD_BASETYPE
);
13310 if (TREE_CODE (t
) == OFFSET_TYPE
)
13311 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13312 if (TREE_CODE (t
) == ARRAY_TYPE
)
13313 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13314 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13315 or even type's main variant. This is needed to make bootstrap pass
13316 and the bug seems new in GCC 5.
13317 C++ FE should be updated to make this consistent and we should check
13318 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13319 is a match with main variant.
13321 Also disable the check for Java for now because of parser hack that builds
13322 first an dummy BINFO and then sometimes replace it by real BINFO in some
13324 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13325 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13326 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13327 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13328 at LTO time only. */
13329 && (in_lto_p
&& odr_type_p (t
)))
13331 error ("type variant has different TYPE_BINFO");
13333 error ("type variant's TYPE_BINFO");
13334 debug_tree (TYPE_BINFO (tv
));
13335 error ("type's TYPE_BINFO");
13336 debug_tree (TYPE_BINFO (t
));
13340 /* Check various uses of TYPE_VALUES_RAW. */
13341 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13342 verify_variant_match (TYPE_VALUES
);
13343 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13344 verify_variant_match (TYPE_DOMAIN
);
13345 /* Permit incomplete variants of complete type. While FEs may complete
13346 all variants, this does not happen for C++ templates in all cases. */
13347 else if (RECORD_OR_UNION_TYPE_P (t
)
13348 && COMPLETE_TYPE_P (t
)
13349 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13353 /* Fortran builds qualified variants as new records with items of
13354 qualified type. Verify that they looks same. */
13355 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13357 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13358 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13359 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13360 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13361 /* FIXME: gfc_nonrestricted_type builds all types as variants
13362 with exception of pointer types. It deeply copies the type
13363 which means that we may end up with a variant type
13364 referring non-variant pointer. We may change it to
13365 produce types as variants, too, like
13366 objc_get_protocol_qualified_type does. */
13367 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13368 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13369 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13373 error ("type variant has different TYPE_FIELDS");
13375 error ("first mismatch is field");
13377 error ("and field");
13382 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13383 verify_variant_match (TYPE_ARG_TYPES
);
13384 /* For C++ the qualified variant of array type is really an array type
13385 of qualified TREE_TYPE.
13386 objc builds variants of pointer where pointer to type is a variant, too
13387 in objc_get_protocol_qualified_type. */
13388 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13389 && ((TREE_CODE (t
) != ARRAY_TYPE
13390 && !POINTER_TYPE_P (t
))
13391 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13392 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13394 error ("type variant has different TREE_TYPE");
13396 error ("type variant's TREE_TYPE");
13397 debug_tree (TREE_TYPE (tv
));
13398 error ("type's TREE_TYPE");
13399 debug_tree (TREE_TYPE (t
));
13402 if (type_with_alias_set_p (t
)
13403 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13405 error ("type is not compatible with its variant");
13407 error ("type variant's TREE_TYPE");
13408 debug_tree (TREE_TYPE (tv
));
13409 error ("type's TREE_TYPE");
13410 debug_tree (TREE_TYPE (t
));
13414 #undef verify_variant_match
13418 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13419 the middle-end types_compatible_p function. It needs to avoid
13420 claiming types are different for types that should be treated
13421 the same with respect to TBAA. Canonical types are also used
13422 for IL consistency checks via the useless_type_conversion_p
13423 predicate which does not handle all type kinds itself but falls
13424 back to pointer-comparison of TYPE_CANONICAL for aggregates
13427 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13428 type calculation because we need to allow inter-operability between signed
13429 and unsigned variants. */
13432 type_with_interoperable_signedness (const_tree type
)
13434 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13435 signed char and unsigned char. Similarly fortran FE builds
13436 C_SIZE_T as signed type, while C defines it unsigned. */
13438 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13440 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13441 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13444 /* Return true iff T1 and T2 are structurally identical for what
13446 This function is used both by lto.c canonical type merging and by the
13447 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13448 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13449 only for LTO because only in these cases TYPE_CANONICAL equivalence
13450 correspond to one defined by gimple_canonical_types_compatible_p. */
13453 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13454 bool trust_type_canonical
)
13456 /* Type variants should be same as the main variant. When not doing sanity
13457 checking to verify this fact, go to main variants and save some work. */
13458 if (trust_type_canonical
)
13460 t1
= TYPE_MAIN_VARIANT (t1
);
13461 t2
= TYPE_MAIN_VARIANT (t2
);
13464 /* Check first for the obvious case of pointer identity. */
13468 /* Check that we have two types to compare. */
13469 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13472 /* We consider complete types always compatible with incomplete type.
13473 This does not make sense for canonical type calculation and thus we
13474 need to ensure that we are never called on it.
13476 FIXME: For more correctness the function probably should have three modes
13477 1) mode assuming that types are complete mathcing their structure
13478 2) mode allowing incomplete types but producing equivalence classes
13479 and thus ignoring all info from complete types
13480 3) mode allowing incomplete types to match complete but checking
13481 compatibility between complete types.
13483 1 and 2 can be used for canonical type calculation. 3 is the real
13484 definition of type compatibility that can be used i.e. for warnings during
13485 declaration merging. */
13487 gcc_assert (!trust_type_canonical
13488 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13489 /* If the types have been previously registered and found equal
13492 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13493 && trust_type_canonical
)
13495 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13496 they are always NULL, but they are set to non-NULL for types
13497 constructed by build_pointer_type and variants. In this case the
13498 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13499 all pointers are considered equal. Be sure to not return false
13501 gcc_checking_assert (canonical_type_used_p (t1
)
13502 && canonical_type_used_p (t2
));
13503 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13506 /* Can't be the same type if the types don't have the same code. */
13507 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13508 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13511 /* Qualifiers do not matter for canonical type comparison purposes. */
13513 /* Void types and nullptr types are always the same. */
13514 if (TREE_CODE (t1
) == VOID_TYPE
13515 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13518 /* Can't be the same type if they have different mode. */
13519 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13522 /* Non-aggregate types can be handled cheaply. */
13523 if (INTEGRAL_TYPE_P (t1
)
13524 || SCALAR_FLOAT_TYPE_P (t1
)
13525 || FIXED_POINT_TYPE_P (t1
)
13526 || TREE_CODE (t1
) == VECTOR_TYPE
13527 || TREE_CODE (t1
) == COMPLEX_TYPE
13528 || TREE_CODE (t1
) == OFFSET_TYPE
13529 || POINTER_TYPE_P (t1
))
13531 /* Can't be the same type if they have different recision. */
13532 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13535 /* In some cases the signed and unsigned types are required to be
13537 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13538 && !type_with_interoperable_signedness (t1
))
13541 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13542 interoperable with "signed char". Unless all frontends are revisited
13543 to agree on these types, we must ignore the flag completely. */
13545 /* Fortran standard define C_PTR type that is compatible with every
13546 C pointer. For this reason we need to glob all pointers into one.
13547 Still pointers in different address spaces are not compatible. */
13548 if (POINTER_TYPE_P (t1
))
13550 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13551 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13555 /* Tail-recurse to components. */
13556 if (TREE_CODE (t1
) == VECTOR_TYPE
13557 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13558 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13560 trust_type_canonical
);
13565 /* Do type-specific comparisons. */
13566 switch (TREE_CODE (t1
))
13569 /* Array types are the same if the element types are the same and
13570 the number of elements are the same. */
13571 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13572 trust_type_canonical
)
13573 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13574 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13575 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13579 tree i1
= TYPE_DOMAIN (t1
);
13580 tree i2
= TYPE_DOMAIN (t2
);
13582 /* For an incomplete external array, the type domain can be
13583 NULL_TREE. Check this condition also. */
13584 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13586 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13590 tree min1
= TYPE_MIN_VALUE (i1
);
13591 tree min2
= TYPE_MIN_VALUE (i2
);
13592 tree max1
= TYPE_MAX_VALUE (i1
);
13593 tree max2
= TYPE_MAX_VALUE (i2
);
13595 /* The minimum/maximum values have to be the same. */
13598 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13599 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13600 || operand_equal_p (min1
, min2
, 0))))
13603 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13604 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13605 || operand_equal_p (max1
, max2
, 0)))))
13613 case FUNCTION_TYPE
:
13614 /* Function types are the same if the return type and arguments types
13616 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13617 trust_type_canonical
))
13620 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13624 tree parms1
, parms2
;
13626 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13628 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13630 if (!gimple_canonical_types_compatible_p
13631 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13632 trust_type_canonical
))
13636 if (parms1
|| parms2
)
13644 case QUAL_UNION_TYPE
:
13648 /* Don't try to compare variants of an incomplete type, before
13649 TYPE_FIELDS has been copied around. */
13650 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13654 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13657 /* For aggregate types, all the fields must be the same. */
13658 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13660 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13662 /* Skip non-fields and zero-sized fields. */
13663 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13665 && integer_zerop (DECL_SIZE (f1
)))))
13666 f1
= TREE_CHAIN (f1
);
13667 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13669 && integer_zerop (DECL_SIZE (f2
)))))
13670 f2
= TREE_CHAIN (f2
);
13673 /* The fields must have the same name, offset and type. */
13674 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13675 || !gimple_compare_field_offset (f1
, f2
)
13676 || !gimple_canonical_types_compatible_p
13677 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13678 trust_type_canonical
))
13682 /* If one aggregate has more fields than the other, they
13683 are not the same. */
13691 /* Consider all types with language specific trees in them mutually
13692 compatible. This is executed only from verify_type and false
13693 positives can be tolerated. */
13694 gcc_assert (!in_lto_p
);
13699 /* Verify type T. */
13702 verify_type (const_tree t
)
13704 bool error_found
= false;
13705 tree mv
= TYPE_MAIN_VARIANT (t
);
13708 error ("Main variant is not defined");
13709 error_found
= true;
13711 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13713 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13715 error_found
= true;
13717 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13718 error_found
= true;
13720 tree ct
= TYPE_CANONICAL (t
);
13723 else if (TYPE_CANONICAL (t
) != ct
)
13725 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13727 error_found
= true;
13729 /* Method and function types can not be used to address memory and thus
13730 TYPE_CANONICAL really matters only for determining useless conversions.
13732 FIXME: C++ FE produce declarations of builtin functions that are not
13733 compatible with main variants. */
13734 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13737 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13738 with variably sized arrays because their sizes possibly
13739 gimplified to different variables. */
13740 && !variably_modified_type_p (ct
, NULL
)
13741 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13743 error ("TYPE_CANONICAL is not compatible");
13745 error_found
= true;
13748 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13749 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13751 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13753 error_found
= true;
13755 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13757 error ("TYPE_CANONICAL of main variant is not main variant");
13759 debug_tree (TYPE_MAIN_VARIANT (ct
));
13760 error_found
= true;
13764 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13765 if (RECORD_OR_UNION_TYPE_P (t
))
13767 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13768 and danagle the pointer from time to time. */
13769 if (TYPE_VFIELD (t
)
13770 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13771 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13773 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13774 debug_tree (TYPE_VFIELD (t
));
13775 error_found
= true;
13778 else if (TREE_CODE (t
) == POINTER_TYPE
)
13780 if (TYPE_NEXT_PTR_TO (t
)
13781 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13783 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13784 debug_tree (TYPE_NEXT_PTR_TO (t
));
13785 error_found
= true;
13788 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13790 if (TYPE_NEXT_REF_TO (t
)
13791 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13793 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13794 debug_tree (TYPE_NEXT_REF_TO (t
));
13795 error_found
= true;
13798 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13799 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13801 /* FIXME: The following check should pass:
13802 useless_type_conversion_p (const_cast <tree> (t),
13803 TREE_TYPE (TYPE_MIN_VALUE (t))
13804 but does not for C sizetypes in LTO. */
13807 /* Check various uses of TYPE_MAXVAL_RAW. */
13808 if (RECORD_OR_UNION_TYPE_P (t
))
13810 if (!TYPE_BINFO (t
))
13812 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13814 error ("TYPE_BINFO is not TREE_BINFO");
13815 debug_tree (TYPE_BINFO (t
));
13816 error_found
= true;
13818 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13820 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13821 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13822 error_found
= true;
13825 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13827 if (TYPE_METHOD_BASETYPE (t
)
13828 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13829 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13831 error ("TYPE_METHOD_BASETYPE is not record nor union");
13832 debug_tree (TYPE_METHOD_BASETYPE (t
));
13833 error_found
= true;
13836 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13838 if (TYPE_OFFSET_BASETYPE (t
)
13839 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13840 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13842 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13843 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13844 error_found
= true;
13847 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13848 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13850 /* FIXME: The following check should pass:
13851 useless_type_conversion_p (const_cast <tree> (t),
13852 TREE_TYPE (TYPE_MAX_VALUE (t))
13853 but does not for C sizetypes in LTO. */
13855 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13857 if (TYPE_ARRAY_MAX_SIZE (t
)
13858 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13860 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13861 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13862 error_found
= true;
13865 else if (TYPE_MAX_VALUE_RAW (t
))
13867 error ("TYPE_MAX_VALUE_RAW non-NULL");
13868 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13869 error_found
= true;
13872 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13874 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13875 debug_tree (TYPE_LANG_SLOT_1 (t
));
13876 error_found
= true;
13879 /* Check various uses of TYPE_VALUES_RAW. */
13880 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13881 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13883 tree value
= TREE_VALUE (l
);
13884 tree name
= TREE_PURPOSE (l
);
13886 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13887 CONST_DECL of ENUMERAL TYPE. */
13888 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13890 error ("Enum value is not CONST_DECL or INTEGER_CST");
13891 debug_tree (value
);
13893 error_found
= true;
13895 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13896 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13898 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13899 debug_tree (value
);
13901 error_found
= true;
13903 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13905 error ("Enum value name is not IDENTIFIER_NODE");
13906 debug_tree (value
);
13908 error_found
= true;
13911 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13913 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13915 error ("Array TYPE_DOMAIN is not integer type");
13916 debug_tree (TYPE_DOMAIN (t
));
13917 error_found
= true;
13920 else if (RECORD_OR_UNION_TYPE_P (t
))
13922 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13924 error ("TYPE_FIELDS defined in incomplete type");
13925 error_found
= true;
13927 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13929 /* TODO: verify properties of decls. */
13930 if (TREE_CODE (fld
) == FIELD_DECL
)
13932 else if (TREE_CODE (fld
) == TYPE_DECL
)
13934 else if (TREE_CODE (fld
) == CONST_DECL
)
13936 else if (VAR_P (fld
))
13938 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13940 else if (TREE_CODE (fld
) == USING_DECL
)
13942 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13946 error ("Wrong tree in TYPE_FIELDS list");
13948 error_found
= true;
13952 else if (TREE_CODE (t
) == INTEGER_TYPE
13953 || TREE_CODE (t
) == BOOLEAN_TYPE
13954 || TREE_CODE (t
) == OFFSET_TYPE
13955 || TREE_CODE (t
) == REFERENCE_TYPE
13956 || TREE_CODE (t
) == NULLPTR_TYPE
13957 || TREE_CODE (t
) == POINTER_TYPE
)
13959 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13961 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13962 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13963 error_found
= true;
13965 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13967 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13968 debug_tree (TYPE_CACHED_VALUES (t
));
13969 error_found
= true;
13971 /* Verify just enough of cache to ensure that no one copied it to new type.
13972 All copying should go by copy_node that should clear it. */
13973 else if (TYPE_CACHED_VALUES_P (t
))
13976 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13977 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13978 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13980 error ("wrong TYPE_CACHED_VALUES entry");
13981 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13982 error_found
= true;
13987 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13988 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13990 /* C++ FE uses TREE_PURPOSE to store initial values. */
13991 if (TREE_PURPOSE (l
) && in_lto_p
)
13993 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13995 error_found
= true;
13997 if (!TYPE_P (TREE_VALUE (l
)))
13999 error ("Wrong entry in TYPE_ARG_TYPES list");
14001 error_found
= true;
14004 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14006 error ("TYPE_VALUES_RAW field is non-NULL");
14007 debug_tree (TYPE_VALUES_RAW (t
));
14008 error_found
= true;
14010 if (TREE_CODE (t
) != INTEGER_TYPE
14011 && TREE_CODE (t
) != BOOLEAN_TYPE
14012 && TREE_CODE (t
) != OFFSET_TYPE
14013 && TREE_CODE (t
) != REFERENCE_TYPE
14014 && TREE_CODE (t
) != NULLPTR_TYPE
14015 && TREE_CODE (t
) != POINTER_TYPE
14016 && TYPE_CACHED_VALUES_P (t
))
14018 error ("TYPE_CACHED_VALUES_P is set while it should not");
14019 error_found
= true;
14021 if (TYPE_STRING_FLAG (t
)
14022 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14024 error ("TYPE_STRING_FLAG is set on wrong type code");
14025 error_found
= true;
14028 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14029 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14031 if (TREE_CODE (t
) == METHOD_TYPE
14032 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14034 error ("TYPE_METHOD_BASETYPE is not main variant");
14035 error_found
= true;
14040 debug_tree (const_cast <tree
> (t
));
14041 internal_error ("verify_type failed");
14046 /* Return 1 if ARG interpreted as signed in its precision is known to be
14047 always positive or 2 if ARG is known to be always negative, or 3 if
14048 ARG may be positive or negative. */
14051 get_range_pos_neg (tree arg
)
14053 if (arg
== error_mark_node
)
14056 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14058 if (TREE_CODE (arg
) == INTEGER_CST
)
14060 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14066 while (CONVERT_EXPR_P (arg
)
14067 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14068 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14070 arg
= TREE_OPERAND (arg
, 0);
14071 /* Narrower value zero extended into wider type
14072 will always result in positive values. */
14073 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14074 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14076 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14081 if (TREE_CODE (arg
) != SSA_NAME
)
14083 wide_int arg_min
, arg_max
;
14084 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14086 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14087 if (is_gimple_assign (g
)
14088 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14090 tree t
= gimple_assign_rhs1 (g
);
14091 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14092 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14094 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14095 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14097 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14106 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14108 /* For unsigned values, the "positive" range comes
14109 below the "negative" range. */
14110 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14112 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14117 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14119 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14128 /* Return true if ARG is marked with the nonnull attribute in the
14129 current function signature. */
14132 nonnull_arg_p (const_tree arg
)
14134 tree t
, attrs
, fntype
;
14135 unsigned HOST_WIDE_INT arg_num
;
14137 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14138 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14139 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14141 /* The static chain decl is always non null. */
14142 if (arg
== cfun
->static_chain_decl
)
14145 /* THIS argument of method is always non-NULL. */
14146 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14147 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14148 && flag_delete_null_pointer_checks
)
14151 /* Values passed by reference are always non-NULL. */
14152 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14153 && flag_delete_null_pointer_checks
)
14156 fntype
= TREE_TYPE (cfun
->decl
);
14157 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14159 attrs
= lookup_attribute ("nonnull", attrs
);
14161 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14162 if (attrs
== NULL_TREE
)
14165 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14166 if (TREE_VALUE (attrs
) == NULL_TREE
)
14169 /* Get the position number for ARG in the function signature. */
14170 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14172 t
= DECL_CHAIN (t
), arg_num
++)
14178 gcc_assert (t
== arg
);
14180 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14181 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14183 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14191 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14195 set_block (location_t loc
, tree block
)
14197 location_t pure_loc
= get_pure_location (loc
);
14198 source_range src_range
= get_range_from_loc (line_table
, loc
);
14199 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14203 set_source_range (tree expr
, location_t start
, location_t finish
)
14205 source_range src_range
;
14206 src_range
.m_start
= start
;
14207 src_range
.m_finish
= finish
;
14208 return set_source_range (expr
, src_range
);
14212 set_source_range (tree expr
, source_range src_range
)
14214 if (!EXPR_P (expr
))
14215 return UNKNOWN_LOCATION
;
14217 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14218 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14222 SET_EXPR_LOCATION (expr
, adhoc
);
14226 /* Return EXPR, potentially wrapped with a node expression LOC,
14227 if !CAN_HAVE_LOCATION_P (expr).
14229 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14230 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14232 Wrapper nodes can be identified using location_wrapper_p. */
14235 maybe_wrap_with_location (tree expr
, location_t loc
)
14239 if (loc
== UNKNOWN_LOCATION
)
14241 if (CAN_HAVE_LOCATION_P (expr
))
14243 /* We should only be adding wrappers for constants and for decls,
14244 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14245 gcc_assert (CONSTANT_CLASS_P (expr
)
14247 || EXCEPTIONAL_CLASS_P (expr
));
14249 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14250 any impact of the wrapper nodes. */
14251 if (EXCEPTIONAL_CLASS_P (expr
))
14255 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14256 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14257 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14258 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14259 /* Mark this node as being a wrapper. */
14260 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14264 /* Return the name of combined function FN, for debugging purposes. */
14267 combined_fn_name (combined_fn fn
)
14269 if (builtin_fn_p (fn
))
14271 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14272 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14275 return internal_fn_name (as_internal_fn (fn
));
14278 /* Return a bitmap with a bit set corresponding to each argument in
14279 a function call type FNTYPE declared with attribute nonnull,
14280 or null if none of the function's argument are nonnull. The caller
14281 must free the bitmap. */
14284 get_nonnull_args (const_tree fntype
)
14286 if (fntype
== NULL_TREE
)
14289 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14293 bitmap argmap
= NULL
;
14295 /* A function declaration can specify multiple attribute nonnull,
14296 each with zero or more arguments. The loop below creates a bitmap
14297 representing a union of all the arguments. An empty (but non-null)
14298 bitmap means that all arguments have been declaraed nonnull. */
14299 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14301 attrs
= lookup_attribute ("nonnull", attrs
);
14306 argmap
= BITMAP_ALLOC (NULL
);
14308 if (!TREE_VALUE (attrs
))
14310 /* Clear the bitmap in case a previous attribute nonnull
14311 set it and this one overrides it for all arguments. */
14312 bitmap_clear (argmap
);
14316 /* Iterate over the indices of the format arguments declared nonnull
14317 and set a bit for each. */
14318 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14320 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14321 bitmap_set_bit (argmap
, val
);
14328 /* Returns true if TYPE is a type where it and all of its subobjects
14329 (recursively) are of structure, union, or array type. */
14332 default_is_empty_type (tree type
)
14334 if (RECORD_OR_UNION_TYPE_P (type
))
14336 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14337 if (TREE_CODE (field
) == FIELD_DECL
14338 && !DECL_PADDING_P (field
)
14339 && !default_is_empty_type (TREE_TYPE (field
)))
14343 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14344 return (integer_minus_onep (array_type_nelts (type
))
14345 || TYPE_DOMAIN (type
) == NULL_TREE
14346 || default_is_empty_type (TREE_TYPE (type
)));
14350 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14351 that shouldn't be passed via stack. */
14354 default_is_empty_record (const_tree type
)
14356 if (!abi_version_at_least (12))
14359 if (type
== error_mark_node
)
14362 if (TREE_ADDRESSABLE (type
))
14365 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14368 /* Like int_size_in_bytes, but handle empty records specially. */
14371 arg_int_size_in_bytes (const_tree type
)
14373 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14376 /* Like size_in_bytes, but handle empty records specially. */
14379 arg_size_in_bytes (const_tree type
)
14381 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14384 /* Return true if an expression with CODE has to have the same result type as
14385 its first operand. */
14388 expr_type_first_operand_type_p (tree_code code
)
14401 case TRUNC_DIV_EXPR
:
14402 case CEIL_DIV_EXPR
:
14403 case FLOOR_DIV_EXPR
:
14404 case ROUND_DIV_EXPR
:
14405 case TRUNC_MOD_EXPR
:
14406 case CEIL_MOD_EXPR
:
14407 case FLOOR_MOD_EXPR
:
14408 case ROUND_MOD_EXPR
:
14410 case EXACT_DIV_EXPR
:
14428 /* List of pointer types used to declare builtins before we have seen their
14431 Keep the size up to date in tree.h ! */
14432 const builtin_structptr_type builtin_structptr_types
[6] =
14434 { fileptr_type_node
, ptr_type_node
, "FILE" },
14435 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14436 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14437 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14438 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14439 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14444 namespace selftest
{
14446 /* Selftests for tree. */
14448 /* Verify that integer constants are sane. */
14451 test_integer_constants ()
14453 ASSERT_TRUE (integer_type_node
!= NULL
);
14454 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14456 tree type
= integer_type_node
;
14458 tree zero
= build_zero_cst (type
);
14459 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14460 ASSERT_EQ (type
, TREE_TYPE (zero
));
14462 tree one
= build_int_cst (type
, 1);
14463 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14464 ASSERT_EQ (type
, TREE_TYPE (zero
));
14467 /* Verify identifiers. */
14470 test_identifiers ()
14472 tree identifier
= get_identifier ("foo");
14473 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14474 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14477 /* Verify LABEL_DECL. */
14482 tree identifier
= get_identifier ("err");
14483 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14484 identifier
, void_type_node
);
14485 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14486 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14489 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14490 are given by VALS. */
14493 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
14495 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
14496 tree_vector_builder
builder (type
, vals
.length (), 1);
14497 builder
.splice (vals
);
14498 return builder
.build ();
14501 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14504 check_vector_cst (vec
<tree
> expected
, tree actual
)
14506 ASSERT_KNOWN_EQ (expected
.length (),
14507 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14508 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14509 ASSERT_EQ (wi::to_wide (expected
[i
]),
14510 wi::to_wide (vector_cst_elt (actual
, i
)));
14513 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14514 and that its elements match EXPECTED. */
14517 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14518 unsigned int npatterns
)
14520 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14521 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14522 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14523 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14524 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14525 check_vector_cst (expected
, actual
);
14528 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14529 and NPATTERNS background elements, and that its elements match
14533 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14534 unsigned int npatterns
)
14536 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14537 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14538 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14539 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14540 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14541 check_vector_cst (expected
, actual
);
14544 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14545 and that its elements match EXPECTED. */
14548 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14549 unsigned int npatterns
)
14551 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14552 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14553 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14554 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14555 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14556 check_vector_cst (expected
, actual
);
14559 /* Test the creation of VECTOR_CSTs. */
14562 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
14564 auto_vec
<tree
, 8> elements (8);
14565 elements
.quick_grow (8);
14566 tree element_type
= build_nonstandard_integer_type (16, true);
14567 tree vector_type
= build_vector_type (element_type
, 8);
14569 /* Test a simple linear series with a base of 0 and a step of 1:
14570 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14571 for (unsigned int i
= 0; i
< 8; ++i
)
14572 elements
[i
] = build_int_cst (element_type
, i
);
14573 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14574 check_vector_cst_stepped (elements
, vector
, 1);
14576 /* Try the same with the first element replaced by 100:
14577 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14578 elements
[0] = build_int_cst (element_type
, 100);
14579 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14580 check_vector_cst_stepped (elements
, vector
, 1);
14582 /* Try a series that wraps around.
14583 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14584 for (unsigned int i
= 1; i
< 8; ++i
)
14585 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14586 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14587 check_vector_cst_stepped (elements
, vector
, 1);
14589 /* Try a downward series:
14590 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14591 for (unsigned int i
= 1; i
< 8; ++i
)
14592 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14593 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14594 check_vector_cst_stepped (elements
, vector
, 1);
14596 /* Try two interleaved series with different bases and steps:
14597 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14598 elements
[1] = build_int_cst (element_type
, 53);
14599 for (unsigned int i
= 2; i
< 8; i
+= 2)
14601 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14602 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14604 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14605 check_vector_cst_stepped (elements
, vector
, 2);
14607 /* Try a duplicated value:
14608 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14609 for (unsigned int i
= 1; i
< 8; ++i
)
14610 elements
[i
] = elements
[0];
14611 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14612 check_vector_cst_duplicate (elements
, vector
, 1);
14614 /* Try an interleaved duplicated value:
14615 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14616 elements
[1] = build_int_cst (element_type
, 55);
14617 for (unsigned int i
= 2; i
< 8; ++i
)
14618 elements
[i
] = elements
[i
- 2];
14619 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14620 check_vector_cst_duplicate (elements
, vector
, 2);
14622 /* Try a duplicated value with 2 exceptions
14623 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14624 elements
[0] = build_int_cst (element_type
, 41);
14625 elements
[1] = build_int_cst (element_type
, 97);
14626 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14627 check_vector_cst_fill (elements
, vector
, 2);
14629 /* Try with and without a step
14630 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14631 for (unsigned int i
= 3; i
< 8; i
+= 2)
14632 elements
[i
] = build_int_cst (element_type
, i
* 7);
14633 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14634 check_vector_cst_stepped (elements
, vector
, 2);
14636 /* Try a fully-general constant:
14637 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14638 elements
[5] = build_int_cst (element_type
, 9990);
14639 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14640 check_vector_cst_fill (elements
, vector
, 4);
14643 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
14644 Helper function for test_location_wrappers, to deal with STRIP_NOPS
14645 modifying its argument in-place. */
14648 check_strip_nops (tree node
, tree expected
)
14651 ASSERT_EQ (expected
, node
);
14654 /* Verify location wrappers. */
14657 test_location_wrappers ()
14659 location_t loc
= BUILTINS_LOCATION
;
14661 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
14663 /* Wrapping a constant. */
14664 tree int_cst
= build_int_cst (integer_type_node
, 42);
14665 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
14666 ASSERT_FALSE (location_wrapper_p (int_cst
));
14668 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
14669 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
14670 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
14671 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
14673 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
14674 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
14676 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
14677 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
14678 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
14679 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
14681 /* Wrapping a STRING_CST. */
14682 tree string_cst
= build_string (4, "foo");
14683 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
14684 ASSERT_FALSE (location_wrapper_p (string_cst
));
14686 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
14687 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
14688 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
14689 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
14690 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
14693 /* Wrapping a variable. */
14694 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
14695 get_identifier ("some_int_var"),
14696 integer_type_node
);
14697 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
14698 ASSERT_FALSE (location_wrapper_p (int_var
));
14700 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
14701 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
14702 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
14703 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
14705 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
14707 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
14708 ASSERT_FALSE (location_wrapper_p (r_cast
));
14709 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
14711 /* Verify that STRIP_NOPS removes wrappers. */
14712 check_strip_nops (wrapped_int_cst
, int_cst
);
14713 check_strip_nops (wrapped_string_cst
, string_cst
);
14714 check_strip_nops (wrapped_int_var
, int_var
);
14717 /* Check that string escaping works correctly. */
14720 test_escaped_strings (void)
14723 escaped_string msg
;
14726 /* ASSERT_STREQ does not accept NULL as a valid test
14727 result, so we have to use ASSERT_EQ instead. */
14728 ASSERT_EQ (NULL
, (const char *) msg
);
14731 ASSERT_STREQ ("", (const char *) msg
);
14733 msg
.escape ("foobar");
14734 ASSERT_STREQ ("foobar", (const char *) msg
);
14736 /* Ensure that we have -fmessage-length set to 0. */
14737 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
14738 pp_line_cutoff (global_dc
->printer
) = 0;
14740 msg
.escape ("foo\nbar");
14741 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
14743 msg
.escape ("\a\b\f\n\r\t\v");
14744 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
14746 /* Now repeat the tests with -fmessage-length set to 5. */
14747 pp_line_cutoff (global_dc
->printer
) = 5;
14749 /* Note that the newline is not translated into an escape. */
14750 msg
.escape ("foo\nbar");
14751 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
14753 msg
.escape ("\a\b\f\n\r\t\v");
14754 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
14756 /* Restore the original message length setting. */
14757 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
14760 /* Run all of the selftests within this file. */
14765 test_integer_constants ();
14766 test_identifiers ();
14768 test_vector_cst_patterns ();
14769 test_location_wrappers ();
14770 test_escaped_strings ();
14773 } // namespace selftest
14775 #endif /* CHECKING_P */
14777 #include "gt-tree.h"