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 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1934 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1937 recompute_constructor_flags (tree c
)
1941 bool constant_p
= true;
1942 bool side_effects_p
= false;
1943 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1945 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1947 /* Mostly ctors will have elts that don't have side-effects, so
1948 the usual case is to scan all the elements. Hence a single
1949 loop for both const and side effects, rather than one loop
1950 each (with early outs). */
1951 if (!TREE_CONSTANT (val
))
1953 if (TREE_SIDE_EFFECTS (val
))
1954 side_effects_p
= true;
1957 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1958 TREE_CONSTANT (c
) = constant_p
;
1961 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1965 verify_constructor_flags (tree c
)
1969 bool constant_p
= TREE_CONSTANT (c
);
1970 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1971 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1973 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1975 if (constant_p
&& !TREE_CONSTANT (val
))
1976 internal_error ("non-constant element in constant CONSTRUCTOR");
1977 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1978 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1982 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1983 are in the vec pointed to by VALS. */
1985 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1987 tree c
= make_node (CONSTRUCTOR
);
1989 TREE_TYPE (c
) = type
;
1990 CONSTRUCTOR_ELTS (c
) = vals
;
1992 recompute_constructor_flags (c
);
1997 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2000 build_constructor_single (tree type
, tree index
, tree value
)
2002 vec
<constructor_elt
, va_gc
> *v
;
2003 constructor_elt elt
= {index
, value
};
2006 v
->quick_push (elt
);
2008 return build_constructor (type
, v
);
2012 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2013 are in a list pointed to by VALS. */
2015 build_constructor_from_list (tree type
, tree vals
)
2018 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2022 vec_alloc (v
, list_length (vals
));
2023 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2024 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2027 return build_constructor (type
, v
);
2030 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2031 of elements, provided as index/value pairs. */
2034 build_constructor_va (tree type
, int nelts
, ...)
2036 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2039 va_start (p
, nelts
);
2040 vec_alloc (v
, nelts
);
2043 tree index
= va_arg (p
, tree
);
2044 tree value
= va_arg (p
, tree
);
2045 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2048 return build_constructor (type
, v
);
2051 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2054 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2057 FIXED_VALUE_TYPE
*fp
;
2059 v
= make_node (FIXED_CST
);
2060 fp
= ggc_alloc
<fixed_value
> ();
2061 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2063 TREE_TYPE (v
) = type
;
2064 TREE_FIXED_CST_PTR (v
) = fp
;
2068 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2071 build_real (tree type
, REAL_VALUE_TYPE d
)
2074 REAL_VALUE_TYPE
*dp
;
2077 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2078 Consider doing it via real_convert now. */
2080 v
= make_node (REAL_CST
);
2081 dp
= ggc_alloc
<real_value
> ();
2082 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2084 TREE_TYPE (v
) = type
;
2085 TREE_REAL_CST_PTR (v
) = dp
;
2086 TREE_OVERFLOW (v
) = overflow
;
2090 /* Like build_real, but first truncate D to the type. */
2093 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2095 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2098 /* Return a new REAL_CST node whose type is TYPE
2099 and whose value is the integer value of the INTEGER_CST node I. */
2102 real_value_from_int_cst (const_tree type
, const_tree i
)
2106 /* Clear all bits of the real value type so that we can later do
2107 bitwise comparisons to see if two values are the same. */
2108 memset (&d
, 0, sizeof d
);
2110 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2111 TYPE_SIGN (TREE_TYPE (i
)));
2115 /* Given a tree representing an integer constant I, return a tree
2116 representing the same value as a floating-point constant of type TYPE. */
2119 build_real_from_int_cst (tree type
, const_tree i
)
2122 int overflow
= TREE_OVERFLOW (i
);
2124 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2126 TREE_OVERFLOW (v
) |= overflow
;
2130 /* Return a newly constructed STRING_CST node whose value is
2131 the LEN characters at STR.
2132 Note that for a C string literal, LEN should include the trailing NUL.
2133 The TREE_TYPE is not initialized. */
2136 build_string (int len
, const char *str
)
2141 /* Do not waste bytes provided by padding of struct tree_string. */
2142 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2144 record_node_allocation_statistics (STRING_CST
, length
);
2146 s
= (tree
) ggc_internal_alloc (length
);
2148 memset (s
, 0, sizeof (struct tree_typed
));
2149 TREE_SET_CODE (s
, STRING_CST
);
2150 TREE_CONSTANT (s
) = 1;
2151 TREE_STRING_LENGTH (s
) = len
;
2152 memcpy (s
->string
.str
, str
, len
);
2153 s
->string
.str
[len
] = '\0';
2158 /* Return a newly constructed COMPLEX_CST node whose value is
2159 specified by the real and imaginary parts REAL and IMAG.
2160 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2161 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2164 build_complex (tree type
, tree real
, tree imag
)
2166 tree t
= make_node (COMPLEX_CST
);
2168 TREE_REALPART (t
) = real
;
2169 TREE_IMAGPART (t
) = imag
;
2170 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2171 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2175 /* Build a complex (inf +- 0i), such as for the result of cproj.
2176 TYPE is the complex tree type of the result. If NEG is true, the
2177 imaginary zero is negative. */
2180 build_complex_inf (tree type
, bool neg
)
2182 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2186 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2187 build_real (TREE_TYPE (type
), rzero
));
2190 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2191 element is set to 1. In particular, this is 1 + i for complex types. */
2194 build_each_one_cst (tree type
)
2196 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2198 tree scalar
= build_one_cst (TREE_TYPE (type
));
2199 return build_complex (type
, scalar
, scalar
);
2202 return build_one_cst (type
);
2205 /* Return a constant of arithmetic type TYPE which is the
2206 multiplicative identity of the set TYPE. */
2209 build_one_cst (tree type
)
2211 switch (TREE_CODE (type
))
2213 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2214 case POINTER_TYPE
: case REFERENCE_TYPE
:
2216 return build_int_cst (type
, 1);
2219 return build_real (type
, dconst1
);
2221 case FIXED_POINT_TYPE
:
2222 /* We can only generate 1 for accum types. */
2223 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2224 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2228 tree scalar
= build_one_cst (TREE_TYPE (type
));
2230 return build_vector_from_val (type
, scalar
);
2234 return build_complex (type
,
2235 build_one_cst (TREE_TYPE (type
)),
2236 build_zero_cst (TREE_TYPE (type
)));
2243 /* Return an integer of type TYPE containing all 1's in as much precision as
2244 it contains, or a complex or vector whose subparts are such integers. */
2247 build_all_ones_cst (tree type
)
2249 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2251 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2252 return build_complex (type
, scalar
, scalar
);
2255 return build_minus_one_cst (type
);
2258 /* Return a constant of arithmetic type TYPE which is the
2259 opposite of the multiplicative identity of the set TYPE. */
2262 build_minus_one_cst (tree type
)
2264 switch (TREE_CODE (type
))
2266 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2267 case POINTER_TYPE
: case REFERENCE_TYPE
:
2269 return build_int_cst (type
, -1);
2272 return build_real (type
, dconstm1
);
2274 case FIXED_POINT_TYPE
:
2275 /* We can only generate 1 for accum types. */
2276 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2277 return build_fixed (type
,
2278 fixed_from_double_int (double_int_minus_one
,
2279 SCALAR_TYPE_MODE (type
)));
2283 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2285 return build_vector_from_val (type
, scalar
);
2289 return build_complex (type
,
2290 build_minus_one_cst (TREE_TYPE (type
)),
2291 build_zero_cst (TREE_TYPE (type
)));
2298 /* Build 0 constant of type TYPE. This is used by constructor folding
2299 and thus the constant should be represented in memory by
2303 build_zero_cst (tree type
)
2305 switch (TREE_CODE (type
))
2307 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2308 case POINTER_TYPE
: case REFERENCE_TYPE
:
2309 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2310 return build_int_cst (type
, 0);
2313 return build_real (type
, dconst0
);
2315 case FIXED_POINT_TYPE
:
2316 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2320 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2322 return build_vector_from_val (type
, scalar
);
2327 tree zero
= build_zero_cst (TREE_TYPE (type
));
2329 return build_complex (type
, zero
, zero
);
2333 if (!AGGREGATE_TYPE_P (type
))
2334 return fold_convert (type
, integer_zero_node
);
2335 return build_constructor (type
, NULL
);
2340 /* Build a BINFO with LEN language slots. */
2343 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2346 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2347 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2349 record_node_allocation_statistics (TREE_BINFO
, length
);
2351 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2353 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2355 TREE_SET_CODE (t
, TREE_BINFO
);
2357 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2362 /* Create a CASE_LABEL_EXPR tree node and return it. */
2365 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2367 tree t
= make_node (CASE_LABEL_EXPR
);
2369 TREE_TYPE (t
) = void_type_node
;
2370 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2372 CASE_LOW (t
) = low_value
;
2373 CASE_HIGH (t
) = high_value
;
2374 CASE_LABEL (t
) = label_decl
;
2375 CASE_CHAIN (t
) = NULL_TREE
;
2380 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2381 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2382 The latter determines the length of the HOST_WIDE_INT vector. */
2385 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2388 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2389 + sizeof (struct tree_int_cst
));
2392 record_node_allocation_statistics (INTEGER_CST
, length
);
2394 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2396 TREE_SET_CODE (t
, INTEGER_CST
);
2397 TREE_INT_CST_NUNITS (t
) = len
;
2398 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2399 /* to_offset can only be applied to trees that are offset_int-sized
2400 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2401 must be exactly the precision of offset_int and so LEN is correct. */
2402 if (ext_len
<= OFFSET_INT_ELTS
)
2403 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2405 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2407 TREE_CONSTANT (t
) = 1;
2412 /* Build a newly constructed TREE_VEC node of length LEN. */
2415 make_tree_vec (int len MEM_STAT_DECL
)
2418 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2420 record_node_allocation_statistics (TREE_VEC
, length
);
2422 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2424 TREE_SET_CODE (t
, TREE_VEC
);
2425 TREE_VEC_LENGTH (t
) = len
;
2430 /* Grow a TREE_VEC node to new length LEN. */
2433 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2435 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2437 int oldlen
= TREE_VEC_LENGTH (v
);
2438 gcc_assert (len
> oldlen
);
2440 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2441 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2443 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2445 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2447 TREE_VEC_LENGTH (v
) = len
;
2452 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2453 fixed, and scalar, complex or vector. */
2456 zerop (const_tree expr
)
2458 return (integer_zerop (expr
)
2459 || real_zerop (expr
)
2460 || fixed_zerop (expr
));
2463 /* Return 1 if EXPR is the integer constant zero or a complex constant
2467 integer_zerop (const_tree expr
)
2469 switch (TREE_CODE (expr
))
2472 return wi::to_wide (expr
) == 0;
2474 return (integer_zerop (TREE_REALPART (expr
))
2475 && integer_zerop (TREE_IMAGPART (expr
)));
2477 return (VECTOR_CST_NPATTERNS (expr
) == 1
2478 && VECTOR_CST_DUPLICATE_P (expr
)
2479 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2485 /* Return 1 if EXPR is the integer constant one or the corresponding
2486 complex constant. */
2489 integer_onep (const_tree expr
)
2491 switch (TREE_CODE (expr
))
2494 return wi::eq_p (wi::to_widest (expr
), 1);
2496 return (integer_onep (TREE_REALPART (expr
))
2497 && integer_zerop (TREE_IMAGPART (expr
)));
2499 return (VECTOR_CST_NPATTERNS (expr
) == 1
2500 && VECTOR_CST_DUPLICATE_P (expr
)
2501 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2507 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2508 return 1 if every piece is the integer constant one. */
2511 integer_each_onep (const_tree expr
)
2513 if (TREE_CODE (expr
) == COMPLEX_CST
)
2514 return (integer_onep (TREE_REALPART (expr
))
2515 && integer_onep (TREE_IMAGPART (expr
)));
2517 return integer_onep (expr
);
2520 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2521 it contains, or a complex or vector whose subparts are such integers. */
2524 integer_all_onesp (const_tree expr
)
2526 if (TREE_CODE (expr
) == COMPLEX_CST
2527 && integer_all_onesp (TREE_REALPART (expr
))
2528 && integer_all_onesp (TREE_IMAGPART (expr
)))
2531 else if (TREE_CODE (expr
) == VECTOR_CST
)
2532 return (VECTOR_CST_NPATTERNS (expr
) == 1
2533 && VECTOR_CST_DUPLICATE_P (expr
)
2534 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2536 else if (TREE_CODE (expr
) != INTEGER_CST
)
2539 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2540 == wi::to_wide (expr
));
2543 /* Return 1 if EXPR is the integer constant minus one. */
2546 integer_minus_onep (const_tree expr
)
2548 if (TREE_CODE (expr
) == COMPLEX_CST
)
2549 return (integer_all_onesp (TREE_REALPART (expr
))
2550 && integer_zerop (TREE_IMAGPART (expr
)));
2552 return integer_all_onesp (expr
);
2555 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2559 integer_pow2p (const_tree expr
)
2561 if (TREE_CODE (expr
) == COMPLEX_CST
2562 && integer_pow2p (TREE_REALPART (expr
))
2563 && integer_zerop (TREE_IMAGPART (expr
)))
2566 if (TREE_CODE (expr
) != INTEGER_CST
)
2569 return wi::popcount (wi::to_wide (expr
)) == 1;
2572 /* Return 1 if EXPR is an integer constant other than zero or a
2573 complex constant other than zero. */
2576 integer_nonzerop (const_tree expr
)
2578 return ((TREE_CODE (expr
) == INTEGER_CST
2579 && wi::to_wide (expr
) != 0)
2580 || (TREE_CODE (expr
) == COMPLEX_CST
2581 && (integer_nonzerop (TREE_REALPART (expr
))
2582 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2585 /* Return 1 if EXPR is the integer constant one. For vector,
2586 return 1 if every piece is the integer constant minus one
2587 (representing the value TRUE). */
2590 integer_truep (const_tree expr
)
2592 if (TREE_CODE (expr
) == VECTOR_CST
)
2593 return integer_all_onesp (expr
);
2594 return integer_onep (expr
);
2597 /* Return 1 if EXPR is the fixed-point constant zero. */
2600 fixed_zerop (const_tree expr
)
2602 return (TREE_CODE (expr
) == FIXED_CST
2603 && TREE_FIXED_CST (expr
).data
.is_zero ());
2606 /* Return the power of two represented by a tree node known to be a
2610 tree_log2 (const_tree expr
)
2612 if (TREE_CODE (expr
) == COMPLEX_CST
)
2613 return tree_log2 (TREE_REALPART (expr
));
2615 return wi::exact_log2 (wi::to_wide (expr
));
2618 /* Similar, but return the largest integer Y such that 2 ** Y is less
2619 than or equal to EXPR. */
2622 tree_floor_log2 (const_tree expr
)
2624 if (TREE_CODE (expr
) == COMPLEX_CST
)
2625 return tree_log2 (TREE_REALPART (expr
));
2627 return wi::floor_log2 (wi::to_wide (expr
));
2630 /* Return number of known trailing zero bits in EXPR, or, if the value of
2631 EXPR is known to be zero, the precision of it's type. */
2634 tree_ctz (const_tree expr
)
2636 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2637 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2640 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2641 switch (TREE_CODE (expr
))
2644 ret1
= wi::ctz (wi::to_wide (expr
));
2645 return MIN (ret1
, prec
);
2647 ret1
= wi::ctz (get_nonzero_bits (expr
));
2648 return MIN (ret1
, prec
);
2655 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2658 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2659 return MIN (ret1
, ret2
);
2660 case POINTER_PLUS_EXPR
:
2661 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2662 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2663 /* Second operand is sizetype, which could be in theory
2664 wider than pointer's precision. Make sure we never
2665 return more than prec. */
2666 ret2
= MIN (ret2
, prec
);
2667 return MIN (ret1
, ret2
);
2669 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2670 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2671 return MAX (ret1
, ret2
);
2673 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2674 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2675 return MIN (ret1
+ ret2
, prec
);
2677 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2678 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2679 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2681 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2682 return MIN (ret1
+ ret2
, prec
);
2686 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2687 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2689 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2690 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2695 case TRUNC_DIV_EXPR
:
2697 case FLOOR_DIV_EXPR
:
2698 case ROUND_DIV_EXPR
:
2699 case EXACT_DIV_EXPR
:
2700 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2701 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2703 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2706 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2714 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2715 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2717 return MIN (ret1
, prec
);
2719 return tree_ctz (TREE_OPERAND (expr
, 0));
2721 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2724 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2725 return MIN (ret1
, ret2
);
2727 return tree_ctz (TREE_OPERAND (expr
, 1));
2729 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2730 if (ret1
> BITS_PER_UNIT
)
2732 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2733 return MIN (ret1
, prec
);
2741 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2742 decimal float constants, so don't return 1 for them. */
2745 real_zerop (const_tree expr
)
2747 switch (TREE_CODE (expr
))
2750 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2751 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2753 return real_zerop (TREE_REALPART (expr
))
2754 && real_zerop (TREE_IMAGPART (expr
));
2757 /* Don't simply check for a duplicate because the predicate
2758 accepts both +0.0 and -0.0. */
2759 unsigned count
= vector_cst_encoded_nelts (expr
);
2760 for (unsigned int i
= 0; i
< count
; ++i
)
2761 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2770 /* Return 1 if EXPR is the real constant one in real or complex form.
2771 Trailing zeroes matter for decimal float constants, so don't return
2775 real_onep (const_tree expr
)
2777 switch (TREE_CODE (expr
))
2780 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2781 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2783 return real_onep (TREE_REALPART (expr
))
2784 && real_zerop (TREE_IMAGPART (expr
));
2786 return (VECTOR_CST_NPATTERNS (expr
) == 1
2787 && VECTOR_CST_DUPLICATE_P (expr
)
2788 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2794 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2795 matter for decimal float constants, so don't return 1 for them. */
2798 real_minus_onep (const_tree expr
)
2800 switch (TREE_CODE (expr
))
2803 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2804 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2806 return real_minus_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_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2817 /* Nonzero if EXP is a constant or a cast of a constant. */
2820 really_constant_p (const_tree exp
)
2822 /* This is not quite the same as STRIP_NOPS. It does more. */
2823 while (CONVERT_EXPR_P (exp
)
2824 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2825 exp
= TREE_OPERAND (exp
, 0);
2826 return TREE_CONSTANT (exp
);
2829 /* Return true if T holds a polynomial pointer difference, storing it in
2830 *VALUE if so. A true return means that T's precision is no greater
2831 than 64 bits, which is the largest address space we support, so *VALUE
2832 never loses precision. However, the signedness of the result does
2833 not necessarily match the signedness of T: sometimes an unsigned type
2834 like sizetype is used to encode a value that is actually negative. */
2837 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2841 if (TREE_CODE (t
) == INTEGER_CST
)
2843 if (!cst_and_fits_in_hwi (t
))
2845 *value
= int_cst_value (t
);
2848 if (POLY_INT_CST_P (t
))
2850 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2851 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2853 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2854 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2861 tree_to_poly_int64 (const_tree t
)
2863 gcc_assert (tree_fits_poly_int64_p (t
));
2864 if (POLY_INT_CST_P (t
))
2865 return poly_int_cst_value (t
).force_shwi ();
2866 return TREE_INT_CST_LOW (t
);
2870 tree_to_poly_uint64 (const_tree t
)
2872 gcc_assert (tree_fits_poly_uint64_p (t
));
2873 if (POLY_INT_CST_P (t
))
2874 return poly_int_cst_value (t
).force_uhwi ();
2875 return TREE_INT_CST_LOW (t
);
2878 /* Return first list element whose TREE_VALUE is ELEM.
2879 Return 0 if ELEM is not in LIST. */
2882 value_member (tree elem
, tree list
)
2886 if (elem
== TREE_VALUE (list
))
2888 list
= TREE_CHAIN (list
);
2893 /* Return first list element whose TREE_PURPOSE is ELEM.
2894 Return 0 if ELEM is not in LIST. */
2897 purpose_member (const_tree elem
, tree list
)
2901 if (elem
== TREE_PURPOSE (list
))
2903 list
= TREE_CHAIN (list
);
2908 /* Return true if ELEM is in V. */
2911 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2915 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2921 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2925 chain_index (int idx
, tree chain
)
2927 for (; chain
&& idx
> 0; --idx
)
2928 chain
= TREE_CHAIN (chain
);
2932 /* Return nonzero if ELEM is part of the chain CHAIN. */
2935 chain_member (const_tree elem
, const_tree chain
)
2941 chain
= DECL_CHAIN (chain
);
2947 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2948 We expect a null pointer to mark the end of the chain.
2949 This is the Lisp primitive `length'. */
2952 list_length (const_tree t
)
2955 #ifdef ENABLE_TREE_CHECKING
2963 #ifdef ENABLE_TREE_CHECKING
2966 gcc_assert (p
!= q
);
2974 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2975 UNION_TYPE TYPE, or NULL_TREE if none. */
2978 first_field (const_tree type
)
2980 tree t
= TYPE_FIELDS (type
);
2981 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2986 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2987 by modifying the last node in chain 1 to point to chain 2.
2988 This is the Lisp primitive `nconc'. */
2991 chainon (tree op1
, tree op2
)
3000 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3002 TREE_CHAIN (t1
) = op2
;
3004 #ifdef ENABLE_TREE_CHECKING
3007 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3008 gcc_assert (t2
!= t1
);
3015 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3018 tree_last (tree chain
)
3022 while ((next
= TREE_CHAIN (chain
)))
3027 /* Reverse the order of elements in the chain T,
3028 and return the new head of the chain (old last element). */
3033 tree prev
= 0, decl
, next
;
3034 for (decl
= t
; decl
; decl
= next
)
3036 /* We shouldn't be using this function to reverse BLOCK chains; we
3037 have blocks_nreverse for that. */
3038 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3039 next
= TREE_CHAIN (decl
);
3040 TREE_CHAIN (decl
) = prev
;
3046 /* Return a newly created TREE_LIST node whose
3047 purpose and value fields are PARM and VALUE. */
3050 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3052 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3053 TREE_PURPOSE (t
) = parm
;
3054 TREE_VALUE (t
) = value
;
3058 /* Build a chain of TREE_LIST nodes from a vector. */
3061 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3063 tree ret
= NULL_TREE
;
3067 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3069 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3070 pp
= &TREE_CHAIN (*pp
);
3075 /* Return a newly created TREE_LIST node whose
3076 purpose and value fields are PURPOSE and VALUE
3077 and whose TREE_CHAIN is CHAIN. */
3080 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3084 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3085 memset (node
, 0, sizeof (struct tree_common
));
3087 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3089 TREE_SET_CODE (node
, TREE_LIST
);
3090 TREE_CHAIN (node
) = chain
;
3091 TREE_PURPOSE (node
) = purpose
;
3092 TREE_VALUE (node
) = value
;
3096 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3100 ctor_to_vec (tree ctor
)
3102 vec
<tree
, va_gc
> *vec
;
3103 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3107 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3108 vec
->quick_push (val
);
3113 /* Return the size nominally occupied by an object of type TYPE
3114 when it resides in memory. The value is measured in units of bytes,
3115 and its data type is that normally used for type sizes
3116 (which is the first type created by make_signed_type or
3117 make_unsigned_type). */
3120 size_in_bytes_loc (location_t loc
, const_tree type
)
3124 if (type
== error_mark_node
)
3125 return integer_zero_node
;
3127 type
= TYPE_MAIN_VARIANT (type
);
3128 t
= TYPE_SIZE_UNIT (type
);
3132 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3133 return size_zero_node
;
3139 /* Return the size of TYPE (in bytes) as a wide integer
3140 or return -1 if the size can vary or is larger than an integer. */
3143 int_size_in_bytes (const_tree type
)
3147 if (type
== error_mark_node
)
3150 type
= TYPE_MAIN_VARIANT (type
);
3151 t
= TYPE_SIZE_UNIT (type
);
3153 if (t
&& tree_fits_uhwi_p (t
))
3154 return TREE_INT_CST_LOW (t
);
3159 /* Return the maximum size of TYPE (in bytes) as a wide integer
3160 or return -1 if the size can vary or is larger than an integer. */
3163 max_int_size_in_bytes (const_tree type
)
3165 HOST_WIDE_INT size
= -1;
3168 /* If this is an array type, check for a possible MAX_SIZE attached. */
3170 if (TREE_CODE (type
) == ARRAY_TYPE
)
3172 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3174 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3175 size
= tree_to_uhwi (size_tree
);
3178 /* If we still haven't been able to get a size, see if the language
3179 can compute a maximum size. */
3183 size_tree
= lang_hooks
.types
.max_size (type
);
3185 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3186 size
= tree_to_uhwi (size_tree
);
3192 /* Return the bit position of FIELD, in bits from the start of the record.
3193 This is a tree of type bitsizetype. */
3196 bit_position (const_tree field
)
3198 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3199 DECL_FIELD_BIT_OFFSET (field
));
3202 /* Return the byte position of FIELD, in bytes from the start of the record.
3203 This is a tree of type sizetype. */
3206 byte_position (const_tree field
)
3208 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3209 DECL_FIELD_BIT_OFFSET (field
));
3212 /* Likewise, but return as an integer. It must be representable in
3213 that way (since it could be a signed value, we don't have the
3214 option of returning -1 like int_size_in_byte can. */
3217 int_byte_position (const_tree field
)
3219 return tree_to_shwi (byte_position (field
));
3222 /* Return the strictest alignment, in bits, that T is known to have. */
3225 expr_align (const_tree t
)
3227 unsigned int align0
, align1
;
3229 switch (TREE_CODE (t
))
3231 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3232 /* If we have conversions, we know that the alignment of the
3233 object must meet each of the alignments of the types. */
3234 align0
= expr_align (TREE_OPERAND (t
, 0));
3235 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3236 return MAX (align0
, align1
);
3238 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3239 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3240 case CLEANUP_POINT_EXPR
:
3241 /* These don't change the alignment of an object. */
3242 return expr_align (TREE_OPERAND (t
, 0));
3245 /* The best we can do is say that the alignment is the least aligned
3247 align0
= expr_align (TREE_OPERAND (t
, 1));
3248 align1
= expr_align (TREE_OPERAND (t
, 2));
3249 return MIN (align0
, align1
);
3251 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3252 meaningfully, it's always 1. */
3253 case LABEL_DECL
: case CONST_DECL
:
3254 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3256 gcc_assert (DECL_ALIGN (t
) != 0);
3257 return DECL_ALIGN (t
);
3263 /* Otherwise take the alignment from that of the type. */
3264 return TYPE_ALIGN (TREE_TYPE (t
));
3267 /* Return, as a tree node, the number of elements for TYPE (which is an
3268 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3271 array_type_nelts (const_tree type
)
3273 tree index_type
, min
, max
;
3275 /* If they did it with unspecified bounds, then we should have already
3276 given an error about it before we got here. */
3277 if (! TYPE_DOMAIN (type
))
3278 return error_mark_node
;
3280 index_type
= TYPE_DOMAIN (type
);
3281 min
= TYPE_MIN_VALUE (index_type
);
3282 max
= TYPE_MAX_VALUE (index_type
);
3284 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3286 return error_mark_node
;
3288 return (integer_zerop (min
)
3290 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3293 /* If arg is static -- a reference to an object in static storage -- then
3294 return the object. This is not the same as the C meaning of `static'.
3295 If arg isn't static, return NULL. */
3300 switch (TREE_CODE (arg
))
3303 /* Nested functions are static, even though taking their address will
3304 involve a trampoline as we unnest the nested function and create
3305 the trampoline on the tree level. */
3309 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3310 && ! DECL_THREAD_LOCAL_P (arg
)
3311 && ! DECL_DLLIMPORT_P (arg
)
3315 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3319 return TREE_STATIC (arg
) ? arg
: NULL
;
3326 /* If the thing being referenced is not a field, then it is
3327 something language specific. */
3328 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3330 /* If we are referencing a bitfield, we can't evaluate an
3331 ADDR_EXPR at compile time and so it isn't a constant. */
3332 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3335 return staticp (TREE_OPERAND (arg
, 0));
3341 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3344 case ARRAY_RANGE_REF
:
3345 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3346 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3347 return staticp (TREE_OPERAND (arg
, 0));
3351 case COMPOUND_LITERAL_EXPR
:
3352 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3362 /* Return whether OP is a DECL whose address is function-invariant. */
3365 decl_address_invariant_p (const_tree op
)
3367 /* The conditions below are slightly less strict than the one in
3370 switch (TREE_CODE (op
))
3379 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3380 || DECL_THREAD_LOCAL_P (op
)
3381 || DECL_CONTEXT (op
) == current_function_decl
3382 || decl_function_context (op
) == current_function_decl
)
3387 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3388 || decl_function_context (op
) == current_function_decl
)
3399 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3402 decl_address_ip_invariant_p (const_tree op
)
3404 /* The conditions below are slightly less strict than the one in
3407 switch (TREE_CODE (op
))
3415 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3416 && !DECL_DLLIMPORT_P (op
))
3417 || DECL_THREAD_LOCAL_P (op
))
3422 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3434 /* Return true if T is function-invariant (internal function, does
3435 not handle arithmetic; that's handled in skip_simple_arithmetic and
3436 tree_invariant_p). */
3439 tree_invariant_p_1 (tree t
)
3443 if (TREE_CONSTANT (t
)
3444 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3447 switch (TREE_CODE (t
))
3453 op
= TREE_OPERAND (t
, 0);
3454 while (handled_component_p (op
))
3456 switch (TREE_CODE (op
))
3459 case ARRAY_RANGE_REF
:
3460 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3461 || TREE_OPERAND (op
, 2) != NULL_TREE
3462 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3467 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3473 op
= TREE_OPERAND (op
, 0);
3476 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3485 /* Return true if T is function-invariant. */
3488 tree_invariant_p (tree t
)
3490 tree inner
= skip_simple_arithmetic (t
);
3491 return tree_invariant_p_1 (inner
);
3494 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3495 Do this to any expression which may be used in more than one place,
3496 but must be evaluated only once.
3498 Normally, expand_expr would reevaluate the expression each time.
3499 Calling save_expr produces something that is evaluated and recorded
3500 the first time expand_expr is called on it. Subsequent calls to
3501 expand_expr just reuse the recorded value.
3503 The call to expand_expr that generates code that actually computes
3504 the value is the first call *at compile time*. Subsequent calls
3505 *at compile time* generate code to use the saved value.
3506 This produces correct result provided that *at run time* control
3507 always flows through the insns made by the first expand_expr
3508 before reaching the other places where the save_expr was evaluated.
3509 You, the caller of save_expr, must make sure this is so.
3511 Constants, and certain read-only nodes, are returned with no
3512 SAVE_EXPR because that is safe. Expressions containing placeholders
3513 are not touched; see tree.def for an explanation of what these
3517 save_expr (tree expr
)
3521 /* If the tree evaluates to a constant, then we don't want to hide that
3522 fact (i.e. this allows further folding, and direct checks for constants).
3523 However, a read-only object that has side effects cannot be bypassed.
3524 Since it is no problem to reevaluate literals, we just return the
3526 inner
= skip_simple_arithmetic (expr
);
3527 if (TREE_CODE (inner
) == ERROR_MARK
)
3530 if (tree_invariant_p_1 (inner
))
3533 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3534 it means that the size or offset of some field of an object depends on
3535 the value within another field.
3537 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3538 and some variable since it would then need to be both evaluated once and
3539 evaluated more than once. Front-ends must assure this case cannot
3540 happen by surrounding any such subexpressions in their own SAVE_EXPR
3541 and forcing evaluation at the proper time. */
3542 if (contains_placeholder_p (inner
))
3545 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3547 /* This expression might be placed ahead of a jump to ensure that the
3548 value was computed on both sides of the jump. So make sure it isn't
3549 eliminated as dead. */
3550 TREE_SIDE_EFFECTS (expr
) = 1;
3554 /* Look inside EXPR into any simple arithmetic operations. Return the
3555 outermost non-arithmetic or non-invariant node. */
3558 skip_simple_arithmetic (tree expr
)
3560 /* We don't care about whether this can be used as an lvalue in this
3562 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3563 expr
= TREE_OPERAND (expr
, 0);
3565 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3566 a constant, it will be more efficient to not make another SAVE_EXPR since
3567 it will allow better simplification and GCSE will be able to merge the
3568 computations if they actually occur. */
3571 if (UNARY_CLASS_P (expr
))
3572 expr
= TREE_OPERAND (expr
, 0);
3573 else if (BINARY_CLASS_P (expr
))
3575 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3576 expr
= TREE_OPERAND (expr
, 0);
3577 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3578 expr
= TREE_OPERAND (expr
, 1);
3589 /* Look inside EXPR into simple arithmetic operations involving constants.
3590 Return the outermost non-arithmetic or non-constant node. */
3593 skip_simple_constant_arithmetic (tree expr
)
3595 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3596 expr
= TREE_OPERAND (expr
, 0);
3600 if (UNARY_CLASS_P (expr
))
3601 expr
= TREE_OPERAND (expr
, 0);
3602 else if (BINARY_CLASS_P (expr
))
3604 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3605 expr
= TREE_OPERAND (expr
, 0);
3606 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3607 expr
= TREE_OPERAND (expr
, 1);
3618 /* Return which tree structure is used by T. */
3620 enum tree_node_structure_enum
3621 tree_node_structure (const_tree t
)
3623 const enum tree_code code
= TREE_CODE (t
);
3624 return tree_node_structure_for_code (code
);
3627 /* Set various status flags when building a CALL_EXPR object T. */
3630 process_call_operands (tree t
)
3632 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3633 bool read_only
= false;
3634 int i
= call_expr_flags (t
);
3636 /* Calls have side-effects, except those to const or pure functions. */
3637 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3638 side_effects
= true;
3639 /* Propagate TREE_READONLY of arguments for const functions. */
3643 if (!side_effects
|| read_only
)
3644 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3646 tree op
= TREE_OPERAND (t
, i
);
3647 if (op
&& TREE_SIDE_EFFECTS (op
))
3648 side_effects
= true;
3649 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3653 TREE_SIDE_EFFECTS (t
) = side_effects
;
3654 TREE_READONLY (t
) = read_only
;
3657 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3658 size or offset that depends on a field within a record. */
3661 contains_placeholder_p (const_tree exp
)
3663 enum tree_code code
;
3668 code
= TREE_CODE (exp
);
3669 if (code
== PLACEHOLDER_EXPR
)
3672 switch (TREE_CODE_CLASS (code
))
3675 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3676 position computations since they will be converted into a
3677 WITH_RECORD_EXPR involving the reference, which will assume
3678 here will be valid. */
3679 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3681 case tcc_exceptional
:
3682 if (code
== TREE_LIST
)
3683 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3684 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3689 case tcc_comparison
:
3690 case tcc_expression
:
3694 /* Ignoring the first operand isn't quite right, but works best. */
3695 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3698 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3699 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3700 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3703 /* The save_expr function never wraps anything containing
3704 a PLACEHOLDER_EXPR. */
3711 switch (TREE_CODE_LENGTH (code
))
3714 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3716 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3717 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3728 const_call_expr_arg_iterator iter
;
3729 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3730 if (CONTAINS_PLACEHOLDER_P (arg
))
3744 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3745 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3749 type_contains_placeholder_1 (const_tree type
)
3751 /* If the size contains a placeholder or the parent type (component type in
3752 the case of arrays) type involves a placeholder, this type does. */
3753 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3754 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3755 || (!POINTER_TYPE_P (type
)
3757 && type_contains_placeholder_p (TREE_TYPE (type
))))
3760 /* Now do type-specific checks. Note that the last part of the check above
3761 greatly limits what we have to do below. */
3762 switch (TREE_CODE (type
))
3765 case POINTER_BOUNDS_TYPE
:
3771 case REFERENCE_TYPE
:
3780 case FIXED_POINT_TYPE
:
3781 /* Here we just check the bounds. */
3782 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3783 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3786 /* We have already checked the component type above, so just check
3787 the domain type. Flexible array members have a null domain. */
3788 return TYPE_DOMAIN (type
) ?
3789 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3793 case QUAL_UNION_TYPE
:
3797 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3798 if (TREE_CODE (field
) == FIELD_DECL
3799 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3800 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3801 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3802 || type_contains_placeholder_p (TREE_TYPE (field
))))
3813 /* Wrapper around above function used to cache its result. */
3816 type_contains_placeholder_p (tree type
)
3820 /* If the contains_placeholder_bits field has been initialized,
3821 then we know the answer. */
3822 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3823 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3825 /* Indicate that we've seen this type node, and the answer is false.
3826 This is what we want to return if we run into recursion via fields. */
3827 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3829 /* Compute the real value. */
3830 result
= type_contains_placeholder_1 (type
);
3832 /* Store the real value. */
3833 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3838 /* Push tree EXP onto vector QUEUE if it is not already present. */
3841 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3846 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3847 if (simple_cst_equal (iter
, exp
) == 1)
3851 queue
->safe_push (exp
);
3854 /* Given a tree EXP, find all occurrences of references to fields
3855 in a PLACEHOLDER_EXPR and place them in vector REFS without
3856 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3857 we assume here that EXP contains only arithmetic expressions
3858 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3862 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3864 enum tree_code code
= TREE_CODE (exp
);
3868 /* We handle TREE_LIST and COMPONENT_REF separately. */
3869 if (code
== TREE_LIST
)
3871 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3872 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3874 else if (code
== COMPONENT_REF
)
3876 for (inner
= TREE_OPERAND (exp
, 0);
3877 REFERENCE_CLASS_P (inner
);
3878 inner
= TREE_OPERAND (inner
, 0))
3881 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3882 push_without_duplicates (exp
, refs
);
3884 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3887 switch (TREE_CODE_CLASS (code
))
3892 case tcc_declaration
:
3893 /* Variables allocated to static storage can stay. */
3894 if (!TREE_STATIC (exp
))
3895 push_without_duplicates (exp
, refs
);
3898 case tcc_expression
:
3899 /* This is the pattern built in ada/make_aligning_type. */
3900 if (code
== ADDR_EXPR
3901 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3903 push_without_duplicates (exp
, refs
);
3909 case tcc_exceptional
:
3912 case tcc_comparison
:
3914 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3915 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3919 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3920 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3928 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3929 return a tree with all occurrences of references to F in a
3930 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3931 CONST_DECLs. Note that we assume here that EXP contains only
3932 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3933 occurring only in their argument list. */
3936 substitute_in_expr (tree exp
, tree f
, tree r
)
3938 enum tree_code code
= TREE_CODE (exp
);
3939 tree op0
, op1
, op2
, op3
;
3942 /* We handle TREE_LIST and COMPONENT_REF separately. */
3943 if (code
== TREE_LIST
)
3945 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3946 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3947 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3950 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3952 else if (code
== COMPONENT_REF
)
3956 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3957 and it is the right field, replace it with R. */
3958 for (inner
= TREE_OPERAND (exp
, 0);
3959 REFERENCE_CLASS_P (inner
);
3960 inner
= TREE_OPERAND (inner
, 0))
3964 op1
= TREE_OPERAND (exp
, 1);
3966 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3969 /* If this expression hasn't been completed let, leave it alone. */
3970 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3973 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3974 if (op0
== TREE_OPERAND (exp
, 0))
3978 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3981 switch (TREE_CODE_CLASS (code
))
3986 case tcc_declaration
:
3992 case tcc_expression
:
3998 case tcc_exceptional
:
4001 case tcc_comparison
:
4003 switch (TREE_CODE_LENGTH (code
))
4009 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4010 if (op0
== TREE_OPERAND (exp
, 0))
4013 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4017 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4018 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4020 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4023 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4027 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4028 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4029 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4031 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4032 && op2
== TREE_OPERAND (exp
, 2))
4035 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4039 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4040 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4041 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4042 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4044 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4045 && op2
== TREE_OPERAND (exp
, 2)
4046 && op3
== TREE_OPERAND (exp
, 3))
4050 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4062 new_tree
= NULL_TREE
;
4064 /* If we are trying to replace F with a constant or with another
4065 instance of one of the arguments of the call, inline back
4066 functions which do nothing else than computing a value from
4067 the arguments they are passed. This makes it possible to
4068 fold partially or entirely the replacement expression. */
4069 if (code
== CALL_EXPR
)
4071 bool maybe_inline
= false;
4072 if (CONSTANT_CLASS_P (r
))
4073 maybe_inline
= true;
4075 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4076 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4078 maybe_inline
= true;
4083 tree t
= maybe_inline_call_in_expr (exp
);
4085 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4089 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4091 tree op
= TREE_OPERAND (exp
, i
);
4092 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4096 new_tree
= copy_node (exp
);
4097 TREE_OPERAND (new_tree
, i
) = new_op
;
4103 new_tree
= fold (new_tree
);
4104 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4105 process_call_operands (new_tree
);
4116 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4118 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4119 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4124 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4125 for it within OBJ, a tree that is an object or a chain of references. */
4128 substitute_placeholder_in_expr (tree exp
, tree obj
)
4130 enum tree_code code
= TREE_CODE (exp
);
4131 tree op0
, op1
, op2
, op3
;
4134 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4135 in the chain of OBJ. */
4136 if (code
== PLACEHOLDER_EXPR
)
4138 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4141 for (elt
= obj
; elt
!= 0;
4142 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4143 || TREE_CODE (elt
) == COND_EXPR
)
4144 ? TREE_OPERAND (elt
, 1)
4145 : (REFERENCE_CLASS_P (elt
)
4146 || UNARY_CLASS_P (elt
)
4147 || BINARY_CLASS_P (elt
)
4148 || VL_EXP_CLASS_P (elt
)
4149 || EXPRESSION_CLASS_P (elt
))
4150 ? TREE_OPERAND (elt
, 0) : 0))
4151 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4154 for (elt
= obj
; elt
!= 0;
4155 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4156 || TREE_CODE (elt
) == COND_EXPR
)
4157 ? TREE_OPERAND (elt
, 1)
4158 : (REFERENCE_CLASS_P (elt
)
4159 || UNARY_CLASS_P (elt
)
4160 || BINARY_CLASS_P (elt
)
4161 || VL_EXP_CLASS_P (elt
)
4162 || EXPRESSION_CLASS_P (elt
))
4163 ? TREE_OPERAND (elt
, 0) : 0))
4164 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4165 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4167 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4169 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4170 survives until RTL generation, there will be an error. */
4174 /* TREE_LIST is special because we need to look at TREE_VALUE
4175 and TREE_CHAIN, not TREE_OPERANDS. */
4176 else if (code
== TREE_LIST
)
4178 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4179 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4180 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4183 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4186 switch (TREE_CODE_CLASS (code
))
4189 case tcc_declaration
:
4192 case tcc_exceptional
:
4195 case tcc_comparison
:
4196 case tcc_expression
:
4199 switch (TREE_CODE_LENGTH (code
))
4205 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4206 if (op0
== TREE_OPERAND (exp
, 0))
4209 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4213 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4214 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4216 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4219 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4223 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4224 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4225 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4227 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4228 && op2
== TREE_OPERAND (exp
, 2))
4231 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4235 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4236 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4237 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4238 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4240 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4241 && op2
== TREE_OPERAND (exp
, 2)
4242 && op3
== TREE_OPERAND (exp
, 3))
4246 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4258 new_tree
= NULL_TREE
;
4260 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4262 tree op
= TREE_OPERAND (exp
, i
);
4263 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4267 new_tree
= copy_node (exp
);
4268 TREE_OPERAND (new_tree
, i
) = new_op
;
4274 new_tree
= fold (new_tree
);
4275 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4276 process_call_operands (new_tree
);
4287 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4289 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4290 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4296 /* Subroutine of stabilize_reference; this is called for subtrees of
4297 references. Any expression with side-effects must be put in a SAVE_EXPR
4298 to ensure that it is only evaluated once.
4300 We don't put SAVE_EXPR nodes around everything, because assigning very
4301 simple expressions to temporaries causes us to miss good opportunities
4302 for optimizations. Among other things, the opportunity to fold in the
4303 addition of a constant into an addressing mode often gets lost, e.g.
4304 "y[i+1] += x;". In general, we take the approach that we should not make
4305 an assignment unless we are forced into it - i.e., that any non-side effect
4306 operator should be allowed, and that cse should take care of coalescing
4307 multiple utterances of the same expression should that prove fruitful. */
4310 stabilize_reference_1 (tree e
)
4313 enum tree_code code
= TREE_CODE (e
);
4315 /* We cannot ignore const expressions because it might be a reference
4316 to a const array but whose index contains side-effects. But we can
4317 ignore things that are actual constant or that already have been
4318 handled by this function. */
4320 if (tree_invariant_p (e
))
4323 switch (TREE_CODE_CLASS (code
))
4325 case tcc_exceptional
:
4327 case tcc_declaration
:
4328 case tcc_comparison
:
4330 case tcc_expression
:
4333 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4334 so that it will only be evaluated once. */
4335 /* The reference (r) and comparison (<) classes could be handled as
4336 below, but it is generally faster to only evaluate them once. */
4337 if (TREE_SIDE_EFFECTS (e
))
4338 return save_expr (e
);
4342 /* Constants need no processing. In fact, we should never reach
4347 /* Division is slow and tends to be compiled with jumps,
4348 especially the division by powers of 2 that is often
4349 found inside of an array reference. So do it just once. */
4350 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4351 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4352 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4353 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4354 return save_expr (e
);
4355 /* Recursively stabilize each operand. */
4356 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4357 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4361 /* Recursively stabilize each operand. */
4362 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4369 TREE_TYPE (result
) = TREE_TYPE (e
);
4370 TREE_READONLY (result
) = TREE_READONLY (e
);
4371 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4372 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4377 /* Stabilize a reference so that we can use it any number of times
4378 without causing its operands to be evaluated more than once.
4379 Returns the stabilized reference. This works by means of save_expr,
4380 so see the caveats in the comments about save_expr.
4382 Also allows conversion expressions whose operands are references.
4383 Any other kind of expression is returned unchanged. */
4386 stabilize_reference (tree ref
)
4389 enum tree_code code
= TREE_CODE (ref
);
4396 /* No action is needed in this case. */
4401 case FIX_TRUNC_EXPR
:
4402 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4406 result
= build_nt (INDIRECT_REF
,
4407 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4411 result
= build_nt (COMPONENT_REF
,
4412 stabilize_reference (TREE_OPERAND (ref
, 0)),
4413 TREE_OPERAND (ref
, 1), NULL_TREE
);
4417 result
= build_nt (BIT_FIELD_REF
,
4418 stabilize_reference (TREE_OPERAND (ref
, 0)),
4419 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4420 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4424 result
= build_nt (ARRAY_REF
,
4425 stabilize_reference (TREE_OPERAND (ref
, 0)),
4426 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4427 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4430 case ARRAY_RANGE_REF
:
4431 result
= build_nt (ARRAY_RANGE_REF
,
4432 stabilize_reference (TREE_OPERAND (ref
, 0)),
4433 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4434 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4438 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4439 it wouldn't be ignored. This matters when dealing with
4441 return stabilize_reference_1 (ref
);
4443 /* If arg isn't a kind of lvalue we recognize, make no change.
4444 Caller should recognize the error for an invalid lvalue. */
4449 return error_mark_node
;
4452 TREE_TYPE (result
) = TREE_TYPE (ref
);
4453 TREE_READONLY (result
) = TREE_READONLY (ref
);
4454 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4455 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4460 /* Low-level constructors for expressions. */
4462 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4463 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4466 recompute_tree_invariant_for_addr_expr (tree t
)
4469 bool tc
= true, se
= false;
4471 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4473 /* We started out assuming this address is both invariant and constant, but
4474 does not have side effects. Now go down any handled components and see if
4475 any of them involve offsets that are either non-constant or non-invariant.
4476 Also check for side-effects.
4478 ??? Note that this code makes no attempt to deal with the case where
4479 taking the address of something causes a copy due to misalignment. */
4481 #define UPDATE_FLAGS(NODE) \
4482 do { tree _node = (NODE); \
4483 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4484 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4486 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4487 node
= TREE_OPERAND (node
, 0))
4489 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4490 array reference (probably made temporarily by the G++ front end),
4491 so ignore all the operands. */
4492 if ((TREE_CODE (node
) == ARRAY_REF
4493 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4494 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4496 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4497 if (TREE_OPERAND (node
, 2))
4498 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4499 if (TREE_OPERAND (node
, 3))
4500 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4502 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4503 FIELD_DECL, apparently. The G++ front end can put something else
4504 there, at least temporarily. */
4505 else if (TREE_CODE (node
) == COMPONENT_REF
4506 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4508 if (TREE_OPERAND (node
, 2))
4509 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4513 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4515 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4516 the address, since &(*a)->b is a form of addition. If it's a constant, the
4517 address is constant too. If it's a decl, its address is constant if the
4518 decl is static. Everything else is not constant and, furthermore,
4519 taking the address of a volatile variable is not volatile. */
4520 if (TREE_CODE (node
) == INDIRECT_REF
4521 || TREE_CODE (node
) == MEM_REF
)
4522 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4523 else if (CONSTANT_CLASS_P (node
))
4525 else if (DECL_P (node
))
4526 tc
&= (staticp (node
) != NULL_TREE
);
4530 se
|= TREE_SIDE_EFFECTS (node
);
4534 TREE_CONSTANT (t
) = tc
;
4535 TREE_SIDE_EFFECTS (t
) = se
;
4539 /* Build an expression of code CODE, data type TYPE, and operands as
4540 specified. Expressions and reference nodes can be created this way.
4541 Constants, decls, types and misc nodes cannot be.
4543 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4544 enough for all extant tree codes. */
4547 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4551 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4553 t
= make_node (code PASS_MEM_STAT
);
4560 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4562 int length
= sizeof (struct tree_exp
);
4565 record_node_allocation_statistics (code
, length
);
4567 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4569 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4571 memset (t
, 0, sizeof (struct tree_common
));
4573 TREE_SET_CODE (t
, code
);
4575 TREE_TYPE (t
) = type
;
4576 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4577 TREE_OPERAND (t
, 0) = node
;
4578 if (node
&& !TYPE_P (node
))
4580 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4581 TREE_READONLY (t
) = TREE_READONLY (node
);
4584 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4586 if (code
!= DEBUG_BEGIN_STMT
)
4587 TREE_SIDE_EFFECTS (t
) = 1;
4592 /* All of these have side-effects, no matter what their
4594 TREE_SIDE_EFFECTS (t
) = 1;
4595 TREE_READONLY (t
) = 0;
4599 /* Whether a dereference is readonly has nothing to do with whether
4600 its operand is readonly. */
4601 TREE_READONLY (t
) = 0;
4606 recompute_tree_invariant_for_addr_expr (t
);
4610 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4611 && node
&& !TYPE_P (node
)
4612 && TREE_CONSTANT (node
))
4613 TREE_CONSTANT (t
) = 1;
4614 if (TREE_CODE_CLASS (code
) == tcc_reference
4615 && node
&& TREE_THIS_VOLATILE (node
))
4616 TREE_THIS_VOLATILE (t
) = 1;
4623 #define PROCESS_ARG(N) \
4625 TREE_OPERAND (t, N) = arg##N; \
4626 if (arg##N &&!TYPE_P (arg##N)) \
4628 if (TREE_SIDE_EFFECTS (arg##N)) \
4630 if (!TREE_READONLY (arg##N) \
4631 && !CONSTANT_CLASS_P (arg##N)) \
4632 (void) (read_only = 0); \
4633 if (!TREE_CONSTANT (arg##N)) \
4634 (void) (constant = 0); \
4639 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4641 bool constant
, read_only
, side_effects
, div_by_zero
;
4644 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4646 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4647 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4648 /* When sizetype precision doesn't match that of pointers
4649 we need to be able to build explicit extensions or truncations
4650 of the offset argument. */
4651 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4652 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4653 && TREE_CODE (arg1
) == INTEGER_CST
);
4655 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4656 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4657 && ptrofftype_p (TREE_TYPE (arg1
)));
4659 t
= make_node (code PASS_MEM_STAT
);
4662 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4663 result based on those same flags for the arguments. But if the
4664 arguments aren't really even `tree' expressions, we shouldn't be trying
4667 /* Expressions without side effects may be constant if their
4668 arguments are as well. */
4669 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4670 || TREE_CODE_CLASS (code
) == tcc_binary
);
4672 side_effects
= TREE_SIDE_EFFECTS (t
);
4676 case TRUNC_DIV_EXPR
:
4678 case FLOOR_DIV_EXPR
:
4679 case ROUND_DIV_EXPR
:
4680 case EXACT_DIV_EXPR
:
4682 case FLOOR_MOD_EXPR
:
4683 case ROUND_MOD_EXPR
:
4684 case TRUNC_MOD_EXPR
:
4685 div_by_zero
= integer_zerop (arg1
);
4688 div_by_zero
= false;
4694 TREE_SIDE_EFFECTS (t
) = side_effects
;
4695 if (code
== MEM_REF
)
4697 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4699 tree o
= TREE_OPERAND (arg0
, 0);
4700 TREE_READONLY (t
) = TREE_READONLY (o
);
4701 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4706 TREE_READONLY (t
) = read_only
;
4707 /* Don't mark X / 0 as constant. */
4708 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4709 TREE_THIS_VOLATILE (t
)
4710 = (TREE_CODE_CLASS (code
) == tcc_reference
4711 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4719 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4720 tree arg2 MEM_STAT_DECL
)
4722 bool constant
, read_only
, side_effects
;
4725 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4726 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4728 t
= make_node (code PASS_MEM_STAT
);
4733 /* As a special exception, if COND_EXPR has NULL branches, we
4734 assume that it is a gimple statement and always consider
4735 it to have side effects. */
4736 if (code
== COND_EXPR
4737 && tt
== void_type_node
4738 && arg1
== NULL_TREE
4739 && arg2
== NULL_TREE
)
4740 side_effects
= true;
4742 side_effects
= TREE_SIDE_EFFECTS (t
);
4748 if (code
== COND_EXPR
)
4749 TREE_READONLY (t
) = read_only
;
4751 TREE_SIDE_EFFECTS (t
) = side_effects
;
4752 TREE_THIS_VOLATILE (t
)
4753 = (TREE_CODE_CLASS (code
) == tcc_reference
4754 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4760 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4761 tree arg2
, tree arg3 MEM_STAT_DECL
)
4763 bool constant
, read_only
, side_effects
;
4766 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4768 t
= make_node (code PASS_MEM_STAT
);
4771 side_effects
= TREE_SIDE_EFFECTS (t
);
4778 TREE_SIDE_EFFECTS (t
) = side_effects
;
4779 TREE_THIS_VOLATILE (t
)
4780 = (TREE_CODE_CLASS (code
) == tcc_reference
4781 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4787 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4788 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4790 bool constant
, read_only
, side_effects
;
4793 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4795 t
= make_node (code PASS_MEM_STAT
);
4798 side_effects
= TREE_SIDE_EFFECTS (t
);
4806 TREE_SIDE_EFFECTS (t
) = side_effects
;
4807 if (code
== TARGET_MEM_REF
)
4809 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4811 tree o
= TREE_OPERAND (arg0
, 0);
4812 TREE_READONLY (t
) = TREE_READONLY (o
);
4813 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4817 TREE_THIS_VOLATILE (t
)
4818 = (TREE_CODE_CLASS (code
) == tcc_reference
4819 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4824 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4825 on the pointer PTR. */
4828 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4830 poly_int64 offset
= 0;
4831 tree ptype
= TREE_TYPE (ptr
);
4833 /* For convenience allow addresses that collapse to a simple base
4835 if (TREE_CODE (ptr
) == ADDR_EXPR
4836 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4837 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4839 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4841 if (TREE_CODE (ptr
) == MEM_REF
)
4843 offset
+= mem_ref_offset (ptr
).to_short_addr ();
4844 ptr
= TREE_OPERAND (ptr
, 0);
4847 ptr
= build_fold_addr_expr (ptr
);
4848 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4850 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4851 ptr
, build_int_cst (ptype
, offset
));
4852 SET_EXPR_LOCATION (tem
, loc
);
4856 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4859 mem_ref_offset (const_tree t
)
4861 return offset_int::from (wi::to_wide (TREE_OPERAND (t
, 1)), SIGNED
);
4864 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4865 offsetted by OFFSET units. */
4868 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4870 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4871 build_fold_addr_expr (base
),
4872 build_int_cst (ptr_type_node
, offset
));
4873 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4874 recompute_tree_invariant_for_addr_expr (addr
);
4878 /* Similar except don't specify the TREE_TYPE
4879 and leave the TREE_SIDE_EFFECTS as 0.
4880 It is permissible for arguments to be null,
4881 or even garbage if their values do not matter. */
4884 build_nt (enum tree_code code
, ...)
4891 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4895 t
= make_node (code
);
4896 length
= TREE_CODE_LENGTH (code
);
4898 for (i
= 0; i
< length
; i
++)
4899 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4905 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4909 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4914 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4915 CALL_EXPR_FN (ret
) = fn
;
4916 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4917 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4918 CALL_EXPR_ARG (ret
, ix
) = t
;
4922 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4923 We do NOT enter this node in any sort of symbol table.
4925 LOC is the location of the decl.
4927 layout_decl is used to set up the decl's storage layout.
4928 Other slots are initialized to 0 or null pointers. */
4931 build_decl (location_t loc
, enum tree_code code
, tree name
,
4932 tree type MEM_STAT_DECL
)
4936 t
= make_node (code PASS_MEM_STAT
);
4937 DECL_SOURCE_LOCATION (t
) = loc
;
4939 /* if (type == error_mark_node)
4940 type = integer_type_node; */
4941 /* That is not done, deliberately, so that having error_mark_node
4942 as the type can suppress useless errors in the use of this variable. */
4944 DECL_NAME (t
) = name
;
4945 TREE_TYPE (t
) = type
;
4947 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4953 /* Builds and returns function declaration with NAME and TYPE. */
4956 build_fn_decl (const char *name
, tree type
)
4958 tree id
= get_identifier (name
);
4959 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4961 DECL_EXTERNAL (decl
) = 1;
4962 TREE_PUBLIC (decl
) = 1;
4963 DECL_ARTIFICIAL (decl
) = 1;
4964 TREE_NOTHROW (decl
) = 1;
4969 vec
<tree
, va_gc
> *all_translation_units
;
4971 /* Builds a new translation-unit decl with name NAME, queues it in the
4972 global list of translation-unit decls and returns it. */
4975 build_translation_unit_decl (tree name
)
4977 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4979 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4980 vec_safe_push (all_translation_units
, tu
);
4985 /* BLOCK nodes are used to represent the structure of binding contours
4986 and declarations, once those contours have been exited and their contents
4987 compiled. This information is used for outputting debugging info. */
4990 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4992 tree block
= make_node (BLOCK
);
4994 BLOCK_VARS (block
) = vars
;
4995 BLOCK_SUBBLOCKS (block
) = subblocks
;
4996 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4997 BLOCK_CHAIN (block
) = chain
;
5002 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5004 LOC is the location to use in tree T. */
5007 protected_set_expr_location (tree t
, location_t loc
)
5009 if (CAN_HAVE_LOCATION_P (t
))
5010 SET_EXPR_LOCATION (t
, loc
);
5013 /* Reset the expression *EXPR_P, a size or position.
5015 ??? We could reset all non-constant sizes or positions. But it's cheap
5016 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5018 We need to reset self-referential sizes or positions because they cannot
5019 be gimplified and thus can contain a CALL_EXPR after the gimplification
5020 is finished, which will run afoul of LTO streaming. And they need to be
5021 reset to something essentially dummy but not constant, so as to preserve
5022 the properties of the object they are attached to. */
5025 free_lang_data_in_one_sizepos (tree
*expr_p
)
5027 tree expr
= *expr_p
;
5028 if (CONTAINS_PLACEHOLDER_P (expr
))
5029 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5033 /* Reset all the fields in a binfo node BINFO. We only keep
5034 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5037 free_lang_data_in_binfo (tree binfo
)
5042 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5044 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5045 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5046 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5047 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5049 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5050 free_lang_data_in_binfo (t
);
5054 /* Reset all language specific information still present in TYPE. */
5057 free_lang_data_in_type (tree type
)
5059 gcc_assert (TYPE_P (type
));
5061 /* Give the FE a chance to remove its own data first. */
5062 lang_hooks
.free_lang_data (type
);
5064 TREE_LANG_FLAG_0 (type
) = 0;
5065 TREE_LANG_FLAG_1 (type
) = 0;
5066 TREE_LANG_FLAG_2 (type
) = 0;
5067 TREE_LANG_FLAG_3 (type
) = 0;
5068 TREE_LANG_FLAG_4 (type
) = 0;
5069 TREE_LANG_FLAG_5 (type
) = 0;
5070 TREE_LANG_FLAG_6 (type
) = 0;
5072 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5074 /* Remove the const and volatile qualifiers from arguments. The
5075 C++ front end removes them, but the C front end does not,
5076 leading to false ODR violation errors when merging two
5077 instances of the same function signature compiled by
5078 different front ends. */
5079 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5081 tree arg_type
= TREE_VALUE (p
);
5083 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5085 int quals
= TYPE_QUALS (arg_type
)
5087 & ~TYPE_QUAL_VOLATILE
;
5088 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5089 free_lang_data_in_type (TREE_VALUE (p
));
5091 /* C++ FE uses TREE_PURPOSE to store initial values. */
5092 TREE_PURPOSE (p
) = NULL
;
5095 else if (TREE_CODE (type
) == METHOD_TYPE
)
5096 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5097 /* C++ FE uses TREE_PURPOSE to store initial values. */
5098 TREE_PURPOSE (p
) = NULL
;
5099 else if (RECORD_OR_UNION_TYPE_P (type
))
5101 /* Remove members that are not FIELD_DECLs (and maybe
5102 TYPE_DECLs) from the field list of an aggregate. These occur
5104 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5105 if (TREE_CODE (member
) == FIELD_DECL
5106 || (TREE_CODE (member
) == TYPE_DECL
5107 && !DECL_IGNORED_P (member
)
5108 && debug_info_level
> DINFO_LEVEL_TERSE
5109 && !is_redundant_typedef (member
)))
5110 prev
= &DECL_CHAIN (member
);
5112 *prev
= DECL_CHAIN (member
);
5114 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5115 and danagle the pointer from time to time. */
5116 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5117 TYPE_VFIELD (type
) = NULL_TREE
;
5119 if (TYPE_BINFO (type
))
5121 free_lang_data_in_binfo (TYPE_BINFO (type
));
5122 /* We need to preserve link to bases and virtual table for all
5123 polymorphic types to make devirtualization machinery working.
5124 Debug output cares only about bases, but output also
5125 virtual table pointers so merging of -fdevirtualize and
5126 -fno-devirtualize units is easier. */
5127 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5128 || !flag_devirtualize
)
5129 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5130 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5131 || debug_info_level
!= DINFO_LEVEL_NONE
))
5132 TYPE_BINFO (type
) = NULL
;
5135 else if (INTEGRAL_TYPE_P (type
)
5136 || SCALAR_FLOAT_TYPE_P (type
)
5137 || FIXED_POINT_TYPE_P (type
))
5139 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5140 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5143 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5145 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5146 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5148 if (TYPE_CONTEXT (type
)
5149 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5151 tree ctx
= TYPE_CONTEXT (type
);
5154 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5156 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5157 TYPE_CONTEXT (type
) = ctx
;
5162 /* Return true if DECL may need an assembler name to be set. */
5165 need_assembler_name_p (tree decl
)
5167 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5168 Rule merging. This makes type_odr_p to return true on those types during
5169 LTO and by comparing the mangled name, we can say what types are intended
5170 to be equivalent across compilation unit.
5172 We do not store names of type_in_anonymous_namespace_p.
5174 Record, union and enumeration type have linkage that allows use
5175 to check type_in_anonymous_namespace_p. We do not mangle compound types
5176 that always can be compared structurally.
5178 Similarly for builtin types, we compare properties of their main variant.
5179 A special case are integer types where mangling do make differences
5180 between char/signed char/unsigned char etc. Storing name for these makes
5181 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5182 See cp/mangle.c:write_builtin_type for details. */
5184 if (flag_lto_odr_type_mering
5185 && TREE_CODE (decl
) == TYPE_DECL
5187 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5188 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5189 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5190 && (type_with_linkage_p (TREE_TYPE (decl
))
5191 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5192 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5193 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5194 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5195 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5198 /* If DECL already has its assembler name set, it does not need a
5200 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5201 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5204 /* Abstract decls do not need an assembler name. */
5205 if (DECL_ABSTRACT_P (decl
))
5208 /* For VAR_DECLs, only static, public and external symbols need an
5211 && !TREE_STATIC (decl
)
5212 && !TREE_PUBLIC (decl
)
5213 && !DECL_EXTERNAL (decl
))
5216 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5218 /* Do not set assembler name on builtins. Allow RTL expansion to
5219 decide whether to expand inline or via a regular call. */
5220 if (DECL_BUILT_IN (decl
)
5221 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5224 /* Functions represented in the callgraph need an assembler name. */
5225 if (cgraph_node::get (decl
) != NULL
)
5228 /* Unused and not public functions don't need an assembler name. */
5229 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5237 /* Reset all language specific information still present in symbol
5241 free_lang_data_in_decl (tree decl
)
5243 gcc_assert (DECL_P (decl
));
5245 /* Give the FE a chance to remove its own data first. */
5246 lang_hooks
.free_lang_data (decl
);
5248 TREE_LANG_FLAG_0 (decl
) = 0;
5249 TREE_LANG_FLAG_1 (decl
) = 0;
5250 TREE_LANG_FLAG_2 (decl
) = 0;
5251 TREE_LANG_FLAG_3 (decl
) = 0;
5252 TREE_LANG_FLAG_4 (decl
) = 0;
5253 TREE_LANG_FLAG_5 (decl
) = 0;
5254 TREE_LANG_FLAG_6 (decl
) = 0;
5256 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5257 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5258 if (TREE_CODE (decl
) == FIELD_DECL
)
5260 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5261 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5262 DECL_QUALIFIER (decl
) = NULL_TREE
;
5265 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5267 struct cgraph_node
*node
;
5268 if (!(node
= cgraph_node::get (decl
))
5269 || (!node
->definition
&& !node
->clones
))
5272 node
->release_body ();
5275 release_function_body (decl
);
5276 DECL_ARGUMENTS (decl
) = NULL
;
5277 DECL_RESULT (decl
) = NULL
;
5278 DECL_INITIAL (decl
) = error_mark_node
;
5281 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5285 /* If DECL has a gimple body, then the context for its
5286 arguments must be DECL. Otherwise, it doesn't really
5287 matter, as we will not be emitting any code for DECL. In
5288 general, there may be other instances of DECL created by
5289 the front end and since PARM_DECLs are generally shared,
5290 their DECL_CONTEXT changes as the replicas of DECL are
5291 created. The only time where DECL_CONTEXT is important
5292 is for the FUNCTION_DECLs that have a gimple body (since
5293 the PARM_DECL will be used in the function's body). */
5294 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5295 DECL_CONTEXT (t
) = decl
;
5296 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5297 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5298 = target_option_default_node
;
5299 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5300 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5301 = optimization_default_node
;
5304 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5305 At this point, it is not needed anymore. */
5306 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5308 /* Clear the abstract origin if it refers to a method.
5309 Otherwise dwarf2out.c will ICE as we splice functions out of
5310 TYPE_FIELDS and thus the origin will not be output
5312 if (DECL_ABSTRACT_ORIGIN (decl
)
5313 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5314 && RECORD_OR_UNION_TYPE_P
5315 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5316 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5318 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5319 DECL_VINDEX referring to itself into a vtable slot number as it
5320 should. Happens with functions that are copied and then forgotten
5321 about. Just clear it, it won't matter anymore. */
5322 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5323 DECL_VINDEX (decl
) = NULL_TREE
;
5325 else if (VAR_P (decl
))
5327 if ((DECL_EXTERNAL (decl
)
5328 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5329 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5330 DECL_INITIAL (decl
) = NULL_TREE
;
5332 else if (TREE_CODE (decl
) == TYPE_DECL
)
5334 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5335 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5336 DECL_INITIAL (decl
) = NULL_TREE
;
5338 else if (TREE_CODE (decl
) == FIELD_DECL
)
5339 DECL_INITIAL (decl
) = NULL_TREE
;
5340 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5341 && DECL_INITIAL (decl
)
5342 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5344 /* Strip builtins from the translation-unit BLOCK. We still have targets
5345 without builtin_decl_explicit support and also builtins are shared
5346 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5347 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5351 if (TREE_CODE (var
) == FUNCTION_DECL
5352 && DECL_BUILT_IN (var
))
5353 *nextp
= TREE_CHAIN (var
);
5355 nextp
= &TREE_CHAIN (var
);
5361 /* Data used when collecting DECLs and TYPEs for language data removal. */
5363 struct free_lang_data_d
5365 free_lang_data_d () : decls (100), types (100) {}
5367 /* Worklist to avoid excessive recursion. */
5368 auto_vec
<tree
> worklist
;
5370 /* Set of traversed objects. Used to avoid duplicate visits. */
5371 hash_set
<tree
> pset
;
5373 /* Array of symbols to process with free_lang_data_in_decl. */
5374 auto_vec
<tree
> decls
;
5376 /* Array of types to process with free_lang_data_in_type. */
5377 auto_vec
<tree
> types
;
5381 /* Save all language fields needed to generate proper debug information
5382 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5385 save_debug_info_for_decl (tree t
)
5387 /*struct saved_debug_info_d *sdi;*/
5389 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5391 /* FIXME. Partial implementation for saving debug info removed. */
5395 /* Save all language fields needed to generate proper debug information
5396 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5399 save_debug_info_for_type (tree t
)
5401 /*struct saved_debug_info_d *sdi;*/
5403 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5405 /* FIXME. Partial implementation for saving debug info removed. */
5409 /* Add type or decl T to one of the list of tree nodes that need their
5410 language data removed. The lists are held inside FLD. */
5413 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5417 fld
->decls
.safe_push (t
);
5418 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5419 save_debug_info_for_decl (t
);
5421 else if (TYPE_P (t
))
5423 fld
->types
.safe_push (t
);
5424 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5425 save_debug_info_for_type (t
);
5431 /* Push tree node T into FLD->WORKLIST. */
5434 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5436 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5437 fld
->worklist
.safe_push ((t
));
5441 /* Operand callback helper for free_lang_data_in_node. *TP is the
5442 subtree operand being considered. */
5445 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5448 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5450 if (TREE_CODE (t
) == TREE_LIST
)
5453 /* Language specific nodes will be removed, so there is no need
5454 to gather anything under them. */
5455 if (is_lang_specific (t
))
5463 /* Note that walk_tree does not traverse every possible field in
5464 decls, so we have to do our own traversals here. */
5465 add_tree_to_fld_list (t
, fld
);
5467 fld_worklist_push (DECL_NAME (t
), fld
);
5468 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5469 fld_worklist_push (DECL_SIZE (t
), fld
);
5470 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5472 /* We are going to remove everything under DECL_INITIAL for
5473 TYPE_DECLs. No point walking them. */
5474 if (TREE_CODE (t
) != TYPE_DECL
)
5475 fld_worklist_push (DECL_INITIAL (t
), fld
);
5477 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5478 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5480 if (TREE_CODE (t
) == FUNCTION_DECL
)
5482 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5483 fld_worklist_push (DECL_RESULT (t
), fld
);
5485 else if (TREE_CODE (t
) == TYPE_DECL
)
5487 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5489 else if (TREE_CODE (t
) == FIELD_DECL
)
5491 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5492 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5493 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5494 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5497 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5498 && DECL_HAS_VALUE_EXPR_P (t
))
5499 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5501 if (TREE_CODE (t
) != FIELD_DECL
5502 && TREE_CODE (t
) != TYPE_DECL
)
5503 fld_worklist_push (TREE_CHAIN (t
), fld
);
5506 else if (TYPE_P (t
))
5508 /* Note that walk_tree does not traverse every possible field in
5509 types, so we have to do our own traversals here. */
5510 add_tree_to_fld_list (t
, fld
);
5512 if (!RECORD_OR_UNION_TYPE_P (t
))
5513 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5514 fld_worklist_push (TYPE_SIZE (t
), fld
);
5515 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5516 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5517 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5518 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5519 fld_worklist_push (TYPE_NAME (t
), fld
);
5520 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5521 them and thus do not and want not to reach unused pointer types
5523 if (!POINTER_TYPE_P (t
))
5524 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5525 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5526 if (!RECORD_OR_UNION_TYPE_P (t
))
5527 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5528 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5529 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5530 do not and want not to reach unused variants this way. */
5531 if (TYPE_CONTEXT (t
))
5533 tree ctx
= TYPE_CONTEXT (t
);
5534 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5535 So push that instead. */
5536 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5537 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5538 fld_worklist_push (ctx
, fld
);
5540 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5541 and want not to reach unused types this way. */
5543 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5547 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5548 fld_worklist_push (TREE_TYPE (tem
), fld
);
5549 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5551 if (RECORD_OR_UNION_TYPE_P (t
))
5554 /* Push all TYPE_FIELDS - there can be interleaving interesting
5555 and non-interesting things. */
5556 tem
= TYPE_FIELDS (t
);
5559 if (TREE_CODE (tem
) == FIELD_DECL
5560 || (TREE_CODE (tem
) == TYPE_DECL
5561 && !DECL_IGNORED_P (tem
)
5562 && debug_info_level
> DINFO_LEVEL_TERSE
5563 && !is_redundant_typedef (tem
)))
5564 fld_worklist_push (tem
, fld
);
5565 tem
= TREE_CHAIN (tem
);
5569 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5572 else if (TREE_CODE (t
) == BLOCK
)
5575 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5576 fld_worklist_push (tem
, fld
);
5577 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5578 fld_worklist_push (tem
, fld
);
5579 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5582 if (TREE_CODE (t
) != IDENTIFIER_NODE
5583 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5584 fld_worklist_push (TREE_TYPE (t
), fld
);
5590 /* Find decls and types in T. */
5593 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5597 if (!fld
->pset
.contains (t
))
5598 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5599 if (fld
->worklist
.is_empty ())
5601 t
= fld
->worklist
.pop ();
5605 /* Translate all the types in LIST with the corresponding runtime
5609 get_eh_types_for_runtime (tree list
)
5613 if (list
== NULL_TREE
)
5616 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5618 list
= TREE_CHAIN (list
);
5621 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5622 TREE_CHAIN (prev
) = n
;
5623 prev
= TREE_CHAIN (prev
);
5624 list
= TREE_CHAIN (list
);
5631 /* Find decls and types referenced in EH region R and store them in
5632 FLD->DECLS and FLD->TYPES. */
5635 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5646 /* The types referenced in each catch must first be changed to the
5647 EH types used at runtime. This removes references to FE types
5649 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5651 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5652 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5657 case ERT_ALLOWED_EXCEPTIONS
:
5658 r
->u
.allowed
.type_list
5659 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5660 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5663 case ERT_MUST_NOT_THROW
:
5664 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5665 find_decls_types_r
, fld
, &fld
->pset
);
5671 /* Find decls and types referenced in cgraph node N and store them in
5672 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5673 look for *every* kind of DECL and TYPE node reachable from N,
5674 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5675 NAMESPACE_DECLs, etc). */
5678 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5681 struct function
*fn
;
5685 find_decls_types (n
->decl
, fld
);
5687 if (!gimple_has_body_p (n
->decl
))
5690 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5692 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5694 /* Traverse locals. */
5695 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5696 find_decls_types (t
, fld
);
5698 /* Traverse EH regions in FN. */
5701 FOR_ALL_EH_REGION_FN (r
, fn
)
5702 find_decls_types_in_eh_region (r
, fld
);
5705 /* Traverse every statement in FN. */
5706 FOR_EACH_BB_FN (bb
, fn
)
5709 gimple_stmt_iterator si
;
5712 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5714 gphi
*phi
= psi
.phi ();
5716 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5718 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5719 find_decls_types (*arg_p
, fld
);
5723 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5725 gimple
*stmt
= gsi_stmt (si
);
5727 if (is_gimple_call (stmt
))
5728 find_decls_types (gimple_call_fntype (stmt
), fld
);
5730 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5732 tree arg
= gimple_op (stmt
, i
);
5733 find_decls_types (arg
, fld
);
5740 /* Find decls and types referenced in varpool node N and store them in
5741 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5742 look for *every* kind of DECL and TYPE node reachable from N,
5743 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5744 NAMESPACE_DECLs, etc). */
5747 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5749 find_decls_types (v
->decl
, fld
);
5752 /* If T needs an assembler name, have one created for it. */
5755 assign_assembler_name_if_needed (tree t
)
5757 if (need_assembler_name_p (t
))
5759 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5760 diagnostics that use input_location to show locus
5761 information. The problem here is that, at this point,
5762 input_location is generally anchored to the end of the file
5763 (since the parser is long gone), so we don't have a good
5764 position to pin it to.
5766 To alleviate this problem, this uses the location of T's
5767 declaration. Examples of this are
5768 testsuite/g++.dg/template/cond2.C and
5769 testsuite/g++.dg/template/pr35240.C. */
5770 location_t saved_location
= input_location
;
5771 input_location
= DECL_SOURCE_LOCATION (t
);
5773 decl_assembler_name (t
);
5775 input_location
= saved_location
;
5780 /* Free language specific information for every operand and expression
5781 in every node of the call graph. This process operates in three stages:
5783 1- Every callgraph node and varpool node is traversed looking for
5784 decls and types embedded in them. This is a more exhaustive
5785 search than that done by find_referenced_vars, because it will
5786 also collect individual fields, decls embedded in types, etc.
5788 2- All the decls found are sent to free_lang_data_in_decl.
5790 3- All the types found are sent to free_lang_data_in_type.
5792 The ordering between decls and types is important because
5793 free_lang_data_in_decl sets assembler names, which includes
5794 mangling. So types cannot be freed up until assembler names have
5798 free_lang_data_in_cgraph (void)
5800 struct cgraph_node
*n
;
5802 struct free_lang_data_d fld
;
5807 /* Find decls and types in the body of every function in the callgraph. */
5808 FOR_EACH_FUNCTION (n
)
5809 find_decls_types_in_node (n
, &fld
);
5811 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5812 find_decls_types (p
->decl
, &fld
);
5814 /* Find decls and types in every varpool symbol. */
5815 FOR_EACH_VARIABLE (v
)
5816 find_decls_types_in_var (v
, &fld
);
5818 /* Set the assembler name on every decl found. We need to do this
5819 now because free_lang_data_in_decl will invalidate data needed
5820 for mangling. This breaks mangling on interdependent decls. */
5821 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5822 assign_assembler_name_if_needed (t
);
5824 /* Traverse every decl found freeing its language data. */
5825 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5826 free_lang_data_in_decl (t
);
5828 /* Traverse every type found freeing its language data. */
5829 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5830 free_lang_data_in_type (t
);
5833 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5839 /* Free resources that are used by FE but are not needed once they are done. */
5842 free_lang_data (void)
5846 /* If we are the LTO frontend we have freed lang-specific data already. */
5848 || (!flag_generate_lto
&& !flag_generate_offload
))
5851 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5852 if (vec_safe_is_empty (all_translation_units
))
5853 build_translation_unit_decl (NULL_TREE
);
5855 /* Allocate and assign alias sets to the standard integer types
5856 while the slots are still in the way the frontends generated them. */
5857 for (i
= 0; i
< itk_none
; ++i
)
5858 if (integer_types
[i
])
5859 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5861 /* Traverse the IL resetting language specific information for
5862 operands, expressions, etc. */
5863 free_lang_data_in_cgraph ();
5865 /* Create gimple variants for common types. */
5866 for (unsigned i
= 0;
5867 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5869 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5871 /* Reset some langhooks. Do not reset types_compatible_p, it may
5872 still be used indirectly via the get_alias_set langhook. */
5873 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5874 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5875 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5877 /* We do not want the default decl_assembler_name implementation,
5878 rather if we have fixed everything we want a wrapper around it
5879 asserting that all non-local symbols already got their assembler
5880 name and only produce assembler names for local symbols. Or rather
5881 make sure we never call decl_assembler_name on local symbols and
5882 devise a separate, middle-end private scheme for it. */
5884 /* Reset diagnostic machinery. */
5885 tree_diagnostics_defaults (global_dc
);
5893 const pass_data pass_data_ipa_free_lang_data
=
5895 SIMPLE_IPA_PASS
, /* type */
5896 "*free_lang_data", /* name */
5897 OPTGROUP_NONE
, /* optinfo_flags */
5898 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5899 0, /* properties_required */
5900 0, /* properties_provided */
5901 0, /* properties_destroyed */
5902 0, /* todo_flags_start */
5903 0, /* todo_flags_finish */
5906 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5909 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5910 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5913 /* opt_pass methods: */
5914 virtual unsigned int execute (function
*) { return free_lang_data (); }
5916 }; // class pass_ipa_free_lang_data
5920 simple_ipa_opt_pass
*
5921 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5923 return new pass_ipa_free_lang_data (ctxt
);
5926 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5927 of the various TYPE_QUAL values. */
5930 set_type_quals (tree type
, int type_quals
)
5932 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5933 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5934 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5935 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5936 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5939 /* Returns true iff CAND and BASE have equivalent language-specific
5943 check_lang_type (const_tree cand
, const_tree base
)
5945 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5947 /* type_hash_eq currently only applies to these types. */
5948 if (TREE_CODE (cand
) != FUNCTION_TYPE
5949 && TREE_CODE (cand
) != METHOD_TYPE
)
5951 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5954 /* Returns true iff unqualified CAND and BASE are equivalent. */
5957 check_base_type (const_tree cand
, const_tree base
)
5959 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5960 /* Apparently this is needed for Objective-C. */
5961 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5962 /* Check alignment. */
5963 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5964 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5965 TYPE_ATTRIBUTES (base
)));
5968 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5971 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5973 return (TYPE_QUALS (cand
) == type_quals
5974 && check_base_type (cand
, base
)
5975 && check_lang_type (cand
, base
));
5978 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5981 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5983 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5984 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5985 /* Apparently this is needed for Objective-C. */
5986 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5987 /* Check alignment. */
5988 && TYPE_ALIGN (cand
) == align
5989 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5990 TYPE_ATTRIBUTES (base
))
5991 && check_lang_type (cand
, base
));
5994 /* This function checks to see if TYPE matches the size one of the built-in
5995 atomic types, and returns that core atomic type. */
5998 find_atomic_core_type (tree type
)
6000 tree base_atomic_type
;
6002 /* Only handle complete types. */
6003 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6006 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6009 base_atomic_type
= atomicQI_type_node
;
6013 base_atomic_type
= atomicHI_type_node
;
6017 base_atomic_type
= atomicSI_type_node
;
6021 base_atomic_type
= atomicDI_type_node
;
6025 base_atomic_type
= atomicTI_type_node
;
6029 base_atomic_type
= NULL_TREE
;
6032 return base_atomic_type
;
6035 /* Return a version of the TYPE, qualified as indicated by the
6036 TYPE_QUALS, if one exists. If no qualified version exists yet,
6037 return NULL_TREE. */
6040 get_qualified_type (tree type
, int type_quals
)
6044 if (TYPE_QUALS (type
) == type_quals
)
6047 /* Search the chain of variants to see if there is already one there just
6048 like the one we need to have. If so, use that existing one. We must
6049 preserve the TYPE_NAME, since there is code that depends on this. */
6050 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6051 if (check_qualified_type (t
, type
, type_quals
))
6057 /* Like get_qualified_type, but creates the type if it does not
6058 exist. This function never returns NULL_TREE. */
6061 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6065 /* See if we already have the appropriate qualified variant. */
6066 t
= get_qualified_type (type
, type_quals
);
6068 /* If not, build it. */
6071 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6072 set_type_quals (t
, type_quals
);
6074 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6076 /* See if this object can map to a basic atomic type. */
6077 tree atomic_type
= find_atomic_core_type (type
);
6080 /* Ensure the alignment of this type is compatible with
6081 the required alignment of the atomic type. */
6082 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6083 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6087 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6088 /* Propagate structural equality. */
6089 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6090 else if (TYPE_CANONICAL (type
) != type
)
6091 /* Build the underlying canonical type, since it is different
6094 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6095 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6098 /* T is its own canonical type. */
6099 TYPE_CANONICAL (t
) = t
;
6106 /* Create a variant of type T with alignment ALIGN. */
6109 build_aligned_type (tree type
, unsigned int align
)
6113 if (TYPE_PACKED (type
)
6114 || TYPE_ALIGN (type
) == align
)
6117 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6118 if (check_aligned_type (t
, type
, align
))
6121 t
= build_variant_type_copy (type
);
6122 SET_TYPE_ALIGN (t
, align
);
6123 TYPE_USER_ALIGN (t
) = 1;
6128 /* Create a new distinct copy of TYPE. The new type is made its own
6129 MAIN_VARIANT. If TYPE requires structural equality checks, the
6130 resulting type requires structural equality checks; otherwise, its
6131 TYPE_CANONICAL points to itself. */
6134 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6136 tree t
= copy_node (type PASS_MEM_STAT
);
6138 TYPE_POINTER_TO (t
) = 0;
6139 TYPE_REFERENCE_TO (t
) = 0;
6141 /* Set the canonical type either to a new equivalence class, or
6142 propagate the need for structural equality checks. */
6143 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6144 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6146 TYPE_CANONICAL (t
) = t
;
6148 /* Make it its own variant. */
6149 TYPE_MAIN_VARIANT (t
) = t
;
6150 TYPE_NEXT_VARIANT (t
) = 0;
6152 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6153 whose TREE_TYPE is not t. This can also happen in the Ada
6154 frontend when using subtypes. */
6159 /* Create a new variant of TYPE, equivalent but distinct. This is so
6160 the caller can modify it. TYPE_CANONICAL for the return type will
6161 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6162 are considered equal by the language itself (or that both types
6163 require structural equality checks). */
6166 build_variant_type_copy (tree type MEM_STAT_DECL
)
6168 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6170 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6172 /* Since we're building a variant, assume that it is a non-semantic
6173 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6174 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6175 /* Type variants have no alias set defined. */
6176 TYPE_ALIAS_SET (t
) = -1;
6178 /* Add the new type to the chain of variants of TYPE. */
6179 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6180 TYPE_NEXT_VARIANT (m
) = t
;
6181 TYPE_MAIN_VARIANT (t
) = m
;
6186 /* Return true if the from tree in both tree maps are equal. */
6189 tree_map_base_eq (const void *va
, const void *vb
)
6191 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6192 *const b
= (const struct tree_map_base
*) vb
;
6193 return (a
->from
== b
->from
);
6196 /* Hash a from tree in a tree_base_map. */
6199 tree_map_base_hash (const void *item
)
6201 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6204 /* Return true if this tree map structure is marked for garbage collection
6205 purposes. We simply return true if the from tree is marked, so that this
6206 structure goes away when the from tree goes away. */
6209 tree_map_base_marked_p (const void *p
)
6211 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6214 /* Hash a from tree in a tree_map. */
6217 tree_map_hash (const void *item
)
6219 return (((const struct tree_map
*) item
)->hash
);
6222 /* Hash a from tree in a tree_decl_map. */
6225 tree_decl_map_hash (const void *item
)
6227 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6230 /* Return the initialization priority for DECL. */
6233 decl_init_priority_lookup (tree decl
)
6235 symtab_node
*snode
= symtab_node::get (decl
);
6238 return DEFAULT_INIT_PRIORITY
;
6240 snode
->get_init_priority ();
6243 /* Return the finalization priority for DECL. */
6246 decl_fini_priority_lookup (tree decl
)
6248 cgraph_node
*node
= cgraph_node::get (decl
);
6251 return DEFAULT_INIT_PRIORITY
;
6253 node
->get_fini_priority ();
6256 /* Set the initialization priority for DECL to PRIORITY. */
6259 decl_init_priority_insert (tree decl
, priority_type priority
)
6261 struct symtab_node
*snode
;
6263 if (priority
== DEFAULT_INIT_PRIORITY
)
6265 snode
= symtab_node::get (decl
);
6269 else if (VAR_P (decl
))
6270 snode
= varpool_node::get_create (decl
);
6272 snode
= cgraph_node::get_create (decl
);
6273 snode
->set_init_priority (priority
);
6276 /* Set the finalization priority for DECL to PRIORITY. */
6279 decl_fini_priority_insert (tree decl
, priority_type priority
)
6281 struct cgraph_node
*node
;
6283 if (priority
== DEFAULT_INIT_PRIORITY
)
6285 node
= cgraph_node::get (decl
);
6290 node
= cgraph_node::get_create (decl
);
6291 node
->set_fini_priority (priority
);
6294 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6297 print_debug_expr_statistics (void)
6299 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6300 (long) debug_expr_for_decl
->size (),
6301 (long) debug_expr_for_decl
->elements (),
6302 debug_expr_for_decl
->collisions ());
6305 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6308 print_value_expr_statistics (void)
6310 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6311 (long) value_expr_for_decl
->size (),
6312 (long) value_expr_for_decl
->elements (),
6313 value_expr_for_decl
->collisions ());
6316 /* Lookup a debug expression for FROM, and return it if we find one. */
6319 decl_debug_expr_lookup (tree from
)
6321 struct tree_decl_map
*h
, in
;
6322 in
.base
.from
= from
;
6324 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6330 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6333 decl_debug_expr_insert (tree from
, tree to
)
6335 struct tree_decl_map
*h
;
6337 h
= ggc_alloc
<tree_decl_map
> ();
6338 h
->base
.from
= from
;
6340 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6343 /* Lookup a value expression for FROM, and return it if we find one. */
6346 decl_value_expr_lookup (tree from
)
6348 struct tree_decl_map
*h
, in
;
6349 in
.base
.from
= from
;
6351 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6357 /* Insert a mapping FROM->TO in the value expression hashtable. */
6360 decl_value_expr_insert (tree from
, tree to
)
6362 struct tree_decl_map
*h
;
6364 h
= ggc_alloc
<tree_decl_map
> ();
6365 h
->base
.from
= from
;
6367 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6370 /* Lookup a vector of debug arguments for FROM, and return it if we
6374 decl_debug_args_lookup (tree from
)
6376 struct tree_vec_map
*h
, in
;
6378 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6380 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6381 in
.base
.from
= from
;
6382 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6388 /* Insert a mapping FROM->empty vector of debug arguments in the value
6389 expression hashtable. */
6392 decl_debug_args_insert (tree from
)
6394 struct tree_vec_map
*h
;
6397 if (DECL_HAS_DEBUG_ARGS_P (from
))
6398 return decl_debug_args_lookup (from
);
6399 if (debug_args_for_decl
== NULL
)
6400 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6401 h
= ggc_alloc
<tree_vec_map
> ();
6402 h
->base
.from
= from
;
6404 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6406 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6410 /* Hashing of types so that we don't make duplicates.
6411 The entry point is `type_hash_canon'. */
6413 /* Generate the default hash code for TYPE. This is designed for
6414 speed, rather than maximum entropy. */
6417 type_hash_canon_hash (tree type
)
6419 inchash::hash hstate
;
6421 hstate
.add_int (TREE_CODE (type
));
6423 if (TREE_TYPE (type
))
6424 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6426 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6427 /* Just the identifier is adequate to distinguish. */
6428 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6430 switch (TREE_CODE (type
))
6433 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6436 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6437 if (TREE_VALUE (t
) != error_mark_node
)
6438 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6442 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6447 if (TYPE_DOMAIN (type
))
6448 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6449 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6451 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6452 hstate
.add_object (typeless
);
6459 tree t
= TYPE_MAX_VALUE (type
);
6461 t
= TYPE_MIN_VALUE (type
);
6462 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6463 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6468 case FIXED_POINT_TYPE
:
6470 unsigned prec
= TYPE_PRECISION (type
);
6471 hstate
.add_object (prec
);
6477 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
6478 hstate
.add_object (nunits
);
6486 return hstate
.end ();
6489 /* These are the Hashtable callback functions. */
6491 /* Returns true iff the types are equivalent. */
6494 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6496 /* First test the things that are the same for all types. */
6497 if (a
->hash
!= b
->hash
6498 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6499 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6500 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6501 TYPE_ATTRIBUTES (b
->type
))
6502 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6503 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6506 /* Be careful about comparing arrays before and after the element type
6507 has been completed; don't compare TYPE_ALIGN unless both types are
6509 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6510 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6511 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6514 switch (TREE_CODE (a
->type
))
6519 case REFERENCE_TYPE
:
6524 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6527 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6528 && !(TYPE_VALUES (a
->type
)
6529 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6530 && TYPE_VALUES (b
->type
)
6531 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6532 && type_list_equal (TYPE_VALUES (a
->type
),
6533 TYPE_VALUES (b
->type
))))
6541 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6543 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6544 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6545 TYPE_MAX_VALUE (b
->type
)))
6546 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6547 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6548 TYPE_MIN_VALUE (b
->type
))));
6550 case FIXED_POINT_TYPE
:
6551 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6554 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6557 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6558 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6559 || (TYPE_ARG_TYPES (a
->type
)
6560 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6561 && TYPE_ARG_TYPES (b
->type
)
6562 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6563 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6564 TYPE_ARG_TYPES (b
->type
)))))
6568 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6569 where the flag should be inherited from the element type
6570 and can change after ARRAY_TYPEs are created; on non-aggregates
6571 compare it and hash it, scalars will never have that flag set
6572 and we need to differentiate between arrays created by different
6573 front-ends or middle-end created arrays. */
6574 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6575 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6576 || (TYPE_TYPELESS_STORAGE (a
->type
)
6577 == TYPE_TYPELESS_STORAGE (b
->type
))));
6581 case QUAL_UNION_TYPE
:
6582 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6583 || (TYPE_FIELDS (a
->type
)
6584 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6585 && TYPE_FIELDS (b
->type
)
6586 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6587 && type_list_equal (TYPE_FIELDS (a
->type
),
6588 TYPE_FIELDS (b
->type
))));
6591 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6592 || (TYPE_ARG_TYPES (a
->type
)
6593 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6594 && TYPE_ARG_TYPES (b
->type
)
6595 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6596 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6597 TYPE_ARG_TYPES (b
->type
))))
6605 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6606 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6611 /* Given TYPE, and HASHCODE its hash code, return the canonical
6612 object for an identical type if one already exists.
6613 Otherwise, return TYPE, and record it as the canonical object.
6615 To use this function, first create a type of the sort you want.
6616 Then compute its hash code from the fields of the type that
6617 make it different from other similar types.
6618 Then call this function and use the value. */
6621 type_hash_canon (unsigned int hashcode
, tree type
)
6626 /* The hash table only contains main variants, so ensure that's what we're
6628 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6630 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6631 must call that routine before comparing TYPE_ALIGNs. */
6637 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6640 tree t1
= ((type_hash
*) *loc
)->type
;
6641 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6642 if (TYPE_UID (type
) + 1 == next_type_uid
)
6644 /* Free also min/max values and the cache for integer
6645 types. This can't be done in free_node, as LTO frees
6646 those on its own. */
6647 if (TREE_CODE (type
) == INTEGER_TYPE
)
6649 if (TYPE_MIN_VALUE (type
)
6650 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6652 /* Zero is always in TYPE_CACHED_VALUES. */
6653 if (! TYPE_UNSIGNED (type
))
6654 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6655 ggc_free (TYPE_MIN_VALUE (type
));
6657 if (TYPE_MAX_VALUE (type
)
6658 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6660 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6661 ggc_free (TYPE_MAX_VALUE (type
));
6663 if (TYPE_CACHED_VALUES_P (type
))
6664 ggc_free (TYPE_CACHED_VALUES (type
));
6671 struct type_hash
*h
;
6673 h
= ggc_alloc
<type_hash
> ();
6683 print_type_hash_statistics (void)
6685 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6686 (long) type_hash_table
->size (),
6687 (long) type_hash_table
->elements (),
6688 type_hash_table
->collisions ());
6691 /* Given two lists of types
6692 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6693 return 1 if the lists contain the same types in the same order.
6694 Also, the TREE_PURPOSEs must match. */
6697 type_list_equal (const_tree l1
, const_tree l2
)
6701 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6702 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6703 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6704 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6705 && (TREE_TYPE (TREE_PURPOSE (t1
))
6706 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6712 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6713 given by TYPE. If the argument list accepts variable arguments,
6714 then this function counts only the ordinary arguments. */
6717 type_num_arguments (const_tree type
)
6722 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6723 /* If the function does not take a variable number of arguments,
6724 the last element in the list will have type `void'. */
6725 if (VOID_TYPE_P (TREE_VALUE (t
)))
6733 /* Nonzero if integer constants T1 and T2
6734 represent the same constant value. */
6737 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6742 if (t1
== 0 || t2
== 0)
6745 if (TREE_CODE (t1
) == INTEGER_CST
6746 && TREE_CODE (t2
) == INTEGER_CST
6747 && wi::to_widest (t1
) == wi::to_widest (t2
))
6753 /* Return true if T is an INTEGER_CST whose numerical value (extended
6754 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6757 tree_fits_shwi_p (const_tree t
)
6759 return (t
!= NULL_TREE
6760 && TREE_CODE (t
) == INTEGER_CST
6761 && wi::fits_shwi_p (wi::to_widest (t
)));
6764 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6765 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6768 tree_fits_poly_int64_p (const_tree t
)
6772 if (POLY_INT_CST_P (t
))
6774 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6775 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
6779 return (TREE_CODE (t
) == INTEGER_CST
6780 && wi::fits_shwi_p (wi::to_widest (t
)));
6783 /* Return true if T is an INTEGER_CST whose numerical value (extended
6784 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6787 tree_fits_uhwi_p (const_tree t
)
6789 return (t
!= NULL_TREE
6790 && TREE_CODE (t
) == INTEGER_CST
6791 && wi::fits_uhwi_p (wi::to_widest (t
)));
6794 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6795 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
6798 tree_fits_poly_uint64_p (const_tree t
)
6802 if (POLY_INT_CST_P (t
))
6804 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
6805 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
6809 return (TREE_CODE (t
) == INTEGER_CST
6810 && wi::fits_uhwi_p (wi::to_widest (t
)));
6813 /* T is an INTEGER_CST whose numerical value (extended according to
6814 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6818 tree_to_shwi (const_tree t
)
6820 gcc_assert (tree_fits_shwi_p (t
));
6821 return TREE_INT_CST_LOW (t
);
6824 /* T is an INTEGER_CST whose numerical value (extended according to
6825 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6828 unsigned HOST_WIDE_INT
6829 tree_to_uhwi (const_tree t
)
6831 gcc_assert (tree_fits_uhwi_p (t
));
6832 return TREE_INT_CST_LOW (t
);
6835 /* Return the most significant (sign) bit of T. */
6838 tree_int_cst_sign_bit (const_tree t
)
6840 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6842 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6845 /* Return an indication of the sign of the integer constant T.
6846 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6847 Note that -1 will never be returned if T's type is unsigned. */
6850 tree_int_cst_sgn (const_tree t
)
6852 if (wi::to_wide (t
) == 0)
6854 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6856 else if (wi::neg_p (wi::to_wide (t
)))
6862 /* Return the minimum number of bits needed to represent VALUE in a
6863 signed or unsigned type, UNSIGNEDP says which. */
6866 tree_int_cst_min_precision (tree value
, signop sgn
)
6868 /* If the value is negative, compute its negative minus 1. The latter
6869 adjustment is because the absolute value of the largest negative value
6870 is one larger than the largest positive value. This is equivalent to
6871 a bit-wise negation, so use that operation instead. */
6873 if (tree_int_cst_sgn (value
) < 0)
6874 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6876 /* Return the number of bits needed, taking into account the fact
6877 that we need one more bit for a signed than unsigned type.
6878 If value is 0 or -1, the minimum precision is 1 no matter
6879 whether unsignedp is true or false. */
6881 if (integer_zerop (value
))
6884 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6887 /* Return truthvalue of whether T1 is the same tree structure as T2.
6888 Return 1 if they are the same.
6889 Return 0 if they are understandably different.
6890 Return -1 if either contains tree structure not understood by
6894 simple_cst_equal (const_tree t1
, const_tree t2
)
6896 enum tree_code code1
, code2
;
6902 if (t1
== 0 || t2
== 0)
6905 code1
= TREE_CODE (t1
);
6906 code2
= TREE_CODE (t2
);
6908 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6910 if (CONVERT_EXPR_CODE_P (code2
)
6911 || code2
== NON_LVALUE_EXPR
)
6912 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6914 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6917 else if (CONVERT_EXPR_CODE_P (code2
)
6918 || code2
== NON_LVALUE_EXPR
)
6919 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6927 return wi::to_widest (t1
) == wi::to_widest (t2
);
6930 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6933 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6936 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6937 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6938 TREE_STRING_LENGTH (t1
)));
6942 unsigned HOST_WIDE_INT idx
;
6943 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6944 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6946 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6949 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6950 /* ??? Should we handle also fields here? */
6951 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6957 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6960 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6963 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6966 const_tree arg1
, arg2
;
6967 const_call_expr_arg_iterator iter1
, iter2
;
6968 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6969 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6971 arg1
= next_const_call_expr_arg (&iter1
),
6972 arg2
= next_const_call_expr_arg (&iter2
))
6974 cmp
= simple_cst_equal (arg1
, arg2
);
6978 return arg1
== arg2
;
6982 /* Special case: if either target is an unallocated VAR_DECL,
6983 it means that it's going to be unified with whatever the
6984 TARGET_EXPR is really supposed to initialize, so treat it
6985 as being equivalent to anything. */
6986 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6987 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6988 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6989 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6990 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6991 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6994 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6999 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7001 case WITH_CLEANUP_EXPR
:
7002 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7006 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7009 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7010 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7021 if (POLY_INT_CST_P (t1
))
7022 /* A false return means maybe_ne rather than known_ne. */
7023 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7024 TYPE_SIGN (TREE_TYPE (t1
))),
7025 poly_widest_int::from (poly_int_cst_value (t2
),
7026 TYPE_SIGN (TREE_TYPE (t2
))));
7030 /* This general rule works for most tree codes. All exceptions should be
7031 handled above. If this is a language-specific tree code, we can't
7032 trust what might be in the operand, so say we don't know
7034 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7037 switch (TREE_CODE_CLASS (code1
))
7041 case tcc_comparison
:
7042 case tcc_expression
:
7046 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7048 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7060 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7061 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7062 than U, respectively. */
7065 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7067 if (tree_int_cst_sgn (t
) < 0)
7069 else if (!tree_fits_uhwi_p (t
))
7071 else if (TREE_INT_CST_LOW (t
) == u
)
7073 else if (TREE_INT_CST_LOW (t
) < u
)
7079 /* Return true if SIZE represents a constant size that is in bounds of
7080 what the middle-end and the backend accepts (covering not more than
7081 half of the address-space). */
7084 valid_constant_size_p (const_tree size
)
7086 if (POLY_INT_CST_P (size
))
7088 if (TREE_OVERFLOW (size
))
7090 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7091 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7095 if (! tree_fits_uhwi_p (size
)
7096 || TREE_OVERFLOW (size
)
7097 || tree_int_cst_sign_bit (size
) != 0)
7102 /* Return the precision of the type, or for a complex or vector type the
7103 precision of the type of its elements. */
7106 element_precision (const_tree type
)
7109 type
= TREE_TYPE (type
);
7110 enum tree_code code
= TREE_CODE (type
);
7111 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7112 type
= TREE_TYPE (type
);
7114 return TYPE_PRECISION (type
);
7117 /* Return true if CODE represents an associative tree code. Otherwise
7120 associative_tree_code (enum tree_code code
)
7139 /* Return true if CODE represents a commutative tree code. Otherwise
7142 commutative_tree_code (enum tree_code code
)
7148 case MULT_HIGHPART_EXPR
:
7156 case UNORDERED_EXPR
:
7160 case TRUTH_AND_EXPR
:
7161 case TRUTH_XOR_EXPR
:
7163 case WIDEN_MULT_EXPR
:
7164 case VEC_WIDEN_MULT_HI_EXPR
:
7165 case VEC_WIDEN_MULT_LO_EXPR
:
7166 case VEC_WIDEN_MULT_EVEN_EXPR
:
7167 case VEC_WIDEN_MULT_ODD_EXPR
:
7176 /* Return true if CODE represents a ternary tree code for which the
7177 first two operands are commutative. Otherwise return false. */
7179 commutative_ternary_tree_code (enum tree_code code
)
7183 case WIDEN_MULT_PLUS_EXPR
:
7184 case WIDEN_MULT_MINUS_EXPR
:
7195 /* Returns true if CODE can overflow. */
7198 operation_can_overflow (enum tree_code code
)
7206 /* Can overflow in various ways. */
7208 case TRUNC_DIV_EXPR
:
7209 case EXACT_DIV_EXPR
:
7210 case FLOOR_DIV_EXPR
:
7212 /* For INT_MIN / -1. */
7219 /* These operators cannot overflow. */
7224 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7225 ftrapv doesn't generate trapping insns for CODE. */
7228 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7230 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7232 /* We don't generate instructions that trap on overflow for complex or vector
7234 if (!INTEGRAL_TYPE_P (type
))
7237 if (!TYPE_OVERFLOW_TRAPS (type
))
7247 /* These operators can overflow, and -ftrapv generates trapping code for
7250 case TRUNC_DIV_EXPR
:
7251 case EXACT_DIV_EXPR
:
7252 case FLOOR_DIV_EXPR
:
7255 /* These operators can overflow, but -ftrapv does not generate trapping
7259 /* These operators cannot overflow. */
7267 /* Generate a hash value for an expression. This can be used iteratively
7268 by passing a previous result as the HSTATE argument.
7270 This function is intended to produce the same hash for expressions which
7271 would compare equal using operand_equal_p. */
7273 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7276 enum tree_code code
;
7277 enum tree_code_class tclass
;
7279 if (t
== NULL_TREE
|| t
== error_mark_node
)
7281 hstate
.merge_hash (0);
7285 if (!(flags
& OEP_ADDRESS_OF
))
7288 code
= TREE_CODE (t
);
7292 /* Alas, constants aren't shared, so we can't rely on pointer
7295 hstate
.merge_hash (0);
7298 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7299 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7300 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7305 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7308 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7309 hstate
.merge_hash (val2
);
7314 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7315 hstate
.merge_hash (val2
);
7319 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7320 TREE_STRING_LENGTH (t
));
7323 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7324 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7328 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7329 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7330 unsigned int count
= vector_cst_encoded_nelts (t
);
7331 for (unsigned int i
= 0; i
< count
; ++i
)
7332 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7336 /* We can just compare by pointer. */
7337 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7339 case PLACEHOLDER_EXPR
:
7340 /* The node itself doesn't matter. */
7347 /* A list of expressions, for a CALL_EXPR or as the elements of a
7349 for (; t
; t
= TREE_CHAIN (t
))
7350 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7354 unsigned HOST_WIDE_INT idx
;
7356 flags
&= ~OEP_ADDRESS_OF
;
7357 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7359 inchash::add_expr (field
, hstate
, flags
);
7360 inchash::add_expr (value
, hstate
, flags
);
7364 case STATEMENT_LIST
:
7366 tree_stmt_iterator i
;
7367 for (i
= tsi_start (CONST_CAST_TREE (t
));
7368 !tsi_end_p (i
); tsi_next (&i
))
7369 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7373 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7374 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7377 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7378 Otherwise nodes that compare equal according to operand_equal_p might
7379 get different hash codes. However, don't do this for machine specific
7380 or front end builtins, since the function code is overloaded in those
7382 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7383 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7385 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7386 code
= TREE_CODE (t
);
7390 if (POLY_INT_CST_P (t
))
7392 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7393 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7396 tclass
= TREE_CODE_CLASS (code
);
7398 if (tclass
== tcc_declaration
)
7400 /* DECL's have a unique ID */
7401 hstate
.add_hwi (DECL_UID (t
));
7403 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7405 /* For comparisons that can be swapped, use the lower
7407 enum tree_code ccode
= swap_tree_comparison (code
);
7410 hstate
.add_object (ccode
);
7411 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7412 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7414 else if (CONVERT_EXPR_CODE_P (code
))
7416 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7418 enum tree_code ccode
= NOP_EXPR
;
7419 hstate
.add_object (ccode
);
7421 /* Don't hash the type, that can lead to having nodes which
7422 compare equal according to operand_equal_p, but which
7423 have different hash codes. Make sure to include signedness
7424 in the hash computation. */
7425 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7426 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7428 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7429 else if (code
== MEM_REF
7430 && (flags
& OEP_ADDRESS_OF
) != 0
7431 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7432 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7433 && integer_zerop (TREE_OPERAND (t
, 1)))
7434 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7436 /* Don't ICE on FE specific trees, or their arguments etc.
7437 during operand_equal_p hash verification. */
7438 else if (!IS_EXPR_CODE_CLASS (tclass
))
7439 gcc_assert (flags
& OEP_HASH_CHECK
);
7442 unsigned int sflags
= flags
;
7444 hstate
.add_object (code
);
7449 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7450 flags
|= OEP_ADDRESS_OF
;
7456 case TARGET_MEM_REF
:
7457 flags
&= ~OEP_ADDRESS_OF
;
7462 case ARRAY_RANGE_REF
:
7465 sflags
&= ~OEP_ADDRESS_OF
;
7469 flags
&= ~OEP_ADDRESS_OF
;
7473 case WIDEN_MULT_PLUS_EXPR
:
7474 case WIDEN_MULT_MINUS_EXPR
:
7476 /* The multiplication operands are commutative. */
7477 inchash::hash one
, two
;
7478 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7479 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7480 hstate
.add_commutative (one
, two
);
7481 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7486 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7487 hstate
.add_int (CALL_EXPR_IFN (t
));
7491 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7492 Usually different TARGET_EXPRs just should use
7493 different temporaries in their slots. */
7494 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7501 /* Don't hash the type, that can lead to having nodes which
7502 compare equal according to operand_equal_p, but which
7503 have different hash codes. */
7504 if (code
== NON_LVALUE_EXPR
)
7506 /* Make sure to include signness in the hash computation. */
7507 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7508 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7511 else if (commutative_tree_code (code
))
7513 /* It's a commutative expression. We want to hash it the same
7514 however it appears. We do this by first hashing both operands
7515 and then rehashing based on the order of their independent
7517 inchash::hash one
, two
;
7518 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7519 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7520 hstate
.add_commutative (one
, two
);
7523 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7524 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7525 i
== 0 ? flags
: sflags
);
7533 /* Constructors for pointer, array and function types.
7534 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7535 constructed by language-dependent code, not here.) */
7537 /* Construct, lay out and return the type of pointers to TO_TYPE with
7538 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7539 reference all of memory. If such a type has already been
7540 constructed, reuse it. */
7543 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7547 bool could_alias
= can_alias_all
;
7549 if (to_type
== error_mark_node
)
7550 return error_mark_node
;
7552 /* If the pointed-to type has the may_alias attribute set, force
7553 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7554 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7555 can_alias_all
= true;
7557 /* In some cases, languages will have things that aren't a POINTER_TYPE
7558 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7559 In that case, return that type without regard to the rest of our
7562 ??? This is a kludge, but consistent with the way this function has
7563 always operated and there doesn't seem to be a good way to avoid this
7565 if (TYPE_POINTER_TO (to_type
) != 0
7566 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7567 return TYPE_POINTER_TO (to_type
);
7569 /* First, if we already have a type for pointers to TO_TYPE and it's
7570 the proper mode, use it. */
7571 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7572 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7575 t
= make_node (POINTER_TYPE
);
7577 TREE_TYPE (t
) = to_type
;
7578 SET_TYPE_MODE (t
, mode
);
7579 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7580 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7581 TYPE_POINTER_TO (to_type
) = t
;
7583 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7584 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7585 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7586 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7588 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7591 /* Lay out the type. This function has many callers that are concerned
7592 with expression-construction, and this simplifies them all. */
7598 /* By default build pointers in ptr_mode. */
7601 build_pointer_type (tree to_type
)
7603 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7604 : TYPE_ADDR_SPACE (to_type
);
7605 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7606 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7609 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7612 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7616 bool could_alias
= can_alias_all
;
7618 if (to_type
== error_mark_node
)
7619 return error_mark_node
;
7621 /* If the pointed-to type has the may_alias attribute set, force
7622 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7623 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7624 can_alias_all
= true;
7626 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7627 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7628 In that case, return that type without regard to the rest of our
7631 ??? This is a kludge, but consistent with the way this function has
7632 always operated and there doesn't seem to be a good way to avoid this
7634 if (TYPE_REFERENCE_TO (to_type
) != 0
7635 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7636 return TYPE_REFERENCE_TO (to_type
);
7638 /* First, if we already have a type for pointers to TO_TYPE and it's
7639 the proper mode, use it. */
7640 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7641 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7644 t
= make_node (REFERENCE_TYPE
);
7646 TREE_TYPE (t
) = to_type
;
7647 SET_TYPE_MODE (t
, mode
);
7648 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7649 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7650 TYPE_REFERENCE_TO (to_type
) = t
;
7652 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7653 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7654 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7655 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7657 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7666 /* Build the node for the type of references-to-TO_TYPE by default
7670 build_reference_type (tree to_type
)
7672 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7673 : TYPE_ADDR_SPACE (to_type
);
7674 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7675 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7678 #define MAX_INT_CACHED_PREC \
7679 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7680 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7682 /* Builds a signed or unsigned integer type of precision PRECISION.
7683 Used for C bitfields whose precision does not match that of
7684 built-in target types. */
7686 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7692 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7694 if (precision
<= MAX_INT_CACHED_PREC
)
7696 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7701 itype
= make_node (INTEGER_TYPE
);
7702 TYPE_PRECISION (itype
) = precision
;
7705 fixup_unsigned_type (itype
);
7707 fixup_signed_type (itype
);
7711 inchash::hash hstate
;
7712 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7713 ret
= type_hash_canon (hstate
.end (), itype
);
7714 if (precision
<= MAX_INT_CACHED_PREC
)
7715 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7720 #define MAX_BOOL_CACHED_PREC \
7721 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7722 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7724 /* Builds a boolean type of precision PRECISION.
7725 Used for boolean vectors to choose proper vector element size. */
7727 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7731 if (precision
<= MAX_BOOL_CACHED_PREC
)
7733 type
= nonstandard_boolean_type_cache
[precision
];
7738 type
= make_node (BOOLEAN_TYPE
);
7739 TYPE_PRECISION (type
) = precision
;
7740 fixup_signed_type (type
);
7742 if (precision
<= MAX_INT_CACHED_PREC
)
7743 nonstandard_boolean_type_cache
[precision
] = type
;
7748 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7749 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7750 is true, reuse such a type that has already been constructed. */
7753 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7755 tree itype
= make_node (INTEGER_TYPE
);
7757 TREE_TYPE (itype
) = type
;
7759 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7760 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7762 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7763 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7764 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7765 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7766 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7767 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7768 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7773 if ((TYPE_MIN_VALUE (itype
)
7774 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7775 || (TYPE_MAX_VALUE (itype
)
7776 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7778 /* Since we cannot reliably merge this type, we need to compare it using
7779 structural equality checks. */
7780 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7784 hashval_t hash
= type_hash_canon_hash (itype
);
7785 itype
= type_hash_canon (hash
, itype
);
7790 /* Wrapper around build_range_type_1 with SHARED set to true. */
7793 build_range_type (tree type
, tree lowval
, tree highval
)
7795 return build_range_type_1 (type
, lowval
, highval
, true);
7798 /* Wrapper around build_range_type_1 with SHARED set to false. */
7801 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7803 return build_range_type_1 (type
, lowval
, highval
, false);
7806 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7807 MAXVAL should be the maximum value in the domain
7808 (one less than the length of the array).
7810 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7811 We don't enforce this limit, that is up to caller (e.g. language front end).
7812 The limit exists because the result is a signed type and we don't handle
7813 sizes that use more than one HOST_WIDE_INT. */
7816 build_index_type (tree maxval
)
7818 return build_range_type (sizetype
, size_zero_node
, maxval
);
7821 /* Return true if the debug information for TYPE, a subtype, should be emitted
7822 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7823 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7824 debug info and doesn't reflect the source code. */
7827 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7829 tree base_type
= TREE_TYPE (type
), low
, high
;
7831 /* Subrange types have a base type which is an integral type. */
7832 if (!INTEGRAL_TYPE_P (base_type
))
7835 /* Get the real bounds of the subtype. */
7836 if (lang_hooks
.types
.get_subrange_bounds
)
7837 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7840 low
= TYPE_MIN_VALUE (type
);
7841 high
= TYPE_MAX_VALUE (type
);
7844 /* If the type and its base type have the same representation and the same
7845 name, then the type is not a subrange but a copy of the base type. */
7846 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7847 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7848 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7849 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7850 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7851 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7861 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7862 and number of elements specified by the range of values of INDEX_TYPE.
7863 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7864 If SHARED is true, reuse such a type that has already been constructed. */
7867 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7872 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7874 error ("arrays of functions are not meaningful");
7875 elt_type
= integer_type_node
;
7878 t
= make_node (ARRAY_TYPE
);
7879 TREE_TYPE (t
) = elt_type
;
7880 TYPE_DOMAIN (t
) = index_type
;
7881 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7882 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7885 /* If the element type is incomplete at this point we get marked for
7886 structural equality. Do not record these types in the canonical
7888 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7893 hashval_t hash
= type_hash_canon_hash (t
);
7894 t
= type_hash_canon (hash
, t
);
7897 if (TYPE_CANONICAL (t
) == t
)
7899 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7900 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7902 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7903 else if (TYPE_CANONICAL (elt_type
) != elt_type
7904 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7906 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7908 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7909 typeless_storage
, shared
);
7915 /* Wrapper around build_array_type_1 with SHARED set to true. */
7918 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7920 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7923 /* Wrapper around build_array_type_1 with SHARED set to false. */
7926 build_nonshared_array_type (tree elt_type
, tree index_type
)
7928 return build_array_type_1 (elt_type
, index_type
, false, false);
7931 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7935 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
7937 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7940 /* Recursively examines the array elements of TYPE, until a non-array
7941 element type is found. */
7944 strip_array_types (tree type
)
7946 while (TREE_CODE (type
) == ARRAY_TYPE
)
7947 type
= TREE_TYPE (type
);
7952 /* Computes the canonical argument types from the argument type list
7955 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7956 on entry to this function, or if any of the ARGTYPES are
7959 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7960 true on entry to this function, or if any of the ARGTYPES are
7963 Returns a canonical argument list, which may be ARGTYPES when the
7964 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7965 true) or would not differ from ARGTYPES. */
7968 maybe_canonicalize_argtypes (tree argtypes
,
7969 bool *any_structural_p
,
7970 bool *any_noncanonical_p
)
7973 bool any_noncanonical_argtypes_p
= false;
7975 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7977 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7978 /* Fail gracefully by stating that the type is structural. */
7979 *any_structural_p
= true;
7980 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7981 *any_structural_p
= true;
7982 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7983 || TREE_PURPOSE (arg
))
7984 /* If the argument has a default argument, we consider it
7985 non-canonical even though the type itself is canonical.
7986 That way, different variants of function and method types
7987 with default arguments will all point to the variant with
7988 no defaults as their canonical type. */
7989 any_noncanonical_argtypes_p
= true;
7992 if (*any_structural_p
)
7995 if (any_noncanonical_argtypes_p
)
7997 /* Build the canonical list of argument types. */
7998 tree canon_argtypes
= NULL_TREE
;
7999 bool is_void
= false;
8001 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8003 if (arg
== void_list_node
)
8006 canon_argtypes
= tree_cons (NULL_TREE
,
8007 TYPE_CANONICAL (TREE_VALUE (arg
)),
8011 canon_argtypes
= nreverse (canon_argtypes
);
8013 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8015 /* There is a non-canonical type. */
8016 *any_noncanonical_p
= true;
8017 return canon_argtypes
;
8020 /* The canonical argument types are the same as ARGTYPES. */
8024 /* Construct, lay out and return
8025 the type of functions returning type VALUE_TYPE
8026 given arguments of types ARG_TYPES.
8027 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8028 are data type nodes for the arguments of the function.
8029 If such a type has already been constructed, reuse it. */
8032 build_function_type (tree value_type
, tree arg_types
)
8035 inchash::hash hstate
;
8036 bool any_structural_p
, any_noncanonical_p
;
8037 tree canon_argtypes
;
8039 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8041 error ("function return type cannot be function");
8042 value_type
= integer_type_node
;
8045 /* Make a node of the sort we want. */
8046 t
= make_node (FUNCTION_TYPE
);
8047 TREE_TYPE (t
) = value_type
;
8048 TYPE_ARG_TYPES (t
) = arg_types
;
8050 /* If we already have such a type, use the old one. */
8051 hashval_t hash
= type_hash_canon_hash (t
);
8052 t
= type_hash_canon (hash
, t
);
8054 /* Set up the canonical type. */
8055 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8056 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8057 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8059 &any_noncanonical_p
);
8060 if (any_structural_p
)
8061 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8062 else if (any_noncanonical_p
)
8063 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8066 if (!COMPLETE_TYPE_P (t
))
8071 /* Build a function type. The RETURN_TYPE is the type returned by the
8072 function. If VAARGS is set, no void_type_node is appended to the
8073 list. ARGP must be always be terminated be a NULL_TREE. */
8076 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8080 t
= va_arg (argp
, tree
);
8081 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8082 args
= tree_cons (NULL_TREE
, t
, args
);
8087 if (args
!= NULL_TREE
)
8088 args
= nreverse (args
);
8089 gcc_assert (last
!= void_list_node
);
8091 else if (args
== NULL_TREE
)
8092 args
= void_list_node
;
8096 args
= nreverse (args
);
8097 TREE_CHAIN (last
) = void_list_node
;
8099 args
= build_function_type (return_type
, args
);
8104 /* Build a function type. The RETURN_TYPE is the type returned by the
8105 function. If additional arguments are provided, they are
8106 additional argument types. The list of argument types must always
8107 be terminated by NULL_TREE. */
8110 build_function_type_list (tree return_type
, ...)
8115 va_start (p
, return_type
);
8116 args
= build_function_type_list_1 (false, return_type
, p
);
8121 /* Build a variable argument function type. The RETURN_TYPE is the
8122 type returned by the function. If additional arguments are provided,
8123 they are additional argument types. The list of argument types must
8124 always be terminated by NULL_TREE. */
8127 build_varargs_function_type_list (tree return_type
, ...)
8132 va_start (p
, return_type
);
8133 args
= build_function_type_list_1 (true, return_type
, p
);
8139 /* Build a function type. RETURN_TYPE is the type returned by the
8140 function; VAARGS indicates whether the function takes varargs. The
8141 function takes N named arguments, the types of which are provided in
8145 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8149 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8151 for (i
= n
- 1; i
>= 0; i
--)
8152 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8154 return build_function_type (return_type
, t
);
8157 /* Build a function type. RETURN_TYPE is the type returned by the
8158 function. The function takes N named arguments, the types of which
8159 are provided in ARG_TYPES. */
8162 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8164 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8167 /* Build a variable argument function type. RETURN_TYPE is the type
8168 returned by the function. The function takes N named arguments, the
8169 types of which are provided in ARG_TYPES. */
8172 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8174 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8177 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8178 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8179 for the method. An implicit additional parameter (of type
8180 pointer-to-BASETYPE) is added to the ARGTYPES. */
8183 build_method_type_directly (tree basetype
,
8189 bool any_structural_p
, any_noncanonical_p
;
8190 tree canon_argtypes
;
8192 /* Make a node of the sort we want. */
8193 t
= make_node (METHOD_TYPE
);
8195 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8196 TREE_TYPE (t
) = rettype
;
8197 ptype
= build_pointer_type (basetype
);
8199 /* The actual arglist for this function includes a "hidden" argument
8200 which is "this". Put it into the list of argument types. */
8201 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8202 TYPE_ARG_TYPES (t
) = argtypes
;
8204 /* If we already have such a type, use the old one. */
8205 hashval_t hash
= type_hash_canon_hash (t
);
8206 t
= type_hash_canon (hash
, t
);
8208 /* Set up the canonical type. */
8210 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8211 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8213 = (TYPE_CANONICAL (basetype
) != basetype
8214 || TYPE_CANONICAL (rettype
) != rettype
);
8215 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8217 &any_noncanonical_p
);
8218 if (any_structural_p
)
8219 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8220 else if (any_noncanonical_p
)
8222 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8223 TYPE_CANONICAL (rettype
),
8225 if (!COMPLETE_TYPE_P (t
))
8231 /* Construct, lay out and return the type of methods belonging to class
8232 BASETYPE and whose arguments and values are described by TYPE.
8233 If that type exists already, reuse it.
8234 TYPE must be a FUNCTION_TYPE node. */
8237 build_method_type (tree basetype
, tree type
)
8239 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8241 return build_method_type_directly (basetype
,
8243 TYPE_ARG_TYPES (type
));
8246 /* Construct, lay out and return the type of offsets to a value
8247 of type TYPE, within an object of type BASETYPE.
8248 If a suitable offset type exists already, reuse it. */
8251 build_offset_type (tree basetype
, tree type
)
8255 /* Make a node of the sort we want. */
8256 t
= make_node (OFFSET_TYPE
);
8258 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8259 TREE_TYPE (t
) = type
;
8261 /* If we already have such a type, use the old one. */
8262 hashval_t hash
= type_hash_canon_hash (t
);
8263 t
= type_hash_canon (hash
, t
);
8265 if (!COMPLETE_TYPE_P (t
))
8268 if (TYPE_CANONICAL (t
) == t
)
8270 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8271 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8272 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8273 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8274 || TYPE_CANONICAL (type
) != type
)
8276 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8277 TYPE_CANONICAL (type
));
8283 /* Create a complex type whose components are COMPONENT_TYPE.
8285 If NAMED is true, the type is given a TYPE_NAME. We do not always
8286 do so because this creates a DECL node and thus make the DECL_UIDs
8287 dependent on the type canonicalization hashtable, which is GC-ed,
8288 so the DECL_UIDs would not be stable wrt garbage collection. */
8291 build_complex_type (tree component_type
, bool named
)
8293 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8294 || SCALAR_FLOAT_TYPE_P (component_type
)
8295 || FIXED_POINT_TYPE_P (component_type
));
8297 /* Make a node of the sort we want. */
8298 tree probe
= make_node (COMPLEX_TYPE
);
8300 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8302 /* If we already have such a type, use the old one. */
8303 hashval_t hash
= type_hash_canon_hash (probe
);
8304 tree t
= type_hash_canon (hash
, probe
);
8308 /* We created a new type. The hash insertion will have laid
8309 out the type. We need to check the canonicalization and
8310 maybe set the name. */
8311 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8313 && TYPE_CANONICAL (t
) == t
);
8315 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8316 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8317 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8319 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8321 /* We need to create a name, since complex is a fundamental type. */
8324 const char *name
= NULL
;
8326 if (TREE_TYPE (t
) == char_type_node
)
8327 name
= "complex char";
8328 else if (TREE_TYPE (t
) == signed_char_type_node
)
8329 name
= "complex signed char";
8330 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8331 name
= "complex unsigned char";
8332 else if (TREE_TYPE (t
) == short_integer_type_node
)
8333 name
= "complex short int";
8334 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8335 name
= "complex short unsigned int";
8336 else if (TREE_TYPE (t
) == integer_type_node
)
8337 name
= "complex int";
8338 else if (TREE_TYPE (t
) == unsigned_type_node
)
8339 name
= "complex unsigned int";
8340 else if (TREE_TYPE (t
) == long_integer_type_node
)
8341 name
= "complex long int";
8342 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8343 name
= "complex long unsigned int";
8344 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8345 name
= "complex long long int";
8346 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8347 name
= "complex long long unsigned int";
8350 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8351 get_identifier (name
), t
);
8355 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8358 /* If TYPE is a real or complex floating-point type and the target
8359 does not directly support arithmetic on TYPE then return the wider
8360 type to be used for arithmetic on TYPE. Otherwise, return
8364 excess_precision_type (tree type
)
8366 /* The target can give two different responses to the question of
8367 which excess precision mode it would like depending on whether we
8368 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8370 enum excess_precision_type requested_type
8371 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8372 ? EXCESS_PRECISION_TYPE_FAST
8373 : EXCESS_PRECISION_TYPE_STANDARD
);
8375 enum flt_eval_method target_flt_eval_method
8376 = targetm
.c
.excess_precision (requested_type
);
8378 /* The target should not ask for unpredictable float evaluation (though
8379 it might advertise that implicitly the evaluation is unpredictable,
8380 but we don't care about that here, it will have been reported
8381 elsewhere). If it does ask for unpredictable evaluation, we have
8382 nothing to do here. */
8383 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8385 /* Nothing to do. The target has asked for all types we know about
8386 to be computed with their native precision and range. */
8387 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8390 /* The target will promote this type in a target-dependent way, so excess
8391 precision ought to leave it alone. */
8392 if (targetm
.promoted_type (type
) != NULL_TREE
)
8395 machine_mode float16_type_mode
= (float16_type_node
8396 ? TYPE_MODE (float16_type_node
)
8398 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8399 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8401 switch (TREE_CODE (type
))
8405 machine_mode type_mode
= TYPE_MODE (type
);
8406 switch (target_flt_eval_method
)
8408 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8409 if (type_mode
== float16_type_mode
)
8410 return float_type_node
;
8412 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8413 if (type_mode
== float16_type_mode
8414 || type_mode
== float_type_mode
)
8415 return double_type_node
;
8417 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8418 if (type_mode
== float16_type_mode
8419 || type_mode
== float_type_mode
8420 || type_mode
== double_type_mode
)
8421 return long_double_type_node
;
8430 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8432 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8433 switch (target_flt_eval_method
)
8435 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8436 if (type_mode
== float16_type_mode
)
8437 return complex_float_type_node
;
8439 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8440 if (type_mode
== float16_type_mode
8441 || type_mode
== float_type_mode
)
8442 return complex_double_type_node
;
8444 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8445 if (type_mode
== float16_type_mode
8446 || type_mode
== float_type_mode
8447 || type_mode
== double_type_mode
)
8448 return complex_long_double_type_node
;
8462 /* Return OP, stripped of any conversions to wider types as much as is safe.
8463 Converting the value back to OP's type makes a value equivalent to OP.
8465 If FOR_TYPE is nonzero, we return a value which, if converted to
8466 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8468 OP must have integer, real or enumeral type. Pointers are not allowed!
8470 There are some cases where the obvious value we could return
8471 would regenerate to OP if converted to OP's type,
8472 but would not extend like OP to wider types.
8473 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8474 For example, if OP is (unsigned short)(signed char)-1,
8475 we avoid returning (signed char)-1 if FOR_TYPE is int,
8476 even though extending that to an unsigned short would regenerate OP,
8477 since the result of extending (signed char)-1 to (int)
8478 is different from (int) OP. */
8481 get_unwidened (tree op
, tree for_type
)
8483 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8484 tree type
= TREE_TYPE (op
);
8486 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8488 = (for_type
!= 0 && for_type
!= type
8489 && final_prec
> TYPE_PRECISION (type
)
8490 && TYPE_UNSIGNED (type
));
8493 while (CONVERT_EXPR_P (op
))
8497 /* TYPE_PRECISION on vector types has different meaning
8498 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8499 so avoid them here. */
8500 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8503 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8504 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8506 /* Truncations are many-one so cannot be removed.
8507 Unless we are later going to truncate down even farther. */
8509 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8512 /* See what's inside this conversion. If we decide to strip it,
8514 op
= TREE_OPERAND (op
, 0);
8516 /* If we have not stripped any zero-extensions (uns is 0),
8517 we can strip any kind of extension.
8518 If we have previously stripped a zero-extension,
8519 only zero-extensions can safely be stripped.
8520 Any extension can be stripped if the bits it would produce
8521 are all going to be discarded later by truncating to FOR_TYPE. */
8525 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8527 /* TYPE_UNSIGNED says whether this is a zero-extension.
8528 Let's avoid computing it if it does not affect WIN
8529 and if UNS will not be needed again. */
8531 || CONVERT_EXPR_P (op
))
8532 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8540 /* If we finally reach a constant see if it fits in sth smaller and
8541 in that case convert it. */
8542 if (TREE_CODE (win
) == INTEGER_CST
)
8544 tree wtype
= TREE_TYPE (win
);
8545 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8547 prec
= MAX (prec
, final_prec
);
8548 if (prec
< TYPE_PRECISION (wtype
))
8550 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8551 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8552 win
= fold_convert (t
, win
);
8559 /* Return OP or a simpler expression for a narrower value
8560 which can be sign-extended or zero-extended to give back OP.
8561 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8562 or 0 if the value should be sign-extended. */
8565 get_narrower (tree op
, int *unsignedp_ptr
)
8570 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8572 while (TREE_CODE (op
) == NOP_EXPR
)
8575 = (TYPE_PRECISION (TREE_TYPE (op
))
8576 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8578 /* Truncations are many-one so cannot be removed. */
8582 /* See what's inside this conversion. If we decide to strip it,
8587 op
= TREE_OPERAND (op
, 0);
8588 /* An extension: the outermost one can be stripped,
8589 but remember whether it is zero or sign extension. */
8591 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8592 /* Otherwise, if a sign extension has been stripped,
8593 only sign extensions can now be stripped;
8594 if a zero extension has been stripped, only zero-extensions. */
8595 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8599 else /* bitschange == 0 */
8601 /* A change in nominal type can always be stripped, but we must
8602 preserve the unsignedness. */
8604 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8606 op
= TREE_OPERAND (op
, 0);
8607 /* Keep trying to narrow, but don't assign op to win if it
8608 would turn an integral type into something else. */
8609 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8616 if (TREE_CODE (op
) == COMPONENT_REF
8617 /* Since type_for_size always gives an integer type. */
8618 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8619 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8620 /* Ensure field is laid out already. */
8621 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8622 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8624 unsigned HOST_WIDE_INT innerprec
8625 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8626 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8627 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8628 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8630 /* We can get this structure field in a narrower type that fits it,
8631 but the resulting extension to its nominal type (a fullword type)
8632 must satisfy the same conditions as for other extensions.
8634 Do this only for fields that are aligned (not bit-fields),
8635 because when bit-field insns will be used there is no
8636 advantage in doing this. */
8638 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8639 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8640 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8644 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8645 win
= fold_convert (type
, op
);
8649 *unsignedp_ptr
= uns
;
8653 /* Return true if integer constant C has a value that is permissible
8654 for TYPE, an integral type. */
8657 int_fits_type_p (const_tree c
, const_tree type
)
8659 tree type_low_bound
, type_high_bound
;
8660 bool ok_for_low_bound
, ok_for_high_bound
;
8661 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8663 /* Non-standard boolean types can have arbitrary precision but various
8664 transformations assume that they can only take values 0 and +/-1. */
8665 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8666 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8669 type_low_bound
= TYPE_MIN_VALUE (type
);
8670 type_high_bound
= TYPE_MAX_VALUE (type
);
8672 /* If at least one bound of the type is a constant integer, we can check
8673 ourselves and maybe make a decision. If no such decision is possible, but
8674 this type is a subtype, try checking against that. Otherwise, use
8675 fits_to_tree_p, which checks against the precision.
8677 Compute the status for each possibly constant bound, and return if we see
8678 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8679 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8680 for "constant known to fit". */
8682 /* Check if c >= type_low_bound. */
8683 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8685 if (tree_int_cst_lt (c
, type_low_bound
))
8687 ok_for_low_bound
= true;
8690 ok_for_low_bound
= false;
8692 /* Check if c <= type_high_bound. */
8693 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8695 if (tree_int_cst_lt (type_high_bound
, c
))
8697 ok_for_high_bound
= true;
8700 ok_for_high_bound
= false;
8702 /* If the constant fits both bounds, the result is known. */
8703 if (ok_for_low_bound
&& ok_for_high_bound
)
8706 /* Perform some generic filtering which may allow making a decision
8707 even if the bounds are not constant. First, negative integers
8708 never fit in unsigned types, */
8709 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8712 /* Second, narrower types always fit in wider ones. */
8713 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8716 /* Third, unsigned integers with top bit set never fit signed types. */
8717 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8719 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8720 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8722 /* When a tree_cst is converted to a wide-int, the precision
8723 is taken from the type. However, if the precision of the
8724 mode underneath the type is smaller than that, it is
8725 possible that the value will not fit. The test below
8726 fails if any bit is set between the sign bit of the
8727 underlying mode and the top bit of the type. */
8728 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8731 else if (wi::neg_p (wi::to_wide (c
)))
8735 /* If we haven't been able to decide at this point, there nothing more we
8736 can check ourselves here. Look at the base type if we have one and it
8737 has the same precision. */
8738 if (TREE_CODE (type
) == INTEGER_TYPE
8739 && TREE_TYPE (type
) != 0
8740 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8742 type
= TREE_TYPE (type
);
8746 /* Or to fits_to_tree_p, if nothing else. */
8747 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8750 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8751 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8752 represented (assuming two's-complement arithmetic) within the bit
8753 precision of the type are returned instead. */
8756 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8758 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8759 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8760 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8763 if (TYPE_UNSIGNED (type
))
8764 mpz_set_ui (min
, 0);
8767 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8768 wi::to_mpz (mn
, min
, SIGNED
);
8772 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8773 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8774 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8777 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8778 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8782 /* Return true if VAR is an automatic variable defined in function FN. */
8785 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8787 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8788 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8789 || TREE_CODE (var
) == PARM_DECL
)
8790 && ! TREE_STATIC (var
))
8791 || TREE_CODE (var
) == LABEL_DECL
8792 || TREE_CODE (var
) == RESULT_DECL
));
8795 /* Subprogram of following function. Called by walk_tree.
8797 Return *TP if it is an automatic variable or parameter of the
8798 function passed in as DATA. */
8801 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8803 tree fn
= (tree
) data
;
8808 else if (DECL_P (*tp
)
8809 && auto_var_in_fn_p (*tp
, fn
))
8815 /* Returns true if T is, contains, or refers to a type with variable
8816 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8817 arguments, but not the return type. If FN is nonzero, only return
8818 true if a modifier of the type or position of FN is a variable or
8819 parameter inside FN.
8821 This concept is more general than that of C99 'variably modified types':
8822 in C99, a struct type is never variably modified because a VLA may not
8823 appear as a structure member. However, in GNU C code like:
8825 struct S { int i[f()]; };
8827 is valid, and other languages may define similar constructs. */
8830 variably_modified_type_p (tree type
, tree fn
)
8834 /* Test if T is either variable (if FN is zero) or an expression containing
8835 a variable in FN. If TYPE isn't gimplified, return true also if
8836 gimplify_one_sizepos would gimplify the expression into a local
8838 #define RETURN_TRUE_IF_VAR(T) \
8839 do { tree _t = (T); \
8840 if (_t != NULL_TREE \
8841 && _t != error_mark_node \
8842 && TREE_CODE (_t) != INTEGER_CST \
8843 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8845 || (!TYPE_SIZES_GIMPLIFIED (type) \
8846 && !is_gimple_sizepos (_t)) \
8847 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8848 return true; } while (0)
8850 if (type
== error_mark_node
)
8853 /* If TYPE itself has variable size, it is variably modified. */
8854 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8855 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8857 switch (TREE_CODE (type
))
8860 case REFERENCE_TYPE
:
8862 /* Ada can have pointer types refering to themselves indirectly. */
8863 if (TREE_VISITED (type
))
8865 TREE_VISITED (type
) = true;
8866 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8868 TREE_VISITED (type
) = false;
8871 TREE_VISITED (type
) = false;
8876 /* If TYPE is a function type, it is variably modified if the
8877 return type is variably modified. */
8878 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8884 case FIXED_POINT_TYPE
:
8887 /* Scalar types are variably modified if their end points
8889 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8890 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8895 case QUAL_UNION_TYPE
:
8896 /* We can't see if any of the fields are variably-modified by the
8897 definition we normally use, since that would produce infinite
8898 recursion via pointers. */
8899 /* This is variably modified if some field's type is. */
8900 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8901 if (TREE_CODE (t
) == FIELD_DECL
)
8903 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8904 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8905 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8907 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8908 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8913 /* Do not call ourselves to avoid infinite recursion. This is
8914 variably modified if the element type is. */
8915 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8916 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8923 /* The current language may have other cases to check, but in general,
8924 all other types are not variably modified. */
8925 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8927 #undef RETURN_TRUE_IF_VAR
8930 /* Given a DECL or TYPE, return the scope in which it was declared, or
8931 NULL_TREE if there is no containing scope. */
8934 get_containing_scope (const_tree t
)
8936 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8939 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8942 get_ultimate_context (const_tree decl
)
8944 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8946 if (TREE_CODE (decl
) == BLOCK
)
8947 decl
= BLOCK_SUPERCONTEXT (decl
);
8949 decl
= get_containing_scope (decl
);
8954 /* Return the innermost context enclosing DECL that is
8955 a FUNCTION_DECL, or zero if none. */
8958 decl_function_context (const_tree decl
)
8962 if (TREE_CODE (decl
) == ERROR_MARK
)
8965 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8966 where we look up the function at runtime. Such functions always take
8967 a first argument of type 'pointer to real context'.
8969 C++ should really be fixed to use DECL_CONTEXT for the real context,
8970 and use something else for the "virtual context". */
8971 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8974 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8976 context
= DECL_CONTEXT (decl
);
8978 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8980 if (TREE_CODE (context
) == BLOCK
)
8981 context
= BLOCK_SUPERCONTEXT (context
);
8983 context
= get_containing_scope (context
);
8989 /* Return the innermost context enclosing DECL that is
8990 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8991 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8994 decl_type_context (const_tree decl
)
8996 tree context
= DECL_CONTEXT (decl
);
8999 switch (TREE_CODE (context
))
9001 case NAMESPACE_DECL
:
9002 case TRANSLATION_UNIT_DECL
:
9007 case QUAL_UNION_TYPE
:
9012 context
= DECL_CONTEXT (context
);
9016 context
= BLOCK_SUPERCONTEXT (context
);
9026 /* CALL is a CALL_EXPR. Return the declaration for the function
9027 called, or NULL_TREE if the called function cannot be
9031 get_callee_fndecl (const_tree call
)
9035 if (call
== error_mark_node
)
9036 return error_mark_node
;
9038 /* It's invalid to call this function with anything but a
9040 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9042 /* The first operand to the CALL is the address of the function
9044 addr
= CALL_EXPR_FN (call
);
9046 /* If there is no function, return early. */
9047 if (addr
== NULL_TREE
)
9052 /* If this is a readonly function pointer, extract its initial value. */
9053 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9054 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9055 && DECL_INITIAL (addr
))
9056 addr
= DECL_INITIAL (addr
);
9058 /* If the address is just `&f' for some function `f', then we know
9059 that `f' is being called. */
9060 if (TREE_CODE (addr
) == ADDR_EXPR
9061 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9062 return TREE_OPERAND (addr
, 0);
9064 /* We couldn't figure out what was being called. */
9068 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9069 return the associated function code, otherwise return CFN_LAST. */
9072 get_call_combined_fn (const_tree call
)
9074 /* It's invalid to call this function with anything but a CALL_EXPR. */
9075 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9077 if (!CALL_EXPR_FN (call
))
9078 return as_combined_fn (CALL_EXPR_IFN (call
));
9080 tree fndecl
= get_callee_fndecl (call
);
9081 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9082 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9087 #define TREE_MEM_USAGE_SPACES 40
9089 /* Print debugging information about tree nodes generated during the compile,
9090 and any language-specific information. */
9093 dump_tree_statistics (void)
9095 if (GATHER_STATISTICS
)
9098 int total_nodes
, total_bytes
;
9099 fprintf (stderr
, "\nKind Nodes Bytes\n");
9100 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9101 total_nodes
= total_bytes
= 0;
9102 for (i
= 0; i
< (int) all_kinds
; i
++)
9104 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9105 tree_node_counts
[i
], tree_node_sizes
[i
]);
9106 total_nodes
+= tree_node_counts
[i
];
9107 total_bytes
+= tree_node_sizes
[i
];
9109 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9110 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9111 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9112 fprintf (stderr
, "Code Nodes\n");
9113 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9114 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9115 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9116 tree_code_counts
[i
]);
9117 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9118 fprintf (stderr
, "\n");
9119 ssanames_print_statistics ();
9120 fprintf (stderr
, "\n");
9121 phinodes_print_statistics ();
9122 fprintf (stderr
, "\n");
9125 fprintf (stderr
, "(No per-node statistics)\n");
9127 print_type_hash_statistics ();
9128 print_debug_expr_statistics ();
9129 print_value_expr_statistics ();
9130 lang_hooks
.print_statistics ();
9133 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9135 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9138 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9140 /* This relies on the raw feedback's top 4 bits being zero. */
9141 #define FEEDBACK(X) ((X) * 0x04c11db7)
9142 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9143 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9144 static const unsigned syndromes
[16] =
9146 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9147 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9148 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9149 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9154 value
<<= (32 - bytes
* 8);
9155 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9157 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9159 chksum
= (chksum
<< 4) ^ feedback
;
9165 /* Generate a crc32 of a string. */
9168 crc32_string (unsigned chksum
, const char *string
)
9171 chksum
= crc32_byte (chksum
, *string
);
9176 /* P is a string that will be used in a symbol. Mask out any characters
9177 that are not valid in that context. */
9180 clean_symbol_name (char *p
)
9184 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9187 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9194 /* For anonymous aggregate types, we need some sort of name to
9195 hold on to. In practice, this should not appear, but it should
9196 not be harmful if it does. */
9198 anon_aggrname_p(const_tree id_node
)
9200 #ifndef NO_DOT_IN_LABEL
9201 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9202 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9203 #else /* NO_DOT_IN_LABEL */
9204 #ifndef NO_DOLLAR_IN_LABEL
9205 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9206 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9207 #else /* NO_DOLLAR_IN_LABEL */
9208 #define ANON_AGGRNAME_PREFIX "__anon_"
9209 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9210 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9211 #endif /* NO_DOLLAR_IN_LABEL */
9212 #endif /* NO_DOT_IN_LABEL */
9215 /* Return a format for an anonymous aggregate name. */
9217 anon_aggrname_format()
9219 #ifndef NO_DOT_IN_LABEL
9221 #else /* NO_DOT_IN_LABEL */
9222 #ifndef NO_DOLLAR_IN_LABEL
9224 #else /* NO_DOLLAR_IN_LABEL */
9226 #endif /* NO_DOLLAR_IN_LABEL */
9227 #endif /* NO_DOT_IN_LABEL */
9230 /* Generate a name for a special-purpose function.
9231 The generated name may need to be unique across the whole link.
9232 Changes to this function may also require corresponding changes to
9233 xstrdup_mask_random.
9234 TYPE is some string to identify the purpose of this function to the
9235 linker or collect2; it must start with an uppercase letter,
9237 I - for constructors
9239 N - for C++ anonymous namespaces
9240 F - for DWARF unwind frame information. */
9243 get_file_function_name (const char *type
)
9249 /* If we already have a name we know to be unique, just use that. */
9250 if (first_global_object_name
)
9251 p
= q
= ASTRDUP (first_global_object_name
);
9252 /* If the target is handling the constructors/destructors, they
9253 will be local to this file and the name is only necessary for
9255 We also assign sub_I and sub_D sufixes to constructors called from
9256 the global static constructors. These are always local. */
9257 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9258 || (strncmp (type
, "sub_", 4) == 0
9259 && (type
[4] == 'I' || type
[4] == 'D')))
9261 const char *file
= main_input_filename
;
9263 file
= LOCATION_FILE (input_location
);
9264 /* Just use the file's basename, because the full pathname
9265 might be quite long. */
9266 p
= q
= ASTRDUP (lbasename (file
));
9270 /* Otherwise, the name must be unique across the entire link.
9271 We don't have anything that we know to be unique to this translation
9272 unit, so use what we do have and throw in some randomness. */
9274 const char *name
= weak_global_object_name
;
9275 const char *file
= main_input_filename
;
9280 file
= LOCATION_FILE (input_location
);
9282 len
= strlen (file
);
9283 q
= (char *) alloca (9 + 19 + len
+ 1);
9284 memcpy (q
, file
, len
+ 1);
9286 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9287 crc32_string (0, name
), get_random_seed (false));
9292 clean_symbol_name (q
);
9293 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9296 /* Set up the name of the file-level functions we may need.
9297 Use a global object (which is already required to be unique over
9298 the program) rather than the file name (which imposes extra
9300 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9302 return get_identifier (buf
);
9305 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9307 /* Complain that the tree code of NODE does not match the expected 0
9308 terminated list of trailing codes. The trailing code list can be
9309 empty, for a more vague error message. FILE, LINE, and FUNCTION
9310 are of the caller. */
9313 tree_check_failed (const_tree node
, const char *file
,
9314 int line
, const char *function
, ...)
9318 unsigned length
= 0;
9319 enum tree_code code
;
9321 va_start (args
, function
);
9322 while ((code
= (enum tree_code
) va_arg (args
, int)))
9323 length
+= 4 + strlen (get_tree_code_name (code
));
9328 va_start (args
, function
);
9329 length
+= strlen ("expected ");
9330 buffer
= tmp
= (char *) alloca (length
);
9332 while ((code
= (enum tree_code
) va_arg (args
, int)))
9334 const char *prefix
= length
? " or " : "expected ";
9336 strcpy (tmp
+ length
, prefix
);
9337 length
+= strlen (prefix
);
9338 strcpy (tmp
+ length
, get_tree_code_name (code
));
9339 length
+= strlen (get_tree_code_name (code
));
9344 buffer
= "unexpected node";
9346 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9347 buffer
, get_tree_code_name (TREE_CODE (node
)),
9348 function
, trim_filename (file
), line
);
9351 /* Complain that the tree code of NODE does match the expected 0
9352 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9356 tree_not_check_failed (const_tree node
, const char *file
,
9357 int line
, const char *function
, ...)
9361 unsigned length
= 0;
9362 enum tree_code code
;
9364 va_start (args
, function
);
9365 while ((code
= (enum tree_code
) va_arg (args
, int)))
9366 length
+= 4 + strlen (get_tree_code_name (code
));
9368 va_start (args
, function
);
9369 buffer
= (char *) alloca (length
);
9371 while ((code
= (enum tree_code
) va_arg (args
, int)))
9375 strcpy (buffer
+ length
, " or ");
9378 strcpy (buffer
+ length
, get_tree_code_name (code
));
9379 length
+= strlen (get_tree_code_name (code
));
9383 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9384 buffer
, get_tree_code_name (TREE_CODE (node
)),
9385 function
, trim_filename (file
), line
);
9388 /* Similar to tree_check_failed, except that we check for a class of tree
9389 code, given in CL. */
9392 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9393 const char *file
, int line
, const char *function
)
9396 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9397 TREE_CODE_CLASS_STRING (cl
),
9398 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9399 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9402 /* Similar to tree_check_failed, except that instead of specifying a
9403 dozen codes, use the knowledge that they're all sequential. */
9406 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9407 const char *function
, enum tree_code c1
,
9411 unsigned length
= 0;
9414 for (c
= c1
; c
<= c2
; ++c
)
9415 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9417 length
+= strlen ("expected ");
9418 buffer
= (char *) alloca (length
);
9421 for (c
= c1
; c
<= c2
; ++c
)
9423 const char *prefix
= length
? " or " : "expected ";
9425 strcpy (buffer
+ length
, prefix
);
9426 length
+= strlen (prefix
);
9427 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9428 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9431 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9432 buffer
, get_tree_code_name (TREE_CODE (node
)),
9433 function
, trim_filename (file
), line
);
9437 /* Similar to tree_check_failed, except that we check that a tree does
9438 not have the specified code, given in CL. */
9441 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9442 const char *file
, int line
, const char *function
)
9445 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9446 TREE_CODE_CLASS_STRING (cl
),
9447 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9448 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9452 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9455 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9456 const char *function
, enum omp_clause_code code
)
9458 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9459 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9460 function
, trim_filename (file
), line
);
9464 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9467 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9468 const char *function
, enum omp_clause_code c1
,
9469 enum omp_clause_code c2
)
9472 unsigned length
= 0;
9475 for (c
= c1
; c
<= c2
; ++c
)
9476 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9478 length
+= strlen ("expected ");
9479 buffer
= (char *) alloca (length
);
9482 for (c
= c1
; c
<= c2
; ++c
)
9484 const char *prefix
= length
? " or " : "expected ";
9486 strcpy (buffer
+ length
, prefix
);
9487 length
+= strlen (prefix
);
9488 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9489 length
+= strlen (omp_clause_code_name
[c
]);
9492 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9493 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9494 function
, trim_filename (file
), line
);
9498 #undef DEFTREESTRUCT
9499 #define DEFTREESTRUCT(VAL, NAME) NAME,
9501 static const char *ts_enum_names
[] = {
9502 #include "treestruct.def"
9504 #undef DEFTREESTRUCT
9506 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9508 /* Similar to tree_class_check_failed, except that we check for
9509 whether CODE contains the tree structure identified by EN. */
9512 tree_contains_struct_check_failed (const_tree node
,
9513 const enum tree_node_structure_enum en
,
9514 const char *file
, int line
,
9515 const char *function
)
9518 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9520 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9524 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9525 (dynamically sized) vector. */
9528 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9529 const char *function
)
9532 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9533 idx
+ 1, len
, function
, trim_filename (file
), line
);
9536 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9537 (dynamically sized) vector. */
9540 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9541 const char *function
)
9544 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9545 idx
+ 1, len
, function
, trim_filename (file
), line
);
9548 /* Similar to above, except that the check is for the bounds of the operand
9549 vector of an expression node EXP. */
9552 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9553 int line
, const char *function
)
9555 enum tree_code code
= TREE_CODE (exp
);
9557 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9558 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9559 function
, trim_filename (file
), line
);
9562 /* Similar to above, except that the check is for the number of
9563 operands of an OMP_CLAUSE node. */
9566 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9567 int line
, const char *function
)
9570 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9571 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9572 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9573 trim_filename (file
), line
);
9575 #endif /* ENABLE_TREE_CHECKING */
9577 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9578 and mapped to the machine mode MODE. Initialize its fields and build
9579 the information necessary for debugging output. */
9582 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9585 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9587 t
= make_node (VECTOR_TYPE
);
9588 TREE_TYPE (t
) = mv_innertype
;
9589 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9590 SET_TYPE_MODE (t
, mode
);
9592 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9593 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9594 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9595 || mode
!= VOIDmode
)
9596 && !VECTOR_BOOLEAN_TYPE_P (t
))
9598 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9602 hashval_t hash
= type_hash_canon_hash (t
);
9603 t
= type_hash_canon (hash
, t
);
9605 /* We have built a main variant, based on the main variant of the
9606 inner type. Use it to build the variant we return. */
9607 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9608 && TREE_TYPE (t
) != innertype
)
9609 return build_type_attribute_qual_variant (t
,
9610 TYPE_ATTRIBUTES (innertype
),
9611 TYPE_QUALS (innertype
));
9617 make_or_reuse_type (unsigned size
, int unsignedp
)
9621 if (size
== INT_TYPE_SIZE
)
9622 return unsignedp
? unsigned_type_node
: integer_type_node
;
9623 if (size
== CHAR_TYPE_SIZE
)
9624 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9625 if (size
== SHORT_TYPE_SIZE
)
9626 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9627 if (size
== LONG_TYPE_SIZE
)
9628 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9629 if (size
== LONG_LONG_TYPE_SIZE
)
9630 return (unsignedp
? long_long_unsigned_type_node
9631 : long_long_integer_type_node
);
9633 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9634 if (size
== int_n_data
[i
].bitsize
9635 && int_n_enabled_p
[i
])
9636 return (unsignedp
? int_n_trees
[i
].unsigned_type
9637 : int_n_trees
[i
].signed_type
);
9640 return make_unsigned_type (size
);
9642 return make_signed_type (size
);
9645 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9648 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9652 if (size
== SHORT_FRACT_TYPE_SIZE
)
9653 return unsignedp
? sat_unsigned_short_fract_type_node
9654 : sat_short_fract_type_node
;
9655 if (size
== FRACT_TYPE_SIZE
)
9656 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9657 if (size
== LONG_FRACT_TYPE_SIZE
)
9658 return unsignedp
? sat_unsigned_long_fract_type_node
9659 : sat_long_fract_type_node
;
9660 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9661 return unsignedp
? sat_unsigned_long_long_fract_type_node
9662 : sat_long_long_fract_type_node
;
9666 if (size
== SHORT_FRACT_TYPE_SIZE
)
9667 return unsignedp
? unsigned_short_fract_type_node
9668 : short_fract_type_node
;
9669 if (size
== FRACT_TYPE_SIZE
)
9670 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9671 if (size
== LONG_FRACT_TYPE_SIZE
)
9672 return unsignedp
? unsigned_long_fract_type_node
9673 : long_fract_type_node
;
9674 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9675 return unsignedp
? unsigned_long_long_fract_type_node
9676 : long_long_fract_type_node
;
9679 return make_fract_type (size
, unsignedp
, satp
);
9682 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9685 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9689 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9690 return unsignedp
? sat_unsigned_short_accum_type_node
9691 : sat_short_accum_type_node
;
9692 if (size
== ACCUM_TYPE_SIZE
)
9693 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9694 if (size
== LONG_ACCUM_TYPE_SIZE
)
9695 return unsignedp
? sat_unsigned_long_accum_type_node
9696 : sat_long_accum_type_node
;
9697 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9698 return unsignedp
? sat_unsigned_long_long_accum_type_node
9699 : sat_long_long_accum_type_node
;
9703 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9704 return unsignedp
? unsigned_short_accum_type_node
9705 : short_accum_type_node
;
9706 if (size
== ACCUM_TYPE_SIZE
)
9707 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9708 if (size
== LONG_ACCUM_TYPE_SIZE
)
9709 return unsignedp
? unsigned_long_accum_type_node
9710 : long_accum_type_node
;
9711 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9712 return unsignedp
? unsigned_long_long_accum_type_node
9713 : long_long_accum_type_node
;
9716 return make_accum_type (size
, unsignedp
, satp
);
9720 /* Create an atomic variant node for TYPE. This routine is called
9721 during initialization of data types to create the 5 basic atomic
9722 types. The generic build_variant_type function requires these to
9723 already be set up in order to function properly, so cannot be
9724 called from there. If ALIGN is non-zero, then ensure alignment is
9725 overridden to this value. */
9728 build_atomic_base (tree type
, unsigned int align
)
9732 /* Make sure its not already registered. */
9733 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9736 t
= build_variant_type_copy (type
);
9737 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9740 SET_TYPE_ALIGN (t
, align
);
9745 /* Information about the _FloatN and _FloatNx types. This must be in
9746 the same order as the corresponding TI_* enum values. */
9747 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9759 /* Create nodes for all integer types (and error_mark_node) using the sizes
9760 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9763 build_common_tree_nodes (bool signed_char
)
9767 error_mark_node
= make_node (ERROR_MARK
);
9768 TREE_TYPE (error_mark_node
) = error_mark_node
;
9770 initialize_sizetypes ();
9772 /* Define both `signed char' and `unsigned char'. */
9773 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9774 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9775 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9776 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9778 /* Define `char', which is like either `signed char' or `unsigned char'
9779 but not the same as either. */
9782 ? make_signed_type (CHAR_TYPE_SIZE
)
9783 : make_unsigned_type (CHAR_TYPE_SIZE
));
9784 TYPE_STRING_FLAG (char_type_node
) = 1;
9786 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9787 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9788 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9789 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9790 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9791 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9792 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9793 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9795 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9797 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9798 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9799 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9800 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9802 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9803 && int_n_enabled_p
[i
])
9805 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9806 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9810 /* Define a boolean type. This type only represents boolean values but
9811 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9812 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9813 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9814 TYPE_PRECISION (boolean_type_node
) = 1;
9815 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9817 /* Define what type to use for size_t. */
9818 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9819 size_type_node
= unsigned_type_node
;
9820 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9821 size_type_node
= long_unsigned_type_node
;
9822 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9823 size_type_node
= long_long_unsigned_type_node
;
9824 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9825 size_type_node
= short_unsigned_type_node
;
9830 size_type_node
= NULL_TREE
;
9831 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9832 if (int_n_enabled_p
[i
])
9835 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9837 if (strcmp (name
, SIZE_TYPE
) == 0)
9839 size_type_node
= int_n_trees
[i
].unsigned_type
;
9842 if (size_type_node
== NULL_TREE
)
9846 /* Define what type to use for ptrdiff_t. */
9847 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9848 ptrdiff_type_node
= integer_type_node
;
9849 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9850 ptrdiff_type_node
= long_integer_type_node
;
9851 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9852 ptrdiff_type_node
= long_long_integer_type_node
;
9853 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9854 ptrdiff_type_node
= short_integer_type_node
;
9857 ptrdiff_type_node
= NULL_TREE
;
9858 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9859 if (int_n_enabled_p
[i
])
9862 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9863 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9864 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9866 if (ptrdiff_type_node
== NULL_TREE
)
9870 /* Fill in the rest of the sized types. Reuse existing type nodes
9872 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9873 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9874 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9875 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9876 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9878 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9879 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9880 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9881 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9882 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9884 /* Don't call build_qualified type for atomics. That routine does
9885 special processing for atomics, and until they are initialized
9886 it's better not to make that call.
9888 Check to see if there is a target override for atomic types. */
9890 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9891 targetm
.atomic_align_for_mode (QImode
));
9892 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9893 targetm
.atomic_align_for_mode (HImode
));
9894 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9895 targetm
.atomic_align_for_mode (SImode
));
9896 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9897 targetm
.atomic_align_for_mode (DImode
));
9898 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9899 targetm
.atomic_align_for_mode (TImode
));
9901 access_public_node
= get_identifier ("public");
9902 access_protected_node
= get_identifier ("protected");
9903 access_private_node
= get_identifier ("private");
9905 /* Define these next since types below may used them. */
9906 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9907 integer_one_node
= build_int_cst (integer_type_node
, 1);
9908 integer_three_node
= build_int_cst (integer_type_node
, 3);
9909 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9911 size_zero_node
= size_int (0);
9912 size_one_node
= size_int (1);
9913 bitsize_zero_node
= bitsize_int (0);
9914 bitsize_one_node
= bitsize_int (1);
9915 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9917 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9918 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9920 void_type_node
= make_node (VOID_TYPE
);
9921 layout_type (void_type_node
);
9923 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9925 /* We are not going to have real types in C with less than byte alignment,
9926 so we might as well not have any types that claim to have it. */
9927 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9928 TYPE_USER_ALIGN (void_type_node
) = 0;
9930 void_node
= make_node (VOID_CST
);
9931 TREE_TYPE (void_node
) = void_type_node
;
9933 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9934 layout_type (TREE_TYPE (null_pointer_node
));
9936 ptr_type_node
= build_pointer_type (void_type_node
);
9938 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9939 for (unsigned i
= 0;
9940 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9942 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9944 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9946 float_type_node
= make_node (REAL_TYPE
);
9947 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9948 layout_type (float_type_node
);
9950 double_type_node
= make_node (REAL_TYPE
);
9951 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9952 layout_type (double_type_node
);
9954 long_double_type_node
= make_node (REAL_TYPE
);
9955 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9956 layout_type (long_double_type_node
);
9958 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9960 int n
= floatn_nx_types
[i
].n
;
9961 bool extended
= floatn_nx_types
[i
].extended
;
9962 scalar_float_mode mode
;
9963 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9965 int precision
= GET_MODE_PRECISION (mode
);
9966 /* Work around the rs6000 KFmode having precision 113 not
9968 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9969 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9970 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9972 gcc_assert (min_precision
== n
);
9973 if (precision
< min_precision
)
9974 precision
= min_precision
;
9975 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9976 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9977 layout_type (FLOATN_NX_TYPE_NODE (i
));
9978 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
9981 float_ptr_type_node
= build_pointer_type (float_type_node
);
9982 double_ptr_type_node
= build_pointer_type (double_type_node
);
9983 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9984 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9986 /* Fixed size integer types. */
9987 uint16_type_node
= make_or_reuse_type (16, 1);
9988 uint32_type_node
= make_or_reuse_type (32, 1);
9989 uint64_type_node
= make_or_reuse_type (64, 1);
9991 /* Decimal float types. */
9992 dfloat32_type_node
= make_node (REAL_TYPE
);
9993 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9994 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9995 layout_type (dfloat32_type_node
);
9996 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9998 dfloat64_type_node
= make_node (REAL_TYPE
);
9999 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10000 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10001 layout_type (dfloat64_type_node
);
10002 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10004 dfloat128_type_node
= make_node (REAL_TYPE
);
10005 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10006 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10007 layout_type (dfloat128_type_node
);
10008 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10010 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10011 complex_float_type_node
= build_complex_type (float_type_node
, true);
10012 complex_double_type_node
= build_complex_type (double_type_node
, true);
10013 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10016 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10018 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10019 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10020 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10023 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10024 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10025 sat_ ## KIND ## _type_node = \
10026 make_sat_signed_ ## KIND ## _type (SIZE); \
10027 sat_unsigned_ ## KIND ## _type_node = \
10028 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10029 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10030 unsigned_ ## KIND ## _type_node = \
10031 make_unsigned_ ## KIND ## _type (SIZE);
10033 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10034 sat_ ## WIDTH ## KIND ## _type_node = \
10035 make_sat_signed_ ## KIND ## _type (SIZE); \
10036 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10037 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10038 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10039 unsigned_ ## WIDTH ## KIND ## _type_node = \
10040 make_unsigned_ ## KIND ## _type (SIZE);
10042 /* Make fixed-point type nodes based on four different widths. */
10043 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10044 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10045 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10046 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10047 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10049 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10050 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10051 NAME ## _type_node = \
10052 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10053 u ## NAME ## _type_node = \
10054 make_or_reuse_unsigned_ ## KIND ## _type \
10055 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10056 sat_ ## NAME ## _type_node = \
10057 make_or_reuse_sat_signed_ ## KIND ## _type \
10058 (GET_MODE_BITSIZE (MODE ## mode)); \
10059 sat_u ## NAME ## _type_node = \
10060 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10061 (GET_MODE_BITSIZE (U ## MODE ## mode));
10063 /* Fixed-point type and mode nodes. */
10064 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10065 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10066 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10067 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10068 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10069 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10070 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10071 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10072 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10073 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10074 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10077 tree t
= targetm
.build_builtin_va_list ();
10079 /* Many back-ends define record types without setting TYPE_NAME.
10080 If we copied the record type here, we'd keep the original
10081 record type without a name. This breaks name mangling. So,
10082 don't copy record types and let c_common_nodes_and_builtins()
10083 declare the type to be __builtin_va_list. */
10084 if (TREE_CODE (t
) != RECORD_TYPE
)
10085 t
= build_variant_type_copy (t
);
10087 va_list_type_node
= t
;
10091 /* Modify DECL for given flags.
10092 TM_PURE attribute is set only on types, so the function will modify
10093 DECL's type when ECF_TM_PURE is used. */
10096 set_call_expr_flags (tree decl
, int flags
)
10098 if (flags
& ECF_NOTHROW
)
10099 TREE_NOTHROW (decl
) = 1;
10100 if (flags
& ECF_CONST
)
10101 TREE_READONLY (decl
) = 1;
10102 if (flags
& ECF_PURE
)
10103 DECL_PURE_P (decl
) = 1;
10104 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10105 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10106 if (flags
& ECF_NOVOPS
)
10107 DECL_IS_NOVOPS (decl
) = 1;
10108 if (flags
& ECF_NORETURN
)
10109 TREE_THIS_VOLATILE (decl
) = 1;
10110 if (flags
& ECF_MALLOC
)
10111 DECL_IS_MALLOC (decl
) = 1;
10112 if (flags
& ECF_RETURNS_TWICE
)
10113 DECL_IS_RETURNS_TWICE (decl
) = 1;
10114 if (flags
& ECF_LEAF
)
10115 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10116 NULL
, DECL_ATTRIBUTES (decl
));
10117 if (flags
& ECF_COLD
)
10118 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10119 NULL
, DECL_ATTRIBUTES (decl
));
10120 if (flags
& ECF_RET1
)
10121 DECL_ATTRIBUTES (decl
)
10122 = tree_cons (get_identifier ("fn spec"),
10123 build_tree_list (NULL_TREE
, build_string (1, "1")),
10124 DECL_ATTRIBUTES (decl
));
10125 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10126 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10127 /* Looping const or pure is implied by noreturn.
10128 There is currently no way to declare looping const or looping pure alone. */
10129 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10130 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10134 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10137 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10138 const char *library_name
, int ecf_flags
)
10142 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10143 library_name
, NULL_TREE
);
10144 set_call_expr_flags (decl
, ecf_flags
);
10146 set_builtin_decl (code
, decl
, true);
10149 /* Call this function after instantiating all builtins that the language
10150 front end cares about. This will build the rest of the builtins
10151 and internal functions that are relied upon by the tree optimizers and
10155 build_common_builtin_nodes (void)
10160 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10161 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10163 ftype
= build_function_type (void_type_node
, void_list_node
);
10164 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10165 local_define_builtin ("__builtin_unreachable", ftype
,
10166 BUILT_IN_UNREACHABLE
,
10167 "__builtin_unreachable",
10168 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10169 | ECF_CONST
| ECF_COLD
);
10170 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10171 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10173 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10176 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10177 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10179 ftype
= build_function_type_list (ptr_type_node
,
10180 ptr_type_node
, const_ptr_type_node
,
10181 size_type_node
, NULL_TREE
);
10183 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10184 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10185 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10186 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10187 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10188 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10191 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10193 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10194 const_ptr_type_node
, size_type_node
,
10196 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10197 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10200 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10202 ftype
= build_function_type_list (ptr_type_node
,
10203 ptr_type_node
, integer_type_node
,
10204 size_type_node
, NULL_TREE
);
10205 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10206 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10209 /* If we're checking the stack, `alloca' can throw. */
10210 const int alloca_flags
10211 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10213 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10215 ftype
= build_function_type_list (ptr_type_node
,
10216 size_type_node
, NULL_TREE
);
10217 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10218 "alloca", alloca_flags
);
10221 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10222 size_type_node
, NULL_TREE
);
10223 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10224 BUILT_IN_ALLOCA_WITH_ALIGN
,
10225 "__builtin_alloca_with_align",
10228 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10229 size_type_node
, size_type_node
, NULL_TREE
);
10230 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10231 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10232 "__builtin_alloca_with_align_and_max",
10235 ftype
= build_function_type_list (void_type_node
,
10236 ptr_type_node
, ptr_type_node
,
10237 ptr_type_node
, NULL_TREE
);
10238 local_define_builtin ("__builtin_init_trampoline", ftype
,
10239 BUILT_IN_INIT_TRAMPOLINE
,
10240 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10241 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10242 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10243 "__builtin_init_heap_trampoline",
10244 ECF_NOTHROW
| ECF_LEAF
);
10245 local_define_builtin ("__builtin_init_descriptor", ftype
,
10246 BUILT_IN_INIT_DESCRIPTOR
,
10247 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10249 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10250 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10251 BUILT_IN_ADJUST_TRAMPOLINE
,
10252 "__builtin_adjust_trampoline",
10253 ECF_CONST
| ECF_NOTHROW
);
10254 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10255 BUILT_IN_ADJUST_DESCRIPTOR
,
10256 "__builtin_adjust_descriptor",
10257 ECF_CONST
| ECF_NOTHROW
);
10259 ftype
= build_function_type_list (void_type_node
,
10260 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10261 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10262 BUILT_IN_NONLOCAL_GOTO
,
10263 "__builtin_nonlocal_goto",
10264 ECF_NORETURN
| ECF_NOTHROW
);
10266 ftype
= build_function_type_list (void_type_node
,
10267 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10268 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10269 BUILT_IN_SETJMP_SETUP
,
10270 "__builtin_setjmp_setup", ECF_NOTHROW
);
10272 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10273 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10274 BUILT_IN_SETJMP_RECEIVER
,
10275 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10277 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10278 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10279 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10281 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10282 local_define_builtin ("__builtin_stack_restore", ftype
,
10283 BUILT_IN_STACK_RESTORE
,
10284 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10286 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10287 const_ptr_type_node
, size_type_node
,
10289 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10290 "__builtin_memcmp_eq",
10291 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10293 /* If there's a possibility that we might use the ARM EABI, build the
10294 alternate __cxa_end_cleanup node used to resume from C++. */
10295 if (targetm
.arm_eabi_unwinder
)
10297 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10298 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10299 BUILT_IN_CXA_END_CLEANUP
,
10300 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10303 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10304 local_define_builtin ("__builtin_unwind_resume", ftype
,
10305 BUILT_IN_UNWIND_RESUME
,
10306 ((targetm_common
.except_unwind_info (&global_options
)
10308 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10311 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10313 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10315 local_define_builtin ("__builtin_return_address", ftype
,
10316 BUILT_IN_RETURN_ADDRESS
,
10317 "__builtin_return_address",
10321 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10322 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10324 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10325 ptr_type_node
, NULL_TREE
);
10326 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10327 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10328 BUILT_IN_PROFILE_FUNC_ENTER
,
10329 "__cyg_profile_func_enter", 0);
10330 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10331 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10332 BUILT_IN_PROFILE_FUNC_EXIT
,
10333 "__cyg_profile_func_exit", 0);
10336 /* The exception object and filter values from the runtime. The argument
10337 must be zero before exception lowering, i.e. from the front end. After
10338 exception lowering, it will be the region number for the exception
10339 landing pad. These functions are PURE instead of CONST to prevent
10340 them from being hoisted past the exception edge that will initialize
10341 its value in the landing pad. */
10342 ftype
= build_function_type_list (ptr_type_node
,
10343 integer_type_node
, NULL_TREE
);
10344 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10345 /* Only use TM_PURE if we have TM language support. */
10346 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10347 ecf_flags
|= ECF_TM_PURE
;
10348 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10349 "__builtin_eh_pointer", ecf_flags
);
10351 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10352 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10353 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10354 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10356 ftype
= build_function_type_list (void_type_node
,
10357 integer_type_node
, integer_type_node
,
10359 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10360 BUILT_IN_EH_COPY_VALUES
,
10361 "__builtin_eh_copy_values", ECF_NOTHROW
);
10363 /* Complex multiplication and division. These are handled as builtins
10364 rather than optabs because emit_library_call_value doesn't support
10365 complex. Further, we can do slightly better with folding these
10366 beasties if the real and complex parts of the arguments are separate. */
10370 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10372 char mode_name_buf
[4], *q
;
10374 enum built_in_function mcode
, dcode
;
10375 tree type
, inner_type
;
10376 const char *prefix
= "__";
10378 if (targetm
.libfunc_gnu_prefix
)
10381 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10384 inner_type
= TREE_TYPE (type
);
10386 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10387 inner_type
, inner_type
, NULL_TREE
);
10389 mcode
= ((enum built_in_function
)
10390 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10391 dcode
= ((enum built_in_function
)
10392 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10394 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10398 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10400 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10401 built_in_names
[mcode
],
10402 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10404 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10406 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10407 built_in_names
[dcode
],
10408 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10412 init_internal_fns ();
10415 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10418 If we requested a pointer to a vector, build up the pointers that
10419 we stripped off while looking for the inner type. Similarly for
10420 return values from functions.
10422 The argument TYPE is the top of the chain, and BOTTOM is the
10423 new type which we will point to. */
10426 reconstruct_complex_type (tree type
, tree bottom
)
10430 if (TREE_CODE (type
) == POINTER_TYPE
)
10432 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10433 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10434 TYPE_REF_CAN_ALIAS_ALL (type
));
10436 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10438 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10439 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10440 TYPE_REF_CAN_ALIAS_ALL (type
));
10442 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10444 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10445 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10447 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10449 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10450 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10452 else if (TREE_CODE (type
) == METHOD_TYPE
)
10454 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10455 /* The build_method_type_directly() routine prepends 'this' to argument list,
10456 so we must compensate by getting rid of it. */
10458 = build_method_type_directly
10459 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10461 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10463 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10465 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10466 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10471 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10472 TYPE_QUALS (type
));
10475 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10478 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10481 unsigned int bitsize
;
10483 switch (GET_MODE_CLASS (mode
))
10485 case MODE_VECTOR_INT
:
10486 case MODE_VECTOR_FLOAT
:
10487 case MODE_VECTOR_FRACT
:
10488 case MODE_VECTOR_UFRACT
:
10489 case MODE_VECTOR_ACCUM
:
10490 case MODE_VECTOR_UACCUM
:
10491 nunits
= GET_MODE_NUNITS (mode
);
10495 /* Check that there are no leftover bits. */
10496 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10497 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10498 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10502 gcc_unreachable ();
10505 return make_vector_type (innertype
, nunits
, mode
);
10508 /* Similarly, but takes the inner type and number of units, which must be
10512 build_vector_type (tree innertype
, int nunits
)
10514 return make_vector_type (innertype
, nunits
, VOIDmode
);
10517 /* Build truth vector with specified length and number of units. */
10520 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10522 machine_mode mask_mode
10523 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10525 unsigned HOST_WIDE_INT vsize
;
10526 if (mask_mode
== BLKmode
)
10527 vsize
= vector_size
* BITS_PER_UNIT
;
10529 vsize
= GET_MODE_BITSIZE (mask_mode
);
10531 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10532 gcc_assert (esize
* nunits
== vsize
);
10534 tree bool_type
= build_nonstandard_boolean_type (esize
);
10536 return make_vector_type (bool_type
, nunits
, mask_mode
);
10539 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10542 build_same_sized_truth_vector_type (tree vectype
)
10544 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10547 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10550 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10552 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10555 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10558 build_opaque_vector_type (tree innertype
, int nunits
)
10560 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10562 /* We always build the non-opaque variant before the opaque one,
10563 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10564 cand
= TYPE_NEXT_VARIANT (t
);
10566 && TYPE_VECTOR_OPAQUE (cand
)
10567 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10569 /* Othewise build a variant type and make sure to queue it after
10570 the non-opaque type. */
10571 cand
= build_distinct_type_copy (t
);
10572 TYPE_VECTOR_OPAQUE (cand
) = true;
10573 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10574 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10575 TYPE_NEXT_VARIANT (t
) = cand
;
10576 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10580 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10583 vector_cst_int_elt (const_tree t
, unsigned int i
)
10585 /* First handle elements that are directly encoded. */
10586 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10587 if (i
< encoded_nelts
)
10588 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10590 /* Identify the pattern that contains element I and work out the index of
10591 the last encoded element for that pattern. */
10592 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10593 unsigned int pattern
= i
% npatterns
;
10594 unsigned int count
= i
/ npatterns
;
10595 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10597 /* If there are no steps, the final encoded value is the right one. */
10598 if (!VECTOR_CST_STEPPED_P (t
))
10599 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10601 /* Otherwise work out the value from the last two encoded elements. */
10602 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10603 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10604 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10605 return wi::to_wide (v2
) + (count
- 2) * diff
;
10608 /* Return the value of element I of VECTOR_CST T. */
10611 vector_cst_elt (const_tree t
, unsigned int i
)
10613 /* First handle elements that are directly encoded. */
10614 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10615 if (i
< encoded_nelts
)
10616 return VECTOR_CST_ENCODED_ELT (t
, i
);
10618 /* If there are no steps, the final encoded value is the right one. */
10619 if (!VECTOR_CST_STEPPED_P (t
))
10621 /* Identify the pattern that contains element I and work out the index of
10622 the last encoded element for that pattern. */
10623 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10624 unsigned int pattern
= i
% npatterns
;
10625 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10626 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10629 /* Otherwise work out the value from the last two encoded elements. */
10630 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10631 vector_cst_int_elt (t
, i
));
10634 /* Given an initializer INIT, return TRUE if INIT is zero or some
10635 aggregate of zeros. Otherwise return FALSE. */
10637 initializer_zerop (const_tree init
)
10643 switch (TREE_CODE (init
))
10646 return integer_zerop (init
);
10649 /* ??? Note that this is not correct for C4X float formats. There,
10650 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10651 negative exponent. */
10652 return real_zerop (init
)
10653 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10656 return fixed_zerop (init
);
10659 return integer_zerop (init
)
10660 || (real_zerop (init
)
10661 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10662 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10665 return (VECTOR_CST_NPATTERNS (init
) == 1
10666 && VECTOR_CST_DUPLICATE_P (init
)
10667 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)));
10671 unsigned HOST_WIDE_INT idx
;
10673 if (TREE_CLOBBER_P (init
))
10675 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10676 if (!initializer_zerop (elt
))
10685 /* We need to loop through all elements to handle cases like
10686 "\0" and "\0foobar". */
10687 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10688 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10699 /* Check if vector VEC consists of all the equal elements and
10700 that the number of elements corresponds to the type of VEC.
10701 The function returns first element of the vector
10702 or NULL_TREE if the vector is not uniform. */
10704 uniform_vector_p (const_tree vec
)
10709 if (vec
== NULL_TREE
)
10712 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10714 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
10715 return TREE_OPERAND (vec
, 0);
10717 else if (TREE_CODE (vec
) == VECTOR_CST
)
10719 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
10720 return VECTOR_CST_ENCODED_ELT (vec
, 0);
10724 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10726 first
= error_mark_node
;
10728 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10735 if (!operand_equal_p (first
, t
, 0))
10738 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10747 /* Build an empty statement at location LOC. */
10750 build_empty_stmt (location_t loc
)
10752 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10753 SET_EXPR_LOCATION (t
, loc
);
10758 /* Build an OpenMP clause with code CODE. LOC is the location of the
10762 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10767 length
= omp_clause_num_ops
[code
];
10768 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10770 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10772 t
= (tree
) ggc_internal_alloc (size
);
10773 memset (t
, 0, size
);
10774 TREE_SET_CODE (t
, OMP_CLAUSE
);
10775 OMP_CLAUSE_SET_CODE (t
, code
);
10776 OMP_CLAUSE_LOCATION (t
) = loc
;
10781 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10782 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10783 Except for the CODE and operand count field, other storage for the
10784 object is initialized to zeros. */
10787 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10790 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10792 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10793 gcc_assert (len
>= 1);
10795 record_node_allocation_statistics (code
, length
);
10797 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10799 TREE_SET_CODE (t
, code
);
10801 /* Can't use TREE_OPERAND to store the length because if checking is
10802 enabled, it will try to check the length before we store it. :-P */
10803 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10808 /* Helper function for build_call_* functions; build a CALL_EXPR with
10809 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10810 the argument slots. */
10813 build_call_1 (tree return_type
, tree fn
, int nargs
)
10817 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10818 TREE_TYPE (t
) = return_type
;
10819 CALL_EXPR_FN (t
) = fn
;
10820 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10825 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10826 FN and a null static chain slot. NARGS is the number of call arguments
10827 which are specified as "..." arguments. */
10830 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10834 va_start (args
, nargs
);
10835 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10840 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10841 FN and a null static chain slot. NARGS is the number of call arguments
10842 which are specified as a va_list ARGS. */
10845 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10850 t
= build_call_1 (return_type
, fn
, nargs
);
10851 for (i
= 0; i
< nargs
; i
++)
10852 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10853 process_call_operands (t
);
10857 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10858 FN and a null static chain slot. NARGS is the number of call arguments
10859 which are specified as a tree array ARGS. */
10862 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10863 int nargs
, const tree
*args
)
10868 t
= build_call_1 (return_type
, fn
, nargs
);
10869 for (i
= 0; i
< nargs
; i
++)
10870 CALL_EXPR_ARG (t
, i
) = args
[i
];
10871 process_call_operands (t
);
10872 SET_EXPR_LOCATION (t
, loc
);
10876 /* Like build_call_array, but takes a vec. */
10879 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10884 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10885 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10886 CALL_EXPR_ARG (ret
, ix
) = t
;
10887 process_call_operands (ret
);
10891 /* Conveniently construct a function call expression. FNDECL names the
10892 function to be called and N arguments are passed in the array
10896 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10898 tree fntype
= TREE_TYPE (fndecl
);
10899 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10901 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10904 /* Conveniently construct a function call expression. FNDECL names the
10905 function to be called and the arguments are passed in the vector
10909 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10911 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10912 vec_safe_address (vec
));
10916 /* Conveniently construct a function call expression. FNDECL names the
10917 function to be called, N is the number of arguments, and the "..."
10918 parameters are the argument expressions. */
10921 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10924 tree
*argarray
= XALLOCAVEC (tree
, n
);
10928 for (i
= 0; i
< n
; i
++)
10929 argarray
[i
] = va_arg (ap
, tree
);
10931 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10934 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10935 varargs macros aren't supported by all bootstrap compilers. */
10938 build_call_expr (tree fndecl
, int n
, ...)
10941 tree
*argarray
= XALLOCAVEC (tree
, n
);
10945 for (i
= 0; i
< n
; i
++)
10946 argarray
[i
] = va_arg (ap
, tree
);
10948 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10951 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10952 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10953 It will get gimplified later into an ordinary internal function. */
10956 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10957 tree type
, int n
, const tree
*args
)
10959 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10960 for (int i
= 0; i
< n
; ++i
)
10961 CALL_EXPR_ARG (t
, i
) = args
[i
];
10962 SET_EXPR_LOCATION (t
, loc
);
10963 CALL_EXPR_IFN (t
) = ifn
;
10967 /* Build internal call expression. This is just like CALL_EXPR, except
10968 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10969 internal function. */
10972 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10973 tree type
, int n
, ...)
10976 tree
*argarray
= XALLOCAVEC (tree
, n
);
10980 for (i
= 0; i
< n
; i
++)
10981 argarray
[i
] = va_arg (ap
, tree
);
10983 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10986 /* Return a function call to FN, if the target is guaranteed to support it,
10989 N is the number of arguments, passed in the "...", and TYPE is the
10990 type of the return value. */
10993 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
10997 tree
*argarray
= XALLOCAVEC (tree
, n
);
11001 for (i
= 0; i
< n
; i
++)
11002 argarray
[i
] = va_arg (ap
, tree
);
11004 if (internal_fn_p (fn
))
11006 internal_fn ifn
= as_internal_fn (fn
);
11007 if (direct_internal_fn_p (ifn
))
11009 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11010 if (!direct_internal_fn_supported_p (ifn
, types
,
11011 OPTIMIZE_FOR_BOTH
))
11014 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11018 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11021 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11025 /* Return a function call to the appropriate builtin alloca variant.
11027 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11028 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11029 bound for SIZE in case it is not a fixed value. */
11032 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11036 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11038 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11040 else if (align
> 0)
11042 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11043 return build_call_expr (t
, 2, size
, size_int (align
));
11047 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11048 return build_call_expr (t
, 1, size
);
11052 /* Create a new constant string literal and return a char* pointer to it.
11053 The STRING_CST value is the LEN characters at STR. */
11055 build_string_literal (int len
, const char *str
)
11057 tree t
, elem
, index
, type
;
11059 t
= build_string (len
, str
);
11060 elem
= build_type_variant (char_type_node
, 1, 0);
11061 index
= build_index_type (size_int (len
- 1));
11062 type
= build_array_type (elem
, index
);
11063 TREE_TYPE (t
) = type
;
11064 TREE_CONSTANT (t
) = 1;
11065 TREE_READONLY (t
) = 1;
11066 TREE_STATIC (t
) = 1;
11068 type
= build_pointer_type (elem
);
11069 t
= build1 (ADDR_EXPR
, type
,
11070 build4 (ARRAY_REF
, elem
,
11071 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11077 /* Return true if T (assumed to be a DECL) must be assigned a memory
11081 needs_to_live_in_memory (const_tree t
)
11083 return (TREE_ADDRESSABLE (t
)
11084 || is_global_var (t
)
11085 || (TREE_CODE (t
) == RESULT_DECL
11086 && !DECL_BY_REFERENCE (t
)
11087 && aggregate_value_p (t
, current_function_decl
)));
11090 /* Return value of a constant X and sign-extend it. */
11093 int_cst_value (const_tree x
)
11095 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11096 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11098 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11099 gcc_assert (cst_and_fits_in_hwi (x
));
11101 if (bits
< HOST_BITS_PER_WIDE_INT
)
11103 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11105 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11107 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11113 /* If TYPE is an integral or pointer type, return an integer type with
11114 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11115 if TYPE is already an integer type of signedness UNSIGNEDP. */
11118 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11120 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11123 if (TREE_CODE (type
) == VECTOR_TYPE
)
11125 tree inner
= TREE_TYPE (type
);
11126 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11129 if (inner
== inner2
)
11131 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11134 if (!INTEGRAL_TYPE_P (type
)
11135 && !POINTER_TYPE_P (type
)
11136 && TREE_CODE (type
) != OFFSET_TYPE
)
11139 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11142 /* If TYPE is an integral or pointer type, return an integer type with
11143 the same precision which is unsigned, or itself if TYPE is already an
11144 unsigned integer type. */
11147 unsigned_type_for (tree type
)
11149 return signed_or_unsigned_type_for (1, type
);
11152 /* If TYPE is an integral or pointer type, return an integer type with
11153 the same precision which is signed, or itself if TYPE is already a
11154 signed integer type. */
11157 signed_type_for (tree type
)
11159 return signed_or_unsigned_type_for (0, type
);
11162 /* If TYPE is a vector type, return a signed integer vector type with the
11163 same width and number of subparts. Otherwise return boolean_type_node. */
11166 truth_type_for (tree type
)
11168 if (TREE_CODE (type
) == VECTOR_TYPE
)
11170 if (VECTOR_BOOLEAN_TYPE_P (type
))
11172 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11173 GET_MODE_SIZE (TYPE_MODE (type
)));
11176 return boolean_type_node
;
11179 /* Returns the largest value obtainable by casting something in INNER type to
11183 upper_bound_in_type (tree outer
, tree inner
)
11185 unsigned int det
= 0;
11186 unsigned oprec
= TYPE_PRECISION (outer
);
11187 unsigned iprec
= TYPE_PRECISION (inner
);
11190 /* Compute a unique number for every combination. */
11191 det
|= (oprec
> iprec
) ? 4 : 0;
11192 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11193 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11195 /* Determine the exponent to use. */
11200 /* oprec <= iprec, outer: signed, inner: don't care. */
11205 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11209 /* oprec > iprec, outer: signed, inner: signed. */
11213 /* oprec > iprec, outer: signed, inner: unsigned. */
11217 /* oprec > iprec, outer: unsigned, inner: signed. */
11221 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11225 gcc_unreachable ();
11228 return wide_int_to_tree (outer
,
11229 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11232 /* Returns the smallest value obtainable by casting something in INNER type to
11236 lower_bound_in_type (tree outer
, tree inner
)
11238 unsigned oprec
= TYPE_PRECISION (outer
);
11239 unsigned iprec
= TYPE_PRECISION (inner
);
11241 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11243 if (TYPE_UNSIGNED (outer
)
11244 /* If we are widening something of an unsigned type, OUTER type
11245 contains all values of INNER type. In particular, both INNER
11246 and OUTER types have zero in common. */
11247 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11248 return build_int_cst (outer
, 0);
11251 /* If we are widening a signed type to another signed type, we
11252 want to obtain -2^^(iprec-1). If we are keeping the
11253 precision or narrowing to a signed type, we want to obtain
11255 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11256 return wide_int_to_tree (outer
,
11257 wi::mask (prec
- 1, true,
11258 TYPE_PRECISION (outer
)));
11262 /* Return nonzero if two operands that are suitable for PHI nodes are
11263 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11264 SSA_NAME or invariant. Note that this is strictly an optimization.
11265 That is, callers of this function can directly call operand_equal_p
11266 and get the same result, only slower. */
11269 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11273 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11275 return operand_equal_p (arg0
, arg1
, 0);
11278 /* Returns number of zeros at the end of binary representation of X. */
11281 num_ending_zeros (const_tree x
)
11283 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11287 #define WALK_SUBTREE(NODE) \
11290 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11296 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11297 be walked whenever a type is seen in the tree. Rest of operands and return
11298 value are as for walk_tree. */
11301 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11302 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11304 tree result
= NULL_TREE
;
11306 switch (TREE_CODE (type
))
11309 case REFERENCE_TYPE
:
11311 /* We have to worry about mutually recursive pointers. These can't
11312 be written in C. They can in Ada. It's pathological, but
11313 there's an ACATS test (c38102a) that checks it. Deal with this
11314 by checking if we're pointing to another pointer, that one
11315 points to another pointer, that one does too, and we have no htab.
11316 If so, get a hash table. We check three levels deep to avoid
11317 the cost of the hash table if we don't need one. */
11318 if (POINTER_TYPE_P (TREE_TYPE (type
))
11319 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11320 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11323 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11334 WALK_SUBTREE (TREE_TYPE (type
));
11338 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11340 /* Fall through. */
11342 case FUNCTION_TYPE
:
11343 WALK_SUBTREE (TREE_TYPE (type
));
11347 /* We never want to walk into default arguments. */
11348 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11349 WALK_SUBTREE (TREE_VALUE (arg
));
11354 /* Don't follow this nodes's type if a pointer for fear that
11355 we'll have infinite recursion. If we have a PSET, then we
11358 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11359 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11360 WALK_SUBTREE (TREE_TYPE (type
));
11361 WALK_SUBTREE (TYPE_DOMAIN (type
));
11365 WALK_SUBTREE (TREE_TYPE (type
));
11366 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11376 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11377 called with the DATA and the address of each sub-tree. If FUNC returns a
11378 non-NULL value, the traversal is stopped, and the value returned by FUNC
11379 is returned. If PSET is non-NULL it is used to record the nodes visited,
11380 and to avoid visiting a node more than once. */
11383 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11384 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11386 enum tree_code code
;
11390 #define WALK_SUBTREE_TAIL(NODE) \
11394 goto tail_recurse; \
11399 /* Skip empty subtrees. */
11403 /* Don't walk the same tree twice, if the user has requested
11404 that we avoid doing so. */
11405 if (pset
&& pset
->add (*tp
))
11408 /* Call the function. */
11410 result
= (*func
) (tp
, &walk_subtrees
, data
);
11412 /* If we found something, return it. */
11416 code
= TREE_CODE (*tp
);
11418 /* Even if we didn't, FUNC may have decided that there was nothing
11419 interesting below this point in the tree. */
11420 if (!walk_subtrees
)
11422 /* But we still need to check our siblings. */
11423 if (code
== TREE_LIST
)
11424 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11425 else if (code
== OMP_CLAUSE
)
11426 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11433 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11434 if (result
|| !walk_subtrees
)
11441 case IDENTIFIER_NODE
:
11448 case PLACEHOLDER_EXPR
:
11452 /* None of these have subtrees other than those already walked
11457 WALK_SUBTREE (TREE_VALUE (*tp
));
11458 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11463 int len
= TREE_VEC_LENGTH (*tp
);
11468 /* Walk all elements but the first. */
11470 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11472 /* Now walk the first one as a tail call. */
11473 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11477 WALK_SUBTREE (TREE_REALPART (*tp
));
11478 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11482 unsigned HOST_WIDE_INT idx
;
11483 constructor_elt
*ce
;
11485 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11487 WALK_SUBTREE (ce
->value
);
11492 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11497 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11499 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11500 into declarations that are just mentioned, rather than
11501 declared; they don't really belong to this part of the tree.
11502 And, we can see cycles: the initializer for a declaration
11503 can refer to the declaration itself. */
11504 WALK_SUBTREE (DECL_INITIAL (decl
));
11505 WALK_SUBTREE (DECL_SIZE (decl
));
11506 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11508 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11511 case STATEMENT_LIST
:
11513 tree_stmt_iterator i
;
11514 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11515 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11520 switch (OMP_CLAUSE_CODE (*tp
))
11522 case OMP_CLAUSE_GANG
:
11523 case OMP_CLAUSE__GRIDDIM_
:
11524 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11527 case OMP_CLAUSE_ASYNC
:
11528 case OMP_CLAUSE_WAIT
:
11529 case OMP_CLAUSE_WORKER
:
11530 case OMP_CLAUSE_VECTOR
:
11531 case OMP_CLAUSE_NUM_GANGS
:
11532 case OMP_CLAUSE_NUM_WORKERS
:
11533 case OMP_CLAUSE_VECTOR_LENGTH
:
11534 case OMP_CLAUSE_PRIVATE
:
11535 case OMP_CLAUSE_SHARED
:
11536 case OMP_CLAUSE_FIRSTPRIVATE
:
11537 case OMP_CLAUSE_COPYIN
:
11538 case OMP_CLAUSE_COPYPRIVATE
:
11539 case OMP_CLAUSE_FINAL
:
11540 case OMP_CLAUSE_IF
:
11541 case OMP_CLAUSE_NUM_THREADS
:
11542 case OMP_CLAUSE_SCHEDULE
:
11543 case OMP_CLAUSE_UNIFORM
:
11544 case OMP_CLAUSE_DEPEND
:
11545 case OMP_CLAUSE_NUM_TEAMS
:
11546 case OMP_CLAUSE_THREAD_LIMIT
:
11547 case OMP_CLAUSE_DEVICE
:
11548 case OMP_CLAUSE_DIST_SCHEDULE
:
11549 case OMP_CLAUSE_SAFELEN
:
11550 case OMP_CLAUSE_SIMDLEN
:
11551 case OMP_CLAUSE_ORDERED
:
11552 case OMP_CLAUSE_PRIORITY
:
11553 case OMP_CLAUSE_GRAINSIZE
:
11554 case OMP_CLAUSE_NUM_TASKS
:
11555 case OMP_CLAUSE_HINT
:
11556 case OMP_CLAUSE_TO_DECLARE
:
11557 case OMP_CLAUSE_LINK
:
11558 case OMP_CLAUSE_USE_DEVICE_PTR
:
11559 case OMP_CLAUSE_IS_DEVICE_PTR
:
11560 case OMP_CLAUSE__LOOPTEMP_
:
11561 case OMP_CLAUSE__SIMDUID_
:
11562 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11565 case OMP_CLAUSE_INDEPENDENT
:
11566 case OMP_CLAUSE_NOWAIT
:
11567 case OMP_CLAUSE_DEFAULT
:
11568 case OMP_CLAUSE_UNTIED
:
11569 case OMP_CLAUSE_MERGEABLE
:
11570 case OMP_CLAUSE_PROC_BIND
:
11571 case OMP_CLAUSE_INBRANCH
:
11572 case OMP_CLAUSE_NOTINBRANCH
:
11573 case OMP_CLAUSE_FOR
:
11574 case OMP_CLAUSE_PARALLEL
:
11575 case OMP_CLAUSE_SECTIONS
:
11576 case OMP_CLAUSE_TASKGROUP
:
11577 case OMP_CLAUSE_NOGROUP
:
11578 case OMP_CLAUSE_THREADS
:
11579 case OMP_CLAUSE_SIMD
:
11580 case OMP_CLAUSE_DEFAULTMAP
:
11581 case OMP_CLAUSE_AUTO
:
11582 case OMP_CLAUSE_SEQ
:
11583 case OMP_CLAUSE_TILE
:
11584 case OMP_CLAUSE__SIMT_
:
11585 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11587 case OMP_CLAUSE_LASTPRIVATE
:
11588 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11589 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11590 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11592 case OMP_CLAUSE_COLLAPSE
:
11595 for (i
= 0; i
< 3; i
++)
11596 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11597 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11600 case OMP_CLAUSE_LINEAR
:
11601 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11602 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11603 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11604 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11606 case OMP_CLAUSE_ALIGNED
:
11607 case OMP_CLAUSE_FROM
:
11608 case OMP_CLAUSE_TO
:
11609 case OMP_CLAUSE_MAP
:
11610 case OMP_CLAUSE__CACHE_
:
11611 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11612 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11613 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11615 case OMP_CLAUSE_REDUCTION
:
11618 for (i
= 0; i
< 5; i
++)
11619 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11620 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11624 gcc_unreachable ();
11632 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11633 But, we only want to walk once. */
11634 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11635 for (i
= 0; i
< len
; ++i
)
11636 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11637 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11641 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11642 defining. We only want to walk into these fields of a type in this
11643 case and not in the general case of a mere reference to the type.
11645 The criterion is as follows: if the field can be an expression, it
11646 must be walked only here. This should be in keeping with the fields
11647 that are directly gimplified in gimplify_type_sizes in order for the
11648 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11649 variable-sized types.
11651 Note that DECLs get walked as part of processing the BIND_EXPR. */
11652 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11654 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11655 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11658 /* Call the function for the type. See if it returns anything or
11659 doesn't want us to continue. If we are to continue, walk both
11660 the normal fields and those for the declaration case. */
11661 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11662 if (result
|| !walk_subtrees
)
11665 /* But do not walk a pointed-to type since it may itself need to
11666 be walked in the declaration case if it isn't anonymous. */
11667 if (!POINTER_TYPE_P (*type_p
))
11669 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11674 /* If this is a record type, also walk the fields. */
11675 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11679 for (field
= TYPE_FIELDS (*type_p
); field
;
11680 field
= DECL_CHAIN (field
))
11682 /* We'd like to look at the type of the field, but we can
11683 easily get infinite recursion. So assume it's pointed
11684 to elsewhere in the tree. Also, ignore things that
11686 if (TREE_CODE (field
) != FIELD_DECL
)
11689 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11690 WALK_SUBTREE (DECL_SIZE (field
));
11691 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11692 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11693 WALK_SUBTREE (DECL_QUALIFIER (field
));
11697 /* Same for scalar types. */
11698 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11699 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11700 || TREE_CODE (*type_p
) == INTEGER_TYPE
11701 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11702 || TREE_CODE (*type_p
) == REAL_TYPE
)
11704 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11705 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11708 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11709 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11714 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11718 /* Walk over all the sub-trees of this operand. */
11719 len
= TREE_OPERAND_LENGTH (*tp
);
11721 /* Go through the subtrees. We need to do this in forward order so
11722 that the scope of a FOR_EXPR is handled properly. */
11725 for (i
= 0; i
< len
- 1; ++i
)
11726 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11727 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11730 /* If this is a type, walk the needed fields in the type. */
11731 else if (TYPE_P (*tp
))
11732 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11736 /* We didn't find what we were looking for. */
11739 #undef WALK_SUBTREE_TAIL
11741 #undef WALK_SUBTREE
11743 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11746 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11751 hash_set
<tree
> pset
;
11752 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11758 tree_block (tree t
)
11760 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11762 if (IS_EXPR_CODE_CLASS (c
))
11763 return LOCATION_BLOCK (t
->exp
.locus
);
11764 gcc_unreachable ();
11769 tree_set_block (tree t
, tree b
)
11771 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11773 if (IS_EXPR_CODE_CLASS (c
))
11775 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11778 gcc_unreachable ();
11781 /* Create a nameless artificial label and put it in the current
11782 function context. The label has a location of LOC. Returns the
11783 newly created label. */
11786 create_artificial_label (location_t loc
)
11788 tree lab
= build_decl (loc
,
11789 LABEL_DECL
, NULL_TREE
, void_type_node
);
11791 DECL_ARTIFICIAL (lab
) = 1;
11792 DECL_IGNORED_P (lab
) = 1;
11793 DECL_CONTEXT (lab
) = current_function_decl
;
11797 /* Given a tree, try to return a useful variable name that we can use
11798 to prefix a temporary that is being assigned the value of the tree.
11799 I.E. given <temp> = &A, return A. */
11804 tree stripped_decl
;
11807 STRIP_NOPS (stripped_decl
);
11808 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11809 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11810 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11812 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11815 return IDENTIFIER_POINTER (name
);
11819 switch (TREE_CODE (stripped_decl
))
11822 return get_name (TREE_OPERAND (stripped_decl
, 0));
11829 /* Return true if TYPE has a variable argument list. */
11832 stdarg_p (const_tree fntype
)
11834 function_args_iterator args_iter
;
11835 tree n
= NULL_TREE
, t
;
11840 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11845 return n
!= NULL_TREE
&& n
!= void_type_node
;
11848 /* Return true if TYPE has a prototype. */
11851 prototype_p (const_tree fntype
)
11855 gcc_assert (fntype
!= NULL_TREE
);
11857 t
= TYPE_ARG_TYPES (fntype
);
11858 return (t
!= NULL_TREE
);
11861 /* If BLOCK is inlined from an __attribute__((__artificial__))
11862 routine, return pointer to location from where it has been
11865 block_nonartificial_location (tree block
)
11867 location_t
*ret
= NULL
;
11869 while (block
&& TREE_CODE (block
) == BLOCK
11870 && BLOCK_ABSTRACT_ORIGIN (block
))
11872 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11874 while (TREE_CODE (ao
) == BLOCK
11875 && BLOCK_ABSTRACT_ORIGIN (ao
)
11876 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11877 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11879 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11881 /* If AO is an artificial inline, point RET to the
11882 call site locus at which it has been inlined and continue
11883 the loop, in case AO's caller is also an artificial
11885 if (DECL_DECLARED_INLINE_P (ao
)
11886 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11887 ret
= &BLOCK_SOURCE_LOCATION (block
);
11891 else if (TREE_CODE (ao
) != BLOCK
)
11894 block
= BLOCK_SUPERCONTEXT (block
);
11900 /* If EXP is inlined from an __attribute__((__artificial__))
11901 function, return the location of the original call expression. */
11904 tree_nonartificial_location (tree exp
)
11906 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11911 return EXPR_LOCATION (exp
);
11915 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11918 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11921 cl_option_hasher::hash (tree x
)
11923 const_tree
const t
= x
;
11927 hashval_t hash
= 0;
11929 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11931 p
= (const char *)TREE_OPTIMIZATION (t
);
11932 len
= sizeof (struct cl_optimization
);
11935 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11936 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11939 gcc_unreachable ();
11941 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11943 for (i
= 0; i
< len
; i
++)
11945 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11950 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11951 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11955 cl_option_hasher::equal (tree x
, tree y
)
11957 const_tree
const xt
= x
;
11958 const_tree
const yt
= y
;
11963 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11966 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11968 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11969 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11970 len
= sizeof (struct cl_optimization
);
11973 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11975 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11976 TREE_TARGET_OPTION (yt
));
11980 gcc_unreachable ();
11982 return (memcmp (xp
, yp
, len
) == 0);
11985 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11988 build_optimization_node (struct gcc_options
*opts
)
11992 /* Use the cache of optimization nodes. */
11994 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11997 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12001 /* Insert this one into the hash table. */
12002 t
= cl_optimization_node
;
12005 /* Make a new node for next time round. */
12006 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12012 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12015 build_target_option_node (struct gcc_options
*opts
)
12019 /* Use the cache of optimization nodes. */
12021 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12024 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12028 /* Insert this one into the hash table. */
12029 t
= cl_target_option_node
;
12032 /* Make a new node for next time round. */
12033 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12039 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12040 so that they aren't saved during PCH writing. */
12043 prepare_target_option_nodes_for_pch (void)
12045 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12046 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12047 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12048 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12051 /* Determine the "ultimate origin" of a block. The block may be an inlined
12052 instance of an inlined instance of a block which is local to an inline
12053 function, so we have to trace all of the way back through the origin chain
12054 to find out what sort of node actually served as the original seed for the
12058 block_ultimate_origin (const_tree block
)
12060 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12062 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12063 we're trying to output the abstract instance of this function. */
12064 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12067 if (immediate_origin
== NULL_TREE
)
12072 tree lookahead
= immediate_origin
;
12076 ret_val
= lookahead
;
12077 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12078 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12080 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12082 /* The block's abstract origin chain may not be the *ultimate* origin of
12083 the block. It could lead to a DECL that has an abstract origin set.
12084 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12085 will give us if it has one). Note that DECL's abstract origins are
12086 supposed to be the most distant ancestor (or so decl_ultimate_origin
12087 claims), so we don't need to loop following the DECL origins. */
12088 if (DECL_P (ret_val
))
12089 return DECL_ORIGIN (ret_val
);
12095 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12099 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12101 /* Do not strip casts into or out of differing address spaces. */
12102 if (POINTER_TYPE_P (outer_type
)
12103 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12105 if (!POINTER_TYPE_P (inner_type
)
12106 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12107 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12110 else if (POINTER_TYPE_P (inner_type
)
12111 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12113 /* We already know that outer_type is not a pointer with
12114 a non-generic address space. */
12118 /* Use precision rather then machine mode when we can, which gives
12119 the correct answer even for submode (bit-field) types. */
12120 if ((INTEGRAL_TYPE_P (outer_type
)
12121 || POINTER_TYPE_P (outer_type
)
12122 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12123 && (INTEGRAL_TYPE_P (inner_type
)
12124 || POINTER_TYPE_P (inner_type
)
12125 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12126 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12128 /* Otherwise fall back on comparing machine modes (e.g. for
12129 aggregate types, floats). */
12130 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12133 /* Return true iff conversion in EXP generates no instruction. Mark
12134 it inline so that we fully inline into the stripping functions even
12135 though we have two uses of this function. */
12138 tree_nop_conversion (const_tree exp
)
12140 tree outer_type
, inner_type
;
12142 if (!CONVERT_EXPR_P (exp
)
12143 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12145 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12148 outer_type
= TREE_TYPE (exp
);
12149 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12154 return tree_nop_conversion_p (outer_type
, inner_type
);
12157 /* Return true iff conversion in EXP generates no instruction. Don't
12158 consider conversions changing the signedness. */
12161 tree_sign_nop_conversion (const_tree exp
)
12163 tree outer_type
, inner_type
;
12165 if (!tree_nop_conversion (exp
))
12168 outer_type
= TREE_TYPE (exp
);
12169 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12171 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12172 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12175 /* Strip conversions from EXP according to tree_nop_conversion and
12176 return the resulting expression. */
12179 tree_strip_nop_conversions (tree exp
)
12181 while (tree_nop_conversion (exp
))
12182 exp
= TREE_OPERAND (exp
, 0);
12186 /* Strip conversions from EXP according to tree_sign_nop_conversion
12187 and return the resulting expression. */
12190 tree_strip_sign_nop_conversions (tree exp
)
12192 while (tree_sign_nop_conversion (exp
))
12193 exp
= TREE_OPERAND (exp
, 0);
12197 /* Avoid any floating point extensions from EXP. */
12199 strip_float_extensions (tree exp
)
12201 tree sub
, expt
, subt
;
12203 /* For floating point constant look up the narrowest type that can hold
12204 it properly and handle it like (type)(narrowest_type)constant.
12205 This way we can optimize for instance a=a*2.0 where "a" is float
12206 but 2.0 is double constant. */
12207 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12209 REAL_VALUE_TYPE orig
;
12212 orig
= TREE_REAL_CST (exp
);
12213 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12214 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12215 type
= float_type_node
;
12216 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12217 > TYPE_PRECISION (double_type_node
)
12218 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12219 type
= double_type_node
;
12221 return build_real_truncate (type
, orig
);
12224 if (!CONVERT_EXPR_P (exp
))
12227 sub
= TREE_OPERAND (exp
, 0);
12228 subt
= TREE_TYPE (sub
);
12229 expt
= TREE_TYPE (exp
);
12231 if (!FLOAT_TYPE_P (subt
))
12234 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12237 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12240 return strip_float_extensions (sub
);
12243 /* Strip out all handled components that produce invariant
12247 strip_invariant_refs (const_tree op
)
12249 while (handled_component_p (op
))
12251 switch (TREE_CODE (op
))
12254 case ARRAY_RANGE_REF
:
12255 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12256 || TREE_OPERAND (op
, 2) != NULL_TREE
12257 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12261 case COMPONENT_REF
:
12262 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12268 op
= TREE_OPERAND (op
, 0);
12274 static GTY(()) tree gcc_eh_personality_decl
;
12276 /* Return the GCC personality function decl. */
12279 lhd_gcc_personality (void)
12281 if (!gcc_eh_personality_decl
)
12282 gcc_eh_personality_decl
= build_personality_function ("gcc");
12283 return gcc_eh_personality_decl
;
12286 /* TARGET is a call target of GIMPLE call statement
12287 (obtained by gimple_call_fn). Return true if it is
12288 OBJ_TYPE_REF representing an virtual call of C++ method.
12289 (As opposed to OBJ_TYPE_REF representing objc calls
12290 through a cast where middle-end devirtualization machinery
12294 virtual_method_call_p (const_tree target
)
12296 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12298 tree t
= TREE_TYPE (target
);
12299 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12301 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12303 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12304 /* If we do not have BINFO associated, it means that type was built
12305 without devirtualization enabled. Do not consider this a virtual
12307 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12312 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12315 obj_type_ref_class (const_tree ref
)
12317 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12318 ref
= TREE_TYPE (ref
);
12319 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12320 ref
= TREE_TYPE (ref
);
12321 /* We look for type THIS points to. ObjC also builds
12322 OBJ_TYPE_REF with non-method calls, Their first parameter
12323 ID however also corresponds to class type. */
12324 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12325 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12326 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12327 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12328 return TREE_TYPE (ref
);
12331 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12334 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12337 tree base_binfo
, b
;
12339 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12340 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12341 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12343 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12348 /* Try to find a base info of BINFO that would have its field decl at offset
12349 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12350 found, return, otherwise return NULL_TREE. */
12353 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12355 tree type
= BINFO_TYPE (binfo
);
12359 HOST_WIDE_INT pos
, size
;
12363 if (types_same_for_odr (type
, expected_type
))
12368 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12370 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12373 pos
= int_bit_position (fld
);
12374 size
= tree_to_uhwi (DECL_SIZE (fld
));
12375 if (pos
<= offset
&& (pos
+ size
) > offset
)
12378 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12381 /* Offset 0 indicates the primary base, whose vtable contents are
12382 represented in the binfo for the derived class. */
12383 else if (offset
!= 0)
12385 tree found_binfo
= NULL
, base_binfo
;
12386 /* Offsets in BINFO are in bytes relative to the whole structure
12387 while POS is in bits relative to the containing field. */
12388 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12391 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12392 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12393 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12395 found_binfo
= base_binfo
;
12399 binfo
= found_binfo
;
12401 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12405 type
= TREE_TYPE (fld
);
12410 /* Returns true if X is a typedef decl. */
12413 is_typedef_decl (const_tree x
)
12415 return (x
&& TREE_CODE (x
) == TYPE_DECL
12416 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12419 /* Returns true iff TYPE is a type variant created for a typedef. */
12422 typedef_variant_p (const_tree type
)
12424 return is_typedef_decl (TYPE_NAME (type
));
12427 /* Warn about a use of an identifier which was marked deprecated. */
12429 warn_deprecated_use (tree node
, tree attr
)
12433 if (node
== 0 || !warn_deprecated_decl
)
12439 attr
= DECL_ATTRIBUTES (node
);
12440 else if (TYPE_P (node
))
12442 tree decl
= TYPE_STUB_DECL (node
);
12444 attr
= lookup_attribute ("deprecated",
12445 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12450 attr
= lookup_attribute ("deprecated", attr
);
12453 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12461 w
= warning (OPT_Wdeprecated_declarations
,
12462 "%qD is deprecated: %s", node
, msg
);
12464 w
= warning (OPT_Wdeprecated_declarations
,
12465 "%qD is deprecated", node
);
12467 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12469 else if (TYPE_P (node
))
12471 tree what
= NULL_TREE
;
12472 tree decl
= TYPE_STUB_DECL (node
);
12474 if (TYPE_NAME (node
))
12476 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12477 what
= TYPE_NAME (node
);
12478 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12479 && DECL_NAME (TYPE_NAME (node
)))
12480 what
= DECL_NAME (TYPE_NAME (node
));
12488 w
= warning (OPT_Wdeprecated_declarations
,
12489 "%qE is deprecated: %s", what
, msg
);
12491 w
= warning (OPT_Wdeprecated_declarations
,
12492 "%qE is deprecated", what
);
12497 w
= warning (OPT_Wdeprecated_declarations
,
12498 "type is deprecated: %s", msg
);
12500 w
= warning (OPT_Wdeprecated_declarations
,
12501 "type is deprecated");
12504 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12511 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12514 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12519 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12522 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12528 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12529 somewhere in it. */
12532 contains_bitfld_component_ref_p (const_tree ref
)
12534 while (handled_component_p (ref
))
12536 if (TREE_CODE (ref
) == COMPONENT_REF
12537 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12539 ref
= TREE_OPERAND (ref
, 0);
12545 /* Try to determine whether a TRY_CATCH expression can fall through.
12546 This is a subroutine of block_may_fallthru. */
12549 try_catch_may_fallthru (const_tree stmt
)
12551 tree_stmt_iterator i
;
12553 /* If the TRY block can fall through, the whole TRY_CATCH can
12555 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12558 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12559 switch (TREE_CODE (tsi_stmt (i
)))
12562 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12563 catch expression and a body. The whole TRY_CATCH may fall
12564 through iff any of the catch bodies falls through. */
12565 for (; !tsi_end_p (i
); tsi_next (&i
))
12567 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12572 case EH_FILTER_EXPR
:
12573 /* The exception filter expression only matters if there is an
12574 exception. If the exception does not match EH_FILTER_TYPES,
12575 we will execute EH_FILTER_FAILURE, and we will fall through
12576 if that falls through. If the exception does match
12577 EH_FILTER_TYPES, the stack unwinder will continue up the
12578 stack, so we will not fall through. We don't know whether we
12579 will throw an exception which matches EH_FILTER_TYPES or not,
12580 so we just ignore EH_FILTER_TYPES and assume that we might
12581 throw an exception which doesn't match. */
12582 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12585 /* This case represents statements to be executed when an
12586 exception occurs. Those statements are implicitly followed
12587 by a RESX statement to resume execution after the exception.
12588 So in this case the TRY_CATCH never falls through. */
12593 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12594 need not be 100% accurate; simply be conservative and return true if we
12595 don't know. This is used only to avoid stupidly generating extra code.
12596 If we're wrong, we'll just delete the extra code later. */
12599 block_may_fallthru (const_tree block
)
12601 /* This CONST_CAST is okay because expr_last returns its argument
12602 unmodified and we assign it to a const_tree. */
12603 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12605 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12609 /* Easy cases. If the last statement of the block implies
12610 control transfer, then we can't fall through. */
12614 /* If there is a default: label or case labels cover all possible
12615 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12616 to some case label in all cases and all we care is whether the
12617 SWITCH_BODY falls through. */
12618 if (SWITCH_ALL_CASES_P (stmt
))
12619 return block_may_fallthru (SWITCH_BODY (stmt
));
12623 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12625 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12628 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12630 case TRY_CATCH_EXPR
:
12631 return try_catch_may_fallthru (stmt
);
12633 case TRY_FINALLY_EXPR
:
12634 /* The finally clause is always executed after the try clause,
12635 so if it does not fall through, then the try-finally will not
12636 fall through. Otherwise, if the try clause does not fall
12637 through, then when the finally clause falls through it will
12638 resume execution wherever the try clause was going. So the
12639 whole try-finally will only fall through if both the try
12640 clause and the finally clause fall through. */
12641 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12642 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12645 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12646 stmt
= TREE_OPERAND (stmt
, 1);
12652 /* Functions that do not return do not fall through. */
12653 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12655 case CLEANUP_POINT_EXPR
:
12656 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12659 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12665 return lang_hooks
.block_may_fallthru (stmt
);
12669 /* True if we are using EH to handle cleanups. */
12670 static bool using_eh_for_cleanups_flag
= false;
12672 /* This routine is called from front ends to indicate eh should be used for
12675 using_eh_for_cleanups (void)
12677 using_eh_for_cleanups_flag
= true;
12680 /* Query whether EH is used for cleanups. */
12682 using_eh_for_cleanups_p (void)
12684 return using_eh_for_cleanups_flag
;
12687 /* Wrapper for tree_code_name to ensure that tree code is valid */
12689 get_tree_code_name (enum tree_code code
)
12691 const char *invalid
= "<invalid tree code>";
12693 if (code
>= MAX_TREE_CODES
)
12696 return tree_code_name
[code
];
12699 /* Drops the TREE_OVERFLOW flag from T. */
12702 drop_tree_overflow (tree t
)
12704 gcc_checking_assert (TREE_OVERFLOW (t
));
12706 /* For tree codes with a sharing machinery re-build the result. */
12707 if (poly_int_tree_p (t
))
12708 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
12710 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12711 and canonicalize the result. */
12712 if (TREE_CODE (t
) == VECTOR_CST
)
12714 tree_vector_builder builder
;
12715 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12716 unsigned int count
= builder
.encoded_nelts ();
12717 for (unsigned int i
= 0; i
< count
; ++i
)
12719 tree elt
= VECTOR_CST_ELT (t
, i
);
12720 if (TREE_OVERFLOW (elt
))
12721 elt
= drop_tree_overflow (elt
);
12722 builder
.quick_push (elt
);
12724 return builder
.build ();
12727 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12728 and drop the flag. */
12730 TREE_OVERFLOW (t
) = 0;
12732 /* For constants that contain nested constants, drop the flag
12733 from those as well. */
12734 if (TREE_CODE (t
) == COMPLEX_CST
)
12736 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12737 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12738 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12739 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12745 /* Given a memory reference expression T, return its base address.
12746 The base address of a memory reference expression is the main
12747 object being referenced. For instance, the base address for
12748 'array[i].fld[j]' is 'array'. You can think of this as stripping
12749 away the offset part from a memory address.
12751 This function calls handled_component_p to strip away all the inner
12752 parts of the memory reference until it reaches the base object. */
12755 get_base_address (tree t
)
12757 while (handled_component_p (t
))
12758 t
= TREE_OPERAND (t
, 0);
12760 if ((TREE_CODE (t
) == MEM_REF
12761 || TREE_CODE (t
) == TARGET_MEM_REF
)
12762 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12763 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12765 /* ??? Either the alias oracle or all callers need to properly deal
12766 with WITH_SIZE_EXPRs before we can look through those. */
12767 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12773 /* Return a tree of sizetype representing the size, in bytes, of the element
12774 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12777 array_ref_element_size (tree exp
)
12779 tree aligned_size
= TREE_OPERAND (exp
, 3);
12780 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12781 location_t loc
= EXPR_LOCATION (exp
);
12783 /* If a size was specified in the ARRAY_REF, it's the size measured
12784 in alignment units of the element type. So multiply by that value. */
12787 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12788 sizetype from another type of the same width and signedness. */
12789 if (TREE_TYPE (aligned_size
) != sizetype
)
12790 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12791 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12792 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12795 /* Otherwise, take the size from that of the element type. Substitute
12796 any PLACEHOLDER_EXPR that we have. */
12798 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12801 /* Return a tree representing the lower bound of the array mentioned in
12802 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12805 array_ref_low_bound (tree exp
)
12807 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12809 /* If a lower bound is specified in EXP, use it. */
12810 if (TREE_OPERAND (exp
, 2))
12811 return TREE_OPERAND (exp
, 2);
12813 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12814 substituting for a PLACEHOLDER_EXPR as needed. */
12815 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12816 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12818 /* Otherwise, return a zero of the appropriate type. */
12819 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12822 /* Return a tree representing the upper bound of the array mentioned in
12823 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12826 array_ref_up_bound (tree exp
)
12828 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12830 /* If there is a domain type and it has an upper bound, use it, substituting
12831 for a PLACEHOLDER_EXPR as needed. */
12832 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12833 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12835 /* Otherwise fail. */
12839 /* Returns true if REF is an array reference or a component reference
12840 to an array at the end of a structure.
12841 If this is the case, the array may be allocated larger
12842 than its upper bound implies. */
12845 array_at_struct_end_p (tree ref
)
12849 if (TREE_CODE (ref
) == ARRAY_REF
12850 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12852 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12853 ref
= TREE_OPERAND (ref
, 0);
12855 else if (TREE_CODE (ref
) == COMPONENT_REF
12856 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12857 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12861 if (TREE_CODE (ref
) == STRING_CST
)
12864 tree ref_to_array
= ref
;
12865 while (handled_component_p (ref
))
12867 /* If the reference chain contains a component reference to a
12868 non-union type and there follows another field the reference
12869 is not at the end of a structure. */
12870 if (TREE_CODE (ref
) == COMPONENT_REF
)
12872 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12874 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12875 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12876 nextf
= DECL_CHAIN (nextf
);
12881 /* If we have a multi-dimensional array we do not consider
12882 a non-innermost dimension as flex array if the whole
12883 multi-dimensional array is at struct end.
12884 Same for an array of aggregates with a trailing array
12886 else if (TREE_CODE (ref
) == ARRAY_REF
)
12888 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12890 /* If we view an underlying object as sth else then what we
12891 gathered up to now is what we have to rely on. */
12892 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12895 gcc_unreachable ();
12897 ref
= TREE_OPERAND (ref
, 0);
12900 /* The array now is at struct end. Treat flexible arrays as
12901 always subject to extend, even into just padding constrained by
12902 an underlying decl. */
12903 if (! TYPE_SIZE (atype
)
12904 || ! TYPE_DOMAIN (atype
)
12905 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12908 if (TREE_CODE (ref
) == MEM_REF
12909 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12910 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12912 /* If the reference is based on a declared entity, the size of the array
12913 is constrained by its given domain. (Do not trust commons PR/69368). */
12915 && !(flag_unconstrained_commons
12916 && VAR_P (ref
) && DECL_COMMON (ref
))
12917 && DECL_SIZE_UNIT (ref
)
12918 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
12920 /* Check whether the array domain covers all of the available
12923 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
12924 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
12925 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
12927 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
12930 /* If at least one extra element fits it is a flexarray. */
12931 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
12932 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
12934 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
12935 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
12944 /* Return a tree representing the offset, in bytes, of the field referenced
12945 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12948 component_ref_field_offset (tree exp
)
12950 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12951 tree field
= TREE_OPERAND (exp
, 1);
12952 location_t loc
= EXPR_LOCATION (exp
);
12954 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12955 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12957 if (aligned_offset
)
12959 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12960 sizetype from another type of the same width and signedness. */
12961 if (TREE_TYPE (aligned_offset
) != sizetype
)
12962 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12963 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12964 size_int (DECL_OFFSET_ALIGN (field
)
12968 /* Otherwise, take the offset from that of the field. Substitute
12969 any PLACEHOLDER_EXPR that we have. */
12971 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
12974 /* Return the machine mode of T. For vectors, returns the mode of the
12975 inner type. The main use case is to feed the result to HONOR_NANS,
12976 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12979 element_mode (const_tree t
)
12983 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12985 return TYPE_MODE (t
);
12988 /* Vector types need to re-check the target flags each time we report
12989 the machine mode. We need to do this because attribute target can
12990 change the result of vector_mode_supported_p and have_regs_of_mode
12991 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12992 change on a per-function basis. */
12993 /* ??? Possibly a better solution is to run through all the types
12994 referenced by a function and re-compute the TYPE_MODE once, rather
12995 than make the TYPE_MODE macro call a function. */
12998 vector_type_mode (const_tree t
)
13002 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13004 mode
= t
->type_common
.mode
;
13005 if (VECTOR_MODE_P (mode
)
13006 && (!targetm
.vector_mode_supported_p (mode
)
13007 || !have_regs_of_mode
[mode
]))
13009 scalar_int_mode innermode
;
13011 /* For integers, try mapping it to a same-sized scalar mode. */
13012 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13014 unsigned int size
= (TYPE_VECTOR_SUBPARTS (t
)
13015 * GET_MODE_BITSIZE (innermode
));
13016 scalar_int_mode mode
;
13017 if (int_mode_for_size (size
, 0).exists (&mode
)
13018 && have_regs_of_mode
[mode
])
13028 /* Verify that basic properties of T match TV and thus T can be a variant of
13029 TV. TV should be the more specified variant (i.e. the main variant). */
13032 verify_type_variant (const_tree t
, tree tv
)
13034 /* Type variant can differ by:
13036 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13037 ENCODE_QUAL_ADDR_SPACE.
13038 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13039 in this case some values may not be set in the variant types
13040 (see TYPE_COMPLETE_P checks).
13041 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13042 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13043 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13044 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13045 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13046 this is necessary to make it possible to merge types form different TUs
13047 - arrays, pointers and references may have TREE_TYPE that is a variant
13048 of TREE_TYPE of their main variants.
13049 - aggregates may have new TYPE_FIELDS list that list variants of
13050 the main variant TYPE_FIELDS.
13051 - vector types may differ by TYPE_VECTOR_OPAQUE
13054 /* Convenience macro for matching individual fields. */
13055 #define verify_variant_match(flag) \
13057 if (flag (tv) != flag (t)) \
13059 error ("type variant differs by " #flag "."); \
13065 /* tree_base checks. */
13067 verify_variant_match (TREE_CODE
);
13068 /* FIXME: Ada builds non-artificial variants of artificial types. */
13069 if (TYPE_ARTIFICIAL (tv
) && 0)
13070 verify_variant_match (TYPE_ARTIFICIAL
);
13071 if (POINTER_TYPE_P (tv
))
13072 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13073 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13074 verify_variant_match (TYPE_UNSIGNED
);
13075 verify_variant_match (TYPE_PACKED
);
13076 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13077 verify_variant_match (TYPE_REF_IS_RVALUE
);
13078 if (AGGREGATE_TYPE_P (t
))
13079 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13081 verify_variant_match (TYPE_SATURATING
);
13082 /* FIXME: This check trigger during libstdc++ build. */
13083 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13084 verify_variant_match (TYPE_FINAL_P
);
13086 /* tree_type_common checks. */
13088 if (COMPLETE_TYPE_P (t
))
13090 verify_variant_match (TYPE_MODE
);
13091 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13092 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13093 verify_variant_match (TYPE_SIZE
);
13094 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13095 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13096 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13098 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13099 TYPE_SIZE_UNIT (tv
), 0));
13100 error ("type variant has different TYPE_SIZE_UNIT");
13102 error ("type variant's TYPE_SIZE_UNIT");
13103 debug_tree (TYPE_SIZE_UNIT (tv
));
13104 error ("type's TYPE_SIZE_UNIT");
13105 debug_tree (TYPE_SIZE_UNIT (t
));
13109 verify_variant_match (TYPE_PRECISION
);
13110 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13111 if (RECORD_OR_UNION_TYPE_P (t
))
13112 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13113 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13114 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13115 /* During LTO we merge variant lists from diferent translation units
13116 that may differ BY TYPE_CONTEXT that in turn may point
13117 to TRANSLATION_UNIT_DECL.
13118 Ada also builds variants of types with different TYPE_CONTEXT. */
13119 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13120 verify_variant_match (TYPE_CONTEXT
);
13121 verify_variant_match (TYPE_STRING_FLAG
);
13122 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13124 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13129 /* tree_type_non_common checks. */
13131 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13132 and dangle the pointer from time to time. */
13133 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13134 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13135 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13137 error ("type variant has different TYPE_VFIELD");
13141 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13142 || TREE_CODE (t
) == INTEGER_TYPE
13143 || TREE_CODE (t
) == BOOLEAN_TYPE
13144 || TREE_CODE (t
) == REAL_TYPE
13145 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13147 verify_variant_match (TYPE_MAX_VALUE
);
13148 verify_variant_match (TYPE_MIN_VALUE
);
13150 if (TREE_CODE (t
) == METHOD_TYPE
)
13151 verify_variant_match (TYPE_METHOD_BASETYPE
);
13152 if (TREE_CODE (t
) == OFFSET_TYPE
)
13153 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13154 if (TREE_CODE (t
) == ARRAY_TYPE
)
13155 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13156 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13157 or even type's main variant. This is needed to make bootstrap pass
13158 and the bug seems new in GCC 5.
13159 C++ FE should be updated to make this consistent and we should check
13160 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13161 is a match with main variant.
13163 Also disable the check for Java for now because of parser hack that builds
13164 first an dummy BINFO and then sometimes replace it by real BINFO in some
13166 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13167 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13168 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13169 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13170 at LTO time only. */
13171 && (in_lto_p
&& odr_type_p (t
)))
13173 error ("type variant has different TYPE_BINFO");
13175 error ("type variant's TYPE_BINFO");
13176 debug_tree (TYPE_BINFO (tv
));
13177 error ("type's TYPE_BINFO");
13178 debug_tree (TYPE_BINFO (t
));
13182 /* Check various uses of TYPE_VALUES_RAW. */
13183 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13184 verify_variant_match (TYPE_VALUES
);
13185 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13186 verify_variant_match (TYPE_DOMAIN
);
13187 /* Permit incomplete variants of complete type. While FEs may complete
13188 all variants, this does not happen for C++ templates in all cases. */
13189 else if (RECORD_OR_UNION_TYPE_P (t
)
13190 && COMPLETE_TYPE_P (t
)
13191 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13195 /* Fortran builds qualified variants as new records with items of
13196 qualified type. Verify that they looks same. */
13197 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13199 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13200 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13201 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13202 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13203 /* FIXME: gfc_nonrestricted_type builds all types as variants
13204 with exception of pointer types. It deeply copies the type
13205 which means that we may end up with a variant type
13206 referring non-variant pointer. We may change it to
13207 produce types as variants, too, like
13208 objc_get_protocol_qualified_type does. */
13209 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13210 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13211 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13215 error ("type variant has different TYPE_FIELDS");
13217 error ("first mismatch is field");
13219 error ("and field");
13224 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13225 verify_variant_match (TYPE_ARG_TYPES
);
13226 /* For C++ the qualified variant of array type is really an array type
13227 of qualified TREE_TYPE.
13228 objc builds variants of pointer where pointer to type is a variant, too
13229 in objc_get_protocol_qualified_type. */
13230 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13231 && ((TREE_CODE (t
) != ARRAY_TYPE
13232 && !POINTER_TYPE_P (t
))
13233 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13234 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13236 error ("type variant has different TREE_TYPE");
13238 error ("type variant's TREE_TYPE");
13239 debug_tree (TREE_TYPE (tv
));
13240 error ("type's TREE_TYPE");
13241 debug_tree (TREE_TYPE (t
));
13244 if (type_with_alias_set_p (t
)
13245 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13247 error ("type is not compatible with its variant");
13249 error ("type variant's TREE_TYPE");
13250 debug_tree (TREE_TYPE (tv
));
13251 error ("type's TREE_TYPE");
13252 debug_tree (TREE_TYPE (t
));
13256 #undef verify_variant_match
13260 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13261 the middle-end types_compatible_p function. It needs to avoid
13262 claiming types are different for types that should be treated
13263 the same with respect to TBAA. Canonical types are also used
13264 for IL consistency checks via the useless_type_conversion_p
13265 predicate which does not handle all type kinds itself but falls
13266 back to pointer-comparison of TYPE_CANONICAL for aggregates
13269 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13270 type calculation because we need to allow inter-operability between signed
13271 and unsigned variants. */
13274 type_with_interoperable_signedness (const_tree type
)
13276 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13277 signed char and unsigned char. Similarly fortran FE builds
13278 C_SIZE_T as signed type, while C defines it unsigned. */
13280 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13282 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13283 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13286 /* Return true iff T1 and T2 are structurally identical for what
13288 This function is used both by lto.c canonical type merging and by the
13289 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13290 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13291 only for LTO because only in these cases TYPE_CANONICAL equivalence
13292 correspond to one defined by gimple_canonical_types_compatible_p. */
13295 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13296 bool trust_type_canonical
)
13298 /* Type variants should be same as the main variant. When not doing sanity
13299 checking to verify this fact, go to main variants and save some work. */
13300 if (trust_type_canonical
)
13302 t1
= TYPE_MAIN_VARIANT (t1
);
13303 t2
= TYPE_MAIN_VARIANT (t2
);
13306 /* Check first for the obvious case of pointer identity. */
13310 /* Check that we have two types to compare. */
13311 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13314 /* We consider complete types always compatible with incomplete type.
13315 This does not make sense for canonical type calculation and thus we
13316 need to ensure that we are never called on it.
13318 FIXME: For more correctness the function probably should have three modes
13319 1) mode assuming that types are complete mathcing their structure
13320 2) mode allowing incomplete types but producing equivalence classes
13321 and thus ignoring all info from complete types
13322 3) mode allowing incomplete types to match complete but checking
13323 compatibility between complete types.
13325 1 and 2 can be used for canonical type calculation. 3 is the real
13326 definition of type compatibility that can be used i.e. for warnings during
13327 declaration merging. */
13329 gcc_assert (!trust_type_canonical
13330 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13331 /* If the types have been previously registered and found equal
13334 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13335 && trust_type_canonical
)
13337 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13338 they are always NULL, but they are set to non-NULL for types
13339 constructed by build_pointer_type and variants. In this case the
13340 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13341 all pointers are considered equal. Be sure to not return false
13343 gcc_checking_assert (canonical_type_used_p (t1
)
13344 && canonical_type_used_p (t2
));
13345 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13348 /* Can't be the same type if the types don't have the same code. */
13349 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13350 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13353 /* Qualifiers do not matter for canonical type comparison purposes. */
13355 /* Void types and nullptr types are always the same. */
13356 if (TREE_CODE (t1
) == VOID_TYPE
13357 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13360 /* Can't be the same type if they have different mode. */
13361 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13364 /* Non-aggregate types can be handled cheaply. */
13365 if (INTEGRAL_TYPE_P (t1
)
13366 || SCALAR_FLOAT_TYPE_P (t1
)
13367 || FIXED_POINT_TYPE_P (t1
)
13368 || TREE_CODE (t1
) == VECTOR_TYPE
13369 || TREE_CODE (t1
) == COMPLEX_TYPE
13370 || TREE_CODE (t1
) == OFFSET_TYPE
13371 || POINTER_TYPE_P (t1
))
13373 /* Can't be the same type if they have different recision. */
13374 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13377 /* In some cases the signed and unsigned types are required to be
13379 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13380 && !type_with_interoperable_signedness (t1
))
13383 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13384 interoperable with "signed char". Unless all frontends are revisited
13385 to agree on these types, we must ignore the flag completely. */
13387 /* Fortran standard define C_PTR type that is compatible with every
13388 C pointer. For this reason we need to glob all pointers into one.
13389 Still pointers in different address spaces are not compatible. */
13390 if (POINTER_TYPE_P (t1
))
13392 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13393 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13397 /* Tail-recurse to components. */
13398 if (TREE_CODE (t1
) == VECTOR_TYPE
13399 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13400 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13402 trust_type_canonical
);
13407 /* Do type-specific comparisons. */
13408 switch (TREE_CODE (t1
))
13411 /* Array types are the same if the element types are the same and
13412 the number of elements are the same. */
13413 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13414 trust_type_canonical
)
13415 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13416 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13417 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13421 tree i1
= TYPE_DOMAIN (t1
);
13422 tree i2
= TYPE_DOMAIN (t2
);
13424 /* For an incomplete external array, the type domain can be
13425 NULL_TREE. Check this condition also. */
13426 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13428 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13432 tree min1
= TYPE_MIN_VALUE (i1
);
13433 tree min2
= TYPE_MIN_VALUE (i2
);
13434 tree max1
= TYPE_MAX_VALUE (i1
);
13435 tree max2
= TYPE_MAX_VALUE (i2
);
13437 /* The minimum/maximum values have to be the same. */
13440 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13441 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13442 || operand_equal_p (min1
, min2
, 0))))
13445 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13446 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13447 || operand_equal_p (max1
, max2
, 0)))))
13455 case FUNCTION_TYPE
:
13456 /* Function types are the same if the return type and arguments types
13458 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13459 trust_type_canonical
))
13462 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13466 tree parms1
, parms2
;
13468 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13470 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13472 if (!gimple_canonical_types_compatible_p
13473 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13474 trust_type_canonical
))
13478 if (parms1
|| parms2
)
13486 case QUAL_UNION_TYPE
:
13490 /* Don't try to compare variants of an incomplete type, before
13491 TYPE_FIELDS has been copied around. */
13492 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13496 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13499 /* For aggregate types, all the fields must be the same. */
13500 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13502 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13504 /* Skip non-fields and zero-sized fields. */
13505 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13507 && integer_zerop (DECL_SIZE (f1
)))))
13508 f1
= TREE_CHAIN (f1
);
13509 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13511 && integer_zerop (DECL_SIZE (f2
)))))
13512 f2
= TREE_CHAIN (f2
);
13515 /* The fields must have the same name, offset and type. */
13516 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13517 || !gimple_compare_field_offset (f1
, f2
)
13518 || !gimple_canonical_types_compatible_p
13519 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13520 trust_type_canonical
))
13524 /* If one aggregate has more fields than the other, they
13525 are not the same. */
13533 /* Consider all types with language specific trees in them mutually
13534 compatible. This is executed only from verify_type and false
13535 positives can be tolerated. */
13536 gcc_assert (!in_lto_p
);
13541 /* Verify type T. */
13544 verify_type (const_tree t
)
13546 bool error_found
= false;
13547 tree mv
= TYPE_MAIN_VARIANT (t
);
13550 error ("Main variant is not defined");
13551 error_found
= true;
13553 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13555 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13557 error_found
= true;
13559 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13560 error_found
= true;
13562 tree ct
= TYPE_CANONICAL (t
);
13565 else if (TYPE_CANONICAL (t
) != ct
)
13567 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13569 error_found
= true;
13571 /* Method and function types can not be used to address memory and thus
13572 TYPE_CANONICAL really matters only for determining useless conversions.
13574 FIXME: C++ FE produce declarations of builtin functions that are not
13575 compatible with main variants. */
13576 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13579 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13580 with variably sized arrays because their sizes possibly
13581 gimplified to different variables. */
13582 && !variably_modified_type_p (ct
, NULL
)
13583 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13585 error ("TYPE_CANONICAL is not compatible");
13587 error_found
= true;
13590 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13591 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13593 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13595 error_found
= true;
13597 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13599 error ("TYPE_CANONICAL of main variant is not main variant");
13601 debug_tree (TYPE_MAIN_VARIANT (ct
));
13602 error_found
= true;
13606 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13607 if (RECORD_OR_UNION_TYPE_P (t
))
13609 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13610 and danagle the pointer from time to time. */
13611 if (TYPE_VFIELD (t
)
13612 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13613 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13615 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13616 debug_tree (TYPE_VFIELD (t
));
13617 error_found
= true;
13620 else if (TREE_CODE (t
) == POINTER_TYPE
)
13622 if (TYPE_NEXT_PTR_TO (t
)
13623 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13625 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13626 debug_tree (TYPE_NEXT_PTR_TO (t
));
13627 error_found
= true;
13630 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13632 if (TYPE_NEXT_REF_TO (t
)
13633 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13635 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13636 debug_tree (TYPE_NEXT_REF_TO (t
));
13637 error_found
= true;
13640 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13641 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13643 /* FIXME: The following check should pass:
13644 useless_type_conversion_p (const_cast <tree> (t),
13645 TREE_TYPE (TYPE_MIN_VALUE (t))
13646 but does not for C sizetypes in LTO. */
13649 /* Check various uses of TYPE_MAXVAL_RAW. */
13650 if (RECORD_OR_UNION_TYPE_P (t
))
13652 if (!TYPE_BINFO (t
))
13654 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13656 error ("TYPE_BINFO is not TREE_BINFO");
13657 debug_tree (TYPE_BINFO (t
));
13658 error_found
= true;
13660 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13662 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13663 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13664 error_found
= true;
13667 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13669 if (TYPE_METHOD_BASETYPE (t
)
13670 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13671 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13673 error ("TYPE_METHOD_BASETYPE is not record nor union");
13674 debug_tree (TYPE_METHOD_BASETYPE (t
));
13675 error_found
= true;
13678 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13680 if (TYPE_OFFSET_BASETYPE (t
)
13681 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13682 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13684 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13685 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13686 error_found
= true;
13689 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13690 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13692 /* FIXME: The following check should pass:
13693 useless_type_conversion_p (const_cast <tree> (t),
13694 TREE_TYPE (TYPE_MAX_VALUE (t))
13695 but does not for C sizetypes in LTO. */
13697 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13699 if (TYPE_ARRAY_MAX_SIZE (t
)
13700 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13702 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13703 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13704 error_found
= true;
13707 else if (TYPE_MAX_VALUE_RAW (t
))
13709 error ("TYPE_MAX_VALUE_RAW non-NULL");
13710 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13711 error_found
= true;
13714 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13716 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13717 debug_tree (TYPE_LANG_SLOT_1 (t
));
13718 error_found
= true;
13721 /* Check various uses of TYPE_VALUES_RAW. */
13722 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13723 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13725 tree value
= TREE_VALUE (l
);
13726 tree name
= TREE_PURPOSE (l
);
13728 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13729 CONST_DECL of ENUMERAL TYPE. */
13730 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13732 error ("Enum value is not CONST_DECL or INTEGER_CST");
13733 debug_tree (value
);
13735 error_found
= true;
13737 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13738 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13740 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13741 debug_tree (value
);
13743 error_found
= true;
13745 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13747 error ("Enum value name is not IDENTIFIER_NODE");
13748 debug_tree (value
);
13750 error_found
= true;
13753 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13755 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13757 error ("Array TYPE_DOMAIN is not integer type");
13758 debug_tree (TYPE_DOMAIN (t
));
13759 error_found
= true;
13762 else if (RECORD_OR_UNION_TYPE_P (t
))
13764 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13766 error ("TYPE_FIELDS defined in incomplete type");
13767 error_found
= true;
13769 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13771 /* TODO: verify properties of decls. */
13772 if (TREE_CODE (fld
) == FIELD_DECL
)
13774 else if (TREE_CODE (fld
) == TYPE_DECL
)
13776 else if (TREE_CODE (fld
) == CONST_DECL
)
13778 else if (VAR_P (fld
))
13780 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13782 else if (TREE_CODE (fld
) == USING_DECL
)
13784 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13788 error ("Wrong tree in TYPE_FIELDS list");
13790 error_found
= true;
13794 else if (TREE_CODE (t
) == INTEGER_TYPE
13795 || TREE_CODE (t
) == BOOLEAN_TYPE
13796 || TREE_CODE (t
) == OFFSET_TYPE
13797 || TREE_CODE (t
) == REFERENCE_TYPE
13798 || TREE_CODE (t
) == NULLPTR_TYPE
13799 || TREE_CODE (t
) == POINTER_TYPE
)
13801 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13803 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13804 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13805 error_found
= true;
13807 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13809 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13810 debug_tree (TYPE_CACHED_VALUES (t
));
13811 error_found
= true;
13813 /* Verify just enough of cache to ensure that no one copied it to new type.
13814 All copying should go by copy_node that should clear it. */
13815 else if (TYPE_CACHED_VALUES_P (t
))
13818 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13819 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13820 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13822 error ("wrong TYPE_CACHED_VALUES entry");
13823 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13824 error_found
= true;
13829 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13830 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13832 /* C++ FE uses TREE_PURPOSE to store initial values. */
13833 if (TREE_PURPOSE (l
) && in_lto_p
)
13835 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13837 error_found
= true;
13839 if (!TYPE_P (TREE_VALUE (l
)))
13841 error ("Wrong entry in TYPE_ARG_TYPES list");
13843 error_found
= true;
13846 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13848 error ("TYPE_VALUES_RAW field is non-NULL");
13849 debug_tree (TYPE_VALUES_RAW (t
));
13850 error_found
= true;
13852 if (TREE_CODE (t
) != INTEGER_TYPE
13853 && TREE_CODE (t
) != BOOLEAN_TYPE
13854 && TREE_CODE (t
) != OFFSET_TYPE
13855 && TREE_CODE (t
) != REFERENCE_TYPE
13856 && TREE_CODE (t
) != NULLPTR_TYPE
13857 && TREE_CODE (t
) != POINTER_TYPE
13858 && TYPE_CACHED_VALUES_P (t
))
13860 error ("TYPE_CACHED_VALUES_P is set while it should not");
13861 error_found
= true;
13863 if (TYPE_STRING_FLAG (t
)
13864 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13866 error ("TYPE_STRING_FLAG is set on wrong type code");
13867 error_found
= true;
13870 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13871 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13873 if (TREE_CODE (t
) == METHOD_TYPE
13874 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13876 error ("TYPE_METHOD_BASETYPE is not main variant");
13877 error_found
= true;
13882 debug_tree (const_cast <tree
> (t
));
13883 internal_error ("verify_type failed");
13888 /* Return 1 if ARG interpreted as signed in its precision is known to be
13889 always positive or 2 if ARG is known to be always negative, or 3 if
13890 ARG may be positive or negative. */
13893 get_range_pos_neg (tree arg
)
13895 if (arg
== error_mark_node
)
13898 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13900 if (TREE_CODE (arg
) == INTEGER_CST
)
13902 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
13908 while (CONVERT_EXPR_P (arg
)
13909 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13910 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13912 arg
= TREE_OPERAND (arg
, 0);
13913 /* Narrower value zero extended into wider type
13914 will always result in positive values. */
13915 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13916 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13918 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13923 if (TREE_CODE (arg
) != SSA_NAME
)
13925 wide_int arg_min
, arg_max
;
13926 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13928 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13929 if (is_gimple_assign (g
)
13930 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13932 tree t
= gimple_assign_rhs1 (g
);
13933 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13934 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13936 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13937 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13939 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13948 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13950 /* For unsigned values, the "positive" range comes
13951 below the "negative" range. */
13952 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13954 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13959 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13961 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13970 /* Return true if ARG is marked with the nonnull attribute in the
13971 current function signature. */
13974 nonnull_arg_p (const_tree arg
)
13976 tree t
, attrs
, fntype
;
13977 unsigned HOST_WIDE_INT arg_num
;
13979 gcc_assert (TREE_CODE (arg
) == PARM_DECL
13980 && (POINTER_TYPE_P (TREE_TYPE (arg
))
13981 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
13983 /* The static chain decl is always non null. */
13984 if (arg
== cfun
->static_chain_decl
)
13987 /* THIS argument of method is always non-NULL. */
13988 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
13989 && arg
== DECL_ARGUMENTS (cfun
->decl
)
13990 && flag_delete_null_pointer_checks
)
13993 /* Values passed by reference are always non-NULL. */
13994 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
13995 && flag_delete_null_pointer_checks
)
13998 fntype
= TREE_TYPE (cfun
->decl
);
13999 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14001 attrs
= lookup_attribute ("nonnull", attrs
);
14003 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14004 if (attrs
== NULL_TREE
)
14007 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14008 if (TREE_VALUE (attrs
) == NULL_TREE
)
14011 /* Get the position number for ARG in the function signature. */
14012 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14014 t
= DECL_CHAIN (t
), arg_num
++)
14020 gcc_assert (t
== arg
);
14022 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14023 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14025 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14033 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14037 set_block (location_t loc
, tree block
)
14039 location_t pure_loc
= get_pure_location (loc
);
14040 source_range src_range
= get_range_from_loc (line_table
, loc
);
14041 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14045 set_source_range (tree expr
, location_t start
, location_t finish
)
14047 source_range src_range
;
14048 src_range
.m_start
= start
;
14049 src_range
.m_finish
= finish
;
14050 return set_source_range (expr
, src_range
);
14054 set_source_range (tree expr
, source_range src_range
)
14056 if (!EXPR_P (expr
))
14057 return UNKNOWN_LOCATION
;
14059 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14060 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14064 SET_EXPR_LOCATION (expr
, adhoc
);
14068 /* Return the name of combined function FN, for debugging purposes. */
14071 combined_fn_name (combined_fn fn
)
14073 if (builtin_fn_p (fn
))
14075 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14076 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14079 return internal_fn_name (as_internal_fn (fn
));
14082 /* Return a bitmap with a bit set corresponding to each argument in
14083 a function call type FNTYPE declared with attribute nonnull,
14084 or null if none of the function's argument are nonnull. The caller
14085 must free the bitmap. */
14088 get_nonnull_args (const_tree fntype
)
14090 if (fntype
== NULL_TREE
)
14093 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14097 bitmap argmap
= NULL
;
14099 /* A function declaration can specify multiple attribute nonnull,
14100 each with zero or more arguments. The loop below creates a bitmap
14101 representing a union of all the arguments. An empty (but non-null)
14102 bitmap means that all arguments have been declaraed nonnull. */
14103 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14105 attrs
= lookup_attribute ("nonnull", attrs
);
14110 argmap
= BITMAP_ALLOC (NULL
);
14112 if (!TREE_VALUE (attrs
))
14114 /* Clear the bitmap in case a previous attribute nonnull
14115 set it and this one overrides it for all arguments. */
14116 bitmap_clear (argmap
);
14120 /* Iterate over the indices of the format arguments declared nonnull
14121 and set a bit for each. */
14122 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14124 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14125 bitmap_set_bit (argmap
, val
);
14132 /* Returns true if TYPE is a type where it and all of its subobjects
14133 (recursively) are of structure, union, or array type. */
14136 default_is_empty_type (tree type
)
14138 if (RECORD_OR_UNION_TYPE_P (type
))
14140 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14141 if (TREE_CODE (field
) == FIELD_DECL
14142 && !DECL_PADDING_P (field
)
14143 && !default_is_empty_type (TREE_TYPE (field
)))
14147 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14148 return (integer_minus_onep (array_type_nelts (type
))
14149 || TYPE_DOMAIN (type
) == NULL_TREE
14150 || default_is_empty_type (TREE_TYPE (type
)));
14154 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14155 that shouldn't be passed via stack. */
14158 default_is_empty_record (const_tree type
)
14160 if (!abi_version_at_least (12))
14163 if (type
== error_mark_node
)
14166 if (TREE_ADDRESSABLE (type
))
14169 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14172 /* Like int_size_in_bytes, but handle empty records specially. */
14175 arg_int_size_in_bytes (const_tree type
)
14177 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14180 /* Like size_in_bytes, but handle empty records specially. */
14183 arg_size_in_bytes (const_tree type
)
14185 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14188 /* Return true if an expression with CODE has to have the same result type as
14189 its first operand. */
14192 expr_type_first_operand_type_p (tree_code code
)
14205 case TRUNC_DIV_EXPR
:
14206 case CEIL_DIV_EXPR
:
14207 case FLOOR_DIV_EXPR
:
14208 case ROUND_DIV_EXPR
:
14209 case TRUNC_MOD_EXPR
:
14210 case CEIL_MOD_EXPR
:
14211 case FLOOR_MOD_EXPR
:
14212 case ROUND_MOD_EXPR
:
14214 case EXACT_DIV_EXPR
:
14232 /* List of pointer types used to declare builtins before we have seen their
14235 Keep the size up to date in tree.h ! */
14236 const builtin_structptr_type builtin_structptr_types
[6] =
14238 { fileptr_type_node
, ptr_type_node
, "FILE" },
14239 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14240 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14241 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14242 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14243 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14248 namespace selftest
{
14250 /* Selftests for tree. */
14252 /* Verify that integer constants are sane. */
14255 test_integer_constants ()
14257 ASSERT_TRUE (integer_type_node
!= NULL
);
14258 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14260 tree type
= integer_type_node
;
14262 tree zero
= build_zero_cst (type
);
14263 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14264 ASSERT_EQ (type
, TREE_TYPE (zero
));
14266 tree one
= build_int_cst (type
, 1);
14267 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14268 ASSERT_EQ (type
, TREE_TYPE (zero
));
14271 /* Verify identifiers. */
14274 test_identifiers ()
14276 tree identifier
= get_identifier ("foo");
14277 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14278 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14281 /* Verify LABEL_DECL. */
14286 tree identifier
= get_identifier ("err");
14287 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14288 identifier
, void_type_node
);
14289 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14290 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14293 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14294 are given by VALS. */
14297 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
14299 gcc_assert (vals
.length () == TYPE_VECTOR_SUBPARTS (type
));
14300 tree_vector_builder
builder (type
, vals
.length (), 1);
14301 builder
.splice (vals
);
14302 return builder
.build ();
14305 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14308 check_vector_cst (vec
<tree
> expected
, tree actual
)
14310 ASSERT_EQ (expected
.length (), TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14311 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14312 ASSERT_EQ (wi::to_wide (expected
[i
]),
14313 wi::to_wide (vector_cst_elt (actual
, i
)));
14316 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14317 and that its elements match EXPECTED. */
14320 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14321 unsigned int npatterns
)
14323 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14324 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14325 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14326 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14327 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14328 check_vector_cst (expected
, actual
);
14331 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14332 and NPATTERNS background elements, and that its elements match
14336 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14337 unsigned int npatterns
)
14339 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14340 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14341 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14342 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14343 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14344 check_vector_cst (expected
, actual
);
14347 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14348 and that its elements match EXPECTED. */
14351 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14352 unsigned int npatterns
)
14354 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14355 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14356 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14357 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14358 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14359 check_vector_cst (expected
, actual
);
14362 /* Test the creation of VECTOR_CSTs. */
14365 test_vector_cst_patterns ()
14367 auto_vec
<tree
, 8> elements (8);
14368 elements
.quick_grow (8);
14369 tree element_type
= build_nonstandard_integer_type (16, true);
14370 tree vector_type
= build_vector_type (element_type
, 8);
14372 /* Test a simple linear series with a base of 0 and a step of 1:
14373 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14374 for (unsigned int i
= 0; i
< 8; ++i
)
14375 elements
[i
] = build_int_cst (element_type
, i
);
14376 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14378 /* Try the same with the first element replaced by 100:
14379 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14380 elements
[0] = build_int_cst (element_type
, 100);
14381 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14383 /* Try a series that wraps around.
14384 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14385 for (unsigned int i
= 1; i
< 8; ++i
)
14386 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14387 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14389 /* Try a downward series:
14390 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14391 for (unsigned int i
= 1; i
< 8; ++i
)
14392 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14393 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14395 /* Try two interleaved series with different bases and steps:
14396 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14397 elements
[1] = build_int_cst (element_type
, 53);
14398 for (unsigned int i
= 2; i
< 8; i
+= 2)
14400 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14401 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14403 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14405 /* Try a duplicated value:
14406 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14407 for (unsigned int i
= 1; i
< 8; ++i
)
14408 elements
[i
] = elements
[0];
14409 check_vector_cst_duplicate (elements
,
14410 build_vector (vector_type
, elements
), 1);
14412 /* Try an interleaved duplicated value:
14413 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14414 elements
[1] = build_int_cst (element_type
, 55);
14415 for (unsigned int i
= 2; i
< 8; ++i
)
14416 elements
[i
] = elements
[i
- 2];
14417 check_vector_cst_duplicate (elements
,
14418 build_vector (vector_type
, elements
), 2);
14420 /* Try a duplicated value with 2 exceptions
14421 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14422 elements
[0] = build_int_cst (element_type
, 41);
14423 elements
[1] = build_int_cst (element_type
, 97);
14424 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 2);
14426 /* Try with and without a step
14427 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14428 for (unsigned int i
= 3; i
< 8; i
+= 2)
14429 elements
[i
] = build_int_cst (element_type
, i
* 7);
14430 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14432 /* Try a fully-general constant:
14433 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14434 elements
[5] = build_int_cst (element_type
, 9990);
14435 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 4);
14438 /* Run all of the selftests within this file. */
14443 test_integer_constants ();
14444 test_identifiers ();
14446 test_vector_cst_patterns ();
14449 } // namespace selftest
14451 #endif /* CHECKING_P */
14453 #include "gt-tree.h"