1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2017 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 int tree_code_counts
[MAX_TREE_CODES
];
133 int tree_node_counts
[(int) all_kinds
];
134 int 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
])
1337 size_t length
= sizeof (struct tree_poly_int_cst
);
1338 record_node_allocation_statistics (POLY_INT_CST
, length
);
1340 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1342 TREE_SET_CODE (t
, POLY_INT_CST
);
1343 TREE_CONSTANT (t
) = 1;
1344 TREE_TYPE (t
) = type
;
1345 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1346 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1350 /* Create a constant tree that contains CST sign-extended to TYPE. */
1353 build_int_cst (tree type
, poly_int64 cst
)
1355 /* Support legacy code. */
1357 type
= integer_type_node
;
1359 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1362 /* Create a constant tree that contains CST zero-extended to TYPE. */
1365 build_int_cstu (tree type
, poly_uint64 cst
)
1367 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1370 /* Create a constant tree that contains CST sign-extended to TYPE. */
1373 build_int_cst_type (tree type
, poly_int64 cst
)
1376 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1379 /* Constructs tree in type TYPE from with value given by CST. Signedness
1380 of CST is assumed to be the same as the signedness of TYPE. */
1383 double_int_to_tree (tree type
, double_int cst
)
1385 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1388 /* We force the wide_int CST to the range of the type TYPE by sign or
1389 zero extending it. OVERFLOWABLE indicates if we are interested in
1390 overflow of the value, when >0 we are only interested in signed
1391 overflow, for <0 we are interested in any overflow. OVERFLOWED
1392 indicates whether overflow has already occurred. CONST_OVERFLOWED
1393 indicates whether constant overflow has already occurred. We force
1394 T's value to be within range of T's type (by setting to 0 or 1 all
1395 the bits outside the type's range). We set TREE_OVERFLOWED if,
1396 OVERFLOWED is nonzero,
1397 or OVERFLOWABLE is >0 and signed overflow occurs
1398 or OVERFLOWABLE is <0 and any overflow occurs
1399 We return a new tree node for the extended wide_int. The node
1400 is shared if no overflow flags are set. */
1404 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1405 int overflowable
, bool overflowed
)
1407 signop sign
= TYPE_SIGN (type
);
1409 /* If we need to set overflow flags, return a new unshared node. */
1410 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1414 || (overflowable
> 0 && sign
== SIGNED
))
1416 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1419 if (tmp
.is_constant ())
1420 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1423 tree coeffs
[NUM_POLY_INT_COEFFS
];
1424 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1426 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1427 TREE_OVERFLOW (coeffs
[i
]) = 1;
1429 t
= build_new_poly_int_cst (type
, coeffs
);
1431 TREE_OVERFLOW (t
) = 1;
1436 /* Else build a shared node. */
1437 return wide_int_to_tree (type
, cst
);
1440 /* These are the hash table functions for the hash table of INTEGER_CST
1441 nodes of a sizetype. */
1443 /* Return the hash code X, an INTEGER_CST. */
1446 int_cst_hasher::hash (tree x
)
1448 const_tree
const t
= x
;
1449 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1452 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1453 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1458 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1459 is the same as that given by *Y, which is the same. */
1462 int_cst_hasher::equal (tree x
, tree y
)
1464 const_tree
const xt
= x
;
1465 const_tree
const yt
= y
;
1467 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1468 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1469 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1472 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1473 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1479 /* Create an INT_CST node of TYPE and value CST.
1480 The returned node is always shared. For small integers we use a
1481 per-type vector cache, for larger ones we use a single hash table.
1482 The value is extended from its precision according to the sign of
1483 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1484 the upper bits and ensures that hashing and value equality based
1485 upon the underlying HOST_WIDE_INTs works without masking. */
1488 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1495 unsigned int prec
= TYPE_PRECISION (type
);
1496 signop sgn
= TYPE_SIGN (type
);
1498 /* Verify that everything is canonical. */
1499 int l
= pcst
.get_len ();
1502 if (pcst
.elt (l
- 1) == 0)
1503 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1504 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1505 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1508 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1509 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1513 /* We just need to store a single HOST_WIDE_INT. */
1515 if (TYPE_UNSIGNED (type
))
1516 hwi
= cst
.to_uhwi ();
1518 hwi
= cst
.to_shwi ();
1520 switch (TREE_CODE (type
))
1523 gcc_assert (hwi
== 0);
1527 case REFERENCE_TYPE
:
1528 case POINTER_BOUNDS_TYPE
:
1529 /* Cache NULL pointer and zero bounds. */
1538 /* Cache false or true. */
1540 if (IN_RANGE (hwi
, 0, 1))
1546 if (TYPE_SIGN (type
) == UNSIGNED
)
1549 limit
= INTEGER_SHARE_LIMIT
;
1550 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1555 /* Cache [-1, N). */
1556 limit
= INTEGER_SHARE_LIMIT
+ 1;
1557 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1571 /* Look for it in the type's vector of small shared ints. */
1572 if (!TYPE_CACHED_VALUES_P (type
))
1574 TYPE_CACHED_VALUES_P (type
) = 1;
1575 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1578 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1580 /* Make sure no one is clobbering the shared constant. */
1581 gcc_checking_assert (TREE_TYPE (t
) == type
1582 && TREE_INT_CST_NUNITS (t
) == 1
1583 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1584 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1585 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1588 /* Create a new shared int. */
1589 t
= build_new_int_cst (type
, cst
);
1590 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1595 /* Use the cache of larger shared ints, using int_cst_node as
1598 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1599 TREE_TYPE (int_cst_node
) = type
;
1601 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1605 /* Insert this one into the hash table. */
1608 /* Make a new node for next time round. */
1609 int_cst_node
= make_int_cst (1, 1);
1615 /* The value either hashes properly or we drop it on the floor
1616 for the gc to take care of. There will not be enough of them
1619 tree nt
= build_new_int_cst (type
, cst
);
1620 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1624 /* Insert this one into the hash table. */
1636 poly_int_cst_hasher::hash (tree t
)
1638 inchash::hash hstate
;
1640 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1641 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1642 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1644 return hstate
.end ();
1648 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1650 if (TREE_TYPE (x
) != y
.first
)
1652 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1653 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1658 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1659 The elements must also have type TYPE. */
1662 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1664 unsigned int prec
= TYPE_PRECISION (type
);
1665 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1666 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1669 h
.add_int (TYPE_UID (type
));
1670 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1671 h
.add_wide_int (c
.coeffs
[i
]);
1672 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1673 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1675 if (*slot
== NULL_TREE
)
1677 tree coeffs
[NUM_POLY_INT_COEFFS
];
1678 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1679 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1680 *slot
= build_new_poly_int_cst (type
, coeffs
);
1685 /* Create a constant tree with value VALUE in type TYPE. */
1688 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1690 if (value
.is_constant ())
1691 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1692 return build_poly_int_cst (type
, value
);
1696 cache_integer_cst (tree t
)
1698 tree type
= TREE_TYPE (t
);
1701 int prec
= TYPE_PRECISION (type
);
1703 gcc_assert (!TREE_OVERFLOW (t
));
1705 switch (TREE_CODE (type
))
1708 gcc_assert (integer_zerop (t
));
1712 case REFERENCE_TYPE
:
1713 /* Cache NULL pointer. */
1714 if (integer_zerop (t
))
1722 /* Cache false or true. */
1724 if (wi::ltu_p (wi::to_wide (t
), 2))
1725 ix
= TREE_INT_CST_ELT (t
, 0);
1730 if (TYPE_UNSIGNED (type
))
1733 limit
= INTEGER_SHARE_LIMIT
;
1735 /* This is a little hokie, but if the prec is smaller than
1736 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1737 obvious test will not get the correct answer. */
1738 if (prec
< HOST_BITS_PER_WIDE_INT
)
1740 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1741 ix
= tree_to_uhwi (t
);
1743 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1744 ix
= tree_to_uhwi (t
);
1749 limit
= INTEGER_SHARE_LIMIT
+ 1;
1751 if (integer_minus_onep (t
))
1753 else if (!wi::neg_p (wi::to_wide (t
)))
1755 if (prec
< HOST_BITS_PER_WIDE_INT
)
1757 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1758 ix
= tree_to_shwi (t
) + 1;
1760 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1761 ix
= tree_to_shwi (t
) + 1;
1775 /* Look for it in the type's vector of small shared ints. */
1776 if (!TYPE_CACHED_VALUES_P (type
))
1778 TYPE_CACHED_VALUES_P (type
) = 1;
1779 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1782 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1783 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1787 /* Use the cache of larger shared ints. */
1788 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1789 /* If there is already an entry for the number verify it's the
1792 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1794 /* Otherwise insert this one into the hash table. */
1800 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1801 and the rest are zeros. */
1804 build_low_bits_mask (tree type
, unsigned bits
)
1806 gcc_assert (bits
<= TYPE_PRECISION (type
));
1808 return wide_int_to_tree (type
, wi::mask (bits
, false,
1809 TYPE_PRECISION (type
)));
1812 /* Checks that X is integer constant that can be expressed in (unsigned)
1813 HOST_WIDE_INT without loss of precision. */
1816 cst_and_fits_in_hwi (const_tree x
)
1818 return (TREE_CODE (x
) == INTEGER_CST
1819 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1822 /* Build a newly constructed VECTOR_CST with the given values of
1823 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1826 make_vector (unsigned log2_npatterns
,
1827 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1829 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1831 unsigned npatterns
= 1 << log2_npatterns
;
1832 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1833 unsigned length
= (sizeof (struct tree_vector
)
1834 + (encoded_nelts
- 1) * sizeof (tree
));
1836 record_node_allocation_statistics (VECTOR_CST
, length
);
1838 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1840 TREE_SET_CODE (t
, VECTOR_CST
);
1841 TREE_CONSTANT (t
) = 1;
1842 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1843 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1848 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1849 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1852 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1854 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1855 unsigned HOST_WIDE_INT idx
;
1858 tree_vector_builder
vec (type
, nelts
, 1);
1859 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1861 if (TREE_CODE (value
) == VECTOR_CST
)
1862 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1863 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1865 vec
.quick_push (value
);
1867 while (vec
.length () < nelts
)
1868 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1870 return vec
.build ();
1873 /* Build a vector of type VECTYPE where all the elements are SCs. */
1875 build_vector_from_val (tree vectype
, tree sc
)
1877 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1879 if (sc
== error_mark_node
)
1882 /* Verify that the vector type is suitable for SC. Note that there
1883 is some inconsistency in the type-system with respect to restrict
1884 qualifications of pointers. Vector types always have a main-variant
1885 element type and the qualification is applied to the vector-type.
1886 So TREE_TYPE (vector-type) does not return a properly qualified
1887 vector element-type. */
1888 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1889 TREE_TYPE (vectype
)));
1891 if (CONSTANT_CLASS_P (sc
))
1893 tree_vector_builder
v (vectype
, 1, 1);
1898 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1901 vec
<constructor_elt
, va_gc
> *v
;
1902 vec_alloc (v
, nunits
);
1903 for (i
= 0; i
< nunits
; ++i
)
1904 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1905 return build_constructor (vectype
, v
);
1909 /* Build a vector series of type TYPE in which element I has the value
1910 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1911 and a VEC_SERIES_EXPR otherwise. */
1914 build_vec_series (tree type
, tree base
, tree step
)
1916 if (integer_zerop (step
))
1917 return build_vector_from_val (type
, base
);
1918 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1920 tree_vector_builder
builder (type
, 1, 3);
1921 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1922 wi::to_wide (base
) + wi::to_wide (step
));
1923 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1924 wi::to_wide (elt1
) + wi::to_wide (step
));
1925 builder
.quick_push (base
);
1926 builder
.quick_push (elt1
);
1927 builder
.quick_push (elt2
);
1928 return builder
.build ();
1930 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1933 /* Return a vector with the same number of units and number of bits
1934 as VEC_TYPE, but in which the elements are a linear series of unsigned
1935 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1938 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1940 tree index_vec_type
= vec_type
;
1941 tree index_elt_type
= TREE_TYPE (vec_type
);
1942 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1943 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1945 index_elt_type
= build_nonstandard_integer_type
1946 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1947 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1950 tree_vector_builder
v (index_vec_type
, 1, 3);
1951 for (unsigned int i
= 0; i
< 3; ++i
)
1952 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1956 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1957 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1960 recompute_constructor_flags (tree c
)
1964 bool constant_p
= true;
1965 bool side_effects_p
= false;
1966 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1968 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1970 /* Mostly ctors will have elts that don't have side-effects, so
1971 the usual case is to scan all the elements. Hence a single
1972 loop for both const and side effects, rather than one loop
1973 each (with early outs). */
1974 if (!TREE_CONSTANT (val
))
1976 if (TREE_SIDE_EFFECTS (val
))
1977 side_effects_p
= true;
1980 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1981 TREE_CONSTANT (c
) = constant_p
;
1984 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1988 verify_constructor_flags (tree c
)
1992 bool constant_p
= TREE_CONSTANT (c
);
1993 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1994 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1996 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1998 if (constant_p
&& !TREE_CONSTANT (val
))
1999 internal_error ("non-constant element in constant CONSTRUCTOR");
2000 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2001 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2005 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2006 are in the vec pointed to by VALS. */
2008 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
2010 tree c
= make_node (CONSTRUCTOR
);
2012 TREE_TYPE (c
) = type
;
2013 CONSTRUCTOR_ELTS (c
) = vals
;
2015 recompute_constructor_flags (c
);
2020 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2023 build_constructor_single (tree type
, tree index
, tree value
)
2025 vec
<constructor_elt
, va_gc
> *v
;
2026 constructor_elt elt
= {index
, value
};
2029 v
->quick_push (elt
);
2031 return build_constructor (type
, v
);
2035 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2036 are in a list pointed to by VALS. */
2038 build_constructor_from_list (tree type
, tree vals
)
2041 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2045 vec_alloc (v
, list_length (vals
));
2046 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2047 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2050 return build_constructor (type
, v
);
2053 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2054 of elements, provided as index/value pairs. */
2057 build_constructor_va (tree type
, int nelts
, ...)
2059 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2062 va_start (p
, nelts
);
2063 vec_alloc (v
, nelts
);
2066 tree index
= va_arg (p
, tree
);
2067 tree value
= va_arg (p
, tree
);
2068 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2071 return build_constructor (type
, v
);
2074 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2077 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2080 FIXED_VALUE_TYPE
*fp
;
2082 v
= make_node (FIXED_CST
);
2083 fp
= ggc_alloc
<fixed_value
> ();
2084 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2086 TREE_TYPE (v
) = type
;
2087 TREE_FIXED_CST_PTR (v
) = fp
;
2091 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2094 build_real (tree type
, REAL_VALUE_TYPE d
)
2097 REAL_VALUE_TYPE
*dp
;
2100 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2101 Consider doing it via real_convert now. */
2103 v
= make_node (REAL_CST
);
2104 dp
= ggc_alloc
<real_value
> ();
2105 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2107 TREE_TYPE (v
) = type
;
2108 TREE_REAL_CST_PTR (v
) = dp
;
2109 TREE_OVERFLOW (v
) = overflow
;
2113 /* Like build_real, but first truncate D to the type. */
2116 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2118 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2121 /* Return a new REAL_CST node whose type is TYPE
2122 and whose value is the integer value of the INTEGER_CST node I. */
2125 real_value_from_int_cst (const_tree type
, const_tree i
)
2129 /* Clear all bits of the real value type so that we can later do
2130 bitwise comparisons to see if two values are the same. */
2131 memset (&d
, 0, sizeof d
);
2133 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2134 TYPE_SIGN (TREE_TYPE (i
)));
2138 /* Given a tree representing an integer constant I, return a tree
2139 representing the same value as a floating-point constant of type TYPE. */
2142 build_real_from_int_cst (tree type
, const_tree i
)
2145 int overflow
= TREE_OVERFLOW (i
);
2147 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2149 TREE_OVERFLOW (v
) |= overflow
;
2153 /* Return a newly constructed STRING_CST node whose value is
2154 the LEN characters at STR.
2155 Note that for a C string literal, LEN should include the trailing NUL.
2156 The TREE_TYPE is not initialized. */
2159 build_string (int len
, const char *str
)
2164 /* Do not waste bytes provided by padding of struct tree_string. */
2165 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2167 record_node_allocation_statistics (STRING_CST
, length
);
2169 s
= (tree
) ggc_internal_alloc (length
);
2171 memset (s
, 0, sizeof (struct tree_typed
));
2172 TREE_SET_CODE (s
, STRING_CST
);
2173 TREE_CONSTANT (s
) = 1;
2174 TREE_STRING_LENGTH (s
) = len
;
2175 memcpy (s
->string
.str
, str
, len
);
2176 s
->string
.str
[len
] = '\0';
2181 /* Return a newly constructed COMPLEX_CST node whose value is
2182 specified by the real and imaginary parts REAL and IMAG.
2183 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2184 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2187 build_complex (tree type
, tree real
, tree imag
)
2189 tree t
= make_node (COMPLEX_CST
);
2191 TREE_REALPART (t
) = real
;
2192 TREE_IMAGPART (t
) = imag
;
2193 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2194 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2198 /* Build a complex (inf +- 0i), such as for the result of cproj.
2199 TYPE is the complex tree type of the result. If NEG is true, the
2200 imaginary zero is negative. */
2203 build_complex_inf (tree type
, bool neg
)
2205 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2209 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2210 build_real (TREE_TYPE (type
), rzero
));
2213 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2214 element is set to 1. In particular, this is 1 + i for complex types. */
2217 build_each_one_cst (tree type
)
2219 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2221 tree scalar
= build_one_cst (TREE_TYPE (type
));
2222 return build_complex (type
, scalar
, scalar
);
2225 return build_one_cst (type
);
2228 /* Return a constant of arithmetic type TYPE which is the
2229 multiplicative identity of the set TYPE. */
2232 build_one_cst (tree type
)
2234 switch (TREE_CODE (type
))
2236 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2237 case POINTER_TYPE
: case REFERENCE_TYPE
:
2239 return build_int_cst (type
, 1);
2242 return build_real (type
, dconst1
);
2244 case FIXED_POINT_TYPE
:
2245 /* We can only generate 1 for accum types. */
2246 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2247 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2251 tree scalar
= build_one_cst (TREE_TYPE (type
));
2253 return build_vector_from_val (type
, scalar
);
2257 return build_complex (type
,
2258 build_one_cst (TREE_TYPE (type
)),
2259 build_zero_cst (TREE_TYPE (type
)));
2266 /* Return an integer of type TYPE containing all 1's in as much precision as
2267 it contains, or a complex or vector whose subparts are such integers. */
2270 build_all_ones_cst (tree type
)
2272 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2274 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2275 return build_complex (type
, scalar
, scalar
);
2278 return build_minus_one_cst (type
);
2281 /* Return a constant of arithmetic type TYPE which is the
2282 opposite of the multiplicative identity of the set TYPE. */
2285 build_minus_one_cst (tree type
)
2287 switch (TREE_CODE (type
))
2289 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2290 case POINTER_TYPE
: case REFERENCE_TYPE
:
2292 return build_int_cst (type
, -1);
2295 return build_real (type
, dconstm1
);
2297 case FIXED_POINT_TYPE
:
2298 /* We can only generate 1 for accum types. */
2299 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2300 return build_fixed (type
,
2301 fixed_from_double_int (double_int_minus_one
,
2302 SCALAR_TYPE_MODE (type
)));
2306 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2308 return build_vector_from_val (type
, scalar
);
2312 return build_complex (type
,
2313 build_minus_one_cst (TREE_TYPE (type
)),
2314 build_zero_cst (TREE_TYPE (type
)));
2321 /* Build 0 constant of type TYPE. This is used by constructor folding
2322 and thus the constant should be represented in memory by
2326 build_zero_cst (tree type
)
2328 switch (TREE_CODE (type
))
2330 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2331 case POINTER_TYPE
: case REFERENCE_TYPE
:
2332 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2333 return build_int_cst (type
, 0);
2336 return build_real (type
, dconst0
);
2338 case FIXED_POINT_TYPE
:
2339 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2343 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2345 return build_vector_from_val (type
, scalar
);
2350 tree zero
= build_zero_cst (TREE_TYPE (type
));
2352 return build_complex (type
, zero
, zero
);
2356 if (!AGGREGATE_TYPE_P (type
))
2357 return fold_convert (type
, integer_zero_node
);
2358 return build_constructor (type
, NULL
);
2363 /* Build a BINFO with LEN language slots. */
2366 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2369 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2370 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2372 record_node_allocation_statistics (TREE_BINFO
, length
);
2374 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2376 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2378 TREE_SET_CODE (t
, TREE_BINFO
);
2380 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2385 /* Create a CASE_LABEL_EXPR tree node and return it. */
2388 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2390 tree t
= make_node (CASE_LABEL_EXPR
);
2392 TREE_TYPE (t
) = void_type_node
;
2393 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2395 CASE_LOW (t
) = low_value
;
2396 CASE_HIGH (t
) = high_value
;
2397 CASE_LABEL (t
) = label_decl
;
2398 CASE_CHAIN (t
) = NULL_TREE
;
2403 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2404 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2405 The latter determines the length of the HOST_WIDE_INT vector. */
2408 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2411 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2412 + sizeof (struct tree_int_cst
));
2415 record_node_allocation_statistics (INTEGER_CST
, length
);
2417 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2419 TREE_SET_CODE (t
, INTEGER_CST
);
2420 TREE_INT_CST_NUNITS (t
) = len
;
2421 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2422 /* to_offset can only be applied to trees that are offset_int-sized
2423 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2424 must be exactly the precision of offset_int and so LEN is correct. */
2425 if (ext_len
<= OFFSET_INT_ELTS
)
2426 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2428 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2430 TREE_CONSTANT (t
) = 1;
2435 /* Build a newly constructed TREE_VEC node of length LEN. */
2438 make_tree_vec (int len MEM_STAT_DECL
)
2441 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2443 record_node_allocation_statistics (TREE_VEC
, length
);
2445 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2447 TREE_SET_CODE (t
, TREE_VEC
);
2448 TREE_VEC_LENGTH (t
) = len
;
2453 /* Grow a TREE_VEC node to new length LEN. */
2456 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2458 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2460 int oldlen
= TREE_VEC_LENGTH (v
);
2461 gcc_assert (len
> oldlen
);
2463 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2464 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2466 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2468 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2470 TREE_VEC_LENGTH (v
) = len
;
2475 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2476 fixed, and scalar, complex or vector. */
2479 zerop (const_tree expr
)
2481 return (integer_zerop (expr
)
2482 || real_zerop (expr
)
2483 || fixed_zerop (expr
));
2486 /* Return 1 if EXPR is the integer constant zero or a complex constant
2490 integer_zerop (const_tree expr
)
2492 switch (TREE_CODE (expr
))
2495 return wi::to_wide (expr
) == 0;
2497 return (integer_zerop (TREE_REALPART (expr
))
2498 && integer_zerop (TREE_IMAGPART (expr
)));
2500 return (VECTOR_CST_NPATTERNS (expr
) == 1
2501 && VECTOR_CST_DUPLICATE_P (expr
)
2502 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2508 /* Return 1 if EXPR is the integer constant one or the corresponding
2509 complex constant. */
2512 integer_onep (const_tree expr
)
2514 switch (TREE_CODE (expr
))
2517 return wi::eq_p (wi::to_widest (expr
), 1);
2519 return (integer_onep (TREE_REALPART (expr
))
2520 && integer_zerop (TREE_IMAGPART (expr
)));
2522 return (VECTOR_CST_NPATTERNS (expr
) == 1
2523 && VECTOR_CST_DUPLICATE_P (expr
)
2524 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2530 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2531 return 1 if every piece is the integer constant one. */
2534 integer_each_onep (const_tree expr
)
2536 if (TREE_CODE (expr
) == COMPLEX_CST
)
2537 return (integer_onep (TREE_REALPART (expr
))
2538 && integer_onep (TREE_IMAGPART (expr
)));
2540 return integer_onep (expr
);
2543 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2544 it contains, or a complex or vector whose subparts are such integers. */
2547 integer_all_onesp (const_tree expr
)
2549 if (TREE_CODE (expr
) == COMPLEX_CST
2550 && integer_all_onesp (TREE_REALPART (expr
))
2551 && integer_all_onesp (TREE_IMAGPART (expr
)))
2554 else if (TREE_CODE (expr
) == VECTOR_CST
)
2555 return (VECTOR_CST_NPATTERNS (expr
) == 1
2556 && VECTOR_CST_DUPLICATE_P (expr
)
2557 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2559 else if (TREE_CODE (expr
) != INTEGER_CST
)
2562 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2563 == wi::to_wide (expr
));
2566 /* Return 1 if EXPR is the integer constant minus one. */
2569 integer_minus_onep (const_tree expr
)
2571 if (TREE_CODE (expr
) == COMPLEX_CST
)
2572 return (integer_all_onesp (TREE_REALPART (expr
))
2573 && integer_zerop (TREE_IMAGPART (expr
)));
2575 return integer_all_onesp (expr
);
2578 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2582 integer_pow2p (const_tree expr
)
2584 if (TREE_CODE (expr
) == COMPLEX_CST
2585 && integer_pow2p (TREE_REALPART (expr
))
2586 && integer_zerop (TREE_IMAGPART (expr
)))
2589 if (TREE_CODE (expr
) != INTEGER_CST
)
2592 return wi::popcount (wi::to_wide (expr
)) == 1;
2595 /* Return 1 if EXPR is an integer constant other than zero or a
2596 complex constant other than zero. */
2599 integer_nonzerop (const_tree expr
)
2601 return ((TREE_CODE (expr
) == INTEGER_CST
2602 && wi::to_wide (expr
) != 0)
2603 || (TREE_CODE (expr
) == COMPLEX_CST
2604 && (integer_nonzerop (TREE_REALPART (expr
))
2605 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2608 /* Return 1 if EXPR is the integer constant one. For vector,
2609 return 1 if every piece is the integer constant minus one
2610 (representing the value TRUE). */
2613 integer_truep (const_tree expr
)
2615 if (TREE_CODE (expr
) == VECTOR_CST
)
2616 return integer_all_onesp (expr
);
2617 return integer_onep (expr
);
2620 /* Return 1 if EXPR is the fixed-point constant zero. */
2623 fixed_zerop (const_tree expr
)
2625 return (TREE_CODE (expr
) == FIXED_CST
2626 && TREE_FIXED_CST (expr
).data
.is_zero ());
2629 /* Return the power of two represented by a tree node known to be a
2633 tree_log2 (const_tree expr
)
2635 if (TREE_CODE (expr
) == COMPLEX_CST
)
2636 return tree_log2 (TREE_REALPART (expr
));
2638 return wi::exact_log2 (wi::to_wide (expr
));
2641 /* Similar, but return the largest integer Y such that 2 ** Y is less
2642 than or equal to EXPR. */
2645 tree_floor_log2 (const_tree expr
)
2647 if (TREE_CODE (expr
) == COMPLEX_CST
)
2648 return tree_log2 (TREE_REALPART (expr
));
2650 return wi::floor_log2 (wi::to_wide (expr
));
2653 /* Return number of known trailing zero bits in EXPR, or, if the value of
2654 EXPR is known to be zero, the precision of it's type. */
2657 tree_ctz (const_tree expr
)
2659 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2660 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2663 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2664 switch (TREE_CODE (expr
))
2667 ret1
= wi::ctz (wi::to_wide (expr
));
2668 return MIN (ret1
, prec
);
2670 ret1
= wi::ctz (get_nonzero_bits (expr
));
2671 return MIN (ret1
, prec
);
2678 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2681 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2682 return MIN (ret1
, ret2
);
2683 case POINTER_PLUS_EXPR
:
2684 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2685 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2686 /* Second operand is sizetype, which could be in theory
2687 wider than pointer's precision. Make sure we never
2688 return more than prec. */
2689 ret2
= MIN (ret2
, prec
);
2690 return MIN (ret1
, ret2
);
2692 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2693 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2694 return MAX (ret1
, ret2
);
2696 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2697 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2698 return MIN (ret1
+ ret2
, prec
);
2700 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2701 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2702 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2704 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2705 return MIN (ret1
+ ret2
, prec
);
2709 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2710 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2712 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2713 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2718 case TRUNC_DIV_EXPR
:
2720 case FLOOR_DIV_EXPR
:
2721 case ROUND_DIV_EXPR
:
2722 case EXACT_DIV_EXPR
:
2723 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2724 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2726 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2729 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2737 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2738 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2740 return MIN (ret1
, prec
);
2742 return tree_ctz (TREE_OPERAND (expr
, 0));
2744 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2747 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2748 return MIN (ret1
, ret2
);
2750 return tree_ctz (TREE_OPERAND (expr
, 1));
2752 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2753 if (ret1
> BITS_PER_UNIT
)
2755 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2756 return MIN (ret1
, prec
);
2764 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2765 decimal float constants, so don't return 1 for them. */
2768 real_zerop (const_tree expr
)
2770 switch (TREE_CODE (expr
))
2773 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2774 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2776 return real_zerop (TREE_REALPART (expr
))
2777 && real_zerop (TREE_IMAGPART (expr
));
2780 /* Don't simply check for a duplicate because the predicate
2781 accepts both +0.0 and -0.0. */
2782 unsigned count
= vector_cst_encoded_nelts (expr
);
2783 for (unsigned int i
= 0; i
< count
; ++i
)
2784 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2793 /* Return 1 if EXPR is the real constant one in real or complex form.
2794 Trailing zeroes matter for decimal float constants, so don't return
2798 real_onep (const_tree expr
)
2800 switch (TREE_CODE (expr
))
2803 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2804 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2806 return real_onep (TREE_REALPART (expr
))
2807 && real_zerop (TREE_IMAGPART (expr
));
2809 return (VECTOR_CST_NPATTERNS (expr
) == 1
2810 && VECTOR_CST_DUPLICATE_P (expr
)
2811 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2817 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2818 matter for decimal float constants, so don't return 1 for them. */
2821 real_minus_onep (const_tree expr
)
2823 switch (TREE_CODE (expr
))
2826 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2827 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2829 return real_minus_onep (TREE_REALPART (expr
))
2830 && real_zerop (TREE_IMAGPART (expr
));
2832 return (VECTOR_CST_NPATTERNS (expr
) == 1
2833 && VECTOR_CST_DUPLICATE_P (expr
)
2834 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2840 /* Nonzero if EXP is a constant or a cast of a constant. */
2843 really_constant_p (const_tree exp
)
2845 /* This is not quite the same as STRIP_NOPS. It does more. */
2846 while (CONVERT_EXPR_P (exp
)
2847 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2848 exp
= TREE_OPERAND (exp
, 0);
2849 return TREE_CONSTANT (exp
);
2852 /* Return true if T holds a polynomial pointer difference, storing it in
2853 *VALUE if so. A true return means that T's precision is no greater
2854 than 64 bits, which is the largest address space we support, so *VALUE
2855 never loses precision. However, the signedness of the result does
2856 not necessarily match the signedness of T: sometimes an unsigned type
2857 like sizetype is used to encode a value that is actually negative. */
2860 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2864 if (TREE_CODE (t
) == INTEGER_CST
)
2866 if (!cst_and_fits_in_hwi (t
))
2868 *value
= int_cst_value (t
);
2871 if (POLY_INT_CST_P (t
))
2873 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2874 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2876 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2877 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2884 tree_to_poly_int64 (const_tree t
)
2886 gcc_assert (tree_fits_poly_int64_p (t
));
2887 if (POLY_INT_CST_P (t
))
2888 return poly_int_cst_value (t
).force_shwi ();
2889 return TREE_INT_CST_LOW (t
);
2893 tree_to_poly_uint64 (const_tree t
)
2895 gcc_assert (tree_fits_poly_uint64_p (t
));
2896 if (POLY_INT_CST_P (t
))
2897 return poly_int_cst_value (t
).force_uhwi ();
2898 return TREE_INT_CST_LOW (t
);
2901 /* Return first list element whose TREE_VALUE is ELEM.
2902 Return 0 if ELEM is not in LIST. */
2905 value_member (tree elem
, tree list
)
2909 if (elem
== TREE_VALUE (list
))
2911 list
= TREE_CHAIN (list
);
2916 /* Return first list element whose TREE_PURPOSE is ELEM.
2917 Return 0 if ELEM is not in LIST. */
2920 purpose_member (const_tree elem
, tree list
)
2924 if (elem
== TREE_PURPOSE (list
))
2926 list
= TREE_CHAIN (list
);
2931 /* Return true if ELEM is in V. */
2934 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2938 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2944 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2948 chain_index (int idx
, tree chain
)
2950 for (; chain
&& idx
> 0; --idx
)
2951 chain
= TREE_CHAIN (chain
);
2955 /* Return nonzero if ELEM is part of the chain CHAIN. */
2958 chain_member (const_tree elem
, const_tree chain
)
2964 chain
= DECL_CHAIN (chain
);
2970 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2971 We expect a null pointer to mark the end of the chain.
2972 This is the Lisp primitive `length'. */
2975 list_length (const_tree t
)
2978 #ifdef ENABLE_TREE_CHECKING
2986 #ifdef ENABLE_TREE_CHECKING
2989 gcc_assert (p
!= q
);
2997 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2998 UNION_TYPE TYPE, or NULL_TREE if none. */
3001 first_field (const_tree type
)
3003 tree t
= TYPE_FIELDS (type
);
3004 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3009 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3010 by modifying the last node in chain 1 to point to chain 2.
3011 This is the Lisp primitive `nconc'. */
3014 chainon (tree op1
, tree op2
)
3023 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3025 TREE_CHAIN (t1
) = op2
;
3027 #ifdef ENABLE_TREE_CHECKING
3030 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3031 gcc_assert (t2
!= t1
);
3038 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3041 tree_last (tree chain
)
3045 while ((next
= TREE_CHAIN (chain
)))
3050 /* Reverse the order of elements in the chain T,
3051 and return the new head of the chain (old last element). */
3056 tree prev
= 0, decl
, next
;
3057 for (decl
= t
; decl
; decl
= next
)
3059 /* We shouldn't be using this function to reverse BLOCK chains; we
3060 have blocks_nreverse for that. */
3061 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3062 next
= TREE_CHAIN (decl
);
3063 TREE_CHAIN (decl
) = prev
;
3069 /* Return a newly created TREE_LIST node whose
3070 purpose and value fields are PARM and VALUE. */
3073 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3075 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3076 TREE_PURPOSE (t
) = parm
;
3077 TREE_VALUE (t
) = value
;
3081 /* Build a chain of TREE_LIST nodes from a vector. */
3084 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3086 tree ret
= NULL_TREE
;
3090 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3092 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3093 pp
= &TREE_CHAIN (*pp
);
3098 /* Return a newly created TREE_LIST node whose
3099 purpose and value fields are PURPOSE and VALUE
3100 and whose TREE_CHAIN is CHAIN. */
3103 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3107 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3108 memset (node
, 0, sizeof (struct tree_common
));
3110 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3112 TREE_SET_CODE (node
, TREE_LIST
);
3113 TREE_CHAIN (node
) = chain
;
3114 TREE_PURPOSE (node
) = purpose
;
3115 TREE_VALUE (node
) = value
;
3119 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3123 ctor_to_vec (tree ctor
)
3125 vec
<tree
, va_gc
> *vec
;
3126 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3130 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3131 vec
->quick_push (val
);
3136 /* Return the size nominally occupied by an object of type TYPE
3137 when it resides in memory. The value is measured in units of bytes,
3138 and its data type is that normally used for type sizes
3139 (which is the first type created by make_signed_type or
3140 make_unsigned_type). */
3143 size_in_bytes_loc (location_t loc
, const_tree type
)
3147 if (type
== error_mark_node
)
3148 return integer_zero_node
;
3150 type
= TYPE_MAIN_VARIANT (type
);
3151 t
= TYPE_SIZE_UNIT (type
);
3155 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3156 return size_zero_node
;
3162 /* Return the size of TYPE (in bytes) as a wide integer
3163 or return -1 if the size can vary or is larger than an integer. */
3166 int_size_in_bytes (const_tree type
)
3170 if (type
== error_mark_node
)
3173 type
= TYPE_MAIN_VARIANT (type
);
3174 t
= TYPE_SIZE_UNIT (type
);
3176 if (t
&& tree_fits_uhwi_p (t
))
3177 return TREE_INT_CST_LOW (t
);
3182 /* Return the maximum size of TYPE (in bytes) as a wide integer
3183 or return -1 if the size can vary or is larger than an integer. */
3186 max_int_size_in_bytes (const_tree type
)
3188 HOST_WIDE_INT size
= -1;
3191 /* If this is an array type, check for a possible MAX_SIZE attached. */
3193 if (TREE_CODE (type
) == ARRAY_TYPE
)
3195 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3197 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3198 size
= tree_to_uhwi (size_tree
);
3201 /* If we still haven't been able to get a size, see if the language
3202 can compute a maximum size. */
3206 size_tree
= lang_hooks
.types
.max_size (type
);
3208 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3209 size
= tree_to_uhwi (size_tree
);
3215 /* Return the bit position of FIELD, in bits from the start of the record.
3216 This is a tree of type bitsizetype. */
3219 bit_position (const_tree field
)
3221 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3222 DECL_FIELD_BIT_OFFSET (field
));
3225 /* Return the byte position of FIELD, in bytes from the start of the record.
3226 This is a tree of type sizetype. */
3229 byte_position (const_tree field
)
3231 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3232 DECL_FIELD_BIT_OFFSET (field
));
3235 /* Likewise, but return as an integer. It must be representable in
3236 that way (since it could be a signed value, we don't have the
3237 option of returning -1 like int_size_in_byte can. */
3240 int_byte_position (const_tree field
)
3242 return tree_to_shwi (byte_position (field
));
3245 /* Return the strictest alignment, in bits, that T is known to have. */
3248 expr_align (const_tree t
)
3250 unsigned int align0
, align1
;
3252 switch (TREE_CODE (t
))
3254 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3255 /* If we have conversions, we know that the alignment of the
3256 object must meet each of the alignments of the types. */
3257 align0
= expr_align (TREE_OPERAND (t
, 0));
3258 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3259 return MAX (align0
, align1
);
3261 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3262 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3263 case CLEANUP_POINT_EXPR
:
3264 /* These don't change the alignment of an object. */
3265 return expr_align (TREE_OPERAND (t
, 0));
3268 /* The best we can do is say that the alignment is the least aligned
3270 align0
= expr_align (TREE_OPERAND (t
, 1));
3271 align1
= expr_align (TREE_OPERAND (t
, 2));
3272 return MIN (align0
, align1
);
3274 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3275 meaningfully, it's always 1. */
3276 case LABEL_DECL
: case CONST_DECL
:
3277 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3279 gcc_assert (DECL_ALIGN (t
) != 0);
3280 return DECL_ALIGN (t
);
3286 /* Otherwise take the alignment from that of the type. */
3287 return TYPE_ALIGN (TREE_TYPE (t
));
3290 /* Return, as a tree node, the number of elements for TYPE (which is an
3291 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3294 array_type_nelts (const_tree type
)
3296 tree index_type
, min
, max
;
3298 /* If they did it with unspecified bounds, then we should have already
3299 given an error about it before we got here. */
3300 if (! TYPE_DOMAIN (type
))
3301 return error_mark_node
;
3303 index_type
= TYPE_DOMAIN (type
);
3304 min
= TYPE_MIN_VALUE (index_type
);
3305 max
= TYPE_MAX_VALUE (index_type
);
3307 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3309 return error_mark_node
;
3311 return (integer_zerop (min
)
3313 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3316 /* If arg is static -- a reference to an object in static storage -- then
3317 return the object. This is not the same as the C meaning of `static'.
3318 If arg isn't static, return NULL. */
3323 switch (TREE_CODE (arg
))
3326 /* Nested functions are static, even though taking their address will
3327 involve a trampoline as we unnest the nested function and create
3328 the trampoline on the tree level. */
3332 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3333 && ! DECL_THREAD_LOCAL_P (arg
)
3334 && ! DECL_DLLIMPORT_P (arg
)
3338 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3342 return TREE_STATIC (arg
) ? arg
: NULL
;
3349 /* If the thing being referenced is not a field, then it is
3350 something language specific. */
3351 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3353 /* If we are referencing a bitfield, we can't evaluate an
3354 ADDR_EXPR at compile time and so it isn't a constant. */
3355 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3358 return staticp (TREE_OPERAND (arg
, 0));
3364 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3367 case ARRAY_RANGE_REF
:
3368 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3369 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3370 return staticp (TREE_OPERAND (arg
, 0));
3374 case COMPOUND_LITERAL_EXPR
:
3375 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3385 /* Return whether OP is a DECL whose address is function-invariant. */
3388 decl_address_invariant_p (const_tree op
)
3390 /* The conditions below are slightly less strict than the one in
3393 switch (TREE_CODE (op
))
3402 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3403 || DECL_THREAD_LOCAL_P (op
)
3404 || DECL_CONTEXT (op
) == current_function_decl
3405 || decl_function_context (op
) == current_function_decl
)
3410 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3411 || decl_function_context (op
) == current_function_decl
)
3422 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3425 decl_address_ip_invariant_p (const_tree op
)
3427 /* The conditions below are slightly less strict than the one in
3430 switch (TREE_CODE (op
))
3438 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3439 && !DECL_DLLIMPORT_P (op
))
3440 || DECL_THREAD_LOCAL_P (op
))
3445 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3457 /* Return true if T is function-invariant (internal function, does
3458 not handle arithmetic; that's handled in skip_simple_arithmetic and
3459 tree_invariant_p). */
3462 tree_invariant_p_1 (tree t
)
3466 if (TREE_CONSTANT (t
)
3467 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3470 switch (TREE_CODE (t
))
3476 op
= TREE_OPERAND (t
, 0);
3477 while (handled_component_p (op
))
3479 switch (TREE_CODE (op
))
3482 case ARRAY_RANGE_REF
:
3483 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3484 || TREE_OPERAND (op
, 2) != NULL_TREE
3485 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3490 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3496 op
= TREE_OPERAND (op
, 0);
3499 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3508 /* Return true if T is function-invariant. */
3511 tree_invariant_p (tree t
)
3513 tree inner
= skip_simple_arithmetic (t
);
3514 return tree_invariant_p_1 (inner
);
3517 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3518 Do this to any expression which may be used in more than one place,
3519 but must be evaluated only once.
3521 Normally, expand_expr would reevaluate the expression each time.
3522 Calling save_expr produces something that is evaluated and recorded
3523 the first time expand_expr is called on it. Subsequent calls to
3524 expand_expr just reuse the recorded value.
3526 The call to expand_expr that generates code that actually computes
3527 the value is the first call *at compile time*. Subsequent calls
3528 *at compile time* generate code to use the saved value.
3529 This produces correct result provided that *at run time* control
3530 always flows through the insns made by the first expand_expr
3531 before reaching the other places where the save_expr was evaluated.
3532 You, the caller of save_expr, must make sure this is so.
3534 Constants, and certain read-only nodes, are returned with no
3535 SAVE_EXPR because that is safe. Expressions containing placeholders
3536 are not touched; see tree.def for an explanation of what these
3540 save_expr (tree expr
)
3544 /* If the tree evaluates to a constant, then we don't want to hide that
3545 fact (i.e. this allows further folding, and direct checks for constants).
3546 However, a read-only object that has side effects cannot be bypassed.
3547 Since it is no problem to reevaluate literals, we just return the
3549 inner
= skip_simple_arithmetic (expr
);
3550 if (TREE_CODE (inner
) == ERROR_MARK
)
3553 if (tree_invariant_p_1 (inner
))
3556 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3557 it means that the size or offset of some field of an object depends on
3558 the value within another field.
3560 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3561 and some variable since it would then need to be both evaluated once and
3562 evaluated more than once. Front-ends must assure this case cannot
3563 happen by surrounding any such subexpressions in their own SAVE_EXPR
3564 and forcing evaluation at the proper time. */
3565 if (contains_placeholder_p (inner
))
3568 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3570 /* This expression might be placed ahead of a jump to ensure that the
3571 value was computed on both sides of the jump. So make sure it isn't
3572 eliminated as dead. */
3573 TREE_SIDE_EFFECTS (expr
) = 1;
3577 /* Look inside EXPR into any simple arithmetic operations. Return the
3578 outermost non-arithmetic or non-invariant node. */
3581 skip_simple_arithmetic (tree expr
)
3583 /* We don't care about whether this can be used as an lvalue in this
3585 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3586 expr
= TREE_OPERAND (expr
, 0);
3588 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3589 a constant, it will be more efficient to not make another SAVE_EXPR since
3590 it will allow better simplification and GCSE will be able to merge the
3591 computations if they actually occur. */
3594 if (UNARY_CLASS_P (expr
))
3595 expr
= TREE_OPERAND (expr
, 0);
3596 else if (BINARY_CLASS_P (expr
))
3598 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3599 expr
= TREE_OPERAND (expr
, 0);
3600 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3601 expr
= TREE_OPERAND (expr
, 1);
3612 /* Look inside EXPR into simple arithmetic operations involving constants.
3613 Return the outermost non-arithmetic or non-constant node. */
3616 skip_simple_constant_arithmetic (tree expr
)
3618 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3619 expr
= TREE_OPERAND (expr
, 0);
3623 if (UNARY_CLASS_P (expr
))
3624 expr
= TREE_OPERAND (expr
, 0);
3625 else if (BINARY_CLASS_P (expr
))
3627 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3628 expr
= TREE_OPERAND (expr
, 0);
3629 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3630 expr
= TREE_OPERAND (expr
, 1);
3641 /* Return which tree structure is used by T. */
3643 enum tree_node_structure_enum
3644 tree_node_structure (const_tree t
)
3646 const enum tree_code code
= TREE_CODE (t
);
3647 return tree_node_structure_for_code (code
);
3650 /* Set various status flags when building a CALL_EXPR object T. */
3653 process_call_operands (tree t
)
3655 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3656 bool read_only
= false;
3657 int i
= call_expr_flags (t
);
3659 /* Calls have side-effects, except those to const or pure functions. */
3660 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3661 side_effects
= true;
3662 /* Propagate TREE_READONLY of arguments for const functions. */
3666 if (!side_effects
|| read_only
)
3667 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3669 tree op
= TREE_OPERAND (t
, i
);
3670 if (op
&& TREE_SIDE_EFFECTS (op
))
3671 side_effects
= true;
3672 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3676 TREE_SIDE_EFFECTS (t
) = side_effects
;
3677 TREE_READONLY (t
) = read_only
;
3680 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3681 size or offset that depends on a field within a record. */
3684 contains_placeholder_p (const_tree exp
)
3686 enum tree_code code
;
3691 code
= TREE_CODE (exp
);
3692 if (code
== PLACEHOLDER_EXPR
)
3695 switch (TREE_CODE_CLASS (code
))
3698 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3699 position computations since they will be converted into a
3700 WITH_RECORD_EXPR involving the reference, which will assume
3701 here will be valid. */
3702 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3704 case tcc_exceptional
:
3705 if (code
== TREE_LIST
)
3706 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3707 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3712 case tcc_comparison
:
3713 case tcc_expression
:
3717 /* Ignoring the first operand isn't quite right, but works best. */
3718 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3721 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3722 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3723 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3726 /* The save_expr function never wraps anything containing
3727 a PLACEHOLDER_EXPR. */
3734 switch (TREE_CODE_LENGTH (code
))
3737 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3739 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3740 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3751 const_call_expr_arg_iterator iter
;
3752 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3753 if (CONTAINS_PLACEHOLDER_P (arg
))
3767 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3768 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3772 type_contains_placeholder_1 (const_tree type
)
3774 /* If the size contains a placeholder or the parent type (component type in
3775 the case of arrays) type involves a placeholder, this type does. */
3776 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3777 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3778 || (!POINTER_TYPE_P (type
)
3780 && type_contains_placeholder_p (TREE_TYPE (type
))))
3783 /* Now do type-specific checks. Note that the last part of the check above
3784 greatly limits what we have to do below. */
3785 switch (TREE_CODE (type
))
3788 case POINTER_BOUNDS_TYPE
:
3794 case REFERENCE_TYPE
:
3803 case FIXED_POINT_TYPE
:
3804 /* Here we just check the bounds. */
3805 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3806 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3809 /* We have already checked the component type above, so just check
3810 the domain type. Flexible array members have a null domain. */
3811 return TYPE_DOMAIN (type
) ?
3812 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3816 case QUAL_UNION_TYPE
:
3820 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3821 if (TREE_CODE (field
) == FIELD_DECL
3822 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3823 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3824 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3825 || type_contains_placeholder_p (TREE_TYPE (field
))))
3836 /* Wrapper around above function used to cache its result. */
3839 type_contains_placeholder_p (tree type
)
3843 /* If the contains_placeholder_bits field has been initialized,
3844 then we know the answer. */
3845 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3846 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3848 /* Indicate that we've seen this type node, and the answer is false.
3849 This is what we want to return if we run into recursion via fields. */
3850 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3852 /* Compute the real value. */
3853 result
= type_contains_placeholder_1 (type
);
3855 /* Store the real value. */
3856 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3861 /* Push tree EXP onto vector QUEUE if it is not already present. */
3864 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3869 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3870 if (simple_cst_equal (iter
, exp
) == 1)
3874 queue
->safe_push (exp
);
3877 /* Given a tree EXP, find all occurrences of references to fields
3878 in a PLACEHOLDER_EXPR and place them in vector REFS without
3879 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3880 we assume here that EXP contains only arithmetic expressions
3881 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3885 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3887 enum tree_code code
= TREE_CODE (exp
);
3891 /* We handle TREE_LIST and COMPONENT_REF separately. */
3892 if (code
== TREE_LIST
)
3894 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3895 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3897 else if (code
== COMPONENT_REF
)
3899 for (inner
= TREE_OPERAND (exp
, 0);
3900 REFERENCE_CLASS_P (inner
);
3901 inner
= TREE_OPERAND (inner
, 0))
3904 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3905 push_without_duplicates (exp
, refs
);
3907 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3910 switch (TREE_CODE_CLASS (code
))
3915 case tcc_declaration
:
3916 /* Variables allocated to static storage can stay. */
3917 if (!TREE_STATIC (exp
))
3918 push_without_duplicates (exp
, refs
);
3921 case tcc_expression
:
3922 /* This is the pattern built in ada/make_aligning_type. */
3923 if (code
== ADDR_EXPR
3924 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3926 push_without_duplicates (exp
, refs
);
3932 case tcc_exceptional
:
3935 case tcc_comparison
:
3937 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3938 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3942 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3943 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3951 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3952 return a tree with all occurrences of references to F in a
3953 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3954 CONST_DECLs. Note that we assume here that EXP contains only
3955 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3956 occurring only in their argument list. */
3959 substitute_in_expr (tree exp
, tree f
, tree r
)
3961 enum tree_code code
= TREE_CODE (exp
);
3962 tree op0
, op1
, op2
, op3
;
3965 /* We handle TREE_LIST and COMPONENT_REF separately. */
3966 if (code
== TREE_LIST
)
3968 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3969 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3970 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3973 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3975 else if (code
== COMPONENT_REF
)
3979 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3980 and it is the right field, replace it with R. */
3981 for (inner
= TREE_OPERAND (exp
, 0);
3982 REFERENCE_CLASS_P (inner
);
3983 inner
= TREE_OPERAND (inner
, 0))
3987 op1
= TREE_OPERAND (exp
, 1);
3989 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3992 /* If this expression hasn't been completed let, leave it alone. */
3993 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3996 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3997 if (op0
== TREE_OPERAND (exp
, 0))
4001 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4004 switch (TREE_CODE_CLASS (code
))
4009 case tcc_declaration
:
4015 case tcc_expression
:
4021 case tcc_exceptional
:
4024 case tcc_comparison
:
4026 switch (TREE_CODE_LENGTH (code
))
4032 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4033 if (op0
== TREE_OPERAND (exp
, 0))
4036 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4040 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4041 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4043 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4046 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4050 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4051 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4052 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4054 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4055 && op2
== TREE_OPERAND (exp
, 2))
4058 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4062 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4063 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4064 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4065 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4067 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4068 && op2
== TREE_OPERAND (exp
, 2)
4069 && op3
== TREE_OPERAND (exp
, 3))
4073 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4085 new_tree
= NULL_TREE
;
4087 /* If we are trying to replace F with a constant or with another
4088 instance of one of the arguments of the call, inline back
4089 functions which do nothing else than computing a value from
4090 the arguments they are passed. This makes it possible to
4091 fold partially or entirely the replacement expression. */
4092 if (code
== CALL_EXPR
)
4094 bool maybe_inline
= false;
4095 if (CONSTANT_CLASS_P (r
))
4096 maybe_inline
= true;
4098 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4099 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4101 maybe_inline
= true;
4106 tree t
= maybe_inline_call_in_expr (exp
);
4108 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4112 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4114 tree op
= TREE_OPERAND (exp
, i
);
4115 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4119 new_tree
= copy_node (exp
);
4120 TREE_OPERAND (new_tree
, i
) = new_op
;
4126 new_tree
= fold (new_tree
);
4127 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4128 process_call_operands (new_tree
);
4139 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4141 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4142 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4147 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4148 for it within OBJ, a tree that is an object or a chain of references. */
4151 substitute_placeholder_in_expr (tree exp
, tree obj
)
4153 enum tree_code code
= TREE_CODE (exp
);
4154 tree op0
, op1
, op2
, op3
;
4157 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4158 in the chain of OBJ. */
4159 if (code
== PLACEHOLDER_EXPR
)
4161 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4164 for (elt
= obj
; elt
!= 0;
4165 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4166 || TREE_CODE (elt
) == COND_EXPR
)
4167 ? TREE_OPERAND (elt
, 1)
4168 : (REFERENCE_CLASS_P (elt
)
4169 || UNARY_CLASS_P (elt
)
4170 || BINARY_CLASS_P (elt
)
4171 || VL_EXP_CLASS_P (elt
)
4172 || EXPRESSION_CLASS_P (elt
))
4173 ? TREE_OPERAND (elt
, 0) : 0))
4174 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4177 for (elt
= obj
; elt
!= 0;
4178 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4179 || TREE_CODE (elt
) == COND_EXPR
)
4180 ? TREE_OPERAND (elt
, 1)
4181 : (REFERENCE_CLASS_P (elt
)
4182 || UNARY_CLASS_P (elt
)
4183 || BINARY_CLASS_P (elt
)
4184 || VL_EXP_CLASS_P (elt
)
4185 || EXPRESSION_CLASS_P (elt
))
4186 ? TREE_OPERAND (elt
, 0) : 0))
4187 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4188 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4190 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4192 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4193 survives until RTL generation, there will be an error. */
4197 /* TREE_LIST is special because we need to look at TREE_VALUE
4198 and TREE_CHAIN, not TREE_OPERANDS. */
4199 else if (code
== TREE_LIST
)
4201 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4202 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4203 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4206 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4209 switch (TREE_CODE_CLASS (code
))
4212 case tcc_declaration
:
4215 case tcc_exceptional
:
4218 case tcc_comparison
:
4219 case tcc_expression
:
4222 switch (TREE_CODE_LENGTH (code
))
4228 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4229 if (op0
== TREE_OPERAND (exp
, 0))
4232 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4236 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4237 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4239 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4242 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4246 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4247 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4248 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4250 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4251 && op2
== TREE_OPERAND (exp
, 2))
4254 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4258 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4259 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4260 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4261 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4263 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4264 && op2
== TREE_OPERAND (exp
, 2)
4265 && op3
== TREE_OPERAND (exp
, 3))
4269 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4281 new_tree
= NULL_TREE
;
4283 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4285 tree op
= TREE_OPERAND (exp
, i
);
4286 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4290 new_tree
= copy_node (exp
);
4291 TREE_OPERAND (new_tree
, i
) = new_op
;
4297 new_tree
= fold (new_tree
);
4298 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4299 process_call_operands (new_tree
);
4310 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4312 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4313 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4319 /* Subroutine of stabilize_reference; this is called for subtrees of
4320 references. Any expression with side-effects must be put in a SAVE_EXPR
4321 to ensure that it is only evaluated once.
4323 We don't put SAVE_EXPR nodes around everything, because assigning very
4324 simple expressions to temporaries causes us to miss good opportunities
4325 for optimizations. Among other things, the opportunity to fold in the
4326 addition of a constant into an addressing mode often gets lost, e.g.
4327 "y[i+1] += x;". In general, we take the approach that we should not make
4328 an assignment unless we are forced into it - i.e., that any non-side effect
4329 operator should be allowed, and that cse should take care of coalescing
4330 multiple utterances of the same expression should that prove fruitful. */
4333 stabilize_reference_1 (tree e
)
4336 enum tree_code code
= TREE_CODE (e
);
4338 /* We cannot ignore const expressions because it might be a reference
4339 to a const array but whose index contains side-effects. But we can
4340 ignore things that are actual constant or that already have been
4341 handled by this function. */
4343 if (tree_invariant_p (e
))
4346 switch (TREE_CODE_CLASS (code
))
4348 case tcc_exceptional
:
4350 case tcc_declaration
:
4351 case tcc_comparison
:
4353 case tcc_expression
:
4356 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4357 so that it will only be evaluated once. */
4358 /* The reference (r) and comparison (<) classes could be handled as
4359 below, but it is generally faster to only evaluate them once. */
4360 if (TREE_SIDE_EFFECTS (e
))
4361 return save_expr (e
);
4365 /* Constants need no processing. In fact, we should never reach
4370 /* Division is slow and tends to be compiled with jumps,
4371 especially the division by powers of 2 that is often
4372 found inside of an array reference. So do it just once. */
4373 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4374 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4375 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4376 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4377 return save_expr (e
);
4378 /* Recursively stabilize each operand. */
4379 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4380 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4384 /* Recursively stabilize each operand. */
4385 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4392 TREE_TYPE (result
) = TREE_TYPE (e
);
4393 TREE_READONLY (result
) = TREE_READONLY (e
);
4394 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4395 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4400 /* Stabilize a reference so that we can use it any number of times
4401 without causing its operands to be evaluated more than once.
4402 Returns the stabilized reference. This works by means of save_expr,
4403 so see the caveats in the comments about save_expr.
4405 Also allows conversion expressions whose operands are references.
4406 Any other kind of expression is returned unchanged. */
4409 stabilize_reference (tree ref
)
4412 enum tree_code code
= TREE_CODE (ref
);
4419 /* No action is needed in this case. */
4424 case FIX_TRUNC_EXPR
:
4425 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4429 result
= build_nt (INDIRECT_REF
,
4430 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4434 result
= build_nt (COMPONENT_REF
,
4435 stabilize_reference (TREE_OPERAND (ref
, 0)),
4436 TREE_OPERAND (ref
, 1), NULL_TREE
);
4440 result
= build_nt (BIT_FIELD_REF
,
4441 stabilize_reference (TREE_OPERAND (ref
, 0)),
4442 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4443 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4447 result
= build_nt (ARRAY_REF
,
4448 stabilize_reference (TREE_OPERAND (ref
, 0)),
4449 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4450 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4453 case ARRAY_RANGE_REF
:
4454 result
= build_nt (ARRAY_RANGE_REF
,
4455 stabilize_reference (TREE_OPERAND (ref
, 0)),
4456 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4457 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4461 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4462 it wouldn't be ignored. This matters when dealing with
4464 return stabilize_reference_1 (ref
);
4466 /* If arg isn't a kind of lvalue we recognize, make no change.
4467 Caller should recognize the error for an invalid lvalue. */
4472 return error_mark_node
;
4475 TREE_TYPE (result
) = TREE_TYPE (ref
);
4476 TREE_READONLY (result
) = TREE_READONLY (ref
);
4477 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4478 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4483 /* Low-level constructors for expressions. */
4485 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4486 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4489 recompute_tree_invariant_for_addr_expr (tree t
)
4492 bool tc
= true, se
= false;
4494 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4496 /* We started out assuming this address is both invariant and constant, but
4497 does not have side effects. Now go down any handled components and see if
4498 any of them involve offsets that are either non-constant or non-invariant.
4499 Also check for side-effects.
4501 ??? Note that this code makes no attempt to deal with the case where
4502 taking the address of something causes a copy due to misalignment. */
4504 #define UPDATE_FLAGS(NODE) \
4505 do { tree _node = (NODE); \
4506 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4507 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4509 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4510 node
= TREE_OPERAND (node
, 0))
4512 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4513 array reference (probably made temporarily by the G++ front end),
4514 so ignore all the operands. */
4515 if ((TREE_CODE (node
) == ARRAY_REF
4516 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4517 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4519 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4520 if (TREE_OPERAND (node
, 2))
4521 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4522 if (TREE_OPERAND (node
, 3))
4523 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4525 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4526 FIELD_DECL, apparently. The G++ front end can put something else
4527 there, at least temporarily. */
4528 else if (TREE_CODE (node
) == COMPONENT_REF
4529 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4531 if (TREE_OPERAND (node
, 2))
4532 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4536 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4538 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4539 the address, since &(*a)->b is a form of addition. If it's a constant, the
4540 address is constant too. If it's a decl, its address is constant if the
4541 decl is static. Everything else is not constant and, furthermore,
4542 taking the address of a volatile variable is not volatile. */
4543 if (TREE_CODE (node
) == INDIRECT_REF
4544 || TREE_CODE (node
) == MEM_REF
)
4545 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4546 else if (CONSTANT_CLASS_P (node
))
4548 else if (DECL_P (node
))
4549 tc
&= (staticp (node
) != NULL_TREE
);
4553 se
|= TREE_SIDE_EFFECTS (node
);
4557 TREE_CONSTANT (t
) = tc
;
4558 TREE_SIDE_EFFECTS (t
) = se
;
4562 /* Build an expression of code CODE, data type TYPE, and operands as
4563 specified. Expressions and reference nodes can be created this way.
4564 Constants, decls, types and misc nodes cannot be.
4566 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4567 enough for all extant tree codes. */
4570 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4574 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4576 t
= make_node (code PASS_MEM_STAT
);
4583 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4585 int length
= sizeof (struct tree_exp
);
4588 record_node_allocation_statistics (code
, length
);
4590 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4592 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4594 memset (t
, 0, sizeof (struct tree_common
));
4596 TREE_SET_CODE (t
, code
);
4598 TREE_TYPE (t
) = type
;
4599 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4600 TREE_OPERAND (t
, 0) = node
;
4601 if (node
&& !TYPE_P (node
))
4603 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4604 TREE_READONLY (t
) = TREE_READONLY (node
);
4607 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4609 if (code
!= DEBUG_BEGIN_STMT
)
4610 TREE_SIDE_EFFECTS (t
) = 1;
4615 /* All of these have side-effects, no matter what their
4617 TREE_SIDE_EFFECTS (t
) = 1;
4618 TREE_READONLY (t
) = 0;
4622 /* Whether a dereference is readonly has nothing to do with whether
4623 its operand is readonly. */
4624 TREE_READONLY (t
) = 0;
4629 recompute_tree_invariant_for_addr_expr (t
);
4633 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4634 && node
&& !TYPE_P (node
)
4635 && TREE_CONSTANT (node
))
4636 TREE_CONSTANT (t
) = 1;
4637 if (TREE_CODE_CLASS (code
) == tcc_reference
4638 && node
&& TREE_THIS_VOLATILE (node
))
4639 TREE_THIS_VOLATILE (t
) = 1;
4646 #define PROCESS_ARG(N) \
4648 TREE_OPERAND (t, N) = arg##N; \
4649 if (arg##N &&!TYPE_P (arg##N)) \
4651 if (TREE_SIDE_EFFECTS (arg##N)) \
4653 if (!TREE_READONLY (arg##N) \
4654 && !CONSTANT_CLASS_P (arg##N)) \
4655 (void) (read_only = 0); \
4656 if (!TREE_CONSTANT (arg##N)) \
4657 (void) (constant = 0); \
4662 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4664 bool constant
, read_only
, side_effects
, div_by_zero
;
4667 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4669 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4670 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4671 /* When sizetype precision doesn't match that of pointers
4672 we need to be able to build explicit extensions or truncations
4673 of the offset argument. */
4674 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4675 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4676 && TREE_CODE (arg1
) == INTEGER_CST
);
4678 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4679 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4680 && ptrofftype_p (TREE_TYPE (arg1
)));
4682 t
= make_node (code PASS_MEM_STAT
);
4685 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4686 result based on those same flags for the arguments. But if the
4687 arguments aren't really even `tree' expressions, we shouldn't be trying
4690 /* Expressions without side effects may be constant if their
4691 arguments are as well. */
4692 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4693 || TREE_CODE_CLASS (code
) == tcc_binary
);
4695 side_effects
= TREE_SIDE_EFFECTS (t
);
4699 case TRUNC_DIV_EXPR
:
4701 case FLOOR_DIV_EXPR
:
4702 case ROUND_DIV_EXPR
:
4703 case EXACT_DIV_EXPR
:
4705 case FLOOR_MOD_EXPR
:
4706 case ROUND_MOD_EXPR
:
4707 case TRUNC_MOD_EXPR
:
4708 div_by_zero
= integer_zerop (arg1
);
4711 div_by_zero
= false;
4717 TREE_SIDE_EFFECTS (t
) = side_effects
;
4718 if (code
== MEM_REF
)
4720 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4722 tree o
= TREE_OPERAND (arg0
, 0);
4723 TREE_READONLY (t
) = TREE_READONLY (o
);
4724 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4729 TREE_READONLY (t
) = read_only
;
4730 /* Don't mark X / 0 as constant. */
4731 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4732 TREE_THIS_VOLATILE (t
)
4733 = (TREE_CODE_CLASS (code
) == tcc_reference
4734 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4742 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4743 tree arg2 MEM_STAT_DECL
)
4745 bool constant
, read_only
, side_effects
;
4748 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4749 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4751 t
= make_node (code PASS_MEM_STAT
);
4756 /* As a special exception, if COND_EXPR has NULL branches, we
4757 assume that it is a gimple statement and always consider
4758 it to have side effects. */
4759 if (code
== COND_EXPR
4760 && tt
== void_type_node
4761 && arg1
== NULL_TREE
4762 && arg2
== NULL_TREE
)
4763 side_effects
= true;
4765 side_effects
= TREE_SIDE_EFFECTS (t
);
4771 if (code
== COND_EXPR
)
4772 TREE_READONLY (t
) = read_only
;
4774 TREE_SIDE_EFFECTS (t
) = side_effects
;
4775 TREE_THIS_VOLATILE (t
)
4776 = (TREE_CODE_CLASS (code
) == tcc_reference
4777 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4783 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4784 tree arg2
, tree arg3 MEM_STAT_DECL
)
4786 bool constant
, read_only
, side_effects
;
4789 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4791 t
= make_node (code PASS_MEM_STAT
);
4794 side_effects
= TREE_SIDE_EFFECTS (t
);
4801 TREE_SIDE_EFFECTS (t
) = side_effects
;
4802 TREE_THIS_VOLATILE (t
)
4803 = (TREE_CODE_CLASS (code
) == tcc_reference
4804 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4810 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4811 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4813 bool constant
, read_only
, side_effects
;
4816 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4818 t
= make_node (code PASS_MEM_STAT
);
4821 side_effects
= TREE_SIDE_EFFECTS (t
);
4829 TREE_SIDE_EFFECTS (t
) = side_effects
;
4830 if (code
== TARGET_MEM_REF
)
4832 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4834 tree o
= TREE_OPERAND (arg0
, 0);
4835 TREE_READONLY (t
) = TREE_READONLY (o
);
4836 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4840 TREE_THIS_VOLATILE (t
)
4841 = (TREE_CODE_CLASS (code
) == tcc_reference
4842 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4847 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4848 on the pointer PTR. */
4851 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4853 poly_int64 offset
= 0;
4854 tree ptype
= TREE_TYPE (ptr
);
4856 /* For convenience allow addresses that collapse to a simple base
4858 if (TREE_CODE (ptr
) == ADDR_EXPR
4859 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4860 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4862 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4864 if (TREE_CODE (ptr
) == MEM_REF
)
4866 offset
+= mem_ref_offset (ptr
).force_shwi ();
4867 ptr
= TREE_OPERAND (ptr
, 0);
4870 ptr
= build_fold_addr_expr (ptr
);
4871 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4873 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4874 ptr
, build_int_cst (ptype
, offset
));
4875 SET_EXPR_LOCATION (tem
, loc
);
4879 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4882 mem_ref_offset (const_tree t
)
4884 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4888 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4889 offsetted by OFFSET units. */
4892 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4894 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4895 build_fold_addr_expr (base
),
4896 build_int_cst (ptr_type_node
, offset
));
4897 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4898 recompute_tree_invariant_for_addr_expr (addr
);
4902 /* Similar except don't specify the TREE_TYPE
4903 and leave the TREE_SIDE_EFFECTS as 0.
4904 It is permissible for arguments to be null,
4905 or even garbage if their values do not matter. */
4908 build_nt (enum tree_code code
, ...)
4915 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4919 t
= make_node (code
);
4920 length
= TREE_CODE_LENGTH (code
);
4922 for (i
= 0; i
< length
; i
++)
4923 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4929 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4933 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4938 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4939 CALL_EXPR_FN (ret
) = fn
;
4940 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4941 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4942 CALL_EXPR_ARG (ret
, ix
) = t
;
4946 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4947 We do NOT enter this node in any sort of symbol table.
4949 LOC is the location of the decl.
4951 layout_decl is used to set up the decl's storage layout.
4952 Other slots are initialized to 0 or null pointers. */
4955 build_decl (location_t loc
, enum tree_code code
, tree name
,
4956 tree type MEM_STAT_DECL
)
4960 t
= make_node (code PASS_MEM_STAT
);
4961 DECL_SOURCE_LOCATION (t
) = loc
;
4963 /* if (type == error_mark_node)
4964 type = integer_type_node; */
4965 /* That is not done, deliberately, so that having error_mark_node
4966 as the type can suppress useless errors in the use of this variable. */
4968 DECL_NAME (t
) = name
;
4969 TREE_TYPE (t
) = type
;
4971 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4977 /* Builds and returns function declaration with NAME and TYPE. */
4980 build_fn_decl (const char *name
, tree type
)
4982 tree id
= get_identifier (name
);
4983 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4985 DECL_EXTERNAL (decl
) = 1;
4986 TREE_PUBLIC (decl
) = 1;
4987 DECL_ARTIFICIAL (decl
) = 1;
4988 TREE_NOTHROW (decl
) = 1;
4993 vec
<tree
, va_gc
> *all_translation_units
;
4995 /* Builds a new translation-unit decl with name NAME, queues it in the
4996 global list of translation-unit decls and returns it. */
4999 build_translation_unit_decl (tree name
)
5001 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5003 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5004 vec_safe_push (all_translation_units
, tu
);
5009 /* BLOCK nodes are used to represent the structure of binding contours
5010 and declarations, once those contours have been exited and their contents
5011 compiled. This information is used for outputting debugging info. */
5014 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5016 tree block
= make_node (BLOCK
);
5018 BLOCK_VARS (block
) = vars
;
5019 BLOCK_SUBBLOCKS (block
) = subblocks
;
5020 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5021 BLOCK_CHAIN (block
) = chain
;
5026 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5028 LOC is the location to use in tree T. */
5031 protected_set_expr_location (tree t
, location_t loc
)
5033 if (CAN_HAVE_LOCATION_P (t
))
5034 SET_EXPR_LOCATION (t
, loc
);
5037 /* Reset the expression *EXPR_P, a size or position.
5039 ??? We could reset all non-constant sizes or positions. But it's cheap
5040 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5042 We need to reset self-referential sizes or positions because they cannot
5043 be gimplified and thus can contain a CALL_EXPR after the gimplification
5044 is finished, which will run afoul of LTO streaming. And they need to be
5045 reset to something essentially dummy but not constant, so as to preserve
5046 the properties of the object they are attached to. */
5049 free_lang_data_in_one_sizepos (tree
*expr_p
)
5051 tree expr
= *expr_p
;
5052 if (CONTAINS_PLACEHOLDER_P (expr
))
5053 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5057 /* Reset all the fields in a binfo node BINFO. We only keep
5058 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5061 free_lang_data_in_binfo (tree binfo
)
5066 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5068 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5069 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5070 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5071 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5073 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5074 free_lang_data_in_binfo (t
);
5078 /* Reset all language specific information still present in TYPE. */
5081 free_lang_data_in_type (tree type
)
5083 gcc_assert (TYPE_P (type
));
5085 /* Give the FE a chance to remove its own data first. */
5086 lang_hooks
.free_lang_data (type
);
5088 TREE_LANG_FLAG_0 (type
) = 0;
5089 TREE_LANG_FLAG_1 (type
) = 0;
5090 TREE_LANG_FLAG_2 (type
) = 0;
5091 TREE_LANG_FLAG_3 (type
) = 0;
5092 TREE_LANG_FLAG_4 (type
) = 0;
5093 TREE_LANG_FLAG_5 (type
) = 0;
5094 TREE_LANG_FLAG_6 (type
) = 0;
5096 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5098 /* Remove the const and volatile qualifiers from arguments. The
5099 C++ front end removes them, but the C front end does not,
5100 leading to false ODR violation errors when merging two
5101 instances of the same function signature compiled by
5102 different front ends. */
5103 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5105 tree arg_type
= TREE_VALUE (p
);
5107 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5109 int quals
= TYPE_QUALS (arg_type
)
5111 & ~TYPE_QUAL_VOLATILE
;
5112 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5113 free_lang_data_in_type (TREE_VALUE (p
));
5115 /* C++ FE uses TREE_PURPOSE to store initial values. */
5116 TREE_PURPOSE (p
) = NULL
;
5119 else if (TREE_CODE (type
) == METHOD_TYPE
)
5120 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5121 /* C++ FE uses TREE_PURPOSE to store initial values. */
5122 TREE_PURPOSE (p
) = NULL
;
5123 else if (RECORD_OR_UNION_TYPE_P (type
))
5125 /* Remove members that are not FIELD_DECLs (and maybe
5126 TYPE_DECLs) from the field list of an aggregate. These occur
5128 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5129 if (TREE_CODE (member
) == FIELD_DECL
5130 || (TREE_CODE (member
) == TYPE_DECL
5131 && !DECL_IGNORED_P (member
)
5132 && debug_info_level
> DINFO_LEVEL_TERSE
5133 && !is_redundant_typedef (member
)))
5134 prev
= &DECL_CHAIN (member
);
5136 *prev
= DECL_CHAIN (member
);
5138 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5139 and danagle the pointer from time to time. */
5140 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5141 TYPE_VFIELD (type
) = NULL_TREE
;
5143 if (TYPE_BINFO (type
))
5145 free_lang_data_in_binfo (TYPE_BINFO (type
));
5146 /* We need to preserve link to bases and virtual table for all
5147 polymorphic types to make devirtualization machinery working.
5148 Debug output cares only about bases, but output also
5149 virtual table pointers so merging of -fdevirtualize and
5150 -fno-devirtualize units is easier. */
5151 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5152 || !flag_devirtualize
)
5153 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5154 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5155 || debug_info_level
!= DINFO_LEVEL_NONE
))
5156 TYPE_BINFO (type
) = NULL
;
5159 else if (INTEGRAL_TYPE_P (type
)
5160 || SCALAR_FLOAT_TYPE_P (type
)
5161 || FIXED_POINT_TYPE_P (type
))
5163 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5164 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5167 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5169 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5170 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5172 if (TYPE_CONTEXT (type
)
5173 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5175 tree ctx
= TYPE_CONTEXT (type
);
5178 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5180 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5181 TYPE_CONTEXT (type
) = ctx
;
5186 /* Return true if DECL may need an assembler name to be set. */
5189 need_assembler_name_p (tree decl
)
5191 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5192 Rule merging. This makes type_odr_p to return true on those types during
5193 LTO and by comparing the mangled name, we can say what types are intended
5194 to be equivalent across compilation unit.
5196 We do not store names of type_in_anonymous_namespace_p.
5198 Record, union and enumeration type have linkage that allows use
5199 to check type_in_anonymous_namespace_p. We do not mangle compound types
5200 that always can be compared structurally.
5202 Similarly for builtin types, we compare properties of their main variant.
5203 A special case are integer types where mangling do make differences
5204 between char/signed char/unsigned char etc. Storing name for these makes
5205 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5206 See cp/mangle.c:write_builtin_type for details. */
5208 if (flag_lto_odr_type_mering
5209 && TREE_CODE (decl
) == TYPE_DECL
5211 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5212 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5213 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5214 && (type_with_linkage_p (TREE_TYPE (decl
))
5215 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5216 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5217 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5218 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5219 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5222 /* If DECL already has its assembler name set, it does not need a
5224 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5225 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5228 /* Abstract decls do not need an assembler name. */
5229 if (DECL_ABSTRACT_P (decl
))
5232 /* For VAR_DECLs, only static, public and external symbols need an
5235 && !TREE_STATIC (decl
)
5236 && !TREE_PUBLIC (decl
)
5237 && !DECL_EXTERNAL (decl
))
5240 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5242 /* Do not set assembler name on builtins. Allow RTL expansion to
5243 decide whether to expand inline or via a regular call. */
5244 if (DECL_BUILT_IN (decl
)
5245 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5248 /* Functions represented in the callgraph need an assembler name. */
5249 if (cgraph_node::get (decl
) != NULL
)
5252 /* Unused and not public functions don't need an assembler name. */
5253 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5261 /* Reset all language specific information still present in symbol
5265 free_lang_data_in_decl (tree decl
)
5267 gcc_assert (DECL_P (decl
));
5269 /* Give the FE a chance to remove its own data first. */
5270 lang_hooks
.free_lang_data (decl
);
5272 TREE_LANG_FLAG_0 (decl
) = 0;
5273 TREE_LANG_FLAG_1 (decl
) = 0;
5274 TREE_LANG_FLAG_2 (decl
) = 0;
5275 TREE_LANG_FLAG_3 (decl
) = 0;
5276 TREE_LANG_FLAG_4 (decl
) = 0;
5277 TREE_LANG_FLAG_5 (decl
) = 0;
5278 TREE_LANG_FLAG_6 (decl
) = 0;
5280 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5281 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5282 if (TREE_CODE (decl
) == FIELD_DECL
)
5284 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5285 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5286 DECL_QUALIFIER (decl
) = NULL_TREE
;
5289 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5291 struct cgraph_node
*node
;
5292 if (!(node
= cgraph_node::get (decl
))
5293 || (!node
->definition
&& !node
->clones
))
5296 node
->release_body ();
5299 release_function_body (decl
);
5300 DECL_ARGUMENTS (decl
) = NULL
;
5301 DECL_RESULT (decl
) = NULL
;
5302 DECL_INITIAL (decl
) = error_mark_node
;
5305 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5309 /* If DECL has a gimple body, then the context for its
5310 arguments must be DECL. Otherwise, it doesn't really
5311 matter, as we will not be emitting any code for DECL. In
5312 general, there may be other instances of DECL created by
5313 the front end and since PARM_DECLs are generally shared,
5314 their DECL_CONTEXT changes as the replicas of DECL are
5315 created. The only time where DECL_CONTEXT is important
5316 is for the FUNCTION_DECLs that have a gimple body (since
5317 the PARM_DECL will be used in the function's body). */
5318 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5319 DECL_CONTEXT (t
) = decl
;
5320 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5321 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5322 = target_option_default_node
;
5323 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5324 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5325 = optimization_default_node
;
5328 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5329 At this point, it is not needed anymore. */
5330 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5332 /* Clear the abstract origin if it refers to a method.
5333 Otherwise dwarf2out.c will ICE as we splice functions out of
5334 TYPE_FIELDS and thus the origin will not be output
5336 if (DECL_ABSTRACT_ORIGIN (decl
)
5337 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5338 && RECORD_OR_UNION_TYPE_P
5339 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5340 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5342 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5343 DECL_VINDEX referring to itself into a vtable slot number as it
5344 should. Happens with functions that are copied and then forgotten
5345 about. Just clear it, it won't matter anymore. */
5346 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5347 DECL_VINDEX (decl
) = NULL_TREE
;
5349 else if (VAR_P (decl
))
5351 if ((DECL_EXTERNAL (decl
)
5352 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5353 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5354 DECL_INITIAL (decl
) = NULL_TREE
;
5356 else if (TREE_CODE (decl
) == TYPE_DECL
)
5358 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5359 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5360 DECL_INITIAL (decl
) = NULL_TREE
;
5362 else if (TREE_CODE (decl
) == FIELD_DECL
)
5363 DECL_INITIAL (decl
) = NULL_TREE
;
5364 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5365 && DECL_INITIAL (decl
)
5366 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5368 /* Strip builtins from the translation-unit BLOCK. We still have targets
5369 without builtin_decl_explicit support and also builtins are shared
5370 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5371 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5375 if (TREE_CODE (var
) == FUNCTION_DECL
5376 && DECL_BUILT_IN (var
))
5377 *nextp
= TREE_CHAIN (var
);
5379 nextp
= &TREE_CHAIN (var
);
5385 /* Data used when collecting DECLs and TYPEs for language data removal. */
5387 struct free_lang_data_d
5389 free_lang_data_d () : decls (100), types (100) {}
5391 /* Worklist to avoid excessive recursion. */
5392 auto_vec
<tree
> worklist
;
5394 /* Set of traversed objects. Used to avoid duplicate visits. */
5395 hash_set
<tree
> pset
;
5397 /* Array of symbols to process with free_lang_data_in_decl. */
5398 auto_vec
<tree
> decls
;
5400 /* Array of types to process with free_lang_data_in_type. */
5401 auto_vec
<tree
> types
;
5405 /* Save all language fields needed to generate proper debug information
5406 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5409 save_debug_info_for_decl (tree t
)
5411 /*struct saved_debug_info_d *sdi;*/
5413 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5415 /* FIXME. Partial implementation for saving debug info removed. */
5419 /* Save all language fields needed to generate proper debug information
5420 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5423 save_debug_info_for_type (tree t
)
5425 /*struct saved_debug_info_d *sdi;*/
5427 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5429 /* FIXME. Partial implementation for saving debug info removed. */
5433 /* Add type or decl T to one of the list of tree nodes that need their
5434 language data removed. The lists are held inside FLD. */
5437 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5441 fld
->decls
.safe_push (t
);
5442 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5443 save_debug_info_for_decl (t
);
5445 else if (TYPE_P (t
))
5447 fld
->types
.safe_push (t
);
5448 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5449 save_debug_info_for_type (t
);
5455 /* Push tree node T into FLD->WORKLIST. */
5458 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5460 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5461 fld
->worklist
.safe_push ((t
));
5465 /* Operand callback helper for free_lang_data_in_node. *TP is the
5466 subtree operand being considered. */
5469 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5472 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5474 if (TREE_CODE (t
) == TREE_LIST
)
5477 /* Language specific nodes will be removed, so there is no need
5478 to gather anything under them. */
5479 if (is_lang_specific (t
))
5487 /* Note that walk_tree does not traverse every possible field in
5488 decls, so we have to do our own traversals here. */
5489 add_tree_to_fld_list (t
, fld
);
5491 fld_worklist_push (DECL_NAME (t
), fld
);
5492 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5493 fld_worklist_push (DECL_SIZE (t
), fld
);
5494 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5496 /* We are going to remove everything under DECL_INITIAL for
5497 TYPE_DECLs. No point walking them. */
5498 if (TREE_CODE (t
) != TYPE_DECL
)
5499 fld_worklist_push (DECL_INITIAL (t
), fld
);
5501 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5502 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5504 if (TREE_CODE (t
) == FUNCTION_DECL
)
5506 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5507 fld_worklist_push (DECL_RESULT (t
), fld
);
5509 else if (TREE_CODE (t
) == TYPE_DECL
)
5511 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5513 else if (TREE_CODE (t
) == FIELD_DECL
)
5515 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5516 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5517 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5518 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5521 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5522 && DECL_HAS_VALUE_EXPR_P (t
))
5523 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5525 if (TREE_CODE (t
) != FIELD_DECL
5526 && TREE_CODE (t
) != TYPE_DECL
)
5527 fld_worklist_push (TREE_CHAIN (t
), fld
);
5530 else if (TYPE_P (t
))
5532 /* Note that walk_tree does not traverse every possible field in
5533 types, so we have to do our own traversals here. */
5534 add_tree_to_fld_list (t
, fld
);
5536 if (!RECORD_OR_UNION_TYPE_P (t
))
5537 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5538 fld_worklist_push (TYPE_SIZE (t
), fld
);
5539 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5540 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5541 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5542 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5543 fld_worklist_push (TYPE_NAME (t
), fld
);
5544 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5545 them and thus do not and want not to reach unused pointer types
5547 if (!POINTER_TYPE_P (t
))
5548 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5549 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5550 if (!RECORD_OR_UNION_TYPE_P (t
))
5551 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5552 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5553 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5554 do not and want not to reach unused variants this way. */
5555 if (TYPE_CONTEXT (t
))
5557 tree ctx
= TYPE_CONTEXT (t
);
5558 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5559 So push that instead. */
5560 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5561 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5562 fld_worklist_push (ctx
, fld
);
5564 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5565 and want not to reach unused types this way. */
5567 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5571 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5572 fld_worklist_push (TREE_TYPE (tem
), fld
);
5573 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5575 if (RECORD_OR_UNION_TYPE_P (t
))
5578 /* Push all TYPE_FIELDS - there can be interleaving interesting
5579 and non-interesting things. */
5580 tem
= TYPE_FIELDS (t
);
5583 if (TREE_CODE (tem
) == FIELD_DECL
5584 || (TREE_CODE (tem
) == TYPE_DECL
5585 && !DECL_IGNORED_P (tem
)
5586 && debug_info_level
> DINFO_LEVEL_TERSE
5587 && !is_redundant_typedef (tem
)))
5588 fld_worklist_push (tem
, fld
);
5589 tem
= TREE_CHAIN (tem
);
5593 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5596 else if (TREE_CODE (t
) == BLOCK
)
5599 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5600 fld_worklist_push (tem
, fld
);
5601 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5602 fld_worklist_push (tem
, fld
);
5603 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5606 if (TREE_CODE (t
) != IDENTIFIER_NODE
5607 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5608 fld_worklist_push (TREE_TYPE (t
), fld
);
5614 /* Find decls and types in T. */
5617 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5621 if (!fld
->pset
.contains (t
))
5622 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5623 if (fld
->worklist
.is_empty ())
5625 t
= fld
->worklist
.pop ();
5629 /* Translate all the types in LIST with the corresponding runtime
5633 get_eh_types_for_runtime (tree list
)
5637 if (list
== NULL_TREE
)
5640 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5642 list
= TREE_CHAIN (list
);
5645 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5646 TREE_CHAIN (prev
) = n
;
5647 prev
= TREE_CHAIN (prev
);
5648 list
= TREE_CHAIN (list
);
5655 /* Find decls and types referenced in EH region R and store them in
5656 FLD->DECLS and FLD->TYPES. */
5659 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5670 /* The types referenced in each catch must first be changed to the
5671 EH types used at runtime. This removes references to FE types
5673 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5675 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5676 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5681 case ERT_ALLOWED_EXCEPTIONS
:
5682 r
->u
.allowed
.type_list
5683 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5684 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5687 case ERT_MUST_NOT_THROW
:
5688 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5689 find_decls_types_r
, fld
, &fld
->pset
);
5695 /* Find decls and types referenced in cgraph node N and store them in
5696 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5697 look for *every* kind of DECL and TYPE node reachable from N,
5698 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5699 NAMESPACE_DECLs, etc). */
5702 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5705 struct function
*fn
;
5709 find_decls_types (n
->decl
, fld
);
5711 if (!gimple_has_body_p (n
->decl
))
5714 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5716 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5718 /* Traverse locals. */
5719 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5720 find_decls_types (t
, fld
);
5722 /* Traverse EH regions in FN. */
5725 FOR_ALL_EH_REGION_FN (r
, fn
)
5726 find_decls_types_in_eh_region (r
, fld
);
5729 /* Traverse every statement in FN. */
5730 FOR_EACH_BB_FN (bb
, fn
)
5733 gimple_stmt_iterator si
;
5736 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5738 gphi
*phi
= psi
.phi ();
5740 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5742 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5743 find_decls_types (*arg_p
, fld
);
5747 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5749 gimple
*stmt
= gsi_stmt (si
);
5751 if (is_gimple_call (stmt
))
5752 find_decls_types (gimple_call_fntype (stmt
), fld
);
5754 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5756 tree arg
= gimple_op (stmt
, i
);
5757 find_decls_types (arg
, fld
);
5764 /* Find decls and types referenced in varpool node N and store them in
5765 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5766 look for *every* kind of DECL and TYPE node reachable from N,
5767 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5768 NAMESPACE_DECLs, etc). */
5771 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5773 find_decls_types (v
->decl
, fld
);
5776 /* If T needs an assembler name, have one created for it. */
5779 assign_assembler_name_if_needed (tree t
)
5781 if (need_assembler_name_p (t
))
5783 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5784 diagnostics that use input_location to show locus
5785 information. The problem here is that, at this point,
5786 input_location is generally anchored to the end of the file
5787 (since the parser is long gone), so we don't have a good
5788 position to pin it to.
5790 To alleviate this problem, this uses the location of T's
5791 declaration. Examples of this are
5792 testsuite/g++.dg/template/cond2.C and
5793 testsuite/g++.dg/template/pr35240.C. */
5794 location_t saved_location
= input_location
;
5795 input_location
= DECL_SOURCE_LOCATION (t
);
5797 decl_assembler_name (t
);
5799 input_location
= saved_location
;
5804 /* Free language specific information for every operand and expression
5805 in every node of the call graph. This process operates in three stages:
5807 1- Every callgraph node and varpool node is traversed looking for
5808 decls and types embedded in them. This is a more exhaustive
5809 search than that done by find_referenced_vars, because it will
5810 also collect individual fields, decls embedded in types, etc.
5812 2- All the decls found are sent to free_lang_data_in_decl.
5814 3- All the types found are sent to free_lang_data_in_type.
5816 The ordering between decls and types is important because
5817 free_lang_data_in_decl sets assembler names, which includes
5818 mangling. So types cannot be freed up until assembler names have
5822 free_lang_data_in_cgraph (void)
5824 struct cgraph_node
*n
;
5826 struct free_lang_data_d fld
;
5831 /* Find decls and types in the body of every function in the callgraph. */
5832 FOR_EACH_FUNCTION (n
)
5833 find_decls_types_in_node (n
, &fld
);
5835 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5836 find_decls_types (p
->decl
, &fld
);
5838 /* Find decls and types in every varpool symbol. */
5839 FOR_EACH_VARIABLE (v
)
5840 find_decls_types_in_var (v
, &fld
);
5842 /* Set the assembler name on every decl found. We need to do this
5843 now because free_lang_data_in_decl will invalidate data needed
5844 for mangling. This breaks mangling on interdependent decls. */
5845 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5846 assign_assembler_name_if_needed (t
);
5848 /* Traverse every decl found freeing its language data. */
5849 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5850 free_lang_data_in_decl (t
);
5852 /* Traverse every type found freeing its language data. */
5853 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5854 free_lang_data_in_type (t
);
5857 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5863 /* Free resources that are used by FE but are not needed once they are done. */
5866 free_lang_data (void)
5870 /* If we are the LTO frontend we have freed lang-specific data already. */
5872 || (!flag_generate_lto
&& !flag_generate_offload
))
5875 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5876 if (vec_safe_is_empty (all_translation_units
))
5877 build_translation_unit_decl (NULL_TREE
);
5879 /* Allocate and assign alias sets to the standard integer types
5880 while the slots are still in the way the frontends generated them. */
5881 for (i
= 0; i
< itk_none
; ++i
)
5882 if (integer_types
[i
])
5883 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5885 /* Traverse the IL resetting language specific information for
5886 operands, expressions, etc. */
5887 free_lang_data_in_cgraph ();
5889 /* Create gimple variants for common types. */
5890 for (unsigned i
= 0;
5891 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5893 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5895 /* Reset some langhooks. Do not reset types_compatible_p, it may
5896 still be used indirectly via the get_alias_set langhook. */
5897 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5898 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5899 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5901 /* We do not want the default decl_assembler_name implementation,
5902 rather if we have fixed everything we want a wrapper around it
5903 asserting that all non-local symbols already got their assembler
5904 name and only produce assembler names for local symbols. Or rather
5905 make sure we never call decl_assembler_name on local symbols and
5906 devise a separate, middle-end private scheme for it. */
5908 /* Reset diagnostic machinery. */
5909 tree_diagnostics_defaults (global_dc
);
5917 const pass_data pass_data_ipa_free_lang_data
=
5919 SIMPLE_IPA_PASS
, /* type */
5920 "*free_lang_data", /* name */
5921 OPTGROUP_NONE
, /* optinfo_flags */
5922 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5923 0, /* properties_required */
5924 0, /* properties_provided */
5925 0, /* properties_destroyed */
5926 0, /* todo_flags_start */
5927 0, /* todo_flags_finish */
5930 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5933 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5934 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5937 /* opt_pass methods: */
5938 virtual unsigned int execute (function
*) { return free_lang_data (); }
5940 }; // class pass_ipa_free_lang_data
5944 simple_ipa_opt_pass
*
5945 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5947 return new pass_ipa_free_lang_data (ctxt
);
5950 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5951 of the various TYPE_QUAL values. */
5954 set_type_quals (tree type
, int type_quals
)
5956 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5957 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5958 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5959 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5960 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5963 /* Returns true iff CAND and BASE have equivalent language-specific
5967 check_lang_type (const_tree cand
, const_tree base
)
5969 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5971 /* type_hash_eq currently only applies to these types. */
5972 if (TREE_CODE (cand
) != FUNCTION_TYPE
5973 && TREE_CODE (cand
) != METHOD_TYPE
)
5975 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5978 /* Returns true iff unqualified CAND and BASE are equivalent. */
5981 check_base_type (const_tree cand
, const_tree base
)
5983 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5984 /* Apparently this is needed for Objective-C. */
5985 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5986 /* Check alignment. */
5987 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5988 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5989 TYPE_ATTRIBUTES (base
)));
5992 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5995 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5997 return (TYPE_QUALS (cand
) == type_quals
5998 && check_base_type (cand
, base
)
5999 && check_lang_type (cand
, base
));
6002 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6005 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6007 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6008 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6009 /* Apparently this is needed for Objective-C. */
6010 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6011 /* Check alignment. */
6012 && TYPE_ALIGN (cand
) == align
6013 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6014 TYPE_ATTRIBUTES (base
))
6015 && check_lang_type (cand
, base
));
6018 /* This function checks to see if TYPE matches the size one of the built-in
6019 atomic types, and returns that core atomic type. */
6022 find_atomic_core_type (tree type
)
6024 tree base_atomic_type
;
6026 /* Only handle complete types. */
6027 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6030 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6033 base_atomic_type
= atomicQI_type_node
;
6037 base_atomic_type
= atomicHI_type_node
;
6041 base_atomic_type
= atomicSI_type_node
;
6045 base_atomic_type
= atomicDI_type_node
;
6049 base_atomic_type
= atomicTI_type_node
;
6053 base_atomic_type
= NULL_TREE
;
6056 return base_atomic_type
;
6059 /* Return a version of the TYPE, qualified as indicated by the
6060 TYPE_QUALS, if one exists. If no qualified version exists yet,
6061 return NULL_TREE. */
6064 get_qualified_type (tree type
, int type_quals
)
6068 if (TYPE_QUALS (type
) == type_quals
)
6071 /* Search the chain of variants to see if there is already one there just
6072 like the one we need to have. If so, use that existing one. We must
6073 preserve the TYPE_NAME, since there is code that depends on this. */
6074 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6075 if (check_qualified_type (t
, type
, type_quals
))
6081 /* Like get_qualified_type, but creates the type if it does not
6082 exist. This function never returns NULL_TREE. */
6085 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6089 /* See if we already have the appropriate qualified variant. */
6090 t
= get_qualified_type (type
, type_quals
);
6092 /* If not, build it. */
6095 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6096 set_type_quals (t
, type_quals
);
6098 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6100 /* See if this object can map to a basic atomic type. */
6101 tree atomic_type
= find_atomic_core_type (type
);
6104 /* Ensure the alignment of this type is compatible with
6105 the required alignment of the atomic type. */
6106 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6107 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6111 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6112 /* Propagate structural equality. */
6113 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6114 else if (TYPE_CANONICAL (type
) != type
)
6115 /* Build the underlying canonical type, since it is different
6118 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6119 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6122 /* T is its own canonical type. */
6123 TYPE_CANONICAL (t
) = t
;
6130 /* Create a variant of type T with alignment ALIGN. */
6133 build_aligned_type (tree type
, unsigned int align
)
6137 if (TYPE_PACKED (type
)
6138 || TYPE_ALIGN (type
) == align
)
6141 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6142 if (check_aligned_type (t
, type
, align
))
6145 t
= build_variant_type_copy (type
);
6146 SET_TYPE_ALIGN (t
, align
);
6147 TYPE_USER_ALIGN (t
) = 1;
6152 /* Create a new distinct copy of TYPE. The new type is made its own
6153 MAIN_VARIANT. If TYPE requires structural equality checks, the
6154 resulting type requires structural equality checks; otherwise, its
6155 TYPE_CANONICAL points to itself. */
6158 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6160 tree t
= copy_node (type PASS_MEM_STAT
);
6162 TYPE_POINTER_TO (t
) = 0;
6163 TYPE_REFERENCE_TO (t
) = 0;
6165 /* Set the canonical type either to a new equivalence class, or
6166 propagate the need for structural equality checks. */
6167 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6168 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6170 TYPE_CANONICAL (t
) = t
;
6172 /* Make it its own variant. */
6173 TYPE_MAIN_VARIANT (t
) = t
;
6174 TYPE_NEXT_VARIANT (t
) = 0;
6176 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6177 whose TREE_TYPE is not t. This can also happen in the Ada
6178 frontend when using subtypes. */
6183 /* Create a new variant of TYPE, equivalent but distinct. This is so
6184 the caller can modify it. TYPE_CANONICAL for the return type will
6185 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6186 are considered equal by the language itself (or that both types
6187 require structural equality checks). */
6190 build_variant_type_copy (tree type MEM_STAT_DECL
)
6192 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6194 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6196 /* Since we're building a variant, assume that it is a non-semantic
6197 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6198 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6199 /* Type variants have no alias set defined. */
6200 TYPE_ALIAS_SET (t
) = -1;
6202 /* Add the new type to the chain of variants of TYPE. */
6203 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6204 TYPE_NEXT_VARIANT (m
) = t
;
6205 TYPE_MAIN_VARIANT (t
) = m
;
6210 /* Return true if the from tree in both tree maps are equal. */
6213 tree_map_base_eq (const void *va
, const void *vb
)
6215 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6216 *const b
= (const struct tree_map_base
*) vb
;
6217 return (a
->from
== b
->from
);
6220 /* Hash a from tree in a tree_base_map. */
6223 tree_map_base_hash (const void *item
)
6225 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6228 /* Return true if this tree map structure is marked for garbage collection
6229 purposes. We simply return true if the from tree is marked, so that this
6230 structure goes away when the from tree goes away. */
6233 tree_map_base_marked_p (const void *p
)
6235 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6238 /* Hash a from tree in a tree_map. */
6241 tree_map_hash (const void *item
)
6243 return (((const struct tree_map
*) item
)->hash
);
6246 /* Hash a from tree in a tree_decl_map. */
6249 tree_decl_map_hash (const void *item
)
6251 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6254 /* Return the initialization priority for DECL. */
6257 decl_init_priority_lookup (tree decl
)
6259 symtab_node
*snode
= symtab_node::get (decl
);
6262 return DEFAULT_INIT_PRIORITY
;
6264 snode
->get_init_priority ();
6267 /* Return the finalization priority for DECL. */
6270 decl_fini_priority_lookup (tree decl
)
6272 cgraph_node
*node
= cgraph_node::get (decl
);
6275 return DEFAULT_INIT_PRIORITY
;
6277 node
->get_fini_priority ();
6280 /* Set the initialization priority for DECL to PRIORITY. */
6283 decl_init_priority_insert (tree decl
, priority_type priority
)
6285 struct symtab_node
*snode
;
6287 if (priority
== DEFAULT_INIT_PRIORITY
)
6289 snode
= symtab_node::get (decl
);
6293 else if (VAR_P (decl
))
6294 snode
= varpool_node::get_create (decl
);
6296 snode
= cgraph_node::get_create (decl
);
6297 snode
->set_init_priority (priority
);
6300 /* Set the finalization priority for DECL to PRIORITY. */
6303 decl_fini_priority_insert (tree decl
, priority_type priority
)
6305 struct cgraph_node
*node
;
6307 if (priority
== DEFAULT_INIT_PRIORITY
)
6309 node
= cgraph_node::get (decl
);
6314 node
= cgraph_node::get_create (decl
);
6315 node
->set_fini_priority (priority
);
6318 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6321 print_debug_expr_statistics (void)
6323 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6324 (long) debug_expr_for_decl
->size (),
6325 (long) debug_expr_for_decl
->elements (),
6326 debug_expr_for_decl
->collisions ());
6329 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6332 print_value_expr_statistics (void)
6334 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6335 (long) value_expr_for_decl
->size (),
6336 (long) value_expr_for_decl
->elements (),
6337 value_expr_for_decl
->collisions ());
6340 /* Lookup a debug expression for FROM, and return it if we find one. */
6343 decl_debug_expr_lookup (tree from
)
6345 struct tree_decl_map
*h
, in
;
6346 in
.base
.from
= from
;
6348 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6354 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6357 decl_debug_expr_insert (tree from
, tree to
)
6359 struct tree_decl_map
*h
;
6361 h
= ggc_alloc
<tree_decl_map
> ();
6362 h
->base
.from
= from
;
6364 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6367 /* Lookup a value expression for FROM, and return it if we find one. */
6370 decl_value_expr_lookup (tree from
)
6372 struct tree_decl_map
*h
, in
;
6373 in
.base
.from
= from
;
6375 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6381 /* Insert a mapping FROM->TO in the value expression hashtable. */
6384 decl_value_expr_insert (tree from
, tree to
)
6386 struct tree_decl_map
*h
;
6388 h
= ggc_alloc
<tree_decl_map
> ();
6389 h
->base
.from
= from
;
6391 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6394 /* Lookup a vector of debug arguments for FROM, and return it if we
6398 decl_debug_args_lookup (tree from
)
6400 struct tree_vec_map
*h
, in
;
6402 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6404 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6405 in
.base
.from
= from
;
6406 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6412 /* Insert a mapping FROM->empty vector of debug arguments in the value
6413 expression hashtable. */
6416 decl_debug_args_insert (tree from
)
6418 struct tree_vec_map
*h
;
6421 if (DECL_HAS_DEBUG_ARGS_P (from
))
6422 return decl_debug_args_lookup (from
);
6423 if (debug_args_for_decl
== NULL
)
6424 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6425 h
= ggc_alloc
<tree_vec_map
> ();
6426 h
->base
.from
= from
;
6428 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6430 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6434 /* Hashing of types so that we don't make duplicates.
6435 The entry point is `type_hash_canon'. */
6437 /* Generate the default hash code for TYPE. This is designed for
6438 speed, rather than maximum entropy. */
6441 type_hash_canon_hash (tree type
)
6443 inchash::hash hstate
;
6445 hstate
.add_int (TREE_CODE (type
));
6447 if (TREE_TYPE (type
))
6448 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6450 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6451 /* Just the identifier is adequate to distinguish. */
6452 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6454 switch (TREE_CODE (type
))
6457 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6460 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6461 if (TREE_VALUE (t
) != error_mark_node
)
6462 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6466 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6471 if (TYPE_DOMAIN (type
))
6472 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6473 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6475 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6476 hstate
.add_object (typeless
);
6483 tree t
= TYPE_MAX_VALUE (type
);
6485 t
= TYPE_MIN_VALUE (type
);
6486 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6487 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6492 case FIXED_POINT_TYPE
:
6494 unsigned prec
= TYPE_PRECISION (type
);
6495 hstate
.add_object (prec
);
6501 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
6502 hstate
.add_object (nunits
);
6510 return hstate
.end ();
6513 /* These are the Hashtable callback functions. */
6515 /* Returns true iff the types are equivalent. */
6518 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6520 /* First test the things that are the same for all types. */
6521 if (a
->hash
!= b
->hash
6522 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6523 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6524 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6525 TYPE_ATTRIBUTES (b
->type
))
6526 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6527 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6530 /* Be careful about comparing arrays before and after the element type
6531 has been completed; don't compare TYPE_ALIGN unless both types are
6533 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6534 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6535 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6538 switch (TREE_CODE (a
->type
))
6543 case REFERENCE_TYPE
:
6548 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6551 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6552 && !(TYPE_VALUES (a
->type
)
6553 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6554 && TYPE_VALUES (b
->type
)
6555 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6556 && type_list_equal (TYPE_VALUES (a
->type
),
6557 TYPE_VALUES (b
->type
))))
6565 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6567 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6568 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6569 TYPE_MAX_VALUE (b
->type
)))
6570 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6571 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6572 TYPE_MIN_VALUE (b
->type
))));
6574 case FIXED_POINT_TYPE
:
6575 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6578 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6581 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6582 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6583 || (TYPE_ARG_TYPES (a
->type
)
6584 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6585 && TYPE_ARG_TYPES (b
->type
)
6586 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6587 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6588 TYPE_ARG_TYPES (b
->type
)))))
6592 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6593 where the flag should be inherited from the element type
6594 and can change after ARRAY_TYPEs are created; on non-aggregates
6595 compare it and hash it, scalars will never have that flag set
6596 and we need to differentiate between arrays created by different
6597 front-ends or middle-end created arrays. */
6598 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6599 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6600 || (TYPE_TYPELESS_STORAGE (a
->type
)
6601 == TYPE_TYPELESS_STORAGE (b
->type
))));
6605 case QUAL_UNION_TYPE
:
6606 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6607 || (TYPE_FIELDS (a
->type
)
6608 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6609 && TYPE_FIELDS (b
->type
)
6610 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6611 && type_list_equal (TYPE_FIELDS (a
->type
),
6612 TYPE_FIELDS (b
->type
))));
6615 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6616 || (TYPE_ARG_TYPES (a
->type
)
6617 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6618 && TYPE_ARG_TYPES (b
->type
)
6619 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6620 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6621 TYPE_ARG_TYPES (b
->type
))))
6629 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6630 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6635 /* Given TYPE, and HASHCODE its hash code, return the canonical
6636 object for an identical type if one already exists.
6637 Otherwise, return TYPE, and record it as the canonical object.
6639 To use this function, first create a type of the sort you want.
6640 Then compute its hash code from the fields of the type that
6641 make it different from other similar types.
6642 Then call this function and use the value. */
6645 type_hash_canon (unsigned int hashcode
, tree type
)
6650 /* The hash table only contains main variants, so ensure that's what we're
6652 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6654 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6655 must call that routine before comparing TYPE_ALIGNs. */
6661 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6664 tree t1
= ((type_hash
*) *loc
)->type
;
6665 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6666 if (TYPE_UID (type
) + 1 == next_type_uid
)
6668 /* Free also min/max values and the cache for integer
6669 types. This can't be done in free_node, as LTO frees
6670 those on its own. */
6671 if (TREE_CODE (type
) == INTEGER_TYPE
)
6673 if (TYPE_MIN_VALUE (type
)
6674 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6676 /* Zero is always in TYPE_CACHED_VALUES. */
6677 if (! TYPE_UNSIGNED (type
))
6678 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6679 ggc_free (TYPE_MIN_VALUE (type
));
6681 if (TYPE_MAX_VALUE (type
)
6682 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6684 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6685 ggc_free (TYPE_MAX_VALUE (type
));
6687 if (TYPE_CACHED_VALUES_P (type
))
6688 ggc_free (TYPE_CACHED_VALUES (type
));
6695 struct type_hash
*h
;
6697 h
= ggc_alloc
<type_hash
> ();
6707 print_type_hash_statistics (void)
6709 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6710 (long) type_hash_table
->size (),
6711 (long) type_hash_table
->elements (),
6712 type_hash_table
->collisions ());
6715 /* Given two lists of types
6716 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6717 return 1 if the lists contain the same types in the same order.
6718 Also, the TREE_PURPOSEs must match. */
6721 type_list_equal (const_tree l1
, const_tree l2
)
6725 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6726 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6727 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6728 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6729 && (TREE_TYPE (TREE_PURPOSE (t1
))
6730 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6736 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6737 given by TYPE. If the argument list accepts variable arguments,
6738 then this function counts only the ordinary arguments. */
6741 type_num_arguments (const_tree type
)
6746 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6747 /* If the function does not take a variable number of arguments,
6748 the last element in the list will have type `void'. */
6749 if (VOID_TYPE_P (TREE_VALUE (t
)))
6757 /* Nonzero if integer constants T1 and T2
6758 represent the same constant value. */
6761 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6766 if (t1
== 0 || t2
== 0)
6769 if (TREE_CODE (t1
) == INTEGER_CST
6770 && TREE_CODE (t2
) == INTEGER_CST
6771 && wi::to_widest (t1
) == wi::to_widest (t2
))
6777 /* Return true if T is an INTEGER_CST whose numerical value (extended
6778 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6781 tree_fits_shwi_p (const_tree t
)
6783 return (t
!= NULL_TREE
6784 && TREE_CODE (t
) == INTEGER_CST
6785 && wi::fits_shwi_p (wi::to_widest (t
)));
6788 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6789 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6792 tree_fits_poly_int64_p (const_tree t
)
6796 if (POLY_INT_CST_P (t
))
6798 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6799 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
6803 return (TREE_CODE (t
) == INTEGER_CST
6804 && wi::fits_shwi_p (wi::to_widest (t
)));
6807 /* Return true if T is an INTEGER_CST whose numerical value (extended
6808 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6811 tree_fits_uhwi_p (const_tree t
)
6813 return (t
!= NULL_TREE
6814 && TREE_CODE (t
) == INTEGER_CST
6815 && wi::fits_uhwi_p (wi::to_widest (t
)));
6818 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6819 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6822 tree_fits_poly_uint64_p (const_tree t
)
6826 if (POLY_INT_CST_P (t
))
6828 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6829 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
6833 return (TREE_CODE (t
) == INTEGER_CST
6834 && wi::fits_uhwi_p (wi::to_widest (t
)));
6837 /* T is an INTEGER_CST whose numerical value (extended according to
6838 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6842 tree_to_shwi (const_tree t
)
6844 gcc_assert (tree_fits_shwi_p (t
));
6845 return TREE_INT_CST_LOW (t
);
6848 /* T is an INTEGER_CST whose numerical value (extended according to
6849 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6852 unsigned HOST_WIDE_INT
6853 tree_to_uhwi (const_tree t
)
6855 gcc_assert (tree_fits_uhwi_p (t
));
6856 return TREE_INT_CST_LOW (t
);
6859 /* Return the most significant (sign) bit of T. */
6862 tree_int_cst_sign_bit (const_tree t
)
6864 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6866 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6869 /* Return an indication of the sign of the integer constant T.
6870 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6871 Note that -1 will never be returned if T's type is unsigned. */
6874 tree_int_cst_sgn (const_tree t
)
6876 if (wi::to_wide (t
) == 0)
6878 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6880 else if (wi::neg_p (wi::to_wide (t
)))
6886 /* Return the minimum number of bits needed to represent VALUE in a
6887 signed or unsigned type, UNSIGNEDP says which. */
6890 tree_int_cst_min_precision (tree value
, signop sgn
)
6892 /* If the value is negative, compute its negative minus 1. The latter
6893 adjustment is because the absolute value of the largest negative value
6894 is one larger than the largest positive value. This is equivalent to
6895 a bit-wise negation, so use that operation instead. */
6897 if (tree_int_cst_sgn (value
) < 0)
6898 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6900 /* Return the number of bits needed, taking into account the fact
6901 that we need one more bit for a signed than unsigned type.
6902 If value is 0 or -1, the minimum precision is 1 no matter
6903 whether unsignedp is true or false. */
6905 if (integer_zerop (value
))
6908 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6911 /* Return truthvalue of whether T1 is the same tree structure as T2.
6912 Return 1 if they are the same.
6913 Return 0 if they are understandably different.
6914 Return -1 if either contains tree structure not understood by
6918 simple_cst_equal (const_tree t1
, const_tree t2
)
6920 enum tree_code code1
, code2
;
6926 if (t1
== 0 || t2
== 0)
6929 code1
= TREE_CODE (t1
);
6930 code2
= TREE_CODE (t2
);
6932 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6934 if (CONVERT_EXPR_CODE_P (code2
)
6935 || code2
== NON_LVALUE_EXPR
)
6936 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6938 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6941 else if (CONVERT_EXPR_CODE_P (code2
)
6942 || code2
== NON_LVALUE_EXPR
)
6943 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6951 return wi::to_widest (t1
) == wi::to_widest (t2
);
6954 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6957 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6960 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6961 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6962 TREE_STRING_LENGTH (t1
)));
6966 unsigned HOST_WIDE_INT idx
;
6967 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6968 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6970 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6973 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6974 /* ??? Should we handle also fields here? */
6975 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6981 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6984 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6987 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6990 const_tree arg1
, arg2
;
6991 const_call_expr_arg_iterator iter1
, iter2
;
6992 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6993 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6995 arg1
= next_const_call_expr_arg (&iter1
),
6996 arg2
= next_const_call_expr_arg (&iter2
))
6998 cmp
= simple_cst_equal (arg1
, arg2
);
7002 return arg1
== arg2
;
7006 /* Special case: if either target is an unallocated VAR_DECL,
7007 it means that it's going to be unified with whatever the
7008 TARGET_EXPR is really supposed to initialize, so treat it
7009 as being equivalent to anything. */
7010 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7011 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7012 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7013 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7014 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7015 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7018 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7023 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7025 case WITH_CLEANUP_EXPR
:
7026 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7030 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7033 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7034 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7045 if (POLY_INT_CST_P (t1
))
7046 /* A false return means maybe_ne rather than known_ne. */
7047 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7048 TYPE_SIGN (TREE_TYPE (t1
))),
7049 poly_widest_int::from (poly_int_cst_value (t2
),
7050 TYPE_SIGN (TREE_TYPE (t2
))));
7054 /* This general rule works for most tree codes. All exceptions should be
7055 handled above. If this is a language-specific tree code, we can't
7056 trust what might be in the operand, so say we don't know
7058 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7061 switch (TREE_CODE_CLASS (code1
))
7065 case tcc_comparison
:
7066 case tcc_expression
:
7070 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7072 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7084 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7085 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7086 than U, respectively. */
7089 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7091 if (tree_int_cst_sgn (t
) < 0)
7093 else if (!tree_fits_uhwi_p (t
))
7095 else if (TREE_INT_CST_LOW (t
) == u
)
7097 else if (TREE_INT_CST_LOW (t
) < u
)
7103 /* Return true if SIZE represents a constant size that is in bounds of
7104 what the middle-end and the backend accepts (covering not more than
7105 half of the address-space). */
7108 valid_constant_size_p (const_tree size
)
7110 if (POLY_INT_CST_P (size
))
7112 if (TREE_OVERFLOW (size
))
7114 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7115 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7119 if (! tree_fits_uhwi_p (size
)
7120 || TREE_OVERFLOW (size
)
7121 || tree_int_cst_sign_bit (size
) != 0)
7126 /* Return the precision of the type, or for a complex or vector type the
7127 precision of the type of its elements. */
7130 element_precision (const_tree type
)
7133 type
= TREE_TYPE (type
);
7134 enum tree_code code
= TREE_CODE (type
);
7135 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7136 type
= TREE_TYPE (type
);
7138 return TYPE_PRECISION (type
);
7141 /* Return true if CODE represents an associative tree code. Otherwise
7144 associative_tree_code (enum tree_code code
)
7163 /* Return true if CODE represents a commutative tree code. Otherwise
7166 commutative_tree_code (enum tree_code code
)
7172 case MULT_HIGHPART_EXPR
:
7180 case UNORDERED_EXPR
:
7184 case TRUTH_AND_EXPR
:
7185 case TRUTH_XOR_EXPR
:
7187 case WIDEN_MULT_EXPR
:
7188 case VEC_WIDEN_MULT_HI_EXPR
:
7189 case VEC_WIDEN_MULT_LO_EXPR
:
7190 case VEC_WIDEN_MULT_EVEN_EXPR
:
7191 case VEC_WIDEN_MULT_ODD_EXPR
:
7200 /* Return true if CODE represents a ternary tree code for which the
7201 first two operands are commutative. Otherwise return false. */
7203 commutative_ternary_tree_code (enum tree_code code
)
7207 case WIDEN_MULT_PLUS_EXPR
:
7208 case WIDEN_MULT_MINUS_EXPR
:
7219 /* Returns true if CODE can overflow. */
7222 operation_can_overflow (enum tree_code code
)
7230 /* Can overflow in various ways. */
7232 case TRUNC_DIV_EXPR
:
7233 case EXACT_DIV_EXPR
:
7234 case FLOOR_DIV_EXPR
:
7236 /* For INT_MIN / -1. */
7243 /* These operators cannot overflow. */
7248 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7249 ftrapv doesn't generate trapping insns for CODE. */
7252 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7254 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7256 /* We don't generate instructions that trap on overflow for complex or vector
7258 if (!INTEGRAL_TYPE_P (type
))
7261 if (!TYPE_OVERFLOW_TRAPS (type
))
7271 /* These operators can overflow, and -ftrapv generates trapping code for
7274 case TRUNC_DIV_EXPR
:
7275 case EXACT_DIV_EXPR
:
7276 case FLOOR_DIV_EXPR
:
7279 /* These operators can overflow, but -ftrapv does not generate trapping
7283 /* These operators cannot overflow. */
7291 /* Generate a hash value for an expression. This can be used iteratively
7292 by passing a previous result as the HSTATE argument.
7294 This function is intended to produce the same hash for expressions which
7295 would compare equal using operand_equal_p. */
7297 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7300 enum tree_code code
;
7301 enum tree_code_class tclass
;
7303 if (t
== NULL_TREE
|| t
== error_mark_node
)
7305 hstate
.merge_hash (0);
7309 if (!(flags
& OEP_ADDRESS_OF
))
7312 code
= TREE_CODE (t
);
7316 /* Alas, constants aren't shared, so we can't rely on pointer
7319 hstate
.merge_hash (0);
7322 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7323 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7324 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7329 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7332 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7333 hstate
.merge_hash (val2
);
7338 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7339 hstate
.merge_hash (val2
);
7343 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7344 TREE_STRING_LENGTH (t
));
7347 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7348 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7352 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7353 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7354 unsigned int count
= vector_cst_encoded_nelts (t
);
7355 for (unsigned int i
= 0; i
< count
; ++i
)
7356 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7360 /* We can just compare by pointer. */
7361 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7363 case PLACEHOLDER_EXPR
:
7364 /* The node itself doesn't matter. */
7371 /* A list of expressions, for a CALL_EXPR or as the elements of a
7373 for (; t
; t
= TREE_CHAIN (t
))
7374 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7378 unsigned HOST_WIDE_INT idx
;
7380 flags
&= ~OEP_ADDRESS_OF
;
7381 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7383 inchash::add_expr (field
, hstate
, flags
);
7384 inchash::add_expr (value
, hstate
, flags
);
7388 case STATEMENT_LIST
:
7390 tree_stmt_iterator i
;
7391 for (i
= tsi_start (CONST_CAST_TREE (t
));
7392 !tsi_end_p (i
); tsi_next (&i
))
7393 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7397 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7398 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7401 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7402 Otherwise nodes that compare equal according to operand_equal_p might
7403 get different hash codes. However, don't do this for machine specific
7404 or front end builtins, since the function code is overloaded in those
7406 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7407 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7409 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7410 code
= TREE_CODE (t
);
7414 if (POLY_INT_CST_P (t
))
7416 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7417 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7420 tclass
= TREE_CODE_CLASS (code
);
7422 if (tclass
== tcc_declaration
)
7424 /* DECL's have a unique ID */
7425 hstate
.add_hwi (DECL_UID (t
));
7427 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7429 /* For comparisons that can be swapped, use the lower
7431 enum tree_code ccode
= swap_tree_comparison (code
);
7434 hstate
.add_object (ccode
);
7435 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7436 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7438 else if (CONVERT_EXPR_CODE_P (code
))
7440 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7442 enum tree_code ccode
= NOP_EXPR
;
7443 hstate
.add_object (ccode
);
7445 /* Don't hash the type, that can lead to having nodes which
7446 compare equal according to operand_equal_p, but which
7447 have different hash codes. Make sure to include signedness
7448 in the hash computation. */
7449 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7450 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7452 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7453 else if (code
== MEM_REF
7454 && (flags
& OEP_ADDRESS_OF
) != 0
7455 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7456 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7457 && integer_zerop (TREE_OPERAND (t
, 1)))
7458 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7460 /* Don't ICE on FE specific trees, or their arguments etc.
7461 during operand_equal_p hash verification. */
7462 else if (!IS_EXPR_CODE_CLASS (tclass
))
7463 gcc_assert (flags
& OEP_HASH_CHECK
);
7466 unsigned int sflags
= flags
;
7468 hstate
.add_object (code
);
7473 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7474 flags
|= OEP_ADDRESS_OF
;
7480 case TARGET_MEM_REF
:
7481 flags
&= ~OEP_ADDRESS_OF
;
7486 case ARRAY_RANGE_REF
:
7489 sflags
&= ~OEP_ADDRESS_OF
;
7493 flags
&= ~OEP_ADDRESS_OF
;
7497 case WIDEN_MULT_PLUS_EXPR
:
7498 case WIDEN_MULT_MINUS_EXPR
:
7500 /* The multiplication operands are commutative. */
7501 inchash::hash one
, two
;
7502 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7503 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7504 hstate
.add_commutative (one
, two
);
7505 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7510 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7511 hstate
.add_int (CALL_EXPR_IFN (t
));
7515 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7516 Usually different TARGET_EXPRs just should use
7517 different temporaries in their slots. */
7518 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7525 /* Don't hash the type, that can lead to having nodes which
7526 compare equal according to operand_equal_p, but which
7527 have different hash codes. */
7528 if (code
== NON_LVALUE_EXPR
)
7530 /* Make sure to include signness in the hash computation. */
7531 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7532 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7535 else if (commutative_tree_code (code
))
7537 /* It's a commutative expression. We want to hash it the same
7538 however it appears. We do this by first hashing both operands
7539 and then rehashing based on the order of their independent
7541 inchash::hash one
, two
;
7542 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7543 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7544 hstate
.add_commutative (one
, two
);
7547 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7548 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7549 i
== 0 ? flags
: sflags
);
7557 /* Constructors for pointer, array and function types.
7558 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7559 constructed by language-dependent code, not here.) */
7561 /* Construct, lay out and return the type of pointers to TO_TYPE with
7562 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7563 reference all of memory. If such a type has already been
7564 constructed, reuse it. */
7567 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7571 bool could_alias
= can_alias_all
;
7573 if (to_type
== error_mark_node
)
7574 return error_mark_node
;
7576 /* If the pointed-to type has the may_alias attribute set, force
7577 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7578 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7579 can_alias_all
= true;
7581 /* In some cases, languages will have things that aren't a POINTER_TYPE
7582 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7583 In that case, return that type without regard to the rest of our
7586 ??? This is a kludge, but consistent with the way this function has
7587 always operated and there doesn't seem to be a good way to avoid this
7589 if (TYPE_POINTER_TO (to_type
) != 0
7590 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7591 return TYPE_POINTER_TO (to_type
);
7593 /* First, if we already have a type for pointers to TO_TYPE and it's
7594 the proper mode, use it. */
7595 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7596 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7599 t
= make_node (POINTER_TYPE
);
7601 TREE_TYPE (t
) = to_type
;
7602 SET_TYPE_MODE (t
, mode
);
7603 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7604 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7605 TYPE_POINTER_TO (to_type
) = t
;
7607 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7608 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7609 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7610 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7612 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7615 /* Lay out the type. This function has many callers that are concerned
7616 with expression-construction, and this simplifies them all. */
7622 /* By default build pointers in ptr_mode. */
7625 build_pointer_type (tree to_type
)
7627 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7628 : TYPE_ADDR_SPACE (to_type
);
7629 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7630 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7633 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7636 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7640 bool could_alias
= can_alias_all
;
7642 if (to_type
== error_mark_node
)
7643 return error_mark_node
;
7645 /* If the pointed-to type has the may_alias attribute set, force
7646 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7647 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7648 can_alias_all
= true;
7650 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7651 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7652 In that case, return that type without regard to the rest of our
7655 ??? This is a kludge, but consistent with the way this function has
7656 always operated and there doesn't seem to be a good way to avoid this
7658 if (TYPE_REFERENCE_TO (to_type
) != 0
7659 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7660 return TYPE_REFERENCE_TO (to_type
);
7662 /* First, if we already have a type for pointers to TO_TYPE and it's
7663 the proper mode, use it. */
7664 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7665 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7668 t
= make_node (REFERENCE_TYPE
);
7670 TREE_TYPE (t
) = to_type
;
7671 SET_TYPE_MODE (t
, mode
);
7672 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7673 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7674 TYPE_REFERENCE_TO (to_type
) = t
;
7676 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7677 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7678 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7679 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7681 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7690 /* Build the node for the type of references-to-TO_TYPE by default
7694 build_reference_type (tree to_type
)
7696 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7697 : TYPE_ADDR_SPACE (to_type
);
7698 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7699 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7702 #define MAX_INT_CACHED_PREC \
7703 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7704 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7706 /* Builds a signed or unsigned integer type of precision PRECISION.
7707 Used for C bitfields whose precision does not match that of
7708 built-in target types. */
7710 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7716 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7718 if (precision
<= MAX_INT_CACHED_PREC
)
7720 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7725 itype
= make_node (INTEGER_TYPE
);
7726 TYPE_PRECISION (itype
) = precision
;
7729 fixup_unsigned_type (itype
);
7731 fixup_signed_type (itype
);
7735 inchash::hash hstate
;
7736 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7737 ret
= type_hash_canon (hstate
.end (), itype
);
7738 if (precision
<= MAX_INT_CACHED_PREC
)
7739 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7744 #define MAX_BOOL_CACHED_PREC \
7745 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7746 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7748 /* Builds a boolean type of precision PRECISION.
7749 Used for boolean vectors to choose proper vector element size. */
7751 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7755 if (precision
<= MAX_BOOL_CACHED_PREC
)
7757 type
= nonstandard_boolean_type_cache
[precision
];
7762 type
= make_node (BOOLEAN_TYPE
);
7763 TYPE_PRECISION (type
) = precision
;
7764 fixup_signed_type (type
);
7766 if (precision
<= MAX_INT_CACHED_PREC
)
7767 nonstandard_boolean_type_cache
[precision
] = type
;
7772 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7773 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7774 is true, reuse such a type that has already been constructed. */
7777 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7779 tree itype
= make_node (INTEGER_TYPE
);
7781 TREE_TYPE (itype
) = type
;
7783 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7784 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7786 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7787 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7788 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7789 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7790 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7791 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7792 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7797 if ((TYPE_MIN_VALUE (itype
)
7798 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7799 || (TYPE_MAX_VALUE (itype
)
7800 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7802 /* Since we cannot reliably merge this type, we need to compare it using
7803 structural equality checks. */
7804 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7808 hashval_t hash
= type_hash_canon_hash (itype
);
7809 itype
= type_hash_canon (hash
, itype
);
7814 /* Wrapper around build_range_type_1 with SHARED set to true. */
7817 build_range_type (tree type
, tree lowval
, tree highval
)
7819 return build_range_type_1 (type
, lowval
, highval
, true);
7822 /* Wrapper around build_range_type_1 with SHARED set to false. */
7825 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7827 return build_range_type_1 (type
, lowval
, highval
, false);
7830 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7831 MAXVAL should be the maximum value in the domain
7832 (one less than the length of the array).
7834 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7835 We don't enforce this limit, that is up to caller (e.g. language front end).
7836 The limit exists because the result is a signed type and we don't handle
7837 sizes that use more than one HOST_WIDE_INT. */
7840 build_index_type (tree maxval
)
7842 return build_range_type (sizetype
, size_zero_node
, maxval
);
7845 /* Return true if the debug information for TYPE, a subtype, should be emitted
7846 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7847 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7848 debug info and doesn't reflect the source code. */
7851 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7853 tree base_type
= TREE_TYPE (type
), low
, high
;
7855 /* Subrange types have a base type which is an integral type. */
7856 if (!INTEGRAL_TYPE_P (base_type
))
7859 /* Get the real bounds of the subtype. */
7860 if (lang_hooks
.types
.get_subrange_bounds
)
7861 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7864 low
= TYPE_MIN_VALUE (type
);
7865 high
= TYPE_MAX_VALUE (type
);
7868 /* If the type and its base type have the same representation and the same
7869 name, then the type is not a subrange but a copy of the base type. */
7870 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7871 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7872 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7873 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7874 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7875 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7885 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7886 and number of elements specified by the range of values of INDEX_TYPE.
7887 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7888 If SHARED is true, reuse such a type that has already been constructed. */
7891 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7896 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7898 error ("arrays of functions are not meaningful");
7899 elt_type
= integer_type_node
;
7902 t
= make_node (ARRAY_TYPE
);
7903 TREE_TYPE (t
) = elt_type
;
7904 TYPE_DOMAIN (t
) = index_type
;
7905 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7906 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7909 /* If the element type is incomplete at this point we get marked for
7910 structural equality. Do not record these types in the canonical
7912 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7917 hashval_t hash
= type_hash_canon_hash (t
);
7918 t
= type_hash_canon (hash
, t
);
7921 if (TYPE_CANONICAL (t
) == t
)
7923 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7924 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7926 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7927 else if (TYPE_CANONICAL (elt_type
) != elt_type
7928 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7930 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7932 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7933 typeless_storage
, shared
);
7939 /* Wrapper around build_array_type_1 with SHARED set to true. */
7942 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7944 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7947 /* Wrapper around build_array_type_1 with SHARED set to false. */
7950 build_nonshared_array_type (tree elt_type
, tree index_type
)
7952 return build_array_type_1 (elt_type
, index_type
, false, false);
7955 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7959 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
7961 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7964 /* Recursively examines the array elements of TYPE, until a non-array
7965 element type is found. */
7968 strip_array_types (tree type
)
7970 while (TREE_CODE (type
) == ARRAY_TYPE
)
7971 type
= TREE_TYPE (type
);
7976 /* Computes the canonical argument types from the argument type list
7979 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7980 on entry to this function, or if any of the ARGTYPES are
7983 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7984 true on entry to this function, or if any of the ARGTYPES are
7987 Returns a canonical argument list, which may be ARGTYPES when the
7988 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7989 true) or would not differ from ARGTYPES. */
7992 maybe_canonicalize_argtypes (tree argtypes
,
7993 bool *any_structural_p
,
7994 bool *any_noncanonical_p
)
7997 bool any_noncanonical_argtypes_p
= false;
7999 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8001 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8002 /* Fail gracefully by stating that the type is structural. */
8003 *any_structural_p
= true;
8004 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8005 *any_structural_p
= true;
8006 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8007 || TREE_PURPOSE (arg
))
8008 /* If the argument has a default argument, we consider it
8009 non-canonical even though the type itself is canonical.
8010 That way, different variants of function and method types
8011 with default arguments will all point to the variant with
8012 no defaults as their canonical type. */
8013 any_noncanonical_argtypes_p
= true;
8016 if (*any_structural_p
)
8019 if (any_noncanonical_argtypes_p
)
8021 /* Build the canonical list of argument types. */
8022 tree canon_argtypes
= NULL_TREE
;
8023 bool is_void
= false;
8025 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8027 if (arg
== void_list_node
)
8030 canon_argtypes
= tree_cons (NULL_TREE
,
8031 TYPE_CANONICAL (TREE_VALUE (arg
)),
8035 canon_argtypes
= nreverse (canon_argtypes
);
8037 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8039 /* There is a non-canonical type. */
8040 *any_noncanonical_p
= true;
8041 return canon_argtypes
;
8044 /* The canonical argument types are the same as ARGTYPES. */
8048 /* Construct, lay out and return
8049 the type of functions returning type VALUE_TYPE
8050 given arguments of types ARG_TYPES.
8051 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8052 are data type nodes for the arguments of the function.
8053 If such a type has already been constructed, reuse it. */
8056 build_function_type (tree value_type
, tree arg_types
)
8059 inchash::hash hstate
;
8060 bool any_structural_p
, any_noncanonical_p
;
8061 tree canon_argtypes
;
8063 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8065 error ("function return type cannot be function");
8066 value_type
= integer_type_node
;
8069 /* Make a node of the sort we want. */
8070 t
= make_node (FUNCTION_TYPE
);
8071 TREE_TYPE (t
) = value_type
;
8072 TYPE_ARG_TYPES (t
) = arg_types
;
8074 /* If we already have such a type, use the old one. */
8075 hashval_t hash
= type_hash_canon_hash (t
);
8076 t
= type_hash_canon (hash
, t
);
8078 /* Set up the canonical type. */
8079 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8080 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8081 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8083 &any_noncanonical_p
);
8084 if (any_structural_p
)
8085 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8086 else if (any_noncanonical_p
)
8087 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8090 if (!COMPLETE_TYPE_P (t
))
8095 /* Build a function type. The RETURN_TYPE is the type returned by the
8096 function. If VAARGS is set, no void_type_node is appended to the
8097 list. ARGP must be always be terminated be a NULL_TREE. */
8100 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8104 t
= va_arg (argp
, tree
);
8105 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8106 args
= tree_cons (NULL_TREE
, t
, args
);
8111 if (args
!= NULL_TREE
)
8112 args
= nreverse (args
);
8113 gcc_assert (last
!= void_list_node
);
8115 else if (args
== NULL_TREE
)
8116 args
= void_list_node
;
8120 args
= nreverse (args
);
8121 TREE_CHAIN (last
) = void_list_node
;
8123 args
= build_function_type (return_type
, args
);
8128 /* Build a function type. The RETURN_TYPE is the type returned by the
8129 function. If additional arguments are provided, they are
8130 additional argument types. The list of argument types must always
8131 be terminated by NULL_TREE. */
8134 build_function_type_list (tree return_type
, ...)
8139 va_start (p
, return_type
);
8140 args
= build_function_type_list_1 (false, return_type
, p
);
8145 /* Build a variable argument function type. The RETURN_TYPE is the
8146 type returned by the function. If additional arguments are provided,
8147 they are additional argument types. The list of argument types must
8148 always be terminated by NULL_TREE. */
8151 build_varargs_function_type_list (tree return_type
, ...)
8156 va_start (p
, return_type
);
8157 args
= build_function_type_list_1 (true, return_type
, p
);
8163 /* Build a function type. RETURN_TYPE is the type returned by the
8164 function; VAARGS indicates whether the function takes varargs. The
8165 function takes N named arguments, the types of which are provided in
8169 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8173 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8175 for (i
= n
- 1; i
>= 0; i
--)
8176 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8178 return build_function_type (return_type
, t
);
8181 /* Build a function type. RETURN_TYPE is the type returned by the
8182 function. The function takes N named arguments, the types of which
8183 are provided in ARG_TYPES. */
8186 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8188 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8191 /* Build a variable argument function type. RETURN_TYPE is the type
8192 returned by the function. The function takes N named arguments, the
8193 types of which are provided in ARG_TYPES. */
8196 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8198 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8201 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8202 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8203 for the method. An implicit additional parameter (of type
8204 pointer-to-BASETYPE) is added to the ARGTYPES. */
8207 build_method_type_directly (tree basetype
,
8213 bool any_structural_p
, any_noncanonical_p
;
8214 tree canon_argtypes
;
8216 /* Make a node of the sort we want. */
8217 t
= make_node (METHOD_TYPE
);
8219 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8220 TREE_TYPE (t
) = rettype
;
8221 ptype
= build_pointer_type (basetype
);
8223 /* The actual arglist for this function includes a "hidden" argument
8224 which is "this". Put it into the list of argument types. */
8225 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8226 TYPE_ARG_TYPES (t
) = argtypes
;
8228 /* If we already have such a type, use the old one. */
8229 hashval_t hash
= type_hash_canon_hash (t
);
8230 t
= type_hash_canon (hash
, t
);
8232 /* Set up the canonical type. */
8234 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8235 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8237 = (TYPE_CANONICAL (basetype
) != basetype
8238 || TYPE_CANONICAL (rettype
) != rettype
);
8239 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8241 &any_noncanonical_p
);
8242 if (any_structural_p
)
8243 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8244 else if (any_noncanonical_p
)
8246 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8247 TYPE_CANONICAL (rettype
),
8249 if (!COMPLETE_TYPE_P (t
))
8255 /* Construct, lay out and return the type of methods belonging to class
8256 BASETYPE and whose arguments and values are described by TYPE.
8257 If that type exists already, reuse it.
8258 TYPE must be a FUNCTION_TYPE node. */
8261 build_method_type (tree basetype
, tree type
)
8263 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8265 return build_method_type_directly (basetype
,
8267 TYPE_ARG_TYPES (type
));
8270 /* Construct, lay out and return the type of offsets to a value
8271 of type TYPE, within an object of type BASETYPE.
8272 If a suitable offset type exists already, reuse it. */
8275 build_offset_type (tree basetype
, tree type
)
8279 /* Make a node of the sort we want. */
8280 t
= make_node (OFFSET_TYPE
);
8282 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8283 TREE_TYPE (t
) = type
;
8285 /* If we already have such a type, use the old one. */
8286 hashval_t hash
= type_hash_canon_hash (t
);
8287 t
= type_hash_canon (hash
, t
);
8289 if (!COMPLETE_TYPE_P (t
))
8292 if (TYPE_CANONICAL (t
) == t
)
8294 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8295 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8296 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8297 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8298 || TYPE_CANONICAL (type
) != type
)
8300 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8301 TYPE_CANONICAL (type
));
8307 /* Create a complex type whose components are COMPONENT_TYPE.
8309 If NAMED is true, the type is given a TYPE_NAME. We do not always
8310 do so because this creates a DECL node and thus make the DECL_UIDs
8311 dependent on the type canonicalization hashtable, which is GC-ed,
8312 so the DECL_UIDs would not be stable wrt garbage collection. */
8315 build_complex_type (tree component_type
, bool named
)
8317 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8318 || SCALAR_FLOAT_TYPE_P (component_type
)
8319 || FIXED_POINT_TYPE_P (component_type
));
8321 /* Make a node of the sort we want. */
8322 tree probe
= make_node (COMPLEX_TYPE
);
8324 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8326 /* If we already have such a type, use the old one. */
8327 hashval_t hash
= type_hash_canon_hash (probe
);
8328 tree t
= type_hash_canon (hash
, probe
);
8332 /* We created a new type. The hash insertion will have laid
8333 out the type. We need to check the canonicalization and
8334 maybe set the name. */
8335 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8337 && TYPE_CANONICAL (t
) == t
);
8339 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8340 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8341 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8343 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8345 /* We need to create a name, since complex is a fundamental type. */
8348 const char *name
= NULL
;
8350 if (TREE_TYPE (t
) == char_type_node
)
8351 name
= "complex char";
8352 else if (TREE_TYPE (t
) == signed_char_type_node
)
8353 name
= "complex signed char";
8354 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8355 name
= "complex unsigned char";
8356 else if (TREE_TYPE (t
) == short_integer_type_node
)
8357 name
= "complex short int";
8358 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8359 name
= "complex short unsigned int";
8360 else if (TREE_TYPE (t
) == integer_type_node
)
8361 name
= "complex int";
8362 else if (TREE_TYPE (t
) == unsigned_type_node
)
8363 name
= "complex unsigned int";
8364 else if (TREE_TYPE (t
) == long_integer_type_node
)
8365 name
= "complex long int";
8366 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8367 name
= "complex long unsigned int";
8368 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8369 name
= "complex long long int";
8370 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8371 name
= "complex long long unsigned int";
8374 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8375 get_identifier (name
), t
);
8379 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8382 /* If TYPE is a real or complex floating-point type and the target
8383 does not directly support arithmetic on TYPE then return the wider
8384 type to be used for arithmetic on TYPE. Otherwise, return
8388 excess_precision_type (tree type
)
8390 /* The target can give two different responses to the question of
8391 which excess precision mode it would like depending on whether we
8392 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8394 enum excess_precision_type requested_type
8395 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8396 ? EXCESS_PRECISION_TYPE_FAST
8397 : EXCESS_PRECISION_TYPE_STANDARD
);
8399 enum flt_eval_method target_flt_eval_method
8400 = targetm
.c
.excess_precision (requested_type
);
8402 /* The target should not ask for unpredictable float evaluation (though
8403 it might advertise that implicitly the evaluation is unpredictable,
8404 but we don't care about that here, it will have been reported
8405 elsewhere). If it does ask for unpredictable evaluation, we have
8406 nothing to do here. */
8407 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8409 /* Nothing to do. The target has asked for all types we know about
8410 to be computed with their native precision and range. */
8411 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8414 /* The target will promote this type in a target-dependent way, so excess
8415 precision ought to leave it alone. */
8416 if (targetm
.promoted_type (type
) != NULL_TREE
)
8419 machine_mode float16_type_mode
= (float16_type_node
8420 ? TYPE_MODE (float16_type_node
)
8422 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8423 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8425 switch (TREE_CODE (type
))
8429 machine_mode type_mode
= TYPE_MODE (type
);
8430 switch (target_flt_eval_method
)
8432 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8433 if (type_mode
== float16_type_mode
)
8434 return float_type_node
;
8436 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8437 if (type_mode
== float16_type_mode
8438 || type_mode
== float_type_mode
)
8439 return double_type_node
;
8441 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8442 if (type_mode
== float16_type_mode
8443 || type_mode
== float_type_mode
8444 || type_mode
== double_type_mode
)
8445 return long_double_type_node
;
8454 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8456 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8457 switch (target_flt_eval_method
)
8459 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8460 if (type_mode
== float16_type_mode
)
8461 return complex_float_type_node
;
8463 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8464 if (type_mode
== float16_type_mode
8465 || type_mode
== float_type_mode
)
8466 return complex_double_type_node
;
8468 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8469 if (type_mode
== float16_type_mode
8470 || type_mode
== float_type_mode
8471 || type_mode
== double_type_mode
)
8472 return complex_long_double_type_node
;
8486 /* Return OP, stripped of any conversions to wider types as much as is safe.
8487 Converting the value back to OP's type makes a value equivalent to OP.
8489 If FOR_TYPE is nonzero, we return a value which, if converted to
8490 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8492 OP must have integer, real or enumeral type. Pointers are not allowed!
8494 There are some cases where the obvious value we could return
8495 would regenerate to OP if converted to OP's type,
8496 but would not extend like OP to wider types.
8497 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8498 For example, if OP is (unsigned short)(signed char)-1,
8499 we avoid returning (signed char)-1 if FOR_TYPE is int,
8500 even though extending that to an unsigned short would regenerate OP,
8501 since the result of extending (signed char)-1 to (int)
8502 is different from (int) OP. */
8505 get_unwidened (tree op
, tree for_type
)
8507 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8508 tree type
= TREE_TYPE (op
);
8510 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8512 = (for_type
!= 0 && for_type
!= type
8513 && final_prec
> TYPE_PRECISION (type
)
8514 && TYPE_UNSIGNED (type
));
8517 while (CONVERT_EXPR_P (op
))
8521 /* TYPE_PRECISION on vector types has different meaning
8522 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8523 so avoid them here. */
8524 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8527 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8528 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8530 /* Truncations are many-one so cannot be removed.
8531 Unless we are later going to truncate down even farther. */
8533 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8536 /* See what's inside this conversion. If we decide to strip it,
8538 op
= TREE_OPERAND (op
, 0);
8540 /* If we have not stripped any zero-extensions (uns is 0),
8541 we can strip any kind of extension.
8542 If we have previously stripped a zero-extension,
8543 only zero-extensions can safely be stripped.
8544 Any extension can be stripped if the bits it would produce
8545 are all going to be discarded later by truncating to FOR_TYPE. */
8549 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8551 /* TYPE_UNSIGNED says whether this is a zero-extension.
8552 Let's avoid computing it if it does not affect WIN
8553 and if UNS will not be needed again. */
8555 || CONVERT_EXPR_P (op
))
8556 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8564 /* If we finally reach a constant see if it fits in sth smaller and
8565 in that case convert it. */
8566 if (TREE_CODE (win
) == INTEGER_CST
)
8568 tree wtype
= TREE_TYPE (win
);
8569 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8571 prec
= MAX (prec
, final_prec
);
8572 if (prec
< TYPE_PRECISION (wtype
))
8574 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8575 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8576 win
= fold_convert (t
, win
);
8583 /* Return OP or a simpler expression for a narrower value
8584 which can be sign-extended or zero-extended to give back OP.
8585 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8586 or 0 if the value should be sign-extended. */
8589 get_narrower (tree op
, int *unsignedp_ptr
)
8594 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8596 while (TREE_CODE (op
) == NOP_EXPR
)
8599 = (TYPE_PRECISION (TREE_TYPE (op
))
8600 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8602 /* Truncations are many-one so cannot be removed. */
8606 /* See what's inside this conversion. If we decide to strip it,
8611 op
= TREE_OPERAND (op
, 0);
8612 /* An extension: the outermost one can be stripped,
8613 but remember whether it is zero or sign extension. */
8615 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8616 /* Otherwise, if a sign extension has been stripped,
8617 only sign extensions can now be stripped;
8618 if a zero extension has been stripped, only zero-extensions. */
8619 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8623 else /* bitschange == 0 */
8625 /* A change in nominal type can always be stripped, but we must
8626 preserve the unsignedness. */
8628 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8630 op
= TREE_OPERAND (op
, 0);
8631 /* Keep trying to narrow, but don't assign op to win if it
8632 would turn an integral type into something else. */
8633 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8640 if (TREE_CODE (op
) == COMPONENT_REF
8641 /* Since type_for_size always gives an integer type. */
8642 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8643 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8644 /* Ensure field is laid out already. */
8645 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8646 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8648 unsigned HOST_WIDE_INT innerprec
8649 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8650 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8651 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8652 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8654 /* We can get this structure field in a narrower type that fits it,
8655 but the resulting extension to its nominal type (a fullword type)
8656 must satisfy the same conditions as for other extensions.
8658 Do this only for fields that are aligned (not bit-fields),
8659 because when bit-field insns will be used there is no
8660 advantage in doing this. */
8662 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8663 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8664 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8668 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8669 win
= fold_convert (type
, op
);
8673 *unsignedp_ptr
= uns
;
8677 /* Return true if integer constant C has a value that is permissible
8678 for TYPE, an integral type. */
8681 int_fits_type_p (const_tree c
, const_tree type
)
8683 tree type_low_bound
, type_high_bound
;
8684 bool ok_for_low_bound
, ok_for_high_bound
;
8685 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8687 /* Non-standard boolean types can have arbitrary precision but various
8688 transformations assume that they can only take values 0 and +/-1. */
8689 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8690 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8693 type_low_bound
= TYPE_MIN_VALUE (type
);
8694 type_high_bound
= TYPE_MAX_VALUE (type
);
8696 /* If at least one bound of the type is a constant integer, we can check
8697 ourselves and maybe make a decision. If no such decision is possible, but
8698 this type is a subtype, try checking against that. Otherwise, use
8699 fits_to_tree_p, which checks against the precision.
8701 Compute the status for each possibly constant bound, and return if we see
8702 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8703 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8704 for "constant known to fit". */
8706 /* Check if c >= type_low_bound. */
8707 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8709 if (tree_int_cst_lt (c
, type_low_bound
))
8711 ok_for_low_bound
= true;
8714 ok_for_low_bound
= false;
8716 /* Check if c <= type_high_bound. */
8717 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8719 if (tree_int_cst_lt (type_high_bound
, c
))
8721 ok_for_high_bound
= true;
8724 ok_for_high_bound
= false;
8726 /* If the constant fits both bounds, the result is known. */
8727 if (ok_for_low_bound
&& ok_for_high_bound
)
8730 /* Perform some generic filtering which may allow making a decision
8731 even if the bounds are not constant. First, negative integers
8732 never fit in unsigned types, */
8733 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8736 /* Second, narrower types always fit in wider ones. */
8737 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8740 /* Third, unsigned integers with top bit set never fit signed types. */
8741 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8743 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8744 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8746 /* When a tree_cst is converted to a wide-int, the precision
8747 is taken from the type. However, if the precision of the
8748 mode underneath the type is smaller than that, it is
8749 possible that the value will not fit. The test below
8750 fails if any bit is set between the sign bit of the
8751 underlying mode and the top bit of the type. */
8752 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8755 else if (wi::neg_p (wi::to_wide (c
)))
8759 /* If we haven't been able to decide at this point, there nothing more we
8760 can check ourselves here. Look at the base type if we have one and it
8761 has the same precision. */
8762 if (TREE_CODE (type
) == INTEGER_TYPE
8763 && TREE_TYPE (type
) != 0
8764 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8766 type
= TREE_TYPE (type
);
8770 /* Or to fits_to_tree_p, if nothing else. */
8771 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8774 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8775 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8776 represented (assuming two's-complement arithmetic) within the bit
8777 precision of the type are returned instead. */
8780 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8782 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8783 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8784 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8787 if (TYPE_UNSIGNED (type
))
8788 mpz_set_ui (min
, 0);
8791 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8792 wi::to_mpz (mn
, min
, SIGNED
);
8796 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8797 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8798 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8801 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8802 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8806 /* Return true if VAR is an automatic variable defined in function FN. */
8809 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8811 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8812 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8813 || TREE_CODE (var
) == PARM_DECL
)
8814 && ! TREE_STATIC (var
))
8815 || TREE_CODE (var
) == LABEL_DECL
8816 || TREE_CODE (var
) == RESULT_DECL
));
8819 /* Subprogram of following function. Called by walk_tree.
8821 Return *TP if it is an automatic variable or parameter of the
8822 function passed in as DATA. */
8825 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8827 tree fn
= (tree
) data
;
8832 else if (DECL_P (*tp
)
8833 && auto_var_in_fn_p (*tp
, fn
))
8839 /* Returns true if T is, contains, or refers to a type with variable
8840 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8841 arguments, but not the return type. If FN is nonzero, only return
8842 true if a modifier of the type or position of FN is a variable or
8843 parameter inside FN.
8845 This concept is more general than that of C99 'variably modified types':
8846 in C99, a struct type is never variably modified because a VLA may not
8847 appear as a structure member. However, in GNU C code like:
8849 struct S { int i[f()]; };
8851 is valid, and other languages may define similar constructs. */
8854 variably_modified_type_p (tree type
, tree fn
)
8858 /* Test if T is either variable (if FN is zero) or an expression containing
8859 a variable in FN. If TYPE isn't gimplified, return true also if
8860 gimplify_one_sizepos would gimplify the expression into a local
8862 #define RETURN_TRUE_IF_VAR(T) \
8863 do { tree _t = (T); \
8864 if (_t != NULL_TREE \
8865 && _t != error_mark_node \
8866 && TREE_CODE (_t) != INTEGER_CST \
8867 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8869 || (!TYPE_SIZES_GIMPLIFIED (type) \
8870 && !is_gimple_sizepos (_t)) \
8871 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8872 return true; } while (0)
8874 if (type
== error_mark_node
)
8877 /* If TYPE itself has variable size, it is variably modified. */
8878 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8879 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8881 switch (TREE_CODE (type
))
8884 case REFERENCE_TYPE
:
8886 /* Ada can have pointer types refering to themselves indirectly. */
8887 if (TREE_VISITED (type
))
8889 TREE_VISITED (type
) = true;
8890 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8892 TREE_VISITED (type
) = false;
8895 TREE_VISITED (type
) = false;
8900 /* If TYPE is a function type, it is variably modified if the
8901 return type is variably modified. */
8902 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8908 case FIXED_POINT_TYPE
:
8911 /* Scalar types are variably modified if their end points
8913 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8914 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8919 case QUAL_UNION_TYPE
:
8920 /* We can't see if any of the fields are variably-modified by the
8921 definition we normally use, since that would produce infinite
8922 recursion via pointers. */
8923 /* This is variably modified if some field's type is. */
8924 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8925 if (TREE_CODE (t
) == FIELD_DECL
)
8927 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8928 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8929 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8931 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8932 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8937 /* Do not call ourselves to avoid infinite recursion. This is
8938 variably modified if the element type is. */
8939 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8940 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8947 /* The current language may have other cases to check, but in general,
8948 all other types are not variably modified. */
8949 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8951 #undef RETURN_TRUE_IF_VAR
8954 /* Given a DECL or TYPE, return the scope in which it was declared, or
8955 NULL_TREE if there is no containing scope. */
8958 get_containing_scope (const_tree t
)
8960 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8963 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8966 get_ultimate_context (const_tree decl
)
8968 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8970 if (TREE_CODE (decl
) == BLOCK
)
8971 decl
= BLOCK_SUPERCONTEXT (decl
);
8973 decl
= get_containing_scope (decl
);
8978 /* Return the innermost context enclosing DECL that is
8979 a FUNCTION_DECL, or zero if none. */
8982 decl_function_context (const_tree decl
)
8986 if (TREE_CODE (decl
) == ERROR_MARK
)
8989 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8990 where we look up the function at runtime. Such functions always take
8991 a first argument of type 'pointer to real context'.
8993 C++ should really be fixed to use DECL_CONTEXT for the real context,
8994 and use something else for the "virtual context". */
8995 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8998 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9000 context
= DECL_CONTEXT (decl
);
9002 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9004 if (TREE_CODE (context
) == BLOCK
)
9005 context
= BLOCK_SUPERCONTEXT (context
);
9007 context
= get_containing_scope (context
);
9013 /* Return the innermost context enclosing DECL that is
9014 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9015 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9018 decl_type_context (const_tree decl
)
9020 tree context
= DECL_CONTEXT (decl
);
9023 switch (TREE_CODE (context
))
9025 case NAMESPACE_DECL
:
9026 case TRANSLATION_UNIT_DECL
:
9031 case QUAL_UNION_TYPE
:
9036 context
= DECL_CONTEXT (context
);
9040 context
= BLOCK_SUPERCONTEXT (context
);
9050 /* CALL is a CALL_EXPR. Return the declaration for the function
9051 called, or NULL_TREE if the called function cannot be
9055 get_callee_fndecl (const_tree call
)
9059 if (call
== error_mark_node
)
9060 return error_mark_node
;
9062 /* It's invalid to call this function with anything but a
9064 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9066 /* The first operand to the CALL is the address of the function
9068 addr
= CALL_EXPR_FN (call
);
9070 /* If there is no function, return early. */
9071 if (addr
== NULL_TREE
)
9076 /* If this is a readonly function pointer, extract its initial value. */
9077 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9078 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9079 && DECL_INITIAL (addr
))
9080 addr
= DECL_INITIAL (addr
);
9082 /* If the address is just `&f' for some function `f', then we know
9083 that `f' is being called. */
9084 if (TREE_CODE (addr
) == ADDR_EXPR
9085 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9086 return TREE_OPERAND (addr
, 0);
9088 /* We couldn't figure out what was being called. */
9092 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9093 return the associated function code, otherwise return CFN_LAST. */
9096 get_call_combined_fn (const_tree call
)
9098 /* It's invalid to call this function with anything but a CALL_EXPR. */
9099 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9101 if (!CALL_EXPR_FN (call
))
9102 return as_combined_fn (CALL_EXPR_IFN (call
));
9104 tree fndecl
= get_callee_fndecl (call
);
9105 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9106 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9111 #define TREE_MEM_USAGE_SPACES 40
9113 /* Print debugging information about tree nodes generated during the compile,
9114 and any language-specific information. */
9117 dump_tree_statistics (void)
9119 if (GATHER_STATISTICS
)
9122 int total_nodes
, total_bytes
;
9123 fprintf (stderr
, "\nKind Nodes Bytes\n");
9124 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9125 total_nodes
= total_bytes
= 0;
9126 for (i
= 0; i
< (int) all_kinds
; i
++)
9128 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9129 tree_node_counts
[i
], tree_node_sizes
[i
]);
9130 total_nodes
+= tree_node_counts
[i
];
9131 total_bytes
+= tree_node_sizes
[i
];
9133 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9134 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9135 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9136 fprintf (stderr
, "Code Nodes\n");
9137 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9138 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9139 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9140 tree_code_counts
[i
]);
9141 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9142 fprintf (stderr
, "\n");
9143 ssanames_print_statistics ();
9144 fprintf (stderr
, "\n");
9145 phinodes_print_statistics ();
9146 fprintf (stderr
, "\n");
9149 fprintf (stderr
, "(No per-node statistics)\n");
9151 print_type_hash_statistics ();
9152 print_debug_expr_statistics ();
9153 print_value_expr_statistics ();
9154 lang_hooks
.print_statistics ();
9157 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9159 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9162 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9164 /* This relies on the raw feedback's top 4 bits being zero. */
9165 #define FEEDBACK(X) ((X) * 0x04c11db7)
9166 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9167 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9168 static const unsigned syndromes
[16] =
9170 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9171 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9172 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9173 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9178 value
<<= (32 - bytes
* 8);
9179 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9181 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9183 chksum
= (chksum
<< 4) ^ feedback
;
9189 /* Generate a crc32 of a string. */
9192 crc32_string (unsigned chksum
, const char *string
)
9195 chksum
= crc32_byte (chksum
, *string
);
9200 /* P is a string that will be used in a symbol. Mask out any characters
9201 that are not valid in that context. */
9204 clean_symbol_name (char *p
)
9208 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9211 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9218 /* For anonymous aggregate types, we need some sort of name to
9219 hold on to. In practice, this should not appear, but it should
9220 not be harmful if it does. */
9222 anon_aggrname_p(const_tree id_node
)
9224 #ifndef NO_DOT_IN_LABEL
9225 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9226 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9227 #else /* NO_DOT_IN_LABEL */
9228 #ifndef NO_DOLLAR_IN_LABEL
9229 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9230 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9231 #else /* NO_DOLLAR_IN_LABEL */
9232 #define ANON_AGGRNAME_PREFIX "__anon_"
9233 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9234 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9235 #endif /* NO_DOLLAR_IN_LABEL */
9236 #endif /* NO_DOT_IN_LABEL */
9239 /* Return a format for an anonymous aggregate name. */
9241 anon_aggrname_format()
9243 #ifndef NO_DOT_IN_LABEL
9245 #else /* NO_DOT_IN_LABEL */
9246 #ifndef NO_DOLLAR_IN_LABEL
9248 #else /* NO_DOLLAR_IN_LABEL */
9250 #endif /* NO_DOLLAR_IN_LABEL */
9251 #endif /* NO_DOT_IN_LABEL */
9254 /* Generate a name for a special-purpose function.
9255 The generated name may need to be unique across the whole link.
9256 Changes to this function may also require corresponding changes to
9257 xstrdup_mask_random.
9258 TYPE is some string to identify the purpose of this function to the
9259 linker or collect2; it must start with an uppercase letter,
9261 I - for constructors
9263 N - for C++ anonymous namespaces
9264 F - for DWARF unwind frame information. */
9267 get_file_function_name (const char *type
)
9273 /* If we already have a name we know to be unique, just use that. */
9274 if (first_global_object_name
)
9275 p
= q
= ASTRDUP (first_global_object_name
);
9276 /* If the target is handling the constructors/destructors, they
9277 will be local to this file and the name is only necessary for
9279 We also assign sub_I and sub_D sufixes to constructors called from
9280 the global static constructors. These are always local. */
9281 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9282 || (strncmp (type
, "sub_", 4) == 0
9283 && (type
[4] == 'I' || type
[4] == 'D')))
9285 const char *file
= main_input_filename
;
9287 file
= LOCATION_FILE (input_location
);
9288 /* Just use the file's basename, because the full pathname
9289 might be quite long. */
9290 p
= q
= ASTRDUP (lbasename (file
));
9294 /* Otherwise, the name must be unique across the entire link.
9295 We don't have anything that we know to be unique to this translation
9296 unit, so use what we do have and throw in some randomness. */
9298 const char *name
= weak_global_object_name
;
9299 const char *file
= main_input_filename
;
9304 file
= LOCATION_FILE (input_location
);
9306 len
= strlen (file
);
9307 q
= (char *) alloca (9 + 19 + len
+ 1);
9308 memcpy (q
, file
, len
+ 1);
9310 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9311 crc32_string (0, name
), get_random_seed (false));
9316 clean_symbol_name (q
);
9317 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9320 /* Set up the name of the file-level functions we may need.
9321 Use a global object (which is already required to be unique over
9322 the program) rather than the file name (which imposes extra
9324 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9326 return get_identifier (buf
);
9329 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9331 /* Complain that the tree code of NODE does not match the expected 0
9332 terminated list of trailing codes. The trailing code list can be
9333 empty, for a more vague error message. FILE, LINE, and FUNCTION
9334 are of the caller. */
9337 tree_check_failed (const_tree node
, const char *file
,
9338 int line
, const char *function
, ...)
9342 unsigned length
= 0;
9343 enum tree_code code
;
9345 va_start (args
, function
);
9346 while ((code
= (enum tree_code
) va_arg (args
, int)))
9347 length
+= 4 + strlen (get_tree_code_name (code
));
9352 va_start (args
, function
);
9353 length
+= strlen ("expected ");
9354 buffer
= tmp
= (char *) alloca (length
);
9356 while ((code
= (enum tree_code
) va_arg (args
, int)))
9358 const char *prefix
= length
? " or " : "expected ";
9360 strcpy (tmp
+ length
, prefix
);
9361 length
+= strlen (prefix
);
9362 strcpy (tmp
+ length
, get_tree_code_name (code
));
9363 length
+= strlen (get_tree_code_name (code
));
9368 buffer
= "unexpected node";
9370 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9371 buffer
, get_tree_code_name (TREE_CODE (node
)),
9372 function
, trim_filename (file
), line
);
9375 /* Complain that the tree code of NODE does match the expected 0
9376 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9380 tree_not_check_failed (const_tree node
, const char *file
,
9381 int line
, const char *function
, ...)
9385 unsigned length
= 0;
9386 enum tree_code code
;
9388 va_start (args
, function
);
9389 while ((code
= (enum tree_code
) va_arg (args
, int)))
9390 length
+= 4 + strlen (get_tree_code_name (code
));
9392 va_start (args
, function
);
9393 buffer
= (char *) alloca (length
);
9395 while ((code
= (enum tree_code
) va_arg (args
, int)))
9399 strcpy (buffer
+ length
, " or ");
9402 strcpy (buffer
+ length
, get_tree_code_name (code
));
9403 length
+= strlen (get_tree_code_name (code
));
9407 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9408 buffer
, get_tree_code_name (TREE_CODE (node
)),
9409 function
, trim_filename (file
), line
);
9412 /* Similar to tree_check_failed, except that we check for a class of tree
9413 code, given in CL. */
9416 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9417 const char *file
, int line
, const char *function
)
9420 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9421 TREE_CODE_CLASS_STRING (cl
),
9422 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9423 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9426 /* Similar to tree_check_failed, except that instead of specifying a
9427 dozen codes, use the knowledge that they're all sequential. */
9430 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9431 const char *function
, enum tree_code c1
,
9435 unsigned length
= 0;
9438 for (c
= c1
; c
<= c2
; ++c
)
9439 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9441 length
+= strlen ("expected ");
9442 buffer
= (char *) alloca (length
);
9445 for (c
= c1
; c
<= c2
; ++c
)
9447 const char *prefix
= length
? " or " : "expected ";
9449 strcpy (buffer
+ length
, prefix
);
9450 length
+= strlen (prefix
);
9451 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9452 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9455 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9456 buffer
, get_tree_code_name (TREE_CODE (node
)),
9457 function
, trim_filename (file
), line
);
9461 /* Similar to tree_check_failed, except that we check that a tree does
9462 not have the specified code, given in CL. */
9465 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9466 const char *file
, int line
, const char *function
)
9469 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9470 TREE_CODE_CLASS_STRING (cl
),
9471 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9472 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9476 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9479 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9480 const char *function
, enum omp_clause_code code
)
9482 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9483 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9484 function
, trim_filename (file
), line
);
9488 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9491 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9492 const char *function
, enum omp_clause_code c1
,
9493 enum omp_clause_code c2
)
9496 unsigned length
= 0;
9499 for (c
= c1
; c
<= c2
; ++c
)
9500 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9502 length
+= strlen ("expected ");
9503 buffer
= (char *) alloca (length
);
9506 for (c
= c1
; c
<= c2
; ++c
)
9508 const char *prefix
= length
? " or " : "expected ";
9510 strcpy (buffer
+ length
, prefix
);
9511 length
+= strlen (prefix
);
9512 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9513 length
+= strlen (omp_clause_code_name
[c
]);
9516 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9517 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9518 function
, trim_filename (file
), line
);
9522 #undef DEFTREESTRUCT
9523 #define DEFTREESTRUCT(VAL, NAME) NAME,
9525 static const char *ts_enum_names
[] = {
9526 #include "treestruct.def"
9528 #undef DEFTREESTRUCT
9530 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9532 /* Similar to tree_class_check_failed, except that we check for
9533 whether CODE contains the tree structure identified by EN. */
9536 tree_contains_struct_check_failed (const_tree node
,
9537 const enum tree_node_structure_enum en
,
9538 const char *file
, int line
,
9539 const char *function
)
9542 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9544 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9548 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9549 (dynamically sized) vector. */
9552 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9553 const char *function
)
9556 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9557 idx
+ 1, len
, function
, trim_filename (file
), line
);
9560 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9561 (dynamically sized) vector. */
9564 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9565 const char *function
)
9568 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9569 idx
+ 1, len
, function
, trim_filename (file
), line
);
9572 /* Similar to above, except that the check is for the bounds of the operand
9573 vector of an expression node EXP. */
9576 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9577 int line
, const char *function
)
9579 enum tree_code code
= TREE_CODE (exp
);
9581 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9582 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9583 function
, trim_filename (file
), line
);
9586 /* Similar to above, except that the check is for the number of
9587 operands of an OMP_CLAUSE node. */
9590 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9591 int line
, const char *function
)
9594 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9595 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9596 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9597 trim_filename (file
), line
);
9599 #endif /* ENABLE_TREE_CHECKING */
9601 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9602 and mapped to the machine mode MODE. Initialize its fields and build
9603 the information necessary for debugging output. */
9606 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9609 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9611 t
= make_node (VECTOR_TYPE
);
9612 TREE_TYPE (t
) = mv_innertype
;
9613 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9614 SET_TYPE_MODE (t
, mode
);
9616 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9617 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9618 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9619 || mode
!= VOIDmode
)
9620 && !VECTOR_BOOLEAN_TYPE_P (t
))
9622 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9626 hashval_t hash
= type_hash_canon_hash (t
);
9627 t
= type_hash_canon (hash
, t
);
9629 /* We have built a main variant, based on the main variant of the
9630 inner type. Use it to build the variant we return. */
9631 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9632 && TREE_TYPE (t
) != innertype
)
9633 return build_type_attribute_qual_variant (t
,
9634 TYPE_ATTRIBUTES (innertype
),
9635 TYPE_QUALS (innertype
));
9642 make_vector_type (tree innertype
, poly_uint64 nunits
, machine_mode mode
)
9644 return make_vector_type (innertype
, (int) nunits
.to_constant (), mode
);
9648 make_or_reuse_type (unsigned size
, int unsignedp
)
9652 if (size
== INT_TYPE_SIZE
)
9653 return unsignedp
? unsigned_type_node
: integer_type_node
;
9654 if (size
== CHAR_TYPE_SIZE
)
9655 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9656 if (size
== SHORT_TYPE_SIZE
)
9657 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9658 if (size
== LONG_TYPE_SIZE
)
9659 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9660 if (size
== LONG_LONG_TYPE_SIZE
)
9661 return (unsignedp
? long_long_unsigned_type_node
9662 : long_long_integer_type_node
);
9664 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9665 if (size
== int_n_data
[i
].bitsize
9666 && int_n_enabled_p
[i
])
9667 return (unsignedp
? int_n_trees
[i
].unsigned_type
9668 : int_n_trees
[i
].signed_type
);
9671 return make_unsigned_type (size
);
9673 return make_signed_type (size
);
9676 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9679 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9683 if (size
== SHORT_FRACT_TYPE_SIZE
)
9684 return unsignedp
? sat_unsigned_short_fract_type_node
9685 : sat_short_fract_type_node
;
9686 if (size
== FRACT_TYPE_SIZE
)
9687 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9688 if (size
== LONG_FRACT_TYPE_SIZE
)
9689 return unsignedp
? sat_unsigned_long_fract_type_node
9690 : sat_long_fract_type_node
;
9691 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9692 return unsignedp
? sat_unsigned_long_long_fract_type_node
9693 : sat_long_long_fract_type_node
;
9697 if (size
== SHORT_FRACT_TYPE_SIZE
)
9698 return unsignedp
? unsigned_short_fract_type_node
9699 : short_fract_type_node
;
9700 if (size
== FRACT_TYPE_SIZE
)
9701 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9702 if (size
== LONG_FRACT_TYPE_SIZE
)
9703 return unsignedp
? unsigned_long_fract_type_node
9704 : long_fract_type_node
;
9705 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9706 return unsignedp
? unsigned_long_long_fract_type_node
9707 : long_long_fract_type_node
;
9710 return make_fract_type (size
, unsignedp
, satp
);
9713 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9716 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9720 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9721 return unsignedp
? sat_unsigned_short_accum_type_node
9722 : sat_short_accum_type_node
;
9723 if (size
== ACCUM_TYPE_SIZE
)
9724 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9725 if (size
== LONG_ACCUM_TYPE_SIZE
)
9726 return unsignedp
? sat_unsigned_long_accum_type_node
9727 : sat_long_accum_type_node
;
9728 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9729 return unsignedp
? sat_unsigned_long_long_accum_type_node
9730 : sat_long_long_accum_type_node
;
9734 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9735 return unsignedp
? unsigned_short_accum_type_node
9736 : short_accum_type_node
;
9737 if (size
== ACCUM_TYPE_SIZE
)
9738 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9739 if (size
== LONG_ACCUM_TYPE_SIZE
)
9740 return unsignedp
? unsigned_long_accum_type_node
9741 : long_accum_type_node
;
9742 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9743 return unsignedp
? unsigned_long_long_accum_type_node
9744 : long_long_accum_type_node
;
9747 return make_accum_type (size
, unsignedp
, satp
);
9751 /* Create an atomic variant node for TYPE. This routine is called
9752 during initialization of data types to create the 5 basic atomic
9753 types. The generic build_variant_type function requires these to
9754 already be set up in order to function properly, so cannot be
9755 called from there. If ALIGN is non-zero, then ensure alignment is
9756 overridden to this value. */
9759 build_atomic_base (tree type
, unsigned int align
)
9763 /* Make sure its not already registered. */
9764 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9767 t
= build_variant_type_copy (type
);
9768 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9771 SET_TYPE_ALIGN (t
, align
);
9776 /* Information about the _FloatN and _FloatNx types. This must be in
9777 the same order as the corresponding TI_* enum values. */
9778 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9790 /* Create nodes for all integer types (and error_mark_node) using the sizes
9791 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9794 build_common_tree_nodes (bool signed_char
)
9798 error_mark_node
= make_node (ERROR_MARK
);
9799 TREE_TYPE (error_mark_node
) = error_mark_node
;
9801 initialize_sizetypes ();
9803 /* Define both `signed char' and `unsigned char'. */
9804 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9805 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9806 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9807 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9809 /* Define `char', which is like either `signed char' or `unsigned char'
9810 but not the same as either. */
9813 ? make_signed_type (CHAR_TYPE_SIZE
)
9814 : make_unsigned_type (CHAR_TYPE_SIZE
));
9815 TYPE_STRING_FLAG (char_type_node
) = 1;
9817 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9818 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9819 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9820 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9821 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9822 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9823 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9824 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9826 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9828 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9829 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9830 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9831 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9833 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9834 && int_n_enabled_p
[i
])
9836 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9837 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9841 /* Define a boolean type. This type only represents boolean values but
9842 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9843 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9844 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9845 TYPE_PRECISION (boolean_type_node
) = 1;
9846 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9848 /* Define what type to use for size_t. */
9849 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9850 size_type_node
= unsigned_type_node
;
9851 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9852 size_type_node
= long_unsigned_type_node
;
9853 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9854 size_type_node
= long_long_unsigned_type_node
;
9855 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9856 size_type_node
= short_unsigned_type_node
;
9861 size_type_node
= NULL_TREE
;
9862 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9863 if (int_n_enabled_p
[i
])
9866 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9868 if (strcmp (name
, SIZE_TYPE
) == 0)
9870 size_type_node
= int_n_trees
[i
].unsigned_type
;
9873 if (size_type_node
== NULL_TREE
)
9877 /* Define what type to use for ptrdiff_t. */
9878 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9879 ptrdiff_type_node
= integer_type_node
;
9880 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9881 ptrdiff_type_node
= long_integer_type_node
;
9882 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9883 ptrdiff_type_node
= long_long_integer_type_node
;
9884 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9885 ptrdiff_type_node
= short_integer_type_node
;
9888 ptrdiff_type_node
= NULL_TREE
;
9889 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9890 if (int_n_enabled_p
[i
])
9893 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9894 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9895 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9897 if (ptrdiff_type_node
== NULL_TREE
)
9901 /* Fill in the rest of the sized types. Reuse existing type nodes
9903 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9904 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9905 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9906 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9907 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9909 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9910 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9911 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9912 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9913 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9915 /* Don't call build_qualified type for atomics. That routine does
9916 special processing for atomics, and until they are initialized
9917 it's better not to make that call.
9919 Check to see if there is a target override for atomic types. */
9921 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9922 targetm
.atomic_align_for_mode (QImode
));
9923 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9924 targetm
.atomic_align_for_mode (HImode
));
9925 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9926 targetm
.atomic_align_for_mode (SImode
));
9927 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9928 targetm
.atomic_align_for_mode (DImode
));
9929 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9930 targetm
.atomic_align_for_mode (TImode
));
9932 access_public_node
= get_identifier ("public");
9933 access_protected_node
= get_identifier ("protected");
9934 access_private_node
= get_identifier ("private");
9936 /* Define these next since types below may used them. */
9937 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9938 integer_one_node
= build_int_cst (integer_type_node
, 1);
9939 integer_three_node
= build_int_cst (integer_type_node
, 3);
9940 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9942 size_zero_node
= size_int (0);
9943 size_one_node
= size_int (1);
9944 bitsize_zero_node
= bitsize_int (0);
9945 bitsize_one_node
= bitsize_int (1);
9946 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9948 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9949 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9951 void_type_node
= make_node (VOID_TYPE
);
9952 layout_type (void_type_node
);
9954 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9956 /* We are not going to have real types in C with less than byte alignment,
9957 so we might as well not have any types that claim to have it. */
9958 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9959 TYPE_USER_ALIGN (void_type_node
) = 0;
9961 void_node
= make_node (VOID_CST
);
9962 TREE_TYPE (void_node
) = void_type_node
;
9964 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9965 layout_type (TREE_TYPE (null_pointer_node
));
9967 ptr_type_node
= build_pointer_type (void_type_node
);
9969 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9970 for (unsigned i
= 0;
9971 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9973 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9975 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9977 float_type_node
= make_node (REAL_TYPE
);
9978 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9979 layout_type (float_type_node
);
9981 double_type_node
= make_node (REAL_TYPE
);
9982 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9983 layout_type (double_type_node
);
9985 long_double_type_node
= make_node (REAL_TYPE
);
9986 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9987 layout_type (long_double_type_node
);
9989 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9991 int n
= floatn_nx_types
[i
].n
;
9992 bool extended
= floatn_nx_types
[i
].extended
;
9993 scalar_float_mode mode
;
9994 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9996 int precision
= GET_MODE_PRECISION (mode
);
9997 /* Work around the rs6000 KFmode having precision 113 not
9999 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10000 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10001 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10003 gcc_assert (min_precision
== n
);
10004 if (precision
< min_precision
)
10005 precision
= min_precision
;
10006 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10007 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10008 layout_type (FLOATN_NX_TYPE_NODE (i
));
10009 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10012 float_ptr_type_node
= build_pointer_type (float_type_node
);
10013 double_ptr_type_node
= build_pointer_type (double_type_node
);
10014 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10015 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10017 /* Fixed size integer types. */
10018 uint16_type_node
= make_or_reuse_type (16, 1);
10019 uint32_type_node
= make_or_reuse_type (32, 1);
10020 uint64_type_node
= make_or_reuse_type (64, 1);
10022 /* Decimal float types. */
10023 dfloat32_type_node
= make_node (REAL_TYPE
);
10024 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10025 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10026 layout_type (dfloat32_type_node
);
10027 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10029 dfloat64_type_node
= make_node (REAL_TYPE
);
10030 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10031 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10032 layout_type (dfloat64_type_node
);
10033 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10035 dfloat128_type_node
= make_node (REAL_TYPE
);
10036 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10037 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10038 layout_type (dfloat128_type_node
);
10039 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10041 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10042 complex_float_type_node
= build_complex_type (float_type_node
, true);
10043 complex_double_type_node
= build_complex_type (double_type_node
, true);
10044 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10047 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10049 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10050 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10051 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10054 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10055 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10056 sat_ ## KIND ## _type_node = \
10057 make_sat_signed_ ## KIND ## _type (SIZE); \
10058 sat_unsigned_ ## KIND ## _type_node = \
10059 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10060 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10061 unsigned_ ## KIND ## _type_node = \
10062 make_unsigned_ ## KIND ## _type (SIZE);
10064 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10065 sat_ ## WIDTH ## KIND ## _type_node = \
10066 make_sat_signed_ ## KIND ## _type (SIZE); \
10067 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10068 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10069 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10070 unsigned_ ## WIDTH ## KIND ## _type_node = \
10071 make_unsigned_ ## KIND ## _type (SIZE);
10073 /* Make fixed-point type nodes based on four different widths. */
10074 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10075 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10076 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10077 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10078 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10080 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10081 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10082 NAME ## _type_node = \
10083 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10084 u ## NAME ## _type_node = \
10085 make_or_reuse_unsigned_ ## KIND ## _type \
10086 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10087 sat_ ## NAME ## _type_node = \
10088 make_or_reuse_sat_signed_ ## KIND ## _type \
10089 (GET_MODE_BITSIZE (MODE ## mode)); \
10090 sat_u ## NAME ## _type_node = \
10091 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10092 (GET_MODE_BITSIZE (U ## MODE ## mode));
10094 /* Fixed-point type and mode nodes. */
10095 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10096 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10097 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10098 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10099 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10100 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10101 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10102 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10103 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10104 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10105 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10108 tree t
= targetm
.build_builtin_va_list ();
10110 /* Many back-ends define record types without setting TYPE_NAME.
10111 If we copied the record type here, we'd keep the original
10112 record type without a name. This breaks name mangling. So,
10113 don't copy record types and let c_common_nodes_and_builtins()
10114 declare the type to be __builtin_va_list. */
10115 if (TREE_CODE (t
) != RECORD_TYPE
)
10116 t
= build_variant_type_copy (t
);
10118 va_list_type_node
= t
;
10122 /* Modify DECL for given flags.
10123 TM_PURE attribute is set only on types, so the function will modify
10124 DECL's type when ECF_TM_PURE is used. */
10127 set_call_expr_flags (tree decl
, int flags
)
10129 if (flags
& ECF_NOTHROW
)
10130 TREE_NOTHROW (decl
) = 1;
10131 if (flags
& ECF_CONST
)
10132 TREE_READONLY (decl
) = 1;
10133 if (flags
& ECF_PURE
)
10134 DECL_PURE_P (decl
) = 1;
10135 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10136 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10137 if (flags
& ECF_NOVOPS
)
10138 DECL_IS_NOVOPS (decl
) = 1;
10139 if (flags
& ECF_NORETURN
)
10140 TREE_THIS_VOLATILE (decl
) = 1;
10141 if (flags
& ECF_MALLOC
)
10142 DECL_IS_MALLOC (decl
) = 1;
10143 if (flags
& ECF_RETURNS_TWICE
)
10144 DECL_IS_RETURNS_TWICE (decl
) = 1;
10145 if (flags
& ECF_LEAF
)
10146 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10147 NULL
, DECL_ATTRIBUTES (decl
));
10148 if (flags
& ECF_COLD
)
10149 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10150 NULL
, DECL_ATTRIBUTES (decl
));
10151 if (flags
& ECF_RET1
)
10152 DECL_ATTRIBUTES (decl
)
10153 = tree_cons (get_identifier ("fn spec"),
10154 build_tree_list (NULL_TREE
, build_string (1, "1")),
10155 DECL_ATTRIBUTES (decl
));
10156 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10157 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10158 /* Looping const or pure is implied by noreturn.
10159 There is currently no way to declare looping const or looping pure alone. */
10160 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10161 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10165 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10168 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10169 const char *library_name
, int ecf_flags
)
10173 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10174 library_name
, NULL_TREE
);
10175 set_call_expr_flags (decl
, ecf_flags
);
10177 set_builtin_decl (code
, decl
, true);
10180 /* Call this function after instantiating all builtins that the language
10181 front end cares about. This will build the rest of the builtins
10182 and internal functions that are relied upon by the tree optimizers and
10186 build_common_builtin_nodes (void)
10191 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10192 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10194 ftype
= build_function_type (void_type_node
, void_list_node
);
10195 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10196 local_define_builtin ("__builtin_unreachable", ftype
,
10197 BUILT_IN_UNREACHABLE
,
10198 "__builtin_unreachable",
10199 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10200 | ECF_CONST
| ECF_COLD
);
10201 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10202 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10204 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10207 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10208 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10210 ftype
= build_function_type_list (ptr_type_node
,
10211 ptr_type_node
, const_ptr_type_node
,
10212 size_type_node
, NULL_TREE
);
10214 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10215 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10216 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10217 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10218 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10219 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10222 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10224 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10225 const_ptr_type_node
, size_type_node
,
10227 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10228 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10231 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10233 ftype
= build_function_type_list (ptr_type_node
,
10234 ptr_type_node
, integer_type_node
,
10235 size_type_node
, NULL_TREE
);
10236 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10237 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10240 /* If we're checking the stack, `alloca' can throw. */
10241 const int alloca_flags
10242 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10244 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10246 ftype
= build_function_type_list (ptr_type_node
,
10247 size_type_node
, NULL_TREE
);
10248 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10249 "alloca", alloca_flags
);
10252 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10253 size_type_node
, NULL_TREE
);
10254 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10255 BUILT_IN_ALLOCA_WITH_ALIGN
,
10256 "__builtin_alloca_with_align",
10259 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10260 size_type_node
, size_type_node
, NULL_TREE
);
10261 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10262 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10263 "__builtin_alloca_with_align_and_max",
10266 ftype
= build_function_type_list (void_type_node
,
10267 ptr_type_node
, ptr_type_node
,
10268 ptr_type_node
, NULL_TREE
);
10269 local_define_builtin ("__builtin_init_trampoline", ftype
,
10270 BUILT_IN_INIT_TRAMPOLINE
,
10271 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10272 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10273 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10274 "__builtin_init_heap_trampoline",
10275 ECF_NOTHROW
| ECF_LEAF
);
10276 local_define_builtin ("__builtin_init_descriptor", ftype
,
10277 BUILT_IN_INIT_DESCRIPTOR
,
10278 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10280 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10281 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10282 BUILT_IN_ADJUST_TRAMPOLINE
,
10283 "__builtin_adjust_trampoline",
10284 ECF_CONST
| ECF_NOTHROW
);
10285 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10286 BUILT_IN_ADJUST_DESCRIPTOR
,
10287 "__builtin_adjust_descriptor",
10288 ECF_CONST
| ECF_NOTHROW
);
10290 ftype
= build_function_type_list (void_type_node
,
10291 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10292 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10293 BUILT_IN_NONLOCAL_GOTO
,
10294 "__builtin_nonlocal_goto",
10295 ECF_NORETURN
| ECF_NOTHROW
);
10297 ftype
= build_function_type_list (void_type_node
,
10298 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10299 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10300 BUILT_IN_SETJMP_SETUP
,
10301 "__builtin_setjmp_setup", ECF_NOTHROW
);
10303 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10304 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10305 BUILT_IN_SETJMP_RECEIVER
,
10306 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10308 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10309 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10310 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10312 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10313 local_define_builtin ("__builtin_stack_restore", ftype
,
10314 BUILT_IN_STACK_RESTORE
,
10315 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10317 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10318 const_ptr_type_node
, size_type_node
,
10320 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10321 "__builtin_memcmp_eq",
10322 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10324 /* If there's a possibility that we might use the ARM EABI, build the
10325 alternate __cxa_end_cleanup node used to resume from C++. */
10326 if (targetm
.arm_eabi_unwinder
)
10328 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10329 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10330 BUILT_IN_CXA_END_CLEANUP
,
10331 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10334 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10335 local_define_builtin ("__builtin_unwind_resume", ftype
,
10336 BUILT_IN_UNWIND_RESUME
,
10337 ((targetm_common
.except_unwind_info (&global_options
)
10339 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10342 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10344 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10346 local_define_builtin ("__builtin_return_address", ftype
,
10347 BUILT_IN_RETURN_ADDRESS
,
10348 "__builtin_return_address",
10352 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10353 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10355 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10356 ptr_type_node
, NULL_TREE
);
10357 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10358 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10359 BUILT_IN_PROFILE_FUNC_ENTER
,
10360 "__cyg_profile_func_enter", 0);
10361 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10362 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10363 BUILT_IN_PROFILE_FUNC_EXIT
,
10364 "__cyg_profile_func_exit", 0);
10367 /* The exception object and filter values from the runtime. The argument
10368 must be zero before exception lowering, i.e. from the front end. After
10369 exception lowering, it will be the region number for the exception
10370 landing pad. These functions are PURE instead of CONST to prevent
10371 them from being hoisted past the exception edge that will initialize
10372 its value in the landing pad. */
10373 ftype
= build_function_type_list (ptr_type_node
,
10374 integer_type_node
, NULL_TREE
);
10375 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10376 /* Only use TM_PURE if we have TM language support. */
10377 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10378 ecf_flags
|= ECF_TM_PURE
;
10379 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10380 "__builtin_eh_pointer", ecf_flags
);
10382 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10383 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10384 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10385 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10387 ftype
= build_function_type_list (void_type_node
,
10388 integer_type_node
, integer_type_node
,
10390 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10391 BUILT_IN_EH_COPY_VALUES
,
10392 "__builtin_eh_copy_values", ECF_NOTHROW
);
10394 /* Complex multiplication and division. These are handled as builtins
10395 rather than optabs because emit_library_call_value doesn't support
10396 complex. Further, we can do slightly better with folding these
10397 beasties if the real and complex parts of the arguments are separate. */
10401 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10403 char mode_name_buf
[4], *q
;
10405 enum built_in_function mcode
, dcode
;
10406 tree type
, inner_type
;
10407 const char *prefix
= "__";
10409 if (targetm
.libfunc_gnu_prefix
)
10412 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10415 inner_type
= TREE_TYPE (type
);
10417 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10418 inner_type
, inner_type
, NULL_TREE
);
10420 mcode
= ((enum built_in_function
)
10421 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10422 dcode
= ((enum built_in_function
)
10423 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10425 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10429 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10431 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10432 built_in_names
[mcode
],
10433 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10435 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10437 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10438 built_in_names
[dcode
],
10439 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10443 init_internal_fns ();
10446 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10449 If we requested a pointer to a vector, build up the pointers that
10450 we stripped off while looking for the inner type. Similarly for
10451 return values from functions.
10453 The argument TYPE is the top of the chain, and BOTTOM is the
10454 new type which we will point to. */
10457 reconstruct_complex_type (tree type
, tree bottom
)
10461 if (TREE_CODE (type
) == POINTER_TYPE
)
10463 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10464 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10465 TYPE_REF_CAN_ALIAS_ALL (type
));
10467 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10469 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10470 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10471 TYPE_REF_CAN_ALIAS_ALL (type
));
10473 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10475 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10476 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10478 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10480 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10481 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10483 else if (TREE_CODE (type
) == METHOD_TYPE
)
10485 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10486 /* The build_method_type_directly() routine prepends 'this' to argument list,
10487 so we must compensate by getting rid of it. */
10489 = build_method_type_directly
10490 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10492 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10494 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10496 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10497 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10502 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10503 TYPE_QUALS (type
));
10506 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10509 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10512 unsigned int bitsize
;
10514 switch (GET_MODE_CLASS (mode
))
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
, int 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 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
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
, int 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
)
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
)
10756 first
= error_mark_node
;
10758 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10765 if (!operand_equal_p (first
, t
, 0))
10768 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10777 /* Build an empty statement at location LOC. */
10780 build_empty_stmt (location_t loc
)
10782 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10783 SET_EXPR_LOCATION (t
, loc
);
10788 /* Build an OpenMP clause with code CODE. LOC is the location of the
10792 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10797 length
= omp_clause_num_ops
[code
];
10798 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10800 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10802 t
= (tree
) ggc_internal_alloc (size
);
10803 memset (t
, 0, size
);
10804 TREE_SET_CODE (t
, OMP_CLAUSE
);
10805 OMP_CLAUSE_SET_CODE (t
, code
);
10806 OMP_CLAUSE_LOCATION (t
) = loc
;
10811 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10812 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10813 Except for the CODE and operand count field, other storage for the
10814 object is initialized to zeros. */
10817 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10820 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10822 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10823 gcc_assert (len
>= 1);
10825 record_node_allocation_statistics (code
, length
);
10827 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10829 TREE_SET_CODE (t
, code
);
10831 /* Can't use TREE_OPERAND to store the length because if checking is
10832 enabled, it will try to check the length before we store it. :-P */
10833 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10838 /* Helper function for build_call_* functions; build a CALL_EXPR with
10839 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10840 the argument slots. */
10843 build_call_1 (tree return_type
, tree fn
, int nargs
)
10847 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10848 TREE_TYPE (t
) = return_type
;
10849 CALL_EXPR_FN (t
) = fn
;
10850 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10855 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10856 FN and a null static chain slot. NARGS is the number of call arguments
10857 which are specified as "..." arguments. */
10860 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10864 va_start (args
, nargs
);
10865 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10870 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10871 FN and a null static chain slot. NARGS is the number of call arguments
10872 which are specified as a va_list ARGS. */
10875 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10880 t
= build_call_1 (return_type
, fn
, nargs
);
10881 for (i
= 0; i
< nargs
; i
++)
10882 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10883 process_call_operands (t
);
10887 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10888 FN and a null static chain slot. NARGS is the number of call arguments
10889 which are specified as a tree array ARGS. */
10892 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10893 int nargs
, const tree
*args
)
10898 t
= build_call_1 (return_type
, fn
, nargs
);
10899 for (i
= 0; i
< nargs
; i
++)
10900 CALL_EXPR_ARG (t
, i
) = args
[i
];
10901 process_call_operands (t
);
10902 SET_EXPR_LOCATION (t
, loc
);
10906 /* Like build_call_array, but takes a vec. */
10909 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10914 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10915 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10916 CALL_EXPR_ARG (ret
, ix
) = t
;
10917 process_call_operands (ret
);
10921 /* Conveniently construct a function call expression. FNDECL names the
10922 function to be called and N arguments are passed in the array
10926 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10928 tree fntype
= TREE_TYPE (fndecl
);
10929 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10931 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10934 /* Conveniently construct a function call expression. FNDECL names the
10935 function to be called and the arguments are passed in the vector
10939 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10941 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10942 vec_safe_address (vec
));
10946 /* Conveniently construct a function call expression. FNDECL names the
10947 function to be called, N is the number of arguments, and the "..."
10948 parameters are the argument expressions. */
10951 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10954 tree
*argarray
= XALLOCAVEC (tree
, n
);
10958 for (i
= 0; i
< n
; i
++)
10959 argarray
[i
] = va_arg (ap
, tree
);
10961 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10964 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10965 varargs macros aren't supported by all bootstrap compilers. */
10968 build_call_expr (tree fndecl
, int n
, ...)
10971 tree
*argarray
= XALLOCAVEC (tree
, n
);
10975 for (i
= 0; i
< n
; i
++)
10976 argarray
[i
] = va_arg (ap
, tree
);
10978 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10981 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10982 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10983 It will get gimplified later into an ordinary internal function. */
10986 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10987 tree type
, int n
, const tree
*args
)
10989 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10990 for (int i
= 0; i
< n
; ++i
)
10991 CALL_EXPR_ARG (t
, i
) = args
[i
];
10992 SET_EXPR_LOCATION (t
, loc
);
10993 CALL_EXPR_IFN (t
) = ifn
;
10997 /* Build internal call expression. This is just like CALL_EXPR, except
10998 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10999 internal function. */
11002 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11003 tree type
, int n
, ...)
11006 tree
*argarray
= XALLOCAVEC (tree
, n
);
11010 for (i
= 0; i
< n
; i
++)
11011 argarray
[i
] = va_arg (ap
, tree
);
11013 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11016 /* Return a function call to FN, if the target is guaranteed to support it,
11019 N is the number of arguments, passed in the "...", and TYPE is the
11020 type of the return value. */
11023 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11027 tree
*argarray
= XALLOCAVEC (tree
, n
);
11031 for (i
= 0; i
< n
; i
++)
11032 argarray
[i
] = va_arg (ap
, tree
);
11034 if (internal_fn_p (fn
))
11036 internal_fn ifn
= as_internal_fn (fn
);
11037 if (direct_internal_fn_p (ifn
))
11039 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11040 if (!direct_internal_fn_supported_p (ifn
, types
,
11041 OPTIMIZE_FOR_BOTH
))
11044 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11048 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11051 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11055 /* Return a function call to the appropriate builtin alloca variant.
11057 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11058 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11059 bound for SIZE in case it is not a fixed value. */
11062 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11066 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11068 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11070 else if (align
> 0)
11072 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11073 return build_call_expr (t
, 2, size
, size_int (align
));
11077 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11078 return build_call_expr (t
, 1, size
);
11082 /* Create a new constant string literal and return a char* pointer to it.
11083 The STRING_CST value is the LEN characters at STR. */
11085 build_string_literal (int len
, const char *str
)
11087 tree t
, elem
, index
, type
;
11089 t
= build_string (len
, str
);
11090 elem
= build_type_variant (char_type_node
, 1, 0);
11091 index
= build_index_type (size_int (len
- 1));
11092 type
= build_array_type (elem
, index
);
11093 TREE_TYPE (t
) = type
;
11094 TREE_CONSTANT (t
) = 1;
11095 TREE_READONLY (t
) = 1;
11096 TREE_STATIC (t
) = 1;
11098 type
= build_pointer_type (elem
);
11099 t
= build1 (ADDR_EXPR
, type
,
11100 build4 (ARRAY_REF
, elem
,
11101 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11107 /* Return true if T (assumed to be a DECL) must be assigned a memory
11111 needs_to_live_in_memory (const_tree t
)
11113 return (TREE_ADDRESSABLE (t
)
11114 || is_global_var (t
)
11115 || (TREE_CODE (t
) == RESULT_DECL
11116 && !DECL_BY_REFERENCE (t
)
11117 && aggregate_value_p (t
, current_function_decl
)));
11120 /* Return value of a constant X and sign-extend it. */
11123 int_cst_value (const_tree x
)
11125 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11126 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11128 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11129 gcc_assert (cst_and_fits_in_hwi (x
));
11131 if (bits
< HOST_BITS_PER_WIDE_INT
)
11133 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11135 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11137 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11143 /* If TYPE is an integral or pointer type, return an integer type with
11144 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11145 if TYPE is already an integer type of signedness UNSIGNEDP. */
11148 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11150 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11153 if (TREE_CODE (type
) == VECTOR_TYPE
)
11155 tree inner
= TREE_TYPE (type
);
11156 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11159 if (inner
== inner2
)
11161 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11164 if (!INTEGRAL_TYPE_P (type
)
11165 && !POINTER_TYPE_P (type
)
11166 && TREE_CODE (type
) != OFFSET_TYPE
)
11169 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11172 /* If TYPE is an integral or pointer type, return an integer type with
11173 the same precision which is unsigned, or itself if TYPE is already an
11174 unsigned integer type. */
11177 unsigned_type_for (tree type
)
11179 return signed_or_unsigned_type_for (1, type
);
11182 /* If TYPE is an integral or pointer type, return an integer type with
11183 the same precision which is signed, or itself if TYPE is already a
11184 signed integer type. */
11187 signed_type_for (tree type
)
11189 return signed_or_unsigned_type_for (0, type
);
11192 /* If TYPE is a vector type, return a signed integer vector type with the
11193 same width and number of subparts. Otherwise return boolean_type_node. */
11196 truth_type_for (tree type
)
11198 if (TREE_CODE (type
) == VECTOR_TYPE
)
11200 if (VECTOR_BOOLEAN_TYPE_P (type
))
11202 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11203 GET_MODE_SIZE (TYPE_MODE (type
)));
11206 return boolean_type_node
;
11209 /* Returns the largest value obtainable by casting something in INNER type to
11213 upper_bound_in_type (tree outer
, tree inner
)
11215 unsigned int det
= 0;
11216 unsigned oprec
= TYPE_PRECISION (outer
);
11217 unsigned iprec
= TYPE_PRECISION (inner
);
11220 /* Compute a unique number for every combination. */
11221 det
|= (oprec
> iprec
) ? 4 : 0;
11222 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11223 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11225 /* Determine the exponent to use. */
11230 /* oprec <= iprec, outer: signed, inner: don't care. */
11235 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11239 /* oprec > iprec, outer: signed, inner: signed. */
11243 /* oprec > iprec, outer: signed, inner: unsigned. */
11247 /* oprec > iprec, outer: unsigned, inner: signed. */
11251 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11255 gcc_unreachable ();
11258 return wide_int_to_tree (outer
,
11259 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11262 /* Returns the smallest value obtainable by casting something in INNER type to
11266 lower_bound_in_type (tree outer
, tree inner
)
11268 unsigned oprec
= TYPE_PRECISION (outer
);
11269 unsigned iprec
= TYPE_PRECISION (inner
);
11271 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11273 if (TYPE_UNSIGNED (outer
)
11274 /* If we are widening something of an unsigned type, OUTER type
11275 contains all values of INNER type. In particular, both INNER
11276 and OUTER types have zero in common. */
11277 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11278 return build_int_cst (outer
, 0);
11281 /* If we are widening a signed type to another signed type, we
11282 want to obtain -2^^(iprec-1). If we are keeping the
11283 precision or narrowing to a signed type, we want to obtain
11285 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11286 return wide_int_to_tree (outer
,
11287 wi::mask (prec
- 1, true,
11288 TYPE_PRECISION (outer
)));
11292 /* Return nonzero if two operands that are suitable for PHI nodes are
11293 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11294 SSA_NAME or invariant. Note that this is strictly an optimization.
11295 That is, callers of this function can directly call operand_equal_p
11296 and get the same result, only slower. */
11299 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11303 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11305 return operand_equal_p (arg0
, arg1
, 0);
11308 /* Returns number of zeros at the end of binary representation of X. */
11311 num_ending_zeros (const_tree x
)
11313 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11317 #define WALK_SUBTREE(NODE) \
11320 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11326 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11327 be walked whenever a type is seen in the tree. Rest of operands and return
11328 value are as for walk_tree. */
11331 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11332 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11334 tree result
= NULL_TREE
;
11336 switch (TREE_CODE (type
))
11339 case REFERENCE_TYPE
:
11341 /* We have to worry about mutually recursive pointers. These can't
11342 be written in C. They can in Ada. It's pathological, but
11343 there's an ACATS test (c38102a) that checks it. Deal with this
11344 by checking if we're pointing to another pointer, that one
11345 points to another pointer, that one does too, and we have no htab.
11346 If so, get a hash table. We check three levels deep to avoid
11347 the cost of the hash table if we don't need one. */
11348 if (POINTER_TYPE_P (TREE_TYPE (type
))
11349 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11350 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11353 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11364 WALK_SUBTREE (TREE_TYPE (type
));
11368 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11370 /* Fall through. */
11372 case FUNCTION_TYPE
:
11373 WALK_SUBTREE (TREE_TYPE (type
));
11377 /* We never want to walk into default arguments. */
11378 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11379 WALK_SUBTREE (TREE_VALUE (arg
));
11384 /* Don't follow this nodes's type if a pointer for fear that
11385 we'll have infinite recursion. If we have a PSET, then we
11388 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11389 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11390 WALK_SUBTREE (TREE_TYPE (type
));
11391 WALK_SUBTREE (TYPE_DOMAIN (type
));
11395 WALK_SUBTREE (TREE_TYPE (type
));
11396 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11406 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11407 called with the DATA and the address of each sub-tree. If FUNC returns a
11408 non-NULL value, the traversal is stopped, and the value returned by FUNC
11409 is returned. If PSET is non-NULL it is used to record the nodes visited,
11410 and to avoid visiting a node more than once. */
11413 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11414 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11416 enum tree_code code
;
11420 #define WALK_SUBTREE_TAIL(NODE) \
11424 goto tail_recurse; \
11429 /* Skip empty subtrees. */
11433 /* Don't walk the same tree twice, if the user has requested
11434 that we avoid doing so. */
11435 if (pset
&& pset
->add (*tp
))
11438 /* Call the function. */
11440 result
= (*func
) (tp
, &walk_subtrees
, data
);
11442 /* If we found something, return it. */
11446 code
= TREE_CODE (*tp
);
11448 /* Even if we didn't, FUNC may have decided that there was nothing
11449 interesting below this point in the tree. */
11450 if (!walk_subtrees
)
11452 /* But we still need to check our siblings. */
11453 if (code
== TREE_LIST
)
11454 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11455 else if (code
== OMP_CLAUSE
)
11456 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11463 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11464 if (result
|| !walk_subtrees
)
11471 case IDENTIFIER_NODE
:
11478 case PLACEHOLDER_EXPR
:
11482 /* None of these have subtrees other than those already walked
11487 WALK_SUBTREE (TREE_VALUE (*tp
));
11488 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11493 int len
= TREE_VEC_LENGTH (*tp
);
11498 /* Walk all elements but the first. */
11500 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11502 /* Now walk the first one as a tail call. */
11503 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11507 WALK_SUBTREE (TREE_REALPART (*tp
));
11508 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11512 unsigned HOST_WIDE_INT idx
;
11513 constructor_elt
*ce
;
11515 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11517 WALK_SUBTREE (ce
->value
);
11522 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11527 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11529 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11530 into declarations that are just mentioned, rather than
11531 declared; they don't really belong to this part of the tree.
11532 And, we can see cycles: the initializer for a declaration
11533 can refer to the declaration itself. */
11534 WALK_SUBTREE (DECL_INITIAL (decl
));
11535 WALK_SUBTREE (DECL_SIZE (decl
));
11536 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11538 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11541 case STATEMENT_LIST
:
11543 tree_stmt_iterator i
;
11544 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11545 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11550 switch (OMP_CLAUSE_CODE (*tp
))
11552 case OMP_CLAUSE_GANG
:
11553 case OMP_CLAUSE__GRIDDIM_
:
11554 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11557 case OMP_CLAUSE_ASYNC
:
11558 case OMP_CLAUSE_WAIT
:
11559 case OMP_CLAUSE_WORKER
:
11560 case OMP_CLAUSE_VECTOR
:
11561 case OMP_CLAUSE_NUM_GANGS
:
11562 case OMP_CLAUSE_NUM_WORKERS
:
11563 case OMP_CLAUSE_VECTOR_LENGTH
:
11564 case OMP_CLAUSE_PRIVATE
:
11565 case OMP_CLAUSE_SHARED
:
11566 case OMP_CLAUSE_FIRSTPRIVATE
:
11567 case OMP_CLAUSE_COPYIN
:
11568 case OMP_CLAUSE_COPYPRIVATE
:
11569 case OMP_CLAUSE_FINAL
:
11570 case OMP_CLAUSE_IF
:
11571 case OMP_CLAUSE_NUM_THREADS
:
11572 case OMP_CLAUSE_SCHEDULE
:
11573 case OMP_CLAUSE_UNIFORM
:
11574 case OMP_CLAUSE_DEPEND
:
11575 case OMP_CLAUSE_NUM_TEAMS
:
11576 case OMP_CLAUSE_THREAD_LIMIT
:
11577 case OMP_CLAUSE_DEVICE
:
11578 case OMP_CLAUSE_DIST_SCHEDULE
:
11579 case OMP_CLAUSE_SAFELEN
:
11580 case OMP_CLAUSE_SIMDLEN
:
11581 case OMP_CLAUSE_ORDERED
:
11582 case OMP_CLAUSE_PRIORITY
:
11583 case OMP_CLAUSE_GRAINSIZE
:
11584 case OMP_CLAUSE_NUM_TASKS
:
11585 case OMP_CLAUSE_HINT
:
11586 case OMP_CLAUSE_TO_DECLARE
:
11587 case OMP_CLAUSE_LINK
:
11588 case OMP_CLAUSE_USE_DEVICE_PTR
:
11589 case OMP_CLAUSE_IS_DEVICE_PTR
:
11590 case OMP_CLAUSE__LOOPTEMP_
:
11591 case OMP_CLAUSE__SIMDUID_
:
11592 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11595 case OMP_CLAUSE_INDEPENDENT
:
11596 case OMP_CLAUSE_NOWAIT
:
11597 case OMP_CLAUSE_DEFAULT
:
11598 case OMP_CLAUSE_UNTIED
:
11599 case OMP_CLAUSE_MERGEABLE
:
11600 case OMP_CLAUSE_PROC_BIND
:
11601 case OMP_CLAUSE_INBRANCH
:
11602 case OMP_CLAUSE_NOTINBRANCH
:
11603 case OMP_CLAUSE_FOR
:
11604 case OMP_CLAUSE_PARALLEL
:
11605 case OMP_CLAUSE_SECTIONS
:
11606 case OMP_CLAUSE_TASKGROUP
:
11607 case OMP_CLAUSE_NOGROUP
:
11608 case OMP_CLAUSE_THREADS
:
11609 case OMP_CLAUSE_SIMD
:
11610 case OMP_CLAUSE_DEFAULTMAP
:
11611 case OMP_CLAUSE_AUTO
:
11612 case OMP_CLAUSE_SEQ
:
11613 case OMP_CLAUSE_TILE
:
11614 case OMP_CLAUSE__SIMT_
:
11615 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11617 case OMP_CLAUSE_LASTPRIVATE
:
11618 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11619 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11620 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11622 case OMP_CLAUSE_COLLAPSE
:
11625 for (i
= 0; i
< 3; i
++)
11626 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11627 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11630 case OMP_CLAUSE_LINEAR
:
11631 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11632 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11633 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11634 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11636 case OMP_CLAUSE_ALIGNED
:
11637 case OMP_CLAUSE_FROM
:
11638 case OMP_CLAUSE_TO
:
11639 case OMP_CLAUSE_MAP
:
11640 case OMP_CLAUSE__CACHE_
:
11641 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11642 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11643 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11645 case OMP_CLAUSE_REDUCTION
:
11648 for (i
= 0; i
< 5; i
++)
11649 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11650 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11654 gcc_unreachable ();
11662 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11663 But, we only want to walk once. */
11664 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11665 for (i
= 0; i
< len
; ++i
)
11666 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11667 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11671 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11672 defining. We only want to walk into these fields of a type in this
11673 case and not in the general case of a mere reference to the type.
11675 The criterion is as follows: if the field can be an expression, it
11676 must be walked only here. This should be in keeping with the fields
11677 that are directly gimplified in gimplify_type_sizes in order for the
11678 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11679 variable-sized types.
11681 Note that DECLs get walked as part of processing the BIND_EXPR. */
11682 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11684 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11685 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11688 /* Call the function for the type. See if it returns anything or
11689 doesn't want us to continue. If we are to continue, walk both
11690 the normal fields and those for the declaration case. */
11691 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11692 if (result
|| !walk_subtrees
)
11695 /* But do not walk a pointed-to type since it may itself need to
11696 be walked in the declaration case if it isn't anonymous. */
11697 if (!POINTER_TYPE_P (*type_p
))
11699 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11704 /* If this is a record type, also walk the fields. */
11705 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11709 for (field
= TYPE_FIELDS (*type_p
); field
;
11710 field
= DECL_CHAIN (field
))
11712 /* We'd like to look at the type of the field, but we can
11713 easily get infinite recursion. So assume it's pointed
11714 to elsewhere in the tree. Also, ignore things that
11716 if (TREE_CODE (field
) != FIELD_DECL
)
11719 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11720 WALK_SUBTREE (DECL_SIZE (field
));
11721 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11722 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11723 WALK_SUBTREE (DECL_QUALIFIER (field
));
11727 /* Same for scalar types. */
11728 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11729 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11730 || TREE_CODE (*type_p
) == INTEGER_TYPE
11731 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11732 || TREE_CODE (*type_p
) == REAL_TYPE
)
11734 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11735 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11738 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11739 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11744 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11748 /* Walk over all the sub-trees of this operand. */
11749 len
= TREE_OPERAND_LENGTH (*tp
);
11751 /* Go through the subtrees. We need to do this in forward order so
11752 that the scope of a FOR_EXPR is handled properly. */
11755 for (i
= 0; i
< len
- 1; ++i
)
11756 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11757 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11760 /* If this is a type, walk the needed fields in the type. */
11761 else if (TYPE_P (*tp
))
11762 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11766 /* We didn't find what we were looking for. */
11769 #undef WALK_SUBTREE_TAIL
11771 #undef WALK_SUBTREE
11773 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11776 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11781 hash_set
<tree
> pset
;
11782 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11788 tree_block (tree t
)
11790 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11792 if (IS_EXPR_CODE_CLASS (c
))
11793 return LOCATION_BLOCK (t
->exp
.locus
);
11794 gcc_unreachable ();
11799 tree_set_block (tree t
, tree b
)
11801 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11803 if (IS_EXPR_CODE_CLASS (c
))
11805 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11808 gcc_unreachable ();
11811 /* Create a nameless artificial label and put it in the current
11812 function context. The label has a location of LOC. Returns the
11813 newly created label. */
11816 create_artificial_label (location_t loc
)
11818 tree lab
= build_decl (loc
,
11819 LABEL_DECL
, NULL_TREE
, void_type_node
);
11821 DECL_ARTIFICIAL (lab
) = 1;
11822 DECL_IGNORED_P (lab
) = 1;
11823 DECL_CONTEXT (lab
) = current_function_decl
;
11827 /* Given a tree, try to return a useful variable name that we can use
11828 to prefix a temporary that is being assigned the value of the tree.
11829 I.E. given <temp> = &A, return A. */
11834 tree stripped_decl
;
11837 STRIP_NOPS (stripped_decl
);
11838 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11839 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11840 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11842 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11845 return IDENTIFIER_POINTER (name
);
11849 switch (TREE_CODE (stripped_decl
))
11852 return get_name (TREE_OPERAND (stripped_decl
, 0));
11859 /* Return true if TYPE has a variable argument list. */
11862 stdarg_p (const_tree fntype
)
11864 function_args_iterator args_iter
;
11865 tree n
= NULL_TREE
, t
;
11870 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11875 return n
!= NULL_TREE
&& n
!= void_type_node
;
11878 /* Return true if TYPE has a prototype. */
11881 prototype_p (const_tree fntype
)
11885 gcc_assert (fntype
!= NULL_TREE
);
11887 t
= TYPE_ARG_TYPES (fntype
);
11888 return (t
!= NULL_TREE
);
11891 /* If BLOCK is inlined from an __attribute__((__artificial__))
11892 routine, return pointer to location from where it has been
11895 block_nonartificial_location (tree block
)
11897 location_t
*ret
= NULL
;
11899 while (block
&& TREE_CODE (block
) == BLOCK
11900 && BLOCK_ABSTRACT_ORIGIN (block
))
11902 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11904 while (TREE_CODE (ao
) == BLOCK
11905 && BLOCK_ABSTRACT_ORIGIN (ao
)
11906 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11907 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11909 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11911 /* If AO is an artificial inline, point RET to the
11912 call site locus at which it has been inlined and continue
11913 the loop, in case AO's caller is also an artificial
11915 if (DECL_DECLARED_INLINE_P (ao
)
11916 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11917 ret
= &BLOCK_SOURCE_LOCATION (block
);
11921 else if (TREE_CODE (ao
) != BLOCK
)
11924 block
= BLOCK_SUPERCONTEXT (block
);
11930 /* If EXP is inlined from an __attribute__((__artificial__))
11931 function, return the location of the original call expression. */
11934 tree_nonartificial_location (tree exp
)
11936 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11941 return EXPR_LOCATION (exp
);
11945 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11948 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11951 cl_option_hasher::hash (tree x
)
11953 const_tree
const t
= x
;
11957 hashval_t hash
= 0;
11959 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11961 p
= (const char *)TREE_OPTIMIZATION (t
);
11962 len
= sizeof (struct cl_optimization
);
11965 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11966 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11969 gcc_unreachable ();
11971 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11973 for (i
= 0; i
< len
; i
++)
11975 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11980 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11981 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11985 cl_option_hasher::equal (tree x
, tree y
)
11987 const_tree
const xt
= x
;
11988 const_tree
const yt
= y
;
11993 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11996 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11998 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11999 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12000 len
= sizeof (struct cl_optimization
);
12003 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12005 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12006 TREE_TARGET_OPTION (yt
));
12010 gcc_unreachable ();
12012 return (memcmp (xp
, yp
, len
) == 0);
12015 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12018 build_optimization_node (struct gcc_options
*opts
)
12022 /* Use the cache of optimization nodes. */
12024 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12027 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12031 /* Insert this one into the hash table. */
12032 t
= cl_optimization_node
;
12035 /* Make a new node for next time round. */
12036 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12042 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12045 build_target_option_node (struct gcc_options
*opts
)
12049 /* Use the cache of optimization nodes. */
12051 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12054 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12058 /* Insert this one into the hash table. */
12059 t
= cl_target_option_node
;
12062 /* Make a new node for next time round. */
12063 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12069 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12070 so that they aren't saved during PCH writing. */
12073 prepare_target_option_nodes_for_pch (void)
12075 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12076 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12077 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12078 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12081 /* Determine the "ultimate origin" of a block. The block may be an inlined
12082 instance of an inlined instance of a block which is local to an inline
12083 function, so we have to trace all of the way back through the origin chain
12084 to find out what sort of node actually served as the original seed for the
12088 block_ultimate_origin (const_tree block
)
12090 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12092 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12093 we're trying to output the abstract instance of this function. */
12094 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12097 if (immediate_origin
== NULL_TREE
)
12102 tree lookahead
= immediate_origin
;
12106 ret_val
= lookahead
;
12107 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12108 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12110 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12112 /* The block's abstract origin chain may not be the *ultimate* origin of
12113 the block. It could lead to a DECL that has an abstract origin set.
12114 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12115 will give us if it has one). Note that DECL's abstract origins are
12116 supposed to be the most distant ancestor (or so decl_ultimate_origin
12117 claims), so we don't need to loop following the DECL origins. */
12118 if (DECL_P (ret_val
))
12119 return DECL_ORIGIN (ret_val
);
12125 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12129 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12131 /* Do not strip casts into or out of differing address spaces. */
12132 if (POINTER_TYPE_P (outer_type
)
12133 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12135 if (!POINTER_TYPE_P (inner_type
)
12136 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12137 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12140 else if (POINTER_TYPE_P (inner_type
)
12141 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12143 /* We already know that outer_type is not a pointer with
12144 a non-generic address space. */
12148 /* Use precision rather then machine mode when we can, which gives
12149 the correct answer even for submode (bit-field) types. */
12150 if ((INTEGRAL_TYPE_P (outer_type
)
12151 || POINTER_TYPE_P (outer_type
)
12152 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12153 && (INTEGRAL_TYPE_P (inner_type
)
12154 || POINTER_TYPE_P (inner_type
)
12155 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12156 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12158 /* Otherwise fall back on comparing machine modes (e.g. for
12159 aggregate types, floats). */
12160 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12163 /* Return true iff conversion in EXP generates no instruction. Mark
12164 it inline so that we fully inline into the stripping functions even
12165 though we have two uses of this function. */
12168 tree_nop_conversion (const_tree exp
)
12170 tree outer_type
, inner_type
;
12172 if (!CONVERT_EXPR_P (exp
)
12173 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12175 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12178 outer_type
= TREE_TYPE (exp
);
12179 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12184 return tree_nop_conversion_p (outer_type
, inner_type
);
12187 /* Return true iff conversion in EXP generates no instruction. Don't
12188 consider conversions changing the signedness. */
12191 tree_sign_nop_conversion (const_tree exp
)
12193 tree outer_type
, inner_type
;
12195 if (!tree_nop_conversion (exp
))
12198 outer_type
= TREE_TYPE (exp
);
12199 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12201 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12202 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12205 /* Strip conversions from EXP according to tree_nop_conversion and
12206 return the resulting expression. */
12209 tree_strip_nop_conversions (tree exp
)
12211 while (tree_nop_conversion (exp
))
12212 exp
= TREE_OPERAND (exp
, 0);
12216 /* Strip conversions from EXP according to tree_sign_nop_conversion
12217 and return the resulting expression. */
12220 tree_strip_sign_nop_conversions (tree exp
)
12222 while (tree_sign_nop_conversion (exp
))
12223 exp
= TREE_OPERAND (exp
, 0);
12227 /* Avoid any floating point extensions from EXP. */
12229 strip_float_extensions (tree exp
)
12231 tree sub
, expt
, subt
;
12233 /* For floating point constant look up the narrowest type that can hold
12234 it properly and handle it like (type)(narrowest_type)constant.
12235 This way we can optimize for instance a=a*2.0 where "a" is float
12236 but 2.0 is double constant. */
12237 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12239 REAL_VALUE_TYPE orig
;
12242 orig
= TREE_REAL_CST (exp
);
12243 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12244 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12245 type
= float_type_node
;
12246 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12247 > TYPE_PRECISION (double_type_node
)
12248 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12249 type
= double_type_node
;
12251 return build_real_truncate (type
, orig
);
12254 if (!CONVERT_EXPR_P (exp
))
12257 sub
= TREE_OPERAND (exp
, 0);
12258 subt
= TREE_TYPE (sub
);
12259 expt
= TREE_TYPE (exp
);
12261 if (!FLOAT_TYPE_P (subt
))
12264 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12267 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12270 return strip_float_extensions (sub
);
12273 /* Strip out all handled components that produce invariant
12277 strip_invariant_refs (const_tree op
)
12279 while (handled_component_p (op
))
12281 switch (TREE_CODE (op
))
12284 case ARRAY_RANGE_REF
:
12285 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12286 || TREE_OPERAND (op
, 2) != NULL_TREE
12287 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12291 case COMPONENT_REF
:
12292 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12298 op
= TREE_OPERAND (op
, 0);
12304 static GTY(()) tree gcc_eh_personality_decl
;
12306 /* Return the GCC personality function decl. */
12309 lhd_gcc_personality (void)
12311 if (!gcc_eh_personality_decl
)
12312 gcc_eh_personality_decl
= build_personality_function ("gcc");
12313 return gcc_eh_personality_decl
;
12316 /* TARGET is a call target of GIMPLE call statement
12317 (obtained by gimple_call_fn). Return true if it is
12318 OBJ_TYPE_REF representing an virtual call of C++ method.
12319 (As opposed to OBJ_TYPE_REF representing objc calls
12320 through a cast where middle-end devirtualization machinery
12324 virtual_method_call_p (const_tree target
)
12326 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12328 tree t
= TREE_TYPE (target
);
12329 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12331 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12333 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12334 /* If we do not have BINFO associated, it means that type was built
12335 without devirtualization enabled. Do not consider this a virtual
12337 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12342 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12345 obj_type_ref_class (const_tree ref
)
12347 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12348 ref
= TREE_TYPE (ref
);
12349 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12350 ref
= TREE_TYPE (ref
);
12351 /* We look for type THIS points to. ObjC also builds
12352 OBJ_TYPE_REF with non-method calls, Their first parameter
12353 ID however also corresponds to class type. */
12354 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12355 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12356 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12357 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12358 return TREE_TYPE (ref
);
12361 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12364 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12367 tree base_binfo
, b
;
12369 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12370 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12371 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12373 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12378 /* Try to find a base info of BINFO that would have its field decl at offset
12379 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12380 found, return, otherwise return NULL_TREE. */
12383 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12385 tree type
= BINFO_TYPE (binfo
);
12389 HOST_WIDE_INT pos
, size
;
12393 if (types_same_for_odr (type
, expected_type
))
12395 if (maybe_lt (offset
, 0))
12398 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12400 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12403 pos
= int_bit_position (fld
);
12404 size
= tree_to_uhwi (DECL_SIZE (fld
));
12405 if (known_in_range_p (offset
, pos
, size
))
12408 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12411 /* Offset 0 indicates the primary base, whose vtable contents are
12412 represented in the binfo for the derived class. */
12413 else if (maybe_ne (offset
, 0))
12415 tree found_binfo
= NULL
, base_binfo
;
12416 /* Offsets in BINFO are in bytes relative to the whole structure
12417 while POS is in bits relative to the containing field. */
12418 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12421 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12422 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12423 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12425 found_binfo
= base_binfo
;
12429 binfo
= found_binfo
;
12431 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12435 type
= TREE_TYPE (fld
);
12440 /* Returns true if X is a typedef decl. */
12443 is_typedef_decl (const_tree x
)
12445 return (x
&& TREE_CODE (x
) == TYPE_DECL
12446 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12449 /* Returns true iff TYPE is a type variant created for a typedef. */
12452 typedef_variant_p (const_tree type
)
12454 return is_typedef_decl (TYPE_NAME (type
));
12457 /* Warn about a use of an identifier which was marked deprecated. */
12459 warn_deprecated_use (tree node
, tree attr
)
12463 if (node
== 0 || !warn_deprecated_decl
)
12469 attr
= DECL_ATTRIBUTES (node
);
12470 else if (TYPE_P (node
))
12472 tree decl
= TYPE_STUB_DECL (node
);
12474 attr
= lookup_attribute ("deprecated",
12475 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12480 attr
= lookup_attribute ("deprecated", attr
);
12483 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12491 w
= warning (OPT_Wdeprecated_declarations
,
12492 "%qD is deprecated: %s", node
, msg
);
12494 w
= warning (OPT_Wdeprecated_declarations
,
12495 "%qD is deprecated", node
);
12497 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12499 else if (TYPE_P (node
))
12501 tree what
= NULL_TREE
;
12502 tree decl
= TYPE_STUB_DECL (node
);
12504 if (TYPE_NAME (node
))
12506 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12507 what
= TYPE_NAME (node
);
12508 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12509 && DECL_NAME (TYPE_NAME (node
)))
12510 what
= DECL_NAME (TYPE_NAME (node
));
12518 w
= warning (OPT_Wdeprecated_declarations
,
12519 "%qE is deprecated: %s", what
, msg
);
12521 w
= warning (OPT_Wdeprecated_declarations
,
12522 "%qE is deprecated", what
);
12527 w
= warning (OPT_Wdeprecated_declarations
,
12528 "type is deprecated: %s", msg
);
12530 w
= warning (OPT_Wdeprecated_declarations
,
12531 "type is deprecated");
12534 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12541 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12544 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12549 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12552 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12558 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12559 somewhere in it. */
12562 contains_bitfld_component_ref_p (const_tree ref
)
12564 while (handled_component_p (ref
))
12566 if (TREE_CODE (ref
) == COMPONENT_REF
12567 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12569 ref
= TREE_OPERAND (ref
, 0);
12575 /* Try to determine whether a TRY_CATCH expression can fall through.
12576 This is a subroutine of block_may_fallthru. */
12579 try_catch_may_fallthru (const_tree stmt
)
12581 tree_stmt_iterator i
;
12583 /* If the TRY block can fall through, the whole TRY_CATCH can
12585 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12588 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12589 switch (TREE_CODE (tsi_stmt (i
)))
12592 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12593 catch expression and a body. The whole TRY_CATCH may fall
12594 through iff any of the catch bodies falls through. */
12595 for (; !tsi_end_p (i
); tsi_next (&i
))
12597 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12602 case EH_FILTER_EXPR
:
12603 /* The exception filter expression only matters if there is an
12604 exception. If the exception does not match EH_FILTER_TYPES,
12605 we will execute EH_FILTER_FAILURE, and we will fall through
12606 if that falls through. If the exception does match
12607 EH_FILTER_TYPES, the stack unwinder will continue up the
12608 stack, so we will not fall through. We don't know whether we
12609 will throw an exception which matches EH_FILTER_TYPES or not,
12610 so we just ignore EH_FILTER_TYPES and assume that we might
12611 throw an exception which doesn't match. */
12612 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12615 /* This case represents statements to be executed when an
12616 exception occurs. Those statements are implicitly followed
12617 by a RESX statement to resume execution after the exception.
12618 So in this case the TRY_CATCH never falls through. */
12623 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12624 need not be 100% accurate; simply be conservative and return true if we
12625 don't know. This is used only to avoid stupidly generating extra code.
12626 If we're wrong, we'll just delete the extra code later. */
12629 block_may_fallthru (const_tree block
)
12631 /* This CONST_CAST is okay because expr_last returns its argument
12632 unmodified and we assign it to a const_tree. */
12633 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12635 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12639 /* Easy cases. If the last statement of the block implies
12640 control transfer, then we can't fall through. */
12644 /* If there is a default: label or case labels cover all possible
12645 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12646 to some case label in all cases and all we care is whether the
12647 SWITCH_BODY falls through. */
12648 if (SWITCH_ALL_CASES_P (stmt
))
12649 return block_may_fallthru (SWITCH_BODY (stmt
));
12653 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12655 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12658 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12660 case TRY_CATCH_EXPR
:
12661 return try_catch_may_fallthru (stmt
);
12663 case TRY_FINALLY_EXPR
:
12664 /* The finally clause is always executed after the try clause,
12665 so if it does not fall through, then the try-finally will not
12666 fall through. Otherwise, if the try clause does not fall
12667 through, then when the finally clause falls through it will
12668 resume execution wherever the try clause was going. So the
12669 whole try-finally will only fall through if both the try
12670 clause and the finally clause fall through. */
12671 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12672 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12675 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12676 stmt
= TREE_OPERAND (stmt
, 1);
12682 /* Functions that do not return do not fall through. */
12683 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12685 case CLEANUP_POINT_EXPR
:
12686 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12689 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12695 return lang_hooks
.block_may_fallthru (stmt
);
12699 /* True if we are using EH to handle cleanups. */
12700 static bool using_eh_for_cleanups_flag
= false;
12702 /* This routine is called from front ends to indicate eh should be used for
12705 using_eh_for_cleanups (void)
12707 using_eh_for_cleanups_flag
= true;
12710 /* Query whether EH is used for cleanups. */
12712 using_eh_for_cleanups_p (void)
12714 return using_eh_for_cleanups_flag
;
12717 /* Wrapper for tree_code_name to ensure that tree code is valid */
12719 get_tree_code_name (enum tree_code code
)
12721 const char *invalid
= "<invalid tree code>";
12723 if (code
>= MAX_TREE_CODES
)
12726 return tree_code_name
[code
];
12729 /* Drops the TREE_OVERFLOW flag from T. */
12732 drop_tree_overflow (tree t
)
12734 gcc_checking_assert (TREE_OVERFLOW (t
));
12736 /* For tree codes with a sharing machinery re-build the result. */
12737 if (poly_int_tree_p (t
))
12738 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
12740 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12741 and canonicalize the result. */
12742 if (TREE_CODE (t
) == VECTOR_CST
)
12744 tree_vector_builder builder
;
12745 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12746 unsigned int count
= builder
.encoded_nelts ();
12747 for (unsigned int i
= 0; i
< count
; ++i
)
12749 tree elt
= VECTOR_CST_ELT (t
, i
);
12750 if (TREE_OVERFLOW (elt
))
12751 elt
= drop_tree_overflow (elt
);
12752 builder
.quick_push (elt
);
12754 return builder
.build ();
12757 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12758 and drop the flag. */
12760 TREE_OVERFLOW (t
) = 0;
12762 /* For constants that contain nested constants, drop the flag
12763 from those as well. */
12764 if (TREE_CODE (t
) == COMPLEX_CST
)
12766 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12767 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12768 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12769 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12775 /* Given a memory reference expression T, return its base address.
12776 The base address of a memory reference expression is the main
12777 object being referenced. For instance, the base address for
12778 'array[i].fld[j]' is 'array'. You can think of this as stripping
12779 away the offset part from a memory address.
12781 This function calls handled_component_p to strip away all the inner
12782 parts of the memory reference until it reaches the base object. */
12785 get_base_address (tree t
)
12787 while (handled_component_p (t
))
12788 t
= TREE_OPERAND (t
, 0);
12790 if ((TREE_CODE (t
) == MEM_REF
12791 || TREE_CODE (t
) == TARGET_MEM_REF
)
12792 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12793 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12795 /* ??? Either the alias oracle or all callers need to properly deal
12796 with WITH_SIZE_EXPRs before we can look through those. */
12797 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12803 /* Return a tree of sizetype representing the size, in bytes, of the element
12804 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12807 array_ref_element_size (tree exp
)
12809 tree aligned_size
= TREE_OPERAND (exp
, 3);
12810 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12811 location_t loc
= EXPR_LOCATION (exp
);
12813 /* If a size was specified in the ARRAY_REF, it's the size measured
12814 in alignment units of the element type. So multiply by that value. */
12817 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12818 sizetype from another type of the same width and signedness. */
12819 if (TREE_TYPE (aligned_size
) != sizetype
)
12820 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12821 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12822 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12825 /* Otherwise, take the size from that of the element type. Substitute
12826 any PLACEHOLDER_EXPR that we have. */
12828 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12831 /* Return a tree representing the lower bound of the array mentioned in
12832 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12835 array_ref_low_bound (tree exp
)
12837 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12839 /* If a lower bound is specified in EXP, use it. */
12840 if (TREE_OPERAND (exp
, 2))
12841 return TREE_OPERAND (exp
, 2);
12843 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12844 substituting for a PLACEHOLDER_EXPR as needed. */
12845 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12846 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12848 /* Otherwise, return a zero of the appropriate type. */
12849 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12852 /* Return a tree representing the upper bound of the array mentioned in
12853 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12856 array_ref_up_bound (tree exp
)
12858 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12860 /* If there is a domain type and it has an upper bound, use it, substituting
12861 for a PLACEHOLDER_EXPR as needed. */
12862 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12863 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12865 /* Otherwise fail. */
12869 /* Returns true if REF is an array reference or a component reference
12870 to an array at the end of a structure.
12871 If this is the case, the array may be allocated larger
12872 than its upper bound implies. */
12875 array_at_struct_end_p (tree ref
)
12879 if (TREE_CODE (ref
) == ARRAY_REF
12880 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12882 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12883 ref
= TREE_OPERAND (ref
, 0);
12885 else if (TREE_CODE (ref
) == COMPONENT_REF
12886 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12887 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12891 if (TREE_CODE (ref
) == STRING_CST
)
12894 tree ref_to_array
= ref
;
12895 while (handled_component_p (ref
))
12897 /* If the reference chain contains a component reference to a
12898 non-union type and there follows another field the reference
12899 is not at the end of a structure. */
12900 if (TREE_CODE (ref
) == COMPONENT_REF
)
12902 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12904 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12905 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12906 nextf
= DECL_CHAIN (nextf
);
12911 /* If we have a multi-dimensional array we do not consider
12912 a non-innermost dimension as flex array if the whole
12913 multi-dimensional array is at struct end.
12914 Same for an array of aggregates with a trailing array
12916 else if (TREE_CODE (ref
) == ARRAY_REF
)
12918 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12920 /* If we view an underlying object as sth else then what we
12921 gathered up to now is what we have to rely on. */
12922 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12925 gcc_unreachable ();
12927 ref
= TREE_OPERAND (ref
, 0);
12930 /* The array now is at struct end. Treat flexible arrays as
12931 always subject to extend, even into just padding constrained by
12932 an underlying decl. */
12933 if (! TYPE_SIZE (atype
)
12934 || ! TYPE_DOMAIN (atype
)
12935 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12938 if (TREE_CODE (ref
) == MEM_REF
12939 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12940 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12942 /* If the reference is based on a declared entity, the size of the array
12943 is constrained by its given domain. (Do not trust commons PR/69368). */
12945 && !(flag_unconstrained_commons
12946 && VAR_P (ref
) && DECL_COMMON (ref
))
12947 && DECL_SIZE_UNIT (ref
)
12948 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
12950 /* Check whether the array domain covers all of the available
12953 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
12954 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
12955 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
12957 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
12960 /* If at least one extra element fits it is a flexarray. */
12961 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12962 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
12964 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
12965 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
12974 /* Return a tree representing the offset, in bytes, of the field referenced
12975 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12978 component_ref_field_offset (tree exp
)
12980 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12981 tree field
= TREE_OPERAND (exp
, 1);
12982 location_t loc
= EXPR_LOCATION (exp
);
12984 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12985 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12987 if (aligned_offset
)
12989 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12990 sizetype from another type of the same width and signedness. */
12991 if (TREE_TYPE (aligned_offset
) != sizetype
)
12992 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12993 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12994 size_int (DECL_OFFSET_ALIGN (field
)
12998 /* Otherwise, take the offset from that of the field. Substitute
12999 any PLACEHOLDER_EXPR that we have. */
13001 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13004 /* Return the machine mode of T. For vectors, returns the mode of the
13005 inner type. The main use case is to feed the result to HONOR_NANS,
13006 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13009 element_mode (const_tree t
)
13013 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13015 return TYPE_MODE (t
);
13018 /* Vector types need to re-check the target flags each time we report
13019 the machine mode. We need to do this because attribute target can
13020 change the result of vector_mode_supported_p and have_regs_of_mode
13021 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13022 change on a per-function basis. */
13023 /* ??? Possibly a better solution is to run through all the types
13024 referenced by a function and re-compute the TYPE_MODE once, rather
13025 than make the TYPE_MODE macro call a function. */
13028 vector_type_mode (const_tree t
)
13032 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13034 mode
= t
->type_common
.mode
;
13035 if (VECTOR_MODE_P (mode
)
13036 && (!targetm
.vector_mode_supported_p (mode
)
13037 || !have_regs_of_mode
[mode
]))
13039 scalar_int_mode innermode
;
13041 /* For integers, try mapping it to a same-sized scalar mode. */
13042 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13044 unsigned int size
= (TYPE_VECTOR_SUBPARTS (t
)
13045 * GET_MODE_BITSIZE (innermode
));
13046 scalar_int_mode mode
;
13047 if (int_mode_for_size (size
, 0).exists (&mode
)
13048 && have_regs_of_mode
[mode
])
13058 /* Verify that basic properties of T match TV and thus T can be a variant of
13059 TV. TV should be the more specified variant (i.e. the main variant). */
13062 verify_type_variant (const_tree t
, tree tv
)
13064 /* Type variant can differ by:
13066 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13067 ENCODE_QUAL_ADDR_SPACE.
13068 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13069 in this case some values may not be set in the variant types
13070 (see TYPE_COMPLETE_P checks).
13071 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13072 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13073 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13074 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13075 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13076 this is necessary to make it possible to merge types form different TUs
13077 - arrays, pointers and references may have TREE_TYPE that is a variant
13078 of TREE_TYPE of their main variants.
13079 - aggregates may have new TYPE_FIELDS list that list variants of
13080 the main variant TYPE_FIELDS.
13081 - vector types may differ by TYPE_VECTOR_OPAQUE
13084 /* Convenience macro for matching individual fields. */
13085 #define verify_variant_match(flag) \
13087 if (flag (tv) != flag (t)) \
13089 error ("type variant differs by " #flag "."); \
13095 /* tree_base checks. */
13097 verify_variant_match (TREE_CODE
);
13098 /* FIXME: Ada builds non-artificial variants of artificial types. */
13099 if (TYPE_ARTIFICIAL (tv
) && 0)
13100 verify_variant_match (TYPE_ARTIFICIAL
);
13101 if (POINTER_TYPE_P (tv
))
13102 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13103 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13104 verify_variant_match (TYPE_UNSIGNED
);
13105 verify_variant_match (TYPE_PACKED
);
13106 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13107 verify_variant_match (TYPE_REF_IS_RVALUE
);
13108 if (AGGREGATE_TYPE_P (t
))
13109 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13111 verify_variant_match (TYPE_SATURATING
);
13112 /* FIXME: This check trigger during libstdc++ build. */
13113 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13114 verify_variant_match (TYPE_FINAL_P
);
13116 /* tree_type_common checks. */
13118 if (COMPLETE_TYPE_P (t
))
13120 verify_variant_match (TYPE_MODE
);
13121 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13122 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13123 verify_variant_match (TYPE_SIZE
);
13124 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13125 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13126 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13128 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13129 TYPE_SIZE_UNIT (tv
), 0));
13130 error ("type variant has different TYPE_SIZE_UNIT");
13132 error ("type variant's TYPE_SIZE_UNIT");
13133 debug_tree (TYPE_SIZE_UNIT (tv
));
13134 error ("type's TYPE_SIZE_UNIT");
13135 debug_tree (TYPE_SIZE_UNIT (t
));
13139 verify_variant_match (TYPE_PRECISION
);
13140 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13141 if (RECORD_OR_UNION_TYPE_P (t
))
13142 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13143 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13144 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13145 /* During LTO we merge variant lists from diferent translation units
13146 that may differ BY TYPE_CONTEXT that in turn may point
13147 to TRANSLATION_UNIT_DECL.
13148 Ada also builds variants of types with different TYPE_CONTEXT. */
13149 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13150 verify_variant_match (TYPE_CONTEXT
);
13151 verify_variant_match (TYPE_STRING_FLAG
);
13152 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13154 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13159 /* tree_type_non_common checks. */
13161 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13162 and dangle the pointer from time to time. */
13163 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13164 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13165 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13167 error ("type variant has different TYPE_VFIELD");
13171 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13172 || TREE_CODE (t
) == INTEGER_TYPE
13173 || TREE_CODE (t
) == BOOLEAN_TYPE
13174 || TREE_CODE (t
) == REAL_TYPE
13175 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13177 verify_variant_match (TYPE_MAX_VALUE
);
13178 verify_variant_match (TYPE_MIN_VALUE
);
13180 if (TREE_CODE (t
) == METHOD_TYPE
)
13181 verify_variant_match (TYPE_METHOD_BASETYPE
);
13182 if (TREE_CODE (t
) == OFFSET_TYPE
)
13183 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13184 if (TREE_CODE (t
) == ARRAY_TYPE
)
13185 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13186 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13187 or even type's main variant. This is needed to make bootstrap pass
13188 and the bug seems new in GCC 5.
13189 C++ FE should be updated to make this consistent and we should check
13190 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13191 is a match with main variant.
13193 Also disable the check for Java for now because of parser hack that builds
13194 first an dummy BINFO and then sometimes replace it by real BINFO in some
13196 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13197 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13198 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13199 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13200 at LTO time only. */
13201 && (in_lto_p
&& odr_type_p (t
)))
13203 error ("type variant has different TYPE_BINFO");
13205 error ("type variant's TYPE_BINFO");
13206 debug_tree (TYPE_BINFO (tv
));
13207 error ("type's TYPE_BINFO");
13208 debug_tree (TYPE_BINFO (t
));
13212 /* Check various uses of TYPE_VALUES_RAW. */
13213 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13214 verify_variant_match (TYPE_VALUES
);
13215 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13216 verify_variant_match (TYPE_DOMAIN
);
13217 /* Permit incomplete variants of complete type. While FEs may complete
13218 all variants, this does not happen for C++ templates in all cases. */
13219 else if (RECORD_OR_UNION_TYPE_P (t
)
13220 && COMPLETE_TYPE_P (t
)
13221 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13225 /* Fortran builds qualified variants as new records with items of
13226 qualified type. Verify that they looks same. */
13227 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13229 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13230 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13231 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13232 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13233 /* FIXME: gfc_nonrestricted_type builds all types as variants
13234 with exception of pointer types. It deeply copies the type
13235 which means that we may end up with a variant type
13236 referring non-variant pointer. We may change it to
13237 produce types as variants, too, like
13238 objc_get_protocol_qualified_type does. */
13239 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13240 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13241 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13245 error ("type variant has different TYPE_FIELDS");
13247 error ("first mismatch is field");
13249 error ("and field");
13254 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13255 verify_variant_match (TYPE_ARG_TYPES
);
13256 /* For C++ the qualified variant of array type is really an array type
13257 of qualified TREE_TYPE.
13258 objc builds variants of pointer where pointer to type is a variant, too
13259 in objc_get_protocol_qualified_type. */
13260 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13261 && ((TREE_CODE (t
) != ARRAY_TYPE
13262 && !POINTER_TYPE_P (t
))
13263 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13264 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13266 error ("type variant has different TREE_TYPE");
13268 error ("type variant's TREE_TYPE");
13269 debug_tree (TREE_TYPE (tv
));
13270 error ("type's TREE_TYPE");
13271 debug_tree (TREE_TYPE (t
));
13274 if (type_with_alias_set_p (t
)
13275 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13277 error ("type is not compatible with its variant");
13279 error ("type variant's TREE_TYPE");
13280 debug_tree (TREE_TYPE (tv
));
13281 error ("type's TREE_TYPE");
13282 debug_tree (TREE_TYPE (t
));
13286 #undef verify_variant_match
13290 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13291 the middle-end types_compatible_p function. It needs to avoid
13292 claiming types are different for types that should be treated
13293 the same with respect to TBAA. Canonical types are also used
13294 for IL consistency checks via the useless_type_conversion_p
13295 predicate which does not handle all type kinds itself but falls
13296 back to pointer-comparison of TYPE_CANONICAL for aggregates
13299 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13300 type calculation because we need to allow inter-operability between signed
13301 and unsigned variants. */
13304 type_with_interoperable_signedness (const_tree type
)
13306 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13307 signed char and unsigned char. Similarly fortran FE builds
13308 C_SIZE_T as signed type, while C defines it unsigned. */
13310 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13312 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13313 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13316 /* Return true iff T1 and T2 are structurally identical for what
13318 This function is used both by lto.c canonical type merging and by the
13319 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13320 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13321 only for LTO because only in these cases TYPE_CANONICAL equivalence
13322 correspond to one defined by gimple_canonical_types_compatible_p. */
13325 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13326 bool trust_type_canonical
)
13328 /* Type variants should be same as the main variant. When not doing sanity
13329 checking to verify this fact, go to main variants and save some work. */
13330 if (trust_type_canonical
)
13332 t1
= TYPE_MAIN_VARIANT (t1
);
13333 t2
= TYPE_MAIN_VARIANT (t2
);
13336 /* Check first for the obvious case of pointer identity. */
13340 /* Check that we have two types to compare. */
13341 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13344 /* We consider complete types always compatible with incomplete type.
13345 This does not make sense for canonical type calculation and thus we
13346 need to ensure that we are never called on it.
13348 FIXME: For more correctness the function probably should have three modes
13349 1) mode assuming that types are complete mathcing their structure
13350 2) mode allowing incomplete types but producing equivalence classes
13351 and thus ignoring all info from complete types
13352 3) mode allowing incomplete types to match complete but checking
13353 compatibility between complete types.
13355 1 and 2 can be used for canonical type calculation. 3 is the real
13356 definition of type compatibility that can be used i.e. for warnings during
13357 declaration merging. */
13359 gcc_assert (!trust_type_canonical
13360 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13361 /* If the types have been previously registered and found equal
13364 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13365 && trust_type_canonical
)
13367 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13368 they are always NULL, but they are set to non-NULL for types
13369 constructed by build_pointer_type and variants. In this case the
13370 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13371 all pointers are considered equal. Be sure to not return false
13373 gcc_checking_assert (canonical_type_used_p (t1
)
13374 && canonical_type_used_p (t2
));
13375 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13378 /* Can't be the same type if the types don't have the same code. */
13379 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13380 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13383 /* Qualifiers do not matter for canonical type comparison purposes. */
13385 /* Void types and nullptr types are always the same. */
13386 if (TREE_CODE (t1
) == VOID_TYPE
13387 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13390 /* Can't be the same type if they have different mode. */
13391 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13394 /* Non-aggregate types can be handled cheaply. */
13395 if (INTEGRAL_TYPE_P (t1
)
13396 || SCALAR_FLOAT_TYPE_P (t1
)
13397 || FIXED_POINT_TYPE_P (t1
)
13398 || TREE_CODE (t1
) == VECTOR_TYPE
13399 || TREE_CODE (t1
) == COMPLEX_TYPE
13400 || TREE_CODE (t1
) == OFFSET_TYPE
13401 || POINTER_TYPE_P (t1
))
13403 /* Can't be the same type if they have different recision. */
13404 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13407 /* In some cases the signed and unsigned types are required to be
13409 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13410 && !type_with_interoperable_signedness (t1
))
13413 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13414 interoperable with "signed char". Unless all frontends are revisited
13415 to agree on these types, we must ignore the flag completely. */
13417 /* Fortran standard define C_PTR type that is compatible with every
13418 C pointer. For this reason we need to glob all pointers into one.
13419 Still pointers in different address spaces are not compatible. */
13420 if (POINTER_TYPE_P (t1
))
13422 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13423 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13427 /* Tail-recurse to components. */
13428 if (TREE_CODE (t1
) == VECTOR_TYPE
13429 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13430 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13432 trust_type_canonical
);
13437 /* Do type-specific comparisons. */
13438 switch (TREE_CODE (t1
))
13441 /* Array types are the same if the element types are the same and
13442 the number of elements are the same. */
13443 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13444 trust_type_canonical
)
13445 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13446 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13447 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13451 tree i1
= TYPE_DOMAIN (t1
);
13452 tree i2
= TYPE_DOMAIN (t2
);
13454 /* For an incomplete external array, the type domain can be
13455 NULL_TREE. Check this condition also. */
13456 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13458 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13462 tree min1
= TYPE_MIN_VALUE (i1
);
13463 tree min2
= TYPE_MIN_VALUE (i2
);
13464 tree max1
= TYPE_MAX_VALUE (i1
);
13465 tree max2
= TYPE_MAX_VALUE (i2
);
13467 /* The minimum/maximum values have to be the same. */
13470 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13471 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13472 || operand_equal_p (min1
, min2
, 0))))
13475 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13476 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13477 || operand_equal_p (max1
, max2
, 0)))))
13485 case FUNCTION_TYPE
:
13486 /* Function types are the same if the return type and arguments types
13488 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13489 trust_type_canonical
))
13492 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13496 tree parms1
, parms2
;
13498 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13500 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13502 if (!gimple_canonical_types_compatible_p
13503 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13504 trust_type_canonical
))
13508 if (parms1
|| parms2
)
13516 case QUAL_UNION_TYPE
:
13520 /* Don't try to compare variants of an incomplete type, before
13521 TYPE_FIELDS has been copied around. */
13522 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13526 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13529 /* For aggregate types, all the fields must be the same. */
13530 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13532 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13534 /* Skip non-fields and zero-sized fields. */
13535 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13537 && integer_zerop (DECL_SIZE (f1
)))))
13538 f1
= TREE_CHAIN (f1
);
13539 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13541 && integer_zerop (DECL_SIZE (f2
)))))
13542 f2
= TREE_CHAIN (f2
);
13545 /* The fields must have the same name, offset and type. */
13546 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13547 || !gimple_compare_field_offset (f1
, f2
)
13548 || !gimple_canonical_types_compatible_p
13549 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13550 trust_type_canonical
))
13554 /* If one aggregate has more fields than the other, they
13555 are not the same. */
13563 /* Consider all types with language specific trees in them mutually
13564 compatible. This is executed only from verify_type and false
13565 positives can be tolerated. */
13566 gcc_assert (!in_lto_p
);
13571 /* Verify type T. */
13574 verify_type (const_tree t
)
13576 bool error_found
= false;
13577 tree mv
= TYPE_MAIN_VARIANT (t
);
13580 error ("Main variant is not defined");
13581 error_found
= true;
13583 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13585 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13587 error_found
= true;
13589 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13590 error_found
= true;
13592 tree ct
= TYPE_CANONICAL (t
);
13595 else if (TYPE_CANONICAL (t
) != ct
)
13597 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13599 error_found
= true;
13601 /* Method and function types can not be used to address memory and thus
13602 TYPE_CANONICAL really matters only for determining useless conversions.
13604 FIXME: C++ FE produce declarations of builtin functions that are not
13605 compatible with main variants. */
13606 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13609 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13610 with variably sized arrays because their sizes possibly
13611 gimplified to different variables. */
13612 && !variably_modified_type_p (ct
, NULL
)
13613 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13615 error ("TYPE_CANONICAL is not compatible");
13617 error_found
= true;
13620 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13621 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13623 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13625 error_found
= true;
13627 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13629 error ("TYPE_CANONICAL of main variant is not main variant");
13631 debug_tree (TYPE_MAIN_VARIANT (ct
));
13632 error_found
= true;
13636 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13637 if (RECORD_OR_UNION_TYPE_P (t
))
13639 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13640 and danagle the pointer from time to time. */
13641 if (TYPE_VFIELD (t
)
13642 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13643 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13645 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13646 debug_tree (TYPE_VFIELD (t
));
13647 error_found
= true;
13650 else if (TREE_CODE (t
) == POINTER_TYPE
)
13652 if (TYPE_NEXT_PTR_TO (t
)
13653 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13655 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13656 debug_tree (TYPE_NEXT_PTR_TO (t
));
13657 error_found
= true;
13660 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13662 if (TYPE_NEXT_REF_TO (t
)
13663 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13665 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13666 debug_tree (TYPE_NEXT_REF_TO (t
));
13667 error_found
= true;
13670 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13671 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13673 /* FIXME: The following check should pass:
13674 useless_type_conversion_p (const_cast <tree> (t),
13675 TREE_TYPE (TYPE_MIN_VALUE (t))
13676 but does not for C sizetypes in LTO. */
13679 /* Check various uses of TYPE_MAXVAL_RAW. */
13680 if (RECORD_OR_UNION_TYPE_P (t
))
13682 if (!TYPE_BINFO (t
))
13684 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13686 error ("TYPE_BINFO is not TREE_BINFO");
13687 debug_tree (TYPE_BINFO (t
));
13688 error_found
= true;
13690 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13692 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13693 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13694 error_found
= true;
13697 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13699 if (TYPE_METHOD_BASETYPE (t
)
13700 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13701 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13703 error ("TYPE_METHOD_BASETYPE is not record nor union");
13704 debug_tree (TYPE_METHOD_BASETYPE (t
));
13705 error_found
= true;
13708 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13710 if (TYPE_OFFSET_BASETYPE (t
)
13711 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13712 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13714 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13715 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13716 error_found
= true;
13719 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13720 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13722 /* FIXME: The following check should pass:
13723 useless_type_conversion_p (const_cast <tree> (t),
13724 TREE_TYPE (TYPE_MAX_VALUE (t))
13725 but does not for C sizetypes in LTO. */
13727 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13729 if (TYPE_ARRAY_MAX_SIZE (t
)
13730 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13732 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13733 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13734 error_found
= true;
13737 else if (TYPE_MAX_VALUE_RAW (t
))
13739 error ("TYPE_MAX_VALUE_RAW non-NULL");
13740 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13741 error_found
= true;
13744 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13746 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13747 debug_tree (TYPE_LANG_SLOT_1 (t
));
13748 error_found
= true;
13751 /* Check various uses of TYPE_VALUES_RAW. */
13752 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13753 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13755 tree value
= TREE_VALUE (l
);
13756 tree name
= TREE_PURPOSE (l
);
13758 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13759 CONST_DECL of ENUMERAL TYPE. */
13760 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13762 error ("Enum value is not CONST_DECL or INTEGER_CST");
13763 debug_tree (value
);
13765 error_found
= true;
13767 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13768 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13770 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13771 debug_tree (value
);
13773 error_found
= true;
13775 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13777 error ("Enum value name is not IDENTIFIER_NODE");
13778 debug_tree (value
);
13780 error_found
= true;
13783 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13785 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13787 error ("Array TYPE_DOMAIN is not integer type");
13788 debug_tree (TYPE_DOMAIN (t
));
13789 error_found
= true;
13792 else if (RECORD_OR_UNION_TYPE_P (t
))
13794 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13796 error ("TYPE_FIELDS defined in incomplete type");
13797 error_found
= true;
13799 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13801 /* TODO: verify properties of decls. */
13802 if (TREE_CODE (fld
) == FIELD_DECL
)
13804 else if (TREE_CODE (fld
) == TYPE_DECL
)
13806 else if (TREE_CODE (fld
) == CONST_DECL
)
13808 else if (VAR_P (fld
))
13810 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13812 else if (TREE_CODE (fld
) == USING_DECL
)
13814 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13818 error ("Wrong tree in TYPE_FIELDS list");
13820 error_found
= true;
13824 else if (TREE_CODE (t
) == INTEGER_TYPE
13825 || TREE_CODE (t
) == BOOLEAN_TYPE
13826 || TREE_CODE (t
) == OFFSET_TYPE
13827 || TREE_CODE (t
) == REFERENCE_TYPE
13828 || TREE_CODE (t
) == NULLPTR_TYPE
13829 || TREE_CODE (t
) == POINTER_TYPE
)
13831 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13833 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13834 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13835 error_found
= true;
13837 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13839 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13840 debug_tree (TYPE_CACHED_VALUES (t
));
13841 error_found
= true;
13843 /* Verify just enough of cache to ensure that no one copied it to new type.
13844 All copying should go by copy_node that should clear it. */
13845 else if (TYPE_CACHED_VALUES_P (t
))
13848 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13849 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13850 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13852 error ("wrong TYPE_CACHED_VALUES entry");
13853 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13854 error_found
= true;
13859 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13860 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13862 /* C++ FE uses TREE_PURPOSE to store initial values. */
13863 if (TREE_PURPOSE (l
) && in_lto_p
)
13865 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13867 error_found
= true;
13869 if (!TYPE_P (TREE_VALUE (l
)))
13871 error ("Wrong entry in TYPE_ARG_TYPES list");
13873 error_found
= true;
13876 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13878 error ("TYPE_VALUES_RAW field is non-NULL");
13879 debug_tree (TYPE_VALUES_RAW (t
));
13880 error_found
= true;
13882 if (TREE_CODE (t
) != INTEGER_TYPE
13883 && TREE_CODE (t
) != BOOLEAN_TYPE
13884 && TREE_CODE (t
) != OFFSET_TYPE
13885 && TREE_CODE (t
) != REFERENCE_TYPE
13886 && TREE_CODE (t
) != NULLPTR_TYPE
13887 && TREE_CODE (t
) != POINTER_TYPE
13888 && TYPE_CACHED_VALUES_P (t
))
13890 error ("TYPE_CACHED_VALUES_P is set while it should not");
13891 error_found
= true;
13893 if (TYPE_STRING_FLAG (t
)
13894 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13896 error ("TYPE_STRING_FLAG is set on wrong type code");
13897 error_found
= true;
13900 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13901 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13903 if (TREE_CODE (t
) == METHOD_TYPE
13904 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13906 error ("TYPE_METHOD_BASETYPE is not main variant");
13907 error_found
= true;
13912 debug_tree (const_cast <tree
> (t
));
13913 internal_error ("verify_type failed");
13918 /* Return 1 if ARG interpreted as signed in its precision is known to be
13919 always positive or 2 if ARG is known to be always negative, or 3 if
13920 ARG may be positive or negative. */
13923 get_range_pos_neg (tree arg
)
13925 if (arg
== error_mark_node
)
13928 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13930 if (TREE_CODE (arg
) == INTEGER_CST
)
13932 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
13938 while (CONVERT_EXPR_P (arg
)
13939 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13940 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13942 arg
= TREE_OPERAND (arg
, 0);
13943 /* Narrower value zero extended into wider type
13944 will always result in positive values. */
13945 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13946 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13948 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13953 if (TREE_CODE (arg
) != SSA_NAME
)
13955 wide_int arg_min
, arg_max
;
13956 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13958 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13959 if (is_gimple_assign (g
)
13960 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13962 tree t
= gimple_assign_rhs1 (g
);
13963 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13964 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13966 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13967 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13969 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13978 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13980 /* For unsigned values, the "positive" range comes
13981 below the "negative" range. */
13982 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13984 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13989 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13991 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14000 /* Return true if ARG is marked with the nonnull attribute in the
14001 current function signature. */
14004 nonnull_arg_p (const_tree arg
)
14006 tree t
, attrs
, fntype
;
14007 unsigned HOST_WIDE_INT arg_num
;
14009 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14010 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14011 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14013 /* The static chain decl is always non null. */
14014 if (arg
== cfun
->static_chain_decl
)
14017 /* THIS argument of method is always non-NULL. */
14018 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14019 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14020 && flag_delete_null_pointer_checks
)
14023 /* Values passed by reference are always non-NULL. */
14024 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14025 && flag_delete_null_pointer_checks
)
14028 fntype
= TREE_TYPE (cfun
->decl
);
14029 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14031 attrs
= lookup_attribute ("nonnull", attrs
);
14033 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14034 if (attrs
== NULL_TREE
)
14037 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14038 if (TREE_VALUE (attrs
) == NULL_TREE
)
14041 /* Get the position number for ARG in the function signature. */
14042 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14044 t
= DECL_CHAIN (t
), arg_num
++)
14050 gcc_assert (t
== arg
);
14052 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14053 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14055 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14063 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14067 set_block (location_t loc
, tree block
)
14069 location_t pure_loc
= get_pure_location (loc
);
14070 source_range src_range
= get_range_from_loc (line_table
, loc
);
14071 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14075 set_source_range (tree expr
, location_t start
, location_t finish
)
14077 source_range src_range
;
14078 src_range
.m_start
= start
;
14079 src_range
.m_finish
= finish
;
14080 return set_source_range (expr
, src_range
);
14084 set_source_range (tree expr
, source_range src_range
)
14086 if (!EXPR_P (expr
))
14087 return UNKNOWN_LOCATION
;
14089 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14090 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14094 SET_EXPR_LOCATION (expr
, adhoc
);
14098 /* Return the name of combined function FN, for debugging purposes. */
14101 combined_fn_name (combined_fn fn
)
14103 if (builtin_fn_p (fn
))
14105 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14106 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14109 return internal_fn_name (as_internal_fn (fn
));
14112 /* Return a bitmap with a bit set corresponding to each argument in
14113 a function call type FNTYPE declared with attribute nonnull,
14114 or null if none of the function's argument are nonnull. The caller
14115 must free the bitmap. */
14118 get_nonnull_args (const_tree fntype
)
14120 if (fntype
== NULL_TREE
)
14123 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14127 bitmap argmap
= NULL
;
14129 /* A function declaration can specify multiple attribute nonnull,
14130 each with zero or more arguments. The loop below creates a bitmap
14131 representing a union of all the arguments. An empty (but non-null)
14132 bitmap means that all arguments have been declaraed nonnull. */
14133 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14135 attrs
= lookup_attribute ("nonnull", attrs
);
14140 argmap
= BITMAP_ALLOC (NULL
);
14142 if (!TREE_VALUE (attrs
))
14144 /* Clear the bitmap in case a previous attribute nonnull
14145 set it and this one overrides it for all arguments. */
14146 bitmap_clear (argmap
);
14150 /* Iterate over the indices of the format arguments declared nonnull
14151 and set a bit for each. */
14152 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14154 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14155 bitmap_set_bit (argmap
, val
);
14162 /* Returns true if TYPE is a type where it and all of its subobjects
14163 (recursively) are of structure, union, or array type. */
14166 default_is_empty_type (tree type
)
14168 if (RECORD_OR_UNION_TYPE_P (type
))
14170 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14171 if (TREE_CODE (field
) == FIELD_DECL
14172 && !DECL_PADDING_P (field
)
14173 && !default_is_empty_type (TREE_TYPE (field
)))
14177 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14178 return (integer_minus_onep (array_type_nelts (type
))
14179 || TYPE_DOMAIN (type
) == NULL_TREE
14180 || default_is_empty_type (TREE_TYPE (type
)));
14184 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14185 that shouldn't be passed via stack. */
14188 default_is_empty_record (const_tree type
)
14190 if (!abi_version_at_least (12))
14193 if (type
== error_mark_node
)
14196 if (TREE_ADDRESSABLE (type
))
14199 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14202 /* Like int_size_in_bytes, but handle empty records specially. */
14205 arg_int_size_in_bytes (const_tree type
)
14207 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14210 /* Like size_in_bytes, but handle empty records specially. */
14213 arg_size_in_bytes (const_tree type
)
14215 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14218 /* Return true if an expression with CODE has to have the same result type as
14219 its first operand. */
14222 expr_type_first_operand_type_p (tree_code code
)
14235 case TRUNC_DIV_EXPR
:
14236 case CEIL_DIV_EXPR
:
14237 case FLOOR_DIV_EXPR
:
14238 case ROUND_DIV_EXPR
:
14239 case TRUNC_MOD_EXPR
:
14240 case CEIL_MOD_EXPR
:
14241 case FLOOR_MOD_EXPR
:
14242 case ROUND_MOD_EXPR
:
14244 case EXACT_DIV_EXPR
:
14262 /* List of pointer types used to declare builtins before we have seen their
14265 Keep the size up to date in tree.h ! */
14266 const builtin_structptr_type builtin_structptr_types
[6] =
14268 { fileptr_type_node
, ptr_type_node
, "FILE" },
14269 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14270 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14271 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14272 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14273 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14278 namespace selftest
{
14280 /* Selftests for tree. */
14282 /* Verify that integer constants are sane. */
14285 test_integer_constants ()
14287 ASSERT_TRUE (integer_type_node
!= NULL
);
14288 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14290 tree type
= integer_type_node
;
14292 tree zero
= build_zero_cst (type
);
14293 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14294 ASSERT_EQ (type
, TREE_TYPE (zero
));
14296 tree one
= build_int_cst (type
, 1);
14297 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14298 ASSERT_EQ (type
, TREE_TYPE (zero
));
14301 /* Verify identifiers. */
14304 test_identifiers ()
14306 tree identifier
= get_identifier ("foo");
14307 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14308 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14311 /* Verify LABEL_DECL. */
14316 tree identifier
= get_identifier ("err");
14317 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14318 identifier
, void_type_node
);
14319 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14320 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14323 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14324 are given by VALS. */
14327 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
14329 gcc_assert (vals
.length () == TYPE_VECTOR_SUBPARTS (type
));
14330 tree_vector_builder
builder (type
, vals
.length (), 1);
14331 builder
.splice (vals
);
14332 return builder
.build ();
14335 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14338 check_vector_cst (vec
<tree
> expected
, tree actual
)
14340 ASSERT_EQ (expected
.length (), TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14341 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14342 ASSERT_EQ (wi::to_wide (expected
[i
]),
14343 wi::to_wide (vector_cst_elt (actual
, i
)));
14346 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14347 and that its elements match EXPECTED. */
14350 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14351 unsigned int npatterns
)
14353 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14354 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14355 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14356 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14357 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14358 check_vector_cst (expected
, actual
);
14361 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14362 and NPATTERNS background elements, and that its elements match
14366 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14367 unsigned int npatterns
)
14369 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14370 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14371 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14372 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14373 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14374 check_vector_cst (expected
, actual
);
14377 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14378 and that its elements match EXPECTED. */
14381 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14382 unsigned int npatterns
)
14384 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14385 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14386 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14387 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14388 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14389 check_vector_cst (expected
, actual
);
14392 /* Test the creation of VECTOR_CSTs. */
14395 test_vector_cst_patterns ()
14397 auto_vec
<tree
, 8> elements (8);
14398 elements
.quick_grow (8);
14399 tree element_type
= build_nonstandard_integer_type (16, true);
14400 tree vector_type
= build_vector_type (element_type
, 8);
14402 /* Test a simple linear series with a base of 0 and a step of 1:
14403 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14404 for (unsigned int i
= 0; i
< 8; ++i
)
14405 elements
[i
] = build_int_cst (element_type
, i
);
14406 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14408 /* Try the same with the first element replaced by 100:
14409 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14410 elements
[0] = build_int_cst (element_type
, 100);
14411 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14413 /* Try a series that wraps around.
14414 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14415 for (unsigned int i
= 1; i
< 8; ++i
)
14416 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14417 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14419 /* Try a downward series:
14420 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14421 for (unsigned int i
= 1; i
< 8; ++i
)
14422 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14423 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14425 /* Try two interleaved series with different bases and steps:
14426 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14427 elements
[1] = build_int_cst (element_type
, 53);
14428 for (unsigned int i
= 2; i
< 8; i
+= 2)
14430 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14431 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14433 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14435 /* Try a duplicated value:
14436 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14437 for (unsigned int i
= 1; i
< 8; ++i
)
14438 elements
[i
] = elements
[0];
14439 check_vector_cst_duplicate (elements
,
14440 build_vector (vector_type
, elements
), 1);
14442 /* Try an interleaved duplicated value:
14443 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14444 elements
[1] = build_int_cst (element_type
, 55);
14445 for (unsigned int i
= 2; i
< 8; ++i
)
14446 elements
[i
] = elements
[i
- 2];
14447 check_vector_cst_duplicate (elements
,
14448 build_vector (vector_type
, elements
), 2);
14450 /* Try a duplicated value with 2 exceptions
14451 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14452 elements
[0] = build_int_cst (element_type
, 41);
14453 elements
[1] = build_int_cst (element_type
, 97);
14454 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 2);
14456 /* Try with and without a step
14457 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14458 for (unsigned int i
= 3; i
< 8; i
+= 2)
14459 elements
[i
] = build_int_cst (element_type
, i
* 7);
14460 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14462 /* Try a fully-general constant:
14463 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14464 elements
[5] = build_int_cst (element_type
, 9990);
14465 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 4);
14468 /* Run all of the selftests within this file. */
14473 test_integer_constants ();
14474 test_identifiers ();
14476 test_vector_cst_patterns ();
14479 } // namespace selftest
14481 #endif /* CHECKING_P */
14483 #include "gt-tree.h"