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_ */
348 const char * const omp_clause_code_name
[] =
420 /* Return the tree node structure used by tree code CODE. */
422 static inline enum tree_node_structure_enum
423 tree_node_structure_for_code (enum tree_code code
)
425 switch (TREE_CODE_CLASS (code
))
427 case tcc_declaration
:
432 return TS_FIELD_DECL
;
438 return TS_LABEL_DECL
;
440 return TS_RESULT_DECL
;
441 case DEBUG_EXPR_DECL
:
444 return TS_CONST_DECL
;
448 return TS_FUNCTION_DECL
;
449 case TRANSLATION_UNIT_DECL
:
450 return TS_TRANSLATION_UNIT_DECL
;
452 return TS_DECL_NON_COMMON
;
456 return TS_TYPE_NON_COMMON
;
465 default: /* tcc_constant and tcc_exceptional */
470 /* tcc_constant cases. */
471 case VOID_CST
: return TS_TYPED
;
472 case INTEGER_CST
: return TS_INT_CST
;
473 case POLY_INT_CST
: return TS_POLY_INT_CST
;
474 case REAL_CST
: return TS_REAL_CST
;
475 case FIXED_CST
: return TS_FIXED_CST
;
476 case COMPLEX_CST
: return TS_COMPLEX
;
477 case VECTOR_CST
: return TS_VECTOR
;
478 case STRING_CST
: return TS_STRING
;
479 /* tcc_exceptional cases. */
480 case ERROR_MARK
: return TS_COMMON
;
481 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
482 case TREE_LIST
: return TS_LIST
;
483 case TREE_VEC
: return TS_VEC
;
484 case SSA_NAME
: return TS_SSA_NAME
;
485 case PLACEHOLDER_EXPR
: return TS_COMMON
;
486 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
487 case BLOCK
: return TS_BLOCK
;
488 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
489 case TREE_BINFO
: return TS_BINFO
;
490 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
491 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
492 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
500 /* Initialize tree_contains_struct to describe the hierarchy of tree
504 initialize_tree_contains_struct (void)
508 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
511 enum tree_node_structure_enum ts_code
;
513 code
= (enum tree_code
) i
;
514 ts_code
= tree_node_structure_for_code (code
);
516 /* Mark the TS structure itself. */
517 tree_contains_struct
[code
][ts_code
] = 1;
519 /* Mark all the structures that TS is derived from. */
524 case TS_OPTIMIZATION
:
525 case TS_TARGET_OPTION
:
531 case TS_POLY_INT_CST
:
540 case TS_STATEMENT_LIST
:
541 MARK_TS_TYPED (code
);
545 case TS_DECL_MINIMAL
:
551 MARK_TS_COMMON (code
);
554 case TS_TYPE_WITH_LANG_SPECIFIC
:
555 MARK_TS_TYPE_COMMON (code
);
558 case TS_TYPE_NON_COMMON
:
559 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
563 MARK_TS_DECL_MINIMAL (code
);
568 MARK_TS_DECL_COMMON (code
);
571 case TS_DECL_NON_COMMON
:
572 MARK_TS_DECL_WITH_VIS (code
);
575 case TS_DECL_WITH_VIS
:
579 MARK_TS_DECL_WRTL (code
);
583 MARK_TS_DECL_COMMON (code
);
587 MARK_TS_DECL_WITH_VIS (code
);
591 case TS_FUNCTION_DECL
:
592 MARK_TS_DECL_NON_COMMON (code
);
595 case TS_TRANSLATION_UNIT_DECL
:
596 MARK_TS_DECL_COMMON (code
);
604 /* Basic consistency checks for attributes used in fold. */
605 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
606 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
607 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
608 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
609 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
610 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
611 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
612 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
613 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
614 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
615 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
616 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
617 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
618 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
619 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
620 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
621 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
622 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
623 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
624 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
625 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
627 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
628 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
629 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
631 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
632 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
633 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
634 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
635 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
636 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
637 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
638 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
639 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
640 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
641 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
643 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
653 /* Initialize the hash table of types. */
655 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
658 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
661 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
663 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
665 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
667 int_cst_node
= make_int_cst (1, 1);
669 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
671 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
672 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
674 /* Initialize the tree_contains_struct array. */
675 initialize_tree_contains_struct ();
676 lang_hooks
.init_ts ();
680 /* The name of the object as the assembler will see it (but before any
681 translations made by ASM_OUTPUT_LABELREF). Often this is the same
682 as DECL_NAME. It is an IDENTIFIER_NODE. */
684 decl_assembler_name (tree decl
)
686 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
687 lang_hooks
.set_decl_assembler_name (decl
);
688 return DECL_ASSEMBLER_NAME_RAW (decl
);
691 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
692 (either of which may be NULL). Inform the FE, if this changes the
696 overwrite_decl_assembler_name (tree decl
, tree name
)
698 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
699 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
702 /* When the target supports COMDAT groups, this indicates which group the
703 DECL is associated with. This can be either an IDENTIFIER_NODE or a
704 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
706 decl_comdat_group (const_tree node
)
708 struct symtab_node
*snode
= symtab_node::get (node
);
711 return snode
->get_comdat_group ();
714 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
716 decl_comdat_group_id (const_tree node
)
718 struct symtab_node
*snode
= symtab_node::get (node
);
721 return snode
->get_comdat_group_id ();
724 /* When the target supports named section, return its name as IDENTIFIER_NODE
725 or NULL if it is in no section. */
727 decl_section_name (const_tree node
)
729 struct symtab_node
*snode
= symtab_node::get (node
);
732 return snode
->get_section ();
735 /* Set section name of NODE to VALUE (that is expected to be
738 set_decl_section_name (tree node
, const char *value
)
740 struct symtab_node
*snode
;
744 snode
= symtab_node::get (node
);
748 else if (VAR_P (node
))
749 snode
= varpool_node::get_create (node
);
751 snode
= cgraph_node::get_create (node
);
752 snode
->set_section (value
);
755 /* Return TLS model of a variable NODE. */
757 decl_tls_model (const_tree node
)
759 struct varpool_node
*snode
= varpool_node::get (node
);
761 return TLS_MODEL_NONE
;
762 return snode
->tls_model
;
765 /* Set TLS model of variable NODE to MODEL. */
767 set_decl_tls_model (tree node
, enum tls_model model
)
769 struct varpool_node
*vnode
;
771 if (model
== TLS_MODEL_NONE
)
773 vnode
= varpool_node::get (node
);
778 vnode
= varpool_node::get_create (node
);
779 vnode
->tls_model
= model
;
782 /* Compute the number of bytes occupied by a tree with code CODE.
783 This function cannot be used for nodes that have variable sizes,
784 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
786 tree_code_size (enum tree_code code
)
788 switch (TREE_CODE_CLASS (code
))
790 case tcc_declaration
: /* A decl node */
793 case FIELD_DECL
: return sizeof (tree_field_decl
);
794 case PARM_DECL
: return sizeof (tree_parm_decl
);
795 case VAR_DECL
: return sizeof (tree_var_decl
);
796 case LABEL_DECL
: return sizeof (tree_label_decl
);
797 case RESULT_DECL
: return sizeof (tree_result_decl
);
798 case CONST_DECL
: return sizeof (tree_const_decl
);
799 case TYPE_DECL
: return sizeof (tree_type_decl
);
800 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
801 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
802 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
805 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
807 gcc_checking_assert (code
>= NUM_TREE_CODES
);
808 return lang_hooks
.tree_size (code
);
811 case tcc_type
: /* a type node */
822 case FIXED_POINT_TYPE
:
828 case QUAL_UNION_TYPE
:
830 case POINTER_BOUNDS_TYPE
:
833 case LANG_TYPE
: return sizeof (tree_type_non_common
);
835 gcc_checking_assert (code
>= NUM_TREE_CODES
);
836 return lang_hooks
.tree_size (code
);
839 case tcc_reference
: /* a reference */
840 case tcc_expression
: /* an expression */
841 case tcc_statement
: /* an expression with side effects */
842 case tcc_comparison
: /* a comparison expression */
843 case tcc_unary
: /* a unary arithmetic expression */
844 case tcc_binary
: /* a binary arithmetic expression */
845 return (sizeof (struct tree_exp
)
846 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
848 case tcc_constant
: /* a constant */
851 case VOID_CST
: return sizeof (tree_typed
);
852 case INTEGER_CST
: gcc_unreachable ();
853 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
854 case REAL_CST
: return sizeof (tree_real_cst
);
855 case FIXED_CST
: return sizeof (tree_fixed_cst
);
856 case COMPLEX_CST
: return sizeof (tree_complex
);
857 case VECTOR_CST
: gcc_unreachable ();
858 case STRING_CST
: gcc_unreachable ();
860 gcc_checking_assert (code
>= NUM_TREE_CODES
);
861 return lang_hooks
.tree_size (code
);
864 case tcc_exceptional
: /* something random, like an identifier. */
867 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
868 case TREE_LIST
: return sizeof (tree_list
);
871 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
873 case TREE_VEC
: gcc_unreachable ();
874 case OMP_CLAUSE
: gcc_unreachable ();
876 case SSA_NAME
: return sizeof (tree_ssa_name
);
878 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
879 case BLOCK
: return sizeof (struct tree_block
);
880 case CONSTRUCTOR
: return sizeof (tree_constructor
);
881 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
882 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
885 gcc_checking_assert (code
>= NUM_TREE_CODES
);
886 return lang_hooks
.tree_size (code
);
894 /* Compute the number of bytes occupied by NODE. This routine only
895 looks at TREE_CODE, except for those nodes that have variable sizes. */
897 tree_size (const_tree node
)
899 const enum tree_code code
= TREE_CODE (node
);
903 return (sizeof (struct tree_int_cst
)
904 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
907 return (offsetof (struct tree_binfo
, base_binfos
)
909 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
912 return (sizeof (struct tree_vec
)
913 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
916 return (sizeof (struct tree_vector
)
917 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
920 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
923 return (sizeof (struct tree_omp_clause
)
924 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
928 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
929 return (sizeof (struct tree_exp
)
930 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
932 return tree_code_size (code
);
936 /* Record interesting allocation statistics for a tree node with CODE
940 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
941 size_t length ATTRIBUTE_UNUSED
)
943 enum tree_code_class type
= TREE_CODE_CLASS (code
);
946 if (!GATHER_STATISTICS
)
951 case tcc_declaration
: /* A decl node */
955 case tcc_type
: /* a type node */
959 case tcc_statement
: /* an expression with side effects */
963 case tcc_reference
: /* a reference */
967 case tcc_expression
: /* an expression */
968 case tcc_comparison
: /* a comparison expression */
969 case tcc_unary
: /* a unary arithmetic expression */
970 case tcc_binary
: /* a binary arithmetic expression */
974 case tcc_constant
: /* a constant */
978 case tcc_exceptional
: /* something random, like an identifier. */
981 case IDENTIFIER_NODE
:
994 kind
= ssa_name_kind
;
1006 kind
= omp_clause_kind
;
1023 tree_code_counts
[(int) code
]++;
1024 tree_node_counts
[(int) kind
]++;
1025 tree_node_sizes
[(int) kind
] += length
;
1028 /* Allocate and return a new UID from the DECL_UID namespace. */
1031 allocate_decl_uid (void)
1033 return next_decl_uid
++;
1036 /* Return a newly allocated node of code CODE. For decl and type
1037 nodes, some other fields are initialized. The rest of the node is
1038 initialized to zero. This function cannot be used for TREE_VEC,
1039 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1042 Achoo! I got a code in the node. */
1045 make_node (enum tree_code code MEM_STAT_DECL
)
1048 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1049 size_t length
= tree_code_size (code
);
1051 record_node_allocation_statistics (code
, length
);
1053 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1054 TREE_SET_CODE (t
, code
);
1059 if (code
!= DEBUG_BEGIN_STMT
)
1060 TREE_SIDE_EFFECTS (t
) = 1;
1063 case tcc_declaration
:
1064 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1066 if (code
== FUNCTION_DECL
)
1068 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1069 SET_DECL_MODE (t
, FUNCTION_MODE
);
1072 SET_DECL_ALIGN (t
, 1);
1074 DECL_SOURCE_LOCATION (t
) = input_location
;
1075 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1076 DECL_UID (t
) = --next_debug_decl_uid
;
1079 DECL_UID (t
) = allocate_decl_uid ();
1080 SET_DECL_PT_UID (t
, -1);
1082 if (TREE_CODE (t
) == LABEL_DECL
)
1083 LABEL_DECL_UID (t
) = -1;
1088 TYPE_UID (t
) = next_type_uid
++;
1089 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1090 TYPE_USER_ALIGN (t
) = 0;
1091 TYPE_MAIN_VARIANT (t
) = t
;
1092 TYPE_CANONICAL (t
) = t
;
1094 /* Default to no attributes for type, but let target change that. */
1095 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1096 targetm
.set_default_type_attributes (t
);
1098 /* We have not yet computed the alias set for this type. */
1099 TYPE_ALIAS_SET (t
) = -1;
1103 TREE_CONSTANT (t
) = 1;
1106 case tcc_expression
:
1112 case PREDECREMENT_EXPR
:
1113 case PREINCREMENT_EXPR
:
1114 case POSTDECREMENT_EXPR
:
1115 case POSTINCREMENT_EXPR
:
1116 /* All of these have side-effects, no matter what their
1118 TREE_SIDE_EFFECTS (t
) = 1;
1126 case tcc_exceptional
:
1129 case TARGET_OPTION_NODE
:
1130 TREE_TARGET_OPTION(t
)
1131 = ggc_cleared_alloc
<struct cl_target_option
> ();
1134 case OPTIMIZATION_NODE
:
1135 TREE_OPTIMIZATION (t
)
1136 = ggc_cleared_alloc
<struct cl_optimization
> ();
1145 /* Other classes need no special treatment. */
1152 /* Free tree node. */
1155 free_node (tree node
)
1157 enum tree_code code
= TREE_CODE (node
);
1158 if (GATHER_STATISTICS
)
1160 tree_code_counts
[(int) TREE_CODE (node
)]--;
1161 tree_node_counts
[(int) t_kind
]--;
1162 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1164 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1165 vec_free (CONSTRUCTOR_ELTS (node
));
1166 else if (code
== BLOCK
)
1167 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1168 else if (code
== TREE_BINFO
)
1169 vec_free (BINFO_BASE_ACCESSES (node
));
1173 /* Return a new node with the same contents as NODE except that its
1174 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1177 copy_node (tree node MEM_STAT_DECL
)
1180 enum tree_code code
= TREE_CODE (node
);
1183 gcc_assert (code
!= STATEMENT_LIST
);
1185 length
= tree_size (node
);
1186 record_node_allocation_statistics (code
, length
);
1187 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1188 memcpy (t
, node
, length
);
1190 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1192 TREE_ASM_WRITTEN (t
) = 0;
1193 TREE_VISITED (t
) = 0;
1195 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1197 if (code
== DEBUG_EXPR_DECL
)
1198 DECL_UID (t
) = --next_debug_decl_uid
;
1201 DECL_UID (t
) = allocate_decl_uid ();
1202 if (DECL_PT_UID_SET_P (node
))
1203 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1205 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1206 && DECL_HAS_VALUE_EXPR_P (node
))
1208 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1209 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1211 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1214 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1215 t
->decl_with_vis
.symtab_node
= NULL
;
1217 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1219 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1220 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1222 if (TREE_CODE (node
) == FUNCTION_DECL
)
1224 DECL_STRUCT_FUNCTION (t
) = NULL
;
1225 t
->decl_with_vis
.symtab_node
= NULL
;
1228 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1230 TYPE_UID (t
) = next_type_uid
++;
1231 /* The following is so that the debug code for
1232 the copy is different from the original type.
1233 The two statements usually duplicate each other
1234 (because they clear fields of the same union),
1235 but the optimizer should catch that. */
1236 TYPE_SYMTAB_ADDRESS (t
) = 0;
1237 TYPE_SYMTAB_DIE (t
) = 0;
1239 /* Do not copy the values cache. */
1240 if (TYPE_CACHED_VALUES_P (t
))
1242 TYPE_CACHED_VALUES_P (t
) = 0;
1243 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1246 else if (code
== TARGET_OPTION_NODE
)
1248 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1249 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1250 sizeof (struct cl_target_option
));
1252 else if (code
== OPTIMIZATION_NODE
)
1254 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1255 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1256 sizeof (struct cl_optimization
));
1262 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1263 For example, this can copy a list made of TREE_LIST nodes. */
1266 copy_list (tree list
)
1274 head
= prev
= copy_node (list
);
1275 next
= TREE_CHAIN (list
);
1278 TREE_CHAIN (prev
) = copy_node (next
);
1279 prev
= TREE_CHAIN (prev
);
1280 next
= TREE_CHAIN (next
);
1286 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1287 INTEGER_CST with value CST and type TYPE. */
1290 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1292 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1293 /* We need extra HWIs if CST is an unsigned integer with its
1295 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1296 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1297 return cst
.get_len ();
1300 /* Return a new INTEGER_CST with value CST and type TYPE. */
1303 build_new_int_cst (tree type
, const wide_int
&cst
)
1305 unsigned int len
= cst
.get_len ();
1306 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1307 tree nt
= make_int_cst (len
, ext_len
);
1312 TREE_INT_CST_ELT (nt
, ext_len
)
1313 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1314 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1315 TREE_INT_CST_ELT (nt
, i
) = -1;
1317 else if (TYPE_UNSIGNED (type
)
1318 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1321 TREE_INT_CST_ELT (nt
, len
)
1322 = zext_hwi (cst
.elt (len
),
1323 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1326 for (unsigned int i
= 0; i
< len
; i
++)
1327 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1328 TREE_TYPE (nt
) = type
;
1332 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1335 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1338 size_t length
= sizeof (struct tree_poly_int_cst
);
1339 record_node_allocation_statistics (POLY_INT_CST
, length
);
1341 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1343 TREE_SET_CODE (t
, POLY_INT_CST
);
1344 TREE_CONSTANT (t
) = 1;
1345 TREE_TYPE (t
) = type
;
1346 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1347 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1351 /* Create a constant tree that contains CST sign-extended to TYPE. */
1354 build_int_cst (tree type
, poly_int64 cst
)
1356 /* Support legacy code. */
1358 type
= integer_type_node
;
1360 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1363 /* Create a constant tree that contains CST zero-extended to TYPE. */
1366 build_int_cstu (tree type
, poly_uint64 cst
)
1368 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1371 /* Create a constant tree that contains CST sign-extended to TYPE. */
1374 build_int_cst_type (tree type
, poly_int64 cst
)
1377 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1380 /* Constructs tree in type TYPE from with value given by CST. Signedness
1381 of CST is assumed to be the same as the signedness of TYPE. */
1384 double_int_to_tree (tree type
, double_int cst
)
1386 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1389 /* We force the wide_int CST to the range of the type TYPE by sign or
1390 zero extending it. OVERFLOWABLE indicates if we are interested in
1391 overflow of the value, when >0 we are only interested in signed
1392 overflow, for <0 we are interested in any overflow. OVERFLOWED
1393 indicates whether overflow has already occurred. CONST_OVERFLOWED
1394 indicates whether constant overflow has already occurred. We force
1395 T's value to be within range of T's type (by setting to 0 or 1 all
1396 the bits outside the type's range). We set TREE_OVERFLOWED if,
1397 OVERFLOWED is nonzero,
1398 or OVERFLOWABLE is >0 and signed overflow occurs
1399 or OVERFLOWABLE is <0 and any overflow occurs
1400 We return a new tree node for the extended wide_int. The node
1401 is shared if no overflow flags are set. */
1405 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1406 int overflowable
, bool overflowed
)
1408 signop sign
= TYPE_SIGN (type
);
1410 /* If we need to set overflow flags, return a new unshared node. */
1411 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1415 || (overflowable
> 0 && sign
== SIGNED
))
1417 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1420 if (tmp
.is_constant ())
1421 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1424 tree coeffs
[NUM_POLY_INT_COEFFS
];
1425 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1427 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1428 TREE_OVERFLOW (coeffs
[i
]) = 1;
1430 t
= build_new_poly_int_cst (type
, coeffs
);
1432 TREE_OVERFLOW (t
) = 1;
1437 /* Else build a shared node. */
1438 return wide_int_to_tree (type
, cst
);
1441 /* These are the hash table functions for the hash table of INTEGER_CST
1442 nodes of a sizetype. */
1444 /* Return the hash code X, an INTEGER_CST. */
1447 int_cst_hasher::hash (tree x
)
1449 const_tree
const t
= x
;
1450 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1453 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1454 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1459 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1460 is the same as that given by *Y, which is the same. */
1463 int_cst_hasher::equal (tree x
, tree y
)
1465 const_tree
const xt
= x
;
1466 const_tree
const yt
= y
;
1468 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1469 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1470 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1473 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1474 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1480 /* Create an INT_CST node of TYPE and value CST.
1481 The returned node is always shared. For small integers we use a
1482 per-type vector cache, for larger ones we use a single hash table.
1483 The value is extended from its precision according to the sign of
1484 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1485 the upper bits and ensures that hashing and value equality based
1486 upon the underlying HOST_WIDE_INTs works without masking. */
1489 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1496 unsigned int prec
= TYPE_PRECISION (type
);
1497 signop sgn
= TYPE_SIGN (type
);
1499 /* Verify that everything is canonical. */
1500 int l
= pcst
.get_len ();
1503 if (pcst
.elt (l
- 1) == 0)
1504 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1505 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1506 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1509 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1510 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1514 /* We just need to store a single HOST_WIDE_INT. */
1516 if (TYPE_UNSIGNED (type
))
1517 hwi
= cst
.to_uhwi ();
1519 hwi
= cst
.to_shwi ();
1521 switch (TREE_CODE (type
))
1524 gcc_assert (hwi
== 0);
1528 case REFERENCE_TYPE
:
1529 case POINTER_BOUNDS_TYPE
:
1530 /* Cache NULL pointer and zero bounds. */
1539 /* Cache false or true. */
1541 if (IN_RANGE (hwi
, 0, 1))
1547 if (TYPE_SIGN (type
) == UNSIGNED
)
1550 limit
= INTEGER_SHARE_LIMIT
;
1551 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1556 /* Cache [-1, N). */
1557 limit
= INTEGER_SHARE_LIMIT
+ 1;
1558 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1572 /* Look for it in the type's vector of small shared ints. */
1573 if (!TYPE_CACHED_VALUES_P (type
))
1575 TYPE_CACHED_VALUES_P (type
) = 1;
1576 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1579 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1581 /* Make sure no one is clobbering the shared constant. */
1582 gcc_checking_assert (TREE_TYPE (t
) == type
1583 && TREE_INT_CST_NUNITS (t
) == 1
1584 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1585 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1586 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1589 /* Create a new shared int. */
1590 t
= build_new_int_cst (type
, cst
);
1591 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1596 /* Use the cache of larger shared ints, using int_cst_node as
1599 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1600 TREE_TYPE (int_cst_node
) = type
;
1602 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1606 /* Insert this one into the hash table. */
1609 /* Make a new node for next time round. */
1610 int_cst_node
= make_int_cst (1, 1);
1616 /* The value either hashes properly or we drop it on the floor
1617 for the gc to take care of. There will not be enough of them
1620 tree nt
= build_new_int_cst (type
, cst
);
1621 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1625 /* Insert this one into the hash table. */
1637 poly_int_cst_hasher::hash (tree t
)
1639 inchash::hash hstate
;
1641 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1642 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1643 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1645 return hstate
.end ();
1649 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1651 if (TREE_TYPE (x
) != y
.first
)
1653 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1654 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1659 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1660 The elements must also have type TYPE. */
1663 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1665 unsigned int prec
= TYPE_PRECISION (type
);
1666 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1667 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1670 h
.add_int (TYPE_UID (type
));
1671 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1672 h
.add_wide_int (c
.coeffs
[i
]);
1673 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1674 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1676 if (*slot
== NULL_TREE
)
1678 tree coeffs
[NUM_POLY_INT_COEFFS
];
1679 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1680 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1681 *slot
= build_new_poly_int_cst (type
, coeffs
);
1686 /* Create a constant tree with value VALUE in type TYPE. */
1689 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1691 if (value
.is_constant ())
1692 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1693 return build_poly_int_cst (type
, value
);
1697 cache_integer_cst (tree t
)
1699 tree type
= TREE_TYPE (t
);
1702 int prec
= TYPE_PRECISION (type
);
1704 gcc_assert (!TREE_OVERFLOW (t
));
1706 switch (TREE_CODE (type
))
1709 gcc_assert (integer_zerop (t
));
1713 case REFERENCE_TYPE
:
1714 /* Cache NULL pointer. */
1715 if (integer_zerop (t
))
1723 /* Cache false or true. */
1725 if (wi::ltu_p (wi::to_wide (t
), 2))
1726 ix
= TREE_INT_CST_ELT (t
, 0);
1731 if (TYPE_UNSIGNED (type
))
1734 limit
= INTEGER_SHARE_LIMIT
;
1736 /* This is a little hokie, but if the prec is smaller than
1737 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1738 obvious test will not get the correct answer. */
1739 if (prec
< HOST_BITS_PER_WIDE_INT
)
1741 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1742 ix
= tree_to_uhwi (t
);
1744 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1745 ix
= tree_to_uhwi (t
);
1750 limit
= INTEGER_SHARE_LIMIT
+ 1;
1752 if (integer_minus_onep (t
))
1754 else if (!wi::neg_p (wi::to_wide (t
)))
1756 if (prec
< HOST_BITS_PER_WIDE_INT
)
1758 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1759 ix
= tree_to_shwi (t
) + 1;
1761 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1762 ix
= tree_to_shwi (t
) + 1;
1776 /* Look for it in the type's vector of small shared ints. */
1777 if (!TYPE_CACHED_VALUES_P (type
))
1779 TYPE_CACHED_VALUES_P (type
) = 1;
1780 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1783 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1784 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1788 /* Use the cache of larger shared ints. */
1789 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1790 /* If there is already an entry for the number verify it's the
1793 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1795 /* Otherwise insert this one into the hash table. */
1801 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1802 and the rest are zeros. */
1805 build_low_bits_mask (tree type
, unsigned bits
)
1807 gcc_assert (bits
<= TYPE_PRECISION (type
));
1809 return wide_int_to_tree (type
, wi::mask (bits
, false,
1810 TYPE_PRECISION (type
)));
1813 /* Checks that X is integer constant that can be expressed in (unsigned)
1814 HOST_WIDE_INT without loss of precision. */
1817 cst_and_fits_in_hwi (const_tree x
)
1819 return (TREE_CODE (x
) == INTEGER_CST
1820 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1823 /* Build a newly constructed VECTOR_CST with the given values of
1824 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1827 make_vector (unsigned log2_npatterns
,
1828 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1830 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1832 unsigned npatterns
= 1 << log2_npatterns
;
1833 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1834 unsigned length
= (sizeof (struct tree_vector
)
1835 + (encoded_nelts
- 1) * sizeof (tree
));
1837 record_node_allocation_statistics (VECTOR_CST
, length
);
1839 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1841 TREE_SET_CODE (t
, VECTOR_CST
);
1842 TREE_CONSTANT (t
) = 1;
1843 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1844 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1849 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1850 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1853 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1855 unsigned HOST_WIDE_INT idx
, nelts
;
1858 /* We can't construct a VECTOR_CST for a variable number of elements. */
1859 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1860 tree_vector_builder
vec (type
, nelts
, 1);
1861 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1863 if (TREE_CODE (value
) == VECTOR_CST
)
1865 /* If NELTS is constant then this must be too. */
1866 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1867 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1868 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1871 vec
.quick_push (value
);
1873 while (vec
.length () < nelts
)
1874 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1876 return vec
.build ();
1879 /* Build a vector of type VECTYPE where all the elements are SCs. */
1881 build_vector_from_val (tree vectype
, tree sc
)
1883 unsigned HOST_WIDE_INT i
, nunits
;
1885 if (sc
== error_mark_node
)
1888 /* Verify that the vector type is suitable for SC. Note that there
1889 is some inconsistency in the type-system with respect to restrict
1890 qualifications of pointers. Vector types always have a main-variant
1891 element type and the qualification is applied to the vector-type.
1892 So TREE_TYPE (vector-type) does not return a properly qualified
1893 vector element-type. */
1894 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1895 TREE_TYPE (vectype
)));
1897 if (CONSTANT_CLASS_P (sc
))
1899 tree_vector_builder
v (vectype
, 1, 1);
1903 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1904 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1907 vec
<constructor_elt
, va_gc
> *v
;
1908 vec_alloc (v
, nunits
);
1909 for (i
= 0; i
< nunits
; ++i
)
1910 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1911 return build_constructor (vectype
, v
);
1915 /* Build a vector series of type TYPE in which element I has the value
1916 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1917 and a VEC_SERIES_EXPR otherwise. */
1920 build_vec_series (tree type
, tree base
, tree step
)
1922 if (integer_zerop (step
))
1923 return build_vector_from_val (type
, base
);
1924 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1926 tree_vector_builder
builder (type
, 1, 3);
1927 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1928 wi::to_wide (base
) + wi::to_wide (step
));
1929 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1930 wi::to_wide (elt1
) + wi::to_wide (step
));
1931 builder
.quick_push (base
);
1932 builder
.quick_push (elt1
);
1933 builder
.quick_push (elt2
);
1934 return builder
.build ();
1936 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1939 /* Return a vector with the same number of units and number of bits
1940 as VEC_TYPE, but in which the elements are a linear series of unsigned
1941 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1944 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1946 tree index_vec_type
= vec_type
;
1947 tree index_elt_type
= TREE_TYPE (vec_type
);
1948 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1949 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1951 index_elt_type
= build_nonstandard_integer_type
1952 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1953 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1956 tree_vector_builder
v (index_vec_type
, 1, 3);
1957 for (unsigned int i
= 0; i
< 3; ++i
)
1958 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1962 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1963 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1966 recompute_constructor_flags (tree c
)
1970 bool constant_p
= true;
1971 bool side_effects_p
= false;
1972 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1974 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1976 /* Mostly ctors will have elts that don't have side-effects, so
1977 the usual case is to scan all the elements. Hence a single
1978 loop for both const and side effects, rather than one loop
1979 each (with early outs). */
1980 if (!TREE_CONSTANT (val
))
1982 if (TREE_SIDE_EFFECTS (val
))
1983 side_effects_p
= true;
1986 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1987 TREE_CONSTANT (c
) = constant_p
;
1990 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1994 verify_constructor_flags (tree c
)
1998 bool constant_p
= TREE_CONSTANT (c
);
1999 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2000 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2002 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2004 if (constant_p
&& !TREE_CONSTANT (val
))
2005 internal_error ("non-constant element in constant CONSTRUCTOR");
2006 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2007 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2011 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2012 are in the vec pointed to by VALS. */
2014 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
2016 tree c
= make_node (CONSTRUCTOR
);
2018 TREE_TYPE (c
) = type
;
2019 CONSTRUCTOR_ELTS (c
) = vals
;
2021 recompute_constructor_flags (c
);
2026 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2029 build_constructor_single (tree type
, tree index
, tree value
)
2031 vec
<constructor_elt
, va_gc
> *v
;
2032 constructor_elt elt
= {index
, value
};
2035 v
->quick_push (elt
);
2037 return build_constructor (type
, v
);
2041 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2042 are in a list pointed to by VALS. */
2044 build_constructor_from_list (tree type
, tree vals
)
2047 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2051 vec_alloc (v
, list_length (vals
));
2052 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2053 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2056 return build_constructor (type
, v
);
2059 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2060 of elements, provided as index/value pairs. */
2063 build_constructor_va (tree type
, int nelts
, ...)
2065 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2068 va_start (p
, nelts
);
2069 vec_alloc (v
, nelts
);
2072 tree index
= va_arg (p
, tree
);
2073 tree value
= va_arg (p
, tree
);
2074 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2077 return build_constructor (type
, v
);
2080 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2083 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2086 FIXED_VALUE_TYPE
*fp
;
2088 v
= make_node (FIXED_CST
);
2089 fp
= ggc_alloc
<fixed_value
> ();
2090 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2092 TREE_TYPE (v
) = type
;
2093 TREE_FIXED_CST_PTR (v
) = fp
;
2097 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2100 build_real (tree type
, REAL_VALUE_TYPE d
)
2103 REAL_VALUE_TYPE
*dp
;
2106 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2107 Consider doing it via real_convert now. */
2109 v
= make_node (REAL_CST
);
2110 dp
= ggc_alloc
<real_value
> ();
2111 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2113 TREE_TYPE (v
) = type
;
2114 TREE_REAL_CST_PTR (v
) = dp
;
2115 TREE_OVERFLOW (v
) = overflow
;
2119 /* Like build_real, but first truncate D to the type. */
2122 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2124 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2127 /* Return a new REAL_CST node whose type is TYPE
2128 and whose value is the integer value of the INTEGER_CST node I. */
2131 real_value_from_int_cst (const_tree type
, const_tree i
)
2135 /* Clear all bits of the real value type so that we can later do
2136 bitwise comparisons to see if two values are the same. */
2137 memset (&d
, 0, sizeof d
);
2139 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2140 TYPE_SIGN (TREE_TYPE (i
)));
2144 /* Given a tree representing an integer constant I, return a tree
2145 representing the same value as a floating-point constant of type TYPE. */
2148 build_real_from_int_cst (tree type
, const_tree i
)
2151 int overflow
= TREE_OVERFLOW (i
);
2153 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2155 TREE_OVERFLOW (v
) |= overflow
;
2159 /* Return a newly constructed STRING_CST node whose value is
2160 the LEN characters at STR.
2161 Note that for a C string literal, LEN should include the trailing NUL.
2162 The TREE_TYPE is not initialized. */
2165 build_string (int len
, const char *str
)
2170 /* Do not waste bytes provided by padding of struct tree_string. */
2171 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2173 record_node_allocation_statistics (STRING_CST
, length
);
2175 s
= (tree
) ggc_internal_alloc (length
);
2177 memset (s
, 0, sizeof (struct tree_typed
));
2178 TREE_SET_CODE (s
, STRING_CST
);
2179 TREE_CONSTANT (s
) = 1;
2180 TREE_STRING_LENGTH (s
) = len
;
2181 memcpy (s
->string
.str
, str
, len
);
2182 s
->string
.str
[len
] = '\0';
2187 /* Return a newly constructed COMPLEX_CST node whose value is
2188 specified by the real and imaginary parts REAL and IMAG.
2189 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2190 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2193 build_complex (tree type
, tree real
, tree imag
)
2195 tree t
= make_node (COMPLEX_CST
);
2197 TREE_REALPART (t
) = real
;
2198 TREE_IMAGPART (t
) = imag
;
2199 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2200 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2204 /* Build a complex (inf +- 0i), such as for the result of cproj.
2205 TYPE is the complex tree type of the result. If NEG is true, the
2206 imaginary zero is negative. */
2209 build_complex_inf (tree type
, bool neg
)
2211 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2215 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2216 build_real (TREE_TYPE (type
), rzero
));
2219 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2220 element is set to 1. In particular, this is 1 + i for complex types. */
2223 build_each_one_cst (tree type
)
2225 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2227 tree scalar
= build_one_cst (TREE_TYPE (type
));
2228 return build_complex (type
, scalar
, scalar
);
2231 return build_one_cst (type
);
2234 /* Return a constant of arithmetic type TYPE which is the
2235 multiplicative identity of the set TYPE. */
2238 build_one_cst (tree type
)
2240 switch (TREE_CODE (type
))
2242 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2243 case POINTER_TYPE
: case REFERENCE_TYPE
:
2245 return build_int_cst (type
, 1);
2248 return build_real (type
, dconst1
);
2250 case FIXED_POINT_TYPE
:
2251 /* We can only generate 1 for accum types. */
2252 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2253 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2257 tree scalar
= build_one_cst (TREE_TYPE (type
));
2259 return build_vector_from_val (type
, scalar
);
2263 return build_complex (type
,
2264 build_one_cst (TREE_TYPE (type
)),
2265 build_zero_cst (TREE_TYPE (type
)));
2272 /* Return an integer of type TYPE containing all 1's in as much precision as
2273 it contains, or a complex or vector whose subparts are such integers. */
2276 build_all_ones_cst (tree type
)
2278 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2280 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2281 return build_complex (type
, scalar
, scalar
);
2284 return build_minus_one_cst (type
);
2287 /* Return a constant of arithmetic type TYPE which is the
2288 opposite of the multiplicative identity of the set TYPE. */
2291 build_minus_one_cst (tree type
)
2293 switch (TREE_CODE (type
))
2295 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2296 case POINTER_TYPE
: case REFERENCE_TYPE
:
2298 return build_int_cst (type
, -1);
2301 return build_real (type
, dconstm1
);
2303 case FIXED_POINT_TYPE
:
2304 /* We can only generate 1 for accum types. */
2305 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2306 return build_fixed (type
,
2307 fixed_from_double_int (double_int_minus_one
,
2308 SCALAR_TYPE_MODE (type
)));
2312 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2314 return build_vector_from_val (type
, scalar
);
2318 return build_complex (type
,
2319 build_minus_one_cst (TREE_TYPE (type
)),
2320 build_zero_cst (TREE_TYPE (type
)));
2327 /* Build 0 constant of type TYPE. This is used by constructor folding
2328 and thus the constant should be represented in memory by
2332 build_zero_cst (tree type
)
2334 switch (TREE_CODE (type
))
2336 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2337 case POINTER_TYPE
: case REFERENCE_TYPE
:
2338 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2339 return build_int_cst (type
, 0);
2342 return build_real (type
, dconst0
);
2344 case FIXED_POINT_TYPE
:
2345 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2349 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2351 return build_vector_from_val (type
, scalar
);
2356 tree zero
= build_zero_cst (TREE_TYPE (type
));
2358 return build_complex (type
, zero
, zero
);
2362 if (!AGGREGATE_TYPE_P (type
))
2363 return fold_convert (type
, integer_zero_node
);
2364 return build_constructor (type
, NULL
);
2369 /* Build a BINFO with LEN language slots. */
2372 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2375 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2376 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2378 record_node_allocation_statistics (TREE_BINFO
, length
);
2380 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2382 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2384 TREE_SET_CODE (t
, TREE_BINFO
);
2386 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2391 /* Create a CASE_LABEL_EXPR tree node and return it. */
2394 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2396 tree t
= make_node (CASE_LABEL_EXPR
);
2398 TREE_TYPE (t
) = void_type_node
;
2399 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2401 CASE_LOW (t
) = low_value
;
2402 CASE_HIGH (t
) = high_value
;
2403 CASE_LABEL (t
) = label_decl
;
2404 CASE_CHAIN (t
) = NULL_TREE
;
2409 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2410 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2411 The latter determines the length of the HOST_WIDE_INT vector. */
2414 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2417 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2418 + sizeof (struct tree_int_cst
));
2421 record_node_allocation_statistics (INTEGER_CST
, length
);
2423 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2425 TREE_SET_CODE (t
, INTEGER_CST
);
2426 TREE_INT_CST_NUNITS (t
) = len
;
2427 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2428 /* to_offset can only be applied to trees that are offset_int-sized
2429 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2430 must be exactly the precision of offset_int and so LEN is correct. */
2431 if (ext_len
<= OFFSET_INT_ELTS
)
2432 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2434 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2436 TREE_CONSTANT (t
) = 1;
2441 /* Build a newly constructed TREE_VEC node of length LEN. */
2444 make_tree_vec (int len MEM_STAT_DECL
)
2447 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2449 record_node_allocation_statistics (TREE_VEC
, length
);
2451 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2453 TREE_SET_CODE (t
, TREE_VEC
);
2454 TREE_VEC_LENGTH (t
) = len
;
2459 /* Grow a TREE_VEC node to new length LEN. */
2462 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2464 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2466 int oldlen
= TREE_VEC_LENGTH (v
);
2467 gcc_assert (len
> oldlen
);
2469 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2470 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2472 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2474 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2476 TREE_VEC_LENGTH (v
) = len
;
2481 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2482 fixed, and scalar, complex or vector. */
2485 zerop (const_tree expr
)
2487 return (integer_zerop (expr
)
2488 || real_zerop (expr
)
2489 || fixed_zerop (expr
));
2492 /* Return 1 if EXPR is the integer constant zero or a complex constant
2496 integer_zerop (const_tree expr
)
2498 switch (TREE_CODE (expr
))
2501 return wi::to_wide (expr
) == 0;
2503 return (integer_zerop (TREE_REALPART (expr
))
2504 && integer_zerop (TREE_IMAGPART (expr
)));
2506 return (VECTOR_CST_NPATTERNS (expr
) == 1
2507 && VECTOR_CST_DUPLICATE_P (expr
)
2508 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2514 /* Return 1 if EXPR is the integer constant one or the corresponding
2515 complex constant. */
2518 integer_onep (const_tree expr
)
2520 switch (TREE_CODE (expr
))
2523 return wi::eq_p (wi::to_widest (expr
), 1);
2525 return (integer_onep (TREE_REALPART (expr
))
2526 && integer_zerop (TREE_IMAGPART (expr
)));
2528 return (VECTOR_CST_NPATTERNS (expr
) == 1
2529 && VECTOR_CST_DUPLICATE_P (expr
)
2530 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2536 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2537 return 1 if every piece is the integer constant one. */
2540 integer_each_onep (const_tree expr
)
2542 if (TREE_CODE (expr
) == COMPLEX_CST
)
2543 return (integer_onep (TREE_REALPART (expr
))
2544 && integer_onep (TREE_IMAGPART (expr
)));
2546 return integer_onep (expr
);
2549 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2550 it contains, or a complex or vector whose subparts are such integers. */
2553 integer_all_onesp (const_tree expr
)
2555 if (TREE_CODE (expr
) == COMPLEX_CST
2556 && integer_all_onesp (TREE_REALPART (expr
))
2557 && integer_all_onesp (TREE_IMAGPART (expr
)))
2560 else if (TREE_CODE (expr
) == VECTOR_CST
)
2561 return (VECTOR_CST_NPATTERNS (expr
) == 1
2562 && VECTOR_CST_DUPLICATE_P (expr
)
2563 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2565 else if (TREE_CODE (expr
) != INTEGER_CST
)
2568 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2569 == wi::to_wide (expr
));
2572 /* Return 1 if EXPR is the integer constant minus one. */
2575 integer_minus_onep (const_tree expr
)
2577 if (TREE_CODE (expr
) == COMPLEX_CST
)
2578 return (integer_all_onesp (TREE_REALPART (expr
))
2579 && integer_zerop (TREE_IMAGPART (expr
)));
2581 return integer_all_onesp (expr
);
2584 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2588 integer_pow2p (const_tree expr
)
2590 if (TREE_CODE (expr
) == COMPLEX_CST
2591 && integer_pow2p (TREE_REALPART (expr
))
2592 && integer_zerop (TREE_IMAGPART (expr
)))
2595 if (TREE_CODE (expr
) != INTEGER_CST
)
2598 return wi::popcount (wi::to_wide (expr
)) == 1;
2601 /* Return 1 if EXPR is an integer constant other than zero or a
2602 complex constant other than zero. */
2605 integer_nonzerop (const_tree expr
)
2607 return ((TREE_CODE (expr
) == INTEGER_CST
2608 && wi::to_wide (expr
) != 0)
2609 || (TREE_CODE (expr
) == COMPLEX_CST
2610 && (integer_nonzerop (TREE_REALPART (expr
))
2611 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2614 /* Return 1 if EXPR is the integer constant one. For vector,
2615 return 1 if every piece is the integer constant minus one
2616 (representing the value TRUE). */
2619 integer_truep (const_tree expr
)
2621 if (TREE_CODE (expr
) == VECTOR_CST
)
2622 return integer_all_onesp (expr
);
2623 return integer_onep (expr
);
2626 /* Return 1 if EXPR is the fixed-point constant zero. */
2629 fixed_zerop (const_tree expr
)
2631 return (TREE_CODE (expr
) == FIXED_CST
2632 && TREE_FIXED_CST (expr
).data
.is_zero ());
2635 /* Return the power of two represented by a tree node known to be a
2639 tree_log2 (const_tree expr
)
2641 if (TREE_CODE (expr
) == COMPLEX_CST
)
2642 return tree_log2 (TREE_REALPART (expr
));
2644 return wi::exact_log2 (wi::to_wide (expr
));
2647 /* Similar, but return the largest integer Y such that 2 ** Y is less
2648 than or equal to EXPR. */
2651 tree_floor_log2 (const_tree expr
)
2653 if (TREE_CODE (expr
) == COMPLEX_CST
)
2654 return tree_log2 (TREE_REALPART (expr
));
2656 return wi::floor_log2 (wi::to_wide (expr
));
2659 /* Return number of known trailing zero bits in EXPR, or, if the value of
2660 EXPR is known to be zero, the precision of it's type. */
2663 tree_ctz (const_tree expr
)
2665 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2666 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2669 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2670 switch (TREE_CODE (expr
))
2673 ret1
= wi::ctz (wi::to_wide (expr
));
2674 return MIN (ret1
, prec
);
2676 ret1
= wi::ctz (get_nonzero_bits (expr
));
2677 return MIN (ret1
, prec
);
2684 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2687 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2688 return MIN (ret1
, ret2
);
2689 case POINTER_PLUS_EXPR
:
2690 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2691 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2692 /* Second operand is sizetype, which could be in theory
2693 wider than pointer's precision. Make sure we never
2694 return more than prec. */
2695 ret2
= MIN (ret2
, prec
);
2696 return MIN (ret1
, ret2
);
2698 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2699 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2700 return MAX (ret1
, ret2
);
2702 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2703 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2704 return MIN (ret1
+ ret2
, prec
);
2706 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2707 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2708 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2710 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2711 return MIN (ret1
+ ret2
, prec
);
2715 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2716 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2718 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2719 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2724 case TRUNC_DIV_EXPR
:
2726 case FLOOR_DIV_EXPR
:
2727 case ROUND_DIV_EXPR
:
2728 case EXACT_DIV_EXPR
:
2729 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2730 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2732 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2735 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2743 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2744 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2746 return MIN (ret1
, prec
);
2748 return tree_ctz (TREE_OPERAND (expr
, 0));
2750 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2753 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2754 return MIN (ret1
, ret2
);
2756 return tree_ctz (TREE_OPERAND (expr
, 1));
2758 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2759 if (ret1
> BITS_PER_UNIT
)
2761 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2762 return MIN (ret1
, prec
);
2770 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2771 decimal float constants, so don't return 1 for them. */
2774 real_zerop (const_tree expr
)
2776 switch (TREE_CODE (expr
))
2779 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2780 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2782 return real_zerop (TREE_REALPART (expr
))
2783 && real_zerop (TREE_IMAGPART (expr
));
2786 /* Don't simply check for a duplicate because the predicate
2787 accepts both +0.0 and -0.0. */
2788 unsigned count
= vector_cst_encoded_nelts (expr
);
2789 for (unsigned int i
= 0; i
< count
; ++i
)
2790 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2799 /* Return 1 if EXPR is the real constant one in real or complex form.
2800 Trailing zeroes matter for decimal float constants, so don't return
2804 real_onep (const_tree expr
)
2806 switch (TREE_CODE (expr
))
2809 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2810 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2812 return real_onep (TREE_REALPART (expr
))
2813 && real_zerop (TREE_IMAGPART (expr
));
2815 return (VECTOR_CST_NPATTERNS (expr
) == 1
2816 && VECTOR_CST_DUPLICATE_P (expr
)
2817 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2823 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2824 matter for decimal float constants, so don't return 1 for them. */
2827 real_minus_onep (const_tree expr
)
2829 switch (TREE_CODE (expr
))
2832 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2833 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2835 return real_minus_onep (TREE_REALPART (expr
))
2836 && real_zerop (TREE_IMAGPART (expr
));
2838 return (VECTOR_CST_NPATTERNS (expr
) == 1
2839 && VECTOR_CST_DUPLICATE_P (expr
)
2840 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2846 /* Nonzero if EXP is a constant or a cast of a constant. */
2849 really_constant_p (const_tree exp
)
2851 /* This is not quite the same as STRIP_NOPS. It does more. */
2852 while (CONVERT_EXPR_P (exp
)
2853 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2854 exp
= TREE_OPERAND (exp
, 0);
2855 return TREE_CONSTANT (exp
);
2858 /* Return true if T holds a polynomial pointer difference, storing it in
2859 *VALUE if so. A true return means that T's precision is no greater
2860 than 64 bits, which is the largest address space we support, so *VALUE
2861 never loses precision. However, the signedness of the result does
2862 not necessarily match the signedness of T: sometimes an unsigned type
2863 like sizetype is used to encode a value that is actually negative. */
2866 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2870 if (TREE_CODE (t
) == INTEGER_CST
)
2872 if (!cst_and_fits_in_hwi (t
))
2874 *value
= int_cst_value (t
);
2877 if (POLY_INT_CST_P (t
))
2879 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2880 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2882 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2883 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2890 tree_to_poly_int64 (const_tree t
)
2892 gcc_assert (tree_fits_poly_int64_p (t
));
2893 if (POLY_INT_CST_P (t
))
2894 return poly_int_cst_value (t
).force_shwi ();
2895 return TREE_INT_CST_LOW (t
);
2899 tree_to_poly_uint64 (const_tree t
)
2901 gcc_assert (tree_fits_poly_uint64_p (t
));
2902 if (POLY_INT_CST_P (t
))
2903 return poly_int_cst_value (t
).force_uhwi ();
2904 return TREE_INT_CST_LOW (t
);
2907 /* Return first list element whose TREE_VALUE is ELEM.
2908 Return 0 if ELEM is not in LIST. */
2911 value_member (tree elem
, tree list
)
2915 if (elem
== TREE_VALUE (list
))
2917 list
= TREE_CHAIN (list
);
2922 /* Return first list element whose TREE_PURPOSE is ELEM.
2923 Return 0 if ELEM is not in LIST. */
2926 purpose_member (const_tree elem
, tree list
)
2930 if (elem
== TREE_PURPOSE (list
))
2932 list
= TREE_CHAIN (list
);
2937 /* Return true if ELEM is in V. */
2940 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2944 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2950 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2954 chain_index (int idx
, tree chain
)
2956 for (; chain
&& idx
> 0; --idx
)
2957 chain
= TREE_CHAIN (chain
);
2961 /* Return nonzero if ELEM is part of the chain CHAIN. */
2964 chain_member (const_tree elem
, const_tree chain
)
2970 chain
= DECL_CHAIN (chain
);
2976 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2977 We expect a null pointer to mark the end of the chain.
2978 This is the Lisp primitive `length'. */
2981 list_length (const_tree t
)
2984 #ifdef ENABLE_TREE_CHECKING
2992 #ifdef ENABLE_TREE_CHECKING
2995 gcc_assert (p
!= q
);
3003 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3004 UNION_TYPE TYPE, or NULL_TREE if none. */
3007 first_field (const_tree type
)
3009 tree t
= TYPE_FIELDS (type
);
3010 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3015 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3016 by modifying the last node in chain 1 to point to chain 2.
3017 This is the Lisp primitive `nconc'. */
3020 chainon (tree op1
, tree op2
)
3029 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3031 TREE_CHAIN (t1
) = op2
;
3033 #ifdef ENABLE_TREE_CHECKING
3036 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3037 gcc_assert (t2
!= t1
);
3044 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3047 tree_last (tree chain
)
3051 while ((next
= TREE_CHAIN (chain
)))
3056 /* Reverse the order of elements in the chain T,
3057 and return the new head of the chain (old last element). */
3062 tree prev
= 0, decl
, next
;
3063 for (decl
= t
; decl
; decl
= next
)
3065 /* We shouldn't be using this function to reverse BLOCK chains; we
3066 have blocks_nreverse for that. */
3067 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3068 next
= TREE_CHAIN (decl
);
3069 TREE_CHAIN (decl
) = prev
;
3075 /* Return a newly created TREE_LIST node whose
3076 purpose and value fields are PARM and VALUE. */
3079 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3081 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3082 TREE_PURPOSE (t
) = parm
;
3083 TREE_VALUE (t
) = value
;
3087 /* Build a chain of TREE_LIST nodes from a vector. */
3090 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3092 tree ret
= NULL_TREE
;
3096 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3098 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3099 pp
= &TREE_CHAIN (*pp
);
3104 /* Return a newly created TREE_LIST node whose
3105 purpose and value fields are PURPOSE and VALUE
3106 and whose TREE_CHAIN is CHAIN. */
3109 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3113 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3114 memset (node
, 0, sizeof (struct tree_common
));
3116 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3118 TREE_SET_CODE (node
, TREE_LIST
);
3119 TREE_CHAIN (node
) = chain
;
3120 TREE_PURPOSE (node
) = purpose
;
3121 TREE_VALUE (node
) = value
;
3125 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3129 ctor_to_vec (tree ctor
)
3131 vec
<tree
, va_gc
> *vec
;
3132 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3136 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3137 vec
->quick_push (val
);
3142 /* Return the size nominally occupied by an object of type TYPE
3143 when it resides in memory. The value is measured in units of bytes,
3144 and its data type is that normally used for type sizes
3145 (which is the first type created by make_signed_type or
3146 make_unsigned_type). */
3149 size_in_bytes_loc (location_t loc
, const_tree type
)
3153 if (type
== error_mark_node
)
3154 return integer_zero_node
;
3156 type
= TYPE_MAIN_VARIANT (type
);
3157 t
= TYPE_SIZE_UNIT (type
);
3161 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3162 return size_zero_node
;
3168 /* Return the size of TYPE (in bytes) as a wide integer
3169 or return -1 if the size can vary or is larger than an integer. */
3172 int_size_in_bytes (const_tree type
)
3176 if (type
== error_mark_node
)
3179 type
= TYPE_MAIN_VARIANT (type
);
3180 t
= TYPE_SIZE_UNIT (type
);
3182 if (t
&& tree_fits_uhwi_p (t
))
3183 return TREE_INT_CST_LOW (t
);
3188 /* Return the maximum size of TYPE (in bytes) as a wide integer
3189 or return -1 if the size can vary or is larger than an integer. */
3192 max_int_size_in_bytes (const_tree type
)
3194 HOST_WIDE_INT size
= -1;
3197 /* If this is an array type, check for a possible MAX_SIZE attached. */
3199 if (TREE_CODE (type
) == ARRAY_TYPE
)
3201 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3203 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3204 size
= tree_to_uhwi (size_tree
);
3207 /* If we still haven't been able to get a size, see if the language
3208 can compute a maximum size. */
3212 size_tree
= lang_hooks
.types
.max_size (type
);
3214 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3215 size
= tree_to_uhwi (size_tree
);
3221 /* Return the bit position of FIELD, in bits from the start of the record.
3222 This is a tree of type bitsizetype. */
3225 bit_position (const_tree field
)
3227 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3228 DECL_FIELD_BIT_OFFSET (field
));
3231 /* Return the byte position of FIELD, in bytes from the start of the record.
3232 This is a tree of type sizetype. */
3235 byte_position (const_tree field
)
3237 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3238 DECL_FIELD_BIT_OFFSET (field
));
3241 /* Likewise, but return as an integer. It must be representable in
3242 that way (since it could be a signed value, we don't have the
3243 option of returning -1 like int_size_in_byte can. */
3246 int_byte_position (const_tree field
)
3248 return tree_to_shwi (byte_position (field
));
3251 /* Return the strictest alignment, in bits, that T is known to have. */
3254 expr_align (const_tree t
)
3256 unsigned int align0
, align1
;
3258 switch (TREE_CODE (t
))
3260 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3261 /* If we have conversions, we know that the alignment of the
3262 object must meet each of the alignments of the types. */
3263 align0
= expr_align (TREE_OPERAND (t
, 0));
3264 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3265 return MAX (align0
, align1
);
3267 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3268 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3269 case CLEANUP_POINT_EXPR
:
3270 /* These don't change the alignment of an object. */
3271 return expr_align (TREE_OPERAND (t
, 0));
3274 /* The best we can do is say that the alignment is the least aligned
3276 align0
= expr_align (TREE_OPERAND (t
, 1));
3277 align1
= expr_align (TREE_OPERAND (t
, 2));
3278 return MIN (align0
, align1
);
3280 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3281 meaningfully, it's always 1. */
3282 case LABEL_DECL
: case CONST_DECL
:
3283 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3285 gcc_assert (DECL_ALIGN (t
) != 0);
3286 return DECL_ALIGN (t
);
3292 /* Otherwise take the alignment from that of the type. */
3293 return TYPE_ALIGN (TREE_TYPE (t
));
3296 /* Return, as a tree node, the number of elements for TYPE (which is an
3297 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3300 array_type_nelts (const_tree type
)
3302 tree index_type
, min
, max
;
3304 /* If they did it with unspecified bounds, then we should have already
3305 given an error about it before we got here. */
3306 if (! TYPE_DOMAIN (type
))
3307 return error_mark_node
;
3309 index_type
= TYPE_DOMAIN (type
);
3310 min
= TYPE_MIN_VALUE (index_type
);
3311 max
= TYPE_MAX_VALUE (index_type
);
3313 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3315 return error_mark_node
;
3317 return (integer_zerop (min
)
3319 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3322 /* If arg is static -- a reference to an object in static storage -- then
3323 return the object. This is not the same as the C meaning of `static'.
3324 If arg isn't static, return NULL. */
3329 switch (TREE_CODE (arg
))
3332 /* Nested functions are static, even though taking their address will
3333 involve a trampoline as we unnest the nested function and create
3334 the trampoline on the tree level. */
3338 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3339 && ! DECL_THREAD_LOCAL_P (arg
)
3340 && ! DECL_DLLIMPORT_P (arg
)
3344 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3348 return TREE_STATIC (arg
) ? arg
: NULL
;
3355 /* If the thing being referenced is not a field, then it is
3356 something language specific. */
3357 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3359 /* If we are referencing a bitfield, we can't evaluate an
3360 ADDR_EXPR at compile time and so it isn't a constant. */
3361 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3364 return staticp (TREE_OPERAND (arg
, 0));
3370 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3373 case ARRAY_RANGE_REF
:
3374 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3375 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3376 return staticp (TREE_OPERAND (arg
, 0));
3380 case COMPOUND_LITERAL_EXPR
:
3381 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3391 /* Return whether OP is a DECL whose address is function-invariant. */
3394 decl_address_invariant_p (const_tree op
)
3396 /* The conditions below are slightly less strict than the one in
3399 switch (TREE_CODE (op
))
3408 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3409 || DECL_THREAD_LOCAL_P (op
)
3410 || DECL_CONTEXT (op
) == current_function_decl
3411 || decl_function_context (op
) == current_function_decl
)
3416 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3417 || decl_function_context (op
) == current_function_decl
)
3428 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3431 decl_address_ip_invariant_p (const_tree op
)
3433 /* The conditions below are slightly less strict than the one in
3436 switch (TREE_CODE (op
))
3444 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3445 && !DECL_DLLIMPORT_P (op
))
3446 || DECL_THREAD_LOCAL_P (op
))
3451 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3463 /* Return true if T is function-invariant (internal function, does
3464 not handle arithmetic; that's handled in skip_simple_arithmetic and
3465 tree_invariant_p). */
3468 tree_invariant_p_1 (tree t
)
3472 if (TREE_CONSTANT (t
)
3473 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3476 switch (TREE_CODE (t
))
3482 op
= TREE_OPERAND (t
, 0);
3483 while (handled_component_p (op
))
3485 switch (TREE_CODE (op
))
3488 case ARRAY_RANGE_REF
:
3489 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3490 || TREE_OPERAND (op
, 2) != NULL_TREE
3491 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3496 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3502 op
= TREE_OPERAND (op
, 0);
3505 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3514 /* Return true if T is function-invariant. */
3517 tree_invariant_p (tree t
)
3519 tree inner
= skip_simple_arithmetic (t
);
3520 return tree_invariant_p_1 (inner
);
3523 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3524 Do this to any expression which may be used in more than one place,
3525 but must be evaluated only once.
3527 Normally, expand_expr would reevaluate the expression each time.
3528 Calling save_expr produces something that is evaluated and recorded
3529 the first time expand_expr is called on it. Subsequent calls to
3530 expand_expr just reuse the recorded value.
3532 The call to expand_expr that generates code that actually computes
3533 the value is the first call *at compile time*. Subsequent calls
3534 *at compile time* generate code to use the saved value.
3535 This produces correct result provided that *at run time* control
3536 always flows through the insns made by the first expand_expr
3537 before reaching the other places where the save_expr was evaluated.
3538 You, the caller of save_expr, must make sure this is so.
3540 Constants, and certain read-only nodes, are returned with no
3541 SAVE_EXPR because that is safe. Expressions containing placeholders
3542 are not touched; see tree.def for an explanation of what these
3546 save_expr (tree expr
)
3550 /* If the tree evaluates to a constant, then we don't want to hide that
3551 fact (i.e. this allows further folding, and direct checks for constants).
3552 However, a read-only object that has side effects cannot be bypassed.
3553 Since it is no problem to reevaluate literals, we just return the
3555 inner
= skip_simple_arithmetic (expr
);
3556 if (TREE_CODE (inner
) == ERROR_MARK
)
3559 if (tree_invariant_p_1 (inner
))
3562 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3563 it means that the size or offset of some field of an object depends on
3564 the value within another field.
3566 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3567 and some variable since it would then need to be both evaluated once and
3568 evaluated more than once. Front-ends must assure this case cannot
3569 happen by surrounding any such subexpressions in their own SAVE_EXPR
3570 and forcing evaluation at the proper time. */
3571 if (contains_placeholder_p (inner
))
3574 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3576 /* This expression might be placed ahead of a jump to ensure that the
3577 value was computed on both sides of the jump. So make sure it isn't
3578 eliminated as dead. */
3579 TREE_SIDE_EFFECTS (expr
) = 1;
3583 /* Look inside EXPR into any simple arithmetic operations. Return the
3584 outermost non-arithmetic or non-invariant node. */
3587 skip_simple_arithmetic (tree expr
)
3589 /* We don't care about whether this can be used as an lvalue in this
3591 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3592 expr
= TREE_OPERAND (expr
, 0);
3594 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3595 a constant, it will be more efficient to not make another SAVE_EXPR since
3596 it will allow better simplification and GCSE will be able to merge the
3597 computations if they actually occur. */
3600 if (UNARY_CLASS_P (expr
))
3601 expr
= TREE_OPERAND (expr
, 0);
3602 else if (BINARY_CLASS_P (expr
))
3604 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3605 expr
= TREE_OPERAND (expr
, 0);
3606 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3607 expr
= TREE_OPERAND (expr
, 1);
3618 /* Look inside EXPR into simple arithmetic operations involving constants.
3619 Return the outermost non-arithmetic or non-constant node. */
3622 skip_simple_constant_arithmetic (tree expr
)
3624 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3625 expr
= TREE_OPERAND (expr
, 0);
3629 if (UNARY_CLASS_P (expr
))
3630 expr
= TREE_OPERAND (expr
, 0);
3631 else if (BINARY_CLASS_P (expr
))
3633 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3634 expr
= TREE_OPERAND (expr
, 0);
3635 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3636 expr
= TREE_OPERAND (expr
, 1);
3647 /* Return which tree structure is used by T. */
3649 enum tree_node_structure_enum
3650 tree_node_structure (const_tree t
)
3652 const enum tree_code code
= TREE_CODE (t
);
3653 return tree_node_structure_for_code (code
);
3656 /* Set various status flags when building a CALL_EXPR object T. */
3659 process_call_operands (tree t
)
3661 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3662 bool read_only
= false;
3663 int i
= call_expr_flags (t
);
3665 /* Calls have side-effects, except those to const or pure functions. */
3666 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3667 side_effects
= true;
3668 /* Propagate TREE_READONLY of arguments for const functions. */
3672 if (!side_effects
|| read_only
)
3673 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3675 tree op
= TREE_OPERAND (t
, i
);
3676 if (op
&& TREE_SIDE_EFFECTS (op
))
3677 side_effects
= true;
3678 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3682 TREE_SIDE_EFFECTS (t
) = side_effects
;
3683 TREE_READONLY (t
) = read_only
;
3686 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3687 size or offset that depends on a field within a record. */
3690 contains_placeholder_p (const_tree exp
)
3692 enum tree_code code
;
3697 code
= TREE_CODE (exp
);
3698 if (code
== PLACEHOLDER_EXPR
)
3701 switch (TREE_CODE_CLASS (code
))
3704 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3705 position computations since they will be converted into a
3706 WITH_RECORD_EXPR involving the reference, which will assume
3707 here will be valid. */
3708 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3710 case tcc_exceptional
:
3711 if (code
== TREE_LIST
)
3712 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3713 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3718 case tcc_comparison
:
3719 case tcc_expression
:
3723 /* Ignoring the first operand isn't quite right, but works best. */
3724 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3727 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3728 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3729 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3732 /* The save_expr function never wraps anything containing
3733 a PLACEHOLDER_EXPR. */
3740 switch (TREE_CODE_LENGTH (code
))
3743 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3745 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3746 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3757 const_call_expr_arg_iterator iter
;
3758 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3759 if (CONTAINS_PLACEHOLDER_P (arg
))
3773 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3774 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3778 type_contains_placeholder_1 (const_tree type
)
3780 /* If the size contains a placeholder or the parent type (component type in
3781 the case of arrays) type involves a placeholder, this type does. */
3782 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3783 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3784 || (!POINTER_TYPE_P (type
)
3786 && type_contains_placeholder_p (TREE_TYPE (type
))))
3789 /* Now do type-specific checks. Note that the last part of the check above
3790 greatly limits what we have to do below. */
3791 switch (TREE_CODE (type
))
3794 case POINTER_BOUNDS_TYPE
:
3800 case REFERENCE_TYPE
:
3809 case FIXED_POINT_TYPE
:
3810 /* Here we just check the bounds. */
3811 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3812 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3815 /* We have already checked the component type above, so just check
3816 the domain type. Flexible array members have a null domain. */
3817 return TYPE_DOMAIN (type
) ?
3818 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3822 case QUAL_UNION_TYPE
:
3826 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3827 if (TREE_CODE (field
) == FIELD_DECL
3828 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3829 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3830 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3831 || type_contains_placeholder_p (TREE_TYPE (field
))))
3842 /* Wrapper around above function used to cache its result. */
3845 type_contains_placeholder_p (tree type
)
3849 /* If the contains_placeholder_bits field has been initialized,
3850 then we know the answer. */
3851 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3852 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3854 /* Indicate that we've seen this type node, and the answer is false.
3855 This is what we want to return if we run into recursion via fields. */
3856 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3858 /* Compute the real value. */
3859 result
= type_contains_placeholder_1 (type
);
3861 /* Store the real value. */
3862 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3867 /* Push tree EXP onto vector QUEUE if it is not already present. */
3870 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3875 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3876 if (simple_cst_equal (iter
, exp
) == 1)
3880 queue
->safe_push (exp
);
3883 /* Given a tree EXP, find all occurrences of references to fields
3884 in a PLACEHOLDER_EXPR and place them in vector REFS without
3885 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3886 we assume here that EXP contains only arithmetic expressions
3887 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3891 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3893 enum tree_code code
= TREE_CODE (exp
);
3897 /* We handle TREE_LIST and COMPONENT_REF separately. */
3898 if (code
== TREE_LIST
)
3900 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3901 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3903 else if (code
== COMPONENT_REF
)
3905 for (inner
= TREE_OPERAND (exp
, 0);
3906 REFERENCE_CLASS_P (inner
);
3907 inner
= TREE_OPERAND (inner
, 0))
3910 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3911 push_without_duplicates (exp
, refs
);
3913 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3916 switch (TREE_CODE_CLASS (code
))
3921 case tcc_declaration
:
3922 /* Variables allocated to static storage can stay. */
3923 if (!TREE_STATIC (exp
))
3924 push_without_duplicates (exp
, refs
);
3927 case tcc_expression
:
3928 /* This is the pattern built in ada/make_aligning_type. */
3929 if (code
== ADDR_EXPR
3930 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3932 push_without_duplicates (exp
, refs
);
3938 case tcc_exceptional
:
3941 case tcc_comparison
:
3943 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3944 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3948 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3949 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3957 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3958 return a tree with all occurrences of references to F in a
3959 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3960 CONST_DECLs. Note that we assume here that EXP contains only
3961 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3962 occurring only in their argument list. */
3965 substitute_in_expr (tree exp
, tree f
, tree r
)
3967 enum tree_code code
= TREE_CODE (exp
);
3968 tree op0
, op1
, op2
, op3
;
3971 /* We handle TREE_LIST and COMPONENT_REF separately. */
3972 if (code
== TREE_LIST
)
3974 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3975 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3976 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3979 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3981 else if (code
== COMPONENT_REF
)
3985 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3986 and it is the right field, replace it with R. */
3987 for (inner
= TREE_OPERAND (exp
, 0);
3988 REFERENCE_CLASS_P (inner
);
3989 inner
= TREE_OPERAND (inner
, 0))
3993 op1
= TREE_OPERAND (exp
, 1);
3995 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3998 /* If this expression hasn't been completed let, leave it alone. */
3999 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4002 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4003 if (op0
== TREE_OPERAND (exp
, 0))
4007 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4010 switch (TREE_CODE_CLASS (code
))
4015 case tcc_declaration
:
4021 case tcc_expression
:
4027 case tcc_exceptional
:
4030 case tcc_comparison
:
4032 switch (TREE_CODE_LENGTH (code
))
4038 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4039 if (op0
== TREE_OPERAND (exp
, 0))
4042 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4046 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4047 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4049 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4052 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4056 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4057 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4058 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4060 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4061 && op2
== TREE_OPERAND (exp
, 2))
4064 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4068 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4069 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4070 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4071 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4073 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4074 && op2
== TREE_OPERAND (exp
, 2)
4075 && op3
== TREE_OPERAND (exp
, 3))
4079 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4091 new_tree
= NULL_TREE
;
4093 /* If we are trying to replace F with a constant or with another
4094 instance of one of the arguments of the call, inline back
4095 functions which do nothing else than computing a value from
4096 the arguments they are passed. This makes it possible to
4097 fold partially or entirely the replacement expression. */
4098 if (code
== CALL_EXPR
)
4100 bool maybe_inline
= false;
4101 if (CONSTANT_CLASS_P (r
))
4102 maybe_inline
= true;
4104 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4105 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4107 maybe_inline
= true;
4112 tree t
= maybe_inline_call_in_expr (exp
);
4114 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4118 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4120 tree op
= TREE_OPERAND (exp
, i
);
4121 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4125 new_tree
= copy_node (exp
);
4126 TREE_OPERAND (new_tree
, i
) = new_op
;
4132 new_tree
= fold (new_tree
);
4133 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4134 process_call_operands (new_tree
);
4145 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4147 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4148 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4153 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4154 for it within OBJ, a tree that is an object or a chain of references. */
4157 substitute_placeholder_in_expr (tree exp
, tree obj
)
4159 enum tree_code code
= TREE_CODE (exp
);
4160 tree op0
, op1
, op2
, op3
;
4163 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4164 in the chain of OBJ. */
4165 if (code
== PLACEHOLDER_EXPR
)
4167 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4170 for (elt
= obj
; elt
!= 0;
4171 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4172 || TREE_CODE (elt
) == COND_EXPR
)
4173 ? TREE_OPERAND (elt
, 1)
4174 : (REFERENCE_CLASS_P (elt
)
4175 || UNARY_CLASS_P (elt
)
4176 || BINARY_CLASS_P (elt
)
4177 || VL_EXP_CLASS_P (elt
)
4178 || EXPRESSION_CLASS_P (elt
))
4179 ? TREE_OPERAND (elt
, 0) : 0))
4180 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4183 for (elt
= obj
; elt
!= 0;
4184 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4185 || TREE_CODE (elt
) == COND_EXPR
)
4186 ? TREE_OPERAND (elt
, 1)
4187 : (REFERENCE_CLASS_P (elt
)
4188 || UNARY_CLASS_P (elt
)
4189 || BINARY_CLASS_P (elt
)
4190 || VL_EXP_CLASS_P (elt
)
4191 || EXPRESSION_CLASS_P (elt
))
4192 ? TREE_OPERAND (elt
, 0) : 0))
4193 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4194 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4196 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4198 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4199 survives until RTL generation, there will be an error. */
4203 /* TREE_LIST is special because we need to look at TREE_VALUE
4204 and TREE_CHAIN, not TREE_OPERANDS. */
4205 else if (code
== TREE_LIST
)
4207 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4208 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4209 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4212 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4215 switch (TREE_CODE_CLASS (code
))
4218 case tcc_declaration
:
4221 case tcc_exceptional
:
4224 case tcc_comparison
:
4225 case tcc_expression
:
4228 switch (TREE_CODE_LENGTH (code
))
4234 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4235 if (op0
== TREE_OPERAND (exp
, 0))
4238 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4242 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4243 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4245 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4248 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4252 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4253 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4254 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4256 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4257 && op2
== TREE_OPERAND (exp
, 2))
4260 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4264 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4265 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4266 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4267 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4269 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4270 && op2
== TREE_OPERAND (exp
, 2)
4271 && op3
== TREE_OPERAND (exp
, 3))
4275 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4287 new_tree
= NULL_TREE
;
4289 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4291 tree op
= TREE_OPERAND (exp
, i
);
4292 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4296 new_tree
= copy_node (exp
);
4297 TREE_OPERAND (new_tree
, i
) = new_op
;
4303 new_tree
= fold (new_tree
);
4304 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4305 process_call_operands (new_tree
);
4316 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4318 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4319 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4325 /* Subroutine of stabilize_reference; this is called for subtrees of
4326 references. Any expression with side-effects must be put in a SAVE_EXPR
4327 to ensure that it is only evaluated once.
4329 We don't put SAVE_EXPR nodes around everything, because assigning very
4330 simple expressions to temporaries causes us to miss good opportunities
4331 for optimizations. Among other things, the opportunity to fold in the
4332 addition of a constant into an addressing mode often gets lost, e.g.
4333 "y[i+1] += x;". In general, we take the approach that we should not make
4334 an assignment unless we are forced into it - i.e., that any non-side effect
4335 operator should be allowed, and that cse should take care of coalescing
4336 multiple utterances of the same expression should that prove fruitful. */
4339 stabilize_reference_1 (tree e
)
4342 enum tree_code code
= TREE_CODE (e
);
4344 /* We cannot ignore const expressions because it might be a reference
4345 to a const array but whose index contains side-effects. But we can
4346 ignore things that are actual constant or that already have been
4347 handled by this function. */
4349 if (tree_invariant_p (e
))
4352 switch (TREE_CODE_CLASS (code
))
4354 case tcc_exceptional
:
4356 case tcc_declaration
:
4357 case tcc_comparison
:
4359 case tcc_expression
:
4362 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4363 so that it will only be evaluated once. */
4364 /* The reference (r) and comparison (<) classes could be handled as
4365 below, but it is generally faster to only evaluate them once. */
4366 if (TREE_SIDE_EFFECTS (e
))
4367 return save_expr (e
);
4371 /* Constants need no processing. In fact, we should never reach
4376 /* Division is slow and tends to be compiled with jumps,
4377 especially the division by powers of 2 that is often
4378 found inside of an array reference. So do it just once. */
4379 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4380 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4381 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4382 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4383 return save_expr (e
);
4384 /* Recursively stabilize each operand. */
4385 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4386 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4390 /* Recursively stabilize each operand. */
4391 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4398 TREE_TYPE (result
) = TREE_TYPE (e
);
4399 TREE_READONLY (result
) = TREE_READONLY (e
);
4400 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4401 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4406 /* Stabilize a reference so that we can use it any number of times
4407 without causing its operands to be evaluated more than once.
4408 Returns the stabilized reference. This works by means of save_expr,
4409 so see the caveats in the comments about save_expr.
4411 Also allows conversion expressions whose operands are references.
4412 Any other kind of expression is returned unchanged. */
4415 stabilize_reference (tree ref
)
4418 enum tree_code code
= TREE_CODE (ref
);
4425 /* No action is needed in this case. */
4430 case FIX_TRUNC_EXPR
:
4431 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4435 result
= build_nt (INDIRECT_REF
,
4436 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4440 result
= build_nt (COMPONENT_REF
,
4441 stabilize_reference (TREE_OPERAND (ref
, 0)),
4442 TREE_OPERAND (ref
, 1), NULL_TREE
);
4446 result
= build_nt (BIT_FIELD_REF
,
4447 stabilize_reference (TREE_OPERAND (ref
, 0)),
4448 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4449 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4453 result
= build_nt (ARRAY_REF
,
4454 stabilize_reference (TREE_OPERAND (ref
, 0)),
4455 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4456 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4459 case ARRAY_RANGE_REF
:
4460 result
= build_nt (ARRAY_RANGE_REF
,
4461 stabilize_reference (TREE_OPERAND (ref
, 0)),
4462 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4463 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4467 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4468 it wouldn't be ignored. This matters when dealing with
4470 return stabilize_reference_1 (ref
);
4472 /* If arg isn't a kind of lvalue we recognize, make no change.
4473 Caller should recognize the error for an invalid lvalue. */
4478 return error_mark_node
;
4481 TREE_TYPE (result
) = TREE_TYPE (ref
);
4482 TREE_READONLY (result
) = TREE_READONLY (ref
);
4483 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4484 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4489 /* Low-level constructors for expressions. */
4491 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4492 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4495 recompute_tree_invariant_for_addr_expr (tree t
)
4498 bool tc
= true, se
= false;
4500 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4502 /* We started out assuming this address is both invariant and constant, but
4503 does not have side effects. Now go down any handled components and see if
4504 any of them involve offsets that are either non-constant or non-invariant.
4505 Also check for side-effects.
4507 ??? Note that this code makes no attempt to deal with the case where
4508 taking the address of something causes a copy due to misalignment. */
4510 #define UPDATE_FLAGS(NODE) \
4511 do { tree _node = (NODE); \
4512 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4513 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4515 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4516 node
= TREE_OPERAND (node
, 0))
4518 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4519 array reference (probably made temporarily by the G++ front end),
4520 so ignore all the operands. */
4521 if ((TREE_CODE (node
) == ARRAY_REF
4522 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4523 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4525 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4526 if (TREE_OPERAND (node
, 2))
4527 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4528 if (TREE_OPERAND (node
, 3))
4529 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4531 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4532 FIELD_DECL, apparently. The G++ front end can put something else
4533 there, at least temporarily. */
4534 else if (TREE_CODE (node
) == COMPONENT_REF
4535 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4537 if (TREE_OPERAND (node
, 2))
4538 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4542 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4544 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4545 the address, since &(*a)->b is a form of addition. If it's a constant, the
4546 address is constant too. If it's a decl, its address is constant if the
4547 decl is static. Everything else is not constant and, furthermore,
4548 taking the address of a volatile variable is not volatile. */
4549 if (TREE_CODE (node
) == INDIRECT_REF
4550 || TREE_CODE (node
) == MEM_REF
)
4551 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4552 else if (CONSTANT_CLASS_P (node
))
4554 else if (DECL_P (node
))
4555 tc
&= (staticp (node
) != NULL_TREE
);
4559 se
|= TREE_SIDE_EFFECTS (node
);
4563 TREE_CONSTANT (t
) = tc
;
4564 TREE_SIDE_EFFECTS (t
) = se
;
4568 /* Build an expression of code CODE, data type TYPE, and operands as
4569 specified. Expressions and reference nodes can be created this way.
4570 Constants, decls, types and misc nodes cannot be.
4572 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4573 enough for all extant tree codes. */
4576 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4580 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4582 t
= make_node (code PASS_MEM_STAT
);
4589 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4591 int length
= sizeof (struct tree_exp
);
4594 record_node_allocation_statistics (code
, length
);
4596 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4598 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4600 memset (t
, 0, sizeof (struct tree_common
));
4602 TREE_SET_CODE (t
, code
);
4604 TREE_TYPE (t
) = type
;
4605 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4606 TREE_OPERAND (t
, 0) = node
;
4607 if (node
&& !TYPE_P (node
))
4609 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4610 TREE_READONLY (t
) = TREE_READONLY (node
);
4613 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4615 if (code
!= DEBUG_BEGIN_STMT
)
4616 TREE_SIDE_EFFECTS (t
) = 1;
4621 /* All of these have side-effects, no matter what their
4623 TREE_SIDE_EFFECTS (t
) = 1;
4624 TREE_READONLY (t
) = 0;
4628 /* Whether a dereference is readonly has nothing to do with whether
4629 its operand is readonly. */
4630 TREE_READONLY (t
) = 0;
4635 recompute_tree_invariant_for_addr_expr (t
);
4639 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4640 && node
&& !TYPE_P (node
)
4641 && TREE_CONSTANT (node
))
4642 TREE_CONSTANT (t
) = 1;
4643 if (TREE_CODE_CLASS (code
) == tcc_reference
4644 && node
&& TREE_THIS_VOLATILE (node
))
4645 TREE_THIS_VOLATILE (t
) = 1;
4652 #define PROCESS_ARG(N) \
4654 TREE_OPERAND (t, N) = arg##N; \
4655 if (arg##N &&!TYPE_P (arg##N)) \
4657 if (TREE_SIDE_EFFECTS (arg##N)) \
4659 if (!TREE_READONLY (arg##N) \
4660 && !CONSTANT_CLASS_P (arg##N)) \
4661 (void) (read_only = 0); \
4662 if (!TREE_CONSTANT (arg##N)) \
4663 (void) (constant = 0); \
4668 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4670 bool constant
, read_only
, side_effects
, div_by_zero
;
4673 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4675 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4676 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4677 /* When sizetype precision doesn't match that of pointers
4678 we need to be able to build explicit extensions or truncations
4679 of the offset argument. */
4680 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4681 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4682 && TREE_CODE (arg1
) == INTEGER_CST
);
4684 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4685 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4686 && ptrofftype_p (TREE_TYPE (arg1
)));
4688 t
= make_node (code PASS_MEM_STAT
);
4691 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4692 result based on those same flags for the arguments. But if the
4693 arguments aren't really even `tree' expressions, we shouldn't be trying
4696 /* Expressions without side effects may be constant if their
4697 arguments are as well. */
4698 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4699 || TREE_CODE_CLASS (code
) == tcc_binary
);
4701 side_effects
= TREE_SIDE_EFFECTS (t
);
4705 case TRUNC_DIV_EXPR
:
4707 case FLOOR_DIV_EXPR
:
4708 case ROUND_DIV_EXPR
:
4709 case EXACT_DIV_EXPR
:
4711 case FLOOR_MOD_EXPR
:
4712 case ROUND_MOD_EXPR
:
4713 case TRUNC_MOD_EXPR
:
4714 div_by_zero
= integer_zerop (arg1
);
4717 div_by_zero
= false;
4723 TREE_SIDE_EFFECTS (t
) = side_effects
;
4724 if (code
== MEM_REF
)
4726 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4728 tree o
= TREE_OPERAND (arg0
, 0);
4729 TREE_READONLY (t
) = TREE_READONLY (o
);
4730 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4735 TREE_READONLY (t
) = read_only
;
4736 /* Don't mark X / 0 as constant. */
4737 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4738 TREE_THIS_VOLATILE (t
)
4739 = (TREE_CODE_CLASS (code
) == tcc_reference
4740 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4748 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4749 tree arg2 MEM_STAT_DECL
)
4751 bool constant
, read_only
, side_effects
;
4754 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4755 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4757 t
= make_node (code PASS_MEM_STAT
);
4762 /* As a special exception, if COND_EXPR has NULL branches, we
4763 assume that it is a gimple statement and always consider
4764 it to have side effects. */
4765 if (code
== COND_EXPR
4766 && tt
== void_type_node
4767 && arg1
== NULL_TREE
4768 && arg2
== NULL_TREE
)
4769 side_effects
= true;
4771 side_effects
= TREE_SIDE_EFFECTS (t
);
4777 if (code
== COND_EXPR
)
4778 TREE_READONLY (t
) = read_only
;
4780 TREE_SIDE_EFFECTS (t
) = side_effects
;
4781 TREE_THIS_VOLATILE (t
)
4782 = (TREE_CODE_CLASS (code
) == tcc_reference
4783 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4789 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4790 tree arg2
, tree arg3 MEM_STAT_DECL
)
4792 bool constant
, read_only
, side_effects
;
4795 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4797 t
= make_node (code PASS_MEM_STAT
);
4800 side_effects
= TREE_SIDE_EFFECTS (t
);
4807 TREE_SIDE_EFFECTS (t
) = side_effects
;
4808 TREE_THIS_VOLATILE (t
)
4809 = (TREE_CODE_CLASS (code
) == tcc_reference
4810 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4816 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4817 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4819 bool constant
, read_only
, side_effects
;
4822 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4824 t
= make_node (code PASS_MEM_STAT
);
4827 side_effects
= TREE_SIDE_EFFECTS (t
);
4835 TREE_SIDE_EFFECTS (t
) = side_effects
;
4836 if (code
== TARGET_MEM_REF
)
4838 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4840 tree o
= TREE_OPERAND (arg0
, 0);
4841 TREE_READONLY (t
) = TREE_READONLY (o
);
4842 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4846 TREE_THIS_VOLATILE (t
)
4847 = (TREE_CODE_CLASS (code
) == tcc_reference
4848 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4853 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4854 on the pointer PTR. */
4857 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4859 poly_int64 offset
= 0;
4860 tree ptype
= TREE_TYPE (ptr
);
4862 /* For convenience allow addresses that collapse to a simple base
4864 if (TREE_CODE (ptr
) == ADDR_EXPR
4865 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4866 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4868 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4870 if (TREE_CODE (ptr
) == MEM_REF
)
4872 offset
+= mem_ref_offset (ptr
).force_shwi ();
4873 ptr
= TREE_OPERAND (ptr
, 0);
4876 ptr
= build_fold_addr_expr (ptr
);
4877 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4879 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4880 ptr
, build_int_cst (ptype
, offset
));
4881 SET_EXPR_LOCATION (tem
, loc
);
4885 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4888 mem_ref_offset (const_tree t
)
4890 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4894 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4895 offsetted by OFFSET units. */
4898 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4900 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4901 build_fold_addr_expr (base
),
4902 build_int_cst (ptr_type_node
, offset
));
4903 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4904 recompute_tree_invariant_for_addr_expr (addr
);
4908 /* Similar except don't specify the TREE_TYPE
4909 and leave the TREE_SIDE_EFFECTS as 0.
4910 It is permissible for arguments to be null,
4911 or even garbage if their values do not matter. */
4914 build_nt (enum tree_code code
, ...)
4921 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4925 t
= make_node (code
);
4926 length
= TREE_CODE_LENGTH (code
);
4928 for (i
= 0; i
< length
; i
++)
4929 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4935 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4939 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4944 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4945 CALL_EXPR_FN (ret
) = fn
;
4946 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4947 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4948 CALL_EXPR_ARG (ret
, ix
) = t
;
4952 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4953 We do NOT enter this node in any sort of symbol table.
4955 LOC is the location of the decl.
4957 layout_decl is used to set up the decl's storage layout.
4958 Other slots are initialized to 0 or null pointers. */
4961 build_decl (location_t loc
, enum tree_code code
, tree name
,
4962 tree type MEM_STAT_DECL
)
4966 t
= make_node (code PASS_MEM_STAT
);
4967 DECL_SOURCE_LOCATION (t
) = loc
;
4969 /* if (type == error_mark_node)
4970 type = integer_type_node; */
4971 /* That is not done, deliberately, so that having error_mark_node
4972 as the type can suppress useless errors in the use of this variable. */
4974 DECL_NAME (t
) = name
;
4975 TREE_TYPE (t
) = type
;
4977 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4983 /* Builds and returns function declaration with NAME and TYPE. */
4986 build_fn_decl (const char *name
, tree type
)
4988 tree id
= get_identifier (name
);
4989 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4991 DECL_EXTERNAL (decl
) = 1;
4992 TREE_PUBLIC (decl
) = 1;
4993 DECL_ARTIFICIAL (decl
) = 1;
4994 TREE_NOTHROW (decl
) = 1;
4999 vec
<tree
, va_gc
> *all_translation_units
;
5001 /* Builds a new translation-unit decl with name NAME, queues it in the
5002 global list of translation-unit decls and returns it. */
5005 build_translation_unit_decl (tree name
)
5007 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5009 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5010 vec_safe_push (all_translation_units
, tu
);
5015 /* BLOCK nodes are used to represent the structure of binding contours
5016 and declarations, once those contours have been exited and their contents
5017 compiled. This information is used for outputting debugging info. */
5020 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5022 tree block
= make_node (BLOCK
);
5024 BLOCK_VARS (block
) = vars
;
5025 BLOCK_SUBBLOCKS (block
) = subblocks
;
5026 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5027 BLOCK_CHAIN (block
) = chain
;
5032 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5034 LOC is the location to use in tree T. */
5037 protected_set_expr_location (tree t
, location_t loc
)
5039 if (CAN_HAVE_LOCATION_P (t
))
5040 SET_EXPR_LOCATION (t
, loc
);
5043 /* Reset the expression *EXPR_P, a size or position.
5045 ??? We could reset all non-constant sizes or positions. But it's cheap
5046 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5048 We need to reset self-referential sizes or positions because they cannot
5049 be gimplified and thus can contain a CALL_EXPR after the gimplification
5050 is finished, which will run afoul of LTO streaming. And they need to be
5051 reset to something essentially dummy but not constant, so as to preserve
5052 the properties of the object they are attached to. */
5055 free_lang_data_in_one_sizepos (tree
*expr_p
)
5057 tree expr
= *expr_p
;
5058 if (CONTAINS_PLACEHOLDER_P (expr
))
5059 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5063 /* Reset all the fields in a binfo node BINFO. We only keep
5064 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5067 free_lang_data_in_binfo (tree binfo
)
5072 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5074 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5075 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5076 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5077 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5079 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5080 free_lang_data_in_binfo (t
);
5084 /* Reset all language specific information still present in TYPE. */
5087 free_lang_data_in_type (tree type
)
5089 gcc_assert (TYPE_P (type
));
5091 /* Give the FE a chance to remove its own data first. */
5092 lang_hooks
.free_lang_data (type
);
5094 TREE_LANG_FLAG_0 (type
) = 0;
5095 TREE_LANG_FLAG_1 (type
) = 0;
5096 TREE_LANG_FLAG_2 (type
) = 0;
5097 TREE_LANG_FLAG_3 (type
) = 0;
5098 TREE_LANG_FLAG_4 (type
) = 0;
5099 TREE_LANG_FLAG_5 (type
) = 0;
5100 TREE_LANG_FLAG_6 (type
) = 0;
5102 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5104 /* Remove the const and volatile qualifiers from arguments. The
5105 C++ front end removes them, but the C front end does not,
5106 leading to false ODR violation errors when merging two
5107 instances of the same function signature compiled by
5108 different front ends. */
5109 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5111 tree arg_type
= TREE_VALUE (p
);
5113 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5115 int quals
= TYPE_QUALS (arg_type
)
5117 & ~TYPE_QUAL_VOLATILE
;
5118 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5119 free_lang_data_in_type (TREE_VALUE (p
));
5121 /* C++ FE uses TREE_PURPOSE to store initial values. */
5122 TREE_PURPOSE (p
) = NULL
;
5125 else if (TREE_CODE (type
) == METHOD_TYPE
)
5126 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5127 /* C++ FE uses TREE_PURPOSE to store initial values. */
5128 TREE_PURPOSE (p
) = NULL
;
5129 else if (RECORD_OR_UNION_TYPE_P (type
))
5131 /* Remove members that are not FIELD_DECLs (and maybe
5132 TYPE_DECLs) from the field list of an aggregate. These occur
5134 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5135 if (TREE_CODE (member
) == FIELD_DECL
5136 || (TREE_CODE (member
) == TYPE_DECL
5137 && !DECL_IGNORED_P (member
)
5138 && debug_info_level
> DINFO_LEVEL_TERSE
5139 && !is_redundant_typedef (member
)))
5140 prev
= &DECL_CHAIN (member
);
5142 *prev
= DECL_CHAIN (member
);
5144 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5145 and danagle the pointer from time to time. */
5146 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5147 TYPE_VFIELD (type
) = NULL_TREE
;
5149 if (TYPE_BINFO (type
))
5151 free_lang_data_in_binfo (TYPE_BINFO (type
));
5152 /* We need to preserve link to bases and virtual table for all
5153 polymorphic types to make devirtualization machinery working.
5154 Debug output cares only about bases, but output also
5155 virtual table pointers so merging of -fdevirtualize and
5156 -fno-devirtualize units is easier. */
5157 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5158 || !flag_devirtualize
)
5159 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5160 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5161 || debug_info_level
!= DINFO_LEVEL_NONE
))
5162 TYPE_BINFO (type
) = NULL
;
5165 else if (INTEGRAL_TYPE_P (type
)
5166 || SCALAR_FLOAT_TYPE_P (type
)
5167 || FIXED_POINT_TYPE_P (type
))
5169 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5170 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5173 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5175 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5176 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5178 if (TYPE_CONTEXT (type
)
5179 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5181 tree ctx
= TYPE_CONTEXT (type
);
5184 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5186 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5187 TYPE_CONTEXT (type
) = ctx
;
5192 /* Return true if DECL may need an assembler name to be set. */
5195 need_assembler_name_p (tree decl
)
5197 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5198 Rule merging. This makes type_odr_p to return true on those types during
5199 LTO and by comparing the mangled name, we can say what types are intended
5200 to be equivalent across compilation unit.
5202 We do not store names of type_in_anonymous_namespace_p.
5204 Record, union and enumeration type have linkage that allows use
5205 to check type_in_anonymous_namespace_p. We do not mangle compound types
5206 that always can be compared structurally.
5208 Similarly for builtin types, we compare properties of their main variant.
5209 A special case are integer types where mangling do make differences
5210 between char/signed char/unsigned char etc. Storing name for these makes
5211 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5212 See cp/mangle.c:write_builtin_type for details. */
5214 if (flag_lto_odr_type_mering
5215 && TREE_CODE (decl
) == TYPE_DECL
5217 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5218 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5219 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5220 && (type_with_linkage_p (TREE_TYPE (decl
))
5221 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5222 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5223 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5224 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5225 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5228 /* If DECL already has its assembler name set, it does not need a
5230 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5231 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5234 /* Abstract decls do not need an assembler name. */
5235 if (DECL_ABSTRACT_P (decl
))
5238 /* For VAR_DECLs, only static, public and external symbols need an
5241 && !TREE_STATIC (decl
)
5242 && !TREE_PUBLIC (decl
)
5243 && !DECL_EXTERNAL (decl
))
5246 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5248 /* Do not set assembler name on builtins. Allow RTL expansion to
5249 decide whether to expand inline or via a regular call. */
5250 if (DECL_BUILT_IN (decl
)
5251 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5254 /* Functions represented in the callgraph need an assembler name. */
5255 if (cgraph_node::get (decl
) != NULL
)
5258 /* Unused and not public functions don't need an assembler name. */
5259 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5267 /* Reset all language specific information still present in symbol
5271 free_lang_data_in_decl (tree decl
)
5273 gcc_assert (DECL_P (decl
));
5275 /* Give the FE a chance to remove its own data first. */
5276 lang_hooks
.free_lang_data (decl
);
5278 TREE_LANG_FLAG_0 (decl
) = 0;
5279 TREE_LANG_FLAG_1 (decl
) = 0;
5280 TREE_LANG_FLAG_2 (decl
) = 0;
5281 TREE_LANG_FLAG_3 (decl
) = 0;
5282 TREE_LANG_FLAG_4 (decl
) = 0;
5283 TREE_LANG_FLAG_5 (decl
) = 0;
5284 TREE_LANG_FLAG_6 (decl
) = 0;
5286 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5287 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5288 if (TREE_CODE (decl
) == FIELD_DECL
)
5290 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5291 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5292 DECL_QUALIFIER (decl
) = NULL_TREE
;
5295 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5297 struct cgraph_node
*node
;
5298 if (!(node
= cgraph_node::get (decl
))
5299 || (!node
->definition
&& !node
->clones
))
5302 node
->release_body ();
5305 release_function_body (decl
);
5306 DECL_ARGUMENTS (decl
) = NULL
;
5307 DECL_RESULT (decl
) = NULL
;
5308 DECL_INITIAL (decl
) = error_mark_node
;
5311 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5315 /* If DECL has a gimple body, then the context for its
5316 arguments must be DECL. Otherwise, it doesn't really
5317 matter, as we will not be emitting any code for DECL. In
5318 general, there may be other instances of DECL created by
5319 the front end and since PARM_DECLs are generally shared,
5320 their DECL_CONTEXT changes as the replicas of DECL are
5321 created. The only time where DECL_CONTEXT is important
5322 is for the FUNCTION_DECLs that have a gimple body (since
5323 the PARM_DECL will be used in the function's body). */
5324 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5325 DECL_CONTEXT (t
) = decl
;
5326 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5327 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5328 = target_option_default_node
;
5329 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5330 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5331 = optimization_default_node
;
5334 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5335 At this point, it is not needed anymore. */
5336 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5338 /* Clear the abstract origin if it refers to a method.
5339 Otherwise dwarf2out.c will ICE as we splice functions out of
5340 TYPE_FIELDS and thus the origin will not be output
5342 if (DECL_ABSTRACT_ORIGIN (decl
)
5343 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5344 && RECORD_OR_UNION_TYPE_P
5345 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5346 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5348 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5349 DECL_VINDEX referring to itself into a vtable slot number as it
5350 should. Happens with functions that are copied and then forgotten
5351 about. Just clear it, it won't matter anymore. */
5352 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5353 DECL_VINDEX (decl
) = NULL_TREE
;
5355 else if (VAR_P (decl
))
5357 if ((DECL_EXTERNAL (decl
)
5358 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5359 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5360 DECL_INITIAL (decl
) = NULL_TREE
;
5362 else if (TREE_CODE (decl
) == TYPE_DECL
)
5364 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5365 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5366 DECL_INITIAL (decl
) = NULL_TREE
;
5368 else if (TREE_CODE (decl
) == FIELD_DECL
)
5369 DECL_INITIAL (decl
) = NULL_TREE
;
5370 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5371 && DECL_INITIAL (decl
)
5372 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5374 /* Strip builtins from the translation-unit BLOCK. We still have targets
5375 without builtin_decl_explicit support and also builtins are shared
5376 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5377 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5381 if (TREE_CODE (var
) == FUNCTION_DECL
5382 && DECL_BUILT_IN (var
))
5383 *nextp
= TREE_CHAIN (var
);
5385 nextp
= &TREE_CHAIN (var
);
5391 /* Data used when collecting DECLs and TYPEs for language data removal. */
5393 struct free_lang_data_d
5395 free_lang_data_d () : decls (100), types (100) {}
5397 /* Worklist to avoid excessive recursion. */
5398 auto_vec
<tree
> worklist
;
5400 /* Set of traversed objects. Used to avoid duplicate visits. */
5401 hash_set
<tree
> pset
;
5403 /* Array of symbols to process with free_lang_data_in_decl. */
5404 auto_vec
<tree
> decls
;
5406 /* Array of types to process with free_lang_data_in_type. */
5407 auto_vec
<tree
> types
;
5411 /* Save all language fields needed to generate proper debug information
5412 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5415 save_debug_info_for_decl (tree t
)
5417 /*struct saved_debug_info_d *sdi;*/
5419 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5421 /* FIXME. Partial implementation for saving debug info removed. */
5425 /* Save all language fields needed to generate proper debug information
5426 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5429 save_debug_info_for_type (tree t
)
5431 /*struct saved_debug_info_d *sdi;*/
5433 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5435 /* FIXME. Partial implementation for saving debug info removed. */
5439 /* Add type or decl T to one of the list of tree nodes that need their
5440 language data removed. The lists are held inside FLD. */
5443 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5447 fld
->decls
.safe_push (t
);
5448 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5449 save_debug_info_for_decl (t
);
5451 else if (TYPE_P (t
))
5453 fld
->types
.safe_push (t
);
5454 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5455 save_debug_info_for_type (t
);
5461 /* Push tree node T into FLD->WORKLIST. */
5464 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5466 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5467 fld
->worklist
.safe_push ((t
));
5471 /* Operand callback helper for free_lang_data_in_node. *TP is the
5472 subtree operand being considered. */
5475 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5478 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5480 if (TREE_CODE (t
) == TREE_LIST
)
5483 /* Language specific nodes will be removed, so there is no need
5484 to gather anything under them. */
5485 if (is_lang_specific (t
))
5493 /* Note that walk_tree does not traverse every possible field in
5494 decls, so we have to do our own traversals here. */
5495 add_tree_to_fld_list (t
, fld
);
5497 fld_worklist_push (DECL_NAME (t
), fld
);
5498 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5499 fld_worklist_push (DECL_SIZE (t
), fld
);
5500 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5502 /* We are going to remove everything under DECL_INITIAL for
5503 TYPE_DECLs. No point walking them. */
5504 if (TREE_CODE (t
) != TYPE_DECL
)
5505 fld_worklist_push (DECL_INITIAL (t
), fld
);
5507 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5508 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5510 if (TREE_CODE (t
) == FUNCTION_DECL
)
5512 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5513 fld_worklist_push (DECL_RESULT (t
), fld
);
5515 else if (TREE_CODE (t
) == TYPE_DECL
)
5517 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5519 else if (TREE_CODE (t
) == FIELD_DECL
)
5521 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5522 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5523 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5524 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5527 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5528 && DECL_HAS_VALUE_EXPR_P (t
))
5529 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5531 if (TREE_CODE (t
) != FIELD_DECL
5532 && TREE_CODE (t
) != TYPE_DECL
)
5533 fld_worklist_push (TREE_CHAIN (t
), fld
);
5536 else if (TYPE_P (t
))
5538 /* Note that walk_tree does not traverse every possible field in
5539 types, so we have to do our own traversals here. */
5540 add_tree_to_fld_list (t
, fld
);
5542 if (!RECORD_OR_UNION_TYPE_P (t
))
5543 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5544 fld_worklist_push (TYPE_SIZE (t
), fld
);
5545 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5546 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5547 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5548 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5549 fld_worklist_push (TYPE_NAME (t
), fld
);
5550 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5551 them and thus do not and want not to reach unused pointer types
5553 if (!POINTER_TYPE_P (t
))
5554 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5555 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5556 if (!RECORD_OR_UNION_TYPE_P (t
))
5557 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5558 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5559 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5560 do not and want not to reach unused variants this way. */
5561 if (TYPE_CONTEXT (t
))
5563 tree ctx
= TYPE_CONTEXT (t
);
5564 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5565 So push that instead. */
5566 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5567 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5568 fld_worklist_push (ctx
, fld
);
5570 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5571 and want not to reach unused types this way. */
5573 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5577 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5578 fld_worklist_push (TREE_TYPE (tem
), fld
);
5579 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5581 if (RECORD_OR_UNION_TYPE_P (t
))
5584 /* Push all TYPE_FIELDS - there can be interleaving interesting
5585 and non-interesting things. */
5586 tem
= TYPE_FIELDS (t
);
5589 if (TREE_CODE (tem
) == FIELD_DECL
5590 || (TREE_CODE (tem
) == TYPE_DECL
5591 && !DECL_IGNORED_P (tem
)
5592 && debug_info_level
> DINFO_LEVEL_TERSE
5593 && !is_redundant_typedef (tem
)))
5594 fld_worklist_push (tem
, fld
);
5595 tem
= TREE_CHAIN (tem
);
5599 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5602 else if (TREE_CODE (t
) == BLOCK
)
5605 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5606 fld_worklist_push (tem
, fld
);
5607 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5608 fld_worklist_push (tem
, fld
);
5609 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5612 if (TREE_CODE (t
) != IDENTIFIER_NODE
5613 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5614 fld_worklist_push (TREE_TYPE (t
), fld
);
5620 /* Find decls and types in T. */
5623 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5627 if (!fld
->pset
.contains (t
))
5628 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5629 if (fld
->worklist
.is_empty ())
5631 t
= fld
->worklist
.pop ();
5635 /* Translate all the types in LIST with the corresponding runtime
5639 get_eh_types_for_runtime (tree list
)
5643 if (list
== NULL_TREE
)
5646 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5648 list
= TREE_CHAIN (list
);
5651 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5652 TREE_CHAIN (prev
) = n
;
5653 prev
= TREE_CHAIN (prev
);
5654 list
= TREE_CHAIN (list
);
5661 /* Find decls and types referenced in EH region R and store them in
5662 FLD->DECLS and FLD->TYPES. */
5665 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5676 /* The types referenced in each catch must first be changed to the
5677 EH types used at runtime. This removes references to FE types
5679 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5681 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5682 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5687 case ERT_ALLOWED_EXCEPTIONS
:
5688 r
->u
.allowed
.type_list
5689 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5690 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5693 case ERT_MUST_NOT_THROW
:
5694 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5695 find_decls_types_r
, fld
, &fld
->pset
);
5701 /* Find decls and types referenced in cgraph node N and store them in
5702 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5703 look for *every* kind of DECL and TYPE node reachable from N,
5704 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5705 NAMESPACE_DECLs, etc). */
5708 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5711 struct function
*fn
;
5715 find_decls_types (n
->decl
, fld
);
5717 if (!gimple_has_body_p (n
->decl
))
5720 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5722 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5724 /* Traverse locals. */
5725 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5726 find_decls_types (t
, fld
);
5728 /* Traverse EH regions in FN. */
5731 FOR_ALL_EH_REGION_FN (r
, fn
)
5732 find_decls_types_in_eh_region (r
, fld
);
5735 /* Traverse every statement in FN. */
5736 FOR_EACH_BB_FN (bb
, fn
)
5739 gimple_stmt_iterator si
;
5742 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5744 gphi
*phi
= psi
.phi ();
5746 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5748 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5749 find_decls_types (*arg_p
, fld
);
5753 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5755 gimple
*stmt
= gsi_stmt (si
);
5757 if (is_gimple_call (stmt
))
5758 find_decls_types (gimple_call_fntype (stmt
), fld
);
5760 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5762 tree arg
= gimple_op (stmt
, i
);
5763 find_decls_types (arg
, fld
);
5770 /* Find decls and types referenced in varpool node N and store them in
5771 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5772 look for *every* kind of DECL and TYPE node reachable from N,
5773 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5774 NAMESPACE_DECLs, etc). */
5777 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5779 find_decls_types (v
->decl
, fld
);
5782 /* If T needs an assembler name, have one created for it. */
5785 assign_assembler_name_if_needed (tree t
)
5787 if (need_assembler_name_p (t
))
5789 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5790 diagnostics that use input_location to show locus
5791 information. The problem here is that, at this point,
5792 input_location is generally anchored to the end of the file
5793 (since the parser is long gone), so we don't have a good
5794 position to pin it to.
5796 To alleviate this problem, this uses the location of T's
5797 declaration. Examples of this are
5798 testsuite/g++.dg/template/cond2.C and
5799 testsuite/g++.dg/template/pr35240.C. */
5800 location_t saved_location
= input_location
;
5801 input_location
= DECL_SOURCE_LOCATION (t
);
5803 decl_assembler_name (t
);
5805 input_location
= saved_location
;
5810 /* Free language specific information for every operand and expression
5811 in every node of the call graph. This process operates in three stages:
5813 1- Every callgraph node and varpool node is traversed looking for
5814 decls and types embedded in them. This is a more exhaustive
5815 search than that done by find_referenced_vars, because it will
5816 also collect individual fields, decls embedded in types, etc.
5818 2- All the decls found are sent to free_lang_data_in_decl.
5820 3- All the types found are sent to free_lang_data_in_type.
5822 The ordering between decls and types is important because
5823 free_lang_data_in_decl sets assembler names, which includes
5824 mangling. So types cannot be freed up until assembler names have
5828 free_lang_data_in_cgraph (void)
5830 struct cgraph_node
*n
;
5832 struct free_lang_data_d fld
;
5837 /* Find decls and types in the body of every function in the callgraph. */
5838 FOR_EACH_FUNCTION (n
)
5839 find_decls_types_in_node (n
, &fld
);
5841 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5842 find_decls_types (p
->decl
, &fld
);
5844 /* Find decls and types in every varpool symbol. */
5845 FOR_EACH_VARIABLE (v
)
5846 find_decls_types_in_var (v
, &fld
);
5848 /* Set the assembler name on every decl found. We need to do this
5849 now because free_lang_data_in_decl will invalidate data needed
5850 for mangling. This breaks mangling on interdependent decls. */
5851 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5852 assign_assembler_name_if_needed (t
);
5854 /* Traverse every decl found freeing its language data. */
5855 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5856 free_lang_data_in_decl (t
);
5858 /* Traverse every type found freeing its language data. */
5859 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5860 free_lang_data_in_type (t
);
5863 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5869 /* Free resources that are used by FE but are not needed once they are done. */
5872 free_lang_data (void)
5876 /* If we are the LTO frontend we have freed lang-specific data already. */
5878 || (!flag_generate_lto
&& !flag_generate_offload
))
5881 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5882 if (vec_safe_is_empty (all_translation_units
))
5883 build_translation_unit_decl (NULL_TREE
);
5885 /* Allocate and assign alias sets to the standard integer types
5886 while the slots are still in the way the frontends generated them. */
5887 for (i
= 0; i
< itk_none
; ++i
)
5888 if (integer_types
[i
])
5889 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5891 /* Traverse the IL resetting language specific information for
5892 operands, expressions, etc. */
5893 free_lang_data_in_cgraph ();
5895 /* Create gimple variants for common types. */
5896 for (unsigned i
= 0;
5897 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5899 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5901 /* Reset some langhooks. Do not reset types_compatible_p, it may
5902 still be used indirectly via the get_alias_set langhook. */
5903 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5904 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5905 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5907 /* We do not want the default decl_assembler_name implementation,
5908 rather if we have fixed everything we want a wrapper around it
5909 asserting that all non-local symbols already got their assembler
5910 name and only produce assembler names for local symbols. Or rather
5911 make sure we never call decl_assembler_name on local symbols and
5912 devise a separate, middle-end private scheme for it. */
5914 /* Reset diagnostic machinery. */
5915 tree_diagnostics_defaults (global_dc
);
5923 const pass_data pass_data_ipa_free_lang_data
=
5925 SIMPLE_IPA_PASS
, /* type */
5926 "*free_lang_data", /* name */
5927 OPTGROUP_NONE
, /* optinfo_flags */
5928 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5929 0, /* properties_required */
5930 0, /* properties_provided */
5931 0, /* properties_destroyed */
5932 0, /* todo_flags_start */
5933 0, /* todo_flags_finish */
5936 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5939 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5940 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5943 /* opt_pass methods: */
5944 virtual unsigned int execute (function
*) { return free_lang_data (); }
5946 }; // class pass_ipa_free_lang_data
5950 simple_ipa_opt_pass
*
5951 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5953 return new pass_ipa_free_lang_data (ctxt
);
5956 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5957 of the various TYPE_QUAL values. */
5960 set_type_quals (tree type
, int type_quals
)
5962 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5963 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5964 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5965 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5966 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5969 /* Returns true iff CAND and BASE have equivalent language-specific
5973 check_lang_type (const_tree cand
, const_tree base
)
5975 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5977 /* type_hash_eq currently only applies to these types. */
5978 if (TREE_CODE (cand
) != FUNCTION_TYPE
5979 && TREE_CODE (cand
) != METHOD_TYPE
)
5981 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5984 /* Returns true iff unqualified CAND and BASE are equivalent. */
5987 check_base_type (const_tree cand
, const_tree base
)
5989 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5990 /* Apparently this is needed for Objective-C. */
5991 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5992 /* Check alignment. */
5993 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5994 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5995 TYPE_ATTRIBUTES (base
)));
5998 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6001 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6003 return (TYPE_QUALS (cand
) == type_quals
6004 && check_base_type (cand
, base
)
6005 && check_lang_type (cand
, base
));
6008 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6011 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6013 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6014 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6015 /* Apparently this is needed for Objective-C. */
6016 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6017 /* Check alignment. */
6018 && TYPE_ALIGN (cand
) == align
6019 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6020 TYPE_ATTRIBUTES (base
))
6021 && check_lang_type (cand
, base
));
6024 /* This function checks to see if TYPE matches the size one of the built-in
6025 atomic types, and returns that core atomic type. */
6028 find_atomic_core_type (tree type
)
6030 tree base_atomic_type
;
6032 /* Only handle complete types. */
6033 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6036 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6039 base_atomic_type
= atomicQI_type_node
;
6043 base_atomic_type
= atomicHI_type_node
;
6047 base_atomic_type
= atomicSI_type_node
;
6051 base_atomic_type
= atomicDI_type_node
;
6055 base_atomic_type
= atomicTI_type_node
;
6059 base_atomic_type
= NULL_TREE
;
6062 return base_atomic_type
;
6065 /* Return a version of the TYPE, qualified as indicated by the
6066 TYPE_QUALS, if one exists. If no qualified version exists yet,
6067 return NULL_TREE. */
6070 get_qualified_type (tree type
, int type_quals
)
6074 if (TYPE_QUALS (type
) == type_quals
)
6077 /* Search the chain of variants to see if there is already one there just
6078 like the one we need to have. If so, use that existing one. We must
6079 preserve the TYPE_NAME, since there is code that depends on this. */
6080 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6081 if (check_qualified_type (t
, type
, type_quals
))
6087 /* Like get_qualified_type, but creates the type if it does not
6088 exist. This function never returns NULL_TREE. */
6091 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6095 /* See if we already have the appropriate qualified variant. */
6096 t
= get_qualified_type (type
, type_quals
);
6098 /* If not, build it. */
6101 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6102 set_type_quals (t
, type_quals
);
6104 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6106 /* See if this object can map to a basic atomic type. */
6107 tree atomic_type
= find_atomic_core_type (type
);
6110 /* Ensure the alignment of this type is compatible with
6111 the required alignment of the atomic type. */
6112 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6113 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6117 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6118 /* Propagate structural equality. */
6119 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6120 else if (TYPE_CANONICAL (type
) != type
)
6121 /* Build the underlying canonical type, since it is different
6124 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6125 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6128 /* T is its own canonical type. */
6129 TYPE_CANONICAL (t
) = t
;
6136 /* Create a variant of type T with alignment ALIGN. */
6139 build_aligned_type (tree type
, unsigned int align
)
6143 if (TYPE_PACKED (type
)
6144 || TYPE_ALIGN (type
) == align
)
6147 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6148 if (check_aligned_type (t
, type
, align
))
6151 t
= build_variant_type_copy (type
);
6152 SET_TYPE_ALIGN (t
, align
);
6153 TYPE_USER_ALIGN (t
) = 1;
6158 /* Create a new distinct copy of TYPE. The new type is made its own
6159 MAIN_VARIANT. If TYPE requires structural equality checks, the
6160 resulting type requires structural equality checks; otherwise, its
6161 TYPE_CANONICAL points to itself. */
6164 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6166 tree t
= copy_node (type PASS_MEM_STAT
);
6168 TYPE_POINTER_TO (t
) = 0;
6169 TYPE_REFERENCE_TO (t
) = 0;
6171 /* Set the canonical type either to a new equivalence class, or
6172 propagate the need for structural equality checks. */
6173 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6174 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6176 TYPE_CANONICAL (t
) = t
;
6178 /* Make it its own variant. */
6179 TYPE_MAIN_VARIANT (t
) = t
;
6180 TYPE_NEXT_VARIANT (t
) = 0;
6182 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6183 whose TREE_TYPE is not t. This can also happen in the Ada
6184 frontend when using subtypes. */
6189 /* Create a new variant of TYPE, equivalent but distinct. This is so
6190 the caller can modify it. TYPE_CANONICAL for the return type will
6191 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6192 are considered equal by the language itself (or that both types
6193 require structural equality checks). */
6196 build_variant_type_copy (tree type MEM_STAT_DECL
)
6198 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6200 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6202 /* Since we're building a variant, assume that it is a non-semantic
6203 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6204 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6205 /* Type variants have no alias set defined. */
6206 TYPE_ALIAS_SET (t
) = -1;
6208 /* Add the new type to the chain of variants of TYPE. */
6209 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6210 TYPE_NEXT_VARIANT (m
) = t
;
6211 TYPE_MAIN_VARIANT (t
) = m
;
6216 /* Return true if the from tree in both tree maps are equal. */
6219 tree_map_base_eq (const void *va
, const void *vb
)
6221 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6222 *const b
= (const struct tree_map_base
*) vb
;
6223 return (a
->from
== b
->from
);
6226 /* Hash a from tree in a tree_base_map. */
6229 tree_map_base_hash (const void *item
)
6231 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6234 /* Return true if this tree map structure is marked for garbage collection
6235 purposes. We simply return true if the from tree is marked, so that this
6236 structure goes away when the from tree goes away. */
6239 tree_map_base_marked_p (const void *p
)
6241 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6244 /* Hash a from tree in a tree_map. */
6247 tree_map_hash (const void *item
)
6249 return (((const struct tree_map
*) item
)->hash
);
6252 /* Hash a from tree in a tree_decl_map. */
6255 tree_decl_map_hash (const void *item
)
6257 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6260 /* Return the initialization priority for DECL. */
6263 decl_init_priority_lookup (tree decl
)
6265 symtab_node
*snode
= symtab_node::get (decl
);
6268 return DEFAULT_INIT_PRIORITY
;
6270 snode
->get_init_priority ();
6273 /* Return the finalization priority for DECL. */
6276 decl_fini_priority_lookup (tree decl
)
6278 cgraph_node
*node
= cgraph_node::get (decl
);
6281 return DEFAULT_INIT_PRIORITY
;
6283 node
->get_fini_priority ();
6286 /* Set the initialization priority for DECL to PRIORITY. */
6289 decl_init_priority_insert (tree decl
, priority_type priority
)
6291 struct symtab_node
*snode
;
6293 if (priority
== DEFAULT_INIT_PRIORITY
)
6295 snode
= symtab_node::get (decl
);
6299 else if (VAR_P (decl
))
6300 snode
= varpool_node::get_create (decl
);
6302 snode
= cgraph_node::get_create (decl
);
6303 snode
->set_init_priority (priority
);
6306 /* Set the finalization priority for DECL to PRIORITY. */
6309 decl_fini_priority_insert (tree decl
, priority_type priority
)
6311 struct cgraph_node
*node
;
6313 if (priority
== DEFAULT_INIT_PRIORITY
)
6315 node
= cgraph_node::get (decl
);
6320 node
= cgraph_node::get_create (decl
);
6321 node
->set_fini_priority (priority
);
6324 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6327 print_debug_expr_statistics (void)
6329 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6330 (long) debug_expr_for_decl
->size (),
6331 (long) debug_expr_for_decl
->elements (),
6332 debug_expr_for_decl
->collisions ());
6335 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6338 print_value_expr_statistics (void)
6340 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6341 (long) value_expr_for_decl
->size (),
6342 (long) value_expr_for_decl
->elements (),
6343 value_expr_for_decl
->collisions ());
6346 /* Lookup a debug expression for FROM, and return it if we find one. */
6349 decl_debug_expr_lookup (tree from
)
6351 struct tree_decl_map
*h
, in
;
6352 in
.base
.from
= from
;
6354 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6360 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6363 decl_debug_expr_insert (tree from
, tree to
)
6365 struct tree_decl_map
*h
;
6367 h
= ggc_alloc
<tree_decl_map
> ();
6368 h
->base
.from
= from
;
6370 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6373 /* Lookup a value expression for FROM, and return it if we find one. */
6376 decl_value_expr_lookup (tree from
)
6378 struct tree_decl_map
*h
, in
;
6379 in
.base
.from
= from
;
6381 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6387 /* Insert a mapping FROM->TO in the value expression hashtable. */
6390 decl_value_expr_insert (tree from
, tree to
)
6392 struct tree_decl_map
*h
;
6394 h
= ggc_alloc
<tree_decl_map
> ();
6395 h
->base
.from
= from
;
6397 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6400 /* Lookup a vector of debug arguments for FROM, and return it if we
6404 decl_debug_args_lookup (tree from
)
6406 struct tree_vec_map
*h
, in
;
6408 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6410 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6411 in
.base
.from
= from
;
6412 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6418 /* Insert a mapping FROM->empty vector of debug arguments in the value
6419 expression hashtable. */
6422 decl_debug_args_insert (tree from
)
6424 struct tree_vec_map
*h
;
6427 if (DECL_HAS_DEBUG_ARGS_P (from
))
6428 return decl_debug_args_lookup (from
);
6429 if (debug_args_for_decl
== NULL
)
6430 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6431 h
= ggc_alloc
<tree_vec_map
> ();
6432 h
->base
.from
= from
;
6434 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6436 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6440 /* Hashing of types so that we don't make duplicates.
6441 The entry point is `type_hash_canon'. */
6443 /* Generate the default hash code for TYPE. This is designed for
6444 speed, rather than maximum entropy. */
6447 type_hash_canon_hash (tree type
)
6449 inchash::hash hstate
;
6451 hstate
.add_int (TREE_CODE (type
));
6453 if (TREE_TYPE (type
))
6454 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6456 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6457 /* Just the identifier is adequate to distinguish. */
6458 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6460 switch (TREE_CODE (type
))
6463 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6466 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6467 if (TREE_VALUE (t
) != error_mark_node
)
6468 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6472 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6477 if (TYPE_DOMAIN (type
))
6478 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6479 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6481 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6482 hstate
.add_object (typeless
);
6489 tree t
= TYPE_MAX_VALUE (type
);
6491 t
= TYPE_MIN_VALUE (type
);
6492 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6493 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6498 case FIXED_POINT_TYPE
:
6500 unsigned prec
= TYPE_PRECISION (type
);
6501 hstate
.add_object (prec
);
6506 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6513 return hstate
.end ();
6516 /* These are the Hashtable callback functions. */
6518 /* Returns true iff the types are equivalent. */
6521 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6523 /* First test the things that are the same for all types. */
6524 if (a
->hash
!= b
->hash
6525 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6526 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6527 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6528 TYPE_ATTRIBUTES (b
->type
))
6529 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6530 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6533 /* Be careful about comparing arrays before and after the element type
6534 has been completed; don't compare TYPE_ALIGN unless both types are
6536 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6537 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6538 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6541 switch (TREE_CODE (a
->type
))
6546 case REFERENCE_TYPE
:
6551 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6552 TYPE_VECTOR_SUBPARTS (b
->type
));
6555 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6556 && !(TYPE_VALUES (a
->type
)
6557 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6558 && TYPE_VALUES (b
->type
)
6559 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6560 && type_list_equal (TYPE_VALUES (a
->type
),
6561 TYPE_VALUES (b
->type
))))
6569 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6571 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6572 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6573 TYPE_MAX_VALUE (b
->type
)))
6574 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6575 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6576 TYPE_MIN_VALUE (b
->type
))));
6578 case FIXED_POINT_TYPE
:
6579 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6582 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6585 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6586 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6587 || (TYPE_ARG_TYPES (a
->type
)
6588 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6589 && TYPE_ARG_TYPES (b
->type
)
6590 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6591 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6592 TYPE_ARG_TYPES (b
->type
)))))
6596 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6597 where the flag should be inherited from the element type
6598 and can change after ARRAY_TYPEs are created; on non-aggregates
6599 compare it and hash it, scalars will never have that flag set
6600 and we need to differentiate between arrays created by different
6601 front-ends or middle-end created arrays. */
6602 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6603 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6604 || (TYPE_TYPELESS_STORAGE (a
->type
)
6605 == TYPE_TYPELESS_STORAGE (b
->type
))));
6609 case QUAL_UNION_TYPE
:
6610 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6611 || (TYPE_FIELDS (a
->type
)
6612 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6613 && TYPE_FIELDS (b
->type
)
6614 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6615 && type_list_equal (TYPE_FIELDS (a
->type
),
6616 TYPE_FIELDS (b
->type
))));
6619 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6620 || (TYPE_ARG_TYPES (a
->type
)
6621 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6622 && TYPE_ARG_TYPES (b
->type
)
6623 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6624 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6625 TYPE_ARG_TYPES (b
->type
))))
6633 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6634 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6639 /* Given TYPE, and HASHCODE its hash code, return the canonical
6640 object for an identical type if one already exists.
6641 Otherwise, return TYPE, and record it as the canonical object.
6643 To use this function, first create a type of the sort you want.
6644 Then compute its hash code from the fields of the type that
6645 make it different from other similar types.
6646 Then call this function and use the value. */
6649 type_hash_canon (unsigned int hashcode
, tree type
)
6654 /* The hash table only contains main variants, so ensure that's what we're
6656 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6658 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6659 must call that routine before comparing TYPE_ALIGNs. */
6665 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6668 tree t1
= ((type_hash
*) *loc
)->type
;
6669 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6670 if (TYPE_UID (type
) + 1 == next_type_uid
)
6672 /* Free also min/max values and the cache for integer
6673 types. This can't be done in free_node, as LTO frees
6674 those on its own. */
6675 if (TREE_CODE (type
) == INTEGER_TYPE
)
6677 if (TYPE_MIN_VALUE (type
)
6678 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6680 /* Zero is always in TYPE_CACHED_VALUES. */
6681 if (! TYPE_UNSIGNED (type
))
6682 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6683 ggc_free (TYPE_MIN_VALUE (type
));
6685 if (TYPE_MAX_VALUE (type
)
6686 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6688 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6689 ggc_free (TYPE_MAX_VALUE (type
));
6691 if (TYPE_CACHED_VALUES_P (type
))
6692 ggc_free (TYPE_CACHED_VALUES (type
));
6699 struct type_hash
*h
;
6701 h
= ggc_alloc
<type_hash
> ();
6711 print_type_hash_statistics (void)
6713 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6714 (long) type_hash_table
->size (),
6715 (long) type_hash_table
->elements (),
6716 type_hash_table
->collisions ());
6719 /* Given two lists of types
6720 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6721 return 1 if the lists contain the same types in the same order.
6722 Also, the TREE_PURPOSEs must match. */
6725 type_list_equal (const_tree l1
, const_tree l2
)
6729 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6730 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6731 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6732 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6733 && (TREE_TYPE (TREE_PURPOSE (t1
))
6734 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6740 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6741 given by TYPE. If the argument list accepts variable arguments,
6742 then this function counts only the ordinary arguments. */
6745 type_num_arguments (const_tree type
)
6750 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6751 /* If the function does not take a variable number of arguments,
6752 the last element in the list will have type `void'. */
6753 if (VOID_TYPE_P (TREE_VALUE (t
)))
6761 /* Nonzero if integer constants T1 and T2
6762 represent the same constant value. */
6765 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6770 if (t1
== 0 || t2
== 0)
6773 if (TREE_CODE (t1
) == INTEGER_CST
6774 && TREE_CODE (t2
) == INTEGER_CST
6775 && wi::to_widest (t1
) == wi::to_widest (t2
))
6781 /* Return true if T is an INTEGER_CST whose numerical value (extended
6782 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6785 tree_fits_shwi_p (const_tree t
)
6787 return (t
!= NULL_TREE
6788 && TREE_CODE (t
) == INTEGER_CST
6789 && wi::fits_shwi_p (wi::to_widest (t
)));
6792 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6793 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6796 tree_fits_poly_int64_p (const_tree t
)
6800 if (POLY_INT_CST_P (t
))
6802 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6803 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
6807 return (TREE_CODE (t
) == INTEGER_CST
6808 && wi::fits_shwi_p (wi::to_widest (t
)));
6811 /* Return true if T is an INTEGER_CST whose numerical value (extended
6812 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6815 tree_fits_uhwi_p (const_tree t
)
6817 return (t
!= NULL_TREE
6818 && TREE_CODE (t
) == INTEGER_CST
6819 && wi::fits_uhwi_p (wi::to_widest (t
)));
6822 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6823 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6826 tree_fits_poly_uint64_p (const_tree t
)
6830 if (POLY_INT_CST_P (t
))
6832 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6833 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
6837 return (TREE_CODE (t
) == INTEGER_CST
6838 && wi::fits_uhwi_p (wi::to_widest (t
)));
6841 /* T is an INTEGER_CST whose numerical value (extended according to
6842 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6846 tree_to_shwi (const_tree t
)
6848 gcc_assert (tree_fits_shwi_p (t
));
6849 return TREE_INT_CST_LOW (t
);
6852 /* T is an INTEGER_CST whose numerical value (extended according to
6853 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6856 unsigned HOST_WIDE_INT
6857 tree_to_uhwi (const_tree t
)
6859 gcc_assert (tree_fits_uhwi_p (t
));
6860 return TREE_INT_CST_LOW (t
);
6863 /* Return the most significant (sign) bit of T. */
6866 tree_int_cst_sign_bit (const_tree t
)
6868 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6870 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6873 /* Return an indication of the sign of the integer constant T.
6874 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6875 Note that -1 will never be returned if T's type is unsigned. */
6878 tree_int_cst_sgn (const_tree t
)
6880 if (wi::to_wide (t
) == 0)
6882 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6884 else if (wi::neg_p (wi::to_wide (t
)))
6890 /* Return the minimum number of bits needed to represent VALUE in a
6891 signed or unsigned type, UNSIGNEDP says which. */
6894 tree_int_cst_min_precision (tree value
, signop sgn
)
6896 /* If the value is negative, compute its negative minus 1. The latter
6897 adjustment is because the absolute value of the largest negative value
6898 is one larger than the largest positive value. This is equivalent to
6899 a bit-wise negation, so use that operation instead. */
6901 if (tree_int_cst_sgn (value
) < 0)
6902 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6904 /* Return the number of bits needed, taking into account the fact
6905 that we need one more bit for a signed than unsigned type.
6906 If value is 0 or -1, the minimum precision is 1 no matter
6907 whether unsignedp is true or false. */
6909 if (integer_zerop (value
))
6912 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6915 /* Return truthvalue of whether T1 is the same tree structure as T2.
6916 Return 1 if they are the same.
6917 Return 0 if they are understandably different.
6918 Return -1 if either contains tree structure not understood by
6922 simple_cst_equal (const_tree t1
, const_tree t2
)
6924 enum tree_code code1
, code2
;
6930 if (t1
== 0 || t2
== 0)
6933 code1
= TREE_CODE (t1
);
6934 code2
= TREE_CODE (t2
);
6936 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6938 if (CONVERT_EXPR_CODE_P (code2
)
6939 || code2
== NON_LVALUE_EXPR
)
6940 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6942 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6945 else if (CONVERT_EXPR_CODE_P (code2
)
6946 || code2
== NON_LVALUE_EXPR
)
6947 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6955 return wi::to_widest (t1
) == wi::to_widest (t2
);
6958 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6961 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6964 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6965 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6966 TREE_STRING_LENGTH (t1
)));
6970 unsigned HOST_WIDE_INT idx
;
6971 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6972 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6974 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6977 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6978 /* ??? Should we handle also fields here? */
6979 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6985 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6988 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6991 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6994 const_tree arg1
, arg2
;
6995 const_call_expr_arg_iterator iter1
, iter2
;
6996 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6997 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6999 arg1
= next_const_call_expr_arg (&iter1
),
7000 arg2
= next_const_call_expr_arg (&iter2
))
7002 cmp
= simple_cst_equal (arg1
, arg2
);
7006 return arg1
== arg2
;
7010 /* Special case: if either target is an unallocated VAR_DECL,
7011 it means that it's going to be unified with whatever the
7012 TARGET_EXPR is really supposed to initialize, so treat it
7013 as being equivalent to anything. */
7014 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7015 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7016 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7017 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7018 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7019 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7022 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7027 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7029 case WITH_CLEANUP_EXPR
:
7030 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7034 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7037 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7038 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7049 if (POLY_INT_CST_P (t1
))
7050 /* A false return means maybe_ne rather than known_ne. */
7051 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7052 TYPE_SIGN (TREE_TYPE (t1
))),
7053 poly_widest_int::from (poly_int_cst_value (t2
),
7054 TYPE_SIGN (TREE_TYPE (t2
))));
7058 /* This general rule works for most tree codes. All exceptions should be
7059 handled above. If this is a language-specific tree code, we can't
7060 trust what might be in the operand, so say we don't know
7062 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7065 switch (TREE_CODE_CLASS (code1
))
7069 case tcc_comparison
:
7070 case tcc_expression
:
7074 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7076 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7088 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7089 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7090 than U, respectively. */
7093 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7095 if (tree_int_cst_sgn (t
) < 0)
7097 else if (!tree_fits_uhwi_p (t
))
7099 else if (TREE_INT_CST_LOW (t
) == u
)
7101 else if (TREE_INT_CST_LOW (t
) < u
)
7107 /* Return true if SIZE represents a constant size that is in bounds of
7108 what the middle-end and the backend accepts (covering not more than
7109 half of the address-space). */
7112 valid_constant_size_p (const_tree size
)
7114 if (POLY_INT_CST_P (size
))
7116 if (TREE_OVERFLOW (size
))
7118 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7119 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7123 if (! tree_fits_uhwi_p (size
)
7124 || TREE_OVERFLOW (size
)
7125 || tree_int_cst_sign_bit (size
) != 0)
7130 /* Return the precision of the type, or for a complex or vector type the
7131 precision of the type of its elements. */
7134 element_precision (const_tree type
)
7137 type
= TREE_TYPE (type
);
7138 enum tree_code code
= TREE_CODE (type
);
7139 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7140 type
= TREE_TYPE (type
);
7142 return TYPE_PRECISION (type
);
7145 /* Return true if CODE represents an associative tree code. Otherwise
7148 associative_tree_code (enum tree_code code
)
7167 /* Return true if CODE represents a commutative tree code. Otherwise
7170 commutative_tree_code (enum tree_code code
)
7176 case MULT_HIGHPART_EXPR
:
7184 case UNORDERED_EXPR
:
7188 case TRUTH_AND_EXPR
:
7189 case TRUTH_XOR_EXPR
:
7191 case WIDEN_MULT_EXPR
:
7192 case VEC_WIDEN_MULT_HI_EXPR
:
7193 case VEC_WIDEN_MULT_LO_EXPR
:
7194 case VEC_WIDEN_MULT_EVEN_EXPR
:
7195 case VEC_WIDEN_MULT_ODD_EXPR
:
7204 /* Return true if CODE represents a ternary tree code for which the
7205 first two operands are commutative. Otherwise return false. */
7207 commutative_ternary_tree_code (enum tree_code code
)
7211 case WIDEN_MULT_PLUS_EXPR
:
7212 case WIDEN_MULT_MINUS_EXPR
:
7223 /* Returns true if CODE can overflow. */
7226 operation_can_overflow (enum tree_code code
)
7234 /* Can overflow in various ways. */
7236 case TRUNC_DIV_EXPR
:
7237 case EXACT_DIV_EXPR
:
7238 case FLOOR_DIV_EXPR
:
7240 /* For INT_MIN / -1. */
7247 /* These operators cannot overflow. */
7252 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7253 ftrapv doesn't generate trapping insns for CODE. */
7256 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7258 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7260 /* We don't generate instructions that trap on overflow for complex or vector
7262 if (!INTEGRAL_TYPE_P (type
))
7265 if (!TYPE_OVERFLOW_TRAPS (type
))
7275 /* These operators can overflow, and -ftrapv generates trapping code for
7278 case TRUNC_DIV_EXPR
:
7279 case EXACT_DIV_EXPR
:
7280 case FLOOR_DIV_EXPR
:
7283 /* These operators can overflow, but -ftrapv does not generate trapping
7287 /* These operators cannot overflow. */
7295 /* Generate a hash value for an expression. This can be used iteratively
7296 by passing a previous result as the HSTATE argument.
7298 This function is intended to produce the same hash for expressions which
7299 would compare equal using operand_equal_p. */
7301 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7304 enum tree_code code
;
7305 enum tree_code_class tclass
;
7307 if (t
== NULL_TREE
|| t
== error_mark_node
)
7309 hstate
.merge_hash (0);
7313 if (!(flags
& OEP_ADDRESS_OF
))
7316 code
= TREE_CODE (t
);
7320 /* Alas, constants aren't shared, so we can't rely on pointer
7323 hstate
.merge_hash (0);
7326 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7327 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7328 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7333 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7336 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7337 hstate
.merge_hash (val2
);
7342 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7343 hstate
.merge_hash (val2
);
7347 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7348 TREE_STRING_LENGTH (t
));
7351 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7352 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7356 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7357 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7358 unsigned int count
= vector_cst_encoded_nelts (t
);
7359 for (unsigned int i
= 0; i
< count
; ++i
)
7360 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7364 /* We can just compare by pointer. */
7365 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7367 case PLACEHOLDER_EXPR
:
7368 /* The node itself doesn't matter. */
7375 /* A list of expressions, for a CALL_EXPR or as the elements of a
7377 for (; t
; t
= TREE_CHAIN (t
))
7378 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7382 unsigned HOST_WIDE_INT idx
;
7384 flags
&= ~OEP_ADDRESS_OF
;
7385 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7387 inchash::add_expr (field
, hstate
, flags
);
7388 inchash::add_expr (value
, hstate
, flags
);
7392 case STATEMENT_LIST
:
7394 tree_stmt_iterator i
;
7395 for (i
= tsi_start (CONST_CAST_TREE (t
));
7396 !tsi_end_p (i
); tsi_next (&i
))
7397 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7401 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7402 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7405 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7406 Otherwise nodes that compare equal according to operand_equal_p might
7407 get different hash codes. However, don't do this for machine specific
7408 or front end builtins, since the function code is overloaded in those
7410 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7411 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7413 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7414 code
= TREE_CODE (t
);
7418 if (POLY_INT_CST_P (t
))
7420 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7421 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7424 tclass
= TREE_CODE_CLASS (code
);
7426 if (tclass
== tcc_declaration
)
7428 /* DECL's have a unique ID */
7429 hstate
.add_hwi (DECL_UID (t
));
7431 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7433 /* For comparisons that can be swapped, use the lower
7435 enum tree_code ccode
= swap_tree_comparison (code
);
7438 hstate
.add_object (ccode
);
7439 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7440 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7442 else if (CONVERT_EXPR_CODE_P (code
))
7444 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7446 enum tree_code ccode
= NOP_EXPR
;
7447 hstate
.add_object (ccode
);
7449 /* Don't hash the type, that can lead to having nodes which
7450 compare equal according to operand_equal_p, but which
7451 have different hash codes. Make sure to include signedness
7452 in the hash computation. */
7453 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7454 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7456 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7457 else if (code
== MEM_REF
7458 && (flags
& OEP_ADDRESS_OF
) != 0
7459 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7460 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7461 && integer_zerop (TREE_OPERAND (t
, 1)))
7462 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7464 /* Don't ICE on FE specific trees, or their arguments etc.
7465 during operand_equal_p hash verification. */
7466 else if (!IS_EXPR_CODE_CLASS (tclass
))
7467 gcc_assert (flags
& OEP_HASH_CHECK
);
7470 unsigned int sflags
= flags
;
7472 hstate
.add_object (code
);
7477 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7478 flags
|= OEP_ADDRESS_OF
;
7484 case TARGET_MEM_REF
:
7485 flags
&= ~OEP_ADDRESS_OF
;
7490 case ARRAY_RANGE_REF
:
7493 sflags
&= ~OEP_ADDRESS_OF
;
7497 flags
&= ~OEP_ADDRESS_OF
;
7501 case WIDEN_MULT_PLUS_EXPR
:
7502 case WIDEN_MULT_MINUS_EXPR
:
7504 /* The multiplication operands are commutative. */
7505 inchash::hash one
, two
;
7506 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7507 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7508 hstate
.add_commutative (one
, two
);
7509 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7514 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7515 hstate
.add_int (CALL_EXPR_IFN (t
));
7519 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7520 Usually different TARGET_EXPRs just should use
7521 different temporaries in their slots. */
7522 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7529 /* Don't hash the type, that can lead to having nodes which
7530 compare equal according to operand_equal_p, but which
7531 have different hash codes. */
7532 if (code
== NON_LVALUE_EXPR
)
7534 /* Make sure to include signness in the hash computation. */
7535 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7536 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7539 else if (commutative_tree_code (code
))
7541 /* It's a commutative expression. We want to hash it the same
7542 however it appears. We do this by first hashing both operands
7543 and then rehashing based on the order of their independent
7545 inchash::hash one
, two
;
7546 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7547 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7548 hstate
.add_commutative (one
, two
);
7551 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7552 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7553 i
== 0 ? flags
: sflags
);
7561 /* Constructors for pointer, array and function types.
7562 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7563 constructed by language-dependent code, not here.) */
7565 /* Construct, lay out and return the type of pointers to TO_TYPE with
7566 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7567 reference all of memory. If such a type has already been
7568 constructed, reuse it. */
7571 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7575 bool could_alias
= can_alias_all
;
7577 if (to_type
== error_mark_node
)
7578 return error_mark_node
;
7580 /* If the pointed-to type has the may_alias attribute set, force
7581 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7582 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7583 can_alias_all
= true;
7585 /* In some cases, languages will have things that aren't a POINTER_TYPE
7586 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7587 In that case, return that type without regard to the rest of our
7590 ??? This is a kludge, but consistent with the way this function has
7591 always operated and there doesn't seem to be a good way to avoid this
7593 if (TYPE_POINTER_TO (to_type
) != 0
7594 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7595 return TYPE_POINTER_TO (to_type
);
7597 /* First, if we already have a type for pointers to TO_TYPE and it's
7598 the proper mode, use it. */
7599 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7600 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7603 t
= make_node (POINTER_TYPE
);
7605 TREE_TYPE (t
) = to_type
;
7606 SET_TYPE_MODE (t
, mode
);
7607 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7608 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7609 TYPE_POINTER_TO (to_type
) = t
;
7611 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7612 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7613 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7614 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7616 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7619 /* Lay out the type. This function has many callers that are concerned
7620 with expression-construction, and this simplifies them all. */
7626 /* By default build pointers in ptr_mode. */
7629 build_pointer_type (tree to_type
)
7631 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7632 : TYPE_ADDR_SPACE (to_type
);
7633 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7634 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7637 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7640 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7644 bool could_alias
= can_alias_all
;
7646 if (to_type
== error_mark_node
)
7647 return error_mark_node
;
7649 /* If the pointed-to type has the may_alias attribute set, force
7650 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7651 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7652 can_alias_all
= true;
7654 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7655 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7656 In that case, return that type without regard to the rest of our
7659 ??? This is a kludge, but consistent with the way this function has
7660 always operated and there doesn't seem to be a good way to avoid this
7662 if (TYPE_REFERENCE_TO (to_type
) != 0
7663 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7664 return TYPE_REFERENCE_TO (to_type
);
7666 /* First, if we already have a type for pointers to TO_TYPE and it's
7667 the proper mode, use it. */
7668 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7669 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7672 t
= make_node (REFERENCE_TYPE
);
7674 TREE_TYPE (t
) = to_type
;
7675 SET_TYPE_MODE (t
, mode
);
7676 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7677 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7678 TYPE_REFERENCE_TO (to_type
) = t
;
7680 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7681 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7682 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7683 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7685 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7694 /* Build the node for the type of references-to-TO_TYPE by default
7698 build_reference_type (tree to_type
)
7700 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7701 : TYPE_ADDR_SPACE (to_type
);
7702 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7703 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7706 #define MAX_INT_CACHED_PREC \
7707 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7708 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7710 /* Builds a signed or unsigned integer type of precision PRECISION.
7711 Used for C bitfields whose precision does not match that of
7712 built-in target types. */
7714 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7720 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7722 if (precision
<= MAX_INT_CACHED_PREC
)
7724 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7729 itype
= make_node (INTEGER_TYPE
);
7730 TYPE_PRECISION (itype
) = precision
;
7733 fixup_unsigned_type (itype
);
7735 fixup_signed_type (itype
);
7739 inchash::hash hstate
;
7740 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7741 ret
= type_hash_canon (hstate
.end (), itype
);
7742 if (precision
<= MAX_INT_CACHED_PREC
)
7743 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7748 #define MAX_BOOL_CACHED_PREC \
7749 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7750 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7752 /* Builds a boolean type of precision PRECISION.
7753 Used for boolean vectors to choose proper vector element size. */
7755 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7759 if (precision
<= MAX_BOOL_CACHED_PREC
)
7761 type
= nonstandard_boolean_type_cache
[precision
];
7766 type
= make_node (BOOLEAN_TYPE
);
7767 TYPE_PRECISION (type
) = precision
;
7768 fixup_signed_type (type
);
7770 if (precision
<= MAX_INT_CACHED_PREC
)
7771 nonstandard_boolean_type_cache
[precision
] = type
;
7776 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7777 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7778 is true, reuse such a type that has already been constructed. */
7781 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7783 tree itype
= make_node (INTEGER_TYPE
);
7785 TREE_TYPE (itype
) = type
;
7787 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7788 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7790 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7791 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7792 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7793 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7794 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7795 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7796 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7801 if ((TYPE_MIN_VALUE (itype
)
7802 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7803 || (TYPE_MAX_VALUE (itype
)
7804 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7806 /* Since we cannot reliably merge this type, we need to compare it using
7807 structural equality checks. */
7808 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7812 hashval_t hash
= type_hash_canon_hash (itype
);
7813 itype
= type_hash_canon (hash
, itype
);
7818 /* Wrapper around build_range_type_1 with SHARED set to true. */
7821 build_range_type (tree type
, tree lowval
, tree highval
)
7823 return build_range_type_1 (type
, lowval
, highval
, true);
7826 /* Wrapper around build_range_type_1 with SHARED set to false. */
7829 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7831 return build_range_type_1 (type
, lowval
, highval
, false);
7834 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7835 MAXVAL should be the maximum value in the domain
7836 (one less than the length of the array).
7838 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7839 We don't enforce this limit, that is up to caller (e.g. language front end).
7840 The limit exists because the result is a signed type and we don't handle
7841 sizes that use more than one HOST_WIDE_INT. */
7844 build_index_type (tree maxval
)
7846 return build_range_type (sizetype
, size_zero_node
, maxval
);
7849 /* Return true if the debug information for TYPE, a subtype, should be emitted
7850 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7851 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7852 debug info and doesn't reflect the source code. */
7855 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7857 tree base_type
= TREE_TYPE (type
), low
, high
;
7859 /* Subrange types have a base type which is an integral type. */
7860 if (!INTEGRAL_TYPE_P (base_type
))
7863 /* Get the real bounds of the subtype. */
7864 if (lang_hooks
.types
.get_subrange_bounds
)
7865 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7868 low
= TYPE_MIN_VALUE (type
);
7869 high
= TYPE_MAX_VALUE (type
);
7872 /* If the type and its base type have the same representation and the same
7873 name, then the type is not a subrange but a copy of the base type. */
7874 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7875 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7876 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7877 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7878 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7879 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7889 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7890 and number of elements specified by the range of values of INDEX_TYPE.
7891 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7892 If SHARED is true, reuse such a type that has already been constructed. */
7895 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7900 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7902 error ("arrays of functions are not meaningful");
7903 elt_type
= integer_type_node
;
7906 t
= make_node (ARRAY_TYPE
);
7907 TREE_TYPE (t
) = elt_type
;
7908 TYPE_DOMAIN (t
) = index_type
;
7909 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7910 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7913 /* If the element type is incomplete at this point we get marked for
7914 structural equality. Do not record these types in the canonical
7916 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7921 hashval_t hash
= type_hash_canon_hash (t
);
7922 t
= type_hash_canon (hash
, t
);
7925 if (TYPE_CANONICAL (t
) == t
)
7927 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7928 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7930 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7931 else if (TYPE_CANONICAL (elt_type
) != elt_type
7932 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7934 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7936 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7937 typeless_storage
, shared
);
7943 /* Wrapper around build_array_type_1 with SHARED set to true. */
7946 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7948 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7951 /* Wrapper around build_array_type_1 with SHARED set to false. */
7954 build_nonshared_array_type (tree elt_type
, tree index_type
)
7956 return build_array_type_1 (elt_type
, index_type
, false, false);
7959 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7963 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
7965 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7968 /* Recursively examines the array elements of TYPE, until a non-array
7969 element type is found. */
7972 strip_array_types (tree type
)
7974 while (TREE_CODE (type
) == ARRAY_TYPE
)
7975 type
= TREE_TYPE (type
);
7980 /* Computes the canonical argument types from the argument type list
7983 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7984 on entry to this function, or if any of the ARGTYPES are
7987 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7988 true on entry to this function, or if any of the ARGTYPES are
7991 Returns a canonical argument list, which may be ARGTYPES when the
7992 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7993 true) or would not differ from ARGTYPES. */
7996 maybe_canonicalize_argtypes (tree argtypes
,
7997 bool *any_structural_p
,
7998 bool *any_noncanonical_p
)
8001 bool any_noncanonical_argtypes_p
= false;
8003 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8005 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8006 /* Fail gracefully by stating that the type is structural. */
8007 *any_structural_p
= true;
8008 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8009 *any_structural_p
= true;
8010 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8011 || TREE_PURPOSE (arg
))
8012 /* If the argument has a default argument, we consider it
8013 non-canonical even though the type itself is canonical.
8014 That way, different variants of function and method types
8015 with default arguments will all point to the variant with
8016 no defaults as their canonical type. */
8017 any_noncanonical_argtypes_p
= true;
8020 if (*any_structural_p
)
8023 if (any_noncanonical_argtypes_p
)
8025 /* Build the canonical list of argument types. */
8026 tree canon_argtypes
= NULL_TREE
;
8027 bool is_void
= false;
8029 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8031 if (arg
== void_list_node
)
8034 canon_argtypes
= tree_cons (NULL_TREE
,
8035 TYPE_CANONICAL (TREE_VALUE (arg
)),
8039 canon_argtypes
= nreverse (canon_argtypes
);
8041 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8043 /* There is a non-canonical type. */
8044 *any_noncanonical_p
= true;
8045 return canon_argtypes
;
8048 /* The canonical argument types are the same as ARGTYPES. */
8052 /* Construct, lay out and return
8053 the type of functions returning type VALUE_TYPE
8054 given arguments of types ARG_TYPES.
8055 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8056 are data type nodes for the arguments of the function.
8057 If such a type has already been constructed, reuse it. */
8060 build_function_type (tree value_type
, tree arg_types
)
8063 inchash::hash hstate
;
8064 bool any_structural_p
, any_noncanonical_p
;
8065 tree canon_argtypes
;
8067 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8069 error ("function return type cannot be function");
8070 value_type
= integer_type_node
;
8073 /* Make a node of the sort we want. */
8074 t
= make_node (FUNCTION_TYPE
);
8075 TREE_TYPE (t
) = value_type
;
8076 TYPE_ARG_TYPES (t
) = arg_types
;
8078 /* If we already have such a type, use the old one. */
8079 hashval_t hash
= type_hash_canon_hash (t
);
8080 t
= type_hash_canon (hash
, t
);
8082 /* Set up the canonical type. */
8083 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8084 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8085 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8087 &any_noncanonical_p
);
8088 if (any_structural_p
)
8089 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8090 else if (any_noncanonical_p
)
8091 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8094 if (!COMPLETE_TYPE_P (t
))
8099 /* Build a function type. The RETURN_TYPE is the type returned by the
8100 function. If VAARGS is set, no void_type_node is appended to the
8101 list. ARGP must be always be terminated be a NULL_TREE. */
8104 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8108 t
= va_arg (argp
, tree
);
8109 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8110 args
= tree_cons (NULL_TREE
, t
, args
);
8115 if (args
!= NULL_TREE
)
8116 args
= nreverse (args
);
8117 gcc_assert (last
!= void_list_node
);
8119 else if (args
== NULL_TREE
)
8120 args
= void_list_node
;
8124 args
= nreverse (args
);
8125 TREE_CHAIN (last
) = void_list_node
;
8127 args
= build_function_type (return_type
, args
);
8132 /* Build a function type. The RETURN_TYPE is the type returned by the
8133 function. If additional arguments are provided, they are
8134 additional argument types. The list of argument types must always
8135 be terminated by NULL_TREE. */
8138 build_function_type_list (tree return_type
, ...)
8143 va_start (p
, return_type
);
8144 args
= build_function_type_list_1 (false, return_type
, p
);
8149 /* Build a variable argument function type. The RETURN_TYPE is the
8150 type returned by the function. If additional arguments are provided,
8151 they are additional argument types. The list of argument types must
8152 always be terminated by NULL_TREE. */
8155 build_varargs_function_type_list (tree return_type
, ...)
8160 va_start (p
, return_type
);
8161 args
= build_function_type_list_1 (true, return_type
, p
);
8167 /* Build a function type. RETURN_TYPE is the type returned by the
8168 function; VAARGS indicates whether the function takes varargs. The
8169 function takes N named arguments, the types of which are provided in
8173 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8177 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8179 for (i
= n
- 1; i
>= 0; i
--)
8180 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8182 return build_function_type (return_type
, t
);
8185 /* Build a function type. RETURN_TYPE is the type returned by the
8186 function. The function takes N named arguments, the types of which
8187 are provided in ARG_TYPES. */
8190 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8192 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8195 /* Build a variable argument function type. RETURN_TYPE is the type
8196 returned by the function. The function takes N named arguments, the
8197 types of which are provided in ARG_TYPES. */
8200 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8202 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8205 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8206 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8207 for the method. An implicit additional parameter (of type
8208 pointer-to-BASETYPE) is added to the ARGTYPES. */
8211 build_method_type_directly (tree basetype
,
8217 bool any_structural_p
, any_noncanonical_p
;
8218 tree canon_argtypes
;
8220 /* Make a node of the sort we want. */
8221 t
= make_node (METHOD_TYPE
);
8223 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8224 TREE_TYPE (t
) = rettype
;
8225 ptype
= build_pointer_type (basetype
);
8227 /* The actual arglist for this function includes a "hidden" argument
8228 which is "this". Put it into the list of argument types. */
8229 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8230 TYPE_ARG_TYPES (t
) = argtypes
;
8232 /* If we already have such a type, use the old one. */
8233 hashval_t hash
= type_hash_canon_hash (t
);
8234 t
= type_hash_canon (hash
, t
);
8236 /* Set up the canonical type. */
8238 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8239 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8241 = (TYPE_CANONICAL (basetype
) != basetype
8242 || TYPE_CANONICAL (rettype
) != rettype
);
8243 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8245 &any_noncanonical_p
);
8246 if (any_structural_p
)
8247 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8248 else if (any_noncanonical_p
)
8250 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8251 TYPE_CANONICAL (rettype
),
8253 if (!COMPLETE_TYPE_P (t
))
8259 /* Construct, lay out and return the type of methods belonging to class
8260 BASETYPE and whose arguments and values are described by TYPE.
8261 If that type exists already, reuse it.
8262 TYPE must be a FUNCTION_TYPE node. */
8265 build_method_type (tree basetype
, tree type
)
8267 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8269 return build_method_type_directly (basetype
,
8271 TYPE_ARG_TYPES (type
));
8274 /* Construct, lay out and return the type of offsets to a value
8275 of type TYPE, within an object of type BASETYPE.
8276 If a suitable offset type exists already, reuse it. */
8279 build_offset_type (tree basetype
, tree type
)
8283 /* Make a node of the sort we want. */
8284 t
= make_node (OFFSET_TYPE
);
8286 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8287 TREE_TYPE (t
) = type
;
8289 /* If we already have such a type, use the old one. */
8290 hashval_t hash
= type_hash_canon_hash (t
);
8291 t
= type_hash_canon (hash
, t
);
8293 if (!COMPLETE_TYPE_P (t
))
8296 if (TYPE_CANONICAL (t
) == t
)
8298 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8299 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8300 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8301 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8302 || TYPE_CANONICAL (type
) != type
)
8304 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8305 TYPE_CANONICAL (type
));
8311 /* Create a complex type whose components are COMPONENT_TYPE.
8313 If NAMED is true, the type is given a TYPE_NAME. We do not always
8314 do so because this creates a DECL node and thus make the DECL_UIDs
8315 dependent on the type canonicalization hashtable, which is GC-ed,
8316 so the DECL_UIDs would not be stable wrt garbage collection. */
8319 build_complex_type (tree component_type
, bool named
)
8321 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8322 || SCALAR_FLOAT_TYPE_P (component_type
)
8323 || FIXED_POINT_TYPE_P (component_type
));
8325 /* Make a node of the sort we want. */
8326 tree probe
= make_node (COMPLEX_TYPE
);
8328 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8330 /* If we already have such a type, use the old one. */
8331 hashval_t hash
= type_hash_canon_hash (probe
);
8332 tree t
= type_hash_canon (hash
, probe
);
8336 /* We created a new type. The hash insertion will have laid
8337 out the type. We need to check the canonicalization and
8338 maybe set the name. */
8339 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8341 && TYPE_CANONICAL (t
) == t
);
8343 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8344 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8345 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8347 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8349 /* We need to create a name, since complex is a fundamental type. */
8352 const char *name
= NULL
;
8354 if (TREE_TYPE (t
) == char_type_node
)
8355 name
= "complex char";
8356 else if (TREE_TYPE (t
) == signed_char_type_node
)
8357 name
= "complex signed char";
8358 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8359 name
= "complex unsigned char";
8360 else if (TREE_TYPE (t
) == short_integer_type_node
)
8361 name
= "complex short int";
8362 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8363 name
= "complex short unsigned int";
8364 else if (TREE_TYPE (t
) == integer_type_node
)
8365 name
= "complex int";
8366 else if (TREE_TYPE (t
) == unsigned_type_node
)
8367 name
= "complex unsigned int";
8368 else if (TREE_TYPE (t
) == long_integer_type_node
)
8369 name
= "complex long int";
8370 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8371 name
= "complex long unsigned int";
8372 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8373 name
= "complex long long int";
8374 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8375 name
= "complex long long unsigned int";
8378 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8379 get_identifier (name
), t
);
8383 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8386 /* If TYPE is a real or complex floating-point type and the target
8387 does not directly support arithmetic on TYPE then return the wider
8388 type to be used for arithmetic on TYPE. Otherwise, return
8392 excess_precision_type (tree type
)
8394 /* The target can give two different responses to the question of
8395 which excess precision mode it would like depending on whether we
8396 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8398 enum excess_precision_type requested_type
8399 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8400 ? EXCESS_PRECISION_TYPE_FAST
8401 : EXCESS_PRECISION_TYPE_STANDARD
);
8403 enum flt_eval_method target_flt_eval_method
8404 = targetm
.c
.excess_precision (requested_type
);
8406 /* The target should not ask for unpredictable float evaluation (though
8407 it might advertise that implicitly the evaluation is unpredictable,
8408 but we don't care about that here, it will have been reported
8409 elsewhere). If it does ask for unpredictable evaluation, we have
8410 nothing to do here. */
8411 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8413 /* Nothing to do. The target has asked for all types we know about
8414 to be computed with their native precision and range. */
8415 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8418 /* The target will promote this type in a target-dependent way, so excess
8419 precision ought to leave it alone. */
8420 if (targetm
.promoted_type (type
) != NULL_TREE
)
8423 machine_mode float16_type_mode
= (float16_type_node
8424 ? TYPE_MODE (float16_type_node
)
8426 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8427 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8429 switch (TREE_CODE (type
))
8433 machine_mode type_mode
= TYPE_MODE (type
);
8434 switch (target_flt_eval_method
)
8436 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8437 if (type_mode
== float16_type_mode
)
8438 return float_type_node
;
8440 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8441 if (type_mode
== float16_type_mode
8442 || type_mode
== float_type_mode
)
8443 return double_type_node
;
8445 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8446 if (type_mode
== float16_type_mode
8447 || type_mode
== float_type_mode
8448 || type_mode
== double_type_mode
)
8449 return long_double_type_node
;
8458 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8460 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8461 switch (target_flt_eval_method
)
8463 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8464 if (type_mode
== float16_type_mode
)
8465 return complex_float_type_node
;
8467 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8468 if (type_mode
== float16_type_mode
8469 || type_mode
== float_type_mode
)
8470 return complex_double_type_node
;
8472 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8473 if (type_mode
== float16_type_mode
8474 || type_mode
== float_type_mode
8475 || type_mode
== double_type_mode
)
8476 return complex_long_double_type_node
;
8490 /* Return OP, stripped of any conversions to wider types as much as is safe.
8491 Converting the value back to OP's type makes a value equivalent to OP.
8493 If FOR_TYPE is nonzero, we return a value which, if converted to
8494 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8496 OP must have integer, real or enumeral type. Pointers are not allowed!
8498 There are some cases where the obvious value we could return
8499 would regenerate to OP if converted to OP's type,
8500 but would not extend like OP to wider types.
8501 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8502 For example, if OP is (unsigned short)(signed char)-1,
8503 we avoid returning (signed char)-1 if FOR_TYPE is int,
8504 even though extending that to an unsigned short would regenerate OP,
8505 since the result of extending (signed char)-1 to (int)
8506 is different from (int) OP. */
8509 get_unwidened (tree op
, tree for_type
)
8511 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8512 tree type
= TREE_TYPE (op
);
8514 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8516 = (for_type
!= 0 && for_type
!= type
8517 && final_prec
> TYPE_PRECISION (type
)
8518 && TYPE_UNSIGNED (type
));
8521 while (CONVERT_EXPR_P (op
))
8525 /* TYPE_PRECISION on vector types has different meaning
8526 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8527 so avoid them here. */
8528 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8531 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8532 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8534 /* Truncations are many-one so cannot be removed.
8535 Unless we are later going to truncate down even farther. */
8537 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8540 /* See what's inside this conversion. If we decide to strip it,
8542 op
= TREE_OPERAND (op
, 0);
8544 /* If we have not stripped any zero-extensions (uns is 0),
8545 we can strip any kind of extension.
8546 If we have previously stripped a zero-extension,
8547 only zero-extensions can safely be stripped.
8548 Any extension can be stripped if the bits it would produce
8549 are all going to be discarded later by truncating to FOR_TYPE. */
8553 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8555 /* TYPE_UNSIGNED says whether this is a zero-extension.
8556 Let's avoid computing it if it does not affect WIN
8557 and if UNS will not be needed again. */
8559 || CONVERT_EXPR_P (op
))
8560 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8568 /* If we finally reach a constant see if it fits in sth smaller and
8569 in that case convert it. */
8570 if (TREE_CODE (win
) == INTEGER_CST
)
8572 tree wtype
= TREE_TYPE (win
);
8573 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8575 prec
= MAX (prec
, final_prec
);
8576 if (prec
< TYPE_PRECISION (wtype
))
8578 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8579 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8580 win
= fold_convert (t
, win
);
8587 /* Return OP or a simpler expression for a narrower value
8588 which can be sign-extended or zero-extended to give back OP.
8589 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8590 or 0 if the value should be sign-extended. */
8593 get_narrower (tree op
, int *unsignedp_ptr
)
8598 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8600 while (TREE_CODE (op
) == NOP_EXPR
)
8603 = (TYPE_PRECISION (TREE_TYPE (op
))
8604 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8606 /* Truncations are many-one so cannot be removed. */
8610 /* See what's inside this conversion. If we decide to strip it,
8615 op
= TREE_OPERAND (op
, 0);
8616 /* An extension: the outermost one can be stripped,
8617 but remember whether it is zero or sign extension. */
8619 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8620 /* Otherwise, if a sign extension has been stripped,
8621 only sign extensions can now be stripped;
8622 if a zero extension has been stripped, only zero-extensions. */
8623 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8627 else /* bitschange == 0 */
8629 /* A change in nominal type can always be stripped, but we must
8630 preserve the unsignedness. */
8632 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8634 op
= TREE_OPERAND (op
, 0);
8635 /* Keep trying to narrow, but don't assign op to win if it
8636 would turn an integral type into something else. */
8637 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8644 if (TREE_CODE (op
) == COMPONENT_REF
8645 /* Since type_for_size always gives an integer type. */
8646 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8647 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8648 /* Ensure field is laid out already. */
8649 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8650 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8652 unsigned HOST_WIDE_INT innerprec
8653 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8654 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8655 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8656 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8658 /* We can get this structure field in a narrower type that fits it,
8659 but the resulting extension to its nominal type (a fullword type)
8660 must satisfy the same conditions as for other extensions.
8662 Do this only for fields that are aligned (not bit-fields),
8663 because when bit-field insns will be used there is no
8664 advantage in doing this. */
8666 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8667 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8668 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8672 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8673 win
= fold_convert (type
, op
);
8677 *unsignedp_ptr
= uns
;
8681 /* Return true if integer constant C has a value that is permissible
8682 for TYPE, an integral type. */
8685 int_fits_type_p (const_tree c
, const_tree type
)
8687 tree type_low_bound
, type_high_bound
;
8688 bool ok_for_low_bound
, ok_for_high_bound
;
8689 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8691 /* Non-standard boolean types can have arbitrary precision but various
8692 transformations assume that they can only take values 0 and +/-1. */
8693 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8694 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8697 type_low_bound
= TYPE_MIN_VALUE (type
);
8698 type_high_bound
= TYPE_MAX_VALUE (type
);
8700 /* If at least one bound of the type is a constant integer, we can check
8701 ourselves and maybe make a decision. If no such decision is possible, but
8702 this type is a subtype, try checking against that. Otherwise, use
8703 fits_to_tree_p, which checks against the precision.
8705 Compute the status for each possibly constant bound, and return if we see
8706 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8707 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8708 for "constant known to fit". */
8710 /* Check if c >= type_low_bound. */
8711 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8713 if (tree_int_cst_lt (c
, type_low_bound
))
8715 ok_for_low_bound
= true;
8718 ok_for_low_bound
= false;
8720 /* Check if c <= type_high_bound. */
8721 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8723 if (tree_int_cst_lt (type_high_bound
, c
))
8725 ok_for_high_bound
= true;
8728 ok_for_high_bound
= false;
8730 /* If the constant fits both bounds, the result is known. */
8731 if (ok_for_low_bound
&& ok_for_high_bound
)
8734 /* Perform some generic filtering which may allow making a decision
8735 even if the bounds are not constant. First, negative integers
8736 never fit in unsigned types, */
8737 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8740 /* Second, narrower types always fit in wider ones. */
8741 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8744 /* Third, unsigned integers with top bit set never fit signed types. */
8745 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8747 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8748 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8750 /* When a tree_cst is converted to a wide-int, the precision
8751 is taken from the type. However, if the precision of the
8752 mode underneath the type is smaller than that, it is
8753 possible that the value will not fit. The test below
8754 fails if any bit is set between the sign bit of the
8755 underlying mode and the top bit of the type. */
8756 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8759 else if (wi::neg_p (wi::to_wide (c
)))
8763 /* If we haven't been able to decide at this point, there nothing more we
8764 can check ourselves here. Look at the base type if we have one and it
8765 has the same precision. */
8766 if (TREE_CODE (type
) == INTEGER_TYPE
8767 && TREE_TYPE (type
) != 0
8768 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8770 type
= TREE_TYPE (type
);
8774 /* Or to fits_to_tree_p, if nothing else. */
8775 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8778 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8779 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8780 represented (assuming two's-complement arithmetic) within the bit
8781 precision of the type are returned instead. */
8784 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8786 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8787 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8788 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8791 if (TYPE_UNSIGNED (type
))
8792 mpz_set_ui (min
, 0);
8795 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8796 wi::to_mpz (mn
, min
, SIGNED
);
8800 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8801 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8802 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8805 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8806 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8810 /* Return true if VAR is an automatic variable defined in function FN. */
8813 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8815 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8816 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8817 || TREE_CODE (var
) == PARM_DECL
)
8818 && ! TREE_STATIC (var
))
8819 || TREE_CODE (var
) == LABEL_DECL
8820 || TREE_CODE (var
) == RESULT_DECL
));
8823 /* Subprogram of following function. Called by walk_tree.
8825 Return *TP if it is an automatic variable or parameter of the
8826 function passed in as DATA. */
8829 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8831 tree fn
= (tree
) data
;
8836 else if (DECL_P (*tp
)
8837 && auto_var_in_fn_p (*tp
, fn
))
8843 /* Returns true if T is, contains, or refers to a type with variable
8844 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8845 arguments, but not the return type. If FN is nonzero, only return
8846 true if a modifier of the type or position of FN is a variable or
8847 parameter inside FN.
8849 This concept is more general than that of C99 'variably modified types':
8850 in C99, a struct type is never variably modified because a VLA may not
8851 appear as a structure member. However, in GNU C code like:
8853 struct S { int i[f()]; };
8855 is valid, and other languages may define similar constructs. */
8858 variably_modified_type_p (tree type
, tree fn
)
8862 /* Test if T is either variable (if FN is zero) or an expression containing
8863 a variable in FN. If TYPE isn't gimplified, return true also if
8864 gimplify_one_sizepos would gimplify the expression into a local
8866 #define RETURN_TRUE_IF_VAR(T) \
8867 do { tree _t = (T); \
8868 if (_t != NULL_TREE \
8869 && _t != error_mark_node \
8870 && TREE_CODE (_t) != INTEGER_CST \
8871 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8873 || (!TYPE_SIZES_GIMPLIFIED (type) \
8874 && !is_gimple_sizepos (_t)) \
8875 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8876 return true; } while (0)
8878 if (type
== error_mark_node
)
8881 /* If TYPE itself has variable size, it is variably modified. */
8882 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8883 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8885 switch (TREE_CODE (type
))
8888 case REFERENCE_TYPE
:
8890 /* Ada can have pointer types refering to themselves indirectly. */
8891 if (TREE_VISITED (type
))
8893 TREE_VISITED (type
) = true;
8894 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8896 TREE_VISITED (type
) = false;
8899 TREE_VISITED (type
) = false;
8904 /* If TYPE is a function type, it is variably modified if the
8905 return type is variably modified. */
8906 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8912 case FIXED_POINT_TYPE
:
8915 /* Scalar types are variably modified if their end points
8917 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8918 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8923 case QUAL_UNION_TYPE
:
8924 /* We can't see if any of the fields are variably-modified by the
8925 definition we normally use, since that would produce infinite
8926 recursion via pointers. */
8927 /* This is variably modified if some field's type is. */
8928 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8929 if (TREE_CODE (t
) == FIELD_DECL
)
8931 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8932 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8933 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8935 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8936 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8941 /* Do not call ourselves to avoid infinite recursion. This is
8942 variably modified if the element type is. */
8943 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8944 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8951 /* The current language may have other cases to check, but in general,
8952 all other types are not variably modified. */
8953 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8955 #undef RETURN_TRUE_IF_VAR
8958 /* Given a DECL or TYPE, return the scope in which it was declared, or
8959 NULL_TREE if there is no containing scope. */
8962 get_containing_scope (const_tree t
)
8964 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8967 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8970 get_ultimate_context (const_tree decl
)
8972 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8974 if (TREE_CODE (decl
) == BLOCK
)
8975 decl
= BLOCK_SUPERCONTEXT (decl
);
8977 decl
= get_containing_scope (decl
);
8982 /* Return the innermost context enclosing DECL that is
8983 a FUNCTION_DECL, or zero if none. */
8986 decl_function_context (const_tree decl
)
8990 if (TREE_CODE (decl
) == ERROR_MARK
)
8993 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8994 where we look up the function at runtime. Such functions always take
8995 a first argument of type 'pointer to real context'.
8997 C++ should really be fixed to use DECL_CONTEXT for the real context,
8998 and use something else for the "virtual context". */
8999 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9002 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9004 context
= DECL_CONTEXT (decl
);
9006 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9008 if (TREE_CODE (context
) == BLOCK
)
9009 context
= BLOCK_SUPERCONTEXT (context
);
9011 context
= get_containing_scope (context
);
9017 /* Return the innermost context enclosing DECL that is
9018 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9019 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9022 decl_type_context (const_tree decl
)
9024 tree context
= DECL_CONTEXT (decl
);
9027 switch (TREE_CODE (context
))
9029 case NAMESPACE_DECL
:
9030 case TRANSLATION_UNIT_DECL
:
9035 case QUAL_UNION_TYPE
:
9040 context
= DECL_CONTEXT (context
);
9044 context
= BLOCK_SUPERCONTEXT (context
);
9054 /* CALL is a CALL_EXPR. Return the declaration for the function
9055 called, or NULL_TREE if the called function cannot be
9059 get_callee_fndecl (const_tree call
)
9063 if (call
== error_mark_node
)
9064 return error_mark_node
;
9066 /* It's invalid to call this function with anything but a
9068 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9070 /* The first operand to the CALL is the address of the function
9072 addr
= CALL_EXPR_FN (call
);
9074 /* If there is no function, return early. */
9075 if (addr
== NULL_TREE
)
9080 /* If this is a readonly function pointer, extract its initial value. */
9081 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9082 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9083 && DECL_INITIAL (addr
))
9084 addr
= DECL_INITIAL (addr
);
9086 /* If the address is just `&f' for some function `f', then we know
9087 that `f' is being called. */
9088 if (TREE_CODE (addr
) == ADDR_EXPR
9089 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9090 return TREE_OPERAND (addr
, 0);
9092 /* We couldn't figure out what was being called. */
9096 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9097 return the associated function code, otherwise return CFN_LAST. */
9100 get_call_combined_fn (const_tree call
)
9102 /* It's invalid to call this function with anything but a CALL_EXPR. */
9103 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9105 if (!CALL_EXPR_FN (call
))
9106 return as_combined_fn (CALL_EXPR_IFN (call
));
9108 tree fndecl
= get_callee_fndecl (call
);
9109 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9110 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9115 #define TREE_MEM_USAGE_SPACES 40
9117 /* Print debugging information about tree nodes generated during the compile,
9118 and any language-specific information. */
9121 dump_tree_statistics (void)
9123 if (GATHER_STATISTICS
)
9126 uint64_t total_nodes
, total_bytes
;
9127 fprintf (stderr
, "\nKind Nodes Bytes\n");
9128 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9129 total_nodes
= total_bytes
= 0;
9130 for (i
= 0; i
< (int) all_kinds
; i
++)
9132 fprintf (stderr
, "%-20s %7" PRIu64
" %10" PRIu64
"\n",
9133 tree_node_kind_names
[i
], tree_node_counts
[i
],
9134 tree_node_sizes
[i
]);
9135 total_nodes
+= tree_node_counts
[i
];
9136 total_bytes
+= tree_node_sizes
[i
];
9138 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9139 fprintf (stderr
, "%-20s %7" PRIu64
" %10" PRIu64
"\n", "Total",
9140 total_nodes
, total_bytes
);
9141 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9142 fprintf (stderr
, "Code Nodes\n");
9143 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9144 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9145 fprintf (stderr
, "%-32s %7" PRIu64
"\n",
9146 get_tree_code_name ((enum tree_code
) i
), tree_code_counts
[i
]);
9147 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9148 fprintf (stderr
, "\n");
9149 ssanames_print_statistics ();
9150 fprintf (stderr
, "\n");
9151 phinodes_print_statistics ();
9152 fprintf (stderr
, "\n");
9155 fprintf (stderr
, "(No per-node statistics)\n");
9157 print_type_hash_statistics ();
9158 print_debug_expr_statistics ();
9159 print_value_expr_statistics ();
9160 lang_hooks
.print_statistics ();
9163 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9165 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9168 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9170 /* This relies on the raw feedback's top 4 bits being zero. */
9171 #define FEEDBACK(X) ((X) * 0x04c11db7)
9172 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9173 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9174 static const unsigned syndromes
[16] =
9176 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9177 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9178 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9179 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9184 value
<<= (32 - bytes
* 8);
9185 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9187 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9189 chksum
= (chksum
<< 4) ^ feedback
;
9195 /* Generate a crc32 of a string. */
9198 crc32_string (unsigned chksum
, const char *string
)
9201 chksum
= crc32_byte (chksum
, *string
);
9206 /* P is a string that will be used in a symbol. Mask out any characters
9207 that are not valid in that context. */
9210 clean_symbol_name (char *p
)
9214 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9217 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9224 /* For anonymous aggregate types, we need some sort of name to
9225 hold on to. In practice, this should not appear, but it should
9226 not be harmful if it does. */
9228 anon_aggrname_p(const_tree id_node
)
9230 #ifndef NO_DOT_IN_LABEL
9231 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9232 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9233 #else /* NO_DOT_IN_LABEL */
9234 #ifndef NO_DOLLAR_IN_LABEL
9235 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9236 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9237 #else /* NO_DOLLAR_IN_LABEL */
9238 #define ANON_AGGRNAME_PREFIX "__anon_"
9239 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9240 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9241 #endif /* NO_DOLLAR_IN_LABEL */
9242 #endif /* NO_DOT_IN_LABEL */
9245 /* Return a format for an anonymous aggregate name. */
9247 anon_aggrname_format()
9249 #ifndef NO_DOT_IN_LABEL
9251 #else /* NO_DOT_IN_LABEL */
9252 #ifndef NO_DOLLAR_IN_LABEL
9254 #else /* NO_DOLLAR_IN_LABEL */
9256 #endif /* NO_DOLLAR_IN_LABEL */
9257 #endif /* NO_DOT_IN_LABEL */
9260 /* Generate a name for a special-purpose function.
9261 The generated name may need to be unique across the whole link.
9262 Changes to this function may also require corresponding changes to
9263 xstrdup_mask_random.
9264 TYPE is some string to identify the purpose of this function to the
9265 linker or collect2; it must start with an uppercase letter,
9267 I - for constructors
9269 N - for C++ anonymous namespaces
9270 F - for DWARF unwind frame information. */
9273 get_file_function_name (const char *type
)
9279 /* If we already have a name we know to be unique, just use that. */
9280 if (first_global_object_name
)
9281 p
= q
= ASTRDUP (first_global_object_name
);
9282 /* If the target is handling the constructors/destructors, they
9283 will be local to this file and the name is only necessary for
9285 We also assign sub_I and sub_D sufixes to constructors called from
9286 the global static constructors. These are always local. */
9287 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9288 || (strncmp (type
, "sub_", 4) == 0
9289 && (type
[4] == 'I' || type
[4] == 'D')))
9291 const char *file
= main_input_filename
;
9293 file
= LOCATION_FILE (input_location
);
9294 /* Just use the file's basename, because the full pathname
9295 might be quite long. */
9296 p
= q
= ASTRDUP (lbasename (file
));
9300 /* Otherwise, the name must be unique across the entire link.
9301 We don't have anything that we know to be unique to this translation
9302 unit, so use what we do have and throw in some randomness. */
9304 const char *name
= weak_global_object_name
;
9305 const char *file
= main_input_filename
;
9310 file
= LOCATION_FILE (input_location
);
9312 len
= strlen (file
);
9313 q
= (char *) alloca (9 + 19 + len
+ 1);
9314 memcpy (q
, file
, len
+ 1);
9316 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9317 crc32_string (0, name
), get_random_seed (false));
9322 clean_symbol_name (q
);
9323 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9326 /* Set up the name of the file-level functions we may need.
9327 Use a global object (which is already required to be unique over
9328 the program) rather than the file name (which imposes extra
9330 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9332 return get_identifier (buf
);
9335 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9337 /* Complain that the tree code of NODE does not match the expected 0
9338 terminated list of trailing codes. The trailing code list can be
9339 empty, for a more vague error message. FILE, LINE, and FUNCTION
9340 are of the caller. */
9343 tree_check_failed (const_tree node
, const char *file
,
9344 int line
, const char *function
, ...)
9348 unsigned length
= 0;
9349 enum tree_code code
;
9351 va_start (args
, function
);
9352 while ((code
= (enum tree_code
) va_arg (args
, int)))
9353 length
+= 4 + strlen (get_tree_code_name (code
));
9358 va_start (args
, function
);
9359 length
+= strlen ("expected ");
9360 buffer
= tmp
= (char *) alloca (length
);
9362 while ((code
= (enum tree_code
) va_arg (args
, int)))
9364 const char *prefix
= length
? " or " : "expected ";
9366 strcpy (tmp
+ length
, prefix
);
9367 length
+= strlen (prefix
);
9368 strcpy (tmp
+ length
, get_tree_code_name (code
));
9369 length
+= strlen (get_tree_code_name (code
));
9374 buffer
= "unexpected node";
9376 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9377 buffer
, get_tree_code_name (TREE_CODE (node
)),
9378 function
, trim_filename (file
), line
);
9381 /* Complain that the tree code of NODE does match the expected 0
9382 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9386 tree_not_check_failed (const_tree node
, const char *file
,
9387 int line
, const char *function
, ...)
9391 unsigned length
= 0;
9392 enum tree_code code
;
9394 va_start (args
, function
);
9395 while ((code
= (enum tree_code
) va_arg (args
, int)))
9396 length
+= 4 + strlen (get_tree_code_name (code
));
9398 va_start (args
, function
);
9399 buffer
= (char *) alloca (length
);
9401 while ((code
= (enum tree_code
) va_arg (args
, int)))
9405 strcpy (buffer
+ length
, " or ");
9408 strcpy (buffer
+ length
, get_tree_code_name (code
));
9409 length
+= strlen (get_tree_code_name (code
));
9413 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9414 buffer
, get_tree_code_name (TREE_CODE (node
)),
9415 function
, trim_filename (file
), line
);
9418 /* Similar to tree_check_failed, except that we check for a class of tree
9419 code, given in CL. */
9422 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9423 const char *file
, int line
, const char *function
)
9426 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9427 TREE_CODE_CLASS_STRING (cl
),
9428 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9429 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9432 /* Similar to tree_check_failed, except that instead of specifying a
9433 dozen codes, use the knowledge that they're all sequential. */
9436 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9437 const char *function
, enum tree_code c1
,
9441 unsigned length
= 0;
9444 for (c
= c1
; c
<= c2
; ++c
)
9445 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9447 length
+= strlen ("expected ");
9448 buffer
= (char *) alloca (length
);
9451 for (c
= c1
; c
<= c2
; ++c
)
9453 const char *prefix
= length
? " or " : "expected ";
9455 strcpy (buffer
+ length
, prefix
);
9456 length
+= strlen (prefix
);
9457 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9458 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9461 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9462 buffer
, get_tree_code_name (TREE_CODE (node
)),
9463 function
, trim_filename (file
), line
);
9467 /* Similar to tree_check_failed, except that we check that a tree does
9468 not have the specified code, given in CL. */
9471 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9472 const char *file
, int line
, const char *function
)
9475 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9476 TREE_CODE_CLASS_STRING (cl
),
9477 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9478 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9482 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9485 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9486 const char *function
, enum omp_clause_code code
)
9488 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9489 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9490 function
, trim_filename (file
), line
);
9494 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9497 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9498 const char *function
, enum omp_clause_code c1
,
9499 enum omp_clause_code c2
)
9502 unsigned length
= 0;
9505 for (c
= c1
; c
<= c2
; ++c
)
9506 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9508 length
+= strlen ("expected ");
9509 buffer
= (char *) alloca (length
);
9512 for (c
= c1
; c
<= c2
; ++c
)
9514 const char *prefix
= length
? " or " : "expected ";
9516 strcpy (buffer
+ length
, prefix
);
9517 length
+= strlen (prefix
);
9518 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9519 length
+= strlen (omp_clause_code_name
[c
]);
9522 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9523 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9524 function
, trim_filename (file
), line
);
9528 #undef DEFTREESTRUCT
9529 #define DEFTREESTRUCT(VAL, NAME) NAME,
9531 static const char *ts_enum_names
[] = {
9532 #include "treestruct.def"
9534 #undef DEFTREESTRUCT
9536 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9538 /* Similar to tree_class_check_failed, except that we check for
9539 whether CODE contains the tree structure identified by EN. */
9542 tree_contains_struct_check_failed (const_tree node
,
9543 const enum tree_node_structure_enum en
,
9544 const char *file
, int line
,
9545 const char *function
)
9548 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9550 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9554 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9555 (dynamically sized) vector. */
9558 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9559 const char *function
)
9562 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9563 idx
+ 1, len
, function
, trim_filename (file
), line
);
9566 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9567 (dynamically sized) vector. */
9570 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9571 const char *function
)
9574 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9575 idx
+ 1, len
, function
, trim_filename (file
), line
);
9578 /* Similar to above, except that the check is for the bounds of the operand
9579 vector of an expression node EXP. */
9582 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9583 int line
, const char *function
)
9585 enum tree_code code
= TREE_CODE (exp
);
9587 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9588 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9589 function
, trim_filename (file
), line
);
9592 /* Similar to above, except that the check is for the number of
9593 operands of an OMP_CLAUSE node. */
9596 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9597 int line
, const char *function
)
9600 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9601 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9602 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9603 trim_filename (file
), line
);
9605 #endif /* ENABLE_TREE_CHECKING */
9607 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9608 and mapped to the machine mode MODE. Initialize its fields and build
9609 the information necessary for debugging output. */
9612 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9615 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9617 t
= make_node (VECTOR_TYPE
);
9618 TREE_TYPE (t
) = mv_innertype
;
9619 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9620 SET_TYPE_MODE (t
, mode
);
9622 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9623 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9624 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9625 || mode
!= VOIDmode
)
9626 && !VECTOR_BOOLEAN_TYPE_P (t
))
9628 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9632 hashval_t hash
= type_hash_canon_hash (t
);
9633 t
= type_hash_canon (hash
, t
);
9635 /* We have built a main variant, based on the main variant of the
9636 inner type. Use it to build the variant we return. */
9637 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9638 && TREE_TYPE (t
) != innertype
)
9639 return build_type_attribute_qual_variant (t
,
9640 TYPE_ATTRIBUTES (innertype
),
9641 TYPE_QUALS (innertype
));
9647 make_or_reuse_type (unsigned size
, int unsignedp
)
9651 if (size
== INT_TYPE_SIZE
)
9652 return unsignedp
? unsigned_type_node
: integer_type_node
;
9653 if (size
== CHAR_TYPE_SIZE
)
9654 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9655 if (size
== SHORT_TYPE_SIZE
)
9656 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9657 if (size
== LONG_TYPE_SIZE
)
9658 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9659 if (size
== LONG_LONG_TYPE_SIZE
)
9660 return (unsignedp
? long_long_unsigned_type_node
9661 : long_long_integer_type_node
);
9663 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9664 if (size
== int_n_data
[i
].bitsize
9665 && int_n_enabled_p
[i
])
9666 return (unsignedp
? int_n_trees
[i
].unsigned_type
9667 : int_n_trees
[i
].signed_type
);
9670 return make_unsigned_type (size
);
9672 return make_signed_type (size
);
9675 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9678 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9682 if (size
== SHORT_FRACT_TYPE_SIZE
)
9683 return unsignedp
? sat_unsigned_short_fract_type_node
9684 : sat_short_fract_type_node
;
9685 if (size
== FRACT_TYPE_SIZE
)
9686 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9687 if (size
== LONG_FRACT_TYPE_SIZE
)
9688 return unsignedp
? sat_unsigned_long_fract_type_node
9689 : sat_long_fract_type_node
;
9690 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9691 return unsignedp
? sat_unsigned_long_long_fract_type_node
9692 : sat_long_long_fract_type_node
;
9696 if (size
== SHORT_FRACT_TYPE_SIZE
)
9697 return unsignedp
? unsigned_short_fract_type_node
9698 : short_fract_type_node
;
9699 if (size
== FRACT_TYPE_SIZE
)
9700 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9701 if (size
== LONG_FRACT_TYPE_SIZE
)
9702 return unsignedp
? unsigned_long_fract_type_node
9703 : long_fract_type_node
;
9704 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9705 return unsignedp
? unsigned_long_long_fract_type_node
9706 : long_long_fract_type_node
;
9709 return make_fract_type (size
, unsignedp
, satp
);
9712 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9715 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9719 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9720 return unsignedp
? sat_unsigned_short_accum_type_node
9721 : sat_short_accum_type_node
;
9722 if (size
== ACCUM_TYPE_SIZE
)
9723 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9724 if (size
== LONG_ACCUM_TYPE_SIZE
)
9725 return unsignedp
? sat_unsigned_long_accum_type_node
9726 : sat_long_accum_type_node
;
9727 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9728 return unsignedp
? sat_unsigned_long_long_accum_type_node
9729 : sat_long_long_accum_type_node
;
9733 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9734 return unsignedp
? unsigned_short_accum_type_node
9735 : short_accum_type_node
;
9736 if (size
== ACCUM_TYPE_SIZE
)
9737 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9738 if (size
== LONG_ACCUM_TYPE_SIZE
)
9739 return unsignedp
? unsigned_long_accum_type_node
9740 : long_accum_type_node
;
9741 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9742 return unsignedp
? unsigned_long_long_accum_type_node
9743 : long_long_accum_type_node
;
9746 return make_accum_type (size
, unsignedp
, satp
);
9750 /* Create an atomic variant node for TYPE. This routine is called
9751 during initialization of data types to create the 5 basic atomic
9752 types. The generic build_variant_type function requires these to
9753 already be set up in order to function properly, so cannot be
9754 called from there. If ALIGN is non-zero, then ensure alignment is
9755 overridden to this value. */
9758 build_atomic_base (tree type
, unsigned int align
)
9762 /* Make sure its not already registered. */
9763 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9766 t
= build_variant_type_copy (type
);
9767 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9770 SET_TYPE_ALIGN (t
, align
);
9775 /* Information about the _FloatN and _FloatNx types. This must be in
9776 the same order as the corresponding TI_* enum values. */
9777 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9789 /* Create nodes for all integer types (and error_mark_node) using the sizes
9790 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9793 build_common_tree_nodes (bool signed_char
)
9797 error_mark_node
= make_node (ERROR_MARK
);
9798 TREE_TYPE (error_mark_node
) = error_mark_node
;
9800 initialize_sizetypes ();
9802 /* Define both `signed char' and `unsigned char'. */
9803 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9804 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9805 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9806 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9808 /* Define `char', which is like either `signed char' or `unsigned char'
9809 but not the same as either. */
9812 ? make_signed_type (CHAR_TYPE_SIZE
)
9813 : make_unsigned_type (CHAR_TYPE_SIZE
));
9814 TYPE_STRING_FLAG (char_type_node
) = 1;
9816 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9817 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9818 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9819 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9820 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9821 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9822 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9823 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9825 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9827 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9828 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9829 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9830 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9832 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9833 && int_n_enabled_p
[i
])
9835 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9836 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9840 /* Define a boolean type. This type only represents boolean values but
9841 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9842 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9843 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9844 TYPE_PRECISION (boolean_type_node
) = 1;
9845 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9847 /* Define what type to use for size_t. */
9848 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9849 size_type_node
= unsigned_type_node
;
9850 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9851 size_type_node
= long_unsigned_type_node
;
9852 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9853 size_type_node
= long_long_unsigned_type_node
;
9854 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9855 size_type_node
= short_unsigned_type_node
;
9860 size_type_node
= NULL_TREE
;
9861 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9862 if (int_n_enabled_p
[i
])
9865 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9867 if (strcmp (name
, SIZE_TYPE
) == 0)
9869 size_type_node
= int_n_trees
[i
].unsigned_type
;
9872 if (size_type_node
== NULL_TREE
)
9876 /* Define what type to use for ptrdiff_t. */
9877 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9878 ptrdiff_type_node
= integer_type_node
;
9879 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9880 ptrdiff_type_node
= long_integer_type_node
;
9881 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9882 ptrdiff_type_node
= long_long_integer_type_node
;
9883 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9884 ptrdiff_type_node
= short_integer_type_node
;
9887 ptrdiff_type_node
= NULL_TREE
;
9888 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9889 if (int_n_enabled_p
[i
])
9892 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9893 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9894 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9896 if (ptrdiff_type_node
== NULL_TREE
)
9900 /* Fill in the rest of the sized types. Reuse existing type nodes
9902 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9903 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9904 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9905 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9906 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9908 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9909 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9910 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9911 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9912 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9914 /* Don't call build_qualified type for atomics. That routine does
9915 special processing for atomics, and until they are initialized
9916 it's better not to make that call.
9918 Check to see if there is a target override for atomic types. */
9920 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9921 targetm
.atomic_align_for_mode (QImode
));
9922 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9923 targetm
.atomic_align_for_mode (HImode
));
9924 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9925 targetm
.atomic_align_for_mode (SImode
));
9926 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9927 targetm
.atomic_align_for_mode (DImode
));
9928 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9929 targetm
.atomic_align_for_mode (TImode
));
9931 access_public_node
= get_identifier ("public");
9932 access_protected_node
= get_identifier ("protected");
9933 access_private_node
= get_identifier ("private");
9935 /* Define these next since types below may used them. */
9936 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9937 integer_one_node
= build_int_cst (integer_type_node
, 1);
9938 integer_three_node
= build_int_cst (integer_type_node
, 3);
9939 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9941 size_zero_node
= size_int (0);
9942 size_one_node
= size_int (1);
9943 bitsize_zero_node
= bitsize_int (0);
9944 bitsize_one_node
= bitsize_int (1);
9945 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9947 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9948 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9950 void_type_node
= make_node (VOID_TYPE
);
9951 layout_type (void_type_node
);
9953 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9955 /* We are not going to have real types in C with less than byte alignment,
9956 so we might as well not have any types that claim to have it. */
9957 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9958 TYPE_USER_ALIGN (void_type_node
) = 0;
9960 void_node
= make_node (VOID_CST
);
9961 TREE_TYPE (void_node
) = void_type_node
;
9963 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9964 layout_type (TREE_TYPE (null_pointer_node
));
9966 ptr_type_node
= build_pointer_type (void_type_node
);
9968 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9969 for (unsigned i
= 0;
9970 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9972 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9974 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9976 float_type_node
= make_node (REAL_TYPE
);
9977 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9978 layout_type (float_type_node
);
9980 double_type_node
= make_node (REAL_TYPE
);
9981 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9982 layout_type (double_type_node
);
9984 long_double_type_node
= make_node (REAL_TYPE
);
9985 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9986 layout_type (long_double_type_node
);
9988 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9990 int n
= floatn_nx_types
[i
].n
;
9991 bool extended
= floatn_nx_types
[i
].extended
;
9992 scalar_float_mode mode
;
9993 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9995 int precision
= GET_MODE_PRECISION (mode
);
9996 /* Work around the rs6000 KFmode having precision 113 not
9998 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9999 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10000 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10002 gcc_assert (min_precision
== n
);
10003 if (precision
< min_precision
)
10004 precision
= min_precision
;
10005 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10006 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10007 layout_type (FLOATN_NX_TYPE_NODE (i
));
10008 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10011 float_ptr_type_node
= build_pointer_type (float_type_node
);
10012 double_ptr_type_node
= build_pointer_type (double_type_node
);
10013 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10014 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10016 /* Fixed size integer types. */
10017 uint16_type_node
= make_or_reuse_type (16, 1);
10018 uint32_type_node
= make_or_reuse_type (32, 1);
10019 uint64_type_node
= make_or_reuse_type (64, 1);
10021 /* Decimal float types. */
10022 dfloat32_type_node
= make_node (REAL_TYPE
);
10023 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10024 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10025 layout_type (dfloat32_type_node
);
10026 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10028 dfloat64_type_node
= make_node (REAL_TYPE
);
10029 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10030 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10031 layout_type (dfloat64_type_node
);
10032 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10034 dfloat128_type_node
= make_node (REAL_TYPE
);
10035 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10036 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10037 layout_type (dfloat128_type_node
);
10038 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10040 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10041 complex_float_type_node
= build_complex_type (float_type_node
, true);
10042 complex_double_type_node
= build_complex_type (double_type_node
, true);
10043 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10046 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10048 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10049 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10050 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10053 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10054 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10055 sat_ ## KIND ## _type_node = \
10056 make_sat_signed_ ## KIND ## _type (SIZE); \
10057 sat_unsigned_ ## KIND ## _type_node = \
10058 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10059 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10060 unsigned_ ## KIND ## _type_node = \
10061 make_unsigned_ ## KIND ## _type (SIZE);
10063 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10064 sat_ ## WIDTH ## KIND ## _type_node = \
10065 make_sat_signed_ ## KIND ## _type (SIZE); \
10066 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10067 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10068 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10069 unsigned_ ## WIDTH ## KIND ## _type_node = \
10070 make_unsigned_ ## KIND ## _type (SIZE);
10072 /* Make fixed-point type nodes based on four different widths. */
10073 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10074 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10075 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10076 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10077 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10079 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10080 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10081 NAME ## _type_node = \
10082 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10083 u ## NAME ## _type_node = \
10084 make_or_reuse_unsigned_ ## KIND ## _type \
10085 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10086 sat_ ## NAME ## _type_node = \
10087 make_or_reuse_sat_signed_ ## KIND ## _type \
10088 (GET_MODE_BITSIZE (MODE ## mode)); \
10089 sat_u ## NAME ## _type_node = \
10090 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10091 (GET_MODE_BITSIZE (U ## MODE ## mode));
10093 /* Fixed-point type and mode nodes. */
10094 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10095 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10096 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10097 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10098 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10099 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10100 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10101 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10102 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10103 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10104 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10107 tree t
= targetm
.build_builtin_va_list ();
10109 /* Many back-ends define record types without setting TYPE_NAME.
10110 If we copied the record type here, we'd keep the original
10111 record type without a name. This breaks name mangling. So,
10112 don't copy record types and let c_common_nodes_and_builtins()
10113 declare the type to be __builtin_va_list. */
10114 if (TREE_CODE (t
) != RECORD_TYPE
)
10115 t
= build_variant_type_copy (t
);
10117 va_list_type_node
= t
;
10121 /* Modify DECL for given flags.
10122 TM_PURE attribute is set only on types, so the function will modify
10123 DECL's type when ECF_TM_PURE is used. */
10126 set_call_expr_flags (tree decl
, int flags
)
10128 if (flags
& ECF_NOTHROW
)
10129 TREE_NOTHROW (decl
) = 1;
10130 if (flags
& ECF_CONST
)
10131 TREE_READONLY (decl
) = 1;
10132 if (flags
& ECF_PURE
)
10133 DECL_PURE_P (decl
) = 1;
10134 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10135 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10136 if (flags
& ECF_NOVOPS
)
10137 DECL_IS_NOVOPS (decl
) = 1;
10138 if (flags
& ECF_NORETURN
)
10139 TREE_THIS_VOLATILE (decl
) = 1;
10140 if (flags
& ECF_MALLOC
)
10141 DECL_IS_MALLOC (decl
) = 1;
10142 if (flags
& ECF_RETURNS_TWICE
)
10143 DECL_IS_RETURNS_TWICE (decl
) = 1;
10144 if (flags
& ECF_LEAF
)
10145 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10146 NULL
, DECL_ATTRIBUTES (decl
));
10147 if (flags
& ECF_COLD
)
10148 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10149 NULL
, DECL_ATTRIBUTES (decl
));
10150 if (flags
& ECF_RET1
)
10151 DECL_ATTRIBUTES (decl
)
10152 = tree_cons (get_identifier ("fn spec"),
10153 build_tree_list (NULL_TREE
, build_string (1, "1")),
10154 DECL_ATTRIBUTES (decl
));
10155 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10156 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10157 /* Looping const or pure is implied by noreturn.
10158 There is currently no way to declare looping const or looping pure alone. */
10159 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10160 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10164 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10167 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10168 const char *library_name
, int ecf_flags
)
10172 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10173 library_name
, NULL_TREE
);
10174 set_call_expr_flags (decl
, ecf_flags
);
10176 set_builtin_decl (code
, decl
, true);
10179 /* Call this function after instantiating all builtins that the language
10180 front end cares about. This will build the rest of the builtins
10181 and internal functions that are relied upon by the tree optimizers and
10185 build_common_builtin_nodes (void)
10190 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10191 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10193 ftype
= build_function_type (void_type_node
, void_list_node
);
10194 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10195 local_define_builtin ("__builtin_unreachable", ftype
,
10196 BUILT_IN_UNREACHABLE
,
10197 "__builtin_unreachable",
10198 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10199 | ECF_CONST
| ECF_COLD
);
10200 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10201 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10203 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10206 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10207 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10209 ftype
= build_function_type_list (ptr_type_node
,
10210 ptr_type_node
, const_ptr_type_node
,
10211 size_type_node
, NULL_TREE
);
10213 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10214 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10215 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10216 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10217 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10218 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10221 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10223 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10224 const_ptr_type_node
, size_type_node
,
10226 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10227 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10230 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10232 ftype
= build_function_type_list (ptr_type_node
,
10233 ptr_type_node
, integer_type_node
,
10234 size_type_node
, NULL_TREE
);
10235 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10236 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10239 /* If we're checking the stack, `alloca' can throw. */
10240 const int alloca_flags
10241 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10243 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10245 ftype
= build_function_type_list (ptr_type_node
,
10246 size_type_node
, NULL_TREE
);
10247 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10248 "alloca", alloca_flags
);
10251 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10252 size_type_node
, NULL_TREE
);
10253 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10254 BUILT_IN_ALLOCA_WITH_ALIGN
,
10255 "__builtin_alloca_with_align",
10258 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10259 size_type_node
, size_type_node
, NULL_TREE
);
10260 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10261 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10262 "__builtin_alloca_with_align_and_max",
10265 ftype
= build_function_type_list (void_type_node
,
10266 ptr_type_node
, ptr_type_node
,
10267 ptr_type_node
, NULL_TREE
);
10268 local_define_builtin ("__builtin_init_trampoline", ftype
,
10269 BUILT_IN_INIT_TRAMPOLINE
,
10270 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10271 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10272 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10273 "__builtin_init_heap_trampoline",
10274 ECF_NOTHROW
| ECF_LEAF
);
10275 local_define_builtin ("__builtin_init_descriptor", ftype
,
10276 BUILT_IN_INIT_DESCRIPTOR
,
10277 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10279 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10280 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10281 BUILT_IN_ADJUST_TRAMPOLINE
,
10282 "__builtin_adjust_trampoline",
10283 ECF_CONST
| ECF_NOTHROW
);
10284 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10285 BUILT_IN_ADJUST_DESCRIPTOR
,
10286 "__builtin_adjust_descriptor",
10287 ECF_CONST
| ECF_NOTHROW
);
10289 ftype
= build_function_type_list (void_type_node
,
10290 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10291 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10292 BUILT_IN_NONLOCAL_GOTO
,
10293 "__builtin_nonlocal_goto",
10294 ECF_NORETURN
| ECF_NOTHROW
);
10296 ftype
= build_function_type_list (void_type_node
,
10297 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10298 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10299 BUILT_IN_SETJMP_SETUP
,
10300 "__builtin_setjmp_setup", ECF_NOTHROW
);
10302 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10303 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10304 BUILT_IN_SETJMP_RECEIVER
,
10305 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10307 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10308 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10309 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10311 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10312 local_define_builtin ("__builtin_stack_restore", ftype
,
10313 BUILT_IN_STACK_RESTORE
,
10314 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10316 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10317 const_ptr_type_node
, size_type_node
,
10319 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10320 "__builtin_memcmp_eq",
10321 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10323 /* If there's a possibility that we might use the ARM EABI, build the
10324 alternate __cxa_end_cleanup node used to resume from C++. */
10325 if (targetm
.arm_eabi_unwinder
)
10327 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10328 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10329 BUILT_IN_CXA_END_CLEANUP
,
10330 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10333 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10334 local_define_builtin ("__builtin_unwind_resume", ftype
,
10335 BUILT_IN_UNWIND_RESUME
,
10336 ((targetm_common
.except_unwind_info (&global_options
)
10338 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10341 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10343 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10345 local_define_builtin ("__builtin_return_address", ftype
,
10346 BUILT_IN_RETURN_ADDRESS
,
10347 "__builtin_return_address",
10351 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10352 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10354 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10355 ptr_type_node
, NULL_TREE
);
10356 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10357 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10358 BUILT_IN_PROFILE_FUNC_ENTER
,
10359 "__cyg_profile_func_enter", 0);
10360 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10361 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10362 BUILT_IN_PROFILE_FUNC_EXIT
,
10363 "__cyg_profile_func_exit", 0);
10366 /* The exception object and filter values from the runtime. The argument
10367 must be zero before exception lowering, i.e. from the front end. After
10368 exception lowering, it will be the region number for the exception
10369 landing pad. These functions are PURE instead of CONST to prevent
10370 them from being hoisted past the exception edge that will initialize
10371 its value in the landing pad. */
10372 ftype
= build_function_type_list (ptr_type_node
,
10373 integer_type_node
, NULL_TREE
);
10374 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10375 /* Only use TM_PURE if we have TM language support. */
10376 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10377 ecf_flags
|= ECF_TM_PURE
;
10378 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10379 "__builtin_eh_pointer", ecf_flags
);
10381 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10382 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10383 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10384 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10386 ftype
= build_function_type_list (void_type_node
,
10387 integer_type_node
, integer_type_node
,
10389 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10390 BUILT_IN_EH_COPY_VALUES
,
10391 "__builtin_eh_copy_values", ECF_NOTHROW
);
10393 /* Complex multiplication and division. These are handled as builtins
10394 rather than optabs because emit_library_call_value doesn't support
10395 complex. Further, we can do slightly better with folding these
10396 beasties if the real and complex parts of the arguments are separate. */
10400 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10402 char mode_name_buf
[4], *q
;
10404 enum built_in_function mcode
, dcode
;
10405 tree type
, inner_type
;
10406 const char *prefix
= "__";
10408 if (targetm
.libfunc_gnu_prefix
)
10411 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10414 inner_type
= TREE_TYPE (type
);
10416 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10417 inner_type
, inner_type
, NULL_TREE
);
10419 mcode
= ((enum built_in_function
)
10420 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10421 dcode
= ((enum built_in_function
)
10422 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10424 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10428 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10430 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10431 built_in_names
[mcode
],
10432 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10434 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10436 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10437 built_in_names
[dcode
],
10438 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10442 init_internal_fns ();
10445 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10448 If we requested a pointer to a vector, build up the pointers that
10449 we stripped off while looking for the inner type. Similarly for
10450 return values from functions.
10452 The argument TYPE is the top of the chain, and BOTTOM is the
10453 new type which we will point to. */
10456 reconstruct_complex_type (tree type
, tree bottom
)
10460 if (TREE_CODE (type
) == POINTER_TYPE
)
10462 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10463 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10464 TYPE_REF_CAN_ALIAS_ALL (type
));
10466 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10468 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10469 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10470 TYPE_REF_CAN_ALIAS_ALL (type
));
10472 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10474 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10475 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10477 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10479 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10480 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10482 else if (TREE_CODE (type
) == METHOD_TYPE
)
10484 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10485 /* The build_method_type_directly() routine prepends 'this' to argument list,
10486 so we must compensate by getting rid of it. */
10488 = build_method_type_directly
10489 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10491 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10493 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10495 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10496 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10501 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10502 TYPE_QUALS (type
));
10505 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10508 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10511 unsigned int bitsize
;
10513 switch (GET_MODE_CLASS (mode
))
10515 case MODE_VECTOR_BOOL
:
10516 case MODE_VECTOR_INT
:
10517 case MODE_VECTOR_FLOAT
:
10518 case MODE_VECTOR_FRACT
:
10519 case MODE_VECTOR_UFRACT
:
10520 case MODE_VECTOR_ACCUM
:
10521 case MODE_VECTOR_UACCUM
:
10522 nunits
= GET_MODE_NUNITS (mode
);
10526 /* Check that there are no leftover bits. */
10527 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10528 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10529 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10533 gcc_unreachable ();
10536 return make_vector_type (innertype
, nunits
, mode
);
10539 /* Similarly, but takes the inner type and number of units, which must be
10543 build_vector_type (tree innertype
, poly_int64 nunits
)
10545 return make_vector_type (innertype
, nunits
, VOIDmode
);
10548 /* Build truth vector with specified length and number of units. */
10551 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
10553 machine_mode mask_mode
10554 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10557 if (mask_mode
== BLKmode
)
10558 vsize
= vector_size
* BITS_PER_UNIT
;
10560 vsize
= GET_MODE_BITSIZE (mask_mode
);
10562 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10564 tree bool_type
= build_nonstandard_boolean_type (esize
);
10566 return make_vector_type (bool_type
, nunits
, mask_mode
);
10569 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10572 build_same_sized_truth_vector_type (tree vectype
)
10574 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10577 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10579 if (known_eq (size
, 0U))
10580 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10582 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10585 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10588 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10590 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10592 /* We always build the non-opaque variant before the opaque one,
10593 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10594 cand
= TYPE_NEXT_VARIANT (t
);
10596 && TYPE_VECTOR_OPAQUE (cand
)
10597 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10599 /* Othewise build a variant type and make sure to queue it after
10600 the non-opaque type. */
10601 cand
= build_distinct_type_copy (t
);
10602 TYPE_VECTOR_OPAQUE (cand
) = true;
10603 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10604 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10605 TYPE_NEXT_VARIANT (t
) = cand
;
10606 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10610 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10613 vector_cst_int_elt (const_tree t
, unsigned int i
)
10615 /* First handle elements that are directly encoded. */
10616 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10617 if (i
< encoded_nelts
)
10618 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10620 /* Identify the pattern that contains element I and work out the index of
10621 the last encoded element for that pattern. */
10622 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10623 unsigned int pattern
= i
% npatterns
;
10624 unsigned int count
= i
/ npatterns
;
10625 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10627 /* If there are no steps, the final encoded value is the right one. */
10628 if (!VECTOR_CST_STEPPED_P (t
))
10629 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10631 /* Otherwise work out the value from the last two encoded elements. */
10632 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10633 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10634 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10635 return wi::to_wide (v2
) + (count
- 2) * diff
;
10638 /* Return the value of element I of VECTOR_CST T. */
10641 vector_cst_elt (const_tree t
, unsigned int i
)
10643 /* First handle elements that are directly encoded. */
10644 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10645 if (i
< encoded_nelts
)
10646 return VECTOR_CST_ENCODED_ELT (t
, i
);
10648 /* If there are no steps, the final encoded value is the right one. */
10649 if (!VECTOR_CST_STEPPED_P (t
))
10651 /* Identify the pattern that contains element I and work out the index of
10652 the last encoded element for that pattern. */
10653 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10654 unsigned int pattern
= i
% npatterns
;
10655 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10656 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10659 /* Otherwise work out the value from the last two encoded elements. */
10660 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10661 vector_cst_int_elt (t
, i
));
10664 /* Given an initializer INIT, return TRUE if INIT is zero or some
10665 aggregate of zeros. Otherwise return FALSE. */
10667 initializer_zerop (const_tree init
)
10673 switch (TREE_CODE (init
))
10676 return integer_zerop (init
);
10679 /* ??? Note that this is not correct for C4X float formats. There,
10680 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10681 negative exponent. */
10682 return real_zerop (init
)
10683 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10686 return fixed_zerop (init
);
10689 return integer_zerop (init
)
10690 || (real_zerop (init
)
10691 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10692 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10695 return (VECTOR_CST_NPATTERNS (init
) == 1
10696 && VECTOR_CST_DUPLICATE_P (init
)
10697 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)));
10701 unsigned HOST_WIDE_INT idx
;
10703 if (TREE_CLOBBER_P (init
))
10705 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10706 if (!initializer_zerop (elt
))
10715 /* We need to loop through all elements to handle cases like
10716 "\0" and "\0foobar". */
10717 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10718 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10729 /* Check if vector VEC consists of all the equal elements and
10730 that the number of elements corresponds to the type of VEC.
10731 The function returns first element of the vector
10732 or NULL_TREE if the vector is not uniform. */
10734 uniform_vector_p (const_tree vec
)
10737 unsigned HOST_WIDE_INT i
, nelts
;
10739 if (vec
== NULL_TREE
)
10742 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10744 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
10745 return TREE_OPERAND (vec
, 0);
10747 else if (TREE_CODE (vec
) == VECTOR_CST
)
10749 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
10750 return VECTOR_CST_ENCODED_ELT (vec
, 0);
10754 else if (TREE_CODE (vec
) == CONSTRUCTOR
10755 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
10757 first
= error_mark_node
;
10759 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10766 if (!operand_equal_p (first
, t
, 0))
10778 /* Build an empty statement at location LOC. */
10781 build_empty_stmt (location_t loc
)
10783 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10784 SET_EXPR_LOCATION (t
, loc
);
10789 /* Build an OpenMP clause with code CODE. LOC is the location of the
10793 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10798 length
= omp_clause_num_ops
[code
];
10799 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10801 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10803 t
= (tree
) ggc_internal_alloc (size
);
10804 memset (t
, 0, size
);
10805 TREE_SET_CODE (t
, OMP_CLAUSE
);
10806 OMP_CLAUSE_SET_CODE (t
, code
);
10807 OMP_CLAUSE_LOCATION (t
) = loc
;
10812 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10813 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10814 Except for the CODE and operand count field, other storage for the
10815 object is initialized to zeros. */
10818 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10821 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10823 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10824 gcc_assert (len
>= 1);
10826 record_node_allocation_statistics (code
, length
);
10828 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10830 TREE_SET_CODE (t
, code
);
10832 /* Can't use TREE_OPERAND to store the length because if checking is
10833 enabled, it will try to check the length before we store it. :-P */
10834 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10839 /* Helper function for build_call_* functions; build a CALL_EXPR with
10840 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10841 the argument slots. */
10844 build_call_1 (tree return_type
, tree fn
, int nargs
)
10848 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10849 TREE_TYPE (t
) = return_type
;
10850 CALL_EXPR_FN (t
) = fn
;
10851 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10856 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10857 FN and a null static chain slot. NARGS is the number of call arguments
10858 which are specified as "..." arguments. */
10861 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10865 va_start (args
, nargs
);
10866 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10871 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10872 FN and a null static chain slot. NARGS is the number of call arguments
10873 which are specified as a va_list ARGS. */
10876 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10881 t
= build_call_1 (return_type
, fn
, nargs
);
10882 for (i
= 0; i
< nargs
; i
++)
10883 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10884 process_call_operands (t
);
10888 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10889 FN and a null static chain slot. NARGS is the number of call arguments
10890 which are specified as a tree array ARGS. */
10893 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10894 int nargs
, const tree
*args
)
10899 t
= build_call_1 (return_type
, fn
, nargs
);
10900 for (i
= 0; i
< nargs
; i
++)
10901 CALL_EXPR_ARG (t
, i
) = args
[i
];
10902 process_call_operands (t
);
10903 SET_EXPR_LOCATION (t
, loc
);
10907 /* Like build_call_array, but takes a vec. */
10910 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10915 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10916 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10917 CALL_EXPR_ARG (ret
, ix
) = t
;
10918 process_call_operands (ret
);
10922 /* Conveniently construct a function call expression. FNDECL names the
10923 function to be called and N arguments are passed in the array
10927 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10929 tree fntype
= TREE_TYPE (fndecl
);
10930 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10932 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10935 /* Conveniently construct a function call expression. FNDECL names the
10936 function to be called and the arguments are passed in the vector
10940 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10942 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10943 vec_safe_address (vec
));
10947 /* Conveniently construct a function call expression. FNDECL names the
10948 function to be called, N is the number of arguments, and the "..."
10949 parameters are the argument expressions. */
10952 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10955 tree
*argarray
= XALLOCAVEC (tree
, n
);
10959 for (i
= 0; i
< n
; i
++)
10960 argarray
[i
] = va_arg (ap
, tree
);
10962 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10965 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10966 varargs macros aren't supported by all bootstrap compilers. */
10969 build_call_expr (tree fndecl
, int n
, ...)
10972 tree
*argarray
= XALLOCAVEC (tree
, n
);
10976 for (i
= 0; i
< n
; i
++)
10977 argarray
[i
] = va_arg (ap
, tree
);
10979 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10982 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10983 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10984 It will get gimplified later into an ordinary internal function. */
10987 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10988 tree type
, int n
, const tree
*args
)
10990 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10991 for (int i
= 0; i
< n
; ++i
)
10992 CALL_EXPR_ARG (t
, i
) = args
[i
];
10993 SET_EXPR_LOCATION (t
, loc
);
10994 CALL_EXPR_IFN (t
) = ifn
;
10998 /* Build internal call expression. This is just like CALL_EXPR, except
10999 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11000 internal function. */
11003 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11004 tree type
, int n
, ...)
11007 tree
*argarray
= XALLOCAVEC (tree
, n
);
11011 for (i
= 0; i
< n
; i
++)
11012 argarray
[i
] = va_arg (ap
, tree
);
11014 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11017 /* Return a function call to FN, if the target is guaranteed to support it,
11020 N is the number of arguments, passed in the "...", and TYPE is the
11021 type of the return value. */
11024 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11028 tree
*argarray
= XALLOCAVEC (tree
, n
);
11032 for (i
= 0; i
< n
; i
++)
11033 argarray
[i
] = va_arg (ap
, tree
);
11035 if (internal_fn_p (fn
))
11037 internal_fn ifn
= as_internal_fn (fn
);
11038 if (direct_internal_fn_p (ifn
))
11040 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11041 if (!direct_internal_fn_supported_p (ifn
, types
,
11042 OPTIMIZE_FOR_BOTH
))
11045 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11049 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11052 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11056 /* Return a function call to the appropriate builtin alloca variant.
11058 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11059 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11060 bound for SIZE in case it is not a fixed value. */
11063 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11067 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11069 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11071 else if (align
> 0)
11073 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11074 return build_call_expr (t
, 2, size
, size_int (align
));
11078 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11079 return build_call_expr (t
, 1, size
);
11083 /* Create a new constant string literal and return a char* pointer to it.
11084 The STRING_CST value is the LEN characters at STR. */
11086 build_string_literal (int len
, const char *str
)
11088 tree t
, elem
, index
, type
;
11090 t
= build_string (len
, str
);
11091 elem
= build_type_variant (char_type_node
, 1, 0);
11092 index
= build_index_type (size_int (len
- 1));
11093 type
= build_array_type (elem
, index
);
11094 TREE_TYPE (t
) = type
;
11095 TREE_CONSTANT (t
) = 1;
11096 TREE_READONLY (t
) = 1;
11097 TREE_STATIC (t
) = 1;
11099 type
= build_pointer_type (elem
);
11100 t
= build1 (ADDR_EXPR
, type
,
11101 build4 (ARRAY_REF
, elem
,
11102 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11108 /* Return true if T (assumed to be a DECL) must be assigned a memory
11112 needs_to_live_in_memory (const_tree t
)
11114 return (TREE_ADDRESSABLE (t
)
11115 || is_global_var (t
)
11116 || (TREE_CODE (t
) == RESULT_DECL
11117 && !DECL_BY_REFERENCE (t
)
11118 && aggregate_value_p (t
, current_function_decl
)));
11121 /* Return value of a constant X and sign-extend it. */
11124 int_cst_value (const_tree x
)
11126 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11127 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11129 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11130 gcc_assert (cst_and_fits_in_hwi (x
));
11132 if (bits
< HOST_BITS_PER_WIDE_INT
)
11134 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11136 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11138 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11144 /* If TYPE is an integral or pointer type, return an integer type with
11145 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11146 if TYPE is already an integer type of signedness UNSIGNEDP. */
11149 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11151 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11154 if (TREE_CODE (type
) == VECTOR_TYPE
)
11156 tree inner
= TREE_TYPE (type
);
11157 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11160 if (inner
== inner2
)
11162 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11165 if (!INTEGRAL_TYPE_P (type
)
11166 && !POINTER_TYPE_P (type
)
11167 && TREE_CODE (type
) != OFFSET_TYPE
)
11170 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11173 /* If TYPE is an integral or pointer type, return an integer type with
11174 the same precision which is unsigned, or itself if TYPE is already an
11175 unsigned integer type. */
11178 unsigned_type_for (tree type
)
11180 return signed_or_unsigned_type_for (1, type
);
11183 /* If TYPE is an integral or pointer type, return an integer type with
11184 the same precision which is signed, or itself if TYPE is already a
11185 signed integer type. */
11188 signed_type_for (tree type
)
11190 return signed_or_unsigned_type_for (0, type
);
11193 /* If TYPE is a vector type, return a signed integer vector type with the
11194 same width and number of subparts. Otherwise return boolean_type_node. */
11197 truth_type_for (tree type
)
11199 if (TREE_CODE (type
) == VECTOR_TYPE
)
11201 if (VECTOR_BOOLEAN_TYPE_P (type
))
11203 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11204 GET_MODE_SIZE (TYPE_MODE (type
)));
11207 return boolean_type_node
;
11210 /* Returns the largest value obtainable by casting something in INNER type to
11214 upper_bound_in_type (tree outer
, tree inner
)
11216 unsigned int det
= 0;
11217 unsigned oprec
= TYPE_PRECISION (outer
);
11218 unsigned iprec
= TYPE_PRECISION (inner
);
11221 /* Compute a unique number for every combination. */
11222 det
|= (oprec
> iprec
) ? 4 : 0;
11223 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11224 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11226 /* Determine the exponent to use. */
11231 /* oprec <= iprec, outer: signed, inner: don't care. */
11236 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11240 /* oprec > iprec, outer: signed, inner: signed. */
11244 /* oprec > iprec, outer: signed, inner: unsigned. */
11248 /* oprec > iprec, outer: unsigned, inner: signed. */
11252 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11256 gcc_unreachable ();
11259 return wide_int_to_tree (outer
,
11260 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11263 /* Returns the smallest value obtainable by casting something in INNER type to
11267 lower_bound_in_type (tree outer
, tree inner
)
11269 unsigned oprec
= TYPE_PRECISION (outer
);
11270 unsigned iprec
= TYPE_PRECISION (inner
);
11272 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11274 if (TYPE_UNSIGNED (outer
)
11275 /* If we are widening something of an unsigned type, OUTER type
11276 contains all values of INNER type. In particular, both INNER
11277 and OUTER types have zero in common. */
11278 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11279 return build_int_cst (outer
, 0);
11282 /* If we are widening a signed type to another signed type, we
11283 want to obtain -2^^(iprec-1). If we are keeping the
11284 precision or narrowing to a signed type, we want to obtain
11286 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11287 return wide_int_to_tree (outer
,
11288 wi::mask (prec
- 1, true,
11289 TYPE_PRECISION (outer
)));
11293 /* Return nonzero if two operands that are suitable for PHI nodes are
11294 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11295 SSA_NAME or invariant. Note that this is strictly an optimization.
11296 That is, callers of this function can directly call operand_equal_p
11297 and get the same result, only slower. */
11300 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11304 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11306 return operand_equal_p (arg0
, arg1
, 0);
11309 /* Returns number of zeros at the end of binary representation of X. */
11312 num_ending_zeros (const_tree x
)
11314 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11318 #define WALK_SUBTREE(NODE) \
11321 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11327 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11328 be walked whenever a type is seen in the tree. Rest of operands and return
11329 value are as for walk_tree. */
11332 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11333 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11335 tree result
= NULL_TREE
;
11337 switch (TREE_CODE (type
))
11340 case REFERENCE_TYPE
:
11342 /* We have to worry about mutually recursive pointers. These can't
11343 be written in C. They can in Ada. It's pathological, but
11344 there's an ACATS test (c38102a) that checks it. Deal with this
11345 by checking if we're pointing to another pointer, that one
11346 points to another pointer, that one does too, and we have no htab.
11347 If so, get a hash table. We check three levels deep to avoid
11348 the cost of the hash table if we don't need one. */
11349 if (POINTER_TYPE_P (TREE_TYPE (type
))
11350 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11351 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11354 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11365 WALK_SUBTREE (TREE_TYPE (type
));
11369 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11371 /* Fall through. */
11373 case FUNCTION_TYPE
:
11374 WALK_SUBTREE (TREE_TYPE (type
));
11378 /* We never want to walk into default arguments. */
11379 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11380 WALK_SUBTREE (TREE_VALUE (arg
));
11385 /* Don't follow this nodes's type if a pointer for fear that
11386 we'll have infinite recursion. If we have a PSET, then we
11389 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11390 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11391 WALK_SUBTREE (TREE_TYPE (type
));
11392 WALK_SUBTREE (TYPE_DOMAIN (type
));
11396 WALK_SUBTREE (TREE_TYPE (type
));
11397 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11407 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11408 called with the DATA and the address of each sub-tree. If FUNC returns a
11409 non-NULL value, the traversal is stopped, and the value returned by FUNC
11410 is returned. If PSET is non-NULL it is used to record the nodes visited,
11411 and to avoid visiting a node more than once. */
11414 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11415 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11417 enum tree_code code
;
11421 #define WALK_SUBTREE_TAIL(NODE) \
11425 goto tail_recurse; \
11430 /* Skip empty subtrees. */
11434 /* Don't walk the same tree twice, if the user has requested
11435 that we avoid doing so. */
11436 if (pset
&& pset
->add (*tp
))
11439 /* Call the function. */
11441 result
= (*func
) (tp
, &walk_subtrees
, data
);
11443 /* If we found something, return it. */
11447 code
= TREE_CODE (*tp
);
11449 /* Even if we didn't, FUNC may have decided that there was nothing
11450 interesting below this point in the tree. */
11451 if (!walk_subtrees
)
11453 /* But we still need to check our siblings. */
11454 if (code
== TREE_LIST
)
11455 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11456 else if (code
== OMP_CLAUSE
)
11457 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11464 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11465 if (result
|| !walk_subtrees
)
11472 case IDENTIFIER_NODE
:
11479 case PLACEHOLDER_EXPR
:
11483 /* None of these have subtrees other than those already walked
11488 WALK_SUBTREE (TREE_VALUE (*tp
));
11489 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11494 int len
= TREE_VEC_LENGTH (*tp
);
11499 /* Walk all elements but the first. */
11501 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11503 /* Now walk the first one as a tail call. */
11504 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11508 WALK_SUBTREE (TREE_REALPART (*tp
));
11509 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11513 unsigned HOST_WIDE_INT idx
;
11514 constructor_elt
*ce
;
11516 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11518 WALK_SUBTREE (ce
->value
);
11523 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11528 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11530 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11531 into declarations that are just mentioned, rather than
11532 declared; they don't really belong to this part of the tree.
11533 And, we can see cycles: the initializer for a declaration
11534 can refer to the declaration itself. */
11535 WALK_SUBTREE (DECL_INITIAL (decl
));
11536 WALK_SUBTREE (DECL_SIZE (decl
));
11537 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11539 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11542 case STATEMENT_LIST
:
11544 tree_stmt_iterator i
;
11545 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11546 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11551 switch (OMP_CLAUSE_CODE (*tp
))
11553 case OMP_CLAUSE_GANG
:
11554 case OMP_CLAUSE__GRIDDIM_
:
11555 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11558 case OMP_CLAUSE_ASYNC
:
11559 case OMP_CLAUSE_WAIT
:
11560 case OMP_CLAUSE_WORKER
:
11561 case OMP_CLAUSE_VECTOR
:
11562 case OMP_CLAUSE_NUM_GANGS
:
11563 case OMP_CLAUSE_NUM_WORKERS
:
11564 case OMP_CLAUSE_VECTOR_LENGTH
:
11565 case OMP_CLAUSE_PRIVATE
:
11566 case OMP_CLAUSE_SHARED
:
11567 case OMP_CLAUSE_FIRSTPRIVATE
:
11568 case OMP_CLAUSE_COPYIN
:
11569 case OMP_CLAUSE_COPYPRIVATE
:
11570 case OMP_CLAUSE_FINAL
:
11571 case OMP_CLAUSE_IF
:
11572 case OMP_CLAUSE_NUM_THREADS
:
11573 case OMP_CLAUSE_SCHEDULE
:
11574 case OMP_CLAUSE_UNIFORM
:
11575 case OMP_CLAUSE_DEPEND
:
11576 case OMP_CLAUSE_NUM_TEAMS
:
11577 case OMP_CLAUSE_THREAD_LIMIT
:
11578 case OMP_CLAUSE_DEVICE
:
11579 case OMP_CLAUSE_DIST_SCHEDULE
:
11580 case OMP_CLAUSE_SAFELEN
:
11581 case OMP_CLAUSE_SIMDLEN
:
11582 case OMP_CLAUSE_ORDERED
:
11583 case OMP_CLAUSE_PRIORITY
:
11584 case OMP_CLAUSE_GRAINSIZE
:
11585 case OMP_CLAUSE_NUM_TASKS
:
11586 case OMP_CLAUSE_HINT
:
11587 case OMP_CLAUSE_TO_DECLARE
:
11588 case OMP_CLAUSE_LINK
:
11589 case OMP_CLAUSE_USE_DEVICE_PTR
:
11590 case OMP_CLAUSE_IS_DEVICE_PTR
:
11591 case OMP_CLAUSE__LOOPTEMP_
:
11592 case OMP_CLAUSE__SIMDUID_
:
11593 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11596 case OMP_CLAUSE_INDEPENDENT
:
11597 case OMP_CLAUSE_NOWAIT
:
11598 case OMP_CLAUSE_DEFAULT
:
11599 case OMP_CLAUSE_UNTIED
:
11600 case OMP_CLAUSE_MERGEABLE
:
11601 case OMP_CLAUSE_PROC_BIND
:
11602 case OMP_CLAUSE_INBRANCH
:
11603 case OMP_CLAUSE_NOTINBRANCH
:
11604 case OMP_CLAUSE_FOR
:
11605 case OMP_CLAUSE_PARALLEL
:
11606 case OMP_CLAUSE_SECTIONS
:
11607 case OMP_CLAUSE_TASKGROUP
:
11608 case OMP_CLAUSE_NOGROUP
:
11609 case OMP_CLAUSE_THREADS
:
11610 case OMP_CLAUSE_SIMD
:
11611 case OMP_CLAUSE_DEFAULTMAP
:
11612 case OMP_CLAUSE_AUTO
:
11613 case OMP_CLAUSE_SEQ
:
11614 case OMP_CLAUSE_TILE
:
11615 case OMP_CLAUSE__SIMT_
:
11616 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11618 case OMP_CLAUSE_LASTPRIVATE
:
11619 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11620 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11621 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11623 case OMP_CLAUSE_COLLAPSE
:
11626 for (i
= 0; i
< 3; i
++)
11627 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11628 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11631 case OMP_CLAUSE_LINEAR
:
11632 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11633 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11634 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11635 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11637 case OMP_CLAUSE_ALIGNED
:
11638 case OMP_CLAUSE_FROM
:
11639 case OMP_CLAUSE_TO
:
11640 case OMP_CLAUSE_MAP
:
11641 case OMP_CLAUSE__CACHE_
:
11642 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11643 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11644 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11646 case OMP_CLAUSE_REDUCTION
:
11649 for (i
= 0; i
< 5; i
++)
11650 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11651 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11655 gcc_unreachable ();
11663 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11664 But, we only want to walk once. */
11665 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11666 for (i
= 0; i
< len
; ++i
)
11667 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11668 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11672 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11673 defining. We only want to walk into these fields of a type in this
11674 case and not in the general case of a mere reference to the type.
11676 The criterion is as follows: if the field can be an expression, it
11677 must be walked only here. This should be in keeping with the fields
11678 that are directly gimplified in gimplify_type_sizes in order for the
11679 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11680 variable-sized types.
11682 Note that DECLs get walked as part of processing the BIND_EXPR. */
11683 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11685 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11686 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11689 /* Call the function for the type. See if it returns anything or
11690 doesn't want us to continue. If we are to continue, walk both
11691 the normal fields and those for the declaration case. */
11692 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11693 if (result
|| !walk_subtrees
)
11696 /* But do not walk a pointed-to type since it may itself need to
11697 be walked in the declaration case if it isn't anonymous. */
11698 if (!POINTER_TYPE_P (*type_p
))
11700 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11705 /* If this is a record type, also walk the fields. */
11706 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11710 for (field
= TYPE_FIELDS (*type_p
); field
;
11711 field
= DECL_CHAIN (field
))
11713 /* We'd like to look at the type of the field, but we can
11714 easily get infinite recursion. So assume it's pointed
11715 to elsewhere in the tree. Also, ignore things that
11717 if (TREE_CODE (field
) != FIELD_DECL
)
11720 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11721 WALK_SUBTREE (DECL_SIZE (field
));
11722 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11723 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11724 WALK_SUBTREE (DECL_QUALIFIER (field
));
11728 /* Same for scalar types. */
11729 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11730 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11731 || TREE_CODE (*type_p
) == INTEGER_TYPE
11732 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11733 || TREE_CODE (*type_p
) == REAL_TYPE
)
11735 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11736 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11739 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11740 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11745 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11749 /* Walk over all the sub-trees of this operand. */
11750 len
= TREE_OPERAND_LENGTH (*tp
);
11752 /* Go through the subtrees. We need to do this in forward order so
11753 that the scope of a FOR_EXPR is handled properly. */
11756 for (i
= 0; i
< len
- 1; ++i
)
11757 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11758 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11761 /* If this is a type, walk the needed fields in the type. */
11762 else if (TYPE_P (*tp
))
11763 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11767 /* We didn't find what we were looking for. */
11770 #undef WALK_SUBTREE_TAIL
11772 #undef WALK_SUBTREE
11774 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11777 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11782 hash_set
<tree
> pset
;
11783 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11789 tree_block (tree t
)
11791 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11793 if (IS_EXPR_CODE_CLASS (c
))
11794 return LOCATION_BLOCK (t
->exp
.locus
);
11795 gcc_unreachable ();
11800 tree_set_block (tree t
, tree b
)
11802 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11804 if (IS_EXPR_CODE_CLASS (c
))
11806 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11809 gcc_unreachable ();
11812 /* Create a nameless artificial label and put it in the current
11813 function context. The label has a location of LOC. Returns the
11814 newly created label. */
11817 create_artificial_label (location_t loc
)
11819 tree lab
= build_decl (loc
,
11820 LABEL_DECL
, NULL_TREE
, void_type_node
);
11822 DECL_ARTIFICIAL (lab
) = 1;
11823 DECL_IGNORED_P (lab
) = 1;
11824 DECL_CONTEXT (lab
) = current_function_decl
;
11828 /* Given a tree, try to return a useful variable name that we can use
11829 to prefix a temporary that is being assigned the value of the tree.
11830 I.E. given <temp> = &A, return A. */
11835 tree stripped_decl
;
11838 STRIP_NOPS (stripped_decl
);
11839 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11840 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11841 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11843 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11846 return IDENTIFIER_POINTER (name
);
11850 switch (TREE_CODE (stripped_decl
))
11853 return get_name (TREE_OPERAND (stripped_decl
, 0));
11860 /* Return true if TYPE has a variable argument list. */
11863 stdarg_p (const_tree fntype
)
11865 function_args_iterator args_iter
;
11866 tree n
= NULL_TREE
, t
;
11871 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11876 return n
!= NULL_TREE
&& n
!= void_type_node
;
11879 /* Return true if TYPE has a prototype. */
11882 prototype_p (const_tree fntype
)
11886 gcc_assert (fntype
!= NULL_TREE
);
11888 t
= TYPE_ARG_TYPES (fntype
);
11889 return (t
!= NULL_TREE
);
11892 /* If BLOCK is inlined from an __attribute__((__artificial__))
11893 routine, return pointer to location from where it has been
11896 block_nonartificial_location (tree block
)
11898 location_t
*ret
= NULL
;
11900 while (block
&& TREE_CODE (block
) == BLOCK
11901 && BLOCK_ABSTRACT_ORIGIN (block
))
11903 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11905 while (TREE_CODE (ao
) == BLOCK
11906 && BLOCK_ABSTRACT_ORIGIN (ao
)
11907 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11908 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11910 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11912 /* If AO is an artificial inline, point RET to the
11913 call site locus at which it has been inlined and continue
11914 the loop, in case AO's caller is also an artificial
11916 if (DECL_DECLARED_INLINE_P (ao
)
11917 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11918 ret
= &BLOCK_SOURCE_LOCATION (block
);
11922 else if (TREE_CODE (ao
) != BLOCK
)
11925 block
= BLOCK_SUPERCONTEXT (block
);
11931 /* If EXP is inlined from an __attribute__((__artificial__))
11932 function, return the location of the original call expression. */
11935 tree_nonartificial_location (tree exp
)
11937 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11942 return EXPR_LOCATION (exp
);
11946 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11949 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11952 cl_option_hasher::hash (tree x
)
11954 const_tree
const t
= x
;
11958 hashval_t hash
= 0;
11960 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11962 p
= (const char *)TREE_OPTIMIZATION (t
);
11963 len
= sizeof (struct cl_optimization
);
11966 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11967 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11970 gcc_unreachable ();
11972 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11974 for (i
= 0; i
< len
; i
++)
11976 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11981 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11982 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11986 cl_option_hasher::equal (tree x
, tree y
)
11988 const_tree
const xt
= x
;
11989 const_tree
const yt
= y
;
11994 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11997 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11999 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12000 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12001 len
= sizeof (struct cl_optimization
);
12004 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12006 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12007 TREE_TARGET_OPTION (yt
));
12011 gcc_unreachable ();
12013 return (memcmp (xp
, yp
, len
) == 0);
12016 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12019 build_optimization_node (struct gcc_options
*opts
)
12023 /* Use the cache of optimization nodes. */
12025 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12028 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12032 /* Insert this one into the hash table. */
12033 t
= cl_optimization_node
;
12036 /* Make a new node for next time round. */
12037 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12043 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12046 build_target_option_node (struct gcc_options
*opts
)
12050 /* Use the cache of optimization nodes. */
12052 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12055 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12059 /* Insert this one into the hash table. */
12060 t
= cl_target_option_node
;
12063 /* Make a new node for next time round. */
12064 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12070 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12071 so that they aren't saved during PCH writing. */
12074 prepare_target_option_nodes_for_pch (void)
12076 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12077 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12078 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12079 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12082 /* Determine the "ultimate origin" of a block. The block may be an inlined
12083 instance of an inlined instance of a block which is local to an inline
12084 function, so we have to trace all of the way back through the origin chain
12085 to find out what sort of node actually served as the original seed for the
12089 block_ultimate_origin (const_tree block
)
12091 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12093 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12094 we're trying to output the abstract instance of this function. */
12095 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12098 if (immediate_origin
== NULL_TREE
)
12103 tree lookahead
= immediate_origin
;
12107 ret_val
= lookahead
;
12108 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12109 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12111 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12113 /* The block's abstract origin chain may not be the *ultimate* origin of
12114 the block. It could lead to a DECL that has an abstract origin set.
12115 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12116 will give us if it has one). Note that DECL's abstract origins are
12117 supposed to be the most distant ancestor (or so decl_ultimate_origin
12118 claims), so we don't need to loop following the DECL origins. */
12119 if (DECL_P (ret_val
))
12120 return DECL_ORIGIN (ret_val
);
12126 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12130 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12132 /* Do not strip casts into or out of differing address spaces. */
12133 if (POINTER_TYPE_P (outer_type
)
12134 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12136 if (!POINTER_TYPE_P (inner_type
)
12137 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12138 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12141 else if (POINTER_TYPE_P (inner_type
)
12142 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12144 /* We already know that outer_type is not a pointer with
12145 a non-generic address space. */
12149 /* Use precision rather then machine mode when we can, which gives
12150 the correct answer even for submode (bit-field) types. */
12151 if ((INTEGRAL_TYPE_P (outer_type
)
12152 || POINTER_TYPE_P (outer_type
)
12153 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12154 && (INTEGRAL_TYPE_P (inner_type
)
12155 || POINTER_TYPE_P (inner_type
)
12156 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12157 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12159 /* Otherwise fall back on comparing machine modes (e.g. for
12160 aggregate types, floats). */
12161 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12164 /* Return true iff conversion in EXP generates no instruction. Mark
12165 it inline so that we fully inline into the stripping functions even
12166 though we have two uses of this function. */
12169 tree_nop_conversion (const_tree exp
)
12171 tree outer_type
, inner_type
;
12173 if (location_wrapper_p (exp
))
12175 if (!CONVERT_EXPR_P (exp
)
12176 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12178 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12181 outer_type
= TREE_TYPE (exp
);
12182 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12187 return tree_nop_conversion_p (outer_type
, inner_type
);
12190 /* Return true iff conversion in EXP generates no instruction. Don't
12191 consider conversions changing the signedness. */
12194 tree_sign_nop_conversion (const_tree exp
)
12196 tree outer_type
, inner_type
;
12198 if (!tree_nop_conversion (exp
))
12201 outer_type
= TREE_TYPE (exp
);
12202 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12204 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12205 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12208 /* Strip conversions from EXP according to tree_nop_conversion and
12209 return the resulting expression. */
12212 tree_strip_nop_conversions (tree exp
)
12214 while (tree_nop_conversion (exp
))
12215 exp
= TREE_OPERAND (exp
, 0);
12219 /* Strip conversions from EXP according to tree_sign_nop_conversion
12220 and return the resulting expression. */
12223 tree_strip_sign_nop_conversions (tree exp
)
12225 while (tree_sign_nop_conversion (exp
))
12226 exp
= TREE_OPERAND (exp
, 0);
12230 /* Avoid any floating point extensions from EXP. */
12232 strip_float_extensions (tree exp
)
12234 tree sub
, expt
, subt
;
12236 /* For floating point constant look up the narrowest type that can hold
12237 it properly and handle it like (type)(narrowest_type)constant.
12238 This way we can optimize for instance a=a*2.0 where "a" is float
12239 but 2.0 is double constant. */
12240 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12242 REAL_VALUE_TYPE orig
;
12245 orig
= TREE_REAL_CST (exp
);
12246 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12247 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12248 type
= float_type_node
;
12249 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12250 > TYPE_PRECISION (double_type_node
)
12251 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12252 type
= double_type_node
;
12254 return build_real_truncate (type
, orig
);
12257 if (!CONVERT_EXPR_P (exp
))
12260 sub
= TREE_OPERAND (exp
, 0);
12261 subt
= TREE_TYPE (sub
);
12262 expt
= TREE_TYPE (exp
);
12264 if (!FLOAT_TYPE_P (subt
))
12267 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12270 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12273 return strip_float_extensions (sub
);
12276 /* Strip out all handled components that produce invariant
12280 strip_invariant_refs (const_tree op
)
12282 while (handled_component_p (op
))
12284 switch (TREE_CODE (op
))
12287 case ARRAY_RANGE_REF
:
12288 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12289 || TREE_OPERAND (op
, 2) != NULL_TREE
12290 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12294 case COMPONENT_REF
:
12295 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12301 op
= TREE_OPERAND (op
, 0);
12307 static GTY(()) tree gcc_eh_personality_decl
;
12309 /* Return the GCC personality function decl. */
12312 lhd_gcc_personality (void)
12314 if (!gcc_eh_personality_decl
)
12315 gcc_eh_personality_decl
= build_personality_function ("gcc");
12316 return gcc_eh_personality_decl
;
12319 /* TARGET is a call target of GIMPLE call statement
12320 (obtained by gimple_call_fn). Return true if it is
12321 OBJ_TYPE_REF representing an virtual call of C++ method.
12322 (As opposed to OBJ_TYPE_REF representing objc calls
12323 through a cast where middle-end devirtualization machinery
12327 virtual_method_call_p (const_tree target
)
12329 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12331 tree t
= TREE_TYPE (target
);
12332 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12334 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12336 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12337 /* If we do not have BINFO associated, it means that type was built
12338 without devirtualization enabled. Do not consider this a virtual
12340 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12345 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12348 obj_type_ref_class (const_tree ref
)
12350 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12351 ref
= TREE_TYPE (ref
);
12352 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12353 ref
= TREE_TYPE (ref
);
12354 /* We look for type THIS points to. ObjC also builds
12355 OBJ_TYPE_REF with non-method calls, Their first parameter
12356 ID however also corresponds to class type. */
12357 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12358 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12359 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12360 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12361 return TREE_TYPE (ref
);
12364 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12367 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12370 tree base_binfo
, b
;
12372 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12373 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12374 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12376 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12381 /* Try to find a base info of BINFO that would have its field decl at offset
12382 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12383 found, return, otherwise return NULL_TREE. */
12386 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12388 tree type
= BINFO_TYPE (binfo
);
12392 HOST_WIDE_INT pos
, size
;
12396 if (types_same_for_odr (type
, expected_type
))
12398 if (maybe_lt (offset
, 0))
12401 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12403 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12406 pos
= int_bit_position (fld
);
12407 size
= tree_to_uhwi (DECL_SIZE (fld
));
12408 if (known_in_range_p (offset
, pos
, size
))
12411 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12414 /* Offset 0 indicates the primary base, whose vtable contents are
12415 represented in the binfo for the derived class. */
12416 else if (maybe_ne (offset
, 0))
12418 tree found_binfo
= NULL
, base_binfo
;
12419 /* Offsets in BINFO are in bytes relative to the whole structure
12420 while POS is in bits relative to the containing field. */
12421 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12424 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12425 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12426 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12428 found_binfo
= base_binfo
;
12432 binfo
= found_binfo
;
12434 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12438 type
= TREE_TYPE (fld
);
12443 /* Returns true if X is a typedef decl. */
12446 is_typedef_decl (const_tree x
)
12448 return (x
&& TREE_CODE (x
) == TYPE_DECL
12449 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12452 /* Returns true iff TYPE is a type variant created for a typedef. */
12455 typedef_variant_p (const_tree type
)
12457 return is_typedef_decl (TYPE_NAME (type
));
12460 /* Warn about a use of an identifier which was marked deprecated. */
12462 warn_deprecated_use (tree node
, tree attr
)
12466 if (node
== 0 || !warn_deprecated_decl
)
12472 attr
= DECL_ATTRIBUTES (node
);
12473 else if (TYPE_P (node
))
12475 tree decl
= TYPE_STUB_DECL (node
);
12477 attr
= lookup_attribute ("deprecated",
12478 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12483 attr
= lookup_attribute ("deprecated", attr
);
12486 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12494 w
= warning (OPT_Wdeprecated_declarations
,
12495 "%qD is deprecated: %s", node
, msg
);
12497 w
= warning (OPT_Wdeprecated_declarations
,
12498 "%qD is deprecated", node
);
12500 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12502 else if (TYPE_P (node
))
12504 tree what
= NULL_TREE
;
12505 tree decl
= TYPE_STUB_DECL (node
);
12507 if (TYPE_NAME (node
))
12509 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12510 what
= TYPE_NAME (node
);
12511 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12512 && DECL_NAME (TYPE_NAME (node
)))
12513 what
= DECL_NAME (TYPE_NAME (node
));
12521 w
= warning (OPT_Wdeprecated_declarations
,
12522 "%qE is deprecated: %s", what
, msg
);
12524 w
= warning (OPT_Wdeprecated_declarations
,
12525 "%qE is deprecated", what
);
12530 w
= warning (OPT_Wdeprecated_declarations
,
12531 "type is deprecated: %s", msg
);
12533 w
= warning (OPT_Wdeprecated_declarations
,
12534 "type is deprecated");
12537 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12544 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12547 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12552 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12555 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12561 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12562 somewhere in it. */
12565 contains_bitfld_component_ref_p (const_tree ref
)
12567 while (handled_component_p (ref
))
12569 if (TREE_CODE (ref
) == COMPONENT_REF
12570 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12572 ref
= TREE_OPERAND (ref
, 0);
12578 /* Try to determine whether a TRY_CATCH expression can fall through.
12579 This is a subroutine of block_may_fallthru. */
12582 try_catch_may_fallthru (const_tree stmt
)
12584 tree_stmt_iterator i
;
12586 /* If the TRY block can fall through, the whole TRY_CATCH can
12588 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12591 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12592 switch (TREE_CODE (tsi_stmt (i
)))
12595 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12596 catch expression and a body. The whole TRY_CATCH may fall
12597 through iff any of the catch bodies falls through. */
12598 for (; !tsi_end_p (i
); tsi_next (&i
))
12600 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12605 case EH_FILTER_EXPR
:
12606 /* The exception filter expression only matters if there is an
12607 exception. If the exception does not match EH_FILTER_TYPES,
12608 we will execute EH_FILTER_FAILURE, and we will fall through
12609 if that falls through. If the exception does match
12610 EH_FILTER_TYPES, the stack unwinder will continue up the
12611 stack, so we will not fall through. We don't know whether we
12612 will throw an exception which matches EH_FILTER_TYPES or not,
12613 so we just ignore EH_FILTER_TYPES and assume that we might
12614 throw an exception which doesn't match. */
12615 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12618 /* This case represents statements to be executed when an
12619 exception occurs. Those statements are implicitly followed
12620 by a RESX statement to resume execution after the exception.
12621 So in this case the TRY_CATCH never falls through. */
12626 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12627 need not be 100% accurate; simply be conservative and return true if we
12628 don't know. This is used only to avoid stupidly generating extra code.
12629 If we're wrong, we'll just delete the extra code later. */
12632 block_may_fallthru (const_tree block
)
12634 /* This CONST_CAST is okay because expr_last returns its argument
12635 unmodified and we assign it to a const_tree. */
12636 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12638 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12642 /* Easy cases. If the last statement of the block implies
12643 control transfer, then we can't fall through. */
12647 /* If there is a default: label or case labels cover all possible
12648 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12649 to some case label in all cases and all we care is whether the
12650 SWITCH_BODY falls through. */
12651 if (SWITCH_ALL_CASES_P (stmt
))
12652 return block_may_fallthru (SWITCH_BODY (stmt
));
12656 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12658 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12661 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12663 case TRY_CATCH_EXPR
:
12664 return try_catch_may_fallthru (stmt
);
12666 case TRY_FINALLY_EXPR
:
12667 /* The finally clause is always executed after the try clause,
12668 so if it does not fall through, then the try-finally will not
12669 fall through. Otherwise, if the try clause does not fall
12670 through, then when the finally clause falls through it will
12671 resume execution wherever the try clause was going. So the
12672 whole try-finally will only fall through if both the try
12673 clause and the finally clause fall through. */
12674 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12675 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12678 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12679 stmt
= TREE_OPERAND (stmt
, 1);
12685 /* Functions that do not return do not fall through. */
12686 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12688 case CLEANUP_POINT_EXPR
:
12689 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12692 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12698 return lang_hooks
.block_may_fallthru (stmt
);
12702 /* True if we are using EH to handle cleanups. */
12703 static bool using_eh_for_cleanups_flag
= false;
12705 /* This routine is called from front ends to indicate eh should be used for
12708 using_eh_for_cleanups (void)
12710 using_eh_for_cleanups_flag
= true;
12713 /* Query whether EH is used for cleanups. */
12715 using_eh_for_cleanups_p (void)
12717 return using_eh_for_cleanups_flag
;
12720 /* Wrapper for tree_code_name to ensure that tree code is valid */
12722 get_tree_code_name (enum tree_code code
)
12724 const char *invalid
= "<invalid tree code>";
12726 if (code
>= MAX_TREE_CODES
)
12729 return tree_code_name
[code
];
12732 /* Drops the TREE_OVERFLOW flag from T. */
12735 drop_tree_overflow (tree t
)
12737 gcc_checking_assert (TREE_OVERFLOW (t
));
12739 /* For tree codes with a sharing machinery re-build the result. */
12740 if (poly_int_tree_p (t
))
12741 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
12743 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12744 and canonicalize the result. */
12745 if (TREE_CODE (t
) == VECTOR_CST
)
12747 tree_vector_builder builder
;
12748 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12749 unsigned int count
= builder
.encoded_nelts ();
12750 for (unsigned int i
= 0; i
< count
; ++i
)
12752 tree elt
= VECTOR_CST_ELT (t
, i
);
12753 if (TREE_OVERFLOW (elt
))
12754 elt
= drop_tree_overflow (elt
);
12755 builder
.quick_push (elt
);
12757 return builder
.build ();
12760 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12761 and drop the flag. */
12763 TREE_OVERFLOW (t
) = 0;
12765 /* For constants that contain nested constants, drop the flag
12766 from those as well. */
12767 if (TREE_CODE (t
) == COMPLEX_CST
)
12769 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12770 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12771 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12772 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12778 /* Given a memory reference expression T, return its base address.
12779 The base address of a memory reference expression is the main
12780 object being referenced. For instance, the base address for
12781 'array[i].fld[j]' is 'array'. You can think of this as stripping
12782 away the offset part from a memory address.
12784 This function calls handled_component_p to strip away all the inner
12785 parts of the memory reference until it reaches the base object. */
12788 get_base_address (tree t
)
12790 while (handled_component_p (t
))
12791 t
= TREE_OPERAND (t
, 0);
12793 if ((TREE_CODE (t
) == MEM_REF
12794 || TREE_CODE (t
) == TARGET_MEM_REF
)
12795 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12796 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12798 /* ??? Either the alias oracle or all callers need to properly deal
12799 with WITH_SIZE_EXPRs before we can look through those. */
12800 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12806 /* Return a tree of sizetype representing the size, in bytes, of the element
12807 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12810 array_ref_element_size (tree exp
)
12812 tree aligned_size
= TREE_OPERAND (exp
, 3);
12813 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12814 location_t loc
= EXPR_LOCATION (exp
);
12816 /* If a size was specified in the ARRAY_REF, it's the size measured
12817 in alignment units of the element type. So multiply by that value. */
12820 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12821 sizetype from another type of the same width and signedness. */
12822 if (TREE_TYPE (aligned_size
) != sizetype
)
12823 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12824 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12825 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12828 /* Otherwise, take the size from that of the element type. Substitute
12829 any PLACEHOLDER_EXPR that we have. */
12831 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12834 /* Return a tree representing the lower bound of the array mentioned in
12835 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12838 array_ref_low_bound (tree exp
)
12840 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12842 /* If a lower bound is specified in EXP, use it. */
12843 if (TREE_OPERAND (exp
, 2))
12844 return TREE_OPERAND (exp
, 2);
12846 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12847 substituting for a PLACEHOLDER_EXPR as needed. */
12848 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12849 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12851 /* Otherwise, return a zero of the appropriate type. */
12852 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12855 /* Return a tree representing the upper bound of the array mentioned in
12856 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12859 array_ref_up_bound (tree exp
)
12861 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12863 /* If there is a domain type and it has an upper bound, use it, substituting
12864 for a PLACEHOLDER_EXPR as needed. */
12865 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12866 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12868 /* Otherwise fail. */
12872 /* Returns true if REF is an array reference or a component reference
12873 to an array at the end of a structure.
12874 If this is the case, the array may be allocated larger
12875 than its upper bound implies. */
12878 array_at_struct_end_p (tree ref
)
12882 if (TREE_CODE (ref
) == ARRAY_REF
12883 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12885 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12886 ref
= TREE_OPERAND (ref
, 0);
12888 else if (TREE_CODE (ref
) == COMPONENT_REF
12889 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12890 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12894 if (TREE_CODE (ref
) == STRING_CST
)
12897 tree ref_to_array
= ref
;
12898 while (handled_component_p (ref
))
12900 /* If the reference chain contains a component reference to a
12901 non-union type and there follows another field the reference
12902 is not at the end of a structure. */
12903 if (TREE_CODE (ref
) == COMPONENT_REF
)
12905 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12907 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12908 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12909 nextf
= DECL_CHAIN (nextf
);
12914 /* If we have a multi-dimensional array we do not consider
12915 a non-innermost dimension as flex array if the whole
12916 multi-dimensional array is at struct end.
12917 Same for an array of aggregates with a trailing array
12919 else if (TREE_CODE (ref
) == ARRAY_REF
)
12921 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12923 /* If we view an underlying object as sth else then what we
12924 gathered up to now is what we have to rely on. */
12925 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12928 gcc_unreachable ();
12930 ref
= TREE_OPERAND (ref
, 0);
12933 /* The array now is at struct end. Treat flexible arrays as
12934 always subject to extend, even into just padding constrained by
12935 an underlying decl. */
12936 if (! TYPE_SIZE (atype
)
12937 || ! TYPE_DOMAIN (atype
)
12938 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12941 if (TREE_CODE (ref
) == MEM_REF
12942 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12943 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12945 /* If the reference is based on a declared entity, the size of the array
12946 is constrained by its given domain. (Do not trust commons PR/69368). */
12948 && !(flag_unconstrained_commons
12949 && VAR_P (ref
) && DECL_COMMON (ref
))
12950 && DECL_SIZE_UNIT (ref
)
12951 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
12953 /* Check whether the array domain covers all of the available
12956 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
12957 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
12958 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
12960 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
12963 /* If at least one extra element fits it is a flexarray. */
12964 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12965 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
12967 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
12968 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
12977 /* Return a tree representing the offset, in bytes, of the field referenced
12978 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12981 component_ref_field_offset (tree exp
)
12983 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12984 tree field
= TREE_OPERAND (exp
, 1);
12985 location_t loc
= EXPR_LOCATION (exp
);
12987 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12988 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12990 if (aligned_offset
)
12992 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12993 sizetype from another type of the same width and signedness. */
12994 if (TREE_TYPE (aligned_offset
) != sizetype
)
12995 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12996 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12997 size_int (DECL_OFFSET_ALIGN (field
)
13001 /* Otherwise, take the offset from that of the field. Substitute
13002 any PLACEHOLDER_EXPR that we have. */
13004 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13007 /* Return the machine mode of T. For vectors, returns the mode of the
13008 inner type. The main use case is to feed the result to HONOR_NANS,
13009 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13012 element_mode (const_tree t
)
13016 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13018 return TYPE_MODE (t
);
13021 /* Vector types need to re-check the target flags each time we report
13022 the machine mode. We need to do this because attribute target can
13023 change the result of vector_mode_supported_p and have_regs_of_mode
13024 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13025 change on a per-function basis. */
13026 /* ??? Possibly a better solution is to run through all the types
13027 referenced by a function and re-compute the TYPE_MODE once, rather
13028 than make the TYPE_MODE macro call a function. */
13031 vector_type_mode (const_tree t
)
13035 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13037 mode
= t
->type_common
.mode
;
13038 if (VECTOR_MODE_P (mode
)
13039 && (!targetm
.vector_mode_supported_p (mode
)
13040 || !have_regs_of_mode
[mode
]))
13042 scalar_int_mode innermode
;
13044 /* For integers, try mapping it to a same-sized scalar mode. */
13045 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13047 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13048 * GET_MODE_BITSIZE (innermode
));
13049 scalar_int_mode mode
;
13050 if (int_mode_for_size (size
, 0).exists (&mode
)
13051 && have_regs_of_mode
[mode
])
13061 /* Verify that basic properties of T match TV and thus T can be a variant of
13062 TV. TV should be the more specified variant (i.e. the main variant). */
13065 verify_type_variant (const_tree t
, tree tv
)
13067 /* Type variant can differ by:
13069 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13070 ENCODE_QUAL_ADDR_SPACE.
13071 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13072 in this case some values may not be set in the variant types
13073 (see TYPE_COMPLETE_P checks).
13074 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13075 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13076 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13077 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13078 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13079 this is necessary to make it possible to merge types form different TUs
13080 - arrays, pointers and references may have TREE_TYPE that is a variant
13081 of TREE_TYPE of their main variants.
13082 - aggregates may have new TYPE_FIELDS list that list variants of
13083 the main variant TYPE_FIELDS.
13084 - vector types may differ by TYPE_VECTOR_OPAQUE
13087 /* Convenience macro for matching individual fields. */
13088 #define verify_variant_match(flag) \
13090 if (flag (tv) != flag (t)) \
13092 error ("type variant differs by " #flag "."); \
13098 /* tree_base checks. */
13100 verify_variant_match (TREE_CODE
);
13101 /* FIXME: Ada builds non-artificial variants of artificial types. */
13102 if (TYPE_ARTIFICIAL (tv
) && 0)
13103 verify_variant_match (TYPE_ARTIFICIAL
);
13104 if (POINTER_TYPE_P (tv
))
13105 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13106 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13107 verify_variant_match (TYPE_UNSIGNED
);
13108 verify_variant_match (TYPE_PACKED
);
13109 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13110 verify_variant_match (TYPE_REF_IS_RVALUE
);
13111 if (AGGREGATE_TYPE_P (t
))
13112 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13114 verify_variant_match (TYPE_SATURATING
);
13115 /* FIXME: This check trigger during libstdc++ build. */
13116 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13117 verify_variant_match (TYPE_FINAL_P
);
13119 /* tree_type_common checks. */
13121 if (COMPLETE_TYPE_P (t
))
13123 verify_variant_match (TYPE_MODE
);
13124 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13125 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13126 verify_variant_match (TYPE_SIZE
);
13127 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13128 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13129 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13131 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13132 TYPE_SIZE_UNIT (tv
), 0));
13133 error ("type variant has different TYPE_SIZE_UNIT");
13135 error ("type variant's TYPE_SIZE_UNIT");
13136 debug_tree (TYPE_SIZE_UNIT (tv
));
13137 error ("type's TYPE_SIZE_UNIT");
13138 debug_tree (TYPE_SIZE_UNIT (t
));
13142 verify_variant_match (TYPE_PRECISION
);
13143 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13144 if (RECORD_OR_UNION_TYPE_P (t
))
13145 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13146 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13147 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13148 /* During LTO we merge variant lists from diferent translation units
13149 that may differ BY TYPE_CONTEXT that in turn may point
13150 to TRANSLATION_UNIT_DECL.
13151 Ada also builds variants of types with different TYPE_CONTEXT. */
13152 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13153 verify_variant_match (TYPE_CONTEXT
);
13154 verify_variant_match (TYPE_STRING_FLAG
);
13155 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13157 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13162 /* tree_type_non_common checks. */
13164 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13165 and dangle the pointer from time to time. */
13166 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13167 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13168 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13170 error ("type variant has different TYPE_VFIELD");
13174 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13175 || TREE_CODE (t
) == INTEGER_TYPE
13176 || TREE_CODE (t
) == BOOLEAN_TYPE
13177 || TREE_CODE (t
) == REAL_TYPE
13178 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13180 verify_variant_match (TYPE_MAX_VALUE
);
13181 verify_variant_match (TYPE_MIN_VALUE
);
13183 if (TREE_CODE (t
) == METHOD_TYPE
)
13184 verify_variant_match (TYPE_METHOD_BASETYPE
);
13185 if (TREE_CODE (t
) == OFFSET_TYPE
)
13186 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13187 if (TREE_CODE (t
) == ARRAY_TYPE
)
13188 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13189 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13190 or even type's main variant. This is needed to make bootstrap pass
13191 and the bug seems new in GCC 5.
13192 C++ FE should be updated to make this consistent and we should check
13193 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13194 is a match with main variant.
13196 Also disable the check for Java for now because of parser hack that builds
13197 first an dummy BINFO and then sometimes replace it by real BINFO in some
13199 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13200 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13201 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13202 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13203 at LTO time only. */
13204 && (in_lto_p
&& odr_type_p (t
)))
13206 error ("type variant has different TYPE_BINFO");
13208 error ("type variant's TYPE_BINFO");
13209 debug_tree (TYPE_BINFO (tv
));
13210 error ("type's TYPE_BINFO");
13211 debug_tree (TYPE_BINFO (t
));
13215 /* Check various uses of TYPE_VALUES_RAW. */
13216 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13217 verify_variant_match (TYPE_VALUES
);
13218 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13219 verify_variant_match (TYPE_DOMAIN
);
13220 /* Permit incomplete variants of complete type. While FEs may complete
13221 all variants, this does not happen for C++ templates in all cases. */
13222 else if (RECORD_OR_UNION_TYPE_P (t
)
13223 && COMPLETE_TYPE_P (t
)
13224 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13228 /* Fortran builds qualified variants as new records with items of
13229 qualified type. Verify that they looks same. */
13230 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13232 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13233 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13234 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13235 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13236 /* FIXME: gfc_nonrestricted_type builds all types as variants
13237 with exception of pointer types. It deeply copies the type
13238 which means that we may end up with a variant type
13239 referring non-variant pointer. We may change it to
13240 produce types as variants, too, like
13241 objc_get_protocol_qualified_type does. */
13242 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13243 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13244 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13248 error ("type variant has different TYPE_FIELDS");
13250 error ("first mismatch is field");
13252 error ("and field");
13257 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13258 verify_variant_match (TYPE_ARG_TYPES
);
13259 /* For C++ the qualified variant of array type is really an array type
13260 of qualified TREE_TYPE.
13261 objc builds variants of pointer where pointer to type is a variant, too
13262 in objc_get_protocol_qualified_type. */
13263 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13264 && ((TREE_CODE (t
) != ARRAY_TYPE
13265 && !POINTER_TYPE_P (t
))
13266 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13267 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13269 error ("type variant has different TREE_TYPE");
13271 error ("type variant's TREE_TYPE");
13272 debug_tree (TREE_TYPE (tv
));
13273 error ("type's TREE_TYPE");
13274 debug_tree (TREE_TYPE (t
));
13277 if (type_with_alias_set_p (t
)
13278 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13280 error ("type is not compatible with its variant");
13282 error ("type variant's TREE_TYPE");
13283 debug_tree (TREE_TYPE (tv
));
13284 error ("type's TREE_TYPE");
13285 debug_tree (TREE_TYPE (t
));
13289 #undef verify_variant_match
13293 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13294 the middle-end types_compatible_p function. It needs to avoid
13295 claiming types are different for types that should be treated
13296 the same with respect to TBAA. Canonical types are also used
13297 for IL consistency checks via the useless_type_conversion_p
13298 predicate which does not handle all type kinds itself but falls
13299 back to pointer-comparison of TYPE_CANONICAL for aggregates
13302 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13303 type calculation because we need to allow inter-operability between signed
13304 and unsigned variants. */
13307 type_with_interoperable_signedness (const_tree type
)
13309 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13310 signed char and unsigned char. Similarly fortran FE builds
13311 C_SIZE_T as signed type, while C defines it unsigned. */
13313 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13315 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13316 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13319 /* Return true iff T1 and T2 are structurally identical for what
13321 This function is used both by lto.c canonical type merging and by the
13322 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13323 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13324 only for LTO because only in these cases TYPE_CANONICAL equivalence
13325 correspond to one defined by gimple_canonical_types_compatible_p. */
13328 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13329 bool trust_type_canonical
)
13331 /* Type variants should be same as the main variant. When not doing sanity
13332 checking to verify this fact, go to main variants and save some work. */
13333 if (trust_type_canonical
)
13335 t1
= TYPE_MAIN_VARIANT (t1
);
13336 t2
= TYPE_MAIN_VARIANT (t2
);
13339 /* Check first for the obvious case of pointer identity. */
13343 /* Check that we have two types to compare. */
13344 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13347 /* We consider complete types always compatible with incomplete type.
13348 This does not make sense for canonical type calculation and thus we
13349 need to ensure that we are never called on it.
13351 FIXME: For more correctness the function probably should have three modes
13352 1) mode assuming that types are complete mathcing their structure
13353 2) mode allowing incomplete types but producing equivalence classes
13354 and thus ignoring all info from complete types
13355 3) mode allowing incomplete types to match complete but checking
13356 compatibility between complete types.
13358 1 and 2 can be used for canonical type calculation. 3 is the real
13359 definition of type compatibility that can be used i.e. for warnings during
13360 declaration merging. */
13362 gcc_assert (!trust_type_canonical
13363 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13364 /* If the types have been previously registered and found equal
13367 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13368 && trust_type_canonical
)
13370 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13371 they are always NULL, but they are set to non-NULL for types
13372 constructed by build_pointer_type and variants. In this case the
13373 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13374 all pointers are considered equal. Be sure to not return false
13376 gcc_checking_assert (canonical_type_used_p (t1
)
13377 && canonical_type_used_p (t2
));
13378 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13381 /* Can't be the same type if the types don't have the same code. */
13382 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13383 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13386 /* Qualifiers do not matter for canonical type comparison purposes. */
13388 /* Void types and nullptr types are always the same. */
13389 if (TREE_CODE (t1
) == VOID_TYPE
13390 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13393 /* Can't be the same type if they have different mode. */
13394 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13397 /* Non-aggregate types can be handled cheaply. */
13398 if (INTEGRAL_TYPE_P (t1
)
13399 || SCALAR_FLOAT_TYPE_P (t1
)
13400 || FIXED_POINT_TYPE_P (t1
)
13401 || TREE_CODE (t1
) == VECTOR_TYPE
13402 || TREE_CODE (t1
) == COMPLEX_TYPE
13403 || TREE_CODE (t1
) == OFFSET_TYPE
13404 || POINTER_TYPE_P (t1
))
13406 /* Can't be the same type if they have different recision. */
13407 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13410 /* In some cases the signed and unsigned types are required to be
13412 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13413 && !type_with_interoperable_signedness (t1
))
13416 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13417 interoperable with "signed char". Unless all frontends are revisited
13418 to agree on these types, we must ignore the flag completely. */
13420 /* Fortran standard define C_PTR type that is compatible with every
13421 C pointer. For this reason we need to glob all pointers into one.
13422 Still pointers in different address spaces are not compatible. */
13423 if (POINTER_TYPE_P (t1
))
13425 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13426 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13430 /* Tail-recurse to components. */
13431 if (TREE_CODE (t1
) == VECTOR_TYPE
13432 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13433 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13435 trust_type_canonical
);
13440 /* Do type-specific comparisons. */
13441 switch (TREE_CODE (t1
))
13444 /* Array types are the same if the element types are the same and
13445 the number of elements are the same. */
13446 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13447 trust_type_canonical
)
13448 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13449 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13450 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13454 tree i1
= TYPE_DOMAIN (t1
);
13455 tree i2
= TYPE_DOMAIN (t2
);
13457 /* For an incomplete external array, the type domain can be
13458 NULL_TREE. Check this condition also. */
13459 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13461 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13465 tree min1
= TYPE_MIN_VALUE (i1
);
13466 tree min2
= TYPE_MIN_VALUE (i2
);
13467 tree max1
= TYPE_MAX_VALUE (i1
);
13468 tree max2
= TYPE_MAX_VALUE (i2
);
13470 /* The minimum/maximum values have to be the same. */
13473 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13474 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13475 || operand_equal_p (min1
, min2
, 0))))
13478 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13479 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13480 || operand_equal_p (max1
, max2
, 0)))))
13488 case FUNCTION_TYPE
:
13489 /* Function types are the same if the return type and arguments types
13491 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13492 trust_type_canonical
))
13495 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13499 tree parms1
, parms2
;
13501 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13503 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13505 if (!gimple_canonical_types_compatible_p
13506 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13507 trust_type_canonical
))
13511 if (parms1
|| parms2
)
13519 case QUAL_UNION_TYPE
:
13523 /* Don't try to compare variants of an incomplete type, before
13524 TYPE_FIELDS has been copied around. */
13525 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13529 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13532 /* For aggregate types, all the fields must be the same. */
13533 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13535 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13537 /* Skip non-fields and zero-sized fields. */
13538 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13540 && integer_zerop (DECL_SIZE (f1
)))))
13541 f1
= TREE_CHAIN (f1
);
13542 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13544 && integer_zerop (DECL_SIZE (f2
)))))
13545 f2
= TREE_CHAIN (f2
);
13548 /* The fields must have the same name, offset and type. */
13549 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13550 || !gimple_compare_field_offset (f1
, f2
)
13551 || !gimple_canonical_types_compatible_p
13552 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13553 trust_type_canonical
))
13557 /* If one aggregate has more fields than the other, they
13558 are not the same. */
13566 /* Consider all types with language specific trees in them mutually
13567 compatible. This is executed only from verify_type and false
13568 positives can be tolerated. */
13569 gcc_assert (!in_lto_p
);
13574 /* Verify type T. */
13577 verify_type (const_tree t
)
13579 bool error_found
= false;
13580 tree mv
= TYPE_MAIN_VARIANT (t
);
13583 error ("Main variant is not defined");
13584 error_found
= true;
13586 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13588 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13590 error_found
= true;
13592 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13593 error_found
= true;
13595 tree ct
= TYPE_CANONICAL (t
);
13598 else if (TYPE_CANONICAL (t
) != ct
)
13600 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13602 error_found
= true;
13604 /* Method and function types can not be used to address memory and thus
13605 TYPE_CANONICAL really matters only for determining useless conversions.
13607 FIXME: C++ FE produce declarations of builtin functions that are not
13608 compatible with main variants. */
13609 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13612 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13613 with variably sized arrays because their sizes possibly
13614 gimplified to different variables. */
13615 && !variably_modified_type_p (ct
, NULL
)
13616 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13618 error ("TYPE_CANONICAL is not compatible");
13620 error_found
= true;
13623 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13624 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13626 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13628 error_found
= true;
13630 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13632 error ("TYPE_CANONICAL of main variant is not main variant");
13634 debug_tree (TYPE_MAIN_VARIANT (ct
));
13635 error_found
= true;
13639 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13640 if (RECORD_OR_UNION_TYPE_P (t
))
13642 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13643 and danagle the pointer from time to time. */
13644 if (TYPE_VFIELD (t
)
13645 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13646 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13648 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13649 debug_tree (TYPE_VFIELD (t
));
13650 error_found
= true;
13653 else if (TREE_CODE (t
) == POINTER_TYPE
)
13655 if (TYPE_NEXT_PTR_TO (t
)
13656 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13658 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13659 debug_tree (TYPE_NEXT_PTR_TO (t
));
13660 error_found
= true;
13663 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13665 if (TYPE_NEXT_REF_TO (t
)
13666 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13668 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13669 debug_tree (TYPE_NEXT_REF_TO (t
));
13670 error_found
= true;
13673 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13674 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13676 /* FIXME: The following check should pass:
13677 useless_type_conversion_p (const_cast <tree> (t),
13678 TREE_TYPE (TYPE_MIN_VALUE (t))
13679 but does not for C sizetypes in LTO. */
13682 /* Check various uses of TYPE_MAXVAL_RAW. */
13683 if (RECORD_OR_UNION_TYPE_P (t
))
13685 if (!TYPE_BINFO (t
))
13687 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13689 error ("TYPE_BINFO is not TREE_BINFO");
13690 debug_tree (TYPE_BINFO (t
));
13691 error_found
= true;
13693 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13695 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13696 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13697 error_found
= true;
13700 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13702 if (TYPE_METHOD_BASETYPE (t
)
13703 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13704 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13706 error ("TYPE_METHOD_BASETYPE is not record nor union");
13707 debug_tree (TYPE_METHOD_BASETYPE (t
));
13708 error_found
= true;
13711 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13713 if (TYPE_OFFSET_BASETYPE (t
)
13714 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13715 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13717 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13718 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13719 error_found
= true;
13722 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13723 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13725 /* FIXME: The following check should pass:
13726 useless_type_conversion_p (const_cast <tree> (t),
13727 TREE_TYPE (TYPE_MAX_VALUE (t))
13728 but does not for C sizetypes in LTO. */
13730 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13732 if (TYPE_ARRAY_MAX_SIZE (t
)
13733 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13735 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13736 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13737 error_found
= true;
13740 else if (TYPE_MAX_VALUE_RAW (t
))
13742 error ("TYPE_MAX_VALUE_RAW non-NULL");
13743 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13744 error_found
= true;
13747 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13749 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13750 debug_tree (TYPE_LANG_SLOT_1 (t
));
13751 error_found
= true;
13754 /* Check various uses of TYPE_VALUES_RAW. */
13755 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13756 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13758 tree value
= TREE_VALUE (l
);
13759 tree name
= TREE_PURPOSE (l
);
13761 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13762 CONST_DECL of ENUMERAL TYPE. */
13763 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13765 error ("Enum value is not CONST_DECL or INTEGER_CST");
13766 debug_tree (value
);
13768 error_found
= true;
13770 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13771 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13773 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13774 debug_tree (value
);
13776 error_found
= true;
13778 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13780 error ("Enum value name is not IDENTIFIER_NODE");
13781 debug_tree (value
);
13783 error_found
= true;
13786 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13788 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13790 error ("Array TYPE_DOMAIN is not integer type");
13791 debug_tree (TYPE_DOMAIN (t
));
13792 error_found
= true;
13795 else if (RECORD_OR_UNION_TYPE_P (t
))
13797 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13799 error ("TYPE_FIELDS defined in incomplete type");
13800 error_found
= true;
13802 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13804 /* TODO: verify properties of decls. */
13805 if (TREE_CODE (fld
) == FIELD_DECL
)
13807 else if (TREE_CODE (fld
) == TYPE_DECL
)
13809 else if (TREE_CODE (fld
) == CONST_DECL
)
13811 else if (VAR_P (fld
))
13813 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13815 else if (TREE_CODE (fld
) == USING_DECL
)
13817 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13821 error ("Wrong tree in TYPE_FIELDS list");
13823 error_found
= true;
13827 else if (TREE_CODE (t
) == INTEGER_TYPE
13828 || TREE_CODE (t
) == BOOLEAN_TYPE
13829 || TREE_CODE (t
) == OFFSET_TYPE
13830 || TREE_CODE (t
) == REFERENCE_TYPE
13831 || TREE_CODE (t
) == NULLPTR_TYPE
13832 || TREE_CODE (t
) == POINTER_TYPE
)
13834 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13836 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13837 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13838 error_found
= true;
13840 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13842 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13843 debug_tree (TYPE_CACHED_VALUES (t
));
13844 error_found
= true;
13846 /* Verify just enough of cache to ensure that no one copied it to new type.
13847 All copying should go by copy_node that should clear it. */
13848 else if (TYPE_CACHED_VALUES_P (t
))
13851 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13852 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13853 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13855 error ("wrong TYPE_CACHED_VALUES entry");
13856 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13857 error_found
= true;
13862 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13863 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13865 /* C++ FE uses TREE_PURPOSE to store initial values. */
13866 if (TREE_PURPOSE (l
) && in_lto_p
)
13868 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13870 error_found
= true;
13872 if (!TYPE_P (TREE_VALUE (l
)))
13874 error ("Wrong entry in TYPE_ARG_TYPES list");
13876 error_found
= true;
13879 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13881 error ("TYPE_VALUES_RAW field is non-NULL");
13882 debug_tree (TYPE_VALUES_RAW (t
));
13883 error_found
= true;
13885 if (TREE_CODE (t
) != INTEGER_TYPE
13886 && TREE_CODE (t
) != BOOLEAN_TYPE
13887 && TREE_CODE (t
) != OFFSET_TYPE
13888 && TREE_CODE (t
) != REFERENCE_TYPE
13889 && TREE_CODE (t
) != NULLPTR_TYPE
13890 && TREE_CODE (t
) != POINTER_TYPE
13891 && TYPE_CACHED_VALUES_P (t
))
13893 error ("TYPE_CACHED_VALUES_P is set while it should not");
13894 error_found
= true;
13896 if (TYPE_STRING_FLAG (t
)
13897 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13899 error ("TYPE_STRING_FLAG is set on wrong type code");
13900 error_found
= true;
13903 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13904 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13906 if (TREE_CODE (t
) == METHOD_TYPE
13907 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13909 error ("TYPE_METHOD_BASETYPE is not main variant");
13910 error_found
= true;
13915 debug_tree (const_cast <tree
> (t
));
13916 internal_error ("verify_type failed");
13921 /* Return 1 if ARG interpreted as signed in its precision is known to be
13922 always positive or 2 if ARG is known to be always negative, or 3 if
13923 ARG may be positive or negative. */
13926 get_range_pos_neg (tree arg
)
13928 if (arg
== error_mark_node
)
13931 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13933 if (TREE_CODE (arg
) == INTEGER_CST
)
13935 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
13941 while (CONVERT_EXPR_P (arg
)
13942 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13943 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13945 arg
= TREE_OPERAND (arg
, 0);
13946 /* Narrower value zero extended into wider type
13947 will always result in positive values. */
13948 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13949 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13951 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13956 if (TREE_CODE (arg
) != SSA_NAME
)
13958 wide_int arg_min
, arg_max
;
13959 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13961 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13962 if (is_gimple_assign (g
)
13963 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13965 tree t
= gimple_assign_rhs1 (g
);
13966 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13967 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13969 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13970 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13972 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13981 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13983 /* For unsigned values, the "positive" range comes
13984 below the "negative" range. */
13985 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13987 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13992 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13994 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14003 /* Return true if ARG is marked with the nonnull attribute in the
14004 current function signature. */
14007 nonnull_arg_p (const_tree arg
)
14009 tree t
, attrs
, fntype
;
14010 unsigned HOST_WIDE_INT arg_num
;
14012 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14013 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14014 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14016 /* The static chain decl is always non null. */
14017 if (arg
== cfun
->static_chain_decl
)
14020 /* THIS argument of method is always non-NULL. */
14021 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14022 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14023 && flag_delete_null_pointer_checks
)
14026 /* Values passed by reference are always non-NULL. */
14027 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14028 && flag_delete_null_pointer_checks
)
14031 fntype
= TREE_TYPE (cfun
->decl
);
14032 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14034 attrs
= lookup_attribute ("nonnull", attrs
);
14036 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14037 if (attrs
== NULL_TREE
)
14040 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14041 if (TREE_VALUE (attrs
) == NULL_TREE
)
14044 /* Get the position number for ARG in the function signature. */
14045 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14047 t
= DECL_CHAIN (t
), arg_num
++)
14053 gcc_assert (t
== arg
);
14055 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14056 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14058 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14066 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14070 set_block (location_t loc
, tree block
)
14072 location_t pure_loc
= get_pure_location (loc
);
14073 source_range src_range
= get_range_from_loc (line_table
, loc
);
14074 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14078 set_source_range (tree expr
, location_t start
, location_t finish
)
14080 source_range src_range
;
14081 src_range
.m_start
= start
;
14082 src_range
.m_finish
= finish
;
14083 return set_source_range (expr
, src_range
);
14087 set_source_range (tree expr
, source_range src_range
)
14089 if (!EXPR_P (expr
))
14090 return UNKNOWN_LOCATION
;
14092 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14093 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14097 SET_EXPR_LOCATION (expr
, adhoc
);
14101 /* Return EXPR, potentially wrapped with a node expression LOC,
14102 if !CAN_HAVE_LOCATION_P (expr).
14104 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14105 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14107 Wrapper nodes can be identified using location_wrapper_p. */
14110 maybe_wrap_with_location (tree expr
, location_t loc
)
14114 if (loc
== UNKNOWN_LOCATION
)
14116 if (CAN_HAVE_LOCATION_P (expr
))
14118 /* We should only be adding wrappers for constants and for decls,
14119 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14120 gcc_assert (CONSTANT_CLASS_P (expr
)
14122 || EXCEPTIONAL_CLASS_P (expr
));
14124 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14125 any impact of the wrapper nodes. */
14126 if (EXCEPTIONAL_CLASS_P (expr
))
14129 tree_code code
= (CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
14130 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14131 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14132 /* Mark this node as being a wrapper. */
14133 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14137 /* Return the name of combined function FN, for debugging purposes. */
14140 combined_fn_name (combined_fn fn
)
14142 if (builtin_fn_p (fn
))
14144 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14145 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14148 return internal_fn_name (as_internal_fn (fn
));
14151 /* Return a bitmap with a bit set corresponding to each argument in
14152 a function call type FNTYPE declared with attribute nonnull,
14153 or null if none of the function's argument are nonnull. The caller
14154 must free the bitmap. */
14157 get_nonnull_args (const_tree fntype
)
14159 if (fntype
== NULL_TREE
)
14162 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14166 bitmap argmap
= NULL
;
14168 /* A function declaration can specify multiple attribute nonnull,
14169 each with zero or more arguments. The loop below creates a bitmap
14170 representing a union of all the arguments. An empty (but non-null)
14171 bitmap means that all arguments have been declaraed nonnull. */
14172 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14174 attrs
= lookup_attribute ("nonnull", attrs
);
14179 argmap
= BITMAP_ALLOC (NULL
);
14181 if (!TREE_VALUE (attrs
))
14183 /* Clear the bitmap in case a previous attribute nonnull
14184 set it and this one overrides it for all arguments. */
14185 bitmap_clear (argmap
);
14189 /* Iterate over the indices of the format arguments declared nonnull
14190 and set a bit for each. */
14191 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14193 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14194 bitmap_set_bit (argmap
, val
);
14201 /* Returns true if TYPE is a type where it and all of its subobjects
14202 (recursively) are of structure, union, or array type. */
14205 default_is_empty_type (tree type
)
14207 if (RECORD_OR_UNION_TYPE_P (type
))
14209 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14210 if (TREE_CODE (field
) == FIELD_DECL
14211 && !DECL_PADDING_P (field
)
14212 && !default_is_empty_type (TREE_TYPE (field
)))
14216 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14217 return (integer_minus_onep (array_type_nelts (type
))
14218 || TYPE_DOMAIN (type
) == NULL_TREE
14219 || default_is_empty_type (TREE_TYPE (type
)));
14223 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14224 that shouldn't be passed via stack. */
14227 default_is_empty_record (const_tree type
)
14229 if (!abi_version_at_least (12))
14232 if (type
== error_mark_node
)
14235 if (TREE_ADDRESSABLE (type
))
14238 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14241 /* Like int_size_in_bytes, but handle empty records specially. */
14244 arg_int_size_in_bytes (const_tree type
)
14246 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14249 /* Like size_in_bytes, but handle empty records specially. */
14252 arg_size_in_bytes (const_tree type
)
14254 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14257 /* Return true if an expression with CODE has to have the same result type as
14258 its first operand. */
14261 expr_type_first_operand_type_p (tree_code code
)
14274 case TRUNC_DIV_EXPR
:
14275 case CEIL_DIV_EXPR
:
14276 case FLOOR_DIV_EXPR
:
14277 case ROUND_DIV_EXPR
:
14278 case TRUNC_MOD_EXPR
:
14279 case CEIL_MOD_EXPR
:
14280 case FLOOR_MOD_EXPR
:
14281 case ROUND_MOD_EXPR
:
14283 case EXACT_DIV_EXPR
:
14301 /* List of pointer types used to declare builtins before we have seen their
14304 Keep the size up to date in tree.h ! */
14305 const builtin_structptr_type builtin_structptr_types
[6] =
14307 { fileptr_type_node
, ptr_type_node
, "FILE" },
14308 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14309 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14310 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14311 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14312 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14317 namespace selftest
{
14319 /* Selftests for tree. */
14321 /* Verify that integer constants are sane. */
14324 test_integer_constants ()
14326 ASSERT_TRUE (integer_type_node
!= NULL
);
14327 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14329 tree type
= integer_type_node
;
14331 tree zero
= build_zero_cst (type
);
14332 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14333 ASSERT_EQ (type
, TREE_TYPE (zero
));
14335 tree one
= build_int_cst (type
, 1);
14336 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14337 ASSERT_EQ (type
, TREE_TYPE (zero
));
14340 /* Verify identifiers. */
14343 test_identifiers ()
14345 tree identifier
= get_identifier ("foo");
14346 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14347 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14350 /* Verify LABEL_DECL. */
14355 tree identifier
= get_identifier ("err");
14356 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14357 identifier
, void_type_node
);
14358 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14359 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14362 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14363 are given by VALS. */
14366 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
14368 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
14369 tree_vector_builder
builder (type
, vals
.length (), 1);
14370 builder
.splice (vals
);
14371 return builder
.build ();
14374 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14377 check_vector_cst (vec
<tree
> expected
, tree actual
)
14379 ASSERT_KNOWN_EQ (expected
.length (),
14380 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14381 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14382 ASSERT_EQ (wi::to_wide (expected
[i
]),
14383 wi::to_wide (vector_cst_elt (actual
, i
)));
14386 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14387 and that its elements match EXPECTED. */
14390 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14391 unsigned int npatterns
)
14393 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14394 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14395 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14396 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14397 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14398 check_vector_cst (expected
, actual
);
14401 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14402 and NPATTERNS background elements, and that its elements match
14406 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14407 unsigned int npatterns
)
14409 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14410 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14411 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14412 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14413 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14414 check_vector_cst (expected
, actual
);
14417 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14418 and that its elements match EXPECTED. */
14421 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14422 unsigned int npatterns
)
14424 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14425 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14426 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14427 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14428 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14429 check_vector_cst (expected
, actual
);
14432 /* Test the creation of VECTOR_CSTs. */
14435 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
14437 auto_vec
<tree
, 8> elements (8);
14438 elements
.quick_grow (8);
14439 tree element_type
= build_nonstandard_integer_type (16, true);
14440 tree vector_type
= build_vector_type (element_type
, 8);
14442 /* Test a simple linear series with a base of 0 and a step of 1:
14443 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14444 for (unsigned int i
= 0; i
< 8; ++i
)
14445 elements
[i
] = build_int_cst (element_type
, i
);
14446 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14447 check_vector_cst_stepped (elements
, vector
, 1);
14449 /* Try the same with the first element replaced by 100:
14450 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14451 elements
[0] = build_int_cst (element_type
, 100);
14452 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14453 check_vector_cst_stepped (elements
, vector
, 1);
14455 /* Try a series that wraps around.
14456 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14457 for (unsigned int i
= 1; i
< 8; ++i
)
14458 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14459 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14460 check_vector_cst_stepped (elements
, vector
, 1);
14462 /* Try a downward series:
14463 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14464 for (unsigned int i
= 1; i
< 8; ++i
)
14465 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14466 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14467 check_vector_cst_stepped (elements
, vector
, 1);
14469 /* Try two interleaved series with different bases and steps:
14470 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14471 elements
[1] = build_int_cst (element_type
, 53);
14472 for (unsigned int i
= 2; i
< 8; i
+= 2)
14474 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14475 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14477 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14478 check_vector_cst_stepped (elements
, vector
, 2);
14480 /* Try a duplicated value:
14481 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14482 for (unsigned int i
= 1; i
< 8; ++i
)
14483 elements
[i
] = elements
[0];
14484 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14485 check_vector_cst_duplicate (elements
, vector
, 1);
14487 /* Try an interleaved duplicated value:
14488 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14489 elements
[1] = build_int_cst (element_type
, 55);
14490 for (unsigned int i
= 2; i
< 8; ++i
)
14491 elements
[i
] = elements
[i
- 2];
14492 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14493 check_vector_cst_duplicate (elements
, vector
, 2);
14495 /* Try a duplicated value with 2 exceptions
14496 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14497 elements
[0] = build_int_cst (element_type
, 41);
14498 elements
[1] = build_int_cst (element_type
, 97);
14499 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14500 check_vector_cst_fill (elements
, vector
, 2);
14502 /* Try with and without a step
14503 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14504 for (unsigned int i
= 3; i
< 8; i
+= 2)
14505 elements
[i
] = build_int_cst (element_type
, i
* 7);
14506 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14507 check_vector_cst_stepped (elements
, vector
, 2);
14509 /* Try a fully-general constant:
14510 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14511 elements
[5] = build_int_cst (element_type
, 9990);
14512 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14513 check_vector_cst_fill (elements
, vector
, 4);
14516 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
14517 Helper function for test_location_wrappers, to deal with STRIP_NOPS
14518 modifying its argument in-place. */
14521 check_strip_nops (tree node
, tree expected
)
14524 ASSERT_EQ (expected
, node
);
14527 /* Verify location wrappers. */
14530 test_location_wrappers ()
14532 location_t loc
= BUILTINS_LOCATION
;
14534 /* Wrapping a constant. */
14535 tree int_cst
= build_int_cst (integer_type_node
, 42);
14536 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
14537 ASSERT_FALSE (location_wrapper_p (int_cst
));
14539 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
14540 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
14541 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
14542 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
14544 /* Wrapping a STRING_CST. */
14545 tree string_cst
= build_string (4, "foo");
14546 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
14547 ASSERT_FALSE (location_wrapper_p (string_cst
));
14549 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
14550 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
14551 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
14552 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
14553 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
14556 /* Wrapping a variable. */
14557 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
14558 get_identifier ("some_int_var"),
14559 integer_type_node
);
14560 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
14561 ASSERT_FALSE (location_wrapper_p (int_var
));
14563 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
14564 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
14565 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
14566 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
14568 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
14570 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
14571 ASSERT_FALSE (location_wrapper_p (r_cast
));
14572 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
14574 /* Verify that STRIP_NOPS removes wrappers. */
14575 check_strip_nops (wrapped_int_cst
, int_cst
);
14576 check_strip_nops (wrapped_string_cst
, string_cst
);
14577 check_strip_nops (wrapped_int_var
, int_var
);
14580 /* Run all of the selftests within this file. */
14585 test_integer_constants ();
14586 test_identifiers ();
14588 test_vector_cst_patterns ();
14589 test_location_wrappers ();
14592 } // namespace selftest
14594 #endif /* CHECKING_P */
14596 #include "gt-tree.h"