1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 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"
57 #include "langhooks-def.h"
58 #include "tree-diagnostic.h"
61 #include "print-tree.h"
62 #include "ipa-utils.h"
64 #include "stringpool.h"
68 #include "tree-vector-builder.h"
69 #include "gimple-fold.h"
70 #include "escaped_string.h"
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
77 const enum tree_code_class tree_code_type
[] = {
78 #include "all-tree.def"
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
91 const unsigned char tree_code_length
[] = {
92 #include "all-tree.def"
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
101 #define END_OF_BASE_TREE_CODES "@dummy",
103 static const char *const tree_code_name
[] = {
104 #include "all-tree.def"
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
113 const char *const tree_code_class_strings
[] =
128 /* obstack.[ch] explicitly declined to prototype this. */
129 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
131 /* Statistics-gathering stuff. */
133 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
134 uint64_t tree_node_counts
[(int) all_kinds
];
135 uint64_t tree_node_sizes
[(int) all_kinds
];
137 /* Keep in sync with tree.h:enum tree_node_kind. */
138 static const char * const tree_node_kind_names
[] = {
157 /* Unique id for next decl created. */
158 static GTY(()) int next_decl_uid
;
159 /* Unique id for next type created. */
160 static GTY(()) unsigned next_type_uid
= 1;
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
163 static GTY(()) int next_debug_decl_uid
;
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
168 struct GTY((for_user
)) type_hash
{
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
176 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
178 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
179 static bool equal (type_hash
*a
, type_hash
*b
);
182 keep_cache_entry (type_hash
*&t
)
184 return ggc_marked_p (t
->type
);
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
195 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
197 /* Hash table and temporary node for larger integer const values. */
198 static GTY (()) tree int_cst_node
;
200 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
202 static hashval_t
hash (tree t
);
203 static bool equal (tree x
, tree y
);
206 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
210 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
212 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
213 static hashval_t
hash (tree t
);
214 static bool equal (tree x
, const compare_type
&y
);
217 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
224 static GTY (()) tree cl_optimization_node
;
225 static GTY (()) tree cl_target_option_node
;
227 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
229 static hashval_t
hash (tree t
);
230 static bool equal (tree x
, tree y
);
233 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
235 /* General tree->tree mapping structure for use in hash tables. */
239 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
242 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
244 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
246 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
249 equal (tree_vec_map
*a
, tree_vec_map
*b
)
251 return a
->base
.from
== b
->base
.from
;
255 keep_cache_entry (tree_vec_map
*&m
)
257 return ggc_marked_p (m
->base
.from
);
262 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
264 static void set_type_quals (tree
, int);
265 static void print_type_hash_statistics (void);
266 static void print_debug_expr_statistics (void);
267 static void print_value_expr_statistics (void);
269 static tree
build_array_type_1 (tree
, tree
, bool, bool, bool);
271 tree global_trees
[TI_MAX
];
272 tree integer_types
[itk_none
];
274 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
275 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
277 bool tree_contains_struct
[MAX_TREE_CODES
][64];
279 /* Number of operands for each OpenMP clause. */
280 unsigned const char omp_clause_num_ops
[] =
282 0, /* OMP_CLAUSE_ERROR */
283 1, /* OMP_CLAUSE_PRIVATE */
284 1, /* OMP_CLAUSE_SHARED */
285 1, /* OMP_CLAUSE_FIRSTPRIVATE */
286 2, /* OMP_CLAUSE_LASTPRIVATE */
287 5, /* OMP_CLAUSE_REDUCTION */
288 5, /* OMP_CLAUSE_TASK_REDUCTION */
289 5, /* OMP_CLAUSE_IN_REDUCTION */
290 1, /* OMP_CLAUSE_COPYIN */
291 1, /* OMP_CLAUSE_COPYPRIVATE */
292 3, /* OMP_CLAUSE_LINEAR */
293 2, /* OMP_CLAUSE_ALIGNED */
294 1, /* OMP_CLAUSE_DEPEND */
295 1, /* OMP_CLAUSE_NONTEMPORAL */
296 1, /* OMP_CLAUSE_UNIFORM */
297 1, /* OMP_CLAUSE_TO_DECLARE */
298 1, /* OMP_CLAUSE_LINK */
299 2, /* OMP_CLAUSE_FROM */
300 2, /* OMP_CLAUSE_TO */
301 2, /* OMP_CLAUSE_MAP */
302 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
303 1, /* OMP_CLAUSE_USE_DEVICE_ADDR */
304 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
305 1, /* OMP_CLAUSE_INCLUSIVE */
306 1, /* OMP_CLAUSE_EXCLUSIVE */
307 2, /* OMP_CLAUSE__CACHE_ */
308 2, /* OMP_CLAUSE_GANG */
309 1, /* OMP_CLAUSE_ASYNC */
310 1, /* OMP_CLAUSE_WAIT */
311 0, /* OMP_CLAUSE_AUTO */
312 0, /* OMP_CLAUSE_SEQ */
313 1, /* OMP_CLAUSE__LOOPTEMP_ */
314 1, /* OMP_CLAUSE__REDUCTEMP_ */
315 1, /* OMP_CLAUSE__CONDTEMP_ */
316 1, /* OMP_CLAUSE__SCANTEMP_ */
317 1, /* OMP_CLAUSE_IF */
318 1, /* OMP_CLAUSE_NUM_THREADS */
319 1, /* OMP_CLAUSE_SCHEDULE */
320 0, /* OMP_CLAUSE_NOWAIT */
321 1, /* OMP_CLAUSE_ORDERED */
322 0, /* OMP_CLAUSE_DEFAULT */
323 3, /* OMP_CLAUSE_COLLAPSE */
324 0, /* OMP_CLAUSE_UNTIED */
325 1, /* OMP_CLAUSE_FINAL */
326 0, /* OMP_CLAUSE_MERGEABLE */
327 1, /* OMP_CLAUSE_DEVICE */
328 1, /* OMP_CLAUSE_DIST_SCHEDULE */
329 0, /* OMP_CLAUSE_INBRANCH */
330 0, /* OMP_CLAUSE_NOTINBRANCH */
331 1, /* OMP_CLAUSE_NUM_TEAMS */
332 1, /* OMP_CLAUSE_THREAD_LIMIT */
333 0, /* OMP_CLAUSE_PROC_BIND */
334 1, /* OMP_CLAUSE_SAFELEN */
335 1, /* OMP_CLAUSE_SIMDLEN */
336 0, /* OMP_CLAUSE_DEVICE_TYPE */
337 0, /* OMP_CLAUSE_FOR */
338 0, /* OMP_CLAUSE_PARALLEL */
339 0, /* OMP_CLAUSE_SECTIONS */
340 0, /* OMP_CLAUSE_TASKGROUP */
341 1, /* OMP_CLAUSE_PRIORITY */
342 1, /* OMP_CLAUSE_GRAINSIZE */
343 1, /* OMP_CLAUSE_NUM_TASKS */
344 0, /* OMP_CLAUSE_NOGROUP */
345 0, /* OMP_CLAUSE_THREADS */
346 0, /* OMP_CLAUSE_SIMD */
347 1, /* OMP_CLAUSE_HINT */
348 0, /* OMP_CLAUSE_DEFAULTMAP */
349 0, /* OMP_CLAUSE_ORDER */
350 0, /* OMP_CLAUSE_BIND */
351 1, /* OMP_CLAUSE__SIMDUID_ */
352 0, /* OMP_CLAUSE__SIMT_ */
353 0, /* OMP_CLAUSE_INDEPENDENT */
354 1, /* OMP_CLAUSE_WORKER */
355 1, /* OMP_CLAUSE_VECTOR */
356 1, /* OMP_CLAUSE_NUM_GANGS */
357 1, /* OMP_CLAUSE_NUM_WORKERS */
358 1, /* OMP_CLAUSE_VECTOR_LENGTH */
359 3, /* OMP_CLAUSE_TILE */
360 2, /* OMP_CLAUSE__GRIDDIM_ */
361 0, /* OMP_CLAUSE_IF_PRESENT */
362 0, /* OMP_CLAUSE_FINALIZE */
365 const char * const omp_clause_code_name
[] =
451 /* Return the tree node structure used by tree code CODE. */
453 static inline enum tree_node_structure_enum
454 tree_node_structure_for_code (enum tree_code code
)
456 switch (TREE_CODE_CLASS (code
))
458 case tcc_declaration
:
461 case CONST_DECL
: return TS_CONST_DECL
;
462 case DEBUG_EXPR_DECL
: return TS_DECL_WRTL
;
463 case FIELD_DECL
: return TS_FIELD_DECL
;
464 case FUNCTION_DECL
: return TS_FUNCTION_DECL
;
465 case LABEL_DECL
: return TS_LABEL_DECL
;
466 case PARM_DECL
: return TS_PARM_DECL
;
467 case RESULT_DECL
: return TS_RESULT_DECL
;
468 case TRANSLATION_UNIT_DECL
: return TS_TRANSLATION_UNIT_DECL
;
469 case TYPE_DECL
: return TS_TYPE_DECL
;
470 case VAR_DECL
: return TS_VAR_DECL
;
471 default: return TS_DECL_NON_COMMON
;
474 case tcc_type
: return TS_TYPE_NON_COMMON
;
482 case tcc_vl_exp
: return TS_EXP
;
484 default: /* tcc_constant and tcc_exceptional */
490 /* tcc_constant cases. */
491 case COMPLEX_CST
: return TS_COMPLEX
;
492 case FIXED_CST
: return TS_FIXED_CST
;
493 case INTEGER_CST
: return TS_INT_CST
;
494 case POLY_INT_CST
: return TS_POLY_INT_CST
;
495 case REAL_CST
: return TS_REAL_CST
;
496 case STRING_CST
: return TS_STRING
;
497 case VECTOR_CST
: return TS_VECTOR
;
498 case VOID_CST
: return TS_TYPED
;
500 /* tcc_exceptional cases. */
501 case BLOCK
: return TS_BLOCK
;
502 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
503 case ERROR_MARK
: return TS_COMMON
;
504 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
505 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
506 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
507 case PLACEHOLDER_EXPR
: return TS_COMMON
;
508 case SSA_NAME
: return TS_SSA_NAME
;
509 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
510 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
511 case TREE_BINFO
: return TS_BINFO
;
512 case TREE_LIST
: return TS_LIST
;
513 case TREE_VEC
: return TS_VEC
;
521 /* Initialize tree_contains_struct to describe the hierarchy of tree
525 initialize_tree_contains_struct (void)
529 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
532 enum tree_node_structure_enum ts_code
;
534 code
= (enum tree_code
) i
;
535 ts_code
= tree_node_structure_for_code (code
);
537 /* Mark the TS structure itself. */
538 tree_contains_struct
[code
][ts_code
] = 1;
540 /* Mark all the structures that TS is derived from. */
545 case TS_OPTIMIZATION
:
546 case TS_TARGET_OPTION
:
552 case TS_POLY_INT_CST
:
561 case TS_STATEMENT_LIST
:
562 MARK_TS_TYPED (code
);
566 case TS_DECL_MINIMAL
:
572 MARK_TS_COMMON (code
);
575 case TS_TYPE_WITH_LANG_SPECIFIC
:
576 MARK_TS_TYPE_COMMON (code
);
579 case TS_TYPE_NON_COMMON
:
580 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
584 MARK_TS_DECL_MINIMAL (code
);
589 MARK_TS_DECL_COMMON (code
);
592 case TS_DECL_NON_COMMON
:
593 MARK_TS_DECL_WITH_VIS (code
);
596 case TS_DECL_WITH_VIS
:
600 MARK_TS_DECL_WRTL (code
);
604 MARK_TS_DECL_COMMON (code
);
608 MARK_TS_DECL_WITH_VIS (code
);
612 case TS_FUNCTION_DECL
:
613 MARK_TS_DECL_NON_COMMON (code
);
616 case TS_TRANSLATION_UNIT_DECL
:
617 MARK_TS_DECL_COMMON (code
);
625 /* Basic consistency checks for attributes used in fold. */
626 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
627 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
628 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
632 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
633 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
634 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
635 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
636 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
637 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
638 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
639 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
640 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
641 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
642 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
645 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
647 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
649 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
650 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
651 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
652 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
653 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
654 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
655 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
656 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
657 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
658 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
659 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
660 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
661 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
662 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
663 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
664 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
665 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
674 /* Initialize the hash table of types. */
676 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
679 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
682 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
684 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
686 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
688 int_cst_node
= make_int_cst (1, 1);
690 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
692 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
693 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
695 /* Initialize the tree_contains_struct array. */
696 initialize_tree_contains_struct ();
697 lang_hooks
.init_ts ();
701 /* The name of the object as the assembler will see it (but before any
702 translations made by ASM_OUTPUT_LABELREF). Often this is the same
703 as DECL_NAME. It is an IDENTIFIER_NODE. */
705 decl_assembler_name (tree decl
)
707 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
708 lang_hooks
.set_decl_assembler_name (decl
);
709 return DECL_ASSEMBLER_NAME_RAW (decl
);
712 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
713 (either of which may be NULL). Inform the FE, if this changes the
717 overwrite_decl_assembler_name (tree decl
, tree name
)
719 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
720 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
723 /* When the target supports COMDAT groups, this indicates which group the
724 DECL is associated with. This can be either an IDENTIFIER_NODE or a
725 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
727 decl_comdat_group (const_tree node
)
729 struct symtab_node
*snode
= symtab_node::get (node
);
732 return snode
->get_comdat_group ();
735 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
737 decl_comdat_group_id (const_tree node
)
739 struct symtab_node
*snode
= symtab_node::get (node
);
742 return snode
->get_comdat_group_id ();
745 /* When the target supports named section, return its name as IDENTIFIER_NODE
746 or NULL if it is in no section. */
748 decl_section_name (const_tree node
)
750 struct symtab_node
*snode
= symtab_node::get (node
);
753 return snode
->get_section ();
756 /* Set section name of NODE to VALUE (that is expected to be
759 set_decl_section_name (tree node
, const char *value
)
761 struct symtab_node
*snode
;
765 snode
= symtab_node::get (node
);
769 else if (VAR_P (node
))
770 snode
= varpool_node::get_create (node
);
772 snode
= cgraph_node::get_create (node
);
773 snode
->set_section (value
);
776 /* Return TLS model of a variable NODE. */
778 decl_tls_model (const_tree node
)
780 struct varpool_node
*snode
= varpool_node::get (node
);
782 return TLS_MODEL_NONE
;
783 return snode
->tls_model
;
786 /* Set TLS model of variable NODE to MODEL. */
788 set_decl_tls_model (tree node
, enum tls_model model
)
790 struct varpool_node
*vnode
;
792 if (model
== TLS_MODEL_NONE
)
794 vnode
= varpool_node::get (node
);
799 vnode
= varpool_node::get_create (node
);
800 vnode
->tls_model
= model
;
803 /* Compute the number of bytes occupied by a tree with code CODE.
804 This function cannot be used for nodes that have variable sizes,
805 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
807 tree_code_size (enum tree_code code
)
809 switch (TREE_CODE_CLASS (code
))
811 case tcc_declaration
: /* A decl node */
814 case FIELD_DECL
: return sizeof (tree_field_decl
);
815 case PARM_DECL
: return sizeof (tree_parm_decl
);
816 case VAR_DECL
: return sizeof (tree_var_decl
);
817 case LABEL_DECL
: return sizeof (tree_label_decl
);
818 case RESULT_DECL
: return sizeof (tree_result_decl
);
819 case CONST_DECL
: return sizeof (tree_const_decl
);
820 case TYPE_DECL
: return sizeof (tree_type_decl
);
821 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
822 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
823 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
826 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
828 gcc_checking_assert (code
>= NUM_TREE_CODES
);
829 return lang_hooks
.tree_size (code
);
832 case tcc_type
: /* a type node */
843 case FIXED_POINT_TYPE
:
849 case QUAL_UNION_TYPE
:
853 case LANG_TYPE
: return sizeof (tree_type_non_common
);
855 gcc_checking_assert (code
>= NUM_TREE_CODES
);
856 return lang_hooks
.tree_size (code
);
859 case tcc_reference
: /* a reference */
860 case tcc_expression
: /* an expression */
861 case tcc_statement
: /* an expression with side effects */
862 case tcc_comparison
: /* a comparison expression */
863 case tcc_unary
: /* a unary arithmetic expression */
864 case tcc_binary
: /* a binary arithmetic expression */
865 return (sizeof (struct tree_exp
)
866 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
868 case tcc_constant
: /* a constant */
871 case VOID_CST
: return sizeof (tree_typed
);
872 case INTEGER_CST
: gcc_unreachable ();
873 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
874 case REAL_CST
: return sizeof (tree_real_cst
);
875 case FIXED_CST
: return sizeof (tree_fixed_cst
);
876 case COMPLEX_CST
: return sizeof (tree_complex
);
877 case VECTOR_CST
: gcc_unreachable ();
878 case STRING_CST
: gcc_unreachable ();
880 gcc_checking_assert (code
>= NUM_TREE_CODES
);
881 return lang_hooks
.tree_size (code
);
884 case tcc_exceptional
: /* something random, like an identifier. */
887 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
888 case TREE_LIST
: return sizeof (tree_list
);
891 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
893 case TREE_VEC
: gcc_unreachable ();
894 case OMP_CLAUSE
: gcc_unreachable ();
896 case SSA_NAME
: return sizeof (tree_ssa_name
);
898 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
899 case BLOCK
: return sizeof (struct tree_block
);
900 case CONSTRUCTOR
: return sizeof (tree_constructor
);
901 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
902 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
905 gcc_checking_assert (code
>= NUM_TREE_CODES
);
906 return lang_hooks
.tree_size (code
);
914 /* Compute the number of bytes occupied by NODE. This routine only
915 looks at TREE_CODE, except for those nodes that have variable sizes. */
917 tree_size (const_tree node
)
919 const enum tree_code code
= TREE_CODE (node
);
923 return (sizeof (struct tree_int_cst
)
924 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
927 return (offsetof (struct tree_binfo
, base_binfos
)
929 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
932 return (sizeof (struct tree_vec
)
933 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
936 return (sizeof (struct tree_vector
)
937 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
940 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
943 return (sizeof (struct tree_omp_clause
)
944 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
948 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
949 return (sizeof (struct tree_exp
)
950 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
952 return tree_code_size (code
);
956 /* Return tree node kind based on tree CODE. */
958 static tree_node_kind
959 get_stats_node_kind (enum tree_code code
)
961 enum tree_code_class type
= TREE_CODE_CLASS (code
);
965 case tcc_declaration
: /* A decl node */
967 case tcc_type
: /* a type node */
969 case tcc_statement
: /* an expression with side effects */
971 case tcc_reference
: /* a reference */
973 case tcc_expression
: /* an expression */
974 case tcc_comparison
: /* a comparison expression */
975 case tcc_unary
: /* a unary arithmetic expression */
976 case tcc_binary
: /* a binary arithmetic expression */
978 case tcc_constant
: /* a constant */
980 case tcc_exceptional
: /* something random, like an identifier. */
983 case IDENTIFIER_NODE
:
990 return ssa_name_kind
;
996 return omp_clause_kind
;
1008 /* Record interesting allocation statistics for a tree node with CODE
1012 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1014 if (!GATHER_STATISTICS
)
1017 tree_node_kind kind
= get_stats_node_kind (code
);
1019 tree_code_counts
[(int) code
]++;
1020 tree_node_counts
[(int) kind
]++;
1021 tree_node_sizes
[(int) kind
] += length
;
1024 /* Allocate and return a new UID from the DECL_UID namespace. */
1027 allocate_decl_uid (void)
1029 return next_decl_uid
++;
1032 /* Return a newly allocated node of code CODE. For decl and type
1033 nodes, some other fields are initialized. The rest of the node is
1034 initialized to zero. This function cannot be used for TREE_VEC,
1035 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1038 Achoo! I got a code in the node. */
1041 make_node (enum tree_code code MEM_STAT_DECL
)
1044 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1045 size_t length
= tree_code_size (code
);
1047 record_node_allocation_statistics (code
, length
);
1049 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1050 TREE_SET_CODE (t
, code
);
1055 if (code
!= DEBUG_BEGIN_STMT
)
1056 TREE_SIDE_EFFECTS (t
) = 1;
1059 case tcc_declaration
:
1060 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1062 if (code
== FUNCTION_DECL
)
1064 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1065 SET_DECL_MODE (t
, FUNCTION_MODE
);
1068 SET_DECL_ALIGN (t
, 1);
1070 DECL_SOURCE_LOCATION (t
) = input_location
;
1071 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1072 DECL_UID (t
) = --next_debug_decl_uid
;
1075 DECL_UID (t
) = allocate_decl_uid ();
1076 SET_DECL_PT_UID (t
, -1);
1078 if (TREE_CODE (t
) == LABEL_DECL
)
1079 LABEL_DECL_UID (t
) = -1;
1084 TYPE_UID (t
) = next_type_uid
++;
1085 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1086 TYPE_USER_ALIGN (t
) = 0;
1087 TYPE_MAIN_VARIANT (t
) = t
;
1088 TYPE_CANONICAL (t
) = t
;
1090 /* Default to no attributes for type, but let target change that. */
1091 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1092 targetm
.set_default_type_attributes (t
);
1094 /* We have not yet computed the alias set for this type. */
1095 TYPE_ALIAS_SET (t
) = -1;
1099 TREE_CONSTANT (t
) = 1;
1102 case tcc_expression
:
1108 case PREDECREMENT_EXPR
:
1109 case PREINCREMENT_EXPR
:
1110 case POSTDECREMENT_EXPR
:
1111 case POSTINCREMENT_EXPR
:
1112 /* All of these have side-effects, no matter what their
1114 TREE_SIDE_EFFECTS (t
) = 1;
1122 case tcc_exceptional
:
1125 case TARGET_OPTION_NODE
:
1126 TREE_TARGET_OPTION(t
)
1127 = ggc_cleared_alloc
<struct cl_target_option
> ();
1130 case OPTIMIZATION_NODE
:
1131 TREE_OPTIMIZATION (t
)
1132 = ggc_cleared_alloc
<struct cl_optimization
> ();
1141 /* Other classes need no special treatment. */
1148 /* Free tree node. */
1151 free_node (tree node
)
1153 enum tree_code code
= TREE_CODE (node
);
1154 if (GATHER_STATISTICS
)
1156 enum tree_node_kind kind
= get_stats_node_kind (code
);
1158 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1159 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1160 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1162 tree_code_counts
[(int) TREE_CODE (node
)]--;
1163 tree_node_counts
[(int) kind
]--;
1164 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1166 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1167 vec_free (CONSTRUCTOR_ELTS (node
));
1168 else if (code
== BLOCK
)
1169 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1170 else if (code
== TREE_BINFO
)
1171 vec_free (BINFO_BASE_ACCESSES (node
));
1172 else if (code
== OPTIMIZATION_NODE
)
1173 cl_optimization_option_free (TREE_OPTIMIZATION (node
));
1174 else if (code
== TARGET_OPTION_NODE
)
1175 cl_target_option_free (TREE_TARGET_OPTION (node
));
1179 /* Return a new node with the same contents as NODE except that its
1180 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1183 copy_node (tree node MEM_STAT_DECL
)
1186 enum tree_code code
= TREE_CODE (node
);
1189 gcc_assert (code
!= STATEMENT_LIST
);
1191 length
= tree_size (node
);
1192 record_node_allocation_statistics (code
, length
);
1193 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1194 memcpy (t
, node
, length
);
1196 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1198 TREE_ASM_WRITTEN (t
) = 0;
1199 TREE_VISITED (t
) = 0;
1201 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1203 if (code
== DEBUG_EXPR_DECL
)
1204 DECL_UID (t
) = --next_debug_decl_uid
;
1207 DECL_UID (t
) = allocate_decl_uid ();
1208 if (DECL_PT_UID_SET_P (node
))
1209 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1211 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1212 && DECL_HAS_VALUE_EXPR_P (node
))
1214 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1215 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1217 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1220 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1221 t
->decl_with_vis
.symtab_node
= NULL
;
1223 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1225 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1226 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1228 if (TREE_CODE (node
) == FUNCTION_DECL
)
1230 DECL_STRUCT_FUNCTION (t
) = NULL
;
1231 t
->decl_with_vis
.symtab_node
= NULL
;
1234 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1236 TYPE_UID (t
) = next_type_uid
++;
1237 /* The following is so that the debug code for
1238 the copy is different from the original type.
1239 The two statements usually duplicate each other
1240 (because they clear fields of the same union),
1241 but the optimizer should catch that. */
1242 TYPE_SYMTAB_ADDRESS (t
) = 0;
1243 TYPE_SYMTAB_DIE (t
) = 0;
1245 /* Do not copy the values cache. */
1246 if (TYPE_CACHED_VALUES_P (t
))
1248 TYPE_CACHED_VALUES_P (t
) = 0;
1249 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1252 else if (code
== TARGET_OPTION_NODE
)
1254 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1255 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1256 sizeof (struct cl_target_option
));
1258 else if (code
== OPTIMIZATION_NODE
)
1260 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1261 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1262 sizeof (struct cl_optimization
));
1268 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1269 For example, this can copy a list made of TREE_LIST nodes. */
1272 copy_list (tree list
)
1280 head
= prev
= copy_node (list
);
1281 next
= TREE_CHAIN (list
);
1284 TREE_CHAIN (prev
) = copy_node (next
);
1285 prev
= TREE_CHAIN (prev
);
1286 next
= TREE_CHAIN (next
);
1292 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1293 INTEGER_CST with value CST and type TYPE. */
1296 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1298 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1299 /* We need extra HWIs if CST is an unsigned integer with its
1301 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1302 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1303 return cst
.get_len ();
1306 /* Return a new INTEGER_CST with value CST and type TYPE. */
1309 build_new_int_cst (tree type
, const wide_int
&cst
)
1311 unsigned int len
= cst
.get_len ();
1312 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1313 tree nt
= make_int_cst (len
, ext_len
);
1318 TREE_INT_CST_ELT (nt
, ext_len
)
1319 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1320 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1321 TREE_INT_CST_ELT (nt
, i
) = -1;
1323 else if (TYPE_UNSIGNED (type
)
1324 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1327 TREE_INT_CST_ELT (nt
, len
)
1328 = zext_hwi (cst
.elt (len
),
1329 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1332 for (unsigned int i
= 0; i
< len
; i
++)
1333 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1334 TREE_TYPE (nt
) = type
;
1338 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1341 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1344 size_t length
= sizeof (struct tree_poly_int_cst
);
1345 record_node_allocation_statistics (POLY_INT_CST
, length
);
1347 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1349 TREE_SET_CODE (t
, POLY_INT_CST
);
1350 TREE_CONSTANT (t
) = 1;
1351 TREE_TYPE (t
) = type
;
1352 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1353 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1357 /* Create a constant tree that contains CST sign-extended to TYPE. */
1360 build_int_cst (tree type
, poly_int64 cst
)
1362 /* Support legacy code. */
1364 type
= integer_type_node
;
1366 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1369 /* Create a constant tree that contains CST zero-extended to TYPE. */
1372 build_int_cstu (tree type
, poly_uint64 cst
)
1374 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1377 /* Create a constant tree that contains CST sign-extended to TYPE. */
1380 build_int_cst_type (tree type
, poly_int64 cst
)
1383 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1386 /* Constructs tree in type TYPE from with value given by CST. Signedness
1387 of CST is assumed to be the same as the signedness of TYPE. */
1390 double_int_to_tree (tree type
, double_int cst
)
1392 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1395 /* We force the wide_int CST to the range of the type TYPE by sign or
1396 zero extending it. OVERFLOWABLE indicates if we are interested in
1397 overflow of the value, when >0 we are only interested in signed
1398 overflow, for <0 we are interested in any overflow. OVERFLOWED
1399 indicates whether overflow has already occurred. CONST_OVERFLOWED
1400 indicates whether constant overflow has already occurred. We force
1401 T's value to be within range of T's type (by setting to 0 or 1 all
1402 the bits outside the type's range). We set TREE_OVERFLOWED if,
1403 OVERFLOWED is nonzero,
1404 or OVERFLOWABLE is >0 and signed overflow occurs
1405 or OVERFLOWABLE is <0 and any overflow occurs
1406 We return a new tree node for the extended wide_int. The node
1407 is shared if no overflow flags are set. */
1411 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1412 int overflowable
, bool overflowed
)
1414 signop sign
= TYPE_SIGN (type
);
1416 /* If we need to set overflow flags, return a new unshared node. */
1417 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1421 || (overflowable
> 0 && sign
== SIGNED
))
1423 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1426 if (tmp
.is_constant ())
1427 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1430 tree coeffs
[NUM_POLY_INT_COEFFS
];
1431 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1433 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1434 TREE_OVERFLOW (coeffs
[i
]) = 1;
1436 t
= build_new_poly_int_cst (type
, coeffs
);
1438 TREE_OVERFLOW (t
) = 1;
1443 /* Else build a shared node. */
1444 return wide_int_to_tree (type
, cst
);
1447 /* These are the hash table functions for the hash table of INTEGER_CST
1448 nodes of a sizetype. */
1450 /* Return the hash code X, an INTEGER_CST. */
1453 int_cst_hasher::hash (tree x
)
1455 const_tree
const t
= x
;
1456 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1459 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1460 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1465 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1466 is the same as that given by *Y, which is the same. */
1469 int_cst_hasher::equal (tree x
, tree y
)
1471 const_tree
const xt
= x
;
1472 const_tree
const yt
= y
;
1474 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1475 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1476 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1479 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1480 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1486 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1487 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1488 number of slots that can be cached for the type. */
1491 cache_wide_int_in_type_cache (tree type
, const wide_int
&cst
,
1492 int slot
, int max_slots
)
1494 gcc_checking_assert (slot
>= 0);
1495 /* Initialize cache. */
1496 if (!TYPE_CACHED_VALUES_P (type
))
1498 TYPE_CACHED_VALUES_P (type
) = 1;
1499 TYPE_CACHED_VALUES (type
) = make_tree_vec (max_slots
);
1501 tree t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
);
1504 /* Create a new shared int. */
1505 t
= build_new_int_cst (type
, cst
);
1506 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
) = t
;
1511 /* Create an INT_CST node of TYPE and value CST.
1512 The returned node is always shared. For small integers we use a
1513 per-type vector cache, for larger ones we use a single hash table.
1514 The value is extended from its precision according to the sign of
1515 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1516 the upper bits and ensures that hashing and value equality based
1517 upon the underlying HOST_WIDE_INTs works without masking. */
1520 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1527 unsigned int prec
= TYPE_PRECISION (type
);
1528 signop sgn
= TYPE_SIGN (type
);
1530 /* Verify that everything is canonical. */
1531 int l
= pcst
.get_len ();
1534 if (pcst
.elt (l
- 1) == 0)
1535 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1536 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1537 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1540 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1541 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1543 enum tree_code code
= TREE_CODE (type
);
1544 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
1546 /* Cache NULL pointer and zero bounds. */
1549 /* Cache upper bounds of pointers. */
1550 else if (cst
== wi::max_value (prec
, sgn
))
1552 /* Cache 1 which is used for a non-zero range. */
1558 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, 3);
1559 /* Make sure no one is clobbering the shared constant. */
1560 gcc_checking_assert (TREE_TYPE (t
) == type
1561 && cst
== wi::to_wide (t
));
1567 /* We just need to store a single HOST_WIDE_INT. */
1569 if (TYPE_UNSIGNED (type
))
1570 hwi
= cst
.to_uhwi ();
1572 hwi
= cst
.to_shwi ();
1577 gcc_assert (hwi
== 0);
1581 case REFERENCE_TYPE
:
1582 /* Ignore pointers, as they were already handled above. */
1586 /* Cache false or true. */
1588 if (IN_RANGE (hwi
, 0, 1))
1594 if (TYPE_SIGN (type
) == UNSIGNED
)
1597 limit
= param_integer_share_limit
;
1598 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1603 /* Cache [-1, N). */
1604 limit
= param_integer_share_limit
+ 1;
1605 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1619 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, limit
);
1620 /* Make sure no one is clobbering the shared constant. */
1621 gcc_checking_assert (TREE_TYPE (t
) == type
1622 && TREE_INT_CST_NUNITS (t
) == 1
1623 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1624 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1625 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1630 /* Use the cache of larger shared ints, using int_cst_node as
1633 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1634 TREE_TYPE (int_cst_node
) = type
;
1636 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1640 /* Insert this one into the hash table. */
1643 /* Make a new node for next time round. */
1644 int_cst_node
= make_int_cst (1, 1);
1650 /* The value either hashes properly or we drop it on the floor
1651 for the gc to take care of. There will not be enough of them
1654 tree nt
= build_new_int_cst (type
, cst
);
1655 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1659 /* Insert this one into the hash table. */
1671 poly_int_cst_hasher::hash (tree t
)
1673 inchash::hash hstate
;
1675 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1676 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1677 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1679 return hstate
.end ();
1683 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1685 if (TREE_TYPE (x
) != y
.first
)
1687 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1688 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1693 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1694 The elements must also have type TYPE. */
1697 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1699 unsigned int prec
= TYPE_PRECISION (type
);
1700 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1701 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1704 h
.add_int (TYPE_UID (type
));
1705 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1706 h
.add_wide_int (c
.coeffs
[i
]);
1707 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1708 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1710 if (*slot
== NULL_TREE
)
1712 tree coeffs
[NUM_POLY_INT_COEFFS
];
1713 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1714 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1715 *slot
= build_new_poly_int_cst (type
, coeffs
);
1720 /* Create a constant tree with value VALUE in type TYPE. */
1723 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1725 if (value
.is_constant ())
1726 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1727 return build_poly_int_cst (type
, value
);
1731 cache_integer_cst (tree t
)
1733 tree type
= TREE_TYPE (t
);
1736 int prec
= TYPE_PRECISION (type
);
1738 gcc_assert (!TREE_OVERFLOW (t
));
1740 switch (TREE_CODE (type
))
1743 gcc_assert (integer_zerop (t
));
1747 case REFERENCE_TYPE
:
1748 /* Cache NULL pointer. */
1749 if (integer_zerop (t
))
1757 /* Cache false or true. */
1759 if (wi::ltu_p (wi::to_wide (t
), 2))
1760 ix
= TREE_INT_CST_ELT (t
, 0);
1765 if (TYPE_UNSIGNED (type
))
1768 limit
= param_integer_share_limit
;
1770 /* This is a little hokie, but if the prec is smaller than
1771 what is necessary to hold param_integer_share_limit, then the
1772 obvious test will not get the correct answer. */
1773 if (prec
< HOST_BITS_PER_WIDE_INT
)
1775 if (tree_to_uhwi (t
)
1776 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1777 ix
= tree_to_uhwi (t
);
1779 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1780 ix
= tree_to_uhwi (t
);
1785 limit
= param_integer_share_limit
+ 1;
1787 if (integer_minus_onep (t
))
1789 else if (!wi::neg_p (wi::to_wide (t
)))
1791 if (prec
< HOST_BITS_PER_WIDE_INT
)
1793 if (tree_to_shwi (t
) < param_integer_share_limit
)
1794 ix
= tree_to_shwi (t
) + 1;
1796 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1797 ix
= tree_to_shwi (t
) + 1;
1803 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1813 /* Look for it in the type's vector of small shared ints. */
1814 if (!TYPE_CACHED_VALUES_P (type
))
1816 TYPE_CACHED_VALUES_P (type
) = 1;
1817 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1820 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1821 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1825 /* Use the cache of larger shared ints. */
1826 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1827 /* If there is already an entry for the number verify it's the
1830 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1832 /* Otherwise insert this one into the hash table. */
1838 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1839 and the rest are zeros. */
1842 build_low_bits_mask (tree type
, unsigned bits
)
1844 gcc_assert (bits
<= TYPE_PRECISION (type
));
1846 return wide_int_to_tree (type
, wi::mask (bits
, false,
1847 TYPE_PRECISION (type
)));
1850 /* Checks that X is integer constant that can be expressed in (unsigned)
1851 HOST_WIDE_INT without loss of precision. */
1854 cst_and_fits_in_hwi (const_tree x
)
1856 return (TREE_CODE (x
) == INTEGER_CST
1857 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1860 /* Build a newly constructed VECTOR_CST with the given values of
1861 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1864 make_vector (unsigned log2_npatterns
,
1865 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1867 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1869 unsigned npatterns
= 1 << log2_npatterns
;
1870 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1871 unsigned length
= (sizeof (struct tree_vector
)
1872 + (encoded_nelts
- 1) * sizeof (tree
));
1874 record_node_allocation_statistics (VECTOR_CST
, length
);
1876 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1878 TREE_SET_CODE (t
, VECTOR_CST
);
1879 TREE_CONSTANT (t
) = 1;
1880 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1881 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1886 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1887 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1890 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1892 if (vec_safe_length (v
) == 0)
1893 return build_zero_cst (type
);
1895 unsigned HOST_WIDE_INT idx
, nelts
;
1898 /* We can't construct a VECTOR_CST for a variable number of elements. */
1899 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1900 tree_vector_builder
vec (type
, nelts
, 1);
1901 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1903 if (TREE_CODE (value
) == VECTOR_CST
)
1905 /* If NELTS is constant then this must be too. */
1906 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1907 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1908 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1911 vec
.quick_push (value
);
1913 while (vec
.length () < nelts
)
1914 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1916 return vec
.build ();
1919 /* Build a vector of type VECTYPE where all the elements are SCs. */
1921 build_vector_from_val (tree vectype
, tree sc
)
1923 unsigned HOST_WIDE_INT i
, nunits
;
1925 if (sc
== error_mark_node
)
1928 /* Verify that the vector type is suitable for SC. Note that there
1929 is some inconsistency in the type-system with respect to restrict
1930 qualifications of pointers. Vector types always have a main-variant
1931 element type and the qualification is applied to the vector-type.
1932 So TREE_TYPE (vector-type) does not return a properly qualified
1933 vector element-type. */
1934 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1935 TREE_TYPE (vectype
)));
1937 if (CONSTANT_CLASS_P (sc
))
1939 tree_vector_builder
v (vectype
, 1, 1);
1943 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1944 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1947 vec
<constructor_elt
, va_gc
> *v
;
1948 vec_alloc (v
, nunits
);
1949 for (i
= 0; i
< nunits
; ++i
)
1950 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1951 return build_constructor (vectype
, v
);
1955 /* If TYPE is not a vector type, just return SC, otherwise return
1956 build_vector_from_val (TYPE, SC). */
1959 build_uniform_cst (tree type
, tree sc
)
1961 if (!VECTOR_TYPE_P (type
))
1964 return build_vector_from_val (type
, sc
);
1967 /* Build a vector series of type TYPE in which element I has the value
1968 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1969 and a VEC_SERIES_EXPR otherwise. */
1972 build_vec_series (tree type
, tree base
, tree step
)
1974 if (integer_zerop (step
))
1975 return build_vector_from_val (type
, base
);
1976 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1978 tree_vector_builder
builder (type
, 1, 3);
1979 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1980 wi::to_wide (base
) + wi::to_wide (step
));
1981 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1982 wi::to_wide (elt1
) + wi::to_wide (step
));
1983 builder
.quick_push (base
);
1984 builder
.quick_push (elt1
);
1985 builder
.quick_push (elt2
);
1986 return builder
.build ();
1988 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1991 /* Return a vector with the same number of units and number of bits
1992 as VEC_TYPE, but in which the elements are a linear series of unsigned
1993 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1996 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1998 tree index_vec_type
= vec_type
;
1999 tree index_elt_type
= TREE_TYPE (vec_type
);
2000 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
2001 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
2003 index_elt_type
= build_nonstandard_integer_type
2004 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
2005 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
2008 tree_vector_builder
v (index_vec_type
, 1, 3);
2009 for (unsigned int i
= 0; i
< 3; ++i
)
2010 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
2014 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2015 elements are A and the rest are B. */
2018 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
2020 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
2021 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
2022 /* Optimize the constant case. */
2023 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
2025 tree_vector_builder
builder (vec_type
, count
, 2);
2026 for (unsigned int i
= 0; i
< count
* 2; ++i
)
2027 builder
.quick_push (i
< num_a
? a
: b
);
2028 return builder
.build ();
2031 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2032 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2035 recompute_constructor_flags (tree c
)
2039 bool constant_p
= true;
2040 bool side_effects_p
= false;
2041 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2043 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2045 /* Mostly ctors will have elts that don't have side-effects, so
2046 the usual case is to scan all the elements. Hence a single
2047 loop for both const and side effects, rather than one loop
2048 each (with early outs). */
2049 if (!TREE_CONSTANT (val
))
2051 if (TREE_SIDE_EFFECTS (val
))
2052 side_effects_p
= true;
2055 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2056 TREE_CONSTANT (c
) = constant_p
;
2059 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2063 verify_constructor_flags (tree c
)
2067 bool constant_p
= TREE_CONSTANT (c
);
2068 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2069 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2071 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2073 if (constant_p
&& !TREE_CONSTANT (val
))
2074 internal_error ("non-constant element in constant CONSTRUCTOR");
2075 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2076 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2080 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2081 are in the vec pointed to by VALS. */
2083 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2085 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2087 TREE_TYPE (c
) = type
;
2088 CONSTRUCTOR_ELTS (c
) = vals
;
2090 recompute_constructor_flags (c
);
2095 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2098 build_constructor_single (tree type
, tree index
, tree value
)
2100 vec
<constructor_elt
, va_gc
> *v
;
2101 constructor_elt elt
= {index
, value
};
2104 v
->quick_push (elt
);
2106 return build_constructor (type
, v
);
2110 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2111 are in a list pointed to by VALS. */
2113 build_constructor_from_list (tree type
, tree vals
)
2116 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2120 vec_alloc (v
, list_length (vals
));
2121 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2122 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2125 return build_constructor (type
, v
);
2128 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2129 of elements, provided as index/value pairs. */
2132 build_constructor_va (tree type
, int nelts
, ...)
2134 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2137 va_start (p
, nelts
);
2138 vec_alloc (v
, nelts
);
2141 tree index
= va_arg (p
, tree
);
2142 tree value
= va_arg (p
, tree
);
2143 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2146 return build_constructor (type
, v
);
2149 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2152 build_clobber (tree type
)
2154 tree clobber
= build_constructor (type
, NULL
);
2155 TREE_THIS_VOLATILE (clobber
) = true;
2159 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2162 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2165 FIXED_VALUE_TYPE
*fp
;
2167 v
= make_node (FIXED_CST
);
2168 fp
= ggc_alloc
<fixed_value
> ();
2169 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2171 TREE_TYPE (v
) = type
;
2172 TREE_FIXED_CST_PTR (v
) = fp
;
2176 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2179 build_real (tree type
, REAL_VALUE_TYPE d
)
2182 REAL_VALUE_TYPE
*dp
;
2185 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2186 Consider doing it via real_convert now. */
2188 v
= make_node (REAL_CST
);
2189 dp
= ggc_alloc
<real_value
> ();
2190 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2192 TREE_TYPE (v
) = type
;
2193 TREE_REAL_CST_PTR (v
) = dp
;
2194 TREE_OVERFLOW (v
) = overflow
;
2198 /* Like build_real, but first truncate D to the type. */
2201 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2203 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2206 /* Return a new REAL_CST node whose type is TYPE
2207 and whose value is the integer value of the INTEGER_CST node I. */
2210 real_value_from_int_cst (const_tree type
, const_tree i
)
2214 /* Clear all bits of the real value type so that we can later do
2215 bitwise comparisons to see if two values are the same. */
2216 memset (&d
, 0, sizeof d
);
2218 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2219 TYPE_SIGN (TREE_TYPE (i
)));
2223 /* Given a tree representing an integer constant I, return a tree
2224 representing the same value as a floating-point constant of type TYPE. */
2227 build_real_from_int_cst (tree type
, const_tree i
)
2230 int overflow
= TREE_OVERFLOW (i
);
2232 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2234 TREE_OVERFLOW (v
) |= overflow
;
2238 /* Return a newly constructed STRING_CST node whose value is the LEN
2239 characters at STR when STR is nonnull, or all zeros otherwise.
2240 Note that for a C string literal, LEN should include the trailing NUL.
2241 The TREE_TYPE is not initialized. */
2244 build_string (unsigned len
, const char *str
/*= NULL */)
2246 /* Do not waste bytes provided by padding of struct tree_string. */
2247 unsigned size
= len
+ offsetof (struct tree_string
, str
) + 1;
2249 record_node_allocation_statistics (STRING_CST
, size
);
2251 tree s
= (tree
) ggc_internal_alloc (size
);
2253 memset (s
, 0, sizeof (struct tree_typed
));
2254 TREE_SET_CODE (s
, STRING_CST
);
2255 TREE_CONSTANT (s
) = 1;
2256 TREE_STRING_LENGTH (s
) = len
;
2258 memcpy (s
->string
.str
, str
, len
);
2260 memset (s
->string
.str
, 0, len
);
2261 s
->string
.str
[len
] = '\0';
2266 /* Return a newly constructed COMPLEX_CST node whose value is
2267 specified by the real and imaginary parts REAL and IMAG.
2268 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2269 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2272 build_complex (tree type
, tree real
, tree imag
)
2274 gcc_assert (CONSTANT_CLASS_P (real
));
2275 gcc_assert (CONSTANT_CLASS_P (imag
));
2277 tree t
= make_node (COMPLEX_CST
);
2279 TREE_REALPART (t
) = real
;
2280 TREE_IMAGPART (t
) = imag
;
2281 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2282 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2286 /* Build a complex (inf +- 0i), such as for the result of cproj.
2287 TYPE is the complex tree type of the result. If NEG is true, the
2288 imaginary zero is negative. */
2291 build_complex_inf (tree type
, bool neg
)
2293 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2297 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2298 build_real (TREE_TYPE (type
), rzero
));
2301 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2302 element is set to 1. In particular, this is 1 + i for complex types. */
2305 build_each_one_cst (tree type
)
2307 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2309 tree scalar
= build_one_cst (TREE_TYPE (type
));
2310 return build_complex (type
, scalar
, scalar
);
2313 return build_one_cst (type
);
2316 /* Return a constant of arithmetic type TYPE which is the
2317 multiplicative identity of the set TYPE. */
2320 build_one_cst (tree type
)
2322 switch (TREE_CODE (type
))
2324 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2325 case POINTER_TYPE
: case REFERENCE_TYPE
:
2327 return build_int_cst (type
, 1);
2330 return build_real (type
, dconst1
);
2332 case FIXED_POINT_TYPE
:
2333 /* We can only generate 1 for accum types. */
2334 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2335 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2339 tree scalar
= build_one_cst (TREE_TYPE (type
));
2341 return build_vector_from_val (type
, scalar
);
2345 return build_complex (type
,
2346 build_one_cst (TREE_TYPE (type
)),
2347 build_zero_cst (TREE_TYPE (type
)));
2354 /* Return an integer of type TYPE containing all 1's in as much precision as
2355 it contains, or a complex or vector whose subparts are such integers. */
2358 build_all_ones_cst (tree type
)
2360 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2362 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2363 return build_complex (type
, scalar
, scalar
);
2366 return build_minus_one_cst (type
);
2369 /* Return a constant of arithmetic type TYPE which is the
2370 opposite of the multiplicative identity of the set TYPE. */
2373 build_minus_one_cst (tree type
)
2375 switch (TREE_CODE (type
))
2377 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2378 case POINTER_TYPE
: case REFERENCE_TYPE
:
2380 return build_int_cst (type
, -1);
2383 return build_real (type
, dconstm1
);
2385 case FIXED_POINT_TYPE
:
2386 /* We can only generate 1 for accum types. */
2387 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2388 return build_fixed (type
,
2389 fixed_from_double_int (double_int_minus_one
,
2390 SCALAR_TYPE_MODE (type
)));
2394 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2396 return build_vector_from_val (type
, scalar
);
2400 return build_complex (type
,
2401 build_minus_one_cst (TREE_TYPE (type
)),
2402 build_zero_cst (TREE_TYPE (type
)));
2409 /* Build 0 constant of type TYPE. This is used by constructor folding
2410 and thus the constant should be represented in memory by
2414 build_zero_cst (tree type
)
2416 switch (TREE_CODE (type
))
2418 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2419 case POINTER_TYPE
: case REFERENCE_TYPE
:
2420 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2421 return build_int_cst (type
, 0);
2424 return build_real (type
, dconst0
);
2426 case FIXED_POINT_TYPE
:
2427 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2431 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2433 return build_vector_from_val (type
, scalar
);
2438 tree zero
= build_zero_cst (TREE_TYPE (type
));
2440 return build_complex (type
, zero
, zero
);
2444 if (!AGGREGATE_TYPE_P (type
))
2445 return fold_convert (type
, integer_zero_node
);
2446 return build_constructor (type
, NULL
);
2451 /* Build a BINFO with LEN language slots. */
2454 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2457 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2458 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2460 record_node_allocation_statistics (TREE_BINFO
, length
);
2462 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2464 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2466 TREE_SET_CODE (t
, TREE_BINFO
);
2468 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2473 /* Create a CASE_LABEL_EXPR tree node and return it. */
2476 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2478 tree t
= make_node (CASE_LABEL_EXPR
);
2480 TREE_TYPE (t
) = void_type_node
;
2481 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2483 CASE_LOW (t
) = low_value
;
2484 CASE_HIGH (t
) = high_value
;
2485 CASE_LABEL (t
) = label_decl
;
2486 CASE_CHAIN (t
) = NULL_TREE
;
2491 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2492 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2493 The latter determines the length of the HOST_WIDE_INT vector. */
2496 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2499 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2500 + sizeof (struct tree_int_cst
));
2503 record_node_allocation_statistics (INTEGER_CST
, length
);
2505 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2507 TREE_SET_CODE (t
, INTEGER_CST
);
2508 TREE_INT_CST_NUNITS (t
) = len
;
2509 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2510 /* to_offset can only be applied to trees that are offset_int-sized
2511 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2512 must be exactly the precision of offset_int and so LEN is correct. */
2513 if (ext_len
<= OFFSET_INT_ELTS
)
2514 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2516 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2518 TREE_CONSTANT (t
) = 1;
2523 /* Build a newly constructed TREE_VEC node of length LEN. */
2526 make_tree_vec (int len MEM_STAT_DECL
)
2529 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2531 record_node_allocation_statistics (TREE_VEC
, length
);
2533 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2535 TREE_SET_CODE (t
, TREE_VEC
);
2536 TREE_VEC_LENGTH (t
) = len
;
2541 /* Grow a TREE_VEC node to new length LEN. */
2544 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2546 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2548 int oldlen
= TREE_VEC_LENGTH (v
);
2549 gcc_assert (len
> oldlen
);
2551 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2552 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2554 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2556 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2558 TREE_VEC_LENGTH (v
) = len
;
2563 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2564 fixed, and scalar, complex or vector. */
2567 zerop (const_tree expr
)
2569 return (integer_zerop (expr
)
2570 || real_zerop (expr
)
2571 || fixed_zerop (expr
));
2574 /* Return 1 if EXPR is the integer constant zero or a complex constant
2575 of zero, or a location wrapper for such a constant. */
2578 integer_zerop (const_tree expr
)
2580 STRIP_ANY_LOCATION_WRAPPER (expr
);
2582 switch (TREE_CODE (expr
))
2585 return wi::to_wide (expr
) == 0;
2587 return (integer_zerop (TREE_REALPART (expr
))
2588 && integer_zerop (TREE_IMAGPART (expr
)));
2590 return (VECTOR_CST_NPATTERNS (expr
) == 1
2591 && VECTOR_CST_DUPLICATE_P (expr
)
2592 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2598 /* Return 1 if EXPR is the integer constant one or the corresponding
2599 complex constant, or a location wrapper for such a constant. */
2602 integer_onep (const_tree expr
)
2604 STRIP_ANY_LOCATION_WRAPPER (expr
);
2606 switch (TREE_CODE (expr
))
2609 return wi::eq_p (wi::to_widest (expr
), 1);
2611 return (integer_onep (TREE_REALPART (expr
))
2612 && integer_zerop (TREE_IMAGPART (expr
)));
2614 return (VECTOR_CST_NPATTERNS (expr
) == 1
2615 && VECTOR_CST_DUPLICATE_P (expr
)
2616 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2622 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2623 return 1 if every piece is the integer constant one.
2624 Also return 1 for location wrappers for such a constant. */
2627 integer_each_onep (const_tree expr
)
2629 STRIP_ANY_LOCATION_WRAPPER (expr
);
2631 if (TREE_CODE (expr
) == COMPLEX_CST
)
2632 return (integer_onep (TREE_REALPART (expr
))
2633 && integer_onep (TREE_IMAGPART (expr
)));
2635 return integer_onep (expr
);
2638 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2639 it contains, or a complex or vector whose subparts are such integers,
2640 or a location wrapper for such a constant. */
2643 integer_all_onesp (const_tree expr
)
2645 STRIP_ANY_LOCATION_WRAPPER (expr
);
2647 if (TREE_CODE (expr
) == COMPLEX_CST
2648 && integer_all_onesp (TREE_REALPART (expr
))
2649 && integer_all_onesp (TREE_IMAGPART (expr
)))
2652 else if (TREE_CODE (expr
) == VECTOR_CST
)
2653 return (VECTOR_CST_NPATTERNS (expr
) == 1
2654 && VECTOR_CST_DUPLICATE_P (expr
)
2655 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2657 else if (TREE_CODE (expr
) != INTEGER_CST
)
2660 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2661 == wi::to_wide (expr
));
2664 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2665 for such a constant. */
2668 integer_minus_onep (const_tree expr
)
2670 STRIP_ANY_LOCATION_WRAPPER (expr
);
2672 if (TREE_CODE (expr
) == COMPLEX_CST
)
2673 return (integer_all_onesp (TREE_REALPART (expr
))
2674 && integer_zerop (TREE_IMAGPART (expr
)));
2676 return integer_all_onesp (expr
);
2679 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2680 one bit on), or a location wrapper for such a constant. */
2683 integer_pow2p (const_tree expr
)
2685 STRIP_ANY_LOCATION_WRAPPER (expr
);
2687 if (TREE_CODE (expr
) == COMPLEX_CST
2688 && integer_pow2p (TREE_REALPART (expr
))
2689 && integer_zerop (TREE_IMAGPART (expr
)))
2692 if (TREE_CODE (expr
) != INTEGER_CST
)
2695 return wi::popcount (wi::to_wide (expr
)) == 1;
2698 /* Return 1 if EXPR is an integer constant other than zero or a
2699 complex constant other than zero, or a location wrapper for such a
2703 integer_nonzerop (const_tree expr
)
2705 STRIP_ANY_LOCATION_WRAPPER (expr
);
2707 return ((TREE_CODE (expr
) == INTEGER_CST
2708 && wi::to_wide (expr
) != 0)
2709 || (TREE_CODE (expr
) == COMPLEX_CST
2710 && (integer_nonzerop (TREE_REALPART (expr
))
2711 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2714 /* Return 1 if EXPR is the integer constant one. For vector,
2715 return 1 if every piece is the integer constant minus one
2716 (representing the value TRUE).
2717 Also return 1 for location wrappers for such a constant. */
2720 integer_truep (const_tree expr
)
2722 STRIP_ANY_LOCATION_WRAPPER (expr
);
2724 if (TREE_CODE (expr
) == VECTOR_CST
)
2725 return integer_all_onesp (expr
);
2726 return integer_onep (expr
);
2729 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2730 for such a constant. */
2733 fixed_zerop (const_tree expr
)
2735 STRIP_ANY_LOCATION_WRAPPER (expr
);
2737 return (TREE_CODE (expr
) == FIXED_CST
2738 && TREE_FIXED_CST (expr
).data
.is_zero ());
2741 /* Return the power of two represented by a tree node known to be a
2745 tree_log2 (const_tree expr
)
2747 if (TREE_CODE (expr
) == COMPLEX_CST
)
2748 return tree_log2 (TREE_REALPART (expr
));
2750 return wi::exact_log2 (wi::to_wide (expr
));
2753 /* Similar, but return the largest integer Y such that 2 ** Y is less
2754 than or equal to EXPR. */
2757 tree_floor_log2 (const_tree expr
)
2759 if (TREE_CODE (expr
) == COMPLEX_CST
)
2760 return tree_log2 (TREE_REALPART (expr
));
2762 return wi::floor_log2 (wi::to_wide (expr
));
2765 /* Return number of known trailing zero bits in EXPR, or, if the value of
2766 EXPR is known to be zero, the precision of it's type. */
2769 tree_ctz (const_tree expr
)
2771 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2772 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2775 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2776 switch (TREE_CODE (expr
))
2779 ret1
= wi::ctz (wi::to_wide (expr
));
2780 return MIN (ret1
, prec
);
2782 ret1
= wi::ctz (get_nonzero_bits (expr
));
2783 return MIN (ret1
, prec
);
2790 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2793 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2794 return MIN (ret1
, ret2
);
2795 case POINTER_PLUS_EXPR
:
2796 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2797 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2798 /* Second operand is sizetype, which could be in theory
2799 wider than pointer's precision. Make sure we never
2800 return more than prec. */
2801 ret2
= MIN (ret2
, prec
);
2802 return MIN (ret1
, ret2
);
2804 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2805 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2806 return MAX (ret1
, ret2
);
2808 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2809 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2810 return MIN (ret1
+ ret2
, prec
);
2812 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2813 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2814 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2816 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2817 return MIN (ret1
+ ret2
, prec
);
2821 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2822 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2824 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2825 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2830 case TRUNC_DIV_EXPR
:
2832 case FLOOR_DIV_EXPR
:
2833 case ROUND_DIV_EXPR
:
2834 case EXACT_DIV_EXPR
:
2835 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2836 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2838 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2841 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2849 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2850 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2852 return MIN (ret1
, prec
);
2854 return tree_ctz (TREE_OPERAND (expr
, 0));
2856 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2859 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2860 return MIN (ret1
, ret2
);
2862 return tree_ctz (TREE_OPERAND (expr
, 1));
2864 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2865 if (ret1
> BITS_PER_UNIT
)
2867 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2868 return MIN (ret1
, prec
);
2876 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2877 decimal float constants, so don't return 1 for them.
2878 Also return 1 for location wrappers around such a constant. */
2881 real_zerop (const_tree expr
)
2883 STRIP_ANY_LOCATION_WRAPPER (expr
);
2885 switch (TREE_CODE (expr
))
2888 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2889 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2891 return real_zerop (TREE_REALPART (expr
))
2892 && real_zerop (TREE_IMAGPART (expr
));
2895 /* Don't simply check for a duplicate because the predicate
2896 accepts both +0.0 and -0.0. */
2897 unsigned count
= vector_cst_encoded_nelts (expr
);
2898 for (unsigned int i
= 0; i
< count
; ++i
)
2899 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2908 /* Return 1 if EXPR is the real constant one in real or complex form.
2909 Trailing zeroes matter for decimal float constants, so don't return
2911 Also return 1 for location wrappers around such a constant. */
2914 real_onep (const_tree expr
)
2916 STRIP_ANY_LOCATION_WRAPPER (expr
);
2918 switch (TREE_CODE (expr
))
2921 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2922 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2924 return real_onep (TREE_REALPART (expr
))
2925 && real_zerop (TREE_IMAGPART (expr
));
2927 return (VECTOR_CST_NPATTERNS (expr
) == 1
2928 && VECTOR_CST_DUPLICATE_P (expr
)
2929 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2935 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2936 matter for decimal float constants, so don't return 1 for them.
2937 Also return 1 for location wrappers around such a constant. */
2940 real_minus_onep (const_tree expr
)
2942 STRIP_ANY_LOCATION_WRAPPER (expr
);
2944 switch (TREE_CODE (expr
))
2947 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2948 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2950 return real_minus_onep (TREE_REALPART (expr
))
2951 && real_zerop (TREE_IMAGPART (expr
));
2953 return (VECTOR_CST_NPATTERNS (expr
) == 1
2954 && VECTOR_CST_DUPLICATE_P (expr
)
2955 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2961 /* Nonzero if EXP is a constant or a cast of a constant. */
2964 really_constant_p (const_tree exp
)
2966 /* This is not quite the same as STRIP_NOPS. It does more. */
2967 while (CONVERT_EXPR_P (exp
)
2968 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2969 exp
= TREE_OPERAND (exp
, 0);
2970 return TREE_CONSTANT (exp
);
2973 /* Return true if T holds a polynomial pointer difference, storing it in
2974 *VALUE if so. A true return means that T's precision is no greater
2975 than 64 bits, which is the largest address space we support, so *VALUE
2976 never loses precision. However, the signedness of the result does
2977 not necessarily match the signedness of T: sometimes an unsigned type
2978 like sizetype is used to encode a value that is actually negative. */
2981 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2985 if (TREE_CODE (t
) == INTEGER_CST
)
2987 if (!cst_and_fits_in_hwi (t
))
2989 *value
= int_cst_value (t
);
2992 if (POLY_INT_CST_P (t
))
2994 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2995 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2997 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2998 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
3005 tree_to_poly_int64 (const_tree t
)
3007 gcc_assert (tree_fits_poly_int64_p (t
));
3008 if (POLY_INT_CST_P (t
))
3009 return poly_int_cst_value (t
).force_shwi ();
3010 return TREE_INT_CST_LOW (t
);
3014 tree_to_poly_uint64 (const_tree t
)
3016 gcc_assert (tree_fits_poly_uint64_p (t
));
3017 if (POLY_INT_CST_P (t
))
3018 return poly_int_cst_value (t
).force_uhwi ();
3019 return TREE_INT_CST_LOW (t
);
3022 /* Return first list element whose TREE_VALUE is ELEM.
3023 Return 0 if ELEM is not in LIST. */
3026 value_member (tree elem
, tree list
)
3030 if (elem
== TREE_VALUE (list
))
3032 list
= TREE_CHAIN (list
);
3037 /* Return first list element whose TREE_PURPOSE is ELEM.
3038 Return 0 if ELEM is not in LIST. */
3041 purpose_member (const_tree elem
, tree list
)
3045 if (elem
== TREE_PURPOSE (list
))
3047 list
= TREE_CHAIN (list
);
3052 /* Return true if ELEM is in V. */
3055 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3059 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3065 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3069 chain_index (int idx
, tree chain
)
3071 for (; chain
&& idx
> 0; --idx
)
3072 chain
= TREE_CHAIN (chain
);
3076 /* Return nonzero if ELEM is part of the chain CHAIN. */
3079 chain_member (const_tree elem
, const_tree chain
)
3085 chain
= DECL_CHAIN (chain
);
3091 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3092 We expect a null pointer to mark the end of the chain.
3093 This is the Lisp primitive `length'. */
3096 list_length (const_tree t
)
3099 #ifdef ENABLE_TREE_CHECKING
3107 #ifdef ENABLE_TREE_CHECKING
3110 gcc_assert (p
!= q
);
3118 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3119 UNION_TYPE TYPE, or NULL_TREE if none. */
3122 first_field (const_tree type
)
3124 tree t
= TYPE_FIELDS (type
);
3125 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3130 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3131 UNION_TYPE TYPE, or NULL_TREE if none. */
3134 last_field (const_tree type
)
3136 tree last
= NULL_TREE
;
3138 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3140 if (TREE_CODE (fld
) != FIELD_DECL
)
3149 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3150 by modifying the last node in chain 1 to point to chain 2.
3151 This is the Lisp primitive `nconc'. */
3154 chainon (tree op1
, tree op2
)
3163 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3165 TREE_CHAIN (t1
) = op2
;
3167 #ifdef ENABLE_TREE_CHECKING
3170 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3171 gcc_assert (t2
!= t1
);
3178 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3181 tree_last (tree chain
)
3185 while ((next
= TREE_CHAIN (chain
)))
3190 /* Reverse the order of elements in the chain T,
3191 and return the new head of the chain (old last element). */
3196 tree prev
= 0, decl
, next
;
3197 for (decl
= t
; decl
; decl
= next
)
3199 /* We shouldn't be using this function to reverse BLOCK chains; we
3200 have blocks_nreverse for that. */
3201 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3202 next
= TREE_CHAIN (decl
);
3203 TREE_CHAIN (decl
) = prev
;
3209 /* Return a newly created TREE_LIST node whose
3210 purpose and value fields are PARM and VALUE. */
3213 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3215 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3216 TREE_PURPOSE (t
) = parm
;
3217 TREE_VALUE (t
) = value
;
3221 /* Build a chain of TREE_LIST nodes from a vector. */
3224 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3226 tree ret
= NULL_TREE
;
3230 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3232 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3233 pp
= &TREE_CHAIN (*pp
);
3238 /* Return a newly created TREE_LIST node whose
3239 purpose and value fields are PURPOSE and VALUE
3240 and whose TREE_CHAIN is CHAIN. */
3243 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3247 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3248 memset (node
, 0, sizeof (struct tree_common
));
3250 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3252 TREE_SET_CODE (node
, TREE_LIST
);
3253 TREE_CHAIN (node
) = chain
;
3254 TREE_PURPOSE (node
) = purpose
;
3255 TREE_VALUE (node
) = value
;
3259 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3263 ctor_to_vec (tree ctor
)
3265 vec
<tree
, va_gc
> *vec
;
3266 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3270 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3271 vec
->quick_push (val
);
3276 /* Return the size nominally occupied by an object of type TYPE
3277 when it resides in memory. The value is measured in units of bytes,
3278 and its data type is that normally used for type sizes
3279 (which is the first type created by make_signed_type or
3280 make_unsigned_type). */
3283 size_in_bytes_loc (location_t loc
, const_tree type
)
3287 if (type
== error_mark_node
)
3288 return integer_zero_node
;
3290 type
= TYPE_MAIN_VARIANT (type
);
3291 t
= TYPE_SIZE_UNIT (type
);
3295 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3296 return size_zero_node
;
3302 /* Return the size of TYPE (in bytes) as a wide integer
3303 or return -1 if the size can vary or is larger than an integer. */
3306 int_size_in_bytes (const_tree type
)
3310 if (type
== error_mark_node
)
3313 type
= TYPE_MAIN_VARIANT (type
);
3314 t
= TYPE_SIZE_UNIT (type
);
3316 if (t
&& tree_fits_uhwi_p (t
))
3317 return TREE_INT_CST_LOW (t
);
3322 /* Return the maximum size of TYPE (in bytes) as a wide integer
3323 or return -1 if the size can vary or is larger than an integer. */
3326 max_int_size_in_bytes (const_tree type
)
3328 HOST_WIDE_INT size
= -1;
3331 /* If this is an array type, check for a possible MAX_SIZE attached. */
3333 if (TREE_CODE (type
) == ARRAY_TYPE
)
3335 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3337 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3338 size
= tree_to_uhwi (size_tree
);
3341 /* If we still haven't been able to get a size, see if the language
3342 can compute a maximum size. */
3346 size_tree
= lang_hooks
.types
.max_size (type
);
3348 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3349 size
= tree_to_uhwi (size_tree
);
3355 /* Return the bit position of FIELD, in bits from the start of the record.
3356 This is a tree of type bitsizetype. */
3359 bit_position (const_tree field
)
3361 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3362 DECL_FIELD_BIT_OFFSET (field
));
3365 /* Return the byte position of FIELD, in bytes from the start of the record.
3366 This is a tree of type sizetype. */
3369 byte_position (const_tree field
)
3371 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3372 DECL_FIELD_BIT_OFFSET (field
));
3375 /* Likewise, but return as an integer. It must be representable in
3376 that way (since it could be a signed value, we don't have the
3377 option of returning -1 like int_size_in_byte can. */
3380 int_byte_position (const_tree field
)
3382 return tree_to_shwi (byte_position (field
));
3385 /* Return, as a tree node, the number of elements for TYPE (which is an
3386 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3389 array_type_nelts (const_tree type
)
3391 tree index_type
, min
, max
;
3393 /* If they did it with unspecified bounds, then we should have already
3394 given an error about it before we got here. */
3395 if (! TYPE_DOMAIN (type
))
3396 return error_mark_node
;
3398 index_type
= TYPE_DOMAIN (type
);
3399 min
= TYPE_MIN_VALUE (index_type
);
3400 max
= TYPE_MAX_VALUE (index_type
);
3402 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3404 return error_mark_node
;
3406 return (integer_zerop (min
)
3408 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3411 /* If arg is static -- a reference to an object in static storage -- then
3412 return the object. This is not the same as the C meaning of `static'.
3413 If arg isn't static, return NULL. */
3418 switch (TREE_CODE (arg
))
3421 /* Nested functions are static, even though taking their address will
3422 involve a trampoline as we unnest the nested function and create
3423 the trampoline on the tree level. */
3427 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3428 && ! DECL_THREAD_LOCAL_P (arg
)
3429 && ! DECL_DLLIMPORT_P (arg
)
3433 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3437 return TREE_STATIC (arg
) ? arg
: NULL
;
3444 /* If the thing being referenced is not a field, then it is
3445 something language specific. */
3446 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3448 /* If we are referencing a bitfield, we can't evaluate an
3449 ADDR_EXPR at compile time and so it isn't a constant. */
3450 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3453 return staticp (TREE_OPERAND (arg
, 0));
3459 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3462 case ARRAY_RANGE_REF
:
3463 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3464 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3465 return staticp (TREE_OPERAND (arg
, 0));
3469 case COMPOUND_LITERAL_EXPR
:
3470 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3480 /* Return whether OP is a DECL whose address is function-invariant. */
3483 decl_address_invariant_p (const_tree op
)
3485 /* The conditions below are slightly less strict than the one in
3488 switch (TREE_CODE (op
))
3497 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3498 || DECL_THREAD_LOCAL_P (op
)
3499 || DECL_CONTEXT (op
) == current_function_decl
3500 || decl_function_context (op
) == current_function_decl
)
3505 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3506 || decl_function_context (op
) == current_function_decl
)
3517 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3520 decl_address_ip_invariant_p (const_tree op
)
3522 /* The conditions below are slightly less strict than the one in
3525 switch (TREE_CODE (op
))
3533 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3534 && !DECL_DLLIMPORT_P (op
))
3535 || DECL_THREAD_LOCAL_P (op
))
3540 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3552 /* Return true if T is function-invariant (internal function, does
3553 not handle arithmetic; that's handled in skip_simple_arithmetic and
3554 tree_invariant_p). */
3557 tree_invariant_p_1 (tree t
)
3561 if (TREE_CONSTANT (t
)
3562 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3565 switch (TREE_CODE (t
))
3571 op
= TREE_OPERAND (t
, 0);
3572 while (handled_component_p (op
))
3574 switch (TREE_CODE (op
))
3577 case ARRAY_RANGE_REF
:
3578 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3579 || TREE_OPERAND (op
, 2) != NULL_TREE
3580 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3585 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3591 op
= TREE_OPERAND (op
, 0);
3594 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3603 /* Return true if T is function-invariant. */
3606 tree_invariant_p (tree t
)
3608 tree inner
= skip_simple_arithmetic (t
);
3609 return tree_invariant_p_1 (inner
);
3612 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3613 Do this to any expression which may be used in more than one place,
3614 but must be evaluated only once.
3616 Normally, expand_expr would reevaluate the expression each time.
3617 Calling save_expr produces something that is evaluated and recorded
3618 the first time expand_expr is called on it. Subsequent calls to
3619 expand_expr just reuse the recorded value.
3621 The call to expand_expr that generates code that actually computes
3622 the value is the first call *at compile time*. Subsequent calls
3623 *at compile time* generate code to use the saved value.
3624 This produces correct result provided that *at run time* control
3625 always flows through the insns made by the first expand_expr
3626 before reaching the other places where the save_expr was evaluated.
3627 You, the caller of save_expr, must make sure this is so.
3629 Constants, and certain read-only nodes, are returned with no
3630 SAVE_EXPR because that is safe. Expressions containing placeholders
3631 are not touched; see tree.def for an explanation of what these
3635 save_expr (tree expr
)
3639 /* If the tree evaluates to a constant, then we don't want to hide that
3640 fact (i.e. this allows further folding, and direct checks for constants).
3641 However, a read-only object that has side effects cannot be bypassed.
3642 Since it is no problem to reevaluate literals, we just return the
3644 inner
= skip_simple_arithmetic (expr
);
3645 if (TREE_CODE (inner
) == ERROR_MARK
)
3648 if (tree_invariant_p_1 (inner
))
3651 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3652 it means that the size or offset of some field of an object depends on
3653 the value within another field.
3655 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3656 and some variable since it would then need to be both evaluated once and
3657 evaluated more than once. Front-ends must assure this case cannot
3658 happen by surrounding any such subexpressions in their own SAVE_EXPR
3659 and forcing evaluation at the proper time. */
3660 if (contains_placeholder_p (inner
))
3663 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3665 /* This expression might be placed ahead of a jump to ensure that the
3666 value was computed on both sides of the jump. So make sure it isn't
3667 eliminated as dead. */
3668 TREE_SIDE_EFFECTS (expr
) = 1;
3672 /* Look inside EXPR into any simple arithmetic operations. Return the
3673 outermost non-arithmetic or non-invariant node. */
3676 skip_simple_arithmetic (tree expr
)
3678 /* We don't care about whether this can be used as an lvalue in this
3680 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3681 expr
= TREE_OPERAND (expr
, 0);
3683 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3684 a constant, it will be more efficient to not make another SAVE_EXPR since
3685 it will allow better simplification and GCSE will be able to merge the
3686 computations if they actually occur. */
3689 if (UNARY_CLASS_P (expr
))
3690 expr
= TREE_OPERAND (expr
, 0);
3691 else if (BINARY_CLASS_P (expr
))
3693 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3694 expr
= TREE_OPERAND (expr
, 0);
3695 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3696 expr
= TREE_OPERAND (expr
, 1);
3707 /* Look inside EXPR into simple arithmetic operations involving constants.
3708 Return the outermost non-arithmetic or non-constant node. */
3711 skip_simple_constant_arithmetic (tree expr
)
3713 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3714 expr
= TREE_OPERAND (expr
, 0);
3718 if (UNARY_CLASS_P (expr
))
3719 expr
= TREE_OPERAND (expr
, 0);
3720 else if (BINARY_CLASS_P (expr
))
3722 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3723 expr
= TREE_OPERAND (expr
, 0);
3724 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3725 expr
= TREE_OPERAND (expr
, 1);
3736 /* Return which tree structure is used by T. */
3738 enum tree_node_structure_enum
3739 tree_node_structure (const_tree t
)
3741 const enum tree_code code
= TREE_CODE (t
);
3742 return tree_node_structure_for_code (code
);
3745 /* Set various status flags when building a CALL_EXPR object T. */
3748 process_call_operands (tree t
)
3750 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3751 bool read_only
= false;
3752 int i
= call_expr_flags (t
);
3754 /* Calls have side-effects, except those to const or pure functions. */
3755 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3756 side_effects
= true;
3757 /* Propagate TREE_READONLY of arguments for const functions. */
3761 if (!side_effects
|| read_only
)
3762 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3764 tree op
= TREE_OPERAND (t
, i
);
3765 if (op
&& TREE_SIDE_EFFECTS (op
))
3766 side_effects
= true;
3767 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3771 TREE_SIDE_EFFECTS (t
) = side_effects
;
3772 TREE_READONLY (t
) = read_only
;
3775 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3776 size or offset that depends on a field within a record. */
3779 contains_placeholder_p (const_tree exp
)
3781 enum tree_code code
;
3786 code
= TREE_CODE (exp
);
3787 if (code
== PLACEHOLDER_EXPR
)
3790 switch (TREE_CODE_CLASS (code
))
3793 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3794 position computations since they will be converted into a
3795 WITH_RECORD_EXPR involving the reference, which will assume
3796 here will be valid. */
3797 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3799 case tcc_exceptional
:
3800 if (code
== TREE_LIST
)
3801 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3802 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3807 case tcc_comparison
:
3808 case tcc_expression
:
3812 /* Ignoring the first operand isn't quite right, but works best. */
3813 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3816 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3817 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3818 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3821 /* The save_expr function never wraps anything containing
3822 a PLACEHOLDER_EXPR. */
3829 switch (TREE_CODE_LENGTH (code
))
3832 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3834 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3835 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3846 const_call_expr_arg_iterator iter
;
3847 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3848 if (CONTAINS_PLACEHOLDER_P (arg
))
3862 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3863 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3867 type_contains_placeholder_1 (const_tree type
)
3869 /* If the size contains a placeholder or the parent type (component type in
3870 the case of arrays) type involves a placeholder, this type does. */
3871 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3872 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3873 || (!POINTER_TYPE_P (type
)
3875 && type_contains_placeholder_p (TREE_TYPE (type
))))
3878 /* Now do type-specific checks. Note that the last part of the check above
3879 greatly limits what we have to do below. */
3880 switch (TREE_CODE (type
))
3888 case REFERENCE_TYPE
:
3897 case FIXED_POINT_TYPE
:
3898 /* Here we just check the bounds. */
3899 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3900 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3903 /* We have already checked the component type above, so just check
3904 the domain type. Flexible array members have a null domain. */
3905 return TYPE_DOMAIN (type
) ?
3906 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3910 case QUAL_UNION_TYPE
:
3914 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3915 if (TREE_CODE (field
) == FIELD_DECL
3916 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3917 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3918 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3919 || type_contains_placeholder_p (TREE_TYPE (field
))))
3930 /* Wrapper around above function used to cache its result. */
3933 type_contains_placeholder_p (tree type
)
3937 /* If the contains_placeholder_bits field has been initialized,
3938 then we know the answer. */
3939 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3940 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3942 /* Indicate that we've seen this type node, and the answer is false.
3943 This is what we want to return if we run into recursion via fields. */
3944 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3946 /* Compute the real value. */
3947 result
= type_contains_placeholder_1 (type
);
3949 /* Store the real value. */
3950 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3955 /* Push tree EXP onto vector QUEUE if it is not already present. */
3958 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3963 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3964 if (simple_cst_equal (iter
, exp
) == 1)
3968 queue
->safe_push (exp
);
3971 /* Given a tree EXP, find all occurrences of references to fields
3972 in a PLACEHOLDER_EXPR and place them in vector REFS without
3973 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3974 we assume here that EXP contains only arithmetic expressions
3975 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3979 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3981 enum tree_code code
= TREE_CODE (exp
);
3985 /* We handle TREE_LIST and COMPONENT_REF separately. */
3986 if (code
== TREE_LIST
)
3988 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3989 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3991 else if (code
== COMPONENT_REF
)
3993 for (inner
= TREE_OPERAND (exp
, 0);
3994 REFERENCE_CLASS_P (inner
);
3995 inner
= TREE_OPERAND (inner
, 0))
3998 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3999 push_without_duplicates (exp
, refs
);
4001 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
4004 switch (TREE_CODE_CLASS (code
))
4009 case tcc_declaration
:
4010 /* Variables allocated to static storage can stay. */
4011 if (!TREE_STATIC (exp
))
4012 push_without_duplicates (exp
, refs
);
4015 case tcc_expression
:
4016 /* This is the pattern built in ada/make_aligning_type. */
4017 if (code
== ADDR_EXPR
4018 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
4020 push_without_duplicates (exp
, refs
);
4026 case tcc_exceptional
:
4029 case tcc_comparison
:
4031 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4032 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4036 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4037 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4045 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4046 return a tree with all occurrences of references to F in a
4047 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4048 CONST_DECLs. Note that we assume here that EXP contains only
4049 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4050 occurring only in their argument list. */
4053 substitute_in_expr (tree exp
, tree f
, tree r
)
4055 enum tree_code code
= TREE_CODE (exp
);
4056 tree op0
, op1
, op2
, op3
;
4059 /* We handle TREE_LIST and COMPONENT_REF separately. */
4060 if (code
== TREE_LIST
)
4062 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4063 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4064 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4067 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4069 else if (code
== COMPONENT_REF
)
4073 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4074 and it is the right field, replace it with R. */
4075 for (inner
= TREE_OPERAND (exp
, 0);
4076 REFERENCE_CLASS_P (inner
);
4077 inner
= TREE_OPERAND (inner
, 0))
4081 op1
= TREE_OPERAND (exp
, 1);
4083 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4086 /* If this expression hasn't been completed let, leave it alone. */
4087 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4090 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4091 if (op0
== TREE_OPERAND (exp
, 0))
4095 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4098 switch (TREE_CODE_CLASS (code
))
4103 case tcc_declaration
:
4109 case tcc_expression
:
4115 case tcc_exceptional
:
4118 case tcc_comparison
:
4120 switch (TREE_CODE_LENGTH (code
))
4126 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4127 if (op0
== TREE_OPERAND (exp
, 0))
4130 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4134 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4135 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4137 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4140 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4144 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4145 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4146 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4148 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4149 && op2
== TREE_OPERAND (exp
, 2))
4152 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4156 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4157 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4158 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4159 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4161 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4162 && op2
== TREE_OPERAND (exp
, 2)
4163 && op3
== TREE_OPERAND (exp
, 3))
4167 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4179 new_tree
= NULL_TREE
;
4181 /* If we are trying to replace F with a constant or with another
4182 instance of one of the arguments of the call, inline back
4183 functions which do nothing else than computing a value from
4184 the arguments they are passed. This makes it possible to
4185 fold partially or entirely the replacement expression. */
4186 if (code
== CALL_EXPR
)
4188 bool maybe_inline
= false;
4189 if (CONSTANT_CLASS_P (r
))
4190 maybe_inline
= true;
4192 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4193 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4195 maybe_inline
= true;
4200 tree t
= maybe_inline_call_in_expr (exp
);
4202 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4206 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4208 tree op
= TREE_OPERAND (exp
, i
);
4209 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4213 new_tree
= copy_node (exp
);
4214 TREE_OPERAND (new_tree
, i
) = new_op
;
4220 new_tree
= fold (new_tree
);
4221 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4222 process_call_operands (new_tree
);
4233 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4235 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4236 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4241 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4242 for it within OBJ, a tree that is an object or a chain of references. */
4245 substitute_placeholder_in_expr (tree exp
, tree obj
)
4247 enum tree_code code
= TREE_CODE (exp
);
4248 tree op0
, op1
, op2
, op3
;
4251 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4252 in the chain of OBJ. */
4253 if (code
== PLACEHOLDER_EXPR
)
4255 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4258 for (elt
= obj
; elt
!= 0;
4259 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4260 || TREE_CODE (elt
) == COND_EXPR
)
4261 ? TREE_OPERAND (elt
, 1)
4262 : (REFERENCE_CLASS_P (elt
)
4263 || UNARY_CLASS_P (elt
)
4264 || BINARY_CLASS_P (elt
)
4265 || VL_EXP_CLASS_P (elt
)
4266 || EXPRESSION_CLASS_P (elt
))
4267 ? TREE_OPERAND (elt
, 0) : 0))
4268 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4271 for (elt
= obj
; elt
!= 0;
4272 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4273 || TREE_CODE (elt
) == COND_EXPR
)
4274 ? TREE_OPERAND (elt
, 1)
4275 : (REFERENCE_CLASS_P (elt
)
4276 || UNARY_CLASS_P (elt
)
4277 || BINARY_CLASS_P (elt
)
4278 || VL_EXP_CLASS_P (elt
)
4279 || EXPRESSION_CLASS_P (elt
))
4280 ? TREE_OPERAND (elt
, 0) : 0))
4281 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4282 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4284 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4286 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4287 survives until RTL generation, there will be an error. */
4291 /* TREE_LIST is special because we need to look at TREE_VALUE
4292 and TREE_CHAIN, not TREE_OPERANDS. */
4293 else if (code
== TREE_LIST
)
4295 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4296 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4297 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4300 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4303 switch (TREE_CODE_CLASS (code
))
4306 case tcc_declaration
:
4309 case tcc_exceptional
:
4312 case tcc_comparison
:
4313 case tcc_expression
:
4316 switch (TREE_CODE_LENGTH (code
))
4322 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4323 if (op0
== TREE_OPERAND (exp
, 0))
4326 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4330 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4331 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4333 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4336 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4340 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4341 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4342 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4344 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4345 && op2
== TREE_OPERAND (exp
, 2))
4348 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4352 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4353 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4354 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4355 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4357 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4358 && op2
== TREE_OPERAND (exp
, 2)
4359 && op3
== TREE_OPERAND (exp
, 3))
4363 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4375 new_tree
= NULL_TREE
;
4377 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4379 tree op
= TREE_OPERAND (exp
, i
);
4380 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4384 new_tree
= copy_node (exp
);
4385 TREE_OPERAND (new_tree
, i
) = new_op
;
4391 new_tree
= fold (new_tree
);
4392 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4393 process_call_operands (new_tree
);
4404 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4406 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4407 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4413 /* Subroutine of stabilize_reference; this is called for subtrees of
4414 references. Any expression with side-effects must be put in a SAVE_EXPR
4415 to ensure that it is only evaluated once.
4417 We don't put SAVE_EXPR nodes around everything, because assigning very
4418 simple expressions to temporaries causes us to miss good opportunities
4419 for optimizations. Among other things, the opportunity to fold in the
4420 addition of a constant into an addressing mode often gets lost, e.g.
4421 "y[i+1] += x;". In general, we take the approach that we should not make
4422 an assignment unless we are forced into it - i.e., that any non-side effect
4423 operator should be allowed, and that cse should take care of coalescing
4424 multiple utterances of the same expression should that prove fruitful. */
4427 stabilize_reference_1 (tree e
)
4430 enum tree_code code
= TREE_CODE (e
);
4432 /* We cannot ignore const expressions because it might be a reference
4433 to a const array but whose index contains side-effects. But we can
4434 ignore things that are actual constant or that already have been
4435 handled by this function. */
4437 if (tree_invariant_p (e
))
4440 switch (TREE_CODE_CLASS (code
))
4442 case tcc_exceptional
:
4443 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4444 have side-effects. */
4445 if (code
== STATEMENT_LIST
)
4446 return save_expr (e
);
4449 case tcc_declaration
:
4450 case tcc_comparison
:
4452 case tcc_expression
:
4455 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4456 so that it will only be evaluated once. */
4457 /* The reference (r) and comparison (<) classes could be handled as
4458 below, but it is generally faster to only evaluate them once. */
4459 if (TREE_SIDE_EFFECTS (e
))
4460 return save_expr (e
);
4464 /* Constants need no processing. In fact, we should never reach
4469 /* Division is slow and tends to be compiled with jumps,
4470 especially the division by powers of 2 that is often
4471 found inside of an array reference. So do it just once. */
4472 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4473 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4474 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4475 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4476 return save_expr (e
);
4477 /* Recursively stabilize each operand. */
4478 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4479 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4483 /* Recursively stabilize each operand. */
4484 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4491 TREE_TYPE (result
) = TREE_TYPE (e
);
4492 TREE_READONLY (result
) = TREE_READONLY (e
);
4493 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4494 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4499 /* Stabilize a reference so that we can use it any number of times
4500 without causing its operands to be evaluated more than once.
4501 Returns the stabilized reference. This works by means of save_expr,
4502 so see the caveats in the comments about save_expr.
4504 Also allows conversion expressions whose operands are references.
4505 Any other kind of expression is returned unchanged. */
4508 stabilize_reference (tree ref
)
4511 enum tree_code code
= TREE_CODE (ref
);
4518 /* No action is needed in this case. */
4523 case FIX_TRUNC_EXPR
:
4524 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4528 result
= build_nt (INDIRECT_REF
,
4529 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4533 result
= build_nt (COMPONENT_REF
,
4534 stabilize_reference (TREE_OPERAND (ref
, 0)),
4535 TREE_OPERAND (ref
, 1), NULL_TREE
);
4539 result
= build_nt (BIT_FIELD_REF
,
4540 stabilize_reference (TREE_OPERAND (ref
, 0)),
4541 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4542 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4546 result
= build_nt (ARRAY_REF
,
4547 stabilize_reference (TREE_OPERAND (ref
, 0)),
4548 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4549 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4552 case ARRAY_RANGE_REF
:
4553 result
= build_nt (ARRAY_RANGE_REF
,
4554 stabilize_reference (TREE_OPERAND (ref
, 0)),
4555 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4556 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4560 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4561 it wouldn't be ignored. This matters when dealing with
4563 return stabilize_reference_1 (ref
);
4565 /* If arg isn't a kind of lvalue we recognize, make no change.
4566 Caller should recognize the error for an invalid lvalue. */
4571 return error_mark_node
;
4574 TREE_TYPE (result
) = TREE_TYPE (ref
);
4575 TREE_READONLY (result
) = TREE_READONLY (ref
);
4576 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4577 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4582 /* Low-level constructors for expressions. */
4584 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4585 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4588 recompute_tree_invariant_for_addr_expr (tree t
)
4591 bool tc
= true, se
= false;
4593 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4595 /* We started out assuming this address is both invariant and constant, but
4596 does not have side effects. Now go down any handled components and see if
4597 any of them involve offsets that are either non-constant or non-invariant.
4598 Also check for side-effects.
4600 ??? Note that this code makes no attempt to deal with the case where
4601 taking the address of something causes a copy due to misalignment. */
4603 #define UPDATE_FLAGS(NODE) \
4604 do { tree _node = (NODE); \
4605 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4606 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4608 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4609 node
= TREE_OPERAND (node
, 0))
4611 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4612 array reference (probably made temporarily by the G++ front end),
4613 so ignore all the operands. */
4614 if ((TREE_CODE (node
) == ARRAY_REF
4615 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4616 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4618 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4619 if (TREE_OPERAND (node
, 2))
4620 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4621 if (TREE_OPERAND (node
, 3))
4622 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4624 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4625 FIELD_DECL, apparently. The G++ front end can put something else
4626 there, at least temporarily. */
4627 else if (TREE_CODE (node
) == COMPONENT_REF
4628 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4630 if (TREE_OPERAND (node
, 2))
4631 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4635 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4637 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4638 the address, since &(*a)->b is a form of addition. If it's a constant, the
4639 address is constant too. If it's a decl, its address is constant if the
4640 decl is static. Everything else is not constant and, furthermore,
4641 taking the address of a volatile variable is not volatile. */
4642 if (TREE_CODE (node
) == INDIRECT_REF
4643 || TREE_CODE (node
) == MEM_REF
)
4644 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4645 else if (CONSTANT_CLASS_P (node
))
4647 else if (DECL_P (node
))
4648 tc
&= (staticp (node
) != NULL_TREE
);
4652 se
|= TREE_SIDE_EFFECTS (node
);
4656 TREE_CONSTANT (t
) = tc
;
4657 TREE_SIDE_EFFECTS (t
) = se
;
4661 /* Build an expression of code CODE, data type TYPE, and operands as
4662 specified. Expressions and reference nodes can be created this way.
4663 Constants, decls, types and misc nodes cannot be.
4665 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4666 enough for all extant tree codes. */
4669 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4673 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4675 t
= make_node (code PASS_MEM_STAT
);
4682 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4684 int length
= sizeof (struct tree_exp
);
4687 record_node_allocation_statistics (code
, length
);
4689 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4691 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4693 memset (t
, 0, sizeof (struct tree_common
));
4695 TREE_SET_CODE (t
, code
);
4697 TREE_TYPE (t
) = type
;
4698 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4699 TREE_OPERAND (t
, 0) = node
;
4700 if (node
&& !TYPE_P (node
))
4702 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4703 TREE_READONLY (t
) = TREE_READONLY (node
);
4706 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4708 if (code
!= DEBUG_BEGIN_STMT
)
4709 TREE_SIDE_EFFECTS (t
) = 1;
4714 /* All of these have side-effects, no matter what their
4716 TREE_SIDE_EFFECTS (t
) = 1;
4717 TREE_READONLY (t
) = 0;
4721 /* Whether a dereference is readonly has nothing to do with whether
4722 its operand is readonly. */
4723 TREE_READONLY (t
) = 0;
4728 recompute_tree_invariant_for_addr_expr (t
);
4732 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4733 && node
&& !TYPE_P (node
)
4734 && TREE_CONSTANT (node
))
4735 TREE_CONSTANT (t
) = 1;
4736 if (TREE_CODE_CLASS (code
) == tcc_reference
4737 && node
&& TREE_THIS_VOLATILE (node
))
4738 TREE_THIS_VOLATILE (t
) = 1;
4745 #define PROCESS_ARG(N) \
4747 TREE_OPERAND (t, N) = arg##N; \
4748 if (arg##N &&!TYPE_P (arg##N)) \
4750 if (TREE_SIDE_EFFECTS (arg##N)) \
4752 if (!TREE_READONLY (arg##N) \
4753 && !CONSTANT_CLASS_P (arg##N)) \
4754 (void) (read_only = 0); \
4755 if (!TREE_CONSTANT (arg##N)) \
4756 (void) (constant = 0); \
4761 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4763 bool constant
, read_only
, side_effects
, div_by_zero
;
4766 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4768 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4769 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4770 /* When sizetype precision doesn't match that of pointers
4771 we need to be able to build explicit extensions or truncations
4772 of the offset argument. */
4773 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4774 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4775 && TREE_CODE (arg1
) == INTEGER_CST
);
4777 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4778 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4779 && ptrofftype_p (TREE_TYPE (arg1
)));
4781 t
= make_node (code PASS_MEM_STAT
);
4784 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4785 result based on those same flags for the arguments. But if the
4786 arguments aren't really even `tree' expressions, we shouldn't be trying
4789 /* Expressions without side effects may be constant if their
4790 arguments are as well. */
4791 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4792 || TREE_CODE_CLASS (code
) == tcc_binary
);
4794 side_effects
= TREE_SIDE_EFFECTS (t
);
4798 case TRUNC_DIV_EXPR
:
4800 case FLOOR_DIV_EXPR
:
4801 case ROUND_DIV_EXPR
:
4802 case EXACT_DIV_EXPR
:
4804 case FLOOR_MOD_EXPR
:
4805 case ROUND_MOD_EXPR
:
4806 case TRUNC_MOD_EXPR
:
4807 div_by_zero
= integer_zerop (arg1
);
4810 div_by_zero
= false;
4816 TREE_SIDE_EFFECTS (t
) = side_effects
;
4817 if (code
== MEM_REF
)
4819 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4821 tree o
= TREE_OPERAND (arg0
, 0);
4822 TREE_READONLY (t
) = TREE_READONLY (o
);
4823 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4828 TREE_READONLY (t
) = read_only
;
4829 /* Don't mark X / 0 as constant. */
4830 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4831 TREE_THIS_VOLATILE (t
)
4832 = (TREE_CODE_CLASS (code
) == tcc_reference
4833 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4841 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4842 tree arg2 MEM_STAT_DECL
)
4844 bool constant
, read_only
, side_effects
;
4847 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4848 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4850 t
= make_node (code PASS_MEM_STAT
);
4855 /* As a special exception, if COND_EXPR has NULL branches, we
4856 assume that it is a gimple statement and always consider
4857 it to have side effects. */
4858 if (code
== COND_EXPR
4859 && tt
== void_type_node
4860 && arg1
== NULL_TREE
4861 && arg2
== NULL_TREE
)
4862 side_effects
= true;
4864 side_effects
= TREE_SIDE_EFFECTS (t
);
4870 if (code
== COND_EXPR
)
4871 TREE_READONLY (t
) = read_only
;
4873 TREE_SIDE_EFFECTS (t
) = side_effects
;
4874 TREE_THIS_VOLATILE (t
)
4875 = (TREE_CODE_CLASS (code
) == tcc_reference
4876 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4882 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4883 tree arg2
, tree arg3 MEM_STAT_DECL
)
4885 bool constant
, read_only
, side_effects
;
4888 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4890 t
= make_node (code PASS_MEM_STAT
);
4893 side_effects
= TREE_SIDE_EFFECTS (t
);
4900 TREE_SIDE_EFFECTS (t
) = side_effects
;
4901 TREE_THIS_VOLATILE (t
)
4902 = (TREE_CODE_CLASS (code
) == tcc_reference
4903 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4909 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4910 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4912 bool constant
, read_only
, side_effects
;
4915 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4917 t
= make_node (code PASS_MEM_STAT
);
4920 side_effects
= TREE_SIDE_EFFECTS (t
);
4928 TREE_SIDE_EFFECTS (t
) = side_effects
;
4929 if (code
== TARGET_MEM_REF
)
4931 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4933 tree o
= TREE_OPERAND (arg0
, 0);
4934 TREE_READONLY (t
) = TREE_READONLY (o
);
4935 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4939 TREE_THIS_VOLATILE (t
)
4940 = (TREE_CODE_CLASS (code
) == tcc_reference
4941 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4946 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4947 on the pointer PTR. */
4950 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4952 poly_int64 offset
= 0;
4953 tree ptype
= TREE_TYPE (ptr
);
4955 /* For convenience allow addresses that collapse to a simple base
4957 if (TREE_CODE (ptr
) == ADDR_EXPR
4958 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4959 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4961 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4963 if (TREE_CODE (ptr
) == MEM_REF
)
4965 offset
+= mem_ref_offset (ptr
).force_shwi ();
4966 ptr
= TREE_OPERAND (ptr
, 0);
4969 ptr
= build_fold_addr_expr (ptr
);
4970 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4972 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4973 ptr
, build_int_cst (ptype
, offset
));
4974 SET_EXPR_LOCATION (tem
, loc
);
4978 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4981 mem_ref_offset (const_tree t
)
4983 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4987 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4988 offsetted by OFFSET units. */
4991 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4993 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4994 build_fold_addr_expr (base
),
4995 build_int_cst (ptr_type_node
, offset
));
4996 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4997 recompute_tree_invariant_for_addr_expr (addr
);
5001 /* Similar except don't specify the TREE_TYPE
5002 and leave the TREE_SIDE_EFFECTS as 0.
5003 It is permissible for arguments to be null,
5004 or even garbage if their values do not matter. */
5007 build_nt (enum tree_code code
, ...)
5014 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5018 t
= make_node (code
);
5019 length
= TREE_CODE_LENGTH (code
);
5021 for (i
= 0; i
< length
; i
++)
5022 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
5028 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5032 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5037 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5038 CALL_EXPR_FN (ret
) = fn
;
5039 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5040 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5041 CALL_EXPR_ARG (ret
, ix
) = t
;
5045 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5047 We do NOT enter this node in any sort of symbol table.
5049 LOC is the location of the decl.
5051 layout_decl is used to set up the decl's storage layout.
5052 Other slots are initialized to 0 or null pointers. */
5055 build_decl (location_t loc
, enum tree_code code
, tree name
,
5056 tree type MEM_STAT_DECL
)
5060 t
= make_node (code PASS_MEM_STAT
);
5061 DECL_SOURCE_LOCATION (t
) = loc
;
5063 /* if (type == error_mark_node)
5064 type = integer_type_node; */
5065 /* That is not done, deliberately, so that having error_mark_node
5066 as the type can suppress useless errors in the use of this variable. */
5068 DECL_NAME (t
) = name
;
5069 TREE_TYPE (t
) = type
;
5071 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5077 /* Builds and returns function declaration with NAME and TYPE. */
5080 build_fn_decl (const char *name
, tree type
)
5082 tree id
= get_identifier (name
);
5083 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5085 DECL_EXTERNAL (decl
) = 1;
5086 TREE_PUBLIC (decl
) = 1;
5087 DECL_ARTIFICIAL (decl
) = 1;
5088 TREE_NOTHROW (decl
) = 1;
5093 vec
<tree
, va_gc
> *all_translation_units
;
5095 /* Builds a new translation-unit decl with name NAME, queues it in the
5096 global list of translation-unit decls and returns it. */
5099 build_translation_unit_decl (tree name
)
5101 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5103 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5104 vec_safe_push (all_translation_units
, tu
);
5109 /* BLOCK nodes are used to represent the structure of binding contours
5110 and declarations, once those contours have been exited and their contents
5111 compiled. This information is used for outputting debugging info. */
5114 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5116 tree block
= make_node (BLOCK
);
5118 BLOCK_VARS (block
) = vars
;
5119 BLOCK_SUBBLOCKS (block
) = subblocks
;
5120 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5121 BLOCK_CHAIN (block
) = chain
;
5126 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5128 LOC is the location to use in tree T. */
5131 protected_set_expr_location (tree t
, location_t loc
)
5133 if (CAN_HAVE_LOCATION_P (t
))
5134 SET_EXPR_LOCATION (t
, loc
);
5135 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5137 t
= expr_single (t
);
5138 if (t
&& CAN_HAVE_LOCATION_P (t
))
5139 SET_EXPR_LOCATION (t
, loc
);
5143 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5144 UNKNOWN_LOCATION. */
5147 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5149 t
= expr_single (t
);
5150 if (t
&& !EXPR_HAS_LOCATION (t
))
5151 protected_set_expr_location (t
, loc
);
5154 /* Data used when collecting DECLs and TYPEs for language data removal. */
5156 class free_lang_data_d
5159 free_lang_data_d () : decls (100), types (100) {}
5161 /* Worklist to avoid excessive recursion. */
5162 auto_vec
<tree
> worklist
;
5164 /* Set of traversed objects. Used to avoid duplicate visits. */
5165 hash_set
<tree
> pset
;
5167 /* Array of symbols to process with free_lang_data_in_decl. */
5168 auto_vec
<tree
> decls
;
5170 /* Array of types to process with free_lang_data_in_type. */
5171 auto_vec
<tree
> types
;
5175 /* Add type or decl T to one of the list of tree nodes that need their
5176 language data removed. The lists are held inside FLD. */
5179 add_tree_to_fld_list (tree t
, class free_lang_data_d
*fld
)
5182 fld
->decls
.safe_push (t
);
5183 else if (TYPE_P (t
))
5184 fld
->types
.safe_push (t
);
5189 /* Push tree node T into FLD->WORKLIST. */
5192 fld_worklist_push (tree t
, class free_lang_data_d
*fld
)
5194 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5195 fld
->worklist
.safe_push ((t
));
5200 /* Return simplified TYPE_NAME of TYPE. */
5203 fld_simplified_type_name (tree type
)
5205 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5206 return TYPE_NAME (type
);
5207 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5208 TYPE_DECL if the type doesn't have linkage.
5209 this must match fld_ */
5210 if (type
!= TYPE_MAIN_VARIANT (type
)
5211 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5212 && (TREE_CODE (type
) != RECORD_TYPE
5213 || !TYPE_BINFO (type
)
5214 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5215 return DECL_NAME (TYPE_NAME (type
));
5216 return TYPE_NAME (type
);
5219 /* Do same comparsion as check_qualified_type skipping lang part of type
5220 and be more permissive about type names: we only care that names are
5221 same (for diagnostics) and that ODR names are the same.
5222 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5225 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5227 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5228 /* We want to match incomplete variants with complete types.
5229 In this case we need to ignore alignment. */
5230 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5231 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5232 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5233 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5234 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5235 TYPE_ATTRIBUTES (v
))
5236 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5242 /* Find variant of FIRST that match T and create new one if necessary.
5243 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5246 fld_type_variant (tree first
, tree t
, class free_lang_data_d
*fld
,
5247 tree inner_type
= NULL
)
5249 if (first
== TYPE_MAIN_VARIANT (t
))
5251 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5252 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5254 tree v
= build_variant_type_copy (first
);
5255 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5256 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5257 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5258 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5259 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5260 TYPE_NAME (v
) = TYPE_NAME (t
);
5261 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5262 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5263 /* Variants of incomplete types should have alignment
5264 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5265 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5267 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5268 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5271 TREE_TYPE (v
) = inner_type
;
5272 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5273 if (!fld
->pset
.add (v
))
5274 add_tree_to_fld_list (v
, fld
);
5278 /* Map complete types to incomplete types. */
5280 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5282 /* Map types to simplified types. */
5284 static hash_map
<tree
, tree
> *fld_simplified_types
;
5286 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5287 use MAP to prevent duplicates. */
5290 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5291 class free_lang_data_d
*fld
)
5293 if (TREE_TYPE (t
) == t2
)
5296 if (TYPE_MAIN_VARIANT (t
) != t
)
5298 return fld_type_variant
5299 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5300 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5306 = map
->get_or_insert (t
, &existed
);
5310 = build_array_type_1 (t2
, TYPE_DOMAIN (t
), TYPE_TYPELESS_STORAGE (t
),
5312 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5313 if (!fld
->pset
.add (array
))
5314 add_tree_to_fld_list (array
, fld
);
5319 /* Return CTX after removal of contexts that are not relevant */
5322 fld_decl_context (tree ctx
)
5324 /* Variably modified types are needed for tree_is_indexable to decide
5325 whether the type needs to go to local or global section.
5326 This code is semi-broken but for now it is easiest to keep contexts
5328 if (ctx
&& TYPE_P (ctx
)
5329 && !variably_modified_type_p (ctx
, NULL_TREE
))
5331 while (ctx
&& TYPE_P (ctx
))
5332 ctx
= TYPE_CONTEXT (ctx
);
5337 /* For T being aggregate type try to turn it into a incomplete variant.
5338 Return T if no simplification is possible. */
5341 fld_incomplete_type_of (tree t
, class free_lang_data_d
*fld
)
5345 if (POINTER_TYPE_P (t
))
5347 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5348 if (t2
!= TREE_TYPE (t
))
5351 if (TREE_CODE (t
) == POINTER_TYPE
)
5352 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5353 TYPE_REF_CAN_ALIAS_ALL (t
));
5355 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5356 TYPE_REF_CAN_ALIAS_ALL (t
));
5357 gcc_assert (TYPE_CANONICAL (t2
) != t2
5358 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5359 if (!fld
->pset
.add (first
))
5360 add_tree_to_fld_list (first
, fld
);
5361 return fld_type_variant (first
, t
, fld
);
5365 if (TREE_CODE (t
) == ARRAY_TYPE
)
5366 return fld_process_array_type (t
,
5367 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5368 fld_incomplete_types
, fld
);
5369 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5370 || !COMPLETE_TYPE_P (t
))
5372 if (TYPE_MAIN_VARIANT (t
) == t
)
5376 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5380 copy
= build_distinct_type_copy (t
);
5382 /* It is possible that type was not seen by free_lang_data yet. */
5383 if (!fld
->pset
.add (copy
))
5384 add_tree_to_fld_list (copy
, fld
);
5385 TYPE_SIZE (copy
) = NULL
;
5386 TYPE_USER_ALIGN (copy
) = 0;
5387 TYPE_SIZE_UNIT (copy
) = NULL
;
5388 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5389 TREE_ADDRESSABLE (copy
) = 0;
5390 if (AGGREGATE_TYPE_P (t
))
5392 SET_TYPE_MODE (copy
, VOIDmode
);
5393 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5394 TYPE_TYPELESS_STORAGE (copy
) = 0;
5395 TYPE_FIELDS (copy
) = NULL
;
5396 TYPE_BINFO (copy
) = NULL
;
5397 TYPE_FINAL_P (copy
) = 0;
5398 TYPE_EMPTY_P (copy
) = 0;
5402 TYPE_VALUES (copy
) = NULL
;
5403 ENUM_IS_OPAQUE (copy
) = 0;
5404 ENUM_IS_SCOPED (copy
) = 0;
5407 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5408 This is needed for ODR violation warnings to come out right (we
5409 want duplicate TYPE_DECLs whenever the type is duplicated because
5410 of ODR violation. Because lang data in the TYPE_DECL may not
5411 have been freed yet, rebuild it from scratch and copy relevant
5413 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5414 tree name
= TYPE_NAME (copy
);
5416 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5418 gcc_checking_assert (TREE_TYPE (name
) == t
);
5419 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5420 DECL_NAME (name
), copy
);
5421 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5422 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5423 SET_DECL_ALIGN (name2
, 0);
5424 DECL_CONTEXT (name2
) = fld_decl_context
5425 (DECL_CONTEXT (name
));
5426 TYPE_NAME (copy
) = name2
;
5431 return (fld_type_variant
5432 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5435 /* Simplify type T for scenarios where we do not need complete pointer
5439 fld_simplified_type (tree t
, class free_lang_data_d
*fld
)
5443 if (POINTER_TYPE_P (t
))
5444 return fld_incomplete_type_of (t
, fld
);
5445 /* FIXME: This triggers verification error, see PR88140. */
5446 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5447 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5448 fld_simplified_types
, fld
);
5452 /* Reset the expression *EXPR_P, a size or position.
5454 ??? We could reset all non-constant sizes or positions. But it's cheap
5455 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5457 We need to reset self-referential sizes or positions because they cannot
5458 be gimplified and thus can contain a CALL_EXPR after the gimplification
5459 is finished, which will run afoul of LTO streaming. And they need to be
5460 reset to something essentially dummy but not constant, so as to preserve
5461 the properties of the object they are attached to. */
5464 free_lang_data_in_one_sizepos (tree
*expr_p
)
5466 tree expr
= *expr_p
;
5467 if (CONTAINS_PLACEHOLDER_P (expr
))
5468 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5472 /* Reset all the fields in a binfo node BINFO. We only keep
5473 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5476 free_lang_data_in_binfo (tree binfo
)
5481 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5483 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5484 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5485 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5486 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5487 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5488 TREE_PUBLIC (binfo
) = 0;
5490 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5491 free_lang_data_in_binfo (t
);
5495 /* Reset all language specific information still present in TYPE. */
5498 free_lang_data_in_type (tree type
, class free_lang_data_d
*fld
)
5500 gcc_assert (TYPE_P (type
));
5502 /* Give the FE a chance to remove its own data first. */
5503 lang_hooks
.free_lang_data (type
);
5505 TREE_LANG_FLAG_0 (type
) = 0;
5506 TREE_LANG_FLAG_1 (type
) = 0;
5507 TREE_LANG_FLAG_2 (type
) = 0;
5508 TREE_LANG_FLAG_3 (type
) = 0;
5509 TREE_LANG_FLAG_4 (type
) = 0;
5510 TREE_LANG_FLAG_5 (type
) = 0;
5511 TREE_LANG_FLAG_6 (type
) = 0;
5513 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5515 /* Purge non-marked variants from the variants chain, so that they
5516 don't reappear in the IL after free_lang_data. */
5517 while (TYPE_NEXT_VARIANT (type
)
5518 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5520 tree t
= TYPE_NEXT_VARIANT (type
);
5521 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5522 /* Turn the removed types into distinct types. */
5523 TYPE_MAIN_VARIANT (t
) = t
;
5524 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5527 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5529 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5530 /* Remove the const and volatile qualifiers from arguments. The
5531 C++ front end removes them, but the C front end does not,
5532 leading to false ODR violation errors when merging two
5533 instances of the same function signature compiled by
5534 different front ends. */
5535 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5537 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5538 tree arg_type
= TREE_VALUE (p
);
5540 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5542 int quals
= TYPE_QUALS (arg_type
)
5544 & ~TYPE_QUAL_VOLATILE
;
5545 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5546 if (!fld
->pset
.add (TREE_VALUE (p
)))
5547 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5549 /* C++ FE uses TREE_PURPOSE to store initial values. */
5550 TREE_PURPOSE (p
) = NULL
;
5553 else if (TREE_CODE (type
) == METHOD_TYPE
)
5555 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5556 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5558 /* C++ FE uses TREE_PURPOSE to store initial values. */
5559 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5560 TREE_PURPOSE (p
) = NULL
;
5563 else if (RECORD_OR_UNION_TYPE_P (type
))
5565 /* Remove members that are not FIELD_DECLs from the field list
5566 of an aggregate. These occur in C++. */
5567 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5568 if (TREE_CODE (member
) == FIELD_DECL
)
5569 prev
= &DECL_CHAIN (member
);
5571 *prev
= DECL_CHAIN (member
);
5573 TYPE_VFIELD (type
) = NULL_TREE
;
5575 if (TYPE_BINFO (type
))
5577 free_lang_data_in_binfo (TYPE_BINFO (type
));
5578 /* We need to preserve link to bases and virtual table for all
5579 polymorphic types to make devirtualization machinery working. */
5580 if (!BINFO_VTABLE (TYPE_BINFO (type
)))
5581 TYPE_BINFO (type
) = NULL
;
5584 else if (INTEGRAL_TYPE_P (type
)
5585 || SCALAR_FLOAT_TYPE_P (type
)
5586 || FIXED_POINT_TYPE_P (type
))
5588 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5590 ENUM_IS_OPAQUE (type
) = 0;
5591 ENUM_IS_SCOPED (type
) = 0;
5592 /* Type values are used only for C++ ODR checking. Drop them
5593 for all type variants and non-ODR types.
5594 For ODR types the data is freed in free_odr_warning_data. */
5595 if (!TYPE_VALUES (type
))
5597 else if (TYPE_MAIN_VARIANT (type
) != type
5598 || !type_with_linkage_p (type
)
5599 || type_in_anonymous_namespace_p (type
))
5600 TYPE_VALUES (type
) = NULL
;
5602 register_odr_enum (type
);
5604 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5605 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5608 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5610 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5611 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5613 if (TYPE_CONTEXT (type
)
5614 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5616 tree ctx
= TYPE_CONTEXT (type
);
5619 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5621 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5622 TYPE_CONTEXT (type
) = ctx
;
5625 TYPE_STUB_DECL (type
) = NULL
;
5626 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5630 /* Return true if DECL may need an assembler name to be set. */
5633 need_assembler_name_p (tree decl
)
5635 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5636 Rule merging. This makes type_odr_p to return true on those types during
5637 LTO and by comparing the mangled name, we can say what types are intended
5638 to be equivalent across compilation unit.
5640 We do not store names of type_in_anonymous_namespace_p.
5642 Record, union and enumeration type have linkage that allows use
5643 to check type_in_anonymous_namespace_p. We do not mangle compound types
5644 that always can be compared structurally.
5646 Similarly for builtin types, we compare properties of their main variant.
5647 A special case are integer types where mangling do make differences
5648 between char/signed char/unsigned char etc. Storing name for these makes
5649 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5650 See cp/mangle.c:write_builtin_type for details. */
5652 if (TREE_CODE (decl
) == TYPE_DECL
)
5654 if (DECL_NAME (decl
)
5655 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5656 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5657 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5658 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5659 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5660 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5661 && (type_with_linkage_p (TREE_TYPE (decl
))
5662 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5663 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5664 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5667 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5668 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5671 /* If DECL already has its assembler name set, it does not need a
5673 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5674 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5677 /* Abstract decls do not need an assembler name. */
5678 if (DECL_ABSTRACT_P (decl
))
5681 /* For VAR_DECLs, only static, public and external symbols need an
5684 && !TREE_STATIC (decl
)
5685 && !TREE_PUBLIC (decl
)
5686 && !DECL_EXTERNAL (decl
))
5689 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5691 /* Do not set assembler name on builtins. Allow RTL expansion to
5692 decide whether to expand inline or via a regular call. */
5693 if (fndecl_built_in_p (decl
)
5694 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5697 /* Functions represented in the callgraph need an assembler name. */
5698 if (cgraph_node::get (decl
) != NULL
)
5701 /* Unused and not public functions don't need an assembler name. */
5702 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5710 /* Reset all language specific information still present in symbol
5714 free_lang_data_in_decl (tree decl
, class free_lang_data_d
*fld
)
5716 gcc_assert (DECL_P (decl
));
5718 /* Give the FE a chance to remove its own data first. */
5719 lang_hooks
.free_lang_data (decl
);
5721 TREE_LANG_FLAG_0 (decl
) = 0;
5722 TREE_LANG_FLAG_1 (decl
) = 0;
5723 TREE_LANG_FLAG_2 (decl
) = 0;
5724 TREE_LANG_FLAG_3 (decl
) = 0;
5725 TREE_LANG_FLAG_4 (decl
) = 0;
5726 TREE_LANG_FLAG_5 (decl
) = 0;
5727 TREE_LANG_FLAG_6 (decl
) = 0;
5729 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5730 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5731 if (TREE_CODE (decl
) == FIELD_DECL
)
5733 DECL_FCONTEXT (decl
) = NULL
;
5734 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5735 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5736 DECL_QUALIFIER (decl
) = NULL_TREE
;
5739 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5741 struct cgraph_node
*node
;
5742 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5743 the address may be taken in other unit, so this flag has no practical
5746 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5747 for public objects that indeed cannot be adressed, but it is not
5748 the case. Set the flag to true so we do not get merge failures for
5749 i.e. virtual tables between units that take address of it and
5750 units that don't. */
5751 if (TREE_PUBLIC (decl
))
5752 TREE_ADDRESSABLE (decl
) = true;
5753 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5754 if (!(node
= cgraph_node::get (decl
))
5755 || (!node
->definition
&& !node
->clones
))
5758 node
->release_body ();
5761 release_function_body (decl
);
5762 DECL_ARGUMENTS (decl
) = NULL
;
5763 DECL_RESULT (decl
) = NULL
;
5764 DECL_INITIAL (decl
) = error_mark_node
;
5767 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5771 /* If DECL has a gimple body, then the context for its
5772 arguments must be DECL. Otherwise, it doesn't really
5773 matter, as we will not be emitting any code for DECL. In
5774 general, there may be other instances of DECL created by
5775 the front end and since PARM_DECLs are generally shared,
5776 their DECL_CONTEXT changes as the replicas of DECL are
5777 created. The only time where DECL_CONTEXT is important
5778 is for the FUNCTION_DECLs that have a gimple body (since
5779 the PARM_DECL will be used in the function's body). */
5780 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5781 DECL_CONTEXT (t
) = decl
;
5782 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5783 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5784 = target_option_default_node
;
5785 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5786 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5787 = optimization_default_node
;
5790 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5791 At this point, it is not needed anymore. */
5792 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5794 /* Clear the abstract origin if it refers to a method.
5795 Otherwise dwarf2out.c will ICE as we splice functions out of
5796 TYPE_FIELDS and thus the origin will not be output
5798 if (DECL_ABSTRACT_ORIGIN (decl
)
5799 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5800 && RECORD_OR_UNION_TYPE_P
5801 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5802 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5804 DECL_VINDEX (decl
) = NULL_TREE
;
5806 else if (VAR_P (decl
))
5808 /* See comment above why we set the flag for functions. */
5809 if (TREE_PUBLIC (decl
))
5810 TREE_ADDRESSABLE (decl
) = true;
5811 if ((DECL_EXTERNAL (decl
)
5812 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5813 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5814 DECL_INITIAL (decl
) = NULL_TREE
;
5816 else if (TREE_CODE (decl
) == TYPE_DECL
)
5818 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5819 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5820 TREE_PUBLIC (decl
) = 0;
5821 TREE_PRIVATE (decl
) = 0;
5822 DECL_ARTIFICIAL (decl
) = 0;
5823 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5824 DECL_INITIAL (decl
) = NULL_TREE
;
5825 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5826 DECL_MODE (decl
) = VOIDmode
;
5827 SET_DECL_ALIGN (decl
, 0);
5828 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5830 else if (TREE_CODE (decl
) == FIELD_DECL
)
5832 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5833 DECL_INITIAL (decl
) = NULL_TREE
;
5835 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5836 && DECL_INITIAL (decl
)
5837 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5839 /* Strip builtins from the translation-unit BLOCK. We still have targets
5840 without builtin_decl_explicit support and also builtins are shared
5841 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5842 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5846 if (TREE_CODE (var
) == FUNCTION_DECL
5847 && fndecl_built_in_p (var
))
5848 *nextp
= TREE_CHAIN (var
);
5850 nextp
= &TREE_CHAIN (var
);
5853 /* We need to keep field decls associated with their trees. Otherwise tree
5854 merging may merge some fileds and keep others disjoint wich in turn will
5855 not do well with TREE_CHAIN pointers linking them.
5857 Also do not drop containing types for virtual methods and tables because
5858 these are needed by devirtualization.
5859 C++ destructors are special because C++ frontends sometimes produces
5860 virtual destructor as an alias of non-virtual destructor. In
5861 devirutalization code we always walk through aliases and we need
5862 context to be preserved too. See PR89335 */
5863 if (TREE_CODE (decl
) != FIELD_DECL
5864 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5865 || (!DECL_VIRTUAL_P (decl
)
5866 && (TREE_CODE (decl
) != FUNCTION_DECL
5867 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5868 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5872 /* Operand callback helper for free_lang_data_in_node. *TP is the
5873 subtree operand being considered. */
5876 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5879 class free_lang_data_d
*fld
= (class free_lang_data_d
*) data
;
5881 if (TREE_CODE (t
) == TREE_LIST
)
5884 /* Language specific nodes will be removed, so there is no need
5885 to gather anything under them. */
5886 if (is_lang_specific (t
))
5894 /* Note that walk_tree does not traverse every possible field in
5895 decls, so we have to do our own traversals here. */
5896 add_tree_to_fld_list (t
, fld
);
5898 fld_worklist_push (DECL_NAME (t
), fld
);
5899 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5900 fld_worklist_push (DECL_SIZE (t
), fld
);
5901 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5903 /* We are going to remove everything under DECL_INITIAL for
5904 TYPE_DECLs. No point walking them. */
5905 if (TREE_CODE (t
) != TYPE_DECL
)
5906 fld_worklist_push (DECL_INITIAL (t
), fld
);
5908 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5909 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5911 if (TREE_CODE (t
) == FUNCTION_DECL
)
5913 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5914 fld_worklist_push (DECL_RESULT (t
), fld
);
5916 else if (TREE_CODE (t
) == FIELD_DECL
)
5918 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5919 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5920 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5921 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5924 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5925 && DECL_HAS_VALUE_EXPR_P (t
))
5926 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5928 if (TREE_CODE (t
) != FIELD_DECL
5929 && TREE_CODE (t
) != TYPE_DECL
)
5930 fld_worklist_push (TREE_CHAIN (t
), fld
);
5933 else if (TYPE_P (t
))
5935 /* Note that walk_tree does not traverse every possible field in
5936 types, so we have to do our own traversals here. */
5937 add_tree_to_fld_list (t
, fld
);
5939 if (!RECORD_OR_UNION_TYPE_P (t
))
5940 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5941 fld_worklist_push (TYPE_SIZE (t
), fld
);
5942 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5943 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5944 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5945 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5946 fld_worklist_push (TYPE_NAME (t
), fld
);
5947 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5948 lists, we may look types up in these lists and use them while
5949 optimizing the function body. Thus we need to free lang data
5951 if (TREE_CODE (t
) == POINTER_TYPE
)
5952 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5953 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5954 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5955 if (!POINTER_TYPE_P (t
))
5956 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5957 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5958 if (!RECORD_OR_UNION_TYPE_P (t
))
5959 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5960 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5961 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5962 do not and want not to reach unused variants this way. */
5963 if (TYPE_CONTEXT (t
))
5965 tree ctx
= TYPE_CONTEXT (t
);
5966 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5967 So push that instead. */
5968 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5969 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5970 fld_worklist_push (ctx
, fld
);
5972 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
5974 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5978 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5979 fld_worklist_push (TREE_TYPE (tem
), fld
);
5980 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5981 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5983 if (RECORD_OR_UNION_TYPE_P (t
))
5986 /* Push all TYPE_FIELDS - there can be interleaving interesting
5987 and non-interesting things. */
5988 tem
= TYPE_FIELDS (t
);
5991 if (TREE_CODE (tem
) == FIELD_DECL
)
5992 fld_worklist_push (tem
, fld
);
5993 tem
= TREE_CHAIN (tem
);
5996 if (FUNC_OR_METHOD_TYPE_P (t
))
5997 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5999 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
6002 else if (TREE_CODE (t
) == BLOCK
)
6004 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
6006 if (TREE_CODE (*tem
) != LABEL_DECL
6007 && (TREE_CODE (*tem
) != VAR_DECL
6008 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
))))
6010 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
6011 && TREE_CODE (*tem
) != PARM_DECL
);
6012 *tem
= TREE_CHAIN (*tem
);
6016 fld_worklist_push (*tem
, fld
);
6017 tem
= &TREE_CHAIN (*tem
);
6020 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
6021 fld_worklist_push (tem
, fld
);
6022 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
6025 if (TREE_CODE (t
) != IDENTIFIER_NODE
6026 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
6027 fld_worklist_push (TREE_TYPE (t
), fld
);
6033 /* Find decls and types in T. */
6036 find_decls_types (tree t
, class free_lang_data_d
*fld
)
6040 if (!fld
->pset
.contains (t
))
6041 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
6042 if (fld
->worklist
.is_empty ())
6044 t
= fld
->worklist
.pop ();
6048 /* Translate all the types in LIST with the corresponding runtime
6052 get_eh_types_for_runtime (tree list
)
6056 if (list
== NULL_TREE
)
6059 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6061 list
= TREE_CHAIN (list
);
6064 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6065 TREE_CHAIN (prev
) = n
;
6066 prev
= TREE_CHAIN (prev
);
6067 list
= TREE_CHAIN (list
);
6074 /* Find decls and types referenced in EH region R and store them in
6075 FLD->DECLS and FLD->TYPES. */
6078 find_decls_types_in_eh_region (eh_region r
, class free_lang_data_d
*fld
)
6089 /* The types referenced in each catch must first be changed to the
6090 EH types used at runtime. This removes references to FE types
6092 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6094 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6095 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6100 case ERT_ALLOWED_EXCEPTIONS
:
6101 r
->u
.allowed
.type_list
6102 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6103 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6106 case ERT_MUST_NOT_THROW
:
6107 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6108 find_decls_types_r
, fld
, &fld
->pset
);
6114 /* Find decls and types referenced in cgraph node N and store them in
6115 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6116 look for *every* kind of DECL and TYPE node reachable from N,
6117 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6118 NAMESPACE_DECLs, etc). */
6121 find_decls_types_in_node (struct cgraph_node
*n
, class free_lang_data_d
*fld
)
6124 struct function
*fn
;
6128 find_decls_types (n
->decl
, fld
);
6130 if (!gimple_has_body_p (n
->decl
))
6133 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6135 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6137 /* Traverse locals. */
6138 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6139 find_decls_types (t
, fld
);
6141 /* Traverse EH regions in FN. */
6144 FOR_ALL_EH_REGION_FN (r
, fn
)
6145 find_decls_types_in_eh_region (r
, fld
);
6148 /* Traverse every statement in FN. */
6149 FOR_EACH_BB_FN (bb
, fn
)
6152 gimple_stmt_iterator si
;
6155 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6157 gphi
*phi
= psi
.phi ();
6159 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6161 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6162 find_decls_types (*arg_p
, fld
);
6166 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6168 gimple
*stmt
= gsi_stmt (si
);
6170 if (is_gimple_call (stmt
))
6171 find_decls_types (gimple_call_fntype (stmt
), fld
);
6173 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6175 tree arg
= gimple_op (stmt
, i
);
6176 find_decls_types (arg
, fld
);
6177 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6178 which we need for asm stmts. */
6180 && TREE_CODE (arg
) == TREE_LIST
6181 && TREE_PURPOSE (arg
)
6182 && gimple_code (stmt
) == GIMPLE_ASM
)
6183 find_decls_types (TREE_PURPOSE (arg
), fld
);
6190 /* Find decls and types referenced in varpool node N and store them in
6191 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6192 look for *every* kind of DECL and TYPE node reachable from N,
6193 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6194 NAMESPACE_DECLs, etc). */
6197 find_decls_types_in_var (varpool_node
*v
, class free_lang_data_d
*fld
)
6199 find_decls_types (v
->decl
, fld
);
6202 /* If T needs an assembler name, have one created for it. */
6205 assign_assembler_name_if_needed (tree t
)
6207 if (need_assembler_name_p (t
))
6209 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6210 diagnostics that use input_location to show locus
6211 information. The problem here is that, at this point,
6212 input_location is generally anchored to the end of the file
6213 (since the parser is long gone), so we don't have a good
6214 position to pin it to.
6216 To alleviate this problem, this uses the location of T's
6217 declaration. Examples of this are
6218 testsuite/g++.dg/template/cond2.C and
6219 testsuite/g++.dg/template/pr35240.C. */
6220 location_t saved_location
= input_location
;
6221 input_location
= DECL_SOURCE_LOCATION (t
);
6223 decl_assembler_name (t
);
6225 input_location
= saved_location
;
6230 /* Free language specific information for every operand and expression
6231 in every node of the call graph. This process operates in three stages:
6233 1- Every callgraph node and varpool node is traversed looking for
6234 decls and types embedded in them. This is a more exhaustive
6235 search than that done by find_referenced_vars, because it will
6236 also collect individual fields, decls embedded in types, etc.
6238 2- All the decls found are sent to free_lang_data_in_decl.
6240 3- All the types found are sent to free_lang_data_in_type.
6242 The ordering between decls and types is important because
6243 free_lang_data_in_decl sets assembler names, which includes
6244 mangling. So types cannot be freed up until assembler names have
6248 free_lang_data_in_cgraph (class free_lang_data_d
*fld
)
6250 struct cgraph_node
*n
;
6256 /* Find decls and types in the body of every function in the callgraph. */
6257 FOR_EACH_FUNCTION (n
)
6258 find_decls_types_in_node (n
, fld
);
6260 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6261 find_decls_types (p
->decl
, fld
);
6263 /* Find decls and types in every varpool symbol. */
6264 FOR_EACH_VARIABLE (v
)
6265 find_decls_types_in_var (v
, fld
);
6267 /* Set the assembler name on every decl found. We need to do this
6268 now because free_lang_data_in_decl will invalidate data needed
6269 for mangling. This breaks mangling on interdependent decls. */
6270 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6271 assign_assembler_name_if_needed (t
);
6273 /* Traverse every decl found freeing its language data. */
6274 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6275 free_lang_data_in_decl (t
, fld
);
6277 /* Traverse every type found freeing its language data. */
6278 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6279 free_lang_data_in_type (t
, fld
);
6283 /* Free resources that are used by FE but are not needed once they are done. */
6286 free_lang_data (void)
6289 class free_lang_data_d fld
;
6291 /* If we are the LTO frontend we have freed lang-specific data already. */
6293 || (!flag_generate_lto
&& !flag_generate_offload
))
6295 /* Rebuild type inheritance graph even when not doing LTO to get
6296 consistent profile data. */
6297 rebuild_type_inheritance_graph ();
6301 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6302 fld_simplified_types
= new hash_map
<tree
, tree
>;
6304 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6305 if (vec_safe_is_empty (all_translation_units
))
6306 build_translation_unit_decl (NULL_TREE
);
6308 /* Allocate and assign alias sets to the standard integer types
6309 while the slots are still in the way the frontends generated them. */
6310 for (i
= 0; i
< itk_none
; ++i
)
6311 if (integer_types
[i
])
6312 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6314 /* Traverse the IL resetting language specific information for
6315 operands, expressions, etc. */
6316 free_lang_data_in_cgraph (&fld
);
6318 /* Create gimple variants for common types. */
6319 for (unsigned i
= 0;
6320 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6322 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6324 /* Reset some langhooks. Do not reset types_compatible_p, it may
6325 still be used indirectly via the get_alias_set langhook. */
6326 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6327 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6328 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6329 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6330 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6331 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6332 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6333 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6335 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6342 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6346 /* We do not want the default decl_assembler_name implementation,
6347 rather if we have fixed everything we want a wrapper around it
6348 asserting that all non-local symbols already got their assembler
6349 name and only produce assembler names for local symbols. Or rather
6350 make sure we never call decl_assembler_name on local symbols and
6351 devise a separate, middle-end private scheme for it. */
6353 /* Reset diagnostic machinery. */
6354 tree_diagnostics_defaults (global_dc
);
6356 rebuild_type_inheritance_graph ();
6358 delete fld_incomplete_types
;
6359 delete fld_simplified_types
;
6367 const pass_data pass_data_ipa_free_lang_data
=
6369 SIMPLE_IPA_PASS
, /* type */
6370 "*free_lang_data", /* name */
6371 OPTGROUP_NONE
, /* optinfo_flags */
6372 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6373 0, /* properties_required */
6374 0, /* properties_provided */
6375 0, /* properties_destroyed */
6376 0, /* todo_flags_start */
6377 0, /* todo_flags_finish */
6380 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6383 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6384 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6387 /* opt_pass methods: */
6388 virtual unsigned int execute (function
*) { return free_lang_data (); }
6390 }; // class pass_ipa_free_lang_data
6394 simple_ipa_opt_pass
*
6395 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6397 return new pass_ipa_free_lang_data (ctxt
);
6400 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6401 of the various TYPE_QUAL values. */
6404 set_type_quals (tree type
, int type_quals
)
6406 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6407 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6408 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6409 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6410 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6413 /* Returns true iff CAND and BASE have equivalent language-specific
6417 check_lang_type (const_tree cand
, const_tree base
)
6419 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6421 /* type_hash_eq currently only applies to these types. */
6422 if (TREE_CODE (cand
) != FUNCTION_TYPE
6423 && TREE_CODE (cand
) != METHOD_TYPE
)
6425 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6428 /* This function checks to see if TYPE matches the size one of the built-in
6429 atomic types, and returns that core atomic type. */
6432 find_atomic_core_type (const_tree type
)
6434 tree base_atomic_type
;
6436 /* Only handle complete types. */
6437 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6440 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6443 base_atomic_type
= atomicQI_type_node
;
6447 base_atomic_type
= atomicHI_type_node
;
6451 base_atomic_type
= atomicSI_type_node
;
6455 base_atomic_type
= atomicDI_type_node
;
6459 base_atomic_type
= atomicTI_type_node
;
6463 base_atomic_type
= NULL_TREE
;
6466 return base_atomic_type
;
6469 /* Returns true iff unqualified CAND and BASE are equivalent. */
6472 check_base_type (const_tree cand
, const_tree base
)
6474 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6475 /* Apparently this is needed for Objective-C. */
6476 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6477 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6478 TYPE_ATTRIBUTES (base
)))
6480 /* Check alignment. */
6481 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6483 /* Atomic types increase minimal alignment. We must to do so as well
6484 or we get duplicated canonical types. See PR88686. */
6485 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6487 /* See if this object can map to a basic atomic type. */
6488 tree atomic_type
= find_atomic_core_type (cand
);
6489 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6495 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6498 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6500 return (TYPE_QUALS (cand
) == type_quals
6501 && check_base_type (cand
, base
)
6502 && check_lang_type (cand
, base
));
6505 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6508 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6510 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6511 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6512 /* Apparently this is needed for Objective-C. */
6513 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6514 /* Check alignment. */
6515 && TYPE_ALIGN (cand
) == align
6516 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6517 TYPE_ATTRIBUTES (base
))
6518 && check_lang_type (cand
, base
));
6521 /* Return a version of the TYPE, qualified as indicated by the
6522 TYPE_QUALS, if one exists. If no qualified version exists yet,
6523 return NULL_TREE. */
6526 get_qualified_type (tree type
, int type_quals
)
6528 if (TYPE_QUALS (type
) == type_quals
)
6531 tree mv
= TYPE_MAIN_VARIANT (type
);
6532 if (check_qualified_type (mv
, type
, type_quals
))
6535 /* Search the chain of variants to see if there is already one there just
6536 like the one we need to have. If so, use that existing one. We must
6537 preserve the TYPE_NAME, since there is code that depends on this. */
6538 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6539 if (check_qualified_type (*tp
, type
, type_quals
))
6541 /* Put the found variant at the head of the variant list so
6542 frequently searched variants get found faster. The C++ FE
6543 benefits greatly from this. */
6545 *tp
= TYPE_NEXT_VARIANT (t
);
6546 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6547 TYPE_NEXT_VARIANT (mv
) = t
;
6554 /* Like get_qualified_type, but creates the type if it does not
6555 exist. This function never returns NULL_TREE. */
6558 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6562 /* See if we already have the appropriate qualified variant. */
6563 t
= get_qualified_type (type
, type_quals
);
6565 /* If not, build it. */
6568 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6569 set_type_quals (t
, type_quals
);
6571 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6573 /* See if this object can map to a basic atomic type. */
6574 tree atomic_type
= find_atomic_core_type (type
);
6577 /* Ensure the alignment of this type is compatible with
6578 the required alignment of the atomic type. */
6579 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6580 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6584 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6585 /* Propagate structural equality. */
6586 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6587 else if (TYPE_CANONICAL (type
) != type
)
6588 /* Build the underlying canonical type, since it is different
6591 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6592 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6595 /* T is its own canonical type. */
6596 TYPE_CANONICAL (t
) = t
;
6603 /* Create a variant of type T with alignment ALIGN. */
6606 build_aligned_type (tree type
, unsigned int align
)
6610 if (TYPE_PACKED (type
)
6611 || TYPE_ALIGN (type
) == align
)
6614 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6615 if (check_aligned_type (t
, type
, align
))
6618 t
= build_variant_type_copy (type
);
6619 SET_TYPE_ALIGN (t
, align
);
6620 TYPE_USER_ALIGN (t
) = 1;
6625 /* Create a new distinct copy of TYPE. The new type is made its own
6626 MAIN_VARIANT. If TYPE requires structural equality checks, the
6627 resulting type requires structural equality checks; otherwise, its
6628 TYPE_CANONICAL points to itself. */
6631 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6633 tree t
= copy_node (type PASS_MEM_STAT
);
6635 TYPE_POINTER_TO (t
) = 0;
6636 TYPE_REFERENCE_TO (t
) = 0;
6638 /* Set the canonical type either to a new equivalence class, or
6639 propagate the need for structural equality checks. */
6640 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6641 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6643 TYPE_CANONICAL (t
) = t
;
6645 /* Make it its own variant. */
6646 TYPE_MAIN_VARIANT (t
) = t
;
6647 TYPE_NEXT_VARIANT (t
) = 0;
6649 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6650 whose TREE_TYPE is not t. This can also happen in the Ada
6651 frontend when using subtypes. */
6656 /* Create a new variant of TYPE, equivalent but distinct. This is so
6657 the caller can modify it. TYPE_CANONICAL for the return type will
6658 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6659 are considered equal by the language itself (or that both types
6660 require structural equality checks). */
6663 build_variant_type_copy (tree type MEM_STAT_DECL
)
6665 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6667 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6669 /* Since we're building a variant, assume that it is a non-semantic
6670 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6671 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6672 /* Type variants have no alias set defined. */
6673 TYPE_ALIAS_SET (t
) = -1;
6675 /* Add the new type to the chain of variants of TYPE. */
6676 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6677 TYPE_NEXT_VARIANT (m
) = t
;
6678 TYPE_MAIN_VARIANT (t
) = m
;
6683 /* Return true if the from tree in both tree maps are equal. */
6686 tree_map_base_eq (const void *va
, const void *vb
)
6688 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6689 *const b
= (const struct tree_map_base
*) vb
;
6690 return (a
->from
== b
->from
);
6693 /* Hash a from tree in a tree_base_map. */
6696 tree_map_base_hash (const void *item
)
6698 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6701 /* Return true if this tree map structure is marked for garbage collection
6702 purposes. We simply return true if the from tree is marked, so that this
6703 structure goes away when the from tree goes away. */
6706 tree_map_base_marked_p (const void *p
)
6708 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6711 /* Hash a from tree in a tree_map. */
6714 tree_map_hash (const void *item
)
6716 return (((const struct tree_map
*) item
)->hash
);
6719 /* Hash a from tree in a tree_decl_map. */
6722 tree_decl_map_hash (const void *item
)
6724 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6727 /* Return the initialization priority for DECL. */
6730 decl_init_priority_lookup (tree decl
)
6732 symtab_node
*snode
= symtab_node::get (decl
);
6735 return DEFAULT_INIT_PRIORITY
;
6737 snode
->get_init_priority ();
6740 /* Return the finalization priority for DECL. */
6743 decl_fini_priority_lookup (tree decl
)
6745 cgraph_node
*node
= cgraph_node::get (decl
);
6748 return DEFAULT_INIT_PRIORITY
;
6750 node
->get_fini_priority ();
6753 /* Set the initialization priority for DECL to PRIORITY. */
6756 decl_init_priority_insert (tree decl
, priority_type priority
)
6758 struct symtab_node
*snode
;
6760 if (priority
== DEFAULT_INIT_PRIORITY
)
6762 snode
= symtab_node::get (decl
);
6766 else if (VAR_P (decl
))
6767 snode
= varpool_node::get_create (decl
);
6769 snode
= cgraph_node::get_create (decl
);
6770 snode
->set_init_priority (priority
);
6773 /* Set the finalization priority for DECL to PRIORITY. */
6776 decl_fini_priority_insert (tree decl
, priority_type priority
)
6778 struct cgraph_node
*node
;
6780 if (priority
== DEFAULT_INIT_PRIORITY
)
6782 node
= cgraph_node::get (decl
);
6787 node
= cgraph_node::get_create (decl
);
6788 node
->set_fini_priority (priority
);
6791 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6794 print_debug_expr_statistics (void)
6796 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6797 (long) debug_expr_for_decl
->size (),
6798 (long) debug_expr_for_decl
->elements (),
6799 debug_expr_for_decl
->collisions ());
6802 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6805 print_value_expr_statistics (void)
6807 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6808 (long) value_expr_for_decl
->size (),
6809 (long) value_expr_for_decl
->elements (),
6810 value_expr_for_decl
->collisions ());
6813 /* Lookup a debug expression for FROM, and return it if we find one. */
6816 decl_debug_expr_lookup (tree from
)
6818 struct tree_decl_map
*h
, in
;
6819 in
.base
.from
= from
;
6821 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6827 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6830 decl_debug_expr_insert (tree from
, tree to
)
6832 struct tree_decl_map
*h
;
6834 h
= ggc_alloc
<tree_decl_map
> ();
6835 h
->base
.from
= from
;
6837 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6840 /* Lookup a value expression for FROM, and return it if we find one. */
6843 decl_value_expr_lookup (tree from
)
6845 struct tree_decl_map
*h
, in
;
6846 in
.base
.from
= from
;
6848 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6854 /* Insert a mapping FROM->TO in the value expression hashtable. */
6857 decl_value_expr_insert (tree from
, tree to
)
6859 struct tree_decl_map
*h
;
6861 h
= ggc_alloc
<tree_decl_map
> ();
6862 h
->base
.from
= from
;
6864 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6867 /* Lookup a vector of debug arguments for FROM, and return it if we
6871 decl_debug_args_lookup (tree from
)
6873 struct tree_vec_map
*h
, in
;
6875 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6877 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6878 in
.base
.from
= from
;
6879 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6885 /* Insert a mapping FROM->empty vector of debug arguments in the value
6886 expression hashtable. */
6889 decl_debug_args_insert (tree from
)
6891 struct tree_vec_map
*h
;
6894 if (DECL_HAS_DEBUG_ARGS_P (from
))
6895 return decl_debug_args_lookup (from
);
6896 if (debug_args_for_decl
== NULL
)
6897 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6898 h
= ggc_alloc
<tree_vec_map
> ();
6899 h
->base
.from
= from
;
6901 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6903 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6907 /* Hashing of types so that we don't make duplicates.
6908 The entry point is `type_hash_canon'. */
6910 /* Generate the default hash code for TYPE. This is designed for
6911 speed, rather than maximum entropy. */
6914 type_hash_canon_hash (tree type
)
6916 inchash::hash hstate
;
6918 hstate
.add_int (TREE_CODE (type
));
6920 if (TREE_TYPE (type
))
6921 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6923 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6924 /* Just the identifier is adequate to distinguish. */
6925 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6927 switch (TREE_CODE (type
))
6930 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6933 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6934 if (TREE_VALUE (t
) != error_mark_node
)
6935 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6939 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6944 if (TYPE_DOMAIN (type
))
6945 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6946 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6948 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6949 hstate
.add_object (typeless
);
6956 tree t
= TYPE_MAX_VALUE (type
);
6958 t
= TYPE_MIN_VALUE (type
);
6959 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6960 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6965 case FIXED_POINT_TYPE
:
6967 unsigned prec
= TYPE_PRECISION (type
);
6968 hstate
.add_object (prec
);
6973 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6980 return hstate
.end ();
6983 /* These are the Hashtable callback functions. */
6985 /* Returns true iff the types are equivalent. */
6988 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6990 /* First test the things that are the same for all types. */
6991 if (a
->hash
!= b
->hash
6992 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6993 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6994 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6995 TYPE_ATTRIBUTES (b
->type
))
6996 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6997 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7000 /* Be careful about comparing arrays before and after the element type
7001 has been completed; don't compare TYPE_ALIGN unless both types are
7003 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7004 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7005 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7008 switch (TREE_CODE (a
->type
))
7013 case REFERENCE_TYPE
:
7018 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
7019 TYPE_VECTOR_SUBPARTS (b
->type
));
7022 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7023 && !(TYPE_VALUES (a
->type
)
7024 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7025 && TYPE_VALUES (b
->type
)
7026 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7027 && type_list_equal (TYPE_VALUES (a
->type
),
7028 TYPE_VALUES (b
->type
))))
7036 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7038 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7039 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7040 TYPE_MAX_VALUE (b
->type
)))
7041 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7042 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7043 TYPE_MIN_VALUE (b
->type
))));
7045 case FIXED_POINT_TYPE
:
7046 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7049 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7052 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7053 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7054 || (TYPE_ARG_TYPES (a
->type
)
7055 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7056 && TYPE_ARG_TYPES (b
->type
)
7057 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7058 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7059 TYPE_ARG_TYPES (b
->type
)))))
7063 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7064 where the flag should be inherited from the element type
7065 and can change after ARRAY_TYPEs are created; on non-aggregates
7066 compare it and hash it, scalars will never have that flag set
7067 and we need to differentiate between arrays created by different
7068 front-ends or middle-end created arrays. */
7069 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7070 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7071 || (TYPE_TYPELESS_STORAGE (a
->type
)
7072 == TYPE_TYPELESS_STORAGE (b
->type
))));
7076 case QUAL_UNION_TYPE
:
7077 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7078 || (TYPE_FIELDS (a
->type
)
7079 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7080 && TYPE_FIELDS (b
->type
)
7081 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7082 && type_list_equal (TYPE_FIELDS (a
->type
),
7083 TYPE_FIELDS (b
->type
))));
7086 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7087 || (TYPE_ARG_TYPES (a
->type
)
7088 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7089 && TYPE_ARG_TYPES (b
->type
)
7090 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7091 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7092 TYPE_ARG_TYPES (b
->type
))))
7100 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7101 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7106 /* Given TYPE, and HASHCODE its hash code, return the canonical
7107 object for an identical type if one already exists.
7108 Otherwise, return TYPE, and record it as the canonical object.
7110 To use this function, first create a type of the sort you want.
7111 Then compute its hash code from the fields of the type that
7112 make it different from other similar types.
7113 Then call this function and use the value. */
7116 type_hash_canon (unsigned int hashcode
, tree type
)
7121 /* The hash table only contains main variants, so ensure that's what we're
7123 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7125 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7126 must call that routine before comparing TYPE_ALIGNs. */
7132 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7135 tree t1
= ((type_hash
*) *loc
)->type
;
7136 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7138 if (TYPE_UID (type
) + 1 == next_type_uid
)
7140 /* Free also min/max values and the cache for integer
7141 types. This can't be done in free_node, as LTO frees
7142 those on its own. */
7143 if (TREE_CODE (type
) == INTEGER_TYPE
)
7145 if (TYPE_MIN_VALUE (type
)
7146 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7148 /* Zero is always in TYPE_CACHED_VALUES. */
7149 if (! TYPE_UNSIGNED (type
))
7150 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7151 ggc_free (TYPE_MIN_VALUE (type
));
7153 if (TYPE_MAX_VALUE (type
)
7154 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7156 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7157 ggc_free (TYPE_MAX_VALUE (type
));
7159 if (TYPE_CACHED_VALUES_P (type
))
7160 ggc_free (TYPE_CACHED_VALUES (type
));
7167 struct type_hash
*h
;
7169 h
= ggc_alloc
<type_hash
> ();
7179 print_type_hash_statistics (void)
7181 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7182 (long) type_hash_table
->size (),
7183 (long) type_hash_table
->elements (),
7184 type_hash_table
->collisions ());
7187 /* Given two lists of types
7188 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7189 return 1 if the lists contain the same types in the same order.
7190 Also, the TREE_PURPOSEs must match. */
7193 type_list_equal (const_tree l1
, const_tree l2
)
7197 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7198 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7199 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7200 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7201 && (TREE_TYPE (TREE_PURPOSE (t1
))
7202 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7208 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7209 given by TYPE. If the argument list accepts variable arguments,
7210 then this function counts only the ordinary arguments. */
7213 type_num_arguments (const_tree fntype
)
7217 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7218 /* If the function does not take a variable number of arguments,
7219 the last element in the list will have type `void'. */
7220 if (VOID_TYPE_P (TREE_VALUE (t
)))
7228 /* Return the type of the function TYPE's argument ARGNO if known.
7229 For vararg function's where ARGNO refers to one of the variadic
7230 arguments return null. Otherwise, return a void_type_node for
7231 out-of-bounds ARGNO. */
7234 type_argument_type (const_tree fntype
, unsigned argno
)
7236 /* Treat zero the same as an out-of-bounds argument number. */
7238 return void_type_node
;
7240 function_args_iterator iter
;
7244 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7246 /* A vararg function's argument list ends in a null. Otherwise,
7247 an ordinary function's argument list ends with void. Return
7248 null if ARGNO refers to a vararg argument, void_type_node if
7249 it's out of bounds, and the formal argument type otherwise. */
7253 if (i
== argno
|| VOID_TYPE_P (argtype
))
7262 /* Nonzero if integer constants T1 and T2
7263 represent the same constant value. */
7266 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7271 if (t1
== 0 || t2
== 0)
7274 STRIP_ANY_LOCATION_WRAPPER (t1
);
7275 STRIP_ANY_LOCATION_WRAPPER (t2
);
7277 if (TREE_CODE (t1
) == INTEGER_CST
7278 && TREE_CODE (t2
) == INTEGER_CST
7279 && wi::to_widest (t1
) == wi::to_widest (t2
))
7285 /* Return true if T is an INTEGER_CST whose numerical value (extended
7286 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7289 tree_fits_shwi_p (const_tree t
)
7291 return (t
!= NULL_TREE
7292 && TREE_CODE (t
) == INTEGER_CST
7293 && wi::fits_shwi_p (wi::to_widest (t
)));
7296 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7297 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7300 tree_fits_poly_int64_p (const_tree t
)
7304 if (POLY_INT_CST_P (t
))
7306 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7307 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7311 return (TREE_CODE (t
) == INTEGER_CST
7312 && wi::fits_shwi_p (wi::to_widest (t
)));
7315 /* Return true if T is an INTEGER_CST whose numerical value (extended
7316 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7319 tree_fits_uhwi_p (const_tree t
)
7321 return (t
!= NULL_TREE
7322 && TREE_CODE (t
) == INTEGER_CST
7323 && wi::fits_uhwi_p (wi::to_widest (t
)));
7326 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7327 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7330 tree_fits_poly_uint64_p (const_tree t
)
7334 if (POLY_INT_CST_P (t
))
7336 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7337 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7341 return (TREE_CODE (t
) == INTEGER_CST
7342 && wi::fits_uhwi_p (wi::to_widest (t
)));
7345 /* T is an INTEGER_CST whose numerical value (extended according to
7346 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7350 tree_to_shwi (const_tree t
)
7352 gcc_assert (tree_fits_shwi_p (t
));
7353 return TREE_INT_CST_LOW (t
);
7356 /* T is an INTEGER_CST whose numerical value (extended according to
7357 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7360 unsigned HOST_WIDE_INT
7361 tree_to_uhwi (const_tree t
)
7363 gcc_assert (tree_fits_uhwi_p (t
));
7364 return TREE_INT_CST_LOW (t
);
7367 /* Return the most significant (sign) bit of T. */
7370 tree_int_cst_sign_bit (const_tree t
)
7372 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7374 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7377 /* Return an indication of the sign of the integer constant T.
7378 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7379 Note that -1 will never be returned if T's type is unsigned. */
7382 tree_int_cst_sgn (const_tree t
)
7384 if (wi::to_wide (t
) == 0)
7386 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7388 else if (wi::neg_p (wi::to_wide (t
)))
7394 /* Return the minimum number of bits needed to represent VALUE in a
7395 signed or unsigned type, UNSIGNEDP says which. */
7398 tree_int_cst_min_precision (tree value
, signop sgn
)
7400 /* If the value is negative, compute its negative minus 1. The latter
7401 adjustment is because the absolute value of the largest negative value
7402 is one larger than the largest positive value. This is equivalent to
7403 a bit-wise negation, so use that operation instead. */
7405 if (tree_int_cst_sgn (value
) < 0)
7406 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7408 /* Return the number of bits needed, taking into account the fact
7409 that we need one more bit for a signed than unsigned type.
7410 If value is 0 or -1, the minimum precision is 1 no matter
7411 whether unsignedp is true or false. */
7413 if (integer_zerop (value
))
7416 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7419 /* Return truthvalue of whether T1 is the same tree structure as T2.
7420 Return 1 if they are the same.
7421 Return 0 if they are understandably different.
7422 Return -1 if either contains tree structure not understood by
7426 simple_cst_equal (const_tree t1
, const_tree t2
)
7428 enum tree_code code1
, code2
;
7434 if (t1
== 0 || t2
== 0)
7437 /* For location wrappers to be the same, they must be at the same
7438 source location (and wrap the same thing). */
7439 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7441 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7443 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7446 code1
= TREE_CODE (t1
);
7447 code2
= TREE_CODE (t2
);
7449 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7451 if (CONVERT_EXPR_CODE_P (code2
)
7452 || code2
== NON_LVALUE_EXPR
)
7453 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7455 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7458 else if (CONVERT_EXPR_CODE_P (code2
)
7459 || code2
== NON_LVALUE_EXPR
)
7460 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7468 return wi::to_widest (t1
) == wi::to_widest (t2
);
7471 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7474 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7477 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7478 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7479 TREE_STRING_LENGTH (t1
)));
7483 unsigned HOST_WIDE_INT idx
;
7484 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7485 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7487 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7490 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7491 /* ??? Should we handle also fields here? */
7492 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7498 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7501 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7504 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7507 const_tree arg1
, arg2
;
7508 const_call_expr_arg_iterator iter1
, iter2
;
7509 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7510 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7512 arg1
= next_const_call_expr_arg (&iter1
),
7513 arg2
= next_const_call_expr_arg (&iter2
))
7515 cmp
= simple_cst_equal (arg1
, arg2
);
7519 return arg1
== arg2
;
7523 /* Special case: if either target is an unallocated VAR_DECL,
7524 it means that it's going to be unified with whatever the
7525 TARGET_EXPR is really supposed to initialize, so treat it
7526 as being equivalent to anything. */
7527 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7528 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7529 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7530 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7531 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7532 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7535 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7540 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7542 case WITH_CLEANUP_EXPR
:
7543 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7547 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7550 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7551 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7562 if (POLY_INT_CST_P (t1
))
7563 /* A false return means maybe_ne rather than known_ne. */
7564 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7565 TYPE_SIGN (TREE_TYPE (t1
))),
7566 poly_widest_int::from (poly_int_cst_value (t2
),
7567 TYPE_SIGN (TREE_TYPE (t2
))));
7571 /* This general rule works for most tree codes. All exceptions should be
7572 handled above. If this is a language-specific tree code, we can't
7573 trust what might be in the operand, so say we don't know
7575 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7578 switch (TREE_CODE_CLASS (code1
))
7582 case tcc_comparison
:
7583 case tcc_expression
:
7587 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7589 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7601 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7602 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7603 than U, respectively. */
7606 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7608 if (tree_int_cst_sgn (t
) < 0)
7610 else if (!tree_fits_uhwi_p (t
))
7612 else if (TREE_INT_CST_LOW (t
) == u
)
7614 else if (TREE_INT_CST_LOW (t
) < u
)
7620 /* Return true if SIZE represents a constant size that is in bounds of
7621 what the middle-end and the backend accepts (covering not more than
7622 half of the address-space).
7623 When PERR is non-null, set *PERR on failure to the description of
7624 why SIZE is not valid. */
7627 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7629 if (POLY_INT_CST_P (size
))
7631 if (TREE_OVERFLOW (size
))
7633 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7634 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7639 cst_size_error error
;
7643 if (TREE_CODE (size
) != INTEGER_CST
)
7645 *perr
= cst_size_not_constant
;
7649 if (TREE_OVERFLOW_P (size
))
7651 *perr
= cst_size_overflow
;
7655 if (tree_int_cst_sgn (size
) < 0)
7657 *perr
= cst_size_negative
;
7660 if (!tree_fits_uhwi_p (size
)
7661 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7662 < wi::to_widest (size
) * 2))
7664 *perr
= cst_size_too_big
;
7671 /* Return the precision of the type, or for a complex or vector type the
7672 precision of the type of its elements. */
7675 element_precision (const_tree type
)
7678 type
= TREE_TYPE (type
);
7679 enum tree_code code
= TREE_CODE (type
);
7680 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7681 type
= TREE_TYPE (type
);
7683 return TYPE_PRECISION (type
);
7686 /* Return true if CODE represents an associative tree code. Otherwise
7689 associative_tree_code (enum tree_code code
)
7708 /* Return true if CODE represents a commutative tree code. Otherwise
7711 commutative_tree_code (enum tree_code code
)
7717 case MULT_HIGHPART_EXPR
:
7725 case UNORDERED_EXPR
:
7729 case TRUTH_AND_EXPR
:
7730 case TRUTH_XOR_EXPR
:
7732 case WIDEN_MULT_EXPR
:
7733 case VEC_WIDEN_MULT_HI_EXPR
:
7734 case VEC_WIDEN_MULT_LO_EXPR
:
7735 case VEC_WIDEN_MULT_EVEN_EXPR
:
7736 case VEC_WIDEN_MULT_ODD_EXPR
:
7745 /* Return true if CODE represents a ternary tree code for which the
7746 first two operands are commutative. Otherwise return false. */
7748 commutative_ternary_tree_code (enum tree_code code
)
7752 case WIDEN_MULT_PLUS_EXPR
:
7753 case WIDEN_MULT_MINUS_EXPR
:
7763 /* Returns true if CODE can overflow. */
7766 operation_can_overflow (enum tree_code code
)
7774 /* Can overflow in various ways. */
7776 case TRUNC_DIV_EXPR
:
7777 case EXACT_DIV_EXPR
:
7778 case FLOOR_DIV_EXPR
:
7780 /* For INT_MIN / -1. */
7787 /* These operators cannot overflow. */
7792 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7793 ftrapv doesn't generate trapping insns for CODE. */
7796 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7798 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7800 /* We don't generate instructions that trap on overflow for complex or vector
7802 if (!INTEGRAL_TYPE_P (type
))
7805 if (!TYPE_OVERFLOW_TRAPS (type
))
7815 /* These operators can overflow, and -ftrapv generates trapping code for
7818 case TRUNC_DIV_EXPR
:
7819 case EXACT_DIV_EXPR
:
7820 case FLOOR_DIV_EXPR
:
7823 /* These operators can overflow, but -ftrapv does not generate trapping
7827 /* These operators cannot overflow. */
7832 /* Constructors for pointer, array and function types.
7833 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7834 constructed by language-dependent code, not here.) */
7836 /* Construct, lay out and return the type of pointers to TO_TYPE with
7837 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7838 reference all of memory. If such a type has already been
7839 constructed, reuse it. */
7842 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7846 bool could_alias
= can_alias_all
;
7848 if (to_type
== error_mark_node
)
7849 return error_mark_node
;
7851 /* If the pointed-to type has the may_alias attribute set, force
7852 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7853 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7854 can_alias_all
= true;
7856 /* In some cases, languages will have things that aren't a POINTER_TYPE
7857 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7858 In that case, return that type without regard to the rest of our
7861 ??? This is a kludge, but consistent with the way this function has
7862 always operated and there doesn't seem to be a good way to avoid this
7864 if (TYPE_POINTER_TO (to_type
) != 0
7865 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7866 return TYPE_POINTER_TO (to_type
);
7868 /* First, if we already have a type for pointers to TO_TYPE and it's
7869 the proper mode, use it. */
7870 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7871 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7874 t
= make_node (POINTER_TYPE
);
7876 TREE_TYPE (t
) = to_type
;
7877 SET_TYPE_MODE (t
, mode
);
7878 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7879 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7880 TYPE_POINTER_TO (to_type
) = t
;
7882 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7883 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7884 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7885 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7887 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7890 /* Lay out the type. This function has many callers that are concerned
7891 with expression-construction, and this simplifies them all. */
7897 /* By default build pointers in ptr_mode. */
7900 build_pointer_type (tree to_type
)
7902 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7903 : TYPE_ADDR_SPACE (to_type
);
7904 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7905 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7908 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7911 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7915 bool could_alias
= can_alias_all
;
7917 if (to_type
== error_mark_node
)
7918 return error_mark_node
;
7920 /* If the pointed-to type has the may_alias attribute set, force
7921 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7922 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7923 can_alias_all
= true;
7925 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7926 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7927 In that case, return that type without regard to the rest of our
7930 ??? This is a kludge, but consistent with the way this function has
7931 always operated and there doesn't seem to be a good way to avoid this
7933 if (TYPE_REFERENCE_TO (to_type
) != 0
7934 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7935 return TYPE_REFERENCE_TO (to_type
);
7937 /* First, if we already have a type for pointers to TO_TYPE and it's
7938 the proper mode, use it. */
7939 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7940 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7943 t
= make_node (REFERENCE_TYPE
);
7945 TREE_TYPE (t
) = to_type
;
7946 SET_TYPE_MODE (t
, mode
);
7947 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7948 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7949 TYPE_REFERENCE_TO (to_type
) = t
;
7951 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7952 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7953 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7954 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7956 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7965 /* Build the node for the type of references-to-TO_TYPE by default
7969 build_reference_type (tree to_type
)
7971 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7972 : TYPE_ADDR_SPACE (to_type
);
7973 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7974 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7977 #define MAX_INT_CACHED_PREC \
7978 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7979 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7981 /* Builds a signed or unsigned integer type of precision PRECISION.
7982 Used for C bitfields whose precision does not match that of
7983 built-in target types. */
7985 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7991 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7993 if (precision
<= MAX_INT_CACHED_PREC
)
7995 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8000 itype
= make_node (INTEGER_TYPE
);
8001 TYPE_PRECISION (itype
) = precision
;
8004 fixup_unsigned_type (itype
);
8006 fixup_signed_type (itype
);
8008 inchash::hash hstate
;
8009 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8010 ret
= type_hash_canon (hstate
.end (), itype
);
8011 if (precision
<= MAX_INT_CACHED_PREC
)
8012 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8017 #define MAX_BOOL_CACHED_PREC \
8018 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8019 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8021 /* Builds a boolean type of precision PRECISION.
8022 Used for boolean vectors to choose proper vector element size. */
8024 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8028 if (precision
<= MAX_BOOL_CACHED_PREC
)
8030 type
= nonstandard_boolean_type_cache
[precision
];
8035 type
= make_node (BOOLEAN_TYPE
);
8036 TYPE_PRECISION (type
) = precision
;
8037 fixup_signed_type (type
);
8039 if (precision
<= MAX_INT_CACHED_PREC
)
8040 nonstandard_boolean_type_cache
[precision
] = type
;
8045 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8046 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8047 is true, reuse such a type that has already been constructed. */
8050 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8052 tree itype
= make_node (INTEGER_TYPE
);
8054 TREE_TYPE (itype
) = type
;
8056 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8057 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8059 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8060 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8061 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8062 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8063 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8064 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8065 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8070 if ((TYPE_MIN_VALUE (itype
)
8071 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8072 || (TYPE_MAX_VALUE (itype
)
8073 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8075 /* Since we cannot reliably merge this type, we need to compare it using
8076 structural equality checks. */
8077 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8081 hashval_t hash
= type_hash_canon_hash (itype
);
8082 itype
= type_hash_canon (hash
, itype
);
8087 /* Wrapper around build_range_type_1 with SHARED set to true. */
8090 build_range_type (tree type
, tree lowval
, tree highval
)
8092 return build_range_type_1 (type
, lowval
, highval
, true);
8095 /* Wrapper around build_range_type_1 with SHARED set to false. */
8098 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8100 return build_range_type_1 (type
, lowval
, highval
, false);
8103 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8104 MAXVAL should be the maximum value in the domain
8105 (one less than the length of the array).
8107 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8108 We don't enforce this limit, that is up to caller (e.g. language front end).
8109 The limit exists because the result is a signed type and we don't handle
8110 sizes that use more than one HOST_WIDE_INT. */
8113 build_index_type (tree maxval
)
8115 return build_range_type (sizetype
, size_zero_node
, maxval
);
8118 /* Return true if the debug information for TYPE, a subtype, should be emitted
8119 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8120 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8121 debug info and doesn't reflect the source code. */
8124 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8126 tree base_type
= TREE_TYPE (type
), low
, high
;
8128 /* Subrange types have a base type which is an integral type. */
8129 if (!INTEGRAL_TYPE_P (base_type
))
8132 /* Get the real bounds of the subtype. */
8133 if (lang_hooks
.types
.get_subrange_bounds
)
8134 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8137 low
= TYPE_MIN_VALUE (type
);
8138 high
= TYPE_MAX_VALUE (type
);
8141 /* If the type and its base type have the same representation and the same
8142 name, then the type is not a subrange but a copy of the base type. */
8143 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8144 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8145 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8146 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8147 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8148 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8158 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8159 and number of elements specified by the range of values of INDEX_TYPE.
8160 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8161 If SHARED is true, reuse such a type that has already been constructed.
8162 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8165 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8166 bool shared
, bool set_canonical
)
8170 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8172 error ("arrays of functions are not meaningful");
8173 elt_type
= integer_type_node
;
8176 t
= make_node (ARRAY_TYPE
);
8177 TREE_TYPE (t
) = elt_type
;
8178 TYPE_DOMAIN (t
) = index_type
;
8179 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8180 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8185 hashval_t hash
= type_hash_canon_hash (t
);
8186 t
= type_hash_canon (hash
, t
);
8189 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
8191 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8192 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8194 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8195 else if (TYPE_CANONICAL (elt_type
) != elt_type
8196 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8198 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8200 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8201 typeless_storage
, shared
, set_canonical
);
8207 /* Wrapper around build_array_type_1 with SHARED set to true. */
8210 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8213 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
8216 /* Wrapper around build_array_type_1 with SHARED set to false. */
8219 build_nonshared_array_type (tree elt_type
, tree index_type
)
8221 return build_array_type_1 (elt_type
, index_type
, false, false, true);
8224 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8228 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8230 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8233 /* Recursively examines the array elements of TYPE, until a non-array
8234 element type is found. */
8237 strip_array_types (tree type
)
8239 while (TREE_CODE (type
) == ARRAY_TYPE
)
8240 type
= TREE_TYPE (type
);
8245 /* Computes the canonical argument types from the argument type list
8248 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8249 on entry to this function, or if any of the ARGTYPES are
8252 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8253 true on entry to this function, or if any of the ARGTYPES are
8256 Returns a canonical argument list, which may be ARGTYPES when the
8257 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8258 true) or would not differ from ARGTYPES. */
8261 maybe_canonicalize_argtypes (tree argtypes
,
8262 bool *any_structural_p
,
8263 bool *any_noncanonical_p
)
8266 bool any_noncanonical_argtypes_p
= false;
8268 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8270 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8271 /* Fail gracefully by stating that the type is structural. */
8272 *any_structural_p
= true;
8273 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8274 *any_structural_p
= true;
8275 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8276 || TREE_PURPOSE (arg
))
8277 /* If the argument has a default argument, we consider it
8278 non-canonical even though the type itself is canonical.
8279 That way, different variants of function and method types
8280 with default arguments will all point to the variant with
8281 no defaults as their canonical type. */
8282 any_noncanonical_argtypes_p
= true;
8285 if (*any_structural_p
)
8288 if (any_noncanonical_argtypes_p
)
8290 /* Build the canonical list of argument types. */
8291 tree canon_argtypes
= NULL_TREE
;
8292 bool is_void
= false;
8294 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8296 if (arg
== void_list_node
)
8299 canon_argtypes
= tree_cons (NULL_TREE
,
8300 TYPE_CANONICAL (TREE_VALUE (arg
)),
8304 canon_argtypes
= nreverse (canon_argtypes
);
8306 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8308 /* There is a non-canonical type. */
8309 *any_noncanonical_p
= true;
8310 return canon_argtypes
;
8313 /* The canonical argument types are the same as ARGTYPES. */
8317 /* Construct, lay out and return
8318 the type of functions returning type VALUE_TYPE
8319 given arguments of types ARG_TYPES.
8320 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8321 are data type nodes for the arguments of the function.
8322 If such a type has already been constructed, reuse it. */
8325 build_function_type (tree value_type
, tree arg_types
)
8328 inchash::hash hstate
;
8329 bool any_structural_p
, any_noncanonical_p
;
8330 tree canon_argtypes
;
8332 gcc_assert (arg_types
!= error_mark_node
);
8334 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8336 error ("function return type cannot be function");
8337 value_type
= integer_type_node
;
8340 /* Make a node of the sort we want. */
8341 t
= make_node (FUNCTION_TYPE
);
8342 TREE_TYPE (t
) = value_type
;
8343 TYPE_ARG_TYPES (t
) = arg_types
;
8345 /* If we already have such a type, use the old one. */
8346 hashval_t hash
= type_hash_canon_hash (t
);
8347 t
= type_hash_canon (hash
, t
);
8349 /* Set up the canonical type. */
8350 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8351 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8352 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8354 &any_noncanonical_p
);
8355 if (any_structural_p
)
8356 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8357 else if (any_noncanonical_p
)
8358 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8361 if (!COMPLETE_TYPE_P (t
))
8366 /* Build a function type. The RETURN_TYPE is the type returned by the
8367 function. If VAARGS is set, no void_type_node is appended to the
8368 list. ARGP must be always be terminated be a NULL_TREE. */
8371 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8375 t
= va_arg (argp
, tree
);
8376 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8377 args
= tree_cons (NULL_TREE
, t
, args
);
8382 if (args
!= NULL_TREE
)
8383 args
= nreverse (args
);
8384 gcc_assert (last
!= void_list_node
);
8386 else if (args
== NULL_TREE
)
8387 args
= void_list_node
;
8391 args
= nreverse (args
);
8392 TREE_CHAIN (last
) = void_list_node
;
8394 args
= build_function_type (return_type
, args
);
8399 /* Build a function type. The RETURN_TYPE is the type returned by the
8400 function. If additional arguments are provided, they are
8401 additional argument types. The list of argument types must always
8402 be terminated by NULL_TREE. */
8405 build_function_type_list (tree return_type
, ...)
8410 va_start (p
, return_type
);
8411 args
= build_function_type_list_1 (false, return_type
, p
);
8416 /* Build a variable argument function type. The RETURN_TYPE is the
8417 type returned by the function. If additional arguments are provided,
8418 they are additional argument types. The list of argument types must
8419 always be terminated by NULL_TREE. */
8422 build_varargs_function_type_list (tree return_type
, ...)
8427 va_start (p
, return_type
);
8428 args
= build_function_type_list_1 (true, return_type
, p
);
8434 /* Build a function type. RETURN_TYPE is the type returned by the
8435 function; VAARGS indicates whether the function takes varargs. The
8436 function takes N named arguments, the types of which are provided in
8440 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8444 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8446 for (i
= n
- 1; i
>= 0; i
--)
8447 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8449 return build_function_type (return_type
, t
);
8452 /* Build a function type. RETURN_TYPE is the type returned by the
8453 function. The function takes N named arguments, the types of which
8454 are provided in ARG_TYPES. */
8457 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8459 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8462 /* Build a variable argument function type. RETURN_TYPE is the type
8463 returned by the function. The function takes N named arguments, the
8464 types of which are provided in ARG_TYPES. */
8467 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8469 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8472 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8473 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8474 for the method. An implicit additional parameter (of type
8475 pointer-to-BASETYPE) is added to the ARGTYPES. */
8478 build_method_type_directly (tree basetype
,
8484 bool any_structural_p
, any_noncanonical_p
;
8485 tree canon_argtypes
;
8487 /* Make a node of the sort we want. */
8488 t
= make_node (METHOD_TYPE
);
8490 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8491 TREE_TYPE (t
) = rettype
;
8492 ptype
= build_pointer_type (basetype
);
8494 /* The actual arglist for this function includes a "hidden" argument
8495 which is "this". Put it into the list of argument types. */
8496 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8497 TYPE_ARG_TYPES (t
) = argtypes
;
8499 /* If we already have such a type, use the old one. */
8500 hashval_t hash
= type_hash_canon_hash (t
);
8501 t
= type_hash_canon (hash
, t
);
8503 /* Set up the canonical type. */
8505 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8506 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8508 = (TYPE_CANONICAL (basetype
) != basetype
8509 || TYPE_CANONICAL (rettype
) != rettype
);
8510 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8512 &any_noncanonical_p
);
8513 if (any_structural_p
)
8514 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8515 else if (any_noncanonical_p
)
8517 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8518 TYPE_CANONICAL (rettype
),
8520 if (!COMPLETE_TYPE_P (t
))
8526 /* Construct, lay out and return the type of methods belonging to class
8527 BASETYPE and whose arguments and values are described by TYPE.
8528 If that type exists already, reuse it.
8529 TYPE must be a FUNCTION_TYPE node. */
8532 build_method_type (tree basetype
, tree type
)
8534 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8536 return build_method_type_directly (basetype
,
8538 TYPE_ARG_TYPES (type
));
8541 /* Construct, lay out and return the type of offsets to a value
8542 of type TYPE, within an object of type BASETYPE.
8543 If a suitable offset type exists already, reuse it. */
8546 build_offset_type (tree basetype
, tree type
)
8550 /* Make a node of the sort we want. */
8551 t
= make_node (OFFSET_TYPE
);
8553 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8554 TREE_TYPE (t
) = type
;
8556 /* If we already have such a type, use the old one. */
8557 hashval_t hash
= type_hash_canon_hash (t
);
8558 t
= type_hash_canon (hash
, t
);
8560 if (!COMPLETE_TYPE_P (t
))
8563 if (TYPE_CANONICAL (t
) == t
)
8565 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8566 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8567 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8568 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8569 || TYPE_CANONICAL (type
) != type
)
8571 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8572 TYPE_CANONICAL (type
));
8578 /* Create a complex type whose components are COMPONENT_TYPE.
8580 If NAMED is true, the type is given a TYPE_NAME. We do not always
8581 do so because this creates a DECL node and thus make the DECL_UIDs
8582 dependent on the type canonicalization hashtable, which is GC-ed,
8583 so the DECL_UIDs would not be stable wrt garbage collection. */
8586 build_complex_type (tree component_type
, bool named
)
8588 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8589 || SCALAR_FLOAT_TYPE_P (component_type
)
8590 || FIXED_POINT_TYPE_P (component_type
));
8592 /* Make a node of the sort we want. */
8593 tree probe
= make_node (COMPLEX_TYPE
);
8595 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8597 /* If we already have such a type, use the old one. */
8598 hashval_t hash
= type_hash_canon_hash (probe
);
8599 tree t
= type_hash_canon (hash
, probe
);
8603 /* We created a new type. The hash insertion will have laid
8604 out the type. We need to check the canonicalization and
8605 maybe set the name. */
8606 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8608 && TYPE_CANONICAL (t
) == t
);
8610 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8611 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8612 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8614 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8616 /* We need to create a name, since complex is a fundamental type. */
8619 const char *name
= NULL
;
8621 if (TREE_TYPE (t
) == char_type_node
)
8622 name
= "complex char";
8623 else if (TREE_TYPE (t
) == signed_char_type_node
)
8624 name
= "complex signed char";
8625 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8626 name
= "complex unsigned char";
8627 else if (TREE_TYPE (t
) == short_integer_type_node
)
8628 name
= "complex short int";
8629 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8630 name
= "complex short unsigned int";
8631 else if (TREE_TYPE (t
) == integer_type_node
)
8632 name
= "complex int";
8633 else if (TREE_TYPE (t
) == unsigned_type_node
)
8634 name
= "complex unsigned int";
8635 else if (TREE_TYPE (t
) == long_integer_type_node
)
8636 name
= "complex long int";
8637 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8638 name
= "complex long unsigned int";
8639 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8640 name
= "complex long long int";
8641 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8642 name
= "complex long long unsigned int";
8645 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8646 get_identifier (name
), t
);
8650 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8653 /* If TYPE is a real or complex floating-point type and the target
8654 does not directly support arithmetic on TYPE then return the wider
8655 type to be used for arithmetic on TYPE. Otherwise, return
8659 excess_precision_type (tree type
)
8661 /* The target can give two different responses to the question of
8662 which excess precision mode it would like depending on whether we
8663 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8665 enum excess_precision_type requested_type
8666 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8667 ? EXCESS_PRECISION_TYPE_FAST
8668 : EXCESS_PRECISION_TYPE_STANDARD
);
8670 enum flt_eval_method target_flt_eval_method
8671 = targetm
.c
.excess_precision (requested_type
);
8673 /* The target should not ask for unpredictable float evaluation (though
8674 it might advertise that implicitly the evaluation is unpredictable,
8675 but we don't care about that here, it will have been reported
8676 elsewhere). If it does ask for unpredictable evaluation, we have
8677 nothing to do here. */
8678 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8680 /* Nothing to do. The target has asked for all types we know about
8681 to be computed with their native precision and range. */
8682 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8685 /* The target will promote this type in a target-dependent way, so excess
8686 precision ought to leave it alone. */
8687 if (targetm
.promoted_type (type
) != NULL_TREE
)
8690 machine_mode float16_type_mode
= (float16_type_node
8691 ? TYPE_MODE (float16_type_node
)
8693 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8694 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8696 switch (TREE_CODE (type
))
8700 machine_mode type_mode
= TYPE_MODE (type
);
8701 switch (target_flt_eval_method
)
8703 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8704 if (type_mode
== float16_type_mode
)
8705 return float_type_node
;
8707 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8708 if (type_mode
== float16_type_mode
8709 || type_mode
== float_type_mode
)
8710 return double_type_node
;
8712 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8713 if (type_mode
== float16_type_mode
8714 || type_mode
== float_type_mode
8715 || type_mode
== double_type_mode
)
8716 return long_double_type_node
;
8725 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8727 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8728 switch (target_flt_eval_method
)
8730 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8731 if (type_mode
== float16_type_mode
)
8732 return complex_float_type_node
;
8734 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8735 if (type_mode
== float16_type_mode
8736 || type_mode
== float_type_mode
)
8737 return complex_double_type_node
;
8739 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8740 if (type_mode
== float16_type_mode
8741 || type_mode
== float_type_mode
8742 || type_mode
== double_type_mode
)
8743 return complex_long_double_type_node
;
8757 /* Return OP, stripped of any conversions to wider types as much as is safe.
8758 Converting the value back to OP's type makes a value equivalent to OP.
8760 If FOR_TYPE is nonzero, we return a value which, if converted to
8761 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8763 OP must have integer, real or enumeral type. Pointers are not allowed!
8765 There are some cases where the obvious value we could return
8766 would regenerate to OP if converted to OP's type,
8767 but would not extend like OP to wider types.
8768 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8769 For example, if OP is (unsigned short)(signed char)-1,
8770 we avoid returning (signed char)-1 if FOR_TYPE is int,
8771 even though extending that to an unsigned short would regenerate OP,
8772 since the result of extending (signed char)-1 to (int)
8773 is different from (int) OP. */
8776 get_unwidened (tree op
, tree for_type
)
8778 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8779 tree type
= TREE_TYPE (op
);
8781 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8783 = (for_type
!= 0 && for_type
!= type
8784 && final_prec
> TYPE_PRECISION (type
)
8785 && TYPE_UNSIGNED (type
));
8788 while (CONVERT_EXPR_P (op
))
8792 /* TYPE_PRECISION on vector types has different meaning
8793 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8794 so avoid them here. */
8795 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8798 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8799 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8801 /* Truncations are many-one so cannot be removed.
8802 Unless we are later going to truncate down even farther. */
8804 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8807 /* See what's inside this conversion. If we decide to strip it,
8809 op
= TREE_OPERAND (op
, 0);
8811 /* If we have not stripped any zero-extensions (uns is 0),
8812 we can strip any kind of extension.
8813 If we have previously stripped a zero-extension,
8814 only zero-extensions can safely be stripped.
8815 Any extension can be stripped if the bits it would produce
8816 are all going to be discarded later by truncating to FOR_TYPE. */
8820 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8822 /* TYPE_UNSIGNED says whether this is a zero-extension.
8823 Let's avoid computing it if it does not affect WIN
8824 and if UNS will not be needed again. */
8826 || CONVERT_EXPR_P (op
))
8827 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8835 /* If we finally reach a constant see if it fits in sth smaller and
8836 in that case convert it. */
8837 if (TREE_CODE (win
) == INTEGER_CST
)
8839 tree wtype
= TREE_TYPE (win
);
8840 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8842 prec
= MAX (prec
, final_prec
);
8843 if (prec
< TYPE_PRECISION (wtype
))
8845 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8846 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8847 win
= fold_convert (t
, win
);
8854 /* Return OP or a simpler expression for a narrower value
8855 which can be sign-extended or zero-extended to give back OP.
8856 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8857 or 0 if the value should be sign-extended. */
8860 get_narrower (tree op
, int *unsignedp_ptr
)
8865 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8867 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8870 op
= TREE_OPERAND (op
, 1);
8871 while (TREE_CODE (op
) == COMPOUND_EXPR
);
8872 tree ret
= get_narrower (op
, unsignedp_ptr
);
8875 auto_vec
<tree
, 16> v
;
8877 for (op
= win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8878 op
= TREE_OPERAND (op
, 1))
8880 FOR_EACH_VEC_ELT_REVERSE (v
, i
, op
)
8881 ret
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8882 TREE_TYPE (win
), TREE_OPERAND (op
, 0),
8886 while (TREE_CODE (op
) == NOP_EXPR
)
8889 = (TYPE_PRECISION (TREE_TYPE (op
))
8890 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8892 /* Truncations are many-one so cannot be removed. */
8896 /* See what's inside this conversion. If we decide to strip it,
8901 op
= TREE_OPERAND (op
, 0);
8902 /* An extension: the outermost one can be stripped,
8903 but remember whether it is zero or sign extension. */
8905 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8906 /* Otherwise, if a sign extension has been stripped,
8907 only sign extensions can now be stripped;
8908 if a zero extension has been stripped, only zero-extensions. */
8909 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8913 else /* bitschange == 0 */
8915 /* A change in nominal type can always be stripped, but we must
8916 preserve the unsignedness. */
8918 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8920 op
= TREE_OPERAND (op
, 0);
8921 /* Keep trying to narrow, but don't assign op to win if it
8922 would turn an integral type into something else. */
8923 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8930 if (TREE_CODE (op
) == COMPONENT_REF
8931 /* Since type_for_size always gives an integer type. */
8932 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8933 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8934 /* Ensure field is laid out already. */
8935 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8936 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8938 unsigned HOST_WIDE_INT innerprec
8939 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8940 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8941 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8942 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8944 /* We can get this structure field in a narrower type that fits it,
8945 but the resulting extension to its nominal type (a fullword type)
8946 must satisfy the same conditions as for other extensions.
8948 Do this only for fields that are aligned (not bit-fields),
8949 because when bit-field insns will be used there is no
8950 advantage in doing this. */
8952 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8953 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8954 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8958 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8959 win
= fold_convert (type
, op
);
8963 *unsignedp_ptr
= uns
;
8967 /* Return true if integer constant C has a value that is permissible
8968 for TYPE, an integral type. */
8971 int_fits_type_p (const_tree c
, const_tree type
)
8973 tree type_low_bound
, type_high_bound
;
8974 bool ok_for_low_bound
, ok_for_high_bound
;
8975 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8977 /* Non-standard boolean types can have arbitrary precision but various
8978 transformations assume that they can only take values 0 and +/-1. */
8979 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8980 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8983 type_low_bound
= TYPE_MIN_VALUE (type
);
8984 type_high_bound
= TYPE_MAX_VALUE (type
);
8986 /* If at least one bound of the type is a constant integer, we can check
8987 ourselves and maybe make a decision. If no such decision is possible, but
8988 this type is a subtype, try checking against that. Otherwise, use
8989 fits_to_tree_p, which checks against the precision.
8991 Compute the status for each possibly constant bound, and return if we see
8992 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8993 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8994 for "constant known to fit". */
8996 /* Check if c >= type_low_bound. */
8997 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8999 if (tree_int_cst_lt (c
, type_low_bound
))
9001 ok_for_low_bound
= true;
9004 ok_for_low_bound
= false;
9006 /* Check if c <= type_high_bound. */
9007 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9009 if (tree_int_cst_lt (type_high_bound
, c
))
9011 ok_for_high_bound
= true;
9014 ok_for_high_bound
= false;
9016 /* If the constant fits both bounds, the result is known. */
9017 if (ok_for_low_bound
&& ok_for_high_bound
)
9020 /* Perform some generic filtering which may allow making a decision
9021 even if the bounds are not constant. First, negative integers
9022 never fit in unsigned types, */
9023 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9026 /* Second, narrower types always fit in wider ones. */
9027 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9030 /* Third, unsigned integers with top bit set never fit signed types. */
9031 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9033 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9034 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9036 /* When a tree_cst is converted to a wide-int, the precision
9037 is taken from the type. However, if the precision of the
9038 mode underneath the type is smaller than that, it is
9039 possible that the value will not fit. The test below
9040 fails if any bit is set between the sign bit of the
9041 underlying mode and the top bit of the type. */
9042 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9045 else if (wi::neg_p (wi::to_wide (c
)))
9049 /* If we haven't been able to decide at this point, there nothing more we
9050 can check ourselves here. Look at the base type if we have one and it
9051 has the same precision. */
9052 if (TREE_CODE (type
) == INTEGER_TYPE
9053 && TREE_TYPE (type
) != 0
9054 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9056 type
= TREE_TYPE (type
);
9060 /* Or to fits_to_tree_p, if nothing else. */
9061 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9064 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9065 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9066 represented (assuming two's-complement arithmetic) within the bit
9067 precision of the type are returned instead. */
9070 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9072 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9073 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9074 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9077 if (TYPE_UNSIGNED (type
))
9078 mpz_set_ui (min
, 0);
9081 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9082 wi::to_mpz (mn
, min
, SIGNED
);
9086 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9087 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9088 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9091 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9092 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9096 /* Return true if VAR is an automatic variable. */
9099 auto_var_p (const_tree var
)
9101 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9102 || TREE_CODE (var
) == PARM_DECL
)
9103 && ! TREE_STATIC (var
))
9104 || TREE_CODE (var
) == RESULT_DECL
);
9107 /* Return true if VAR is an automatic variable defined in function FN. */
9110 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9112 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9113 && (auto_var_p (var
)
9114 || TREE_CODE (var
) == LABEL_DECL
));
9117 /* Subprogram of following function. Called by walk_tree.
9119 Return *TP if it is an automatic variable or parameter of the
9120 function passed in as DATA. */
9123 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9125 tree fn
= (tree
) data
;
9130 else if (DECL_P (*tp
)
9131 && auto_var_in_fn_p (*tp
, fn
))
9137 /* Returns true if T is, contains, or refers to a type with variable
9138 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9139 arguments, but not the return type. If FN is nonzero, only return
9140 true if a modifier of the type or position of FN is a variable or
9141 parameter inside FN.
9143 This concept is more general than that of C99 'variably modified types':
9144 in C99, a struct type is never variably modified because a VLA may not
9145 appear as a structure member. However, in GNU C code like:
9147 struct S { int i[f()]; };
9149 is valid, and other languages may define similar constructs. */
9152 variably_modified_type_p (tree type
, tree fn
)
9156 /* Test if T is either variable (if FN is zero) or an expression containing
9157 a variable in FN. If TYPE isn't gimplified, return true also if
9158 gimplify_one_sizepos would gimplify the expression into a local
9160 #define RETURN_TRUE_IF_VAR(T) \
9161 do { tree _t = (T); \
9162 if (_t != NULL_TREE \
9163 && _t != error_mark_node \
9164 && !CONSTANT_CLASS_P (_t) \
9165 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9167 || (!TYPE_SIZES_GIMPLIFIED (type) \
9168 && (TREE_CODE (_t) != VAR_DECL \
9169 && !CONTAINS_PLACEHOLDER_P (_t))) \
9170 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9171 return true; } while (0)
9173 if (type
== error_mark_node
)
9176 /* If TYPE itself has variable size, it is variably modified. */
9177 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9178 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9180 switch (TREE_CODE (type
))
9183 case REFERENCE_TYPE
:
9185 /* Ada can have pointer types refering to themselves indirectly. */
9186 if (TREE_VISITED (type
))
9188 TREE_VISITED (type
) = true;
9189 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9191 TREE_VISITED (type
) = false;
9194 TREE_VISITED (type
) = false;
9199 /* If TYPE is a function type, it is variably modified if the
9200 return type is variably modified. */
9201 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9207 case FIXED_POINT_TYPE
:
9210 /* Scalar types are variably modified if their end points
9212 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9213 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9218 case QUAL_UNION_TYPE
:
9219 /* We can't see if any of the fields are variably-modified by the
9220 definition we normally use, since that would produce infinite
9221 recursion via pointers. */
9222 /* This is variably modified if some field's type is. */
9223 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9224 if (TREE_CODE (t
) == FIELD_DECL
)
9226 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9227 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9228 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9230 /* If the type is a qualified union, then the DECL_QUALIFIER
9231 of fields can also be an expression containing a variable. */
9232 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9233 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9235 /* If the field is a qualified union, then it's only a container
9236 for what's inside so we look into it. That's necessary in LTO
9237 mode because the sizes of the field tested above have been set
9238 to PLACEHOLDER_EXPRs by free_lang_data. */
9239 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
9240 && variably_modified_type_p (TREE_TYPE (t
), fn
))
9246 /* Do not call ourselves to avoid infinite recursion. This is
9247 variably modified if the element type is. */
9248 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9249 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9256 /* The current language may have other cases to check, but in general,
9257 all other types are not variably modified. */
9258 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9260 #undef RETURN_TRUE_IF_VAR
9263 /* Given a DECL or TYPE, return the scope in which it was declared, or
9264 NULL_TREE if there is no containing scope. */
9267 get_containing_scope (const_tree t
)
9269 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9272 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9275 get_ultimate_context (const_tree decl
)
9277 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9279 if (TREE_CODE (decl
) == BLOCK
)
9280 decl
= BLOCK_SUPERCONTEXT (decl
);
9282 decl
= get_containing_scope (decl
);
9287 /* Return the innermost context enclosing DECL that is
9288 a FUNCTION_DECL, or zero if none. */
9291 decl_function_context (const_tree decl
)
9295 if (TREE_CODE (decl
) == ERROR_MARK
)
9298 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9299 where we look up the function at runtime. Such functions always take
9300 a first argument of type 'pointer to real context'.
9302 C++ should really be fixed to use DECL_CONTEXT for the real context,
9303 and use something else for the "virtual context". */
9304 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9307 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9309 context
= DECL_CONTEXT (decl
);
9311 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9313 if (TREE_CODE (context
) == BLOCK
)
9314 context
= BLOCK_SUPERCONTEXT (context
);
9316 context
= get_containing_scope (context
);
9322 /* Return the innermost context enclosing DECL that is
9323 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9324 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9327 decl_type_context (const_tree decl
)
9329 tree context
= DECL_CONTEXT (decl
);
9332 switch (TREE_CODE (context
))
9334 case NAMESPACE_DECL
:
9335 case TRANSLATION_UNIT_DECL
:
9340 case QUAL_UNION_TYPE
:
9345 context
= DECL_CONTEXT (context
);
9349 context
= BLOCK_SUPERCONTEXT (context
);
9359 /* CALL is a CALL_EXPR. Return the declaration for the function
9360 called, or NULL_TREE if the called function cannot be
9364 get_callee_fndecl (const_tree call
)
9368 if (call
== error_mark_node
)
9369 return error_mark_node
;
9371 /* It's invalid to call this function with anything but a
9373 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9375 /* The first operand to the CALL is the address of the function
9377 addr
= CALL_EXPR_FN (call
);
9379 /* If there is no function, return early. */
9380 if (addr
== NULL_TREE
)
9385 /* If this is a readonly function pointer, extract its initial value. */
9386 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9387 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9388 && DECL_INITIAL (addr
))
9389 addr
= DECL_INITIAL (addr
);
9391 /* If the address is just `&f' for some function `f', then we know
9392 that `f' is being called. */
9393 if (TREE_CODE (addr
) == ADDR_EXPR
9394 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9395 return TREE_OPERAND (addr
, 0);
9397 /* We couldn't figure out what was being called. */
9401 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9402 return the associated function code, otherwise return CFN_LAST. */
9405 get_call_combined_fn (const_tree call
)
9407 /* It's invalid to call this function with anything but a CALL_EXPR. */
9408 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9410 if (!CALL_EXPR_FN (call
))
9411 return as_combined_fn (CALL_EXPR_IFN (call
));
9413 tree fndecl
= get_callee_fndecl (call
);
9414 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9415 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9420 /* Comparator of indices based on tree_node_counts. */
9423 tree_nodes_cmp (const void *p1
, const void *p2
)
9425 const unsigned *n1
= (const unsigned *)p1
;
9426 const unsigned *n2
= (const unsigned *)p2
;
9428 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9431 /* Comparator of indices based on tree_code_counts. */
9434 tree_codes_cmp (const void *p1
, const void *p2
)
9436 const unsigned *n1
= (const unsigned *)p1
;
9437 const unsigned *n2
= (const unsigned *)p2
;
9439 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9442 #define TREE_MEM_USAGE_SPACES 40
9444 /* Print debugging information about tree nodes generated during the compile,
9445 and any language-specific information. */
9448 dump_tree_statistics (void)
9450 if (GATHER_STATISTICS
)
9452 uint64_t total_nodes
, total_bytes
;
9453 fprintf (stderr
, "\nKind Nodes Bytes\n");
9454 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9455 total_nodes
= total_bytes
= 0;
9458 auto_vec
<unsigned> indices (all_kinds
);
9459 for (unsigned i
= 0; i
< all_kinds
; i
++)
9460 indices
.quick_push (i
);
9461 indices
.qsort (tree_nodes_cmp
);
9463 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9465 unsigned j
= indices
[i
];
9466 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9467 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
9468 SIZE_AMOUNT (tree_node_sizes
[j
]));
9469 total_nodes
+= tree_node_counts
[j
];
9470 total_bytes
+= tree_node_sizes
[j
];
9472 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9473 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9474 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9475 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9479 fprintf (stderr
, "Code Nodes\n");
9480 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9482 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9483 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9484 indices
.quick_push (i
);
9485 indices
.qsort (tree_codes_cmp
);
9487 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9489 unsigned j
= indices
[i
];
9490 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9491 get_tree_code_name ((enum tree_code
) j
),
9492 SIZE_AMOUNT (tree_code_counts
[j
]));
9494 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9495 fprintf (stderr
, "\n");
9496 ssanames_print_statistics ();
9497 fprintf (stderr
, "\n");
9498 phinodes_print_statistics ();
9499 fprintf (stderr
, "\n");
9503 fprintf (stderr
, "(No per-node statistics)\n");
9505 print_type_hash_statistics ();
9506 print_debug_expr_statistics ();
9507 print_value_expr_statistics ();
9508 lang_hooks
.print_statistics ();
9511 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9513 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9516 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9518 /* This relies on the raw feedback's top 4 bits being zero. */
9519 #define FEEDBACK(X) ((X) * 0x04c11db7)
9520 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9521 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9522 static const unsigned syndromes
[16] =
9524 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9525 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9526 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9527 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9532 value
<<= (32 - bytes
* 8);
9533 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9535 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9537 chksum
= (chksum
<< 4) ^ feedback
;
9543 /* Generate a crc32 of a string. */
9546 crc32_string (unsigned chksum
, const char *string
)
9549 chksum
= crc32_byte (chksum
, *string
);
9554 /* P is a string that will be used in a symbol. Mask out any characters
9555 that are not valid in that context. */
9558 clean_symbol_name (char *p
)
9562 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9565 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9572 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9574 /* Create a unique anonymous identifier. The identifier is still a
9575 valid assembly label. */
9581 #if !defined (NO_DOT_IN_LABEL)
9583 #elif !defined (NO_DOLLAR_IN_LABEL)
9591 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9592 gcc_checking_assert (len
< int (sizeof (buf
)));
9594 tree id
= get_identifier_with_length (buf
, len
);
9595 IDENTIFIER_ANON_P (id
) = true;
9600 /* Generate a name for a special-purpose function.
9601 The generated name may need to be unique across the whole link.
9602 Changes to this function may also require corresponding changes to
9603 xstrdup_mask_random.
9604 TYPE is some string to identify the purpose of this function to the
9605 linker or collect2; it must start with an uppercase letter,
9607 I - for constructors
9609 N - for C++ anonymous namespaces
9610 F - for DWARF unwind frame information. */
9613 get_file_function_name (const char *type
)
9619 /* If we already have a name we know to be unique, just use that. */
9620 if (first_global_object_name
)
9621 p
= q
= ASTRDUP (first_global_object_name
);
9622 /* If the target is handling the constructors/destructors, they
9623 will be local to this file and the name is only necessary for
9625 We also assign sub_I and sub_D sufixes to constructors called from
9626 the global static constructors. These are always local. */
9627 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9628 || (strncmp (type
, "sub_", 4) == 0
9629 && (type
[4] == 'I' || type
[4] == 'D')))
9631 const char *file
= main_input_filename
;
9633 file
= LOCATION_FILE (input_location
);
9634 /* Just use the file's basename, because the full pathname
9635 might be quite long. */
9636 p
= q
= ASTRDUP (lbasename (file
));
9640 /* Otherwise, the name must be unique across the entire link.
9641 We don't have anything that we know to be unique to this translation
9642 unit, so use what we do have and throw in some randomness. */
9644 const char *name
= weak_global_object_name
;
9645 const char *file
= main_input_filename
;
9650 file
= LOCATION_FILE (input_location
);
9652 len
= strlen (file
);
9653 q
= (char *) alloca (9 + 19 + len
+ 1);
9654 memcpy (q
, file
, len
+ 1);
9656 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9657 crc32_string (0, name
), get_random_seed (false));
9662 clean_symbol_name (q
);
9663 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9666 /* Set up the name of the file-level functions we may need.
9667 Use a global object (which is already required to be unique over
9668 the program) rather than the file name (which imposes extra
9670 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9672 return get_identifier (buf
);
9675 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9677 /* Complain that the tree code of NODE does not match the expected 0
9678 terminated list of trailing codes. The trailing code list can be
9679 empty, for a more vague error message. FILE, LINE, and FUNCTION
9680 are of the caller. */
9683 tree_check_failed (const_tree node
, const char *file
,
9684 int line
, const char *function
, ...)
9688 unsigned length
= 0;
9689 enum tree_code code
;
9691 va_start (args
, function
);
9692 while ((code
= (enum tree_code
) va_arg (args
, int)))
9693 length
+= 4 + strlen (get_tree_code_name (code
));
9698 va_start (args
, function
);
9699 length
+= strlen ("expected ");
9700 buffer
= tmp
= (char *) alloca (length
);
9702 while ((code
= (enum tree_code
) va_arg (args
, int)))
9704 const char *prefix
= length
? " or " : "expected ";
9706 strcpy (tmp
+ length
, prefix
);
9707 length
+= strlen (prefix
);
9708 strcpy (tmp
+ length
, get_tree_code_name (code
));
9709 length
+= strlen (get_tree_code_name (code
));
9714 buffer
= "unexpected node";
9716 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9717 buffer
, get_tree_code_name (TREE_CODE (node
)),
9718 function
, trim_filename (file
), line
);
9721 /* Complain that the tree code of NODE does match the expected 0
9722 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9726 tree_not_check_failed (const_tree node
, const char *file
,
9727 int line
, const char *function
, ...)
9731 unsigned length
= 0;
9732 enum tree_code code
;
9734 va_start (args
, function
);
9735 while ((code
= (enum tree_code
) va_arg (args
, int)))
9736 length
+= 4 + strlen (get_tree_code_name (code
));
9738 va_start (args
, function
);
9739 buffer
= (char *) alloca (length
);
9741 while ((code
= (enum tree_code
) va_arg (args
, int)))
9745 strcpy (buffer
+ length
, " or ");
9748 strcpy (buffer
+ length
, get_tree_code_name (code
));
9749 length
+= strlen (get_tree_code_name (code
));
9753 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9754 buffer
, get_tree_code_name (TREE_CODE (node
)),
9755 function
, trim_filename (file
), line
);
9758 /* Similar to tree_check_failed, except that we check for a class of tree
9759 code, given in CL. */
9762 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9763 const char *file
, int line
, const char *function
)
9766 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9767 TREE_CODE_CLASS_STRING (cl
),
9768 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9769 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9772 /* Similar to tree_check_failed, except that instead of specifying a
9773 dozen codes, use the knowledge that they're all sequential. */
9776 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9777 const char *function
, enum tree_code c1
,
9781 unsigned length
= 0;
9784 for (c
= c1
; c
<= c2
; ++c
)
9785 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9787 length
+= strlen ("expected ");
9788 buffer
= (char *) alloca (length
);
9791 for (c
= c1
; c
<= c2
; ++c
)
9793 const char *prefix
= length
? " or " : "expected ";
9795 strcpy (buffer
+ length
, prefix
);
9796 length
+= strlen (prefix
);
9797 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9798 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9801 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9802 buffer
, get_tree_code_name (TREE_CODE (node
)),
9803 function
, trim_filename (file
), line
);
9807 /* Similar to tree_check_failed, except that we check that a tree does
9808 not have the specified code, given in CL. */
9811 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9812 const char *file
, int line
, const char *function
)
9815 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9816 TREE_CODE_CLASS_STRING (cl
),
9817 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9818 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9822 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9825 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9826 const char *function
, enum omp_clause_code code
)
9828 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9830 omp_clause_code_name
[code
],
9831 get_tree_code_name (TREE_CODE (node
)),
9832 function
, trim_filename (file
), line
);
9836 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9839 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9840 const char *function
, enum omp_clause_code c1
,
9841 enum omp_clause_code c2
)
9844 unsigned length
= 0;
9847 for (c
= c1
; c
<= c2
; ++c
)
9848 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9850 length
+= strlen ("expected ");
9851 buffer
= (char *) alloca (length
);
9854 for (c
= c1
; c
<= c2
; ++c
)
9856 const char *prefix
= length
? " or " : "expected ";
9858 strcpy (buffer
+ length
, prefix
);
9859 length
+= strlen (prefix
);
9860 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9861 length
+= strlen (omp_clause_code_name
[c
]);
9864 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9865 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9866 function
, trim_filename (file
), line
);
9870 #undef DEFTREESTRUCT
9871 #define DEFTREESTRUCT(VAL, NAME) NAME,
9873 static const char *ts_enum_names
[] = {
9874 #include "treestruct.def"
9876 #undef DEFTREESTRUCT
9878 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9880 /* Similar to tree_class_check_failed, except that we check for
9881 whether CODE contains the tree structure identified by EN. */
9884 tree_contains_struct_check_failed (const_tree node
,
9885 const enum tree_node_structure_enum en
,
9886 const char *file
, int line
,
9887 const char *function
)
9890 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9892 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9896 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9897 (dynamically sized) vector. */
9900 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9901 const char *function
)
9904 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
9906 idx
+ 1, len
, function
, trim_filename (file
), line
);
9909 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9910 (dynamically sized) vector. */
9913 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9914 const char *function
)
9917 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
9918 idx
+ 1, len
, function
, trim_filename (file
), line
);
9921 /* Similar to above, except that the check is for the bounds of the operand
9922 vector of an expression node EXP. */
9925 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9926 int line
, const char *function
)
9928 enum tree_code code
= TREE_CODE (exp
);
9930 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9931 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9932 function
, trim_filename (file
), line
);
9935 /* Similar to above, except that the check is for the number of
9936 operands of an OMP_CLAUSE node. */
9939 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9940 int line
, const char *function
)
9943 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
9944 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9945 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9946 trim_filename (file
), line
);
9948 #endif /* ENABLE_TREE_CHECKING */
9950 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9951 and mapped to the machine mode MODE. Initialize its fields and build
9952 the information necessary for debugging output. */
9955 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9958 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9960 t
= make_node (VECTOR_TYPE
);
9961 TREE_TYPE (t
) = mv_innertype
;
9962 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9963 SET_TYPE_MODE (t
, mode
);
9965 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9966 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9967 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9968 || mode
!= VOIDmode
)
9969 && !VECTOR_BOOLEAN_TYPE_P (t
))
9971 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9975 hashval_t hash
= type_hash_canon_hash (t
);
9976 t
= type_hash_canon (hash
, t
);
9978 /* We have built a main variant, based on the main variant of the
9979 inner type. Use it to build the variant we return. */
9980 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9981 && TREE_TYPE (t
) != innertype
)
9982 return build_type_attribute_qual_variant (t
,
9983 TYPE_ATTRIBUTES (innertype
),
9984 TYPE_QUALS (innertype
));
9990 make_or_reuse_type (unsigned size
, int unsignedp
)
9994 if (size
== INT_TYPE_SIZE
)
9995 return unsignedp
? unsigned_type_node
: integer_type_node
;
9996 if (size
== CHAR_TYPE_SIZE
)
9997 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9998 if (size
== SHORT_TYPE_SIZE
)
9999 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10000 if (size
== LONG_TYPE_SIZE
)
10001 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10002 if (size
== LONG_LONG_TYPE_SIZE
)
10003 return (unsignedp
? long_long_unsigned_type_node
10004 : long_long_integer_type_node
);
10006 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10007 if (size
== int_n_data
[i
].bitsize
10008 && int_n_enabled_p
[i
])
10009 return (unsignedp
? int_n_trees
[i
].unsigned_type
10010 : int_n_trees
[i
].signed_type
);
10013 return make_unsigned_type (size
);
10015 return make_signed_type (size
);
10018 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10021 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10025 if (size
== SHORT_FRACT_TYPE_SIZE
)
10026 return unsignedp
? sat_unsigned_short_fract_type_node
10027 : sat_short_fract_type_node
;
10028 if (size
== FRACT_TYPE_SIZE
)
10029 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10030 if (size
== LONG_FRACT_TYPE_SIZE
)
10031 return unsignedp
? sat_unsigned_long_fract_type_node
10032 : sat_long_fract_type_node
;
10033 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10034 return unsignedp
? sat_unsigned_long_long_fract_type_node
10035 : sat_long_long_fract_type_node
;
10039 if (size
== SHORT_FRACT_TYPE_SIZE
)
10040 return unsignedp
? unsigned_short_fract_type_node
10041 : short_fract_type_node
;
10042 if (size
== FRACT_TYPE_SIZE
)
10043 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10044 if (size
== LONG_FRACT_TYPE_SIZE
)
10045 return unsignedp
? unsigned_long_fract_type_node
10046 : long_fract_type_node
;
10047 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10048 return unsignedp
? unsigned_long_long_fract_type_node
10049 : long_long_fract_type_node
;
10052 return make_fract_type (size
, unsignedp
, satp
);
10055 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10058 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10062 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10063 return unsignedp
? sat_unsigned_short_accum_type_node
10064 : sat_short_accum_type_node
;
10065 if (size
== ACCUM_TYPE_SIZE
)
10066 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10067 if (size
== LONG_ACCUM_TYPE_SIZE
)
10068 return unsignedp
? sat_unsigned_long_accum_type_node
10069 : sat_long_accum_type_node
;
10070 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10071 return unsignedp
? sat_unsigned_long_long_accum_type_node
10072 : sat_long_long_accum_type_node
;
10076 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10077 return unsignedp
? unsigned_short_accum_type_node
10078 : short_accum_type_node
;
10079 if (size
== ACCUM_TYPE_SIZE
)
10080 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10081 if (size
== LONG_ACCUM_TYPE_SIZE
)
10082 return unsignedp
? unsigned_long_accum_type_node
10083 : long_accum_type_node
;
10084 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10085 return unsignedp
? unsigned_long_long_accum_type_node
10086 : long_long_accum_type_node
;
10089 return make_accum_type (size
, unsignedp
, satp
);
10093 /* Create an atomic variant node for TYPE. This routine is called
10094 during initialization of data types to create the 5 basic atomic
10095 types. The generic build_variant_type function requires these to
10096 already be set up in order to function properly, so cannot be
10097 called from there. If ALIGN is non-zero, then ensure alignment is
10098 overridden to this value. */
10101 build_atomic_base (tree type
, unsigned int align
)
10105 /* Make sure its not already registered. */
10106 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10109 t
= build_variant_type_copy (type
);
10110 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10113 SET_TYPE_ALIGN (t
, align
);
10118 /* Information about the _FloatN and _FloatNx types. This must be in
10119 the same order as the corresponding TI_* enum values. */
10120 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10132 /* Create nodes for all integer types (and error_mark_node) using the sizes
10133 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10136 build_common_tree_nodes (bool signed_char
)
10140 error_mark_node
= make_node (ERROR_MARK
);
10141 TREE_TYPE (error_mark_node
) = error_mark_node
;
10143 initialize_sizetypes ();
10145 /* Define both `signed char' and `unsigned char'. */
10146 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10147 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10148 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10149 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10151 /* Define `char', which is like either `signed char' or `unsigned char'
10152 but not the same as either. */
10155 ? make_signed_type (CHAR_TYPE_SIZE
)
10156 : make_unsigned_type (CHAR_TYPE_SIZE
));
10157 TYPE_STRING_FLAG (char_type_node
) = 1;
10159 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10160 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10161 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10162 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10163 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10164 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10165 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10166 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10168 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10170 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10171 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10173 if (int_n_enabled_p
[i
])
10175 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10176 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10180 /* Define a boolean type. This type only represents boolean values but
10181 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10182 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10183 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10184 TYPE_PRECISION (boolean_type_node
) = 1;
10185 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10187 /* Define what type to use for size_t. */
10188 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10189 size_type_node
= unsigned_type_node
;
10190 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10191 size_type_node
= long_unsigned_type_node
;
10192 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10193 size_type_node
= long_long_unsigned_type_node
;
10194 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10195 size_type_node
= short_unsigned_type_node
;
10200 size_type_node
= NULL_TREE
;
10201 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10202 if (int_n_enabled_p
[i
])
10204 char name
[50], altname
[50];
10205 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10206 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10208 if (strcmp (name
, SIZE_TYPE
) == 0
10209 || strcmp (altname
, SIZE_TYPE
) == 0)
10211 size_type_node
= int_n_trees
[i
].unsigned_type
;
10214 if (size_type_node
== NULL_TREE
)
10215 gcc_unreachable ();
10218 /* Define what type to use for ptrdiff_t. */
10219 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10220 ptrdiff_type_node
= integer_type_node
;
10221 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10222 ptrdiff_type_node
= long_integer_type_node
;
10223 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10224 ptrdiff_type_node
= long_long_integer_type_node
;
10225 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10226 ptrdiff_type_node
= short_integer_type_node
;
10229 ptrdiff_type_node
= NULL_TREE
;
10230 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10231 if (int_n_enabled_p
[i
])
10233 char name
[50], altname
[50];
10234 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10235 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10237 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10238 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10239 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10241 if (ptrdiff_type_node
== NULL_TREE
)
10242 gcc_unreachable ();
10245 /* Fill in the rest of the sized types. Reuse existing type nodes
10247 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10248 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10249 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10250 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10251 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10253 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10254 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10255 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10256 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10257 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10259 /* Don't call build_qualified type for atomics. That routine does
10260 special processing for atomics, and until they are initialized
10261 it's better not to make that call.
10263 Check to see if there is a target override for atomic types. */
10265 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10266 targetm
.atomic_align_for_mode (QImode
));
10267 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10268 targetm
.atomic_align_for_mode (HImode
));
10269 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10270 targetm
.atomic_align_for_mode (SImode
));
10271 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10272 targetm
.atomic_align_for_mode (DImode
));
10273 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10274 targetm
.atomic_align_for_mode (TImode
));
10276 access_public_node
= get_identifier ("public");
10277 access_protected_node
= get_identifier ("protected");
10278 access_private_node
= get_identifier ("private");
10280 /* Define these next since types below may used them. */
10281 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10282 integer_one_node
= build_int_cst (integer_type_node
, 1);
10283 integer_three_node
= build_int_cst (integer_type_node
, 3);
10284 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10286 size_zero_node
= size_int (0);
10287 size_one_node
= size_int (1);
10288 bitsize_zero_node
= bitsize_int (0);
10289 bitsize_one_node
= bitsize_int (1);
10290 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10292 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10293 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10295 void_type_node
= make_node (VOID_TYPE
);
10296 layout_type (void_type_node
);
10298 /* We are not going to have real types in C with less than byte alignment,
10299 so we might as well not have any types that claim to have it. */
10300 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10301 TYPE_USER_ALIGN (void_type_node
) = 0;
10303 void_node
= make_node (VOID_CST
);
10304 TREE_TYPE (void_node
) = void_type_node
;
10306 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10307 layout_type (TREE_TYPE (null_pointer_node
));
10309 ptr_type_node
= build_pointer_type (void_type_node
);
10310 const_ptr_type_node
10311 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10312 for (unsigned i
= 0;
10313 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10315 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10317 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10319 float_type_node
= make_node (REAL_TYPE
);
10320 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10321 layout_type (float_type_node
);
10323 double_type_node
= make_node (REAL_TYPE
);
10324 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10325 layout_type (double_type_node
);
10327 long_double_type_node
= make_node (REAL_TYPE
);
10328 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10329 layout_type (long_double_type_node
);
10331 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10333 int n
= floatn_nx_types
[i
].n
;
10334 bool extended
= floatn_nx_types
[i
].extended
;
10335 scalar_float_mode mode
;
10336 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10338 int precision
= GET_MODE_PRECISION (mode
);
10339 /* Work around the rs6000 KFmode having precision 113 not
10341 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10342 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10343 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10345 gcc_assert (min_precision
== n
);
10346 if (precision
< min_precision
)
10347 precision
= min_precision
;
10348 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10349 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10350 layout_type (FLOATN_NX_TYPE_NODE (i
));
10351 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10354 float_ptr_type_node
= build_pointer_type (float_type_node
);
10355 double_ptr_type_node
= build_pointer_type (double_type_node
);
10356 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10357 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10359 /* Fixed size integer types. */
10360 uint16_type_node
= make_or_reuse_type (16, 1);
10361 uint32_type_node
= make_or_reuse_type (32, 1);
10362 uint64_type_node
= make_or_reuse_type (64, 1);
10363 if (targetm
.scalar_mode_supported_p (TImode
))
10364 uint128_type_node
= make_or_reuse_type (128, 1);
10366 /* Decimal float types. */
10367 if (targetm
.decimal_float_supported_p ())
10369 dfloat32_type_node
= make_node (REAL_TYPE
);
10370 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10371 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10372 layout_type (dfloat32_type_node
);
10374 dfloat64_type_node
= make_node (REAL_TYPE
);
10375 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10376 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10377 layout_type (dfloat64_type_node
);
10379 dfloat128_type_node
= make_node (REAL_TYPE
);
10380 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10381 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10382 layout_type (dfloat128_type_node
);
10385 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10386 complex_float_type_node
= build_complex_type (float_type_node
, true);
10387 complex_double_type_node
= build_complex_type (double_type_node
, true);
10388 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10391 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10393 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10394 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10395 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10398 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10399 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10400 sat_ ## KIND ## _type_node = \
10401 make_sat_signed_ ## KIND ## _type (SIZE); \
10402 sat_unsigned_ ## KIND ## _type_node = \
10403 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10404 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10405 unsigned_ ## KIND ## _type_node = \
10406 make_unsigned_ ## KIND ## _type (SIZE);
10408 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10409 sat_ ## WIDTH ## KIND ## _type_node = \
10410 make_sat_signed_ ## KIND ## _type (SIZE); \
10411 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10412 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10413 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10414 unsigned_ ## WIDTH ## KIND ## _type_node = \
10415 make_unsigned_ ## KIND ## _type (SIZE);
10417 /* Make fixed-point type nodes based on four different widths. */
10418 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10419 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10420 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10421 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10422 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10424 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10425 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10426 NAME ## _type_node = \
10427 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10428 u ## NAME ## _type_node = \
10429 make_or_reuse_unsigned_ ## KIND ## _type \
10430 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10431 sat_ ## NAME ## _type_node = \
10432 make_or_reuse_sat_signed_ ## KIND ## _type \
10433 (GET_MODE_BITSIZE (MODE ## mode)); \
10434 sat_u ## NAME ## _type_node = \
10435 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10436 (GET_MODE_BITSIZE (U ## MODE ## mode));
10438 /* Fixed-point type and mode nodes. */
10439 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10440 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10441 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10442 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10443 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10444 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10445 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10446 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10447 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10448 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10449 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10452 tree t
= targetm
.build_builtin_va_list ();
10454 /* Many back-ends define record types without setting TYPE_NAME.
10455 If we copied the record type here, we'd keep the original
10456 record type without a name. This breaks name mangling. So,
10457 don't copy record types and let c_common_nodes_and_builtins()
10458 declare the type to be __builtin_va_list. */
10459 if (TREE_CODE (t
) != RECORD_TYPE
)
10460 t
= build_variant_type_copy (t
);
10462 va_list_type_node
= t
;
10465 /* SCEV analyzer global shared trees. */
10466 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10467 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10468 chrec_known
= make_node (SCEV_KNOWN
);
10469 TREE_TYPE (chrec_known
) = void_type_node
;
10472 /* Modify DECL for given flags.
10473 TM_PURE attribute is set only on types, so the function will modify
10474 DECL's type when ECF_TM_PURE is used. */
10477 set_call_expr_flags (tree decl
, int flags
)
10479 if (flags
& ECF_NOTHROW
)
10480 TREE_NOTHROW (decl
) = 1;
10481 if (flags
& ECF_CONST
)
10482 TREE_READONLY (decl
) = 1;
10483 if (flags
& ECF_PURE
)
10484 DECL_PURE_P (decl
) = 1;
10485 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10486 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10487 if (flags
& ECF_NOVOPS
)
10488 DECL_IS_NOVOPS (decl
) = 1;
10489 if (flags
& ECF_NORETURN
)
10490 TREE_THIS_VOLATILE (decl
) = 1;
10491 if (flags
& ECF_MALLOC
)
10492 DECL_IS_MALLOC (decl
) = 1;
10493 if (flags
& ECF_RETURNS_TWICE
)
10494 DECL_IS_RETURNS_TWICE (decl
) = 1;
10495 if (flags
& ECF_LEAF
)
10496 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10497 NULL
, DECL_ATTRIBUTES (decl
));
10498 if (flags
& ECF_COLD
)
10499 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10500 NULL
, DECL_ATTRIBUTES (decl
));
10501 if (flags
& ECF_RET1
)
10502 DECL_ATTRIBUTES (decl
)
10503 = tree_cons (get_identifier ("fn spec"),
10504 build_tree_list (NULL_TREE
, build_string (1, "1")),
10505 DECL_ATTRIBUTES (decl
));
10506 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10507 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10508 /* Looping const or pure is implied by noreturn.
10509 There is currently no way to declare looping const or looping pure alone. */
10510 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10511 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10515 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10518 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10519 const char *library_name
, int ecf_flags
)
10523 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10524 library_name
, NULL_TREE
);
10525 set_call_expr_flags (decl
, ecf_flags
);
10527 set_builtin_decl (code
, decl
, true);
10530 /* Call this function after instantiating all builtins that the language
10531 front end cares about. This will build the rest of the builtins
10532 and internal functions that are relied upon by the tree optimizers and
10536 build_common_builtin_nodes (void)
10541 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10542 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10544 ftype
= build_function_type (void_type_node
, void_list_node
);
10545 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10546 local_define_builtin ("__builtin_unreachable", ftype
,
10547 BUILT_IN_UNREACHABLE
,
10548 "__builtin_unreachable",
10549 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10550 | ECF_CONST
| ECF_COLD
);
10551 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10552 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10554 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10557 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10558 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10560 ftype
= build_function_type_list (ptr_type_node
,
10561 ptr_type_node
, const_ptr_type_node
,
10562 size_type_node
, NULL_TREE
);
10564 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10565 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10566 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10567 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10568 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10569 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10572 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10574 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10575 const_ptr_type_node
, size_type_node
,
10577 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10578 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10581 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10583 ftype
= build_function_type_list (ptr_type_node
,
10584 ptr_type_node
, integer_type_node
,
10585 size_type_node
, NULL_TREE
);
10586 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10587 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10590 /* If we're checking the stack, `alloca' can throw. */
10591 const int alloca_flags
10592 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10594 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10596 ftype
= build_function_type_list (ptr_type_node
,
10597 size_type_node
, NULL_TREE
);
10598 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10599 "alloca", alloca_flags
);
10602 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10603 size_type_node
, NULL_TREE
);
10604 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10605 BUILT_IN_ALLOCA_WITH_ALIGN
,
10606 "__builtin_alloca_with_align",
10609 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10610 size_type_node
, size_type_node
, NULL_TREE
);
10611 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10612 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10613 "__builtin_alloca_with_align_and_max",
10616 ftype
= build_function_type_list (void_type_node
,
10617 ptr_type_node
, ptr_type_node
,
10618 ptr_type_node
, NULL_TREE
);
10619 local_define_builtin ("__builtin_init_trampoline", ftype
,
10620 BUILT_IN_INIT_TRAMPOLINE
,
10621 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10622 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10623 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10624 "__builtin_init_heap_trampoline",
10625 ECF_NOTHROW
| ECF_LEAF
);
10626 local_define_builtin ("__builtin_init_descriptor", ftype
,
10627 BUILT_IN_INIT_DESCRIPTOR
,
10628 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10630 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10631 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10632 BUILT_IN_ADJUST_TRAMPOLINE
,
10633 "__builtin_adjust_trampoline",
10634 ECF_CONST
| ECF_NOTHROW
);
10635 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10636 BUILT_IN_ADJUST_DESCRIPTOR
,
10637 "__builtin_adjust_descriptor",
10638 ECF_CONST
| ECF_NOTHROW
);
10640 ftype
= build_function_type_list (void_type_node
,
10641 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10642 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10643 BUILT_IN_NONLOCAL_GOTO
,
10644 "__builtin_nonlocal_goto",
10645 ECF_NORETURN
| ECF_NOTHROW
);
10647 ftype
= build_function_type_list (void_type_node
,
10648 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10649 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10650 BUILT_IN_SETJMP_SETUP
,
10651 "__builtin_setjmp_setup", ECF_NOTHROW
);
10653 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10654 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10655 BUILT_IN_SETJMP_RECEIVER
,
10656 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10658 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10659 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10660 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10662 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10663 local_define_builtin ("__builtin_stack_restore", ftype
,
10664 BUILT_IN_STACK_RESTORE
,
10665 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10667 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10668 const_ptr_type_node
, size_type_node
,
10670 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10671 "__builtin_memcmp_eq",
10672 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10674 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10675 "__builtin_strncmp_eq",
10676 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10678 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10679 "__builtin_strcmp_eq",
10680 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10682 /* If there's a possibility that we might use the ARM EABI, build the
10683 alternate __cxa_end_cleanup node used to resume from C++. */
10684 if (targetm
.arm_eabi_unwinder
)
10686 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10687 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10688 BUILT_IN_CXA_END_CLEANUP
,
10689 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10692 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10693 local_define_builtin ("__builtin_unwind_resume", ftype
,
10694 BUILT_IN_UNWIND_RESUME
,
10695 ((targetm_common
.except_unwind_info (&global_options
)
10697 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10700 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10702 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10704 local_define_builtin ("__builtin_return_address", ftype
,
10705 BUILT_IN_RETURN_ADDRESS
,
10706 "__builtin_return_address",
10710 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10711 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10713 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10714 ptr_type_node
, NULL_TREE
);
10715 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10716 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10717 BUILT_IN_PROFILE_FUNC_ENTER
,
10718 "__cyg_profile_func_enter", 0);
10719 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10720 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10721 BUILT_IN_PROFILE_FUNC_EXIT
,
10722 "__cyg_profile_func_exit", 0);
10725 /* The exception object and filter values from the runtime. The argument
10726 must be zero before exception lowering, i.e. from the front end. After
10727 exception lowering, it will be the region number for the exception
10728 landing pad. These functions are PURE instead of CONST to prevent
10729 them from being hoisted past the exception edge that will initialize
10730 its value in the landing pad. */
10731 ftype
= build_function_type_list (ptr_type_node
,
10732 integer_type_node
, NULL_TREE
);
10733 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10734 /* Only use TM_PURE if we have TM language support. */
10735 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10736 ecf_flags
|= ECF_TM_PURE
;
10737 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10738 "__builtin_eh_pointer", ecf_flags
);
10740 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10741 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10742 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10743 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10745 ftype
= build_function_type_list (void_type_node
,
10746 integer_type_node
, integer_type_node
,
10748 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10749 BUILT_IN_EH_COPY_VALUES
,
10750 "__builtin_eh_copy_values", ECF_NOTHROW
);
10752 /* Complex multiplication and division. These are handled as builtins
10753 rather than optabs because emit_library_call_value doesn't support
10754 complex. Further, we can do slightly better with folding these
10755 beasties if the real and complex parts of the arguments are separate. */
10759 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10761 char mode_name_buf
[4], *q
;
10763 enum built_in_function mcode
, dcode
;
10764 tree type
, inner_type
;
10765 const char *prefix
= "__";
10767 if (targetm
.libfunc_gnu_prefix
)
10770 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10773 inner_type
= TREE_TYPE (type
);
10775 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10776 inner_type
, inner_type
, NULL_TREE
);
10778 mcode
= ((enum built_in_function
)
10779 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10780 dcode
= ((enum built_in_function
)
10781 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10783 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10787 /* For -ftrapping-math these should throw from a former
10788 -fnon-call-exception stmt. */
10789 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10791 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10792 built_in_names
[mcode
],
10793 ECF_CONST
| ECF_LEAF
);
10795 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10797 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10798 built_in_names
[dcode
],
10799 ECF_CONST
| ECF_LEAF
);
10803 init_internal_fns ();
10806 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10809 If we requested a pointer to a vector, build up the pointers that
10810 we stripped off while looking for the inner type. Similarly for
10811 return values from functions.
10813 The argument TYPE is the top of the chain, and BOTTOM is the
10814 new type which we will point to. */
10817 reconstruct_complex_type (tree type
, tree bottom
)
10821 if (TREE_CODE (type
) == POINTER_TYPE
)
10823 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10824 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10825 TYPE_REF_CAN_ALIAS_ALL (type
));
10827 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10829 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10830 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10831 TYPE_REF_CAN_ALIAS_ALL (type
));
10833 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10835 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10836 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10838 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10840 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10841 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10843 else if (TREE_CODE (type
) == METHOD_TYPE
)
10845 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10846 /* The build_method_type_directly() routine prepends 'this' to argument list,
10847 so we must compensate by getting rid of it. */
10849 = build_method_type_directly
10850 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10852 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10854 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10856 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10857 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10862 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10863 TYPE_QUALS (type
));
10866 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10869 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10872 unsigned int bitsize
;
10874 switch (GET_MODE_CLASS (mode
))
10876 case MODE_VECTOR_BOOL
:
10877 case MODE_VECTOR_INT
:
10878 case MODE_VECTOR_FLOAT
:
10879 case MODE_VECTOR_FRACT
:
10880 case MODE_VECTOR_UFRACT
:
10881 case MODE_VECTOR_ACCUM
:
10882 case MODE_VECTOR_UACCUM
:
10883 nunits
= GET_MODE_NUNITS (mode
);
10887 /* Check that there are no leftover bits. */
10888 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10889 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10890 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10894 gcc_unreachable ();
10897 return make_vector_type (innertype
, nunits
, mode
);
10900 /* Similarly, but takes the inner type and number of units, which must be
10904 build_vector_type (tree innertype
, poly_int64 nunits
)
10906 return make_vector_type (innertype
, nunits
, VOIDmode
);
10909 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10912 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
10914 gcc_assert (mask_mode
!= BLKmode
);
10916 poly_uint64 vsize
= GET_MODE_BITSIZE (mask_mode
);
10917 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10918 tree bool_type
= build_nonstandard_boolean_type (esize
);
10920 return make_vector_type (bool_type
, nunits
, mask_mode
);
10923 /* Build a vector type that holds one boolean result for each element of
10924 vector type VECTYPE. The public interface for this operation is
10928 build_truth_vector_type_for (tree vectype
)
10930 machine_mode vector_mode
= TYPE_MODE (vectype
);
10931 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
10933 machine_mode mask_mode
;
10934 if (VECTOR_MODE_P (vector_mode
)
10935 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
10936 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
10938 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
10939 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10940 tree bool_type
= build_nonstandard_boolean_type (esize
);
10942 return make_vector_type (bool_type
, nunits
, BLKmode
);
10945 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10949 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10951 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10953 /* We always build the non-opaque variant before the opaque one,
10954 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10955 cand
= TYPE_NEXT_VARIANT (t
);
10957 && TYPE_VECTOR_OPAQUE (cand
)
10958 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10960 /* Othewise build a variant type and make sure to queue it after
10961 the non-opaque type. */
10962 cand
= build_distinct_type_copy (t
);
10963 TYPE_VECTOR_OPAQUE (cand
) = true;
10964 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10965 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10966 TYPE_NEXT_VARIANT (t
) = cand
;
10967 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10971 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10974 vector_cst_int_elt (const_tree t
, unsigned int i
)
10976 /* First handle elements that are directly encoded. */
10977 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10978 if (i
< encoded_nelts
)
10979 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10981 /* Identify the pattern that contains element I and work out the index of
10982 the last encoded element for that pattern. */
10983 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10984 unsigned int pattern
= i
% npatterns
;
10985 unsigned int count
= i
/ npatterns
;
10986 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10988 /* If there are no steps, the final encoded value is the right one. */
10989 if (!VECTOR_CST_STEPPED_P (t
))
10990 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10992 /* Otherwise work out the value from the last two encoded elements. */
10993 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10994 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10995 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10996 return wi::to_wide (v2
) + (count
- 2) * diff
;
10999 /* Return the value of element I of VECTOR_CST T. */
11002 vector_cst_elt (const_tree t
, unsigned int i
)
11004 /* First handle elements that are directly encoded. */
11005 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11006 if (i
< encoded_nelts
)
11007 return VECTOR_CST_ENCODED_ELT (t
, i
);
11009 /* If there are no steps, the final encoded value is the right one. */
11010 if (!VECTOR_CST_STEPPED_P (t
))
11012 /* Identify the pattern that contains element I and work out the index of
11013 the last encoded element for that pattern. */
11014 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11015 unsigned int pattern
= i
% npatterns
;
11016 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11017 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11020 /* Otherwise work out the value from the last two encoded elements. */
11021 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11022 vector_cst_int_elt (t
, i
));
11025 /* Given an initializer INIT, return TRUE if INIT is zero or some
11026 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11027 null, set *NONZERO if and only if INIT is known not to be all
11028 zeros. The combination of return value of false and *NONZERO
11029 false implies that INIT may but need not be all zeros. Other
11030 combinations indicate definitive answers. */
11033 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11039 /* Conservatively clear NONZERO and set it only if INIT is definitely
11045 unsigned HOST_WIDE_INT off
= 0;
11047 switch (TREE_CODE (init
))
11050 if (integer_zerop (init
))
11057 /* ??? Note that this is not correct for C4X float formats. There,
11058 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11059 negative exponent. */
11060 if (real_zerop (init
)
11061 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11068 if (fixed_zerop (init
))
11075 if (integer_zerop (init
)
11076 || (real_zerop (init
)
11077 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11078 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11085 if (VECTOR_CST_NPATTERNS (init
) == 1
11086 && VECTOR_CST_DUPLICATE_P (init
)
11087 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11095 if (TREE_CLOBBER_P (init
))
11098 unsigned HOST_WIDE_INT idx
;
11101 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11102 if (!initializer_zerop (elt
, nonzero
))
11110 tree arg
= TREE_OPERAND (init
, 0);
11111 if (TREE_CODE (arg
) != ADDR_EXPR
)
11113 tree offset
= TREE_OPERAND (init
, 1);
11114 if (TREE_CODE (offset
) != INTEGER_CST
11115 || !tree_fits_uhwi_p (offset
))
11117 off
= tree_to_uhwi (offset
);
11120 arg
= TREE_OPERAND (arg
, 0);
11121 if (TREE_CODE (arg
) != STRING_CST
)
11125 /* Fall through. */
11129 gcc_assert (off
<= INT_MAX
);
11132 int n
= TREE_STRING_LENGTH (init
);
11136 /* We need to loop through all elements to handle cases like
11137 "\0" and "\0foobar". */
11138 for (i
= 0; i
< n
; ++i
)
11139 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11153 /* Return true if EXPR is an initializer expression in which every element
11154 is a constant that is numerically equal to 0 or 1. The elements do not
11155 need to be equal to each other. */
11158 initializer_each_zero_or_onep (const_tree expr
)
11160 STRIP_ANY_LOCATION_WRAPPER (expr
);
11162 switch (TREE_CODE (expr
))
11165 return integer_zerop (expr
) || integer_onep (expr
);
11168 return real_zerop (expr
) || real_onep (expr
);
11172 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11173 if (VECTOR_CST_STEPPED_P (expr
)
11174 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11177 for (unsigned int i
= 0; i
< nelts
; ++i
)
11179 tree elt
= vector_cst_elt (expr
, i
);
11180 if (!initializer_each_zero_or_onep (elt
))
11192 /* Check if vector VEC consists of all the equal elements and
11193 that the number of elements corresponds to the type of VEC.
11194 The function returns first element of the vector
11195 or NULL_TREE if the vector is not uniform. */
11197 uniform_vector_p (const_tree vec
)
11200 unsigned HOST_WIDE_INT i
, nelts
;
11202 if (vec
== NULL_TREE
)
11205 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11207 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11208 return TREE_OPERAND (vec
, 0);
11210 else if (TREE_CODE (vec
) == VECTOR_CST
)
11212 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11213 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11217 else if (TREE_CODE (vec
) == CONSTRUCTOR
11218 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11220 first
= error_mark_node
;
11222 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11229 if (!operand_equal_p (first
, t
, 0))
11241 /* If the argument is INTEGER_CST, return it. If the argument is vector
11242 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11244 Look through location wrappers. */
11247 uniform_integer_cst_p (tree t
)
11249 STRIP_ANY_LOCATION_WRAPPER (t
);
11251 if (TREE_CODE (t
) == INTEGER_CST
)
11254 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11256 t
= uniform_vector_p (t
);
11257 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11264 /* If VECTOR_CST T has a single nonzero element, return the index of that
11265 element, otherwise return -1. */
11268 single_nonzero_element (const_tree t
)
11270 unsigned HOST_WIDE_INT nelts
;
11271 unsigned int repeat_nelts
;
11272 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11273 repeat_nelts
= nelts
;
11274 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11276 nelts
= vector_cst_encoded_nelts (t
);
11277 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11283 for (unsigned int i
= 0; i
< nelts
; ++i
)
11285 tree elt
= vector_cst_elt (t
, i
);
11286 if (!integer_zerop (elt
) && !real_zerop (elt
))
11288 if (res
>= 0 || i
>= repeat_nelts
)
11296 /* Build an empty statement at location LOC. */
11299 build_empty_stmt (location_t loc
)
11301 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11302 SET_EXPR_LOCATION (t
, loc
);
11307 /* Build an OpenMP clause with code CODE. LOC is the location of the
11311 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11316 length
= omp_clause_num_ops
[code
];
11317 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11319 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11321 t
= (tree
) ggc_internal_alloc (size
);
11322 memset (t
, 0, size
);
11323 TREE_SET_CODE (t
, OMP_CLAUSE
);
11324 OMP_CLAUSE_SET_CODE (t
, code
);
11325 OMP_CLAUSE_LOCATION (t
) = loc
;
11330 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11331 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11332 Except for the CODE and operand count field, other storage for the
11333 object is initialized to zeros. */
11336 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11339 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11341 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11342 gcc_assert (len
>= 1);
11344 record_node_allocation_statistics (code
, length
);
11346 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11348 TREE_SET_CODE (t
, code
);
11350 /* Can't use TREE_OPERAND to store the length because if checking is
11351 enabled, it will try to check the length before we store it. :-P */
11352 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11357 /* Helper function for build_call_* functions; build a CALL_EXPR with
11358 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11359 the argument slots. */
11362 build_call_1 (tree return_type
, tree fn
, int nargs
)
11366 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11367 TREE_TYPE (t
) = return_type
;
11368 CALL_EXPR_FN (t
) = fn
;
11369 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11374 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11375 FN and a null static chain slot. NARGS is the number of call arguments
11376 which are specified as "..." arguments. */
11379 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11383 va_start (args
, nargs
);
11384 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11389 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11390 FN and a null static chain slot. NARGS is the number of call arguments
11391 which are specified as a va_list ARGS. */
11394 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11399 t
= build_call_1 (return_type
, fn
, nargs
);
11400 for (i
= 0; i
< nargs
; i
++)
11401 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11402 process_call_operands (t
);
11406 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11407 FN and a null static chain slot. NARGS is the number of call arguments
11408 which are specified as a tree array ARGS. */
11411 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11412 int nargs
, const tree
*args
)
11417 t
= build_call_1 (return_type
, fn
, nargs
);
11418 for (i
= 0; i
< nargs
; i
++)
11419 CALL_EXPR_ARG (t
, i
) = args
[i
];
11420 process_call_operands (t
);
11421 SET_EXPR_LOCATION (t
, loc
);
11425 /* Like build_call_array, but takes a vec. */
11428 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11433 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11434 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11435 CALL_EXPR_ARG (ret
, ix
) = t
;
11436 process_call_operands (ret
);
11440 /* Conveniently construct a function call expression. FNDECL names the
11441 function to be called and N arguments are passed in the array
11445 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11447 tree fntype
= TREE_TYPE (fndecl
);
11448 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11450 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11453 /* Conveniently construct a function call expression. FNDECL names the
11454 function to be called and the arguments are passed in the vector
11458 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11460 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11461 vec_safe_address (vec
));
11465 /* Conveniently construct a function call expression. FNDECL names the
11466 function to be called, N is the number of arguments, and the "..."
11467 parameters are the argument expressions. */
11470 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11473 tree
*argarray
= XALLOCAVEC (tree
, n
);
11477 for (i
= 0; i
< n
; i
++)
11478 argarray
[i
] = va_arg (ap
, tree
);
11480 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11483 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11484 varargs macros aren't supported by all bootstrap compilers. */
11487 build_call_expr (tree fndecl
, int n
, ...)
11490 tree
*argarray
= XALLOCAVEC (tree
, n
);
11494 for (i
= 0; i
< n
; i
++)
11495 argarray
[i
] = va_arg (ap
, tree
);
11497 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11500 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11501 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11502 It will get gimplified later into an ordinary internal function. */
11505 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11506 tree type
, int n
, const tree
*args
)
11508 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11509 for (int i
= 0; i
< n
; ++i
)
11510 CALL_EXPR_ARG (t
, i
) = args
[i
];
11511 SET_EXPR_LOCATION (t
, loc
);
11512 CALL_EXPR_IFN (t
) = ifn
;
11513 process_call_operands (t
);
11517 /* Build internal call expression. This is just like CALL_EXPR, except
11518 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11519 internal function. */
11522 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11523 tree type
, int n
, ...)
11526 tree
*argarray
= XALLOCAVEC (tree
, n
);
11530 for (i
= 0; i
< n
; i
++)
11531 argarray
[i
] = va_arg (ap
, tree
);
11533 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11536 /* Return a function call to FN, if the target is guaranteed to support it,
11539 N is the number of arguments, passed in the "...", and TYPE is the
11540 type of the return value. */
11543 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11547 tree
*argarray
= XALLOCAVEC (tree
, n
);
11551 for (i
= 0; i
< n
; i
++)
11552 argarray
[i
] = va_arg (ap
, tree
);
11554 if (internal_fn_p (fn
))
11556 internal_fn ifn
= as_internal_fn (fn
);
11557 if (direct_internal_fn_p (ifn
))
11559 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11560 if (!direct_internal_fn_supported_p (ifn
, types
,
11561 OPTIMIZE_FOR_BOTH
))
11564 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11568 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11571 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11575 /* Return a function call to the appropriate builtin alloca variant.
11577 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11578 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11579 bound for SIZE in case it is not a fixed value. */
11582 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11586 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11588 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11590 else if (align
> 0)
11592 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11593 return build_call_expr (t
, 2, size
, size_int (align
));
11597 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11598 return build_call_expr (t
, 1, size
);
11602 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11603 if SIZE == -1) and return a tree node representing char* pointer to
11604 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11605 the STRING_CST value is the LEN bytes at STR (the representation
11606 of the string, which may be wide). Otherwise it's all zeros. */
11609 build_string_literal (unsigned len
, const char *str
/* = NULL */,
11610 tree eltype
/* = char_type_node */,
11611 unsigned HOST_WIDE_INT size
/* = -1 */)
11613 tree t
= build_string (len
, str
);
11614 /* Set the maximum valid index based on the string length or SIZE. */
11615 unsigned HOST_WIDE_INT maxidx
11616 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11618 tree index
= build_index_type (size_int (maxidx
));
11619 eltype
= build_type_variant (eltype
, 1, 0);
11620 tree type
= build_array_type (eltype
, index
);
11621 TREE_TYPE (t
) = type
;
11622 TREE_CONSTANT (t
) = 1;
11623 TREE_READONLY (t
) = 1;
11624 TREE_STATIC (t
) = 1;
11626 type
= build_pointer_type (eltype
);
11627 t
= build1 (ADDR_EXPR
, type
,
11628 build4 (ARRAY_REF
, eltype
,
11629 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11635 /* Return true if T (assumed to be a DECL) must be assigned a memory
11639 needs_to_live_in_memory (const_tree t
)
11641 return (TREE_ADDRESSABLE (t
)
11642 || is_global_var (t
)
11643 || (TREE_CODE (t
) == RESULT_DECL
11644 && !DECL_BY_REFERENCE (t
)
11645 && aggregate_value_p (t
, current_function_decl
)));
11648 /* Return value of a constant X and sign-extend it. */
11651 int_cst_value (const_tree x
)
11653 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11654 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11656 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11657 gcc_assert (cst_and_fits_in_hwi (x
));
11659 if (bits
< HOST_BITS_PER_WIDE_INT
)
11661 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11663 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11665 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11671 /* If TYPE is an integral or pointer type, return an integer type with
11672 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11673 if TYPE is already an integer type of signedness UNSIGNEDP.
11674 If TYPE is a floating-point type, return an integer type with the same
11675 bitsize and with the signedness given by UNSIGNEDP; this is useful
11676 when doing bit-level operations on a floating-point value. */
11679 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11681 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11684 if (TREE_CODE (type
) == VECTOR_TYPE
)
11686 tree inner
= TREE_TYPE (type
);
11687 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11690 if (inner
== inner2
)
11692 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11695 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11697 tree inner
= TREE_TYPE (type
);
11698 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11701 if (inner
== inner2
)
11703 return build_complex_type (inner2
);
11707 if (INTEGRAL_TYPE_P (type
)
11708 || POINTER_TYPE_P (type
)
11709 || TREE_CODE (type
) == OFFSET_TYPE
)
11710 bits
= TYPE_PRECISION (type
);
11711 else if (TREE_CODE (type
) == REAL_TYPE
)
11712 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11716 return build_nonstandard_integer_type (bits
, unsignedp
);
11719 /* If TYPE is an integral or pointer type, return an integer type with
11720 the same precision which is unsigned, or itself if TYPE is already an
11721 unsigned integer type. If TYPE is a floating-point type, return an
11722 unsigned integer type with the same bitsize as TYPE. */
11725 unsigned_type_for (tree type
)
11727 return signed_or_unsigned_type_for (1, type
);
11730 /* If TYPE is an integral or pointer type, return an integer type with
11731 the same precision which is signed, or itself if TYPE is already a
11732 signed integer type. If TYPE is a floating-point type, return a
11733 signed integer type with the same bitsize as TYPE. */
11736 signed_type_for (tree type
)
11738 return signed_or_unsigned_type_for (0, type
);
11741 /* If TYPE is a vector type, return a signed integer vector type with the
11742 same width and number of subparts. Otherwise return boolean_type_node. */
11745 truth_type_for (tree type
)
11747 if (TREE_CODE (type
) == VECTOR_TYPE
)
11749 if (VECTOR_BOOLEAN_TYPE_P (type
))
11751 return build_truth_vector_type_for (type
);
11754 return boolean_type_node
;
11757 /* Returns the largest value obtainable by casting something in INNER type to
11761 upper_bound_in_type (tree outer
, tree inner
)
11763 unsigned int det
= 0;
11764 unsigned oprec
= TYPE_PRECISION (outer
);
11765 unsigned iprec
= TYPE_PRECISION (inner
);
11768 /* Compute a unique number for every combination. */
11769 det
|= (oprec
> iprec
) ? 4 : 0;
11770 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11771 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11773 /* Determine the exponent to use. */
11778 /* oprec <= iprec, outer: signed, inner: don't care. */
11783 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11787 /* oprec > iprec, outer: signed, inner: signed. */
11791 /* oprec > iprec, outer: signed, inner: unsigned. */
11795 /* oprec > iprec, outer: unsigned, inner: signed. */
11799 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11803 gcc_unreachable ();
11806 return wide_int_to_tree (outer
,
11807 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11810 /* Returns the smallest value obtainable by casting something in INNER type to
11814 lower_bound_in_type (tree outer
, tree inner
)
11816 unsigned oprec
= TYPE_PRECISION (outer
);
11817 unsigned iprec
= TYPE_PRECISION (inner
);
11819 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11821 if (TYPE_UNSIGNED (outer
)
11822 /* If we are widening something of an unsigned type, OUTER type
11823 contains all values of INNER type. In particular, both INNER
11824 and OUTER types have zero in common. */
11825 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11826 return build_int_cst (outer
, 0);
11829 /* If we are widening a signed type to another signed type, we
11830 want to obtain -2^^(iprec-1). If we are keeping the
11831 precision or narrowing to a signed type, we want to obtain
11833 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11834 return wide_int_to_tree (outer
,
11835 wi::mask (prec
- 1, true,
11836 TYPE_PRECISION (outer
)));
11840 /* Return nonzero if two operands that are suitable for PHI nodes are
11841 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11842 SSA_NAME or invariant. Note that this is strictly an optimization.
11843 That is, callers of this function can directly call operand_equal_p
11844 and get the same result, only slower. */
11847 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11851 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11853 return operand_equal_p (arg0
, arg1
, 0);
11856 /* Returns number of zeros at the end of binary representation of X. */
11859 num_ending_zeros (const_tree x
)
11861 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11865 #define WALK_SUBTREE(NODE) \
11868 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11874 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11875 be walked whenever a type is seen in the tree. Rest of operands and return
11876 value are as for walk_tree. */
11879 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11880 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11882 tree result
= NULL_TREE
;
11884 switch (TREE_CODE (type
))
11887 case REFERENCE_TYPE
:
11889 /* We have to worry about mutually recursive pointers. These can't
11890 be written in C. They can in Ada. It's pathological, but
11891 there's an ACATS test (c38102a) that checks it. Deal with this
11892 by checking if we're pointing to another pointer, that one
11893 points to another pointer, that one does too, and we have no htab.
11894 If so, get a hash table. We check three levels deep to avoid
11895 the cost of the hash table if we don't need one. */
11896 if (POINTER_TYPE_P (TREE_TYPE (type
))
11897 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11898 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11901 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11912 WALK_SUBTREE (TREE_TYPE (type
));
11916 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11918 /* Fall through. */
11920 case FUNCTION_TYPE
:
11921 WALK_SUBTREE (TREE_TYPE (type
));
11925 /* We never want to walk into default arguments. */
11926 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11927 WALK_SUBTREE (TREE_VALUE (arg
));
11932 /* Don't follow this nodes's type if a pointer for fear that
11933 we'll have infinite recursion. If we have a PSET, then we
11936 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11937 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11938 WALK_SUBTREE (TREE_TYPE (type
));
11939 WALK_SUBTREE (TYPE_DOMAIN (type
));
11943 WALK_SUBTREE (TREE_TYPE (type
));
11944 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11954 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11955 called with the DATA and the address of each sub-tree. If FUNC returns a
11956 non-NULL value, the traversal is stopped, and the value returned by FUNC
11957 is returned. If PSET is non-NULL it is used to record the nodes visited,
11958 and to avoid visiting a node more than once. */
11961 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11962 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11964 enum tree_code code
;
11968 #define WALK_SUBTREE_TAIL(NODE) \
11972 goto tail_recurse; \
11977 /* Skip empty subtrees. */
11981 /* Don't walk the same tree twice, if the user has requested
11982 that we avoid doing so. */
11983 if (pset
&& pset
->add (*tp
))
11986 /* Call the function. */
11988 result
= (*func
) (tp
, &walk_subtrees
, data
);
11990 /* If we found something, return it. */
11994 code
= TREE_CODE (*tp
);
11996 /* Even if we didn't, FUNC may have decided that there was nothing
11997 interesting below this point in the tree. */
11998 if (!walk_subtrees
)
12000 /* But we still need to check our siblings. */
12001 if (code
== TREE_LIST
)
12002 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12003 else if (code
== OMP_CLAUSE
)
12004 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12011 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12012 if (result
|| !walk_subtrees
)
12019 case IDENTIFIER_NODE
:
12026 case PLACEHOLDER_EXPR
:
12030 /* None of these have subtrees other than those already walked
12035 WALK_SUBTREE (TREE_VALUE (*tp
));
12036 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12041 int len
= TREE_VEC_LENGTH (*tp
);
12046 /* Walk all elements but the first. */
12048 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12050 /* Now walk the first one as a tail call. */
12051 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12055 WALK_SUBTREE (TREE_REALPART (*tp
));
12056 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12060 unsigned HOST_WIDE_INT idx
;
12061 constructor_elt
*ce
;
12063 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12065 WALK_SUBTREE (ce
->value
);
12070 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12075 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12077 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12078 into declarations that are just mentioned, rather than
12079 declared; they don't really belong to this part of the tree.
12080 And, we can see cycles: the initializer for a declaration
12081 can refer to the declaration itself. */
12082 WALK_SUBTREE (DECL_INITIAL (decl
));
12083 WALK_SUBTREE (DECL_SIZE (decl
));
12084 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12086 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12089 case STATEMENT_LIST
:
12091 tree_stmt_iterator i
;
12092 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12093 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12098 switch (OMP_CLAUSE_CODE (*tp
))
12100 case OMP_CLAUSE_GANG
:
12101 case OMP_CLAUSE__GRIDDIM_
:
12102 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12105 case OMP_CLAUSE_ASYNC
:
12106 case OMP_CLAUSE_WAIT
:
12107 case OMP_CLAUSE_WORKER
:
12108 case OMP_CLAUSE_VECTOR
:
12109 case OMP_CLAUSE_NUM_GANGS
:
12110 case OMP_CLAUSE_NUM_WORKERS
:
12111 case OMP_CLAUSE_VECTOR_LENGTH
:
12112 case OMP_CLAUSE_PRIVATE
:
12113 case OMP_CLAUSE_SHARED
:
12114 case OMP_CLAUSE_FIRSTPRIVATE
:
12115 case OMP_CLAUSE_COPYIN
:
12116 case OMP_CLAUSE_COPYPRIVATE
:
12117 case OMP_CLAUSE_FINAL
:
12118 case OMP_CLAUSE_IF
:
12119 case OMP_CLAUSE_NUM_THREADS
:
12120 case OMP_CLAUSE_SCHEDULE
:
12121 case OMP_CLAUSE_UNIFORM
:
12122 case OMP_CLAUSE_DEPEND
:
12123 case OMP_CLAUSE_NONTEMPORAL
:
12124 case OMP_CLAUSE_NUM_TEAMS
:
12125 case OMP_CLAUSE_THREAD_LIMIT
:
12126 case OMP_CLAUSE_DEVICE
:
12127 case OMP_CLAUSE_DIST_SCHEDULE
:
12128 case OMP_CLAUSE_SAFELEN
:
12129 case OMP_CLAUSE_SIMDLEN
:
12130 case OMP_CLAUSE_ORDERED
:
12131 case OMP_CLAUSE_PRIORITY
:
12132 case OMP_CLAUSE_GRAINSIZE
:
12133 case OMP_CLAUSE_NUM_TASKS
:
12134 case OMP_CLAUSE_HINT
:
12135 case OMP_CLAUSE_TO_DECLARE
:
12136 case OMP_CLAUSE_LINK
:
12137 case OMP_CLAUSE_USE_DEVICE_PTR
:
12138 case OMP_CLAUSE_USE_DEVICE_ADDR
:
12139 case OMP_CLAUSE_IS_DEVICE_PTR
:
12140 case OMP_CLAUSE_INCLUSIVE
:
12141 case OMP_CLAUSE_EXCLUSIVE
:
12142 case OMP_CLAUSE__LOOPTEMP_
:
12143 case OMP_CLAUSE__REDUCTEMP_
:
12144 case OMP_CLAUSE__CONDTEMP_
:
12145 case OMP_CLAUSE__SCANTEMP_
:
12146 case OMP_CLAUSE__SIMDUID_
:
12147 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12150 case OMP_CLAUSE_INDEPENDENT
:
12151 case OMP_CLAUSE_NOWAIT
:
12152 case OMP_CLAUSE_DEFAULT
:
12153 case OMP_CLAUSE_UNTIED
:
12154 case OMP_CLAUSE_MERGEABLE
:
12155 case OMP_CLAUSE_PROC_BIND
:
12156 case OMP_CLAUSE_DEVICE_TYPE
:
12157 case OMP_CLAUSE_INBRANCH
:
12158 case OMP_CLAUSE_NOTINBRANCH
:
12159 case OMP_CLAUSE_FOR
:
12160 case OMP_CLAUSE_PARALLEL
:
12161 case OMP_CLAUSE_SECTIONS
:
12162 case OMP_CLAUSE_TASKGROUP
:
12163 case OMP_CLAUSE_NOGROUP
:
12164 case OMP_CLAUSE_THREADS
:
12165 case OMP_CLAUSE_SIMD
:
12166 case OMP_CLAUSE_DEFAULTMAP
:
12167 case OMP_CLAUSE_ORDER
:
12168 case OMP_CLAUSE_BIND
:
12169 case OMP_CLAUSE_AUTO
:
12170 case OMP_CLAUSE_SEQ
:
12171 case OMP_CLAUSE_TILE
:
12172 case OMP_CLAUSE__SIMT_
:
12173 case OMP_CLAUSE_IF_PRESENT
:
12174 case OMP_CLAUSE_FINALIZE
:
12175 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12177 case OMP_CLAUSE_LASTPRIVATE
:
12178 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12179 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12180 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12182 case OMP_CLAUSE_COLLAPSE
:
12185 for (i
= 0; i
< 3; i
++)
12186 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12187 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12190 case OMP_CLAUSE_LINEAR
:
12191 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12192 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12193 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12194 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12196 case OMP_CLAUSE_ALIGNED
:
12197 case OMP_CLAUSE_FROM
:
12198 case OMP_CLAUSE_TO
:
12199 case OMP_CLAUSE_MAP
:
12200 case OMP_CLAUSE__CACHE_
:
12201 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12202 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12203 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12205 case OMP_CLAUSE_REDUCTION
:
12206 case OMP_CLAUSE_TASK_REDUCTION
:
12207 case OMP_CLAUSE_IN_REDUCTION
:
12210 for (i
= 0; i
< 5; i
++)
12211 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12212 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12216 gcc_unreachable ();
12224 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12225 But, we only want to walk once. */
12226 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12227 for (i
= 0; i
< len
; ++i
)
12228 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12229 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12233 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12234 defining. We only want to walk into these fields of a type in this
12235 case and not in the general case of a mere reference to the type.
12237 The criterion is as follows: if the field can be an expression, it
12238 must be walked only here. This should be in keeping with the fields
12239 that are directly gimplified in gimplify_type_sizes in order for the
12240 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12241 variable-sized types.
12243 Note that DECLs get walked as part of processing the BIND_EXPR. */
12244 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12246 /* Call the function for the decl so e.g. copy_tree_body_r can
12247 replace it with the remapped one. */
12248 result
= (*func
) (&DECL_EXPR_DECL (*tp
), &walk_subtrees
, data
);
12249 if (result
|| !walk_subtrees
)
12252 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12253 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12256 /* Call the function for the type. See if it returns anything or
12257 doesn't want us to continue. If we are to continue, walk both
12258 the normal fields and those for the declaration case. */
12259 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12260 if (result
|| !walk_subtrees
)
12263 /* But do not walk a pointed-to type since it may itself need to
12264 be walked in the declaration case if it isn't anonymous. */
12265 if (!POINTER_TYPE_P (*type_p
))
12267 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12272 /* If this is a record type, also walk the fields. */
12273 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12277 for (field
= TYPE_FIELDS (*type_p
); field
;
12278 field
= DECL_CHAIN (field
))
12280 /* We'd like to look at the type of the field, but we can
12281 easily get infinite recursion. So assume it's pointed
12282 to elsewhere in the tree. Also, ignore things that
12284 if (TREE_CODE (field
) != FIELD_DECL
)
12287 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12288 WALK_SUBTREE (DECL_SIZE (field
));
12289 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12290 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12291 WALK_SUBTREE (DECL_QUALIFIER (field
));
12295 /* Same for scalar types. */
12296 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12297 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12298 || TREE_CODE (*type_p
) == INTEGER_TYPE
12299 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12300 || TREE_CODE (*type_p
) == REAL_TYPE
)
12302 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12303 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12306 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12307 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12312 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12316 /* Walk over all the sub-trees of this operand. */
12317 len
= TREE_OPERAND_LENGTH (*tp
);
12319 /* Go through the subtrees. We need to do this in forward order so
12320 that the scope of a FOR_EXPR is handled properly. */
12323 for (i
= 0; i
< len
- 1; ++i
)
12324 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12325 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12328 /* If this is a type, walk the needed fields in the type. */
12329 else if (TYPE_P (*tp
))
12330 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12334 /* We didn't find what we were looking for. */
12337 #undef WALK_SUBTREE_TAIL
12339 #undef WALK_SUBTREE
12341 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12344 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12349 hash_set
<tree
> pset
;
12350 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12356 tree_block (tree t
)
12358 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12360 if (IS_EXPR_CODE_CLASS (c
))
12361 return LOCATION_BLOCK (t
->exp
.locus
);
12362 gcc_unreachable ();
12367 tree_set_block (tree t
, tree b
)
12369 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12371 if (IS_EXPR_CODE_CLASS (c
))
12373 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12376 gcc_unreachable ();
12379 /* Create a nameless artificial label and put it in the current
12380 function context. The label has a location of LOC. Returns the
12381 newly created label. */
12384 create_artificial_label (location_t loc
)
12386 tree lab
= build_decl (loc
,
12387 LABEL_DECL
, NULL_TREE
, void_type_node
);
12389 DECL_ARTIFICIAL (lab
) = 1;
12390 DECL_IGNORED_P (lab
) = 1;
12391 DECL_CONTEXT (lab
) = current_function_decl
;
12395 /* Given a tree, try to return a useful variable name that we can use
12396 to prefix a temporary that is being assigned the value of the tree.
12397 I.E. given <temp> = &A, return A. */
12402 tree stripped_decl
;
12405 STRIP_NOPS (stripped_decl
);
12406 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12407 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12408 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12410 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12413 return IDENTIFIER_POINTER (name
);
12417 switch (TREE_CODE (stripped_decl
))
12420 return get_name (TREE_OPERAND (stripped_decl
, 0));
12427 /* Return true if TYPE has a variable argument list. */
12430 stdarg_p (const_tree fntype
)
12432 function_args_iterator args_iter
;
12433 tree n
= NULL_TREE
, t
;
12438 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12443 return n
!= NULL_TREE
&& n
!= void_type_node
;
12446 /* Return true if TYPE has a prototype. */
12449 prototype_p (const_tree fntype
)
12453 gcc_assert (fntype
!= NULL_TREE
);
12455 t
= TYPE_ARG_TYPES (fntype
);
12456 return (t
!= NULL_TREE
);
12459 /* If BLOCK is inlined from an __attribute__((__artificial__))
12460 routine, return pointer to location from where it has been
12463 block_nonartificial_location (tree block
)
12465 location_t
*ret
= NULL
;
12467 while (block
&& TREE_CODE (block
) == BLOCK
12468 && BLOCK_ABSTRACT_ORIGIN (block
))
12470 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12471 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12473 /* If AO is an artificial inline, point RET to the
12474 call site locus at which it has been inlined and continue
12475 the loop, in case AO's caller is also an artificial
12477 if (DECL_DECLARED_INLINE_P (ao
)
12478 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12479 ret
= &BLOCK_SOURCE_LOCATION (block
);
12483 else if (TREE_CODE (ao
) != BLOCK
)
12486 block
= BLOCK_SUPERCONTEXT (block
);
12492 /* If EXP is inlined from an __attribute__((__artificial__))
12493 function, return the location of the original call expression. */
12496 tree_nonartificial_location (tree exp
)
12498 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12503 return EXPR_LOCATION (exp
);
12507 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12510 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12513 cl_option_hasher::hash (tree x
)
12515 const_tree
const t
= x
;
12519 hashval_t hash
= 0;
12521 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12523 p
= (const char *)TREE_OPTIMIZATION (t
);
12524 len
= sizeof (struct cl_optimization
);
12527 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12528 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12531 gcc_unreachable ();
12533 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12535 for (i
= 0; i
< len
; i
++)
12537 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12542 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12543 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12547 cl_option_hasher::equal (tree x
, tree y
)
12549 const_tree
const xt
= x
;
12550 const_tree
const yt
= y
;
12552 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12555 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12556 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12557 TREE_OPTIMIZATION (yt
));
12558 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12559 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12560 TREE_TARGET_OPTION (yt
));
12562 gcc_unreachable ();
12565 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12568 build_optimization_node (struct gcc_options
*opts
)
12572 /* Use the cache of optimization nodes. */
12574 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12577 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12581 /* Insert this one into the hash table. */
12582 t
= cl_optimization_node
;
12585 /* Make a new node for next time round. */
12586 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12592 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12595 build_target_option_node (struct gcc_options
*opts
)
12599 /* Use the cache of optimization nodes. */
12601 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12604 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12608 /* Insert this one into the hash table. */
12609 t
= cl_target_option_node
;
12612 /* Make a new node for next time round. */
12613 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12619 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12620 so that they aren't saved during PCH writing. */
12623 prepare_target_option_nodes_for_pch (void)
12625 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12626 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12627 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12628 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12631 /* Determine the "ultimate origin" of a block. */
12634 block_ultimate_origin (const_tree block
)
12636 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12638 if (origin
== NULL_TREE
)
12642 gcc_checking_assert ((DECL_P (origin
)
12643 && DECL_ORIGIN (origin
) == origin
)
12644 || BLOCK_ORIGIN (origin
) == origin
);
12649 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12653 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12655 /* Do not strip casts into or out of differing address spaces. */
12656 if (POINTER_TYPE_P (outer_type
)
12657 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12659 if (!POINTER_TYPE_P (inner_type
)
12660 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12661 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12664 else if (POINTER_TYPE_P (inner_type
)
12665 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12667 /* We already know that outer_type is not a pointer with
12668 a non-generic address space. */
12672 /* Use precision rather then machine mode when we can, which gives
12673 the correct answer even for submode (bit-field) types. */
12674 if ((INTEGRAL_TYPE_P (outer_type
)
12675 || POINTER_TYPE_P (outer_type
)
12676 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12677 && (INTEGRAL_TYPE_P (inner_type
)
12678 || POINTER_TYPE_P (inner_type
)
12679 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12680 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12682 /* Otherwise fall back on comparing machine modes (e.g. for
12683 aggregate types, floats). */
12684 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12687 /* Return true iff conversion in EXP generates no instruction. Mark
12688 it inline so that we fully inline into the stripping functions even
12689 though we have two uses of this function. */
12692 tree_nop_conversion (const_tree exp
)
12694 tree outer_type
, inner_type
;
12696 if (location_wrapper_p (exp
))
12698 if (!CONVERT_EXPR_P (exp
)
12699 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12702 outer_type
= TREE_TYPE (exp
);
12703 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12704 if (!inner_type
|| inner_type
== error_mark_node
)
12707 return tree_nop_conversion_p (outer_type
, inner_type
);
12710 /* Return true iff conversion in EXP generates no instruction. Don't
12711 consider conversions changing the signedness. */
12714 tree_sign_nop_conversion (const_tree exp
)
12716 tree outer_type
, inner_type
;
12718 if (!tree_nop_conversion (exp
))
12721 outer_type
= TREE_TYPE (exp
);
12722 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12724 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12725 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12728 /* Strip conversions from EXP according to tree_nop_conversion and
12729 return the resulting expression. */
12732 tree_strip_nop_conversions (tree exp
)
12734 while (tree_nop_conversion (exp
))
12735 exp
= TREE_OPERAND (exp
, 0);
12739 /* Strip conversions from EXP according to tree_sign_nop_conversion
12740 and return the resulting expression. */
12743 tree_strip_sign_nop_conversions (tree exp
)
12745 while (tree_sign_nop_conversion (exp
))
12746 exp
= TREE_OPERAND (exp
, 0);
12750 /* Avoid any floating point extensions from EXP. */
12752 strip_float_extensions (tree exp
)
12754 tree sub
, expt
, subt
;
12756 /* For floating point constant look up the narrowest type that can hold
12757 it properly and handle it like (type)(narrowest_type)constant.
12758 This way we can optimize for instance a=a*2.0 where "a" is float
12759 but 2.0 is double constant. */
12760 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12762 REAL_VALUE_TYPE orig
;
12765 orig
= TREE_REAL_CST (exp
);
12766 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12767 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12768 type
= float_type_node
;
12769 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12770 > TYPE_PRECISION (double_type_node
)
12771 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12772 type
= double_type_node
;
12774 return build_real_truncate (type
, orig
);
12777 if (!CONVERT_EXPR_P (exp
))
12780 sub
= TREE_OPERAND (exp
, 0);
12781 subt
= TREE_TYPE (sub
);
12782 expt
= TREE_TYPE (exp
);
12784 if (!FLOAT_TYPE_P (subt
))
12787 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12790 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12793 return strip_float_extensions (sub
);
12796 /* Strip out all handled components that produce invariant
12800 strip_invariant_refs (const_tree op
)
12802 while (handled_component_p (op
))
12804 switch (TREE_CODE (op
))
12807 case ARRAY_RANGE_REF
:
12808 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12809 || TREE_OPERAND (op
, 2) != NULL_TREE
12810 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12814 case COMPONENT_REF
:
12815 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12821 op
= TREE_OPERAND (op
, 0);
12827 static GTY(()) tree gcc_eh_personality_decl
;
12829 /* Return the GCC personality function decl. */
12832 lhd_gcc_personality (void)
12834 if (!gcc_eh_personality_decl
)
12835 gcc_eh_personality_decl
= build_personality_function ("gcc");
12836 return gcc_eh_personality_decl
;
12839 /* TARGET is a call target of GIMPLE call statement
12840 (obtained by gimple_call_fn). Return true if it is
12841 OBJ_TYPE_REF representing an virtual call of C++ method.
12842 (As opposed to OBJ_TYPE_REF representing objc calls
12843 through a cast where middle-end devirtualization machinery
12844 can't apply.) FOR_DUMP_P is true when being called from
12845 the dump routines. */
12848 virtual_method_call_p (const_tree target
, bool for_dump_p
)
12850 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12852 tree t
= TREE_TYPE (target
);
12853 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12855 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12857 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12858 /* If we do not have BINFO associated, it means that type was built
12859 without devirtualization enabled. Do not consider this a virtual
12861 if (!TYPE_BINFO (obj_type_ref_class (target
, for_dump_p
)))
12866 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12869 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12872 tree base_binfo
, b
;
12874 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12875 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12876 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12878 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12883 /* Try to find a base info of BINFO that would have its field decl at offset
12884 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12885 found, return, otherwise return NULL_TREE. */
12888 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12890 tree type
= BINFO_TYPE (binfo
);
12894 HOST_WIDE_INT pos
, size
;
12898 if (types_same_for_odr (type
, expected_type
))
12900 if (maybe_lt (offset
, 0))
12903 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12905 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12908 pos
= int_bit_position (fld
);
12909 size
= tree_to_uhwi (DECL_SIZE (fld
));
12910 if (known_in_range_p (offset
, pos
, size
))
12913 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12916 /* Offset 0 indicates the primary base, whose vtable contents are
12917 represented in the binfo for the derived class. */
12918 else if (maybe_ne (offset
, 0))
12920 tree found_binfo
= NULL
, base_binfo
;
12921 /* Offsets in BINFO are in bytes relative to the whole structure
12922 while POS is in bits relative to the containing field. */
12923 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12926 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12927 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12928 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12930 found_binfo
= base_binfo
;
12934 binfo
= found_binfo
;
12936 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12940 type
= TREE_TYPE (fld
);
12945 /* Returns true if X is a typedef decl. */
12948 is_typedef_decl (const_tree x
)
12950 return (x
&& TREE_CODE (x
) == TYPE_DECL
12951 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12954 /* Returns true iff TYPE is a type variant created for a typedef. */
12957 typedef_variant_p (const_tree type
)
12959 return is_typedef_decl (TYPE_NAME (type
));
12962 /* PR 84195: Replace control characters in "unescaped" with their
12963 escaped equivalents. Allow newlines if -fmessage-length has
12964 been set to a non-zero value. This is done here, rather than
12965 where the attribute is recorded as the message length can
12966 change between these two locations. */
12969 escaped_string::escape (const char *unescaped
)
12972 size_t i
, new_i
, len
;
12977 m_str
= const_cast<char *> (unescaped
);
12980 if (unescaped
== NULL
|| *unescaped
== 0)
12983 len
= strlen (unescaped
);
12987 for (i
= 0; i
< len
; i
++)
12989 char c
= unescaped
[i
];
12994 escaped
[new_i
++] = c
;
12998 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13000 if (escaped
== NULL
)
13002 /* We only allocate space for a new string if we
13003 actually encounter a control character that
13004 needs replacing. */
13005 escaped
= (char *) xmalloc (len
* 2 + 1);
13006 strncpy (escaped
, unescaped
, i
);
13010 escaped
[new_i
++] = '\\';
13014 case '\a': escaped
[new_i
++] = 'a'; break;
13015 case '\b': escaped
[new_i
++] = 'b'; break;
13016 case '\f': escaped
[new_i
++] = 'f'; break;
13017 case '\n': escaped
[new_i
++] = 'n'; break;
13018 case '\r': escaped
[new_i
++] = 'r'; break;
13019 case '\t': escaped
[new_i
++] = 't'; break;
13020 case '\v': escaped
[new_i
++] = 'v'; break;
13021 default: escaped
[new_i
++] = '?'; break;
13025 escaped
[new_i
++] = c
;
13030 escaped
[new_i
] = 0;
13036 /* Warn about a use of an identifier which was marked deprecated. Returns
13037 whether a warning was given. */
13040 warn_deprecated_use (tree node
, tree attr
)
13042 escaped_string msg
;
13044 if (node
== 0 || !warn_deprecated_decl
)
13050 attr
= DECL_ATTRIBUTES (node
);
13051 else if (TYPE_P (node
))
13053 tree decl
= TYPE_STUB_DECL (node
);
13055 attr
= lookup_attribute ("deprecated",
13056 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13061 attr
= lookup_attribute ("deprecated", attr
);
13064 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13069 auto_diagnostic_group d
;
13071 w
= warning (OPT_Wdeprecated_declarations
,
13072 "%qD is deprecated: %s", node
, (const char *) msg
);
13074 w
= warning (OPT_Wdeprecated_declarations
,
13075 "%qD is deprecated", node
);
13077 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13079 else if (TYPE_P (node
))
13081 tree what
= NULL_TREE
;
13082 tree decl
= TYPE_STUB_DECL (node
);
13084 if (TYPE_NAME (node
))
13086 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13087 what
= TYPE_NAME (node
);
13088 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13089 && DECL_NAME (TYPE_NAME (node
)))
13090 what
= DECL_NAME (TYPE_NAME (node
));
13093 auto_diagnostic_group d
;
13097 w
= warning (OPT_Wdeprecated_declarations
,
13098 "%qE is deprecated: %s", what
, (const char *) msg
);
13100 w
= warning (OPT_Wdeprecated_declarations
,
13101 "%qE is deprecated", what
);
13106 w
= warning (OPT_Wdeprecated_declarations
,
13107 "type is deprecated: %s", (const char *) msg
);
13109 w
= warning (OPT_Wdeprecated_declarations
,
13110 "type is deprecated");
13114 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13120 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13121 somewhere in it. */
13124 contains_bitfld_component_ref_p (const_tree ref
)
13126 while (handled_component_p (ref
))
13128 if (TREE_CODE (ref
) == COMPONENT_REF
13129 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13131 ref
= TREE_OPERAND (ref
, 0);
13137 /* Try to determine whether a TRY_CATCH expression can fall through.
13138 This is a subroutine of block_may_fallthru. */
13141 try_catch_may_fallthru (const_tree stmt
)
13143 tree_stmt_iterator i
;
13145 /* If the TRY block can fall through, the whole TRY_CATCH can
13147 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13150 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13151 switch (TREE_CODE (tsi_stmt (i
)))
13154 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13155 catch expression and a body. The whole TRY_CATCH may fall
13156 through iff any of the catch bodies falls through. */
13157 for (; !tsi_end_p (i
); tsi_next (&i
))
13159 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13164 case EH_FILTER_EXPR
:
13165 /* The exception filter expression only matters if there is an
13166 exception. If the exception does not match EH_FILTER_TYPES,
13167 we will execute EH_FILTER_FAILURE, and we will fall through
13168 if that falls through. If the exception does match
13169 EH_FILTER_TYPES, the stack unwinder will continue up the
13170 stack, so we will not fall through. We don't know whether we
13171 will throw an exception which matches EH_FILTER_TYPES or not,
13172 so we just ignore EH_FILTER_TYPES and assume that we might
13173 throw an exception which doesn't match. */
13174 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13177 /* This case represents statements to be executed when an
13178 exception occurs. Those statements are implicitly followed
13179 by a RESX statement to resume execution after the exception.
13180 So in this case the TRY_CATCH never falls through. */
13185 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13186 need not be 100% accurate; simply be conservative and return true if we
13187 don't know. This is used only to avoid stupidly generating extra code.
13188 If we're wrong, we'll just delete the extra code later. */
13191 block_may_fallthru (const_tree block
)
13193 /* This CONST_CAST is okay because expr_last returns its argument
13194 unmodified and we assign it to a const_tree. */
13195 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13197 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13201 /* Easy cases. If the last statement of the block implies
13202 control transfer, then we can't fall through. */
13206 /* If there is a default: label or case labels cover all possible
13207 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13208 to some case label in all cases and all we care is whether the
13209 SWITCH_BODY falls through. */
13210 if (SWITCH_ALL_CASES_P (stmt
))
13211 return block_may_fallthru (SWITCH_BODY (stmt
));
13215 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13217 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13220 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13222 case TRY_CATCH_EXPR
:
13223 return try_catch_may_fallthru (stmt
);
13225 case TRY_FINALLY_EXPR
:
13226 /* The finally clause is always executed after the try clause,
13227 so if it does not fall through, then the try-finally will not
13228 fall through. Otherwise, if the try clause does not fall
13229 through, then when the finally clause falls through it will
13230 resume execution wherever the try clause was going. So the
13231 whole try-finally will only fall through if both the try
13232 clause and the finally clause fall through. */
13233 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13234 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13237 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13240 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13241 stmt
= TREE_OPERAND (stmt
, 1);
13247 /* Functions that do not return do not fall through. */
13248 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13250 case CLEANUP_POINT_EXPR
:
13251 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13254 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13260 return lang_hooks
.block_may_fallthru (stmt
);
13264 /* True if we are using EH to handle cleanups. */
13265 static bool using_eh_for_cleanups_flag
= false;
13267 /* This routine is called from front ends to indicate eh should be used for
13270 using_eh_for_cleanups (void)
13272 using_eh_for_cleanups_flag
= true;
13275 /* Query whether EH is used for cleanups. */
13277 using_eh_for_cleanups_p (void)
13279 return using_eh_for_cleanups_flag
;
13282 /* Wrapper for tree_code_name to ensure that tree code is valid */
13284 get_tree_code_name (enum tree_code code
)
13286 const char *invalid
= "<invalid tree code>";
13288 /* The tree_code enum promotes to signed, but we could be getting
13289 invalid values, so force an unsigned comparison. */
13290 if (unsigned (code
) >= MAX_TREE_CODES
)
13292 if (code
== 0xa5a5)
13293 return "ggc_freed";
13297 return tree_code_name
[code
];
13300 /* Drops the TREE_OVERFLOW flag from T. */
13303 drop_tree_overflow (tree t
)
13305 gcc_checking_assert (TREE_OVERFLOW (t
));
13307 /* For tree codes with a sharing machinery re-build the result. */
13308 if (poly_int_tree_p (t
))
13309 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13311 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13312 and canonicalize the result. */
13313 if (TREE_CODE (t
) == VECTOR_CST
)
13315 tree_vector_builder builder
;
13316 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13317 unsigned int count
= builder
.encoded_nelts ();
13318 for (unsigned int i
= 0; i
< count
; ++i
)
13320 tree elt
= VECTOR_CST_ELT (t
, i
);
13321 if (TREE_OVERFLOW (elt
))
13322 elt
= drop_tree_overflow (elt
);
13323 builder
.quick_push (elt
);
13325 return builder
.build ();
13328 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13329 and drop the flag. */
13331 TREE_OVERFLOW (t
) = 0;
13333 /* For constants that contain nested constants, drop the flag
13334 from those as well. */
13335 if (TREE_CODE (t
) == COMPLEX_CST
)
13337 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13338 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13339 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13340 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13346 /* Given a memory reference expression T, return its base address.
13347 The base address of a memory reference expression is the main
13348 object being referenced. For instance, the base address for
13349 'array[i].fld[j]' is 'array'. You can think of this as stripping
13350 away the offset part from a memory address.
13352 This function calls handled_component_p to strip away all the inner
13353 parts of the memory reference until it reaches the base object. */
13356 get_base_address (tree t
)
13358 while (handled_component_p (t
))
13359 t
= TREE_OPERAND (t
, 0);
13361 if ((TREE_CODE (t
) == MEM_REF
13362 || TREE_CODE (t
) == TARGET_MEM_REF
)
13363 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13364 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13366 /* ??? Either the alias oracle or all callers need to properly deal
13367 with WITH_SIZE_EXPRs before we can look through those. */
13368 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13374 /* Return a tree of sizetype representing the size, in bytes, of the element
13375 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13378 array_ref_element_size (tree exp
)
13380 tree aligned_size
= TREE_OPERAND (exp
, 3);
13381 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13382 location_t loc
= EXPR_LOCATION (exp
);
13384 /* If a size was specified in the ARRAY_REF, it's the size measured
13385 in alignment units of the element type. So multiply by that value. */
13388 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13389 sizetype from another type of the same width and signedness. */
13390 if (TREE_TYPE (aligned_size
) != sizetype
)
13391 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13392 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13393 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13396 /* Otherwise, take the size from that of the element type. Substitute
13397 any PLACEHOLDER_EXPR that we have. */
13399 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13402 /* Return a tree representing the lower bound of the array mentioned in
13403 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13406 array_ref_low_bound (tree exp
)
13408 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13410 /* If a lower bound is specified in EXP, use it. */
13411 if (TREE_OPERAND (exp
, 2))
13412 return TREE_OPERAND (exp
, 2);
13414 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13415 substituting for a PLACEHOLDER_EXPR as needed. */
13416 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13417 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13419 /* Otherwise, return a zero of the appropriate type. */
13420 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
13421 return (idxtype
== error_mark_node
13422 ? integer_zero_node
: build_int_cst (idxtype
, 0));
13425 /* Return a tree representing the upper bound of the array mentioned in
13426 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13429 array_ref_up_bound (tree exp
)
13431 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13433 /* If there is a domain type and it has an upper bound, use it, substituting
13434 for a PLACEHOLDER_EXPR as needed. */
13435 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13436 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13438 /* Otherwise fail. */
13442 /* Returns true if REF is an array reference, component reference,
13443 or memory reference to an array at the end of a structure.
13444 If this is the case, the array may be allocated larger
13445 than its upper bound implies. */
13448 array_at_struct_end_p (tree ref
)
13452 if (TREE_CODE (ref
) == ARRAY_REF
13453 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13455 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13456 ref
= TREE_OPERAND (ref
, 0);
13458 else if (TREE_CODE (ref
) == COMPONENT_REF
13459 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13460 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13461 else if (TREE_CODE (ref
) == MEM_REF
)
13463 tree arg
= TREE_OPERAND (ref
, 0);
13464 if (TREE_CODE (arg
) == ADDR_EXPR
)
13465 arg
= TREE_OPERAND (arg
, 0);
13466 tree argtype
= TREE_TYPE (arg
);
13467 if (TREE_CODE (argtype
) == RECORD_TYPE
)
13469 if (tree fld
= last_field (argtype
))
13471 atype
= TREE_TYPE (fld
);
13472 if (TREE_CODE (atype
) != ARRAY_TYPE
)
13474 if (VAR_P (arg
) && DECL_SIZE (fld
))
13486 if (TREE_CODE (ref
) == STRING_CST
)
13489 tree ref_to_array
= ref
;
13490 while (handled_component_p (ref
))
13492 /* If the reference chain contains a component reference to a
13493 non-union type and there follows another field the reference
13494 is not at the end of a structure. */
13495 if (TREE_CODE (ref
) == COMPONENT_REF
)
13497 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13499 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13500 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13501 nextf
= DECL_CHAIN (nextf
);
13506 /* If we have a multi-dimensional array we do not consider
13507 a non-innermost dimension as flex array if the whole
13508 multi-dimensional array is at struct end.
13509 Same for an array of aggregates with a trailing array
13511 else if (TREE_CODE (ref
) == ARRAY_REF
)
13513 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13515 /* If we view an underlying object as sth else then what we
13516 gathered up to now is what we have to rely on. */
13517 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13520 gcc_unreachable ();
13522 ref
= TREE_OPERAND (ref
, 0);
13525 /* The array now is at struct end. Treat flexible arrays as
13526 always subject to extend, even into just padding constrained by
13527 an underlying decl. */
13528 if (! TYPE_SIZE (atype
)
13529 || ! TYPE_DOMAIN (atype
)
13530 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13533 if (TREE_CODE (ref
) == MEM_REF
13534 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13535 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13537 /* If the reference is based on a declared entity, the size of the array
13538 is constrained by its given domain. (Do not trust commons PR/69368). */
13540 && !(flag_unconstrained_commons
13541 && VAR_P (ref
) && DECL_COMMON (ref
))
13542 && DECL_SIZE_UNIT (ref
)
13543 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13545 /* Check whether the array domain covers all of the available
13548 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13549 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13550 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13552 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13555 /* If at least one extra element fits it is a flexarray. */
13556 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13557 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13559 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13560 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13569 /* Return a tree representing the offset, in bytes, of the field referenced
13570 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13573 component_ref_field_offset (tree exp
)
13575 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13576 tree field
= TREE_OPERAND (exp
, 1);
13577 location_t loc
= EXPR_LOCATION (exp
);
13579 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13580 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13582 if (aligned_offset
)
13584 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13585 sizetype from another type of the same width and signedness. */
13586 if (TREE_TYPE (aligned_offset
) != sizetype
)
13587 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13588 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13589 size_int (DECL_OFFSET_ALIGN (field
)
13593 /* Otherwise, take the offset from that of the field. Substitute
13594 any PLACEHOLDER_EXPR that we have. */
13596 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13599 /* Given the initializer INIT, return the initializer for the field
13600 DECL if it exists, otherwise null. Used to obtain the initializer
13601 for a flexible array member and determine its size. */
13604 get_initializer_for (tree init
, tree decl
)
13608 tree fld
, fld_init
;
13609 unsigned HOST_WIDE_INT i
;
13610 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13615 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13617 fld_init
= get_initializer_for (fld_init
, decl
);
13626 /* Determines the size of the member referenced by the COMPONENT_REF
13627 REF, using its initializer expression if necessary in order to
13628 determine the size of an initialized flexible array member.
13629 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13630 an interior zero-length array.
13631 Returns the size as sizetype (which might be zero for an object
13632 with an uninitialized flexible array member) or null if the size
13633 cannot be determined. */
13636 component_ref_size (tree ref
, bool *interior_zero_length
/* = NULL */)
13638 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13640 bool int_0_len
= false;
13641 if (!interior_zero_length
)
13642 interior_zero_length
= &int_0_len
;
13644 /* The object/argument referenced by the COMPONENT_REF and its type. */
13645 tree arg
= TREE_OPERAND (ref
, 0);
13646 tree argtype
= TREE_TYPE (arg
);
13647 /* The referenced member. */
13648 tree member
= TREE_OPERAND (ref
, 1);
13650 tree memsize
= DECL_SIZE_UNIT (member
);
13653 tree memtype
= TREE_TYPE (member
);
13654 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13657 bool trailing
= array_at_struct_end_p (ref
);
13658 bool zero_length
= integer_zerop (memsize
);
13659 if (!trailing
&& !zero_length
)
13660 /* MEMBER is either an interior array or is an array with
13661 more than one element. */
13664 *interior_zero_length
= zero_length
&& !trailing
;
13665 if (*interior_zero_length
)
13666 memsize
= NULL_TREE
;
13669 if (tree dom
= TYPE_DOMAIN (memtype
))
13670 if (tree min
= TYPE_MIN_VALUE (dom
))
13671 if (tree max
= TYPE_MAX_VALUE (dom
))
13672 if (TREE_CODE (min
) == INTEGER_CST
13673 && TREE_CODE (max
) == INTEGER_CST
)
13675 offset_int minidx
= wi::to_offset (min
);
13676 offset_int maxidx
= wi::to_offset (max
);
13677 if (maxidx
- minidx
> 0)
13678 /* MEMBER is an array with more than one element. */
13682 /* For a refernce to a zero- or one-element array member of a union
13683 use the size of the union instead of the size of the member. */
13684 if (TREE_CODE (argtype
) == UNION_TYPE
)
13685 memsize
= TYPE_SIZE_UNIT (argtype
);
13688 /* MEMBER is either a bona fide flexible array member, or a zero-length
13689 array member, or an array of length one treated as such. */
13691 /* If the reference is to a declared object and the member a true
13692 flexible array, try to determine its size from its initializer. */
13693 poly_int64 baseoff
= 0;
13694 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13695 if (!base
|| !VAR_P (base
))
13697 if (!*interior_zero_length
)
13700 if (TREE_CODE (arg
) != COMPONENT_REF
)
13704 while (TREE_CODE (base
) == COMPONENT_REF
)
13705 base
= TREE_OPERAND (base
, 0);
13706 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13709 /* BASE is the declared object of which MEMBER is either a member
13710 or that is cast to ARGTYPE (e.g., a char buffer used to store
13711 an ARGTYPE object). */
13712 tree basetype
= TREE_TYPE (base
);
13714 /* Determine the base type of the referenced object. If it's
13715 the same as ARGTYPE and MEMBER has a known size, return it. */
13716 tree bt
= basetype
;
13717 if (!*interior_zero_length
)
13718 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13719 bt
= TREE_TYPE (bt
);
13720 bool typematch
= useless_type_conversion_p (argtype
, bt
);
13721 if (memsize
&& typematch
)
13724 memsize
= NULL_TREE
;
13727 /* MEMBER is a true flexible array member. Compute its size from
13728 the initializer of the BASE object if it has one. */
13729 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13730 if (init
!= error_mark_node
)
13732 init
= get_initializer_for (init
, member
);
13735 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13736 if (tree refsize
= TYPE_SIZE_UNIT (argtype
))
13738 /* Use the larger of the initializer size and the tail
13739 padding in the enclosing struct. */
13740 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13742 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13743 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13755 && DECL_EXTERNAL (base
)
13757 && !*interior_zero_length
)
13758 /* The size of a flexible array member of an extern struct
13759 with no initializer cannot be determined (it's defined
13760 in another translation unit and can have an initializer
13761 with an arbitrary number of elements). */
13764 /* Use the size of the base struct or, for interior zero-length
13765 arrays, the size of the enclosing type. */
13766 memsize
= TYPE_SIZE_UNIT (bt
);
13768 else if (DECL_P (base
))
13769 /* Use the size of the BASE object (possibly an array of some
13770 other type such as char used to store the struct). */
13771 memsize
= DECL_SIZE_UNIT (base
);
13776 /* If the flexible array member has a known size use the greater
13777 of it and the tail padding in the enclosing struct.
13778 Otherwise, when the size of the flexible array member is unknown
13779 and the referenced object is not a struct, use the size of its
13780 type when known. This detects sizes of array buffers when cast
13781 to struct types with flexible array members. */
13784 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13785 if (known_lt (baseoff
, memsz64
))
13787 memsz64
-= baseoff
;
13788 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13790 return size_zero_node
;
13793 /* Return "don't know" for an external non-array object since its
13794 flexible array member can be initialized to have any number of
13795 elements. Otherwise, return zero because the flexible array
13796 member has no elements. */
13797 return (DECL_P (base
)
13798 && DECL_EXTERNAL (base
)
13800 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13801 ? NULL_TREE
: size_zero_node
);
13804 /* Return the machine mode of T. For vectors, returns the mode of the
13805 inner type. The main use case is to feed the result to HONOR_NANS,
13806 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13809 element_mode (const_tree t
)
13813 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13815 return TYPE_MODE (t
);
13818 /* Vector types need to re-check the target flags each time we report
13819 the machine mode. We need to do this because attribute target can
13820 change the result of vector_mode_supported_p and have_regs_of_mode
13821 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13822 change on a per-function basis. */
13823 /* ??? Possibly a better solution is to run through all the types
13824 referenced by a function and re-compute the TYPE_MODE once, rather
13825 than make the TYPE_MODE macro call a function. */
13828 vector_type_mode (const_tree t
)
13832 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13834 mode
= t
->type_common
.mode
;
13835 if (VECTOR_MODE_P (mode
)
13836 && (!targetm
.vector_mode_supported_p (mode
)
13837 || !have_regs_of_mode
[mode
]))
13839 scalar_int_mode innermode
;
13841 /* For integers, try mapping it to a same-sized scalar mode. */
13842 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13844 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13845 * GET_MODE_BITSIZE (innermode
));
13846 scalar_int_mode mode
;
13847 if (int_mode_for_size (size
, 0).exists (&mode
)
13848 && have_regs_of_mode
[mode
])
13858 /* Return the size in bits of each element of vector type TYPE. */
13861 vector_element_bits (const_tree type
)
13863 gcc_checking_assert (VECTOR_TYPE_P (type
));
13864 if (VECTOR_BOOLEAN_TYPE_P (type
))
13865 return vector_element_size (tree_to_poly_uint64 (TYPE_SIZE (type
)),
13866 TYPE_VECTOR_SUBPARTS (type
));
13867 return tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type
)));
13870 /* Calculate the size in bits of each element of vector type TYPE
13871 and return the result as a tree of type bitsizetype. */
13874 vector_element_bits_tree (const_tree type
)
13876 gcc_checking_assert (VECTOR_TYPE_P (type
));
13877 if (VECTOR_BOOLEAN_TYPE_P (type
))
13878 return bitsize_int (vector_element_bits (type
));
13879 return TYPE_SIZE (TREE_TYPE (type
));
13882 /* Verify that basic properties of T match TV and thus T can be a variant of
13883 TV. TV should be the more specified variant (i.e. the main variant). */
13886 verify_type_variant (const_tree t
, tree tv
)
13888 /* Type variant can differ by:
13890 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13891 ENCODE_QUAL_ADDR_SPACE.
13892 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13893 in this case some values may not be set in the variant types
13894 (see TYPE_COMPLETE_P checks).
13895 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13896 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13897 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13898 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13899 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13900 this is necessary to make it possible to merge types form different TUs
13901 - arrays, pointers and references may have TREE_TYPE that is a variant
13902 of TREE_TYPE of their main variants.
13903 - aggregates may have new TYPE_FIELDS list that list variants of
13904 the main variant TYPE_FIELDS.
13905 - vector types may differ by TYPE_VECTOR_OPAQUE
13908 /* Convenience macro for matching individual fields. */
13909 #define verify_variant_match(flag) \
13911 if (flag (tv) != flag (t)) \
13913 error ("type variant differs by %s", #flag); \
13919 /* tree_base checks. */
13921 verify_variant_match (TREE_CODE
);
13922 /* FIXME: Ada builds non-artificial variants of artificial types. */
13923 if (TYPE_ARTIFICIAL (tv
) && 0)
13924 verify_variant_match (TYPE_ARTIFICIAL
);
13925 if (POINTER_TYPE_P (tv
))
13926 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13927 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13928 verify_variant_match (TYPE_UNSIGNED
);
13929 verify_variant_match (TYPE_PACKED
);
13930 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13931 verify_variant_match (TYPE_REF_IS_RVALUE
);
13932 if (AGGREGATE_TYPE_P (t
))
13933 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13935 verify_variant_match (TYPE_SATURATING
);
13936 /* FIXME: This check trigger during libstdc++ build. */
13937 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13938 verify_variant_match (TYPE_FINAL_P
);
13940 /* tree_type_common checks. */
13942 if (COMPLETE_TYPE_P (t
))
13944 verify_variant_match (TYPE_MODE
);
13945 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13946 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13947 verify_variant_match (TYPE_SIZE
);
13948 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13949 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13950 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13952 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13953 TYPE_SIZE_UNIT (tv
), 0));
13954 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13956 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13957 debug_tree (TYPE_SIZE_UNIT (tv
));
13958 error ("type%'s %<TYPE_SIZE_UNIT%>");
13959 debug_tree (TYPE_SIZE_UNIT (t
));
13962 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13964 verify_variant_match (TYPE_PRECISION
);
13965 if (RECORD_OR_UNION_TYPE_P (t
))
13966 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13967 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13968 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13969 /* During LTO we merge variant lists from diferent translation units
13970 that may differ BY TYPE_CONTEXT that in turn may point
13971 to TRANSLATION_UNIT_DECL.
13972 Ada also builds variants of types with different TYPE_CONTEXT. */
13973 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13974 verify_variant_match (TYPE_CONTEXT
);
13975 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13976 verify_variant_match (TYPE_STRING_FLAG
);
13977 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13978 verify_variant_match (TYPE_CXX_ODR_P
);
13979 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13981 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13986 /* tree_type_non_common checks. */
13988 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13989 and dangle the pointer from time to time. */
13990 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13991 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13992 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13994 error ("type variant has different %<TYPE_VFIELD%>");
13998 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13999 || TREE_CODE (t
) == INTEGER_TYPE
14000 || TREE_CODE (t
) == BOOLEAN_TYPE
14001 || TREE_CODE (t
) == REAL_TYPE
14002 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14004 verify_variant_match (TYPE_MAX_VALUE
);
14005 verify_variant_match (TYPE_MIN_VALUE
);
14007 if (TREE_CODE (t
) == METHOD_TYPE
)
14008 verify_variant_match (TYPE_METHOD_BASETYPE
);
14009 if (TREE_CODE (t
) == OFFSET_TYPE
)
14010 verify_variant_match (TYPE_OFFSET_BASETYPE
);
14011 if (TREE_CODE (t
) == ARRAY_TYPE
)
14012 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
14013 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14014 or even type's main variant. This is needed to make bootstrap pass
14015 and the bug seems new in GCC 5.
14016 C++ FE should be updated to make this consistent and we should check
14017 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14018 is a match with main variant.
14020 Also disable the check for Java for now because of parser hack that builds
14021 first an dummy BINFO and then sometimes replace it by real BINFO in some
14023 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
14024 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
14025 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14026 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14027 at LTO time only. */
14028 && (in_lto_p
&& odr_type_p (t
)))
14030 error ("type variant has different %<TYPE_BINFO%>");
14032 error ("type variant%'s %<TYPE_BINFO%>");
14033 debug_tree (TYPE_BINFO (tv
));
14034 error ("type%'s %<TYPE_BINFO%>");
14035 debug_tree (TYPE_BINFO (t
));
14039 /* Check various uses of TYPE_VALUES_RAW. */
14040 if (TREE_CODE (t
) == ENUMERAL_TYPE
14041 && TYPE_VALUES (t
))
14042 verify_variant_match (TYPE_VALUES
);
14043 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14044 verify_variant_match (TYPE_DOMAIN
);
14045 /* Permit incomplete variants of complete type. While FEs may complete
14046 all variants, this does not happen for C++ templates in all cases. */
14047 else if (RECORD_OR_UNION_TYPE_P (t
)
14048 && COMPLETE_TYPE_P (t
)
14049 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
14053 /* Fortran builds qualified variants as new records with items of
14054 qualified type. Verify that they looks same. */
14055 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
14057 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14058 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
14059 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
14060 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
14061 /* FIXME: gfc_nonrestricted_type builds all types as variants
14062 with exception of pointer types. It deeply copies the type
14063 which means that we may end up with a variant type
14064 referring non-variant pointer. We may change it to
14065 produce types as variants, too, like
14066 objc_get_protocol_qualified_type does. */
14067 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
14068 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
14069 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14073 error ("type variant has different %<TYPE_FIELDS%>");
14075 error ("first mismatch is field");
14077 error ("and field");
14082 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14083 verify_variant_match (TYPE_ARG_TYPES
);
14084 /* For C++ the qualified variant of array type is really an array type
14085 of qualified TREE_TYPE.
14086 objc builds variants of pointer where pointer to type is a variant, too
14087 in objc_get_protocol_qualified_type. */
14088 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14089 && ((TREE_CODE (t
) != ARRAY_TYPE
14090 && !POINTER_TYPE_P (t
))
14091 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14092 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14094 error ("type variant has different %<TREE_TYPE%>");
14096 error ("type variant%'s %<TREE_TYPE%>");
14097 debug_tree (TREE_TYPE (tv
));
14098 error ("type%'s %<TREE_TYPE%>");
14099 debug_tree (TREE_TYPE (t
));
14102 if (type_with_alias_set_p (t
)
14103 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14105 error ("type is not compatible with its variant");
14107 error ("type variant%'s %<TREE_TYPE%>");
14108 debug_tree (TREE_TYPE (tv
));
14109 error ("type%'s %<TREE_TYPE%>");
14110 debug_tree (TREE_TYPE (t
));
14114 #undef verify_variant_match
14118 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14119 the middle-end types_compatible_p function. It needs to avoid
14120 claiming types are different for types that should be treated
14121 the same with respect to TBAA. Canonical types are also used
14122 for IL consistency checks via the useless_type_conversion_p
14123 predicate which does not handle all type kinds itself but falls
14124 back to pointer-comparison of TYPE_CANONICAL for aggregates
14127 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14128 type calculation because we need to allow inter-operability between signed
14129 and unsigned variants. */
14132 type_with_interoperable_signedness (const_tree type
)
14134 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14135 signed char and unsigned char. Similarly fortran FE builds
14136 C_SIZE_T as signed type, while C defines it unsigned. */
14138 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14140 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14141 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14144 /* Return true iff T1 and T2 are structurally identical for what
14146 This function is used both by lto.c canonical type merging and by the
14147 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14148 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14149 only for LTO because only in these cases TYPE_CANONICAL equivalence
14150 correspond to one defined by gimple_canonical_types_compatible_p. */
14153 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14154 bool trust_type_canonical
)
14156 /* Type variants should be same as the main variant. When not doing sanity
14157 checking to verify this fact, go to main variants and save some work. */
14158 if (trust_type_canonical
)
14160 t1
= TYPE_MAIN_VARIANT (t1
);
14161 t2
= TYPE_MAIN_VARIANT (t2
);
14164 /* Check first for the obvious case of pointer identity. */
14168 /* Check that we have two types to compare. */
14169 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14172 /* We consider complete types always compatible with incomplete type.
14173 This does not make sense for canonical type calculation and thus we
14174 need to ensure that we are never called on it.
14176 FIXME: For more correctness the function probably should have three modes
14177 1) mode assuming that types are complete mathcing their structure
14178 2) mode allowing incomplete types but producing equivalence classes
14179 and thus ignoring all info from complete types
14180 3) mode allowing incomplete types to match complete but checking
14181 compatibility between complete types.
14183 1 and 2 can be used for canonical type calculation. 3 is the real
14184 definition of type compatibility that can be used i.e. for warnings during
14185 declaration merging. */
14187 gcc_assert (!trust_type_canonical
14188 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14190 /* If the types have been previously registered and found equal
14193 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14194 && trust_type_canonical
)
14196 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14197 they are always NULL, but they are set to non-NULL for types
14198 constructed by build_pointer_type and variants. In this case the
14199 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14200 all pointers are considered equal. Be sure to not return false
14202 gcc_checking_assert (canonical_type_used_p (t1
)
14203 && canonical_type_used_p (t2
));
14204 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14207 /* For types where we do ODR based TBAA the canonical type is always
14208 set correctly, so we know that types are different if their
14209 canonical types does not match. */
14210 if (trust_type_canonical
14211 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14212 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14215 /* Can't be the same type if the types don't have the same code. */
14216 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14217 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14220 /* Qualifiers do not matter for canonical type comparison purposes. */
14222 /* Void types and nullptr types are always the same. */
14223 if (TREE_CODE (t1
) == VOID_TYPE
14224 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14227 /* Can't be the same type if they have different mode. */
14228 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14231 /* Non-aggregate types can be handled cheaply. */
14232 if (INTEGRAL_TYPE_P (t1
)
14233 || SCALAR_FLOAT_TYPE_P (t1
)
14234 || FIXED_POINT_TYPE_P (t1
)
14235 || TREE_CODE (t1
) == VECTOR_TYPE
14236 || TREE_CODE (t1
) == COMPLEX_TYPE
14237 || TREE_CODE (t1
) == OFFSET_TYPE
14238 || POINTER_TYPE_P (t1
))
14240 /* Can't be the same type if they have different recision. */
14241 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14244 /* In some cases the signed and unsigned types are required to be
14246 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14247 && !type_with_interoperable_signedness (t1
))
14250 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14251 interoperable with "signed char". Unless all frontends are revisited
14252 to agree on these types, we must ignore the flag completely. */
14254 /* Fortran standard define C_PTR type that is compatible with every
14255 C pointer. For this reason we need to glob all pointers into one.
14256 Still pointers in different address spaces are not compatible. */
14257 if (POINTER_TYPE_P (t1
))
14259 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14260 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14264 /* Tail-recurse to components. */
14265 if (TREE_CODE (t1
) == VECTOR_TYPE
14266 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14267 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14269 trust_type_canonical
);
14274 /* Do type-specific comparisons. */
14275 switch (TREE_CODE (t1
))
14278 /* Array types are the same if the element types are the same and
14279 the number of elements are the same. */
14280 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14281 trust_type_canonical
)
14282 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14283 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14284 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14288 tree i1
= TYPE_DOMAIN (t1
);
14289 tree i2
= TYPE_DOMAIN (t2
);
14291 /* For an incomplete external array, the type domain can be
14292 NULL_TREE. Check this condition also. */
14293 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14295 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14299 tree min1
= TYPE_MIN_VALUE (i1
);
14300 tree min2
= TYPE_MIN_VALUE (i2
);
14301 tree max1
= TYPE_MAX_VALUE (i1
);
14302 tree max2
= TYPE_MAX_VALUE (i2
);
14304 /* The minimum/maximum values have to be the same. */
14307 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14308 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14309 || operand_equal_p (min1
, min2
, 0))))
14312 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14313 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14314 || operand_equal_p (max1
, max2
, 0)))))
14322 case FUNCTION_TYPE
:
14323 /* Function types are the same if the return type and arguments types
14325 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14326 trust_type_canonical
))
14329 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14333 tree parms1
, parms2
;
14335 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14337 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14339 if (!gimple_canonical_types_compatible_p
14340 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14341 trust_type_canonical
))
14345 if (parms1
|| parms2
)
14353 case QUAL_UNION_TYPE
:
14357 /* Don't try to compare variants of an incomplete type, before
14358 TYPE_FIELDS has been copied around. */
14359 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14363 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14366 /* For aggregate types, all the fields must be the same. */
14367 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14369 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14371 /* Skip non-fields and zero-sized fields. */
14372 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14374 && integer_zerop (DECL_SIZE (f1
)))))
14375 f1
= TREE_CHAIN (f1
);
14376 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14378 && integer_zerop (DECL_SIZE (f2
)))))
14379 f2
= TREE_CHAIN (f2
);
14382 /* The fields must have the same name, offset and type. */
14383 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14384 || !gimple_compare_field_offset (f1
, f2
)
14385 || !gimple_canonical_types_compatible_p
14386 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14387 trust_type_canonical
))
14391 /* If one aggregate has more fields than the other, they
14392 are not the same. */
14400 /* Consider all types with language specific trees in them mutually
14401 compatible. This is executed only from verify_type and false
14402 positives can be tolerated. */
14403 gcc_assert (!in_lto_p
);
14408 /* Verify type T. */
14411 verify_type (const_tree t
)
14413 bool error_found
= false;
14414 tree mv
= TYPE_MAIN_VARIANT (t
);
14417 error ("main variant is not defined");
14418 error_found
= true;
14420 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14422 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14424 error_found
= true;
14426 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14427 error_found
= true;
14429 tree ct
= TYPE_CANONICAL (t
);
14432 else if (TYPE_CANONICAL (t
) != ct
)
14434 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14436 error_found
= true;
14438 /* Method and function types cannot be used to address memory and thus
14439 TYPE_CANONICAL really matters only for determining useless conversions.
14441 FIXME: C++ FE produce declarations of builtin functions that are not
14442 compatible with main variants. */
14443 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14446 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14447 with variably sized arrays because their sizes possibly
14448 gimplified to different variables. */
14449 && !variably_modified_type_p (ct
, NULL
)
14450 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14451 && COMPLETE_TYPE_P (t
))
14453 error ("%<TYPE_CANONICAL%> is not compatible");
14455 error_found
= true;
14458 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14459 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14461 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14463 error_found
= true;
14465 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14467 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14469 debug_tree (TYPE_MAIN_VARIANT (ct
));
14470 error_found
= true;
14474 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14475 if (RECORD_OR_UNION_TYPE_P (t
))
14477 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14478 and danagle the pointer from time to time. */
14479 if (TYPE_VFIELD (t
)
14480 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14481 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14483 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14484 debug_tree (TYPE_VFIELD (t
));
14485 error_found
= true;
14488 else if (TREE_CODE (t
) == POINTER_TYPE
)
14490 if (TYPE_NEXT_PTR_TO (t
)
14491 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14493 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14494 debug_tree (TYPE_NEXT_PTR_TO (t
));
14495 error_found
= true;
14498 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14500 if (TYPE_NEXT_REF_TO (t
)
14501 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14503 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14504 debug_tree (TYPE_NEXT_REF_TO (t
));
14505 error_found
= true;
14508 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14509 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14511 /* FIXME: The following check should pass:
14512 useless_type_conversion_p (const_cast <tree> (t),
14513 TREE_TYPE (TYPE_MIN_VALUE (t))
14514 but does not for C sizetypes in LTO. */
14517 /* Check various uses of TYPE_MAXVAL_RAW. */
14518 if (RECORD_OR_UNION_TYPE_P (t
))
14520 if (!TYPE_BINFO (t
))
14522 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14524 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14525 debug_tree (TYPE_BINFO (t
));
14526 error_found
= true;
14528 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14530 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14531 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14532 error_found
= true;
14535 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14537 if (TYPE_METHOD_BASETYPE (t
)
14538 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14539 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14541 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14542 debug_tree (TYPE_METHOD_BASETYPE (t
));
14543 error_found
= true;
14546 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14548 if (TYPE_OFFSET_BASETYPE (t
)
14549 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14550 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14552 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14553 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14554 error_found
= true;
14557 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14558 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14560 /* FIXME: The following check should pass:
14561 useless_type_conversion_p (const_cast <tree> (t),
14562 TREE_TYPE (TYPE_MAX_VALUE (t))
14563 but does not for C sizetypes in LTO. */
14565 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14567 if (TYPE_ARRAY_MAX_SIZE (t
)
14568 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14570 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14571 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14572 error_found
= true;
14575 else if (TYPE_MAX_VALUE_RAW (t
))
14577 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14578 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14579 error_found
= true;
14582 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14584 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14585 debug_tree (TYPE_LANG_SLOT_1 (t
));
14586 error_found
= true;
14589 /* Check various uses of TYPE_VALUES_RAW. */
14590 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14591 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14593 tree value
= TREE_VALUE (l
);
14594 tree name
= TREE_PURPOSE (l
);
14596 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14597 CONST_DECL of ENUMERAL TYPE. */
14598 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14600 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14601 debug_tree (value
);
14603 error_found
= true;
14605 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14606 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14608 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14610 debug_tree (value
);
14612 error_found
= true;
14614 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14616 error ("enum value name is not %<IDENTIFIER_NODE%>");
14617 debug_tree (value
);
14619 error_found
= true;
14622 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14624 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14626 error ("array %<TYPE_DOMAIN%> is not integer type");
14627 debug_tree (TYPE_DOMAIN (t
));
14628 error_found
= true;
14631 else if (RECORD_OR_UNION_TYPE_P (t
))
14633 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14635 error ("%<TYPE_FIELDS%> defined in incomplete type");
14636 error_found
= true;
14638 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14640 /* TODO: verify properties of decls. */
14641 if (TREE_CODE (fld
) == FIELD_DECL
)
14643 else if (TREE_CODE (fld
) == TYPE_DECL
)
14645 else if (TREE_CODE (fld
) == CONST_DECL
)
14647 else if (VAR_P (fld
))
14649 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14651 else if (TREE_CODE (fld
) == USING_DECL
)
14653 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14657 error ("wrong tree in %<TYPE_FIELDS%> list");
14659 error_found
= true;
14663 else if (TREE_CODE (t
) == INTEGER_TYPE
14664 || TREE_CODE (t
) == BOOLEAN_TYPE
14665 || TREE_CODE (t
) == OFFSET_TYPE
14666 || TREE_CODE (t
) == REFERENCE_TYPE
14667 || TREE_CODE (t
) == NULLPTR_TYPE
14668 || TREE_CODE (t
) == POINTER_TYPE
)
14670 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14672 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14674 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14675 error_found
= true;
14677 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14679 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14680 debug_tree (TYPE_CACHED_VALUES (t
));
14681 error_found
= true;
14683 /* Verify just enough of cache to ensure that no one copied it to new type.
14684 All copying should go by copy_node that should clear it. */
14685 else if (TYPE_CACHED_VALUES_P (t
))
14688 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14689 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14690 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14692 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14693 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14694 error_found
= true;
14699 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14700 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14702 /* C++ FE uses TREE_PURPOSE to store initial values. */
14703 if (TREE_PURPOSE (l
) && in_lto_p
)
14705 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14707 error_found
= true;
14709 if (!TYPE_P (TREE_VALUE (l
)))
14711 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14713 error_found
= true;
14716 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14718 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14719 debug_tree (TYPE_VALUES_RAW (t
));
14720 error_found
= true;
14722 if (TREE_CODE (t
) != INTEGER_TYPE
14723 && TREE_CODE (t
) != BOOLEAN_TYPE
14724 && TREE_CODE (t
) != OFFSET_TYPE
14725 && TREE_CODE (t
) != REFERENCE_TYPE
14726 && TREE_CODE (t
) != NULLPTR_TYPE
14727 && TREE_CODE (t
) != POINTER_TYPE
14728 && TYPE_CACHED_VALUES_P (t
))
14730 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14731 error_found
= true;
14734 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14735 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14737 if (TREE_CODE (t
) == METHOD_TYPE
14738 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14740 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14741 error_found
= true;
14746 debug_tree (const_cast <tree
> (t
));
14747 internal_error ("%qs failed", __func__
);
14752 /* Return 1 if ARG interpreted as signed in its precision is known to be
14753 always positive or 2 if ARG is known to be always negative, or 3 if
14754 ARG may be positive or negative. */
14757 get_range_pos_neg (tree arg
)
14759 if (arg
== error_mark_node
)
14762 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14764 if (TREE_CODE (arg
) == INTEGER_CST
)
14766 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14772 while (CONVERT_EXPR_P (arg
)
14773 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14774 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14776 arg
= TREE_OPERAND (arg
, 0);
14777 /* Narrower value zero extended into wider type
14778 will always result in positive values. */
14779 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14780 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14782 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14787 if (TREE_CODE (arg
) != SSA_NAME
)
14789 wide_int arg_min
, arg_max
;
14790 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14792 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14793 if (is_gimple_assign (g
)
14794 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14796 tree t
= gimple_assign_rhs1 (g
);
14797 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14798 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14800 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14801 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14803 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14812 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14814 /* For unsigned values, the "positive" range comes
14815 below the "negative" range. */
14816 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14818 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14823 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14825 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14834 /* Return true if ARG is marked with the nonnull attribute in the
14835 current function signature. */
14838 nonnull_arg_p (const_tree arg
)
14840 tree t
, attrs
, fntype
;
14841 unsigned HOST_WIDE_INT arg_num
;
14843 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14844 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14845 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14847 /* The static chain decl is always non null. */
14848 if (arg
== cfun
->static_chain_decl
)
14851 /* THIS argument of method is always non-NULL. */
14852 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14853 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14854 && flag_delete_null_pointer_checks
)
14857 /* Values passed by reference are always non-NULL. */
14858 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14859 && flag_delete_null_pointer_checks
)
14862 fntype
= TREE_TYPE (cfun
->decl
);
14863 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14865 attrs
= lookup_attribute ("nonnull", attrs
);
14867 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14868 if (attrs
== NULL_TREE
)
14871 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14872 if (TREE_VALUE (attrs
) == NULL_TREE
)
14875 /* Get the position number for ARG in the function signature. */
14876 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14878 t
= DECL_CHAIN (t
), arg_num
++)
14884 gcc_assert (t
== arg
);
14886 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14887 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14889 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14897 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14901 set_block (location_t loc
, tree block
)
14903 location_t pure_loc
= get_pure_location (loc
);
14904 source_range src_range
= get_range_from_loc (line_table
, loc
);
14905 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14909 set_source_range (tree expr
, location_t start
, location_t finish
)
14911 source_range src_range
;
14912 src_range
.m_start
= start
;
14913 src_range
.m_finish
= finish
;
14914 return set_source_range (expr
, src_range
);
14918 set_source_range (tree expr
, source_range src_range
)
14920 if (!EXPR_P (expr
))
14921 return UNKNOWN_LOCATION
;
14923 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14924 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14928 SET_EXPR_LOCATION (expr
, adhoc
);
14932 /* Return EXPR, potentially wrapped with a node expression LOC,
14933 if !CAN_HAVE_LOCATION_P (expr).
14935 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14936 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14938 Wrapper nodes can be identified using location_wrapper_p. */
14941 maybe_wrap_with_location (tree expr
, location_t loc
)
14945 if (loc
== UNKNOWN_LOCATION
)
14947 if (CAN_HAVE_LOCATION_P (expr
))
14949 /* We should only be adding wrappers for constants and for decls,
14950 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14951 gcc_assert (CONSTANT_CLASS_P (expr
)
14953 || EXCEPTIONAL_CLASS_P (expr
));
14955 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14956 any impact of the wrapper nodes. */
14957 if (EXCEPTIONAL_CLASS_P (expr
))
14960 /* If any auto_suppress_location_wrappers are active, don't create
14962 if (suppress_location_wrappers
> 0)
14966 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14967 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14968 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14969 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14970 /* Mark this node as being a wrapper. */
14971 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14975 int suppress_location_wrappers
;
14977 /* Return the name of combined function FN, for debugging purposes. */
14980 combined_fn_name (combined_fn fn
)
14982 if (builtin_fn_p (fn
))
14984 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14985 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14988 return internal_fn_name (as_internal_fn (fn
));
14991 /* Return a bitmap with a bit set corresponding to each argument in
14992 a function call type FNTYPE declared with attribute nonnull,
14993 or null if none of the function's argument are nonnull. The caller
14994 must free the bitmap. */
14997 get_nonnull_args (const_tree fntype
)
14999 if (fntype
== NULL_TREE
)
15002 bitmap argmap
= NULL
;
15003 if (TREE_CODE (fntype
) == METHOD_TYPE
)
15005 /* The this pointer in C++ non-static member functions is
15006 implicitly nonnull whether or not it's declared as such. */
15007 argmap
= BITMAP_ALLOC (NULL
);
15008 bitmap_set_bit (argmap
, 0);
15011 tree attrs
= TYPE_ATTRIBUTES (fntype
);
15015 /* A function declaration can specify multiple attribute nonnull,
15016 each with zero or more arguments. The loop below creates a bitmap
15017 representing a union of all the arguments. An empty (but non-null)
15018 bitmap means that all arguments have been declaraed nonnull. */
15019 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
15021 attrs
= lookup_attribute ("nonnull", attrs
);
15026 argmap
= BITMAP_ALLOC (NULL
);
15028 if (!TREE_VALUE (attrs
))
15030 /* Clear the bitmap in case a previous attribute nonnull
15031 set it and this one overrides it for all arguments. */
15032 bitmap_clear (argmap
);
15036 /* Iterate over the indices of the format arguments declared nonnull
15037 and set a bit for each. */
15038 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
15040 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
15041 bitmap_set_bit (argmap
, val
);
15048 /* Returns true if TYPE is a type where it and all of its subobjects
15049 (recursively) are of structure, union, or array type. */
15052 default_is_empty_type (tree type
)
15054 if (RECORD_OR_UNION_TYPE_P (type
))
15056 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
15057 if (TREE_CODE (field
) == FIELD_DECL
15058 && !DECL_PADDING_P (field
)
15059 && !default_is_empty_type (TREE_TYPE (field
)))
15063 else if (TREE_CODE (type
) == ARRAY_TYPE
)
15064 return (integer_minus_onep (array_type_nelts (type
))
15065 || TYPE_DOMAIN (type
) == NULL_TREE
15066 || default_is_empty_type (TREE_TYPE (type
)));
15070 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15071 that shouldn't be passed via stack. */
15074 default_is_empty_record (const_tree type
)
15076 if (!abi_version_at_least (12))
15079 if (type
== error_mark_node
)
15082 if (TREE_ADDRESSABLE (type
))
15085 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
15088 /* Determine whether TYPE is a structure with a flexible array member,
15089 or a union containing such a structure (possibly recursively). */
15092 flexible_array_type_p (const_tree type
)
15095 switch (TREE_CODE (type
))
15099 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15100 if (TREE_CODE (x
) == FIELD_DECL
)
15102 if (last
== NULL_TREE
)
15104 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
15105 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
15106 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
15107 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
15111 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15113 if (TREE_CODE (x
) == FIELD_DECL
15114 && flexible_array_type_p (TREE_TYPE (x
)))
15123 /* Like int_size_in_bytes, but handle empty records specially. */
15126 arg_int_size_in_bytes (const_tree type
)
15128 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15131 /* Like size_in_bytes, but handle empty records specially. */
15134 arg_size_in_bytes (const_tree type
)
15136 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15139 /* Return true if an expression with CODE has to have the same result type as
15140 its first operand. */
15143 expr_type_first_operand_type_p (tree_code code
)
15156 case TRUNC_DIV_EXPR
:
15157 case CEIL_DIV_EXPR
:
15158 case FLOOR_DIV_EXPR
:
15159 case ROUND_DIV_EXPR
:
15160 case TRUNC_MOD_EXPR
:
15161 case CEIL_MOD_EXPR
:
15162 case FLOOR_MOD_EXPR
:
15163 case ROUND_MOD_EXPR
:
15165 case EXACT_DIV_EXPR
:
15183 /* Return a typenode for the "standard" C type with a given name. */
15185 get_typenode_from_name (const char *name
)
15187 if (name
== NULL
|| *name
== '\0')
15190 if (strcmp (name
, "char") == 0)
15191 return char_type_node
;
15192 if (strcmp (name
, "unsigned char") == 0)
15193 return unsigned_char_type_node
;
15194 if (strcmp (name
, "signed char") == 0)
15195 return signed_char_type_node
;
15197 if (strcmp (name
, "short int") == 0)
15198 return short_integer_type_node
;
15199 if (strcmp (name
, "short unsigned int") == 0)
15200 return short_unsigned_type_node
;
15202 if (strcmp (name
, "int") == 0)
15203 return integer_type_node
;
15204 if (strcmp (name
, "unsigned int") == 0)
15205 return unsigned_type_node
;
15207 if (strcmp (name
, "long int") == 0)
15208 return long_integer_type_node
;
15209 if (strcmp (name
, "long unsigned int") == 0)
15210 return long_unsigned_type_node
;
15212 if (strcmp (name
, "long long int") == 0)
15213 return long_long_integer_type_node
;
15214 if (strcmp (name
, "long long unsigned int") == 0)
15215 return long_long_unsigned_type_node
;
15217 gcc_unreachable ();
15220 /* List of pointer types used to declare builtins before we have seen their
15223 Keep the size up to date in tree.h ! */
15224 const builtin_structptr_type builtin_structptr_types
[6] =
15226 { fileptr_type_node
, ptr_type_node
, "FILE" },
15227 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15228 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15229 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15230 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15231 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15234 /* Return the maximum object size. */
15237 max_object_size (void)
15239 /* To do: Make this a configurable parameter. */
15240 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15243 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15244 parameter default to false and that weeds out error_mark_node. */
15247 verify_type_context (location_t loc
, type_context_kind context
,
15248 const_tree type
, bool silent_p
)
15250 if (type
== error_mark_node
)
15253 gcc_assert (TYPE_P (type
));
15254 return (!targetm
.verify_type_context
15255 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
15260 namespace selftest
{
15262 /* Selftests for tree. */
15264 /* Verify that integer constants are sane. */
15267 test_integer_constants ()
15269 ASSERT_TRUE (integer_type_node
!= NULL
);
15270 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15272 tree type
= integer_type_node
;
15274 tree zero
= build_zero_cst (type
);
15275 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15276 ASSERT_EQ (type
, TREE_TYPE (zero
));
15278 tree one
= build_int_cst (type
, 1);
15279 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15280 ASSERT_EQ (type
, TREE_TYPE (zero
));
15283 /* Verify identifiers. */
15286 test_identifiers ()
15288 tree identifier
= get_identifier ("foo");
15289 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15290 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15293 /* Verify LABEL_DECL. */
15298 tree identifier
= get_identifier ("err");
15299 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15300 identifier
, void_type_node
);
15301 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15302 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15305 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15306 are given by VALS. */
15309 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15311 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15312 tree_vector_builder
builder (type
, vals
.length (), 1);
15313 builder
.splice (vals
);
15314 return builder
.build ();
15317 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15320 check_vector_cst (vec
<tree
> expected
, tree actual
)
15322 ASSERT_KNOWN_EQ (expected
.length (),
15323 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15324 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15325 ASSERT_EQ (wi::to_wide (expected
[i
]),
15326 wi::to_wide (vector_cst_elt (actual
, i
)));
15329 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15330 and that its elements match EXPECTED. */
15333 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15334 unsigned int npatterns
)
15336 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15337 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15338 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15339 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15340 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15341 check_vector_cst (expected
, actual
);
15344 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15345 and NPATTERNS background elements, and that its elements match
15349 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15350 unsigned int npatterns
)
15352 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15353 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15354 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15355 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15356 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15357 check_vector_cst (expected
, actual
);
15360 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15361 and that its elements match EXPECTED. */
15364 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15365 unsigned int npatterns
)
15367 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15368 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15369 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15370 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15371 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15372 check_vector_cst (expected
, actual
);
15375 /* Test the creation of VECTOR_CSTs. */
15378 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15380 auto_vec
<tree
, 8> elements (8);
15381 elements
.quick_grow (8);
15382 tree element_type
= build_nonstandard_integer_type (16, true);
15383 tree vector_type
= build_vector_type (element_type
, 8);
15385 /* Test a simple linear series with a base of 0 and a step of 1:
15386 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15387 for (unsigned int i
= 0; i
< 8; ++i
)
15388 elements
[i
] = build_int_cst (element_type
, i
);
15389 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15390 check_vector_cst_stepped (elements
, vector
, 1);
15392 /* Try the same with the first element replaced by 100:
15393 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15394 elements
[0] = build_int_cst (element_type
, 100);
15395 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15396 check_vector_cst_stepped (elements
, vector
, 1);
15398 /* Try a series that wraps around.
15399 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15400 for (unsigned int i
= 1; i
< 8; ++i
)
15401 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15402 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15403 check_vector_cst_stepped (elements
, vector
, 1);
15405 /* Try a downward series:
15406 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15407 for (unsigned int i
= 1; i
< 8; ++i
)
15408 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15409 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15410 check_vector_cst_stepped (elements
, vector
, 1);
15412 /* Try two interleaved series with different bases and steps:
15413 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15414 elements
[1] = build_int_cst (element_type
, 53);
15415 for (unsigned int i
= 2; i
< 8; i
+= 2)
15417 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15418 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15420 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15421 check_vector_cst_stepped (elements
, vector
, 2);
15423 /* Try a duplicated value:
15424 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15425 for (unsigned int i
= 1; i
< 8; ++i
)
15426 elements
[i
] = elements
[0];
15427 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15428 check_vector_cst_duplicate (elements
, vector
, 1);
15430 /* Try an interleaved duplicated value:
15431 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15432 elements
[1] = build_int_cst (element_type
, 55);
15433 for (unsigned int i
= 2; i
< 8; ++i
)
15434 elements
[i
] = elements
[i
- 2];
15435 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15436 check_vector_cst_duplicate (elements
, vector
, 2);
15438 /* Try a duplicated value with 2 exceptions
15439 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15440 elements
[0] = build_int_cst (element_type
, 41);
15441 elements
[1] = build_int_cst (element_type
, 97);
15442 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15443 check_vector_cst_fill (elements
, vector
, 2);
15445 /* Try with and without a step
15446 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15447 for (unsigned int i
= 3; i
< 8; i
+= 2)
15448 elements
[i
] = build_int_cst (element_type
, i
* 7);
15449 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15450 check_vector_cst_stepped (elements
, vector
, 2);
15452 /* Try a fully-general constant:
15453 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15454 elements
[5] = build_int_cst (element_type
, 9990);
15455 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15456 check_vector_cst_fill (elements
, vector
, 4);
15459 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15460 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15461 modifying its argument in-place. */
15464 check_strip_nops (tree node
, tree expected
)
15467 ASSERT_EQ (expected
, node
);
15470 /* Verify location wrappers. */
15473 test_location_wrappers ()
15475 location_t loc
= BUILTINS_LOCATION
;
15477 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15479 /* Wrapping a constant. */
15480 tree int_cst
= build_int_cst (integer_type_node
, 42);
15481 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15482 ASSERT_FALSE (location_wrapper_p (int_cst
));
15484 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15485 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15486 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15487 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15489 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15490 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15492 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15493 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15494 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15495 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15497 /* Wrapping a STRING_CST. */
15498 tree string_cst
= build_string (4, "foo");
15499 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15500 ASSERT_FALSE (location_wrapper_p (string_cst
));
15502 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15503 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15504 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15505 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15506 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15509 /* Wrapping a variable. */
15510 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15511 get_identifier ("some_int_var"),
15512 integer_type_node
);
15513 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15514 ASSERT_FALSE (location_wrapper_p (int_var
));
15516 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15517 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15518 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15519 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15521 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15523 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15524 ASSERT_FALSE (location_wrapper_p (r_cast
));
15525 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15527 /* Verify that STRIP_NOPS removes wrappers. */
15528 check_strip_nops (wrapped_int_cst
, int_cst
);
15529 check_strip_nops (wrapped_string_cst
, string_cst
);
15530 check_strip_nops (wrapped_int_var
, int_var
);
15533 /* Test various tree predicates. Verify that location wrappers don't
15534 affect the results. */
15539 /* Build various constants and wrappers around them. */
15541 location_t loc
= BUILTINS_LOCATION
;
15543 tree i_0
= build_int_cst (integer_type_node
, 0);
15544 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15546 tree i_1
= build_int_cst (integer_type_node
, 1);
15547 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15549 tree i_m1
= build_int_cst (integer_type_node
, -1);
15550 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15552 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15553 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15554 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15555 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15556 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15557 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15559 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15560 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15561 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15563 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15564 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15565 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15567 /* TODO: vector constants. */
15569 /* Test integer_onep. */
15570 ASSERT_FALSE (integer_onep (i_0
));
15571 ASSERT_FALSE (integer_onep (wr_i_0
));
15572 ASSERT_TRUE (integer_onep (i_1
));
15573 ASSERT_TRUE (integer_onep (wr_i_1
));
15574 ASSERT_FALSE (integer_onep (i_m1
));
15575 ASSERT_FALSE (integer_onep (wr_i_m1
));
15576 ASSERT_FALSE (integer_onep (f_0
));
15577 ASSERT_FALSE (integer_onep (wr_f_0
));
15578 ASSERT_FALSE (integer_onep (f_1
));
15579 ASSERT_FALSE (integer_onep (wr_f_1
));
15580 ASSERT_FALSE (integer_onep (f_m1
));
15581 ASSERT_FALSE (integer_onep (wr_f_m1
));
15582 ASSERT_FALSE (integer_onep (c_i_0
));
15583 ASSERT_TRUE (integer_onep (c_i_1
));
15584 ASSERT_FALSE (integer_onep (c_i_m1
));
15585 ASSERT_FALSE (integer_onep (c_f_0
));
15586 ASSERT_FALSE (integer_onep (c_f_1
));
15587 ASSERT_FALSE (integer_onep (c_f_m1
));
15589 /* Test integer_zerop. */
15590 ASSERT_TRUE (integer_zerop (i_0
));
15591 ASSERT_TRUE (integer_zerop (wr_i_0
));
15592 ASSERT_FALSE (integer_zerop (i_1
));
15593 ASSERT_FALSE (integer_zerop (wr_i_1
));
15594 ASSERT_FALSE (integer_zerop (i_m1
));
15595 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15596 ASSERT_FALSE (integer_zerop (f_0
));
15597 ASSERT_FALSE (integer_zerop (wr_f_0
));
15598 ASSERT_FALSE (integer_zerop (f_1
));
15599 ASSERT_FALSE (integer_zerop (wr_f_1
));
15600 ASSERT_FALSE (integer_zerop (f_m1
));
15601 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15602 ASSERT_TRUE (integer_zerop (c_i_0
));
15603 ASSERT_FALSE (integer_zerop (c_i_1
));
15604 ASSERT_FALSE (integer_zerop (c_i_m1
));
15605 ASSERT_FALSE (integer_zerop (c_f_0
));
15606 ASSERT_FALSE (integer_zerop (c_f_1
));
15607 ASSERT_FALSE (integer_zerop (c_f_m1
));
15609 /* Test integer_all_onesp. */
15610 ASSERT_FALSE (integer_all_onesp (i_0
));
15611 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15612 ASSERT_FALSE (integer_all_onesp (i_1
));
15613 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15614 ASSERT_TRUE (integer_all_onesp (i_m1
));
15615 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15616 ASSERT_FALSE (integer_all_onesp (f_0
));
15617 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15618 ASSERT_FALSE (integer_all_onesp (f_1
));
15619 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15620 ASSERT_FALSE (integer_all_onesp (f_m1
));
15621 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15622 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15623 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15624 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15625 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15626 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15627 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15629 /* Test integer_minus_onep. */
15630 ASSERT_FALSE (integer_minus_onep (i_0
));
15631 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15632 ASSERT_FALSE (integer_minus_onep (i_1
));
15633 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15634 ASSERT_TRUE (integer_minus_onep (i_m1
));
15635 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15636 ASSERT_FALSE (integer_minus_onep (f_0
));
15637 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15638 ASSERT_FALSE (integer_minus_onep (f_1
));
15639 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15640 ASSERT_FALSE (integer_minus_onep (f_m1
));
15641 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15642 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15643 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15644 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15645 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15646 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15647 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15649 /* Test integer_each_onep. */
15650 ASSERT_FALSE (integer_each_onep (i_0
));
15651 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15652 ASSERT_TRUE (integer_each_onep (i_1
));
15653 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15654 ASSERT_FALSE (integer_each_onep (i_m1
));
15655 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15656 ASSERT_FALSE (integer_each_onep (f_0
));
15657 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15658 ASSERT_FALSE (integer_each_onep (f_1
));
15659 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15660 ASSERT_FALSE (integer_each_onep (f_m1
));
15661 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15662 ASSERT_FALSE (integer_each_onep (c_i_0
));
15663 ASSERT_FALSE (integer_each_onep (c_i_1
));
15664 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15665 ASSERT_FALSE (integer_each_onep (c_f_0
));
15666 ASSERT_FALSE (integer_each_onep (c_f_1
));
15667 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15669 /* Test integer_truep. */
15670 ASSERT_FALSE (integer_truep (i_0
));
15671 ASSERT_FALSE (integer_truep (wr_i_0
));
15672 ASSERT_TRUE (integer_truep (i_1
));
15673 ASSERT_TRUE (integer_truep (wr_i_1
));
15674 ASSERT_FALSE (integer_truep (i_m1
));
15675 ASSERT_FALSE (integer_truep (wr_i_m1
));
15676 ASSERT_FALSE (integer_truep (f_0
));
15677 ASSERT_FALSE (integer_truep (wr_f_0
));
15678 ASSERT_FALSE (integer_truep (f_1
));
15679 ASSERT_FALSE (integer_truep (wr_f_1
));
15680 ASSERT_FALSE (integer_truep (f_m1
));
15681 ASSERT_FALSE (integer_truep (wr_f_m1
));
15682 ASSERT_FALSE (integer_truep (c_i_0
));
15683 ASSERT_TRUE (integer_truep (c_i_1
));
15684 ASSERT_FALSE (integer_truep (c_i_m1
));
15685 ASSERT_FALSE (integer_truep (c_f_0
));
15686 ASSERT_FALSE (integer_truep (c_f_1
));
15687 ASSERT_FALSE (integer_truep (c_f_m1
));
15689 /* Test integer_nonzerop. */
15690 ASSERT_FALSE (integer_nonzerop (i_0
));
15691 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15692 ASSERT_TRUE (integer_nonzerop (i_1
));
15693 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15694 ASSERT_TRUE (integer_nonzerop (i_m1
));
15695 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15696 ASSERT_FALSE (integer_nonzerop (f_0
));
15697 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15698 ASSERT_FALSE (integer_nonzerop (f_1
));
15699 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15700 ASSERT_FALSE (integer_nonzerop (f_m1
));
15701 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15702 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15703 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15704 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15705 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15706 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15707 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15709 /* Test real_zerop. */
15710 ASSERT_FALSE (real_zerop (i_0
));
15711 ASSERT_FALSE (real_zerop (wr_i_0
));
15712 ASSERT_FALSE (real_zerop (i_1
));
15713 ASSERT_FALSE (real_zerop (wr_i_1
));
15714 ASSERT_FALSE (real_zerop (i_m1
));
15715 ASSERT_FALSE (real_zerop (wr_i_m1
));
15716 ASSERT_TRUE (real_zerop (f_0
));
15717 ASSERT_TRUE (real_zerop (wr_f_0
));
15718 ASSERT_FALSE (real_zerop (f_1
));
15719 ASSERT_FALSE (real_zerop (wr_f_1
));
15720 ASSERT_FALSE (real_zerop (f_m1
));
15721 ASSERT_FALSE (real_zerop (wr_f_m1
));
15722 ASSERT_FALSE (real_zerop (c_i_0
));
15723 ASSERT_FALSE (real_zerop (c_i_1
));
15724 ASSERT_FALSE (real_zerop (c_i_m1
));
15725 ASSERT_TRUE (real_zerop (c_f_0
));
15726 ASSERT_FALSE (real_zerop (c_f_1
));
15727 ASSERT_FALSE (real_zerop (c_f_m1
));
15729 /* Test real_onep. */
15730 ASSERT_FALSE (real_onep (i_0
));
15731 ASSERT_FALSE (real_onep (wr_i_0
));
15732 ASSERT_FALSE (real_onep (i_1
));
15733 ASSERT_FALSE (real_onep (wr_i_1
));
15734 ASSERT_FALSE (real_onep (i_m1
));
15735 ASSERT_FALSE (real_onep (wr_i_m1
));
15736 ASSERT_FALSE (real_onep (f_0
));
15737 ASSERT_FALSE (real_onep (wr_f_0
));
15738 ASSERT_TRUE (real_onep (f_1
));
15739 ASSERT_TRUE (real_onep (wr_f_1
));
15740 ASSERT_FALSE (real_onep (f_m1
));
15741 ASSERT_FALSE (real_onep (wr_f_m1
));
15742 ASSERT_FALSE (real_onep (c_i_0
));
15743 ASSERT_FALSE (real_onep (c_i_1
));
15744 ASSERT_FALSE (real_onep (c_i_m1
));
15745 ASSERT_FALSE (real_onep (c_f_0
));
15746 ASSERT_TRUE (real_onep (c_f_1
));
15747 ASSERT_FALSE (real_onep (c_f_m1
));
15749 /* Test real_minus_onep. */
15750 ASSERT_FALSE (real_minus_onep (i_0
));
15751 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15752 ASSERT_FALSE (real_minus_onep (i_1
));
15753 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15754 ASSERT_FALSE (real_minus_onep (i_m1
));
15755 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15756 ASSERT_FALSE (real_minus_onep (f_0
));
15757 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15758 ASSERT_FALSE (real_minus_onep (f_1
));
15759 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15760 ASSERT_TRUE (real_minus_onep (f_m1
));
15761 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15762 ASSERT_FALSE (real_minus_onep (c_i_0
));
15763 ASSERT_FALSE (real_minus_onep (c_i_1
));
15764 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15765 ASSERT_FALSE (real_minus_onep (c_f_0
));
15766 ASSERT_FALSE (real_minus_onep (c_f_1
));
15767 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15770 ASSERT_TRUE (zerop (i_0
));
15771 ASSERT_TRUE (zerop (wr_i_0
));
15772 ASSERT_FALSE (zerop (i_1
));
15773 ASSERT_FALSE (zerop (wr_i_1
));
15774 ASSERT_FALSE (zerop (i_m1
));
15775 ASSERT_FALSE (zerop (wr_i_m1
));
15776 ASSERT_TRUE (zerop (f_0
));
15777 ASSERT_TRUE (zerop (wr_f_0
));
15778 ASSERT_FALSE (zerop (f_1
));
15779 ASSERT_FALSE (zerop (wr_f_1
));
15780 ASSERT_FALSE (zerop (f_m1
));
15781 ASSERT_FALSE (zerop (wr_f_m1
));
15782 ASSERT_TRUE (zerop (c_i_0
));
15783 ASSERT_FALSE (zerop (c_i_1
));
15784 ASSERT_FALSE (zerop (c_i_m1
));
15785 ASSERT_TRUE (zerop (c_f_0
));
15786 ASSERT_FALSE (zerop (c_f_1
));
15787 ASSERT_FALSE (zerop (c_f_m1
));
15789 /* Test tree_expr_nonnegative_p. */
15790 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15791 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15792 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15793 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15794 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15795 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15796 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15797 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15798 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15799 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15800 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15801 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15802 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15803 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15804 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15805 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15806 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15807 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15809 /* Test tree_expr_nonzero_p. */
15810 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15811 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15812 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15813 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15814 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15815 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15817 /* Test integer_valued_real_p. */
15818 ASSERT_FALSE (integer_valued_real_p (i_0
));
15819 ASSERT_TRUE (integer_valued_real_p (f_0
));
15820 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15821 ASSERT_TRUE (integer_valued_real_p (f_1
));
15822 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15824 /* Test integer_pow2p. */
15825 ASSERT_FALSE (integer_pow2p (i_0
));
15826 ASSERT_TRUE (integer_pow2p (i_1
));
15827 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15829 /* Test uniform_integer_cst_p. */
15830 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15831 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15832 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15833 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15834 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15835 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15836 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15837 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15838 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15839 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15840 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15841 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15842 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15843 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15844 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15845 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15846 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15847 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15850 /* Check that string escaping works correctly. */
15853 test_escaped_strings (void)
15856 escaped_string msg
;
15859 /* ASSERT_STREQ does not accept NULL as a valid test
15860 result, so we have to use ASSERT_EQ instead. */
15861 ASSERT_EQ (NULL
, (const char *) msg
);
15864 ASSERT_STREQ ("", (const char *) msg
);
15866 msg
.escape ("foobar");
15867 ASSERT_STREQ ("foobar", (const char *) msg
);
15869 /* Ensure that we have -fmessage-length set to 0. */
15870 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15871 pp_line_cutoff (global_dc
->printer
) = 0;
15873 msg
.escape ("foo\nbar");
15874 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15876 msg
.escape ("\a\b\f\n\r\t\v");
15877 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15879 /* Now repeat the tests with -fmessage-length set to 5. */
15880 pp_line_cutoff (global_dc
->printer
) = 5;
15882 /* Note that the newline is not translated into an escape. */
15883 msg
.escape ("foo\nbar");
15884 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15886 msg
.escape ("\a\b\f\n\r\t\v");
15887 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15889 /* Restore the original message length setting. */
15890 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15893 /* Run all of the selftests within this file. */
15898 test_integer_constants ();
15899 test_identifiers ();
15901 test_vector_cst_patterns ();
15902 test_location_wrappers ();
15903 test_predicates ();
15904 test_escaped_strings ();
15907 } // namespace selftest
15909 #endif /* CHECKING_P */
15911 #include "gt-tree.h"