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 /* Create an INT_CST node of TYPE and value CST.
1487 The returned node is always shared. For small integers we use a
1488 per-type vector cache, for larger ones we use a single hash table.
1489 The value is extended from its precision according to the sign of
1490 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1491 the upper bits and ensures that hashing and value equality based
1492 upon the underlying HOST_WIDE_INTs works without masking. */
1495 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1502 unsigned int prec
= TYPE_PRECISION (type
);
1503 signop sgn
= TYPE_SIGN (type
);
1505 /* Verify that everything is canonical. */
1506 int l
= pcst
.get_len ();
1509 if (pcst
.elt (l
- 1) == 0)
1510 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1511 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1512 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1515 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1516 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1520 /* We just need to store a single HOST_WIDE_INT. */
1522 if (TYPE_UNSIGNED (type
))
1523 hwi
= cst
.to_uhwi ();
1525 hwi
= cst
.to_shwi ();
1527 switch (TREE_CODE (type
))
1530 gcc_assert (hwi
== 0);
1534 case REFERENCE_TYPE
:
1535 /* Cache NULL pointer and zero bounds. */
1544 /* Cache false or true. */
1546 if (IN_RANGE (hwi
, 0, 1))
1552 if (TYPE_SIGN (type
) == UNSIGNED
)
1555 limit
= param_integer_share_limit
;
1556 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1561 /* Cache [-1, N). */
1562 limit
= param_integer_share_limit
+ 1;
1563 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1577 /* Look for it in the type's vector of small shared ints. */
1578 if (!TYPE_CACHED_VALUES_P (type
))
1580 TYPE_CACHED_VALUES_P (type
) = 1;
1581 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1584 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1586 /* Make sure no one is clobbering the shared constant. */
1587 gcc_checking_assert (TREE_TYPE (t
) == type
1588 && TREE_INT_CST_NUNITS (t
) == 1
1589 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1590 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1591 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1594 /* Create a new shared int. */
1595 t
= build_new_int_cst (type
, cst
);
1596 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1601 /* Use the cache of larger shared ints, using int_cst_node as
1604 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1605 TREE_TYPE (int_cst_node
) = type
;
1607 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1611 /* Insert this one into the hash table. */
1614 /* Make a new node for next time round. */
1615 int_cst_node
= make_int_cst (1, 1);
1621 /* The value either hashes properly or we drop it on the floor
1622 for the gc to take care of. There will not be enough of them
1625 tree nt
= build_new_int_cst (type
, cst
);
1626 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1630 /* Insert this one into the hash table. */
1642 poly_int_cst_hasher::hash (tree t
)
1644 inchash::hash hstate
;
1646 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1647 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1648 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1650 return hstate
.end ();
1654 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1656 if (TREE_TYPE (x
) != y
.first
)
1658 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1659 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1664 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1665 The elements must also have type TYPE. */
1668 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1670 unsigned int prec
= TYPE_PRECISION (type
);
1671 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1672 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1675 h
.add_int (TYPE_UID (type
));
1676 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1677 h
.add_wide_int (c
.coeffs
[i
]);
1678 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1679 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1681 if (*slot
== NULL_TREE
)
1683 tree coeffs
[NUM_POLY_INT_COEFFS
];
1684 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1685 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1686 *slot
= build_new_poly_int_cst (type
, coeffs
);
1691 /* Create a constant tree with value VALUE in type TYPE. */
1694 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1696 if (value
.is_constant ())
1697 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1698 return build_poly_int_cst (type
, value
);
1702 cache_integer_cst (tree t
)
1704 tree type
= TREE_TYPE (t
);
1707 int prec
= TYPE_PRECISION (type
);
1709 gcc_assert (!TREE_OVERFLOW (t
));
1711 switch (TREE_CODE (type
))
1714 gcc_assert (integer_zerop (t
));
1718 case REFERENCE_TYPE
:
1719 /* Cache NULL pointer. */
1720 if (integer_zerop (t
))
1728 /* Cache false or true. */
1730 if (wi::ltu_p (wi::to_wide (t
), 2))
1731 ix
= TREE_INT_CST_ELT (t
, 0);
1736 if (TYPE_UNSIGNED (type
))
1739 limit
= param_integer_share_limit
;
1741 /* This is a little hokie, but if the prec is smaller than
1742 what is necessary to hold param_integer_share_limit, then the
1743 obvious test will not get the correct answer. */
1744 if (prec
< HOST_BITS_PER_WIDE_INT
)
1746 if (tree_to_uhwi (t
)
1747 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1748 ix
= tree_to_uhwi (t
);
1750 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1751 ix
= tree_to_uhwi (t
);
1756 limit
= param_integer_share_limit
+ 1;
1758 if (integer_minus_onep (t
))
1760 else if (!wi::neg_p (wi::to_wide (t
)))
1762 if (prec
< HOST_BITS_PER_WIDE_INT
)
1764 if (tree_to_shwi (t
) < param_integer_share_limit
)
1765 ix
= tree_to_shwi (t
) + 1;
1767 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1768 ix
= tree_to_shwi (t
) + 1;
1782 /* Look for it in the type's vector of small shared ints. */
1783 if (!TYPE_CACHED_VALUES_P (type
))
1785 TYPE_CACHED_VALUES_P (type
) = 1;
1786 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1789 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1790 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1794 /* Use the cache of larger shared ints. */
1795 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1796 /* If there is already an entry for the number verify it's the
1799 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1801 /* Otherwise insert this one into the hash table. */
1807 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1808 and the rest are zeros. */
1811 build_low_bits_mask (tree type
, unsigned bits
)
1813 gcc_assert (bits
<= TYPE_PRECISION (type
));
1815 return wide_int_to_tree (type
, wi::mask (bits
, false,
1816 TYPE_PRECISION (type
)));
1819 /* Checks that X is integer constant that can be expressed in (unsigned)
1820 HOST_WIDE_INT without loss of precision. */
1823 cst_and_fits_in_hwi (const_tree x
)
1825 return (TREE_CODE (x
) == INTEGER_CST
1826 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1829 /* Build a newly constructed VECTOR_CST with the given values of
1830 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1833 make_vector (unsigned log2_npatterns
,
1834 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1836 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1838 unsigned npatterns
= 1 << log2_npatterns
;
1839 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1840 unsigned length
= (sizeof (struct tree_vector
)
1841 + (encoded_nelts
- 1) * sizeof (tree
));
1843 record_node_allocation_statistics (VECTOR_CST
, length
);
1845 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1847 TREE_SET_CODE (t
, VECTOR_CST
);
1848 TREE_CONSTANT (t
) = 1;
1849 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1850 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1855 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1856 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1859 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1861 if (vec_safe_length (v
) == 0)
1862 return build_zero_cst (type
);
1864 unsigned HOST_WIDE_INT idx
, nelts
;
1867 /* We can't construct a VECTOR_CST for a variable number of elements. */
1868 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1869 tree_vector_builder
vec (type
, nelts
, 1);
1870 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1872 if (TREE_CODE (value
) == VECTOR_CST
)
1874 /* If NELTS is constant then this must be too. */
1875 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1876 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1877 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1880 vec
.quick_push (value
);
1882 while (vec
.length () < nelts
)
1883 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1885 return vec
.build ();
1888 /* Build a vector of type VECTYPE where all the elements are SCs. */
1890 build_vector_from_val (tree vectype
, tree sc
)
1892 unsigned HOST_WIDE_INT i
, nunits
;
1894 if (sc
== error_mark_node
)
1897 /* Verify that the vector type is suitable for SC. Note that there
1898 is some inconsistency in the type-system with respect to restrict
1899 qualifications of pointers. Vector types always have a main-variant
1900 element type and the qualification is applied to the vector-type.
1901 So TREE_TYPE (vector-type) does not return a properly qualified
1902 vector element-type. */
1903 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1904 TREE_TYPE (vectype
)));
1906 if (CONSTANT_CLASS_P (sc
))
1908 tree_vector_builder
v (vectype
, 1, 1);
1912 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1913 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1916 vec
<constructor_elt
, va_gc
> *v
;
1917 vec_alloc (v
, nunits
);
1918 for (i
= 0; i
< nunits
; ++i
)
1919 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1920 return build_constructor (vectype
, v
);
1924 /* If TYPE is not a vector type, just return SC, otherwise return
1925 build_vector_from_val (TYPE, SC). */
1928 build_uniform_cst (tree type
, tree sc
)
1930 if (!VECTOR_TYPE_P (type
))
1933 return build_vector_from_val (type
, sc
);
1936 /* Build a vector series of type TYPE in which element I has the value
1937 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1938 and a VEC_SERIES_EXPR otherwise. */
1941 build_vec_series (tree type
, tree base
, tree step
)
1943 if (integer_zerop (step
))
1944 return build_vector_from_val (type
, base
);
1945 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1947 tree_vector_builder
builder (type
, 1, 3);
1948 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1949 wi::to_wide (base
) + wi::to_wide (step
));
1950 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1951 wi::to_wide (elt1
) + wi::to_wide (step
));
1952 builder
.quick_push (base
);
1953 builder
.quick_push (elt1
);
1954 builder
.quick_push (elt2
);
1955 return builder
.build ();
1957 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1960 /* Return a vector with the same number of units and number of bits
1961 as VEC_TYPE, but in which the elements are a linear series of unsigned
1962 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1965 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1967 tree index_vec_type
= vec_type
;
1968 tree index_elt_type
= TREE_TYPE (vec_type
);
1969 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1970 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1972 index_elt_type
= build_nonstandard_integer_type
1973 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1974 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1977 tree_vector_builder
v (index_vec_type
, 1, 3);
1978 for (unsigned int i
= 0; i
< 3; ++i
)
1979 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1983 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
1984 elements are A and the rest are B. */
1987 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
1989 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
1990 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
1991 /* Optimize the constant case. */
1992 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
1994 tree_vector_builder
builder (vec_type
, count
, 2);
1995 for (unsigned int i
= 0; i
< count
* 2; ++i
)
1996 builder
.quick_push (i
< num_a
? a
: b
);
1997 return builder
.build ();
2000 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2001 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2004 recompute_constructor_flags (tree c
)
2008 bool constant_p
= true;
2009 bool side_effects_p
= false;
2010 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2012 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2014 /* Mostly ctors will have elts that don't have side-effects, so
2015 the usual case is to scan all the elements. Hence a single
2016 loop for both const and side effects, rather than one loop
2017 each (with early outs). */
2018 if (!TREE_CONSTANT (val
))
2020 if (TREE_SIDE_EFFECTS (val
))
2021 side_effects_p
= true;
2024 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2025 TREE_CONSTANT (c
) = constant_p
;
2028 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2032 verify_constructor_flags (tree c
)
2036 bool constant_p
= TREE_CONSTANT (c
);
2037 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2038 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2040 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2042 if (constant_p
&& !TREE_CONSTANT (val
))
2043 internal_error ("non-constant element in constant CONSTRUCTOR");
2044 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2045 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2049 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2050 are in the vec pointed to by VALS. */
2052 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2054 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2056 TREE_TYPE (c
) = type
;
2057 CONSTRUCTOR_ELTS (c
) = vals
;
2059 recompute_constructor_flags (c
);
2064 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2067 build_constructor_single (tree type
, tree index
, tree value
)
2069 vec
<constructor_elt
, va_gc
> *v
;
2070 constructor_elt elt
= {index
, value
};
2073 v
->quick_push (elt
);
2075 return build_constructor (type
, v
);
2079 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2080 are in a list pointed to by VALS. */
2082 build_constructor_from_list (tree type
, tree vals
)
2085 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2089 vec_alloc (v
, list_length (vals
));
2090 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2091 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2094 return build_constructor (type
, v
);
2097 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2098 of elements, provided as index/value pairs. */
2101 build_constructor_va (tree type
, int nelts
, ...)
2103 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2106 va_start (p
, nelts
);
2107 vec_alloc (v
, nelts
);
2110 tree index
= va_arg (p
, tree
);
2111 tree value
= va_arg (p
, tree
);
2112 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2115 return build_constructor (type
, v
);
2118 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2121 build_clobber (tree type
)
2123 tree clobber
= build_constructor (type
, NULL
);
2124 TREE_THIS_VOLATILE (clobber
) = true;
2128 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2131 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2134 FIXED_VALUE_TYPE
*fp
;
2136 v
= make_node (FIXED_CST
);
2137 fp
= ggc_alloc
<fixed_value
> ();
2138 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2140 TREE_TYPE (v
) = type
;
2141 TREE_FIXED_CST_PTR (v
) = fp
;
2145 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2148 build_real (tree type
, REAL_VALUE_TYPE d
)
2151 REAL_VALUE_TYPE
*dp
;
2154 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2155 Consider doing it via real_convert now. */
2157 v
= make_node (REAL_CST
);
2158 dp
= ggc_alloc
<real_value
> ();
2159 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2161 TREE_TYPE (v
) = type
;
2162 TREE_REAL_CST_PTR (v
) = dp
;
2163 TREE_OVERFLOW (v
) = overflow
;
2167 /* Like build_real, but first truncate D to the type. */
2170 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2172 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2175 /* Return a new REAL_CST node whose type is TYPE
2176 and whose value is the integer value of the INTEGER_CST node I. */
2179 real_value_from_int_cst (const_tree type
, const_tree i
)
2183 /* Clear all bits of the real value type so that we can later do
2184 bitwise comparisons to see if two values are the same. */
2185 memset (&d
, 0, sizeof d
);
2187 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2188 TYPE_SIGN (TREE_TYPE (i
)));
2192 /* Given a tree representing an integer constant I, return a tree
2193 representing the same value as a floating-point constant of type TYPE. */
2196 build_real_from_int_cst (tree type
, const_tree i
)
2199 int overflow
= TREE_OVERFLOW (i
);
2201 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2203 TREE_OVERFLOW (v
) |= overflow
;
2207 /* Return a newly constructed STRING_CST node whose value is
2208 the LEN characters at STR.
2209 Note that for a C string literal, LEN should include the trailing NUL.
2210 The TREE_TYPE is not initialized. */
2213 build_string (int len
, const char *str
)
2218 /* Do not waste bytes provided by padding of struct tree_string. */
2219 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2221 record_node_allocation_statistics (STRING_CST
, length
);
2223 s
= (tree
) ggc_internal_alloc (length
);
2225 memset (s
, 0, sizeof (struct tree_typed
));
2226 TREE_SET_CODE (s
, STRING_CST
);
2227 TREE_CONSTANT (s
) = 1;
2228 TREE_STRING_LENGTH (s
) = len
;
2229 memcpy (s
->string
.str
, str
, len
);
2230 s
->string
.str
[len
] = '\0';
2235 /* Return a newly constructed COMPLEX_CST node whose value is
2236 specified by the real and imaginary parts REAL and IMAG.
2237 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2238 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2241 build_complex (tree type
, tree real
, tree imag
)
2243 gcc_assert (CONSTANT_CLASS_P (real
));
2244 gcc_assert (CONSTANT_CLASS_P (imag
));
2246 tree t
= make_node (COMPLEX_CST
);
2248 TREE_REALPART (t
) = real
;
2249 TREE_IMAGPART (t
) = imag
;
2250 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2251 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2255 /* Build a complex (inf +- 0i), such as for the result of cproj.
2256 TYPE is the complex tree type of the result. If NEG is true, the
2257 imaginary zero is negative. */
2260 build_complex_inf (tree type
, bool neg
)
2262 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2266 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2267 build_real (TREE_TYPE (type
), rzero
));
2270 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2271 element is set to 1. In particular, this is 1 + i for complex types. */
2274 build_each_one_cst (tree type
)
2276 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2278 tree scalar
= build_one_cst (TREE_TYPE (type
));
2279 return build_complex (type
, scalar
, scalar
);
2282 return build_one_cst (type
);
2285 /* Return a constant of arithmetic type TYPE which is the
2286 multiplicative identity of the set TYPE. */
2289 build_one_cst (tree type
)
2291 switch (TREE_CODE (type
))
2293 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2294 case POINTER_TYPE
: case REFERENCE_TYPE
:
2296 return build_int_cst (type
, 1);
2299 return build_real (type
, dconst1
);
2301 case FIXED_POINT_TYPE
:
2302 /* We can only generate 1 for accum types. */
2303 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2304 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2308 tree scalar
= build_one_cst (TREE_TYPE (type
));
2310 return build_vector_from_val (type
, scalar
);
2314 return build_complex (type
,
2315 build_one_cst (TREE_TYPE (type
)),
2316 build_zero_cst (TREE_TYPE (type
)));
2323 /* Return an integer of type TYPE containing all 1's in as much precision as
2324 it contains, or a complex or vector whose subparts are such integers. */
2327 build_all_ones_cst (tree type
)
2329 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2331 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2332 return build_complex (type
, scalar
, scalar
);
2335 return build_minus_one_cst (type
);
2338 /* Return a constant of arithmetic type TYPE which is the
2339 opposite of the multiplicative identity of the set TYPE. */
2342 build_minus_one_cst (tree type
)
2344 switch (TREE_CODE (type
))
2346 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2347 case POINTER_TYPE
: case REFERENCE_TYPE
:
2349 return build_int_cst (type
, -1);
2352 return build_real (type
, dconstm1
);
2354 case FIXED_POINT_TYPE
:
2355 /* We can only generate 1 for accum types. */
2356 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2357 return build_fixed (type
,
2358 fixed_from_double_int (double_int_minus_one
,
2359 SCALAR_TYPE_MODE (type
)));
2363 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2365 return build_vector_from_val (type
, scalar
);
2369 return build_complex (type
,
2370 build_minus_one_cst (TREE_TYPE (type
)),
2371 build_zero_cst (TREE_TYPE (type
)));
2378 /* Build 0 constant of type TYPE. This is used by constructor folding
2379 and thus the constant should be represented in memory by
2383 build_zero_cst (tree type
)
2385 switch (TREE_CODE (type
))
2387 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2388 case POINTER_TYPE
: case REFERENCE_TYPE
:
2389 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2390 return build_int_cst (type
, 0);
2393 return build_real (type
, dconst0
);
2395 case FIXED_POINT_TYPE
:
2396 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2400 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2402 return build_vector_from_val (type
, scalar
);
2407 tree zero
= build_zero_cst (TREE_TYPE (type
));
2409 return build_complex (type
, zero
, zero
);
2413 if (!AGGREGATE_TYPE_P (type
))
2414 return fold_convert (type
, integer_zero_node
);
2415 return build_constructor (type
, NULL
);
2420 /* Build a BINFO with LEN language slots. */
2423 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2426 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2427 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2429 record_node_allocation_statistics (TREE_BINFO
, length
);
2431 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2433 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2435 TREE_SET_CODE (t
, TREE_BINFO
);
2437 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2442 /* Create a CASE_LABEL_EXPR tree node and return it. */
2445 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2447 tree t
= make_node (CASE_LABEL_EXPR
);
2449 TREE_TYPE (t
) = void_type_node
;
2450 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2452 CASE_LOW (t
) = low_value
;
2453 CASE_HIGH (t
) = high_value
;
2454 CASE_LABEL (t
) = label_decl
;
2455 CASE_CHAIN (t
) = NULL_TREE
;
2460 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2461 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2462 The latter determines the length of the HOST_WIDE_INT vector. */
2465 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2468 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2469 + sizeof (struct tree_int_cst
));
2472 record_node_allocation_statistics (INTEGER_CST
, length
);
2474 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2476 TREE_SET_CODE (t
, INTEGER_CST
);
2477 TREE_INT_CST_NUNITS (t
) = len
;
2478 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2479 /* to_offset can only be applied to trees that are offset_int-sized
2480 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2481 must be exactly the precision of offset_int and so LEN is correct. */
2482 if (ext_len
<= OFFSET_INT_ELTS
)
2483 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2485 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2487 TREE_CONSTANT (t
) = 1;
2492 /* Build a newly constructed TREE_VEC node of length LEN. */
2495 make_tree_vec (int len MEM_STAT_DECL
)
2498 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2500 record_node_allocation_statistics (TREE_VEC
, length
);
2502 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2504 TREE_SET_CODE (t
, TREE_VEC
);
2505 TREE_VEC_LENGTH (t
) = len
;
2510 /* Grow a TREE_VEC node to new length LEN. */
2513 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2515 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2517 int oldlen
= TREE_VEC_LENGTH (v
);
2518 gcc_assert (len
> oldlen
);
2520 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2521 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2523 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2525 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2527 TREE_VEC_LENGTH (v
) = len
;
2532 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2533 fixed, and scalar, complex or vector. */
2536 zerop (const_tree expr
)
2538 return (integer_zerop (expr
)
2539 || real_zerop (expr
)
2540 || fixed_zerop (expr
));
2543 /* Return 1 if EXPR is the integer constant zero or a complex constant
2544 of zero, or a location wrapper for such a constant. */
2547 integer_zerop (const_tree expr
)
2549 STRIP_ANY_LOCATION_WRAPPER (expr
);
2551 switch (TREE_CODE (expr
))
2554 return wi::to_wide (expr
) == 0;
2556 return (integer_zerop (TREE_REALPART (expr
))
2557 && integer_zerop (TREE_IMAGPART (expr
)));
2559 return (VECTOR_CST_NPATTERNS (expr
) == 1
2560 && VECTOR_CST_DUPLICATE_P (expr
)
2561 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2567 /* Return 1 if EXPR is the integer constant one or the corresponding
2568 complex constant, or a location wrapper for such a constant. */
2571 integer_onep (const_tree expr
)
2573 STRIP_ANY_LOCATION_WRAPPER (expr
);
2575 switch (TREE_CODE (expr
))
2578 return wi::eq_p (wi::to_widest (expr
), 1);
2580 return (integer_onep (TREE_REALPART (expr
))
2581 && integer_zerop (TREE_IMAGPART (expr
)));
2583 return (VECTOR_CST_NPATTERNS (expr
) == 1
2584 && VECTOR_CST_DUPLICATE_P (expr
)
2585 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2591 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2592 return 1 if every piece is the integer constant one.
2593 Also return 1 for location wrappers for such a constant. */
2596 integer_each_onep (const_tree expr
)
2598 STRIP_ANY_LOCATION_WRAPPER (expr
);
2600 if (TREE_CODE (expr
) == COMPLEX_CST
)
2601 return (integer_onep (TREE_REALPART (expr
))
2602 && integer_onep (TREE_IMAGPART (expr
)));
2604 return integer_onep (expr
);
2607 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2608 it contains, or a complex or vector whose subparts are such integers,
2609 or a location wrapper for such a constant. */
2612 integer_all_onesp (const_tree expr
)
2614 STRIP_ANY_LOCATION_WRAPPER (expr
);
2616 if (TREE_CODE (expr
) == COMPLEX_CST
2617 && integer_all_onesp (TREE_REALPART (expr
))
2618 && integer_all_onesp (TREE_IMAGPART (expr
)))
2621 else if (TREE_CODE (expr
) == VECTOR_CST
)
2622 return (VECTOR_CST_NPATTERNS (expr
) == 1
2623 && VECTOR_CST_DUPLICATE_P (expr
)
2624 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2626 else if (TREE_CODE (expr
) != INTEGER_CST
)
2629 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2630 == wi::to_wide (expr
));
2633 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2634 for such a constant. */
2637 integer_minus_onep (const_tree expr
)
2639 STRIP_ANY_LOCATION_WRAPPER (expr
);
2641 if (TREE_CODE (expr
) == COMPLEX_CST
)
2642 return (integer_all_onesp (TREE_REALPART (expr
))
2643 && integer_zerop (TREE_IMAGPART (expr
)));
2645 return integer_all_onesp (expr
);
2648 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2649 one bit on), or a location wrapper for such a constant. */
2652 integer_pow2p (const_tree expr
)
2654 STRIP_ANY_LOCATION_WRAPPER (expr
);
2656 if (TREE_CODE (expr
) == COMPLEX_CST
2657 && integer_pow2p (TREE_REALPART (expr
))
2658 && integer_zerop (TREE_IMAGPART (expr
)))
2661 if (TREE_CODE (expr
) != INTEGER_CST
)
2664 return wi::popcount (wi::to_wide (expr
)) == 1;
2667 /* Return 1 if EXPR is an integer constant other than zero or a
2668 complex constant other than zero, or a location wrapper for such a
2672 integer_nonzerop (const_tree expr
)
2674 STRIP_ANY_LOCATION_WRAPPER (expr
);
2676 return ((TREE_CODE (expr
) == INTEGER_CST
2677 && wi::to_wide (expr
) != 0)
2678 || (TREE_CODE (expr
) == COMPLEX_CST
2679 && (integer_nonzerop (TREE_REALPART (expr
))
2680 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2683 /* Return 1 if EXPR is the integer constant one. For vector,
2684 return 1 if every piece is the integer constant minus one
2685 (representing the value TRUE).
2686 Also return 1 for location wrappers for such a constant. */
2689 integer_truep (const_tree expr
)
2691 STRIP_ANY_LOCATION_WRAPPER (expr
);
2693 if (TREE_CODE (expr
) == VECTOR_CST
)
2694 return integer_all_onesp (expr
);
2695 return integer_onep (expr
);
2698 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2699 for such a constant. */
2702 fixed_zerop (const_tree expr
)
2704 STRIP_ANY_LOCATION_WRAPPER (expr
);
2706 return (TREE_CODE (expr
) == FIXED_CST
2707 && TREE_FIXED_CST (expr
).data
.is_zero ());
2710 /* Return the power of two represented by a tree node known to be a
2714 tree_log2 (const_tree expr
)
2716 if (TREE_CODE (expr
) == COMPLEX_CST
)
2717 return tree_log2 (TREE_REALPART (expr
));
2719 return wi::exact_log2 (wi::to_wide (expr
));
2722 /* Similar, but return the largest integer Y such that 2 ** Y is less
2723 than or equal to EXPR. */
2726 tree_floor_log2 (const_tree expr
)
2728 if (TREE_CODE (expr
) == COMPLEX_CST
)
2729 return tree_log2 (TREE_REALPART (expr
));
2731 return wi::floor_log2 (wi::to_wide (expr
));
2734 /* Return number of known trailing zero bits in EXPR, or, if the value of
2735 EXPR is known to be zero, the precision of it's type. */
2738 tree_ctz (const_tree expr
)
2740 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2741 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2744 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2745 switch (TREE_CODE (expr
))
2748 ret1
= wi::ctz (wi::to_wide (expr
));
2749 return MIN (ret1
, prec
);
2751 ret1
= wi::ctz (get_nonzero_bits (expr
));
2752 return MIN (ret1
, prec
);
2759 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2762 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2763 return MIN (ret1
, ret2
);
2764 case POINTER_PLUS_EXPR
:
2765 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2766 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2767 /* Second operand is sizetype, which could be in theory
2768 wider than pointer's precision. Make sure we never
2769 return more than prec. */
2770 ret2
= MIN (ret2
, prec
);
2771 return MIN (ret1
, ret2
);
2773 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2774 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2775 return MAX (ret1
, ret2
);
2777 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2778 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2779 return MIN (ret1
+ ret2
, prec
);
2781 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2782 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2783 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2785 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2786 return MIN (ret1
+ ret2
, prec
);
2790 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2791 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2793 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2794 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2799 case TRUNC_DIV_EXPR
:
2801 case FLOOR_DIV_EXPR
:
2802 case ROUND_DIV_EXPR
:
2803 case EXACT_DIV_EXPR
:
2804 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2805 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2807 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2810 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2818 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2819 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2821 return MIN (ret1
, prec
);
2823 return tree_ctz (TREE_OPERAND (expr
, 0));
2825 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2828 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2829 return MIN (ret1
, ret2
);
2831 return tree_ctz (TREE_OPERAND (expr
, 1));
2833 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2834 if (ret1
> BITS_PER_UNIT
)
2836 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2837 return MIN (ret1
, prec
);
2845 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2846 decimal float constants, so don't return 1 for them.
2847 Also return 1 for location wrappers around such a constant. */
2850 real_zerop (const_tree expr
)
2852 STRIP_ANY_LOCATION_WRAPPER (expr
);
2854 switch (TREE_CODE (expr
))
2857 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2858 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2860 return real_zerop (TREE_REALPART (expr
))
2861 && real_zerop (TREE_IMAGPART (expr
));
2864 /* Don't simply check for a duplicate because the predicate
2865 accepts both +0.0 and -0.0. */
2866 unsigned count
= vector_cst_encoded_nelts (expr
);
2867 for (unsigned int i
= 0; i
< count
; ++i
)
2868 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2877 /* Return 1 if EXPR is the real constant one in real or complex form.
2878 Trailing zeroes matter for decimal float constants, so don't return
2880 Also return 1 for location wrappers around such a constant. */
2883 real_onep (const_tree expr
)
2885 STRIP_ANY_LOCATION_WRAPPER (expr
);
2887 switch (TREE_CODE (expr
))
2890 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2891 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2893 return real_onep (TREE_REALPART (expr
))
2894 && real_zerop (TREE_IMAGPART (expr
));
2896 return (VECTOR_CST_NPATTERNS (expr
) == 1
2897 && VECTOR_CST_DUPLICATE_P (expr
)
2898 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2904 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2905 matter for decimal float constants, so don't return 1 for them.
2906 Also return 1 for location wrappers around such a constant. */
2909 real_minus_onep (const_tree expr
)
2911 STRIP_ANY_LOCATION_WRAPPER (expr
);
2913 switch (TREE_CODE (expr
))
2916 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2917 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2919 return real_minus_onep (TREE_REALPART (expr
))
2920 && real_zerop (TREE_IMAGPART (expr
));
2922 return (VECTOR_CST_NPATTERNS (expr
) == 1
2923 && VECTOR_CST_DUPLICATE_P (expr
)
2924 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2930 /* Nonzero if EXP is a constant or a cast of a constant. */
2933 really_constant_p (const_tree exp
)
2935 /* This is not quite the same as STRIP_NOPS. It does more. */
2936 while (CONVERT_EXPR_P (exp
)
2937 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2938 exp
= TREE_OPERAND (exp
, 0);
2939 return TREE_CONSTANT (exp
);
2942 /* Return true if T holds a polynomial pointer difference, storing it in
2943 *VALUE if so. A true return means that T's precision is no greater
2944 than 64 bits, which is the largest address space we support, so *VALUE
2945 never loses precision. However, the signedness of the result does
2946 not necessarily match the signedness of T: sometimes an unsigned type
2947 like sizetype is used to encode a value that is actually negative. */
2950 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2954 if (TREE_CODE (t
) == INTEGER_CST
)
2956 if (!cst_and_fits_in_hwi (t
))
2958 *value
= int_cst_value (t
);
2961 if (POLY_INT_CST_P (t
))
2963 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2964 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2966 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2967 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2974 tree_to_poly_int64 (const_tree t
)
2976 gcc_assert (tree_fits_poly_int64_p (t
));
2977 if (POLY_INT_CST_P (t
))
2978 return poly_int_cst_value (t
).force_shwi ();
2979 return TREE_INT_CST_LOW (t
);
2983 tree_to_poly_uint64 (const_tree t
)
2985 gcc_assert (tree_fits_poly_uint64_p (t
));
2986 if (POLY_INT_CST_P (t
))
2987 return poly_int_cst_value (t
).force_uhwi ();
2988 return TREE_INT_CST_LOW (t
);
2991 /* Return first list element whose TREE_VALUE is ELEM.
2992 Return 0 if ELEM is not in LIST. */
2995 value_member (tree elem
, tree list
)
2999 if (elem
== TREE_VALUE (list
))
3001 list
= TREE_CHAIN (list
);
3006 /* Return first list element whose TREE_PURPOSE is ELEM.
3007 Return 0 if ELEM is not in LIST. */
3010 purpose_member (const_tree elem
, tree list
)
3014 if (elem
== TREE_PURPOSE (list
))
3016 list
= TREE_CHAIN (list
);
3021 /* Return true if ELEM is in V. */
3024 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3028 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3034 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3038 chain_index (int idx
, tree chain
)
3040 for (; chain
&& idx
> 0; --idx
)
3041 chain
= TREE_CHAIN (chain
);
3045 /* Return nonzero if ELEM is part of the chain CHAIN. */
3048 chain_member (const_tree elem
, const_tree chain
)
3054 chain
= DECL_CHAIN (chain
);
3060 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3061 We expect a null pointer to mark the end of the chain.
3062 This is the Lisp primitive `length'. */
3065 list_length (const_tree t
)
3068 #ifdef ENABLE_TREE_CHECKING
3076 #ifdef ENABLE_TREE_CHECKING
3079 gcc_assert (p
!= q
);
3087 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3088 UNION_TYPE TYPE, or NULL_TREE if none. */
3091 first_field (const_tree type
)
3093 tree t
= TYPE_FIELDS (type
);
3094 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3099 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3100 UNION_TYPE TYPE, or NULL_TREE if none. */
3103 last_field (const_tree type
)
3105 tree last
= NULL_TREE
;
3107 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3109 if (TREE_CODE (fld
) != FIELD_DECL
)
3118 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3119 by modifying the last node in chain 1 to point to chain 2.
3120 This is the Lisp primitive `nconc'. */
3123 chainon (tree op1
, tree op2
)
3132 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3134 TREE_CHAIN (t1
) = op2
;
3136 #ifdef ENABLE_TREE_CHECKING
3139 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3140 gcc_assert (t2
!= t1
);
3147 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3150 tree_last (tree chain
)
3154 while ((next
= TREE_CHAIN (chain
)))
3159 /* Reverse the order of elements in the chain T,
3160 and return the new head of the chain (old last element). */
3165 tree prev
= 0, decl
, next
;
3166 for (decl
= t
; decl
; decl
= next
)
3168 /* We shouldn't be using this function to reverse BLOCK chains; we
3169 have blocks_nreverse for that. */
3170 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3171 next
= TREE_CHAIN (decl
);
3172 TREE_CHAIN (decl
) = prev
;
3178 /* Return a newly created TREE_LIST node whose
3179 purpose and value fields are PARM and VALUE. */
3182 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3184 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3185 TREE_PURPOSE (t
) = parm
;
3186 TREE_VALUE (t
) = value
;
3190 /* Build a chain of TREE_LIST nodes from a vector. */
3193 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3195 tree ret
= NULL_TREE
;
3199 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3201 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3202 pp
= &TREE_CHAIN (*pp
);
3207 /* Return a newly created TREE_LIST node whose
3208 purpose and value fields are PURPOSE and VALUE
3209 and whose TREE_CHAIN is CHAIN. */
3212 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3216 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3217 memset (node
, 0, sizeof (struct tree_common
));
3219 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3221 TREE_SET_CODE (node
, TREE_LIST
);
3222 TREE_CHAIN (node
) = chain
;
3223 TREE_PURPOSE (node
) = purpose
;
3224 TREE_VALUE (node
) = value
;
3228 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3232 ctor_to_vec (tree ctor
)
3234 vec
<tree
, va_gc
> *vec
;
3235 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3239 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3240 vec
->quick_push (val
);
3245 /* Return the size nominally occupied by an object of type TYPE
3246 when it resides in memory. The value is measured in units of bytes,
3247 and its data type is that normally used for type sizes
3248 (which is the first type created by make_signed_type or
3249 make_unsigned_type). */
3252 size_in_bytes_loc (location_t loc
, const_tree type
)
3256 if (type
== error_mark_node
)
3257 return integer_zero_node
;
3259 type
= TYPE_MAIN_VARIANT (type
);
3260 t
= TYPE_SIZE_UNIT (type
);
3264 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3265 return size_zero_node
;
3271 /* Return the size of TYPE (in bytes) as a wide integer
3272 or return -1 if the size can vary or is larger than an integer. */
3275 int_size_in_bytes (const_tree type
)
3279 if (type
== error_mark_node
)
3282 type
= TYPE_MAIN_VARIANT (type
);
3283 t
= TYPE_SIZE_UNIT (type
);
3285 if (t
&& tree_fits_uhwi_p (t
))
3286 return TREE_INT_CST_LOW (t
);
3291 /* Return the maximum size of TYPE (in bytes) as a wide integer
3292 or return -1 if the size can vary or is larger than an integer. */
3295 max_int_size_in_bytes (const_tree type
)
3297 HOST_WIDE_INT size
= -1;
3300 /* If this is an array type, check for a possible MAX_SIZE attached. */
3302 if (TREE_CODE (type
) == ARRAY_TYPE
)
3304 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3306 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3307 size
= tree_to_uhwi (size_tree
);
3310 /* If we still haven't been able to get a size, see if the language
3311 can compute a maximum size. */
3315 size_tree
= lang_hooks
.types
.max_size (type
);
3317 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3318 size
= tree_to_uhwi (size_tree
);
3324 /* Return the bit position of FIELD, in bits from the start of the record.
3325 This is a tree of type bitsizetype. */
3328 bit_position (const_tree field
)
3330 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3331 DECL_FIELD_BIT_OFFSET (field
));
3334 /* Return the byte position of FIELD, in bytes from the start of the record.
3335 This is a tree of type sizetype. */
3338 byte_position (const_tree field
)
3340 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3341 DECL_FIELD_BIT_OFFSET (field
));
3344 /* Likewise, but return as an integer. It must be representable in
3345 that way (since it could be a signed value, we don't have the
3346 option of returning -1 like int_size_in_byte can. */
3349 int_byte_position (const_tree field
)
3351 return tree_to_shwi (byte_position (field
));
3354 /* Return, as a tree node, the number of elements for TYPE (which is an
3355 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3358 array_type_nelts (const_tree type
)
3360 tree index_type
, min
, max
;
3362 /* If they did it with unspecified bounds, then we should have already
3363 given an error about it before we got here. */
3364 if (! TYPE_DOMAIN (type
))
3365 return error_mark_node
;
3367 index_type
= TYPE_DOMAIN (type
);
3368 min
= TYPE_MIN_VALUE (index_type
);
3369 max
= TYPE_MAX_VALUE (index_type
);
3371 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3373 return error_mark_node
;
3375 return (integer_zerop (min
)
3377 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3380 /* If arg is static -- a reference to an object in static storage -- then
3381 return the object. This is not the same as the C meaning of `static'.
3382 If arg isn't static, return NULL. */
3387 switch (TREE_CODE (arg
))
3390 /* Nested functions are static, even though taking their address will
3391 involve a trampoline as we unnest the nested function and create
3392 the trampoline on the tree level. */
3396 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3397 && ! DECL_THREAD_LOCAL_P (arg
)
3398 && ! DECL_DLLIMPORT_P (arg
)
3402 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3406 return TREE_STATIC (arg
) ? arg
: NULL
;
3413 /* If the thing being referenced is not a field, then it is
3414 something language specific. */
3415 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3417 /* If we are referencing a bitfield, we can't evaluate an
3418 ADDR_EXPR at compile time and so it isn't a constant. */
3419 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3422 return staticp (TREE_OPERAND (arg
, 0));
3428 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3431 case ARRAY_RANGE_REF
:
3432 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3433 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3434 return staticp (TREE_OPERAND (arg
, 0));
3438 case COMPOUND_LITERAL_EXPR
:
3439 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3449 /* Return whether OP is a DECL whose address is function-invariant. */
3452 decl_address_invariant_p (const_tree op
)
3454 /* The conditions below are slightly less strict than the one in
3457 switch (TREE_CODE (op
))
3466 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3467 || DECL_THREAD_LOCAL_P (op
)
3468 || DECL_CONTEXT (op
) == current_function_decl
3469 || decl_function_context (op
) == current_function_decl
)
3474 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3475 || decl_function_context (op
) == current_function_decl
)
3486 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3489 decl_address_ip_invariant_p (const_tree op
)
3491 /* The conditions below are slightly less strict than the one in
3494 switch (TREE_CODE (op
))
3502 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3503 && !DECL_DLLIMPORT_P (op
))
3504 || DECL_THREAD_LOCAL_P (op
))
3509 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3521 /* Return true if T is function-invariant (internal function, does
3522 not handle arithmetic; that's handled in skip_simple_arithmetic and
3523 tree_invariant_p). */
3526 tree_invariant_p_1 (tree t
)
3530 if (TREE_CONSTANT (t
)
3531 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3534 switch (TREE_CODE (t
))
3540 op
= TREE_OPERAND (t
, 0);
3541 while (handled_component_p (op
))
3543 switch (TREE_CODE (op
))
3546 case ARRAY_RANGE_REF
:
3547 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3548 || TREE_OPERAND (op
, 2) != NULL_TREE
3549 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3554 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3560 op
= TREE_OPERAND (op
, 0);
3563 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3572 /* Return true if T is function-invariant. */
3575 tree_invariant_p (tree t
)
3577 tree inner
= skip_simple_arithmetic (t
);
3578 return tree_invariant_p_1 (inner
);
3581 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3582 Do this to any expression which may be used in more than one place,
3583 but must be evaluated only once.
3585 Normally, expand_expr would reevaluate the expression each time.
3586 Calling save_expr produces something that is evaluated and recorded
3587 the first time expand_expr is called on it. Subsequent calls to
3588 expand_expr just reuse the recorded value.
3590 The call to expand_expr that generates code that actually computes
3591 the value is the first call *at compile time*. Subsequent calls
3592 *at compile time* generate code to use the saved value.
3593 This produces correct result provided that *at run time* control
3594 always flows through the insns made by the first expand_expr
3595 before reaching the other places where the save_expr was evaluated.
3596 You, the caller of save_expr, must make sure this is so.
3598 Constants, and certain read-only nodes, are returned with no
3599 SAVE_EXPR because that is safe. Expressions containing placeholders
3600 are not touched; see tree.def for an explanation of what these
3604 save_expr (tree expr
)
3608 /* If the tree evaluates to a constant, then we don't want to hide that
3609 fact (i.e. this allows further folding, and direct checks for constants).
3610 However, a read-only object that has side effects cannot be bypassed.
3611 Since it is no problem to reevaluate literals, we just return the
3613 inner
= skip_simple_arithmetic (expr
);
3614 if (TREE_CODE (inner
) == ERROR_MARK
)
3617 if (tree_invariant_p_1 (inner
))
3620 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3621 it means that the size or offset of some field of an object depends on
3622 the value within another field.
3624 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3625 and some variable since it would then need to be both evaluated once and
3626 evaluated more than once. Front-ends must assure this case cannot
3627 happen by surrounding any such subexpressions in their own SAVE_EXPR
3628 and forcing evaluation at the proper time. */
3629 if (contains_placeholder_p (inner
))
3632 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3634 /* This expression might be placed ahead of a jump to ensure that the
3635 value was computed on both sides of the jump. So make sure it isn't
3636 eliminated as dead. */
3637 TREE_SIDE_EFFECTS (expr
) = 1;
3641 /* Look inside EXPR into any simple arithmetic operations. Return the
3642 outermost non-arithmetic or non-invariant node. */
3645 skip_simple_arithmetic (tree expr
)
3647 /* We don't care about whether this can be used as an lvalue in this
3649 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3650 expr
= TREE_OPERAND (expr
, 0);
3652 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3653 a constant, it will be more efficient to not make another SAVE_EXPR since
3654 it will allow better simplification and GCSE will be able to merge the
3655 computations if they actually occur. */
3658 if (UNARY_CLASS_P (expr
))
3659 expr
= TREE_OPERAND (expr
, 0);
3660 else if (BINARY_CLASS_P (expr
))
3662 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3663 expr
= TREE_OPERAND (expr
, 0);
3664 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3665 expr
= TREE_OPERAND (expr
, 1);
3676 /* Look inside EXPR into simple arithmetic operations involving constants.
3677 Return the outermost non-arithmetic or non-constant node. */
3680 skip_simple_constant_arithmetic (tree expr
)
3682 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3683 expr
= TREE_OPERAND (expr
, 0);
3687 if (UNARY_CLASS_P (expr
))
3688 expr
= TREE_OPERAND (expr
, 0);
3689 else if (BINARY_CLASS_P (expr
))
3691 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3692 expr
= TREE_OPERAND (expr
, 0);
3693 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3694 expr
= TREE_OPERAND (expr
, 1);
3705 /* Return which tree structure is used by T. */
3707 enum tree_node_structure_enum
3708 tree_node_structure (const_tree t
)
3710 const enum tree_code code
= TREE_CODE (t
);
3711 return tree_node_structure_for_code (code
);
3714 /* Set various status flags when building a CALL_EXPR object T. */
3717 process_call_operands (tree t
)
3719 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3720 bool read_only
= false;
3721 int i
= call_expr_flags (t
);
3723 /* Calls have side-effects, except those to const or pure functions. */
3724 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3725 side_effects
= true;
3726 /* Propagate TREE_READONLY of arguments for const functions. */
3730 if (!side_effects
|| read_only
)
3731 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3733 tree op
= TREE_OPERAND (t
, i
);
3734 if (op
&& TREE_SIDE_EFFECTS (op
))
3735 side_effects
= true;
3736 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3740 TREE_SIDE_EFFECTS (t
) = side_effects
;
3741 TREE_READONLY (t
) = read_only
;
3744 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3745 size or offset that depends on a field within a record. */
3748 contains_placeholder_p (const_tree exp
)
3750 enum tree_code code
;
3755 code
= TREE_CODE (exp
);
3756 if (code
== PLACEHOLDER_EXPR
)
3759 switch (TREE_CODE_CLASS (code
))
3762 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3763 position computations since they will be converted into a
3764 WITH_RECORD_EXPR involving the reference, which will assume
3765 here will be valid. */
3766 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3768 case tcc_exceptional
:
3769 if (code
== TREE_LIST
)
3770 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3771 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3776 case tcc_comparison
:
3777 case tcc_expression
:
3781 /* Ignoring the first operand isn't quite right, but works best. */
3782 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3785 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3786 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3787 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3790 /* The save_expr function never wraps anything containing
3791 a PLACEHOLDER_EXPR. */
3798 switch (TREE_CODE_LENGTH (code
))
3801 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3803 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3804 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3815 const_call_expr_arg_iterator iter
;
3816 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3817 if (CONTAINS_PLACEHOLDER_P (arg
))
3831 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3832 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3836 type_contains_placeholder_1 (const_tree type
)
3838 /* If the size contains a placeholder or the parent type (component type in
3839 the case of arrays) type involves a placeholder, this type does. */
3840 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3841 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3842 || (!POINTER_TYPE_P (type
)
3844 && type_contains_placeholder_p (TREE_TYPE (type
))))
3847 /* Now do type-specific checks. Note that the last part of the check above
3848 greatly limits what we have to do below. */
3849 switch (TREE_CODE (type
))
3857 case REFERENCE_TYPE
:
3866 case FIXED_POINT_TYPE
:
3867 /* Here we just check the bounds. */
3868 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3869 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3872 /* We have already checked the component type above, so just check
3873 the domain type. Flexible array members have a null domain. */
3874 return TYPE_DOMAIN (type
) ?
3875 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3879 case QUAL_UNION_TYPE
:
3883 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3884 if (TREE_CODE (field
) == FIELD_DECL
3885 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3886 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3887 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3888 || type_contains_placeholder_p (TREE_TYPE (field
))))
3899 /* Wrapper around above function used to cache its result. */
3902 type_contains_placeholder_p (tree type
)
3906 /* If the contains_placeholder_bits field has been initialized,
3907 then we know the answer. */
3908 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3909 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3911 /* Indicate that we've seen this type node, and the answer is false.
3912 This is what we want to return if we run into recursion via fields. */
3913 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3915 /* Compute the real value. */
3916 result
= type_contains_placeholder_1 (type
);
3918 /* Store the real value. */
3919 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3924 /* Push tree EXP onto vector QUEUE if it is not already present. */
3927 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3932 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3933 if (simple_cst_equal (iter
, exp
) == 1)
3937 queue
->safe_push (exp
);
3940 /* Given a tree EXP, find all occurrences of references to fields
3941 in a PLACEHOLDER_EXPR and place them in vector REFS without
3942 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3943 we assume here that EXP contains only arithmetic expressions
3944 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3948 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3950 enum tree_code code
= TREE_CODE (exp
);
3954 /* We handle TREE_LIST and COMPONENT_REF separately. */
3955 if (code
== TREE_LIST
)
3957 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3958 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3960 else if (code
== COMPONENT_REF
)
3962 for (inner
= TREE_OPERAND (exp
, 0);
3963 REFERENCE_CLASS_P (inner
);
3964 inner
= TREE_OPERAND (inner
, 0))
3967 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3968 push_without_duplicates (exp
, refs
);
3970 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3973 switch (TREE_CODE_CLASS (code
))
3978 case tcc_declaration
:
3979 /* Variables allocated to static storage can stay. */
3980 if (!TREE_STATIC (exp
))
3981 push_without_duplicates (exp
, refs
);
3984 case tcc_expression
:
3985 /* This is the pattern built in ada/make_aligning_type. */
3986 if (code
== ADDR_EXPR
3987 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3989 push_without_duplicates (exp
, refs
);
3995 case tcc_exceptional
:
3998 case tcc_comparison
:
4000 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4001 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4005 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4006 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4014 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4015 return a tree with all occurrences of references to F in a
4016 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4017 CONST_DECLs. Note that we assume here that EXP contains only
4018 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4019 occurring only in their argument list. */
4022 substitute_in_expr (tree exp
, tree f
, tree r
)
4024 enum tree_code code
= TREE_CODE (exp
);
4025 tree op0
, op1
, op2
, op3
;
4028 /* We handle TREE_LIST and COMPONENT_REF separately. */
4029 if (code
== TREE_LIST
)
4031 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4032 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4033 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4036 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4038 else if (code
== COMPONENT_REF
)
4042 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4043 and it is the right field, replace it with R. */
4044 for (inner
= TREE_OPERAND (exp
, 0);
4045 REFERENCE_CLASS_P (inner
);
4046 inner
= TREE_OPERAND (inner
, 0))
4050 op1
= TREE_OPERAND (exp
, 1);
4052 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4055 /* If this expression hasn't been completed let, leave it alone. */
4056 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4059 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4060 if (op0
== TREE_OPERAND (exp
, 0))
4064 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4067 switch (TREE_CODE_CLASS (code
))
4072 case tcc_declaration
:
4078 case tcc_expression
:
4084 case tcc_exceptional
:
4087 case tcc_comparison
:
4089 switch (TREE_CODE_LENGTH (code
))
4095 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4096 if (op0
== TREE_OPERAND (exp
, 0))
4099 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4103 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4104 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4106 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4109 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4113 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4114 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4115 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4117 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4118 && op2
== TREE_OPERAND (exp
, 2))
4121 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4125 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4126 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4127 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4128 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4130 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4131 && op2
== TREE_OPERAND (exp
, 2)
4132 && op3
== TREE_OPERAND (exp
, 3))
4136 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4148 new_tree
= NULL_TREE
;
4150 /* If we are trying to replace F with a constant or with another
4151 instance of one of the arguments of the call, inline back
4152 functions which do nothing else than computing a value from
4153 the arguments they are passed. This makes it possible to
4154 fold partially or entirely the replacement expression. */
4155 if (code
== CALL_EXPR
)
4157 bool maybe_inline
= false;
4158 if (CONSTANT_CLASS_P (r
))
4159 maybe_inline
= true;
4161 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4162 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4164 maybe_inline
= true;
4169 tree t
= maybe_inline_call_in_expr (exp
);
4171 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4175 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4177 tree op
= TREE_OPERAND (exp
, i
);
4178 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4182 new_tree
= copy_node (exp
);
4183 TREE_OPERAND (new_tree
, i
) = new_op
;
4189 new_tree
= fold (new_tree
);
4190 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4191 process_call_operands (new_tree
);
4202 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4204 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4205 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4210 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4211 for it within OBJ, a tree that is an object or a chain of references. */
4214 substitute_placeholder_in_expr (tree exp
, tree obj
)
4216 enum tree_code code
= TREE_CODE (exp
);
4217 tree op0
, op1
, op2
, op3
;
4220 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4221 in the chain of OBJ. */
4222 if (code
== PLACEHOLDER_EXPR
)
4224 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4227 for (elt
= obj
; elt
!= 0;
4228 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4229 || TREE_CODE (elt
) == COND_EXPR
)
4230 ? TREE_OPERAND (elt
, 1)
4231 : (REFERENCE_CLASS_P (elt
)
4232 || UNARY_CLASS_P (elt
)
4233 || BINARY_CLASS_P (elt
)
4234 || VL_EXP_CLASS_P (elt
)
4235 || EXPRESSION_CLASS_P (elt
))
4236 ? TREE_OPERAND (elt
, 0) : 0))
4237 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4240 for (elt
= obj
; elt
!= 0;
4241 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4242 || TREE_CODE (elt
) == COND_EXPR
)
4243 ? TREE_OPERAND (elt
, 1)
4244 : (REFERENCE_CLASS_P (elt
)
4245 || UNARY_CLASS_P (elt
)
4246 || BINARY_CLASS_P (elt
)
4247 || VL_EXP_CLASS_P (elt
)
4248 || EXPRESSION_CLASS_P (elt
))
4249 ? TREE_OPERAND (elt
, 0) : 0))
4250 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4251 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4253 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4255 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4256 survives until RTL generation, there will be an error. */
4260 /* TREE_LIST is special because we need to look at TREE_VALUE
4261 and TREE_CHAIN, not TREE_OPERANDS. */
4262 else if (code
== TREE_LIST
)
4264 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4265 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4266 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4269 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4272 switch (TREE_CODE_CLASS (code
))
4275 case tcc_declaration
:
4278 case tcc_exceptional
:
4281 case tcc_comparison
:
4282 case tcc_expression
:
4285 switch (TREE_CODE_LENGTH (code
))
4291 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4292 if (op0
== TREE_OPERAND (exp
, 0))
4295 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4299 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4300 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4302 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4305 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4309 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4310 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4311 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4313 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4314 && op2
== TREE_OPERAND (exp
, 2))
4317 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4321 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4322 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4323 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4324 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4326 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4327 && op2
== TREE_OPERAND (exp
, 2)
4328 && op3
== TREE_OPERAND (exp
, 3))
4332 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4344 new_tree
= NULL_TREE
;
4346 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4348 tree op
= TREE_OPERAND (exp
, i
);
4349 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4353 new_tree
= copy_node (exp
);
4354 TREE_OPERAND (new_tree
, i
) = new_op
;
4360 new_tree
= fold (new_tree
);
4361 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4362 process_call_operands (new_tree
);
4373 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4375 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4376 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4382 /* Subroutine of stabilize_reference; this is called for subtrees of
4383 references. Any expression with side-effects must be put in a SAVE_EXPR
4384 to ensure that it is only evaluated once.
4386 We don't put SAVE_EXPR nodes around everything, because assigning very
4387 simple expressions to temporaries causes us to miss good opportunities
4388 for optimizations. Among other things, the opportunity to fold in the
4389 addition of a constant into an addressing mode often gets lost, e.g.
4390 "y[i+1] += x;". In general, we take the approach that we should not make
4391 an assignment unless we are forced into it - i.e., that any non-side effect
4392 operator should be allowed, and that cse should take care of coalescing
4393 multiple utterances of the same expression should that prove fruitful. */
4396 stabilize_reference_1 (tree e
)
4399 enum tree_code code
= TREE_CODE (e
);
4401 /* We cannot ignore const expressions because it might be a reference
4402 to a const array but whose index contains side-effects. But we can
4403 ignore things that are actual constant or that already have been
4404 handled by this function. */
4406 if (tree_invariant_p (e
))
4409 switch (TREE_CODE_CLASS (code
))
4411 case tcc_exceptional
:
4412 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4413 have side-effects. */
4414 if (code
== STATEMENT_LIST
)
4415 return save_expr (e
);
4418 case tcc_declaration
:
4419 case tcc_comparison
:
4421 case tcc_expression
:
4424 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4425 so that it will only be evaluated once. */
4426 /* The reference (r) and comparison (<) classes could be handled as
4427 below, but it is generally faster to only evaluate them once. */
4428 if (TREE_SIDE_EFFECTS (e
))
4429 return save_expr (e
);
4433 /* Constants need no processing. In fact, we should never reach
4438 /* Division is slow and tends to be compiled with jumps,
4439 especially the division by powers of 2 that is often
4440 found inside of an array reference. So do it just once. */
4441 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4442 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4443 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4444 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4445 return save_expr (e
);
4446 /* Recursively stabilize each operand. */
4447 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4448 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4452 /* Recursively stabilize each operand. */
4453 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4460 TREE_TYPE (result
) = TREE_TYPE (e
);
4461 TREE_READONLY (result
) = TREE_READONLY (e
);
4462 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4463 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4468 /* Stabilize a reference so that we can use it any number of times
4469 without causing its operands to be evaluated more than once.
4470 Returns the stabilized reference. This works by means of save_expr,
4471 so see the caveats in the comments about save_expr.
4473 Also allows conversion expressions whose operands are references.
4474 Any other kind of expression is returned unchanged. */
4477 stabilize_reference (tree ref
)
4480 enum tree_code code
= TREE_CODE (ref
);
4487 /* No action is needed in this case. */
4492 case FIX_TRUNC_EXPR
:
4493 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4497 result
= build_nt (INDIRECT_REF
,
4498 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4502 result
= build_nt (COMPONENT_REF
,
4503 stabilize_reference (TREE_OPERAND (ref
, 0)),
4504 TREE_OPERAND (ref
, 1), NULL_TREE
);
4508 result
= build_nt (BIT_FIELD_REF
,
4509 stabilize_reference (TREE_OPERAND (ref
, 0)),
4510 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4511 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4515 result
= build_nt (ARRAY_REF
,
4516 stabilize_reference (TREE_OPERAND (ref
, 0)),
4517 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4518 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4521 case ARRAY_RANGE_REF
:
4522 result
= build_nt (ARRAY_RANGE_REF
,
4523 stabilize_reference (TREE_OPERAND (ref
, 0)),
4524 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4525 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4529 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4530 it wouldn't be ignored. This matters when dealing with
4532 return stabilize_reference_1 (ref
);
4534 /* If arg isn't a kind of lvalue we recognize, make no change.
4535 Caller should recognize the error for an invalid lvalue. */
4540 return error_mark_node
;
4543 TREE_TYPE (result
) = TREE_TYPE (ref
);
4544 TREE_READONLY (result
) = TREE_READONLY (ref
);
4545 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4546 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4551 /* Low-level constructors for expressions. */
4553 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4554 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4557 recompute_tree_invariant_for_addr_expr (tree t
)
4560 bool tc
= true, se
= false;
4562 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4564 /* We started out assuming this address is both invariant and constant, but
4565 does not have side effects. Now go down any handled components and see if
4566 any of them involve offsets that are either non-constant or non-invariant.
4567 Also check for side-effects.
4569 ??? Note that this code makes no attempt to deal with the case where
4570 taking the address of something causes a copy due to misalignment. */
4572 #define UPDATE_FLAGS(NODE) \
4573 do { tree _node = (NODE); \
4574 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4575 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4577 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4578 node
= TREE_OPERAND (node
, 0))
4580 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4581 array reference (probably made temporarily by the G++ front end),
4582 so ignore all the operands. */
4583 if ((TREE_CODE (node
) == ARRAY_REF
4584 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4585 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4587 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4588 if (TREE_OPERAND (node
, 2))
4589 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4590 if (TREE_OPERAND (node
, 3))
4591 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4593 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4594 FIELD_DECL, apparently. The G++ front end can put something else
4595 there, at least temporarily. */
4596 else if (TREE_CODE (node
) == COMPONENT_REF
4597 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4599 if (TREE_OPERAND (node
, 2))
4600 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4604 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4606 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4607 the address, since &(*a)->b is a form of addition. If it's a constant, the
4608 address is constant too. If it's a decl, its address is constant if the
4609 decl is static. Everything else is not constant and, furthermore,
4610 taking the address of a volatile variable is not volatile. */
4611 if (TREE_CODE (node
) == INDIRECT_REF
4612 || TREE_CODE (node
) == MEM_REF
)
4613 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4614 else if (CONSTANT_CLASS_P (node
))
4616 else if (DECL_P (node
))
4617 tc
&= (staticp (node
) != NULL_TREE
);
4621 se
|= TREE_SIDE_EFFECTS (node
);
4625 TREE_CONSTANT (t
) = tc
;
4626 TREE_SIDE_EFFECTS (t
) = se
;
4630 /* Build an expression of code CODE, data type TYPE, and operands as
4631 specified. Expressions and reference nodes can be created this way.
4632 Constants, decls, types and misc nodes cannot be.
4634 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4635 enough for all extant tree codes. */
4638 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4642 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4644 t
= make_node (code PASS_MEM_STAT
);
4651 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4653 int length
= sizeof (struct tree_exp
);
4656 record_node_allocation_statistics (code
, length
);
4658 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4660 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4662 memset (t
, 0, sizeof (struct tree_common
));
4664 TREE_SET_CODE (t
, code
);
4666 TREE_TYPE (t
) = type
;
4667 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4668 TREE_OPERAND (t
, 0) = node
;
4669 if (node
&& !TYPE_P (node
))
4671 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4672 TREE_READONLY (t
) = TREE_READONLY (node
);
4675 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4677 if (code
!= DEBUG_BEGIN_STMT
)
4678 TREE_SIDE_EFFECTS (t
) = 1;
4683 /* All of these have side-effects, no matter what their
4685 TREE_SIDE_EFFECTS (t
) = 1;
4686 TREE_READONLY (t
) = 0;
4690 /* Whether a dereference is readonly has nothing to do with whether
4691 its operand is readonly. */
4692 TREE_READONLY (t
) = 0;
4697 recompute_tree_invariant_for_addr_expr (t
);
4701 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4702 && node
&& !TYPE_P (node
)
4703 && TREE_CONSTANT (node
))
4704 TREE_CONSTANT (t
) = 1;
4705 if (TREE_CODE_CLASS (code
) == tcc_reference
4706 && node
&& TREE_THIS_VOLATILE (node
))
4707 TREE_THIS_VOLATILE (t
) = 1;
4714 #define PROCESS_ARG(N) \
4716 TREE_OPERAND (t, N) = arg##N; \
4717 if (arg##N &&!TYPE_P (arg##N)) \
4719 if (TREE_SIDE_EFFECTS (arg##N)) \
4721 if (!TREE_READONLY (arg##N) \
4722 && !CONSTANT_CLASS_P (arg##N)) \
4723 (void) (read_only = 0); \
4724 if (!TREE_CONSTANT (arg##N)) \
4725 (void) (constant = 0); \
4730 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4732 bool constant
, read_only
, side_effects
, div_by_zero
;
4735 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4737 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4738 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4739 /* When sizetype precision doesn't match that of pointers
4740 we need to be able to build explicit extensions or truncations
4741 of the offset argument. */
4742 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4743 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4744 && TREE_CODE (arg1
) == INTEGER_CST
);
4746 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4747 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4748 && ptrofftype_p (TREE_TYPE (arg1
)));
4750 t
= make_node (code PASS_MEM_STAT
);
4753 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4754 result based on those same flags for the arguments. But if the
4755 arguments aren't really even `tree' expressions, we shouldn't be trying
4758 /* Expressions without side effects may be constant if their
4759 arguments are as well. */
4760 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4761 || TREE_CODE_CLASS (code
) == tcc_binary
);
4763 side_effects
= TREE_SIDE_EFFECTS (t
);
4767 case TRUNC_DIV_EXPR
:
4769 case FLOOR_DIV_EXPR
:
4770 case ROUND_DIV_EXPR
:
4771 case EXACT_DIV_EXPR
:
4773 case FLOOR_MOD_EXPR
:
4774 case ROUND_MOD_EXPR
:
4775 case TRUNC_MOD_EXPR
:
4776 div_by_zero
= integer_zerop (arg1
);
4779 div_by_zero
= false;
4785 TREE_SIDE_EFFECTS (t
) = side_effects
;
4786 if (code
== MEM_REF
)
4788 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4790 tree o
= TREE_OPERAND (arg0
, 0);
4791 TREE_READONLY (t
) = TREE_READONLY (o
);
4792 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4797 TREE_READONLY (t
) = read_only
;
4798 /* Don't mark X / 0 as constant. */
4799 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4800 TREE_THIS_VOLATILE (t
)
4801 = (TREE_CODE_CLASS (code
) == tcc_reference
4802 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4810 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4811 tree arg2 MEM_STAT_DECL
)
4813 bool constant
, read_only
, side_effects
;
4816 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4817 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4819 t
= make_node (code PASS_MEM_STAT
);
4824 /* As a special exception, if COND_EXPR has NULL branches, we
4825 assume that it is a gimple statement and always consider
4826 it to have side effects. */
4827 if (code
== COND_EXPR
4828 && tt
== void_type_node
4829 && arg1
== NULL_TREE
4830 && arg2
== NULL_TREE
)
4831 side_effects
= true;
4833 side_effects
= TREE_SIDE_EFFECTS (t
);
4839 if (code
== COND_EXPR
)
4840 TREE_READONLY (t
) = read_only
;
4842 TREE_SIDE_EFFECTS (t
) = side_effects
;
4843 TREE_THIS_VOLATILE (t
)
4844 = (TREE_CODE_CLASS (code
) == tcc_reference
4845 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4851 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4852 tree arg2
, tree arg3 MEM_STAT_DECL
)
4854 bool constant
, read_only
, side_effects
;
4857 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4859 t
= make_node (code PASS_MEM_STAT
);
4862 side_effects
= TREE_SIDE_EFFECTS (t
);
4869 TREE_SIDE_EFFECTS (t
) = side_effects
;
4870 TREE_THIS_VOLATILE (t
)
4871 = (TREE_CODE_CLASS (code
) == tcc_reference
4872 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4878 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4879 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4881 bool constant
, read_only
, side_effects
;
4884 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4886 t
= make_node (code PASS_MEM_STAT
);
4889 side_effects
= TREE_SIDE_EFFECTS (t
);
4897 TREE_SIDE_EFFECTS (t
) = side_effects
;
4898 if (code
== TARGET_MEM_REF
)
4900 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4902 tree o
= TREE_OPERAND (arg0
, 0);
4903 TREE_READONLY (t
) = TREE_READONLY (o
);
4904 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4908 TREE_THIS_VOLATILE (t
)
4909 = (TREE_CODE_CLASS (code
) == tcc_reference
4910 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4915 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4916 on the pointer PTR. */
4919 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4921 poly_int64 offset
= 0;
4922 tree ptype
= TREE_TYPE (ptr
);
4924 /* For convenience allow addresses that collapse to a simple base
4926 if (TREE_CODE (ptr
) == ADDR_EXPR
4927 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4928 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4930 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4932 if (TREE_CODE (ptr
) == MEM_REF
)
4934 offset
+= mem_ref_offset (ptr
).force_shwi ();
4935 ptr
= TREE_OPERAND (ptr
, 0);
4938 ptr
= build_fold_addr_expr (ptr
);
4939 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4941 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4942 ptr
, build_int_cst (ptype
, offset
));
4943 SET_EXPR_LOCATION (tem
, loc
);
4947 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4950 mem_ref_offset (const_tree t
)
4952 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4956 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4957 offsetted by OFFSET units. */
4960 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4962 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4963 build_fold_addr_expr (base
),
4964 build_int_cst (ptr_type_node
, offset
));
4965 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4966 recompute_tree_invariant_for_addr_expr (addr
);
4970 /* Similar except don't specify the TREE_TYPE
4971 and leave the TREE_SIDE_EFFECTS as 0.
4972 It is permissible for arguments to be null,
4973 or even garbage if their values do not matter. */
4976 build_nt (enum tree_code code
, ...)
4983 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4987 t
= make_node (code
);
4988 length
= TREE_CODE_LENGTH (code
);
4990 for (i
= 0; i
< length
; i
++)
4991 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4997 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5001 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5006 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5007 CALL_EXPR_FN (ret
) = fn
;
5008 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5009 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5010 CALL_EXPR_ARG (ret
, ix
) = t
;
5014 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5016 We do NOT enter this node in any sort of symbol table.
5018 LOC is the location of the decl.
5020 layout_decl is used to set up the decl's storage layout.
5021 Other slots are initialized to 0 or null pointers. */
5024 build_decl (location_t loc
, enum tree_code code
, tree name
,
5025 tree type MEM_STAT_DECL
)
5029 t
= make_node (code PASS_MEM_STAT
);
5030 DECL_SOURCE_LOCATION (t
) = loc
;
5032 /* if (type == error_mark_node)
5033 type = integer_type_node; */
5034 /* That is not done, deliberately, so that having error_mark_node
5035 as the type can suppress useless errors in the use of this variable. */
5037 DECL_NAME (t
) = name
;
5038 TREE_TYPE (t
) = type
;
5040 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5046 /* Builds and returns function declaration with NAME and TYPE. */
5049 build_fn_decl (const char *name
, tree type
)
5051 tree id
= get_identifier (name
);
5052 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5054 DECL_EXTERNAL (decl
) = 1;
5055 TREE_PUBLIC (decl
) = 1;
5056 DECL_ARTIFICIAL (decl
) = 1;
5057 TREE_NOTHROW (decl
) = 1;
5062 vec
<tree
, va_gc
> *all_translation_units
;
5064 /* Builds a new translation-unit decl with name NAME, queues it in the
5065 global list of translation-unit decls and returns it. */
5068 build_translation_unit_decl (tree name
)
5070 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5072 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5073 vec_safe_push (all_translation_units
, tu
);
5078 /* BLOCK nodes are used to represent the structure of binding contours
5079 and declarations, once those contours have been exited and their contents
5080 compiled. This information is used for outputting debugging info. */
5083 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5085 tree block
= make_node (BLOCK
);
5087 BLOCK_VARS (block
) = vars
;
5088 BLOCK_SUBBLOCKS (block
) = subblocks
;
5089 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5090 BLOCK_CHAIN (block
) = chain
;
5095 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5097 LOC is the location to use in tree T. */
5100 protected_set_expr_location (tree t
, location_t loc
)
5102 if (CAN_HAVE_LOCATION_P (t
))
5103 SET_EXPR_LOCATION (t
, loc
);
5104 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5106 t
= expr_single (t
);
5107 if (t
&& CAN_HAVE_LOCATION_P (t
))
5108 SET_EXPR_LOCATION (t
, loc
);
5112 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5113 UNKNOWN_LOCATION. */
5116 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5118 t
= expr_single (t
);
5119 if (t
&& !EXPR_HAS_LOCATION (t
))
5120 protected_set_expr_location (t
, loc
);
5123 /* Data used when collecting DECLs and TYPEs for language data removal. */
5125 class free_lang_data_d
5128 free_lang_data_d () : decls (100), types (100) {}
5130 /* Worklist to avoid excessive recursion. */
5131 auto_vec
<tree
> worklist
;
5133 /* Set of traversed objects. Used to avoid duplicate visits. */
5134 hash_set
<tree
> pset
;
5136 /* Array of symbols to process with free_lang_data_in_decl. */
5137 auto_vec
<tree
> decls
;
5139 /* Array of types to process with free_lang_data_in_type. */
5140 auto_vec
<tree
> types
;
5144 /* Add type or decl T to one of the list of tree nodes that need their
5145 language data removed. The lists are held inside FLD. */
5148 add_tree_to_fld_list (tree t
, class free_lang_data_d
*fld
)
5151 fld
->decls
.safe_push (t
);
5152 else if (TYPE_P (t
))
5153 fld
->types
.safe_push (t
);
5158 /* Push tree node T into FLD->WORKLIST. */
5161 fld_worklist_push (tree t
, class free_lang_data_d
*fld
)
5163 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5164 fld
->worklist
.safe_push ((t
));
5169 /* Return simplified TYPE_NAME of TYPE. */
5172 fld_simplified_type_name (tree type
)
5174 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5175 return TYPE_NAME (type
);
5176 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5177 TYPE_DECL if the type doesn't have linkage.
5178 this must match fld_ */
5179 if (type
!= TYPE_MAIN_VARIANT (type
)
5180 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5181 && (TREE_CODE (type
) != RECORD_TYPE
5182 || !TYPE_BINFO (type
)
5183 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5184 return DECL_NAME (TYPE_NAME (type
));
5185 return TYPE_NAME (type
);
5188 /* Do same comparsion as check_qualified_type skipping lang part of type
5189 and be more permissive about type names: we only care that names are
5190 same (for diagnostics) and that ODR names are the same.
5191 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5194 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5196 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5197 /* We want to match incomplete variants with complete types.
5198 In this case we need to ignore alignment. */
5199 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5200 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5201 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5202 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5203 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5204 TYPE_ATTRIBUTES (v
))
5205 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5211 /* Find variant of FIRST that match T and create new one if necessary.
5212 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5215 fld_type_variant (tree first
, tree t
, class free_lang_data_d
*fld
,
5216 tree inner_type
= NULL
)
5218 if (first
== TYPE_MAIN_VARIANT (t
))
5220 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5221 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5223 tree v
= build_variant_type_copy (first
);
5224 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5225 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5226 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5227 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5228 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5229 TYPE_NAME (v
) = TYPE_NAME (t
);
5230 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5231 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5232 /* Variants of incomplete types should have alignment
5233 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5234 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5236 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5237 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5240 TREE_TYPE (v
) = inner_type
;
5241 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5242 if (!fld
->pset
.add (v
))
5243 add_tree_to_fld_list (v
, fld
);
5247 /* Map complete types to incomplete types. */
5249 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5251 /* Map types to simplified types. */
5253 static hash_map
<tree
, tree
> *fld_simplified_types
;
5255 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5256 use MAP to prevent duplicates. */
5259 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5260 class free_lang_data_d
*fld
)
5262 if (TREE_TYPE (t
) == t2
)
5265 if (TYPE_MAIN_VARIANT (t
) != t
)
5267 return fld_type_variant
5268 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5269 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5275 = map
->get_or_insert (t
, &existed
);
5279 = build_array_type_1 (t2
, TYPE_DOMAIN (t
), TYPE_TYPELESS_STORAGE (t
),
5281 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5282 if (!fld
->pset
.add (array
))
5283 add_tree_to_fld_list (array
, fld
);
5288 /* Return CTX after removal of contexts that are not relevant */
5291 fld_decl_context (tree ctx
)
5293 /* Variably modified types are needed for tree_is_indexable to decide
5294 whether the type needs to go to local or global section.
5295 This code is semi-broken but for now it is easiest to keep contexts
5297 if (ctx
&& TYPE_P (ctx
)
5298 && !variably_modified_type_p (ctx
, NULL_TREE
))
5300 while (ctx
&& TYPE_P (ctx
))
5301 ctx
= TYPE_CONTEXT (ctx
);
5306 /* For T being aggregate type try to turn it into a incomplete variant.
5307 Return T if no simplification is possible. */
5310 fld_incomplete_type_of (tree t
, class free_lang_data_d
*fld
)
5314 if (POINTER_TYPE_P (t
))
5316 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5317 if (t2
!= TREE_TYPE (t
))
5320 if (TREE_CODE (t
) == POINTER_TYPE
)
5321 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5322 TYPE_REF_CAN_ALIAS_ALL (t
));
5324 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5325 TYPE_REF_CAN_ALIAS_ALL (t
));
5326 gcc_assert (TYPE_CANONICAL (t2
) != t2
5327 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5328 if (!fld
->pset
.add (first
))
5329 add_tree_to_fld_list (first
, fld
);
5330 return fld_type_variant (first
, t
, fld
);
5334 if (TREE_CODE (t
) == ARRAY_TYPE
)
5335 return fld_process_array_type (t
,
5336 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5337 fld_incomplete_types
, fld
);
5338 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5339 || !COMPLETE_TYPE_P (t
))
5341 if (TYPE_MAIN_VARIANT (t
) == t
)
5345 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5349 copy
= build_distinct_type_copy (t
);
5351 /* It is possible that type was not seen by free_lang_data yet. */
5352 if (!fld
->pset
.add (copy
))
5353 add_tree_to_fld_list (copy
, fld
);
5354 TYPE_SIZE (copy
) = NULL
;
5355 TYPE_USER_ALIGN (copy
) = 0;
5356 TYPE_SIZE_UNIT (copy
) = NULL
;
5357 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5358 TREE_ADDRESSABLE (copy
) = 0;
5359 if (AGGREGATE_TYPE_P (t
))
5361 SET_TYPE_MODE (copy
, VOIDmode
);
5362 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5363 TYPE_TYPELESS_STORAGE (copy
) = 0;
5364 TYPE_FIELDS (copy
) = NULL
;
5365 TYPE_BINFO (copy
) = NULL
;
5366 TYPE_FINAL_P (copy
) = 0;
5367 TYPE_EMPTY_P (copy
) = 0;
5371 TYPE_VALUES (copy
) = NULL
;
5372 ENUM_IS_OPAQUE (copy
) = 0;
5373 ENUM_IS_SCOPED (copy
) = 0;
5376 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5377 This is needed for ODR violation warnings to come out right (we
5378 want duplicate TYPE_DECLs whenever the type is duplicated because
5379 of ODR violation. Because lang data in the TYPE_DECL may not
5380 have been freed yet, rebuild it from scratch and copy relevant
5382 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5383 tree name
= TYPE_NAME (copy
);
5385 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5387 gcc_checking_assert (TREE_TYPE (name
) == t
);
5388 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5389 DECL_NAME (name
), copy
);
5390 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5391 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5392 SET_DECL_ALIGN (name2
, 0);
5393 DECL_CONTEXT (name2
) = fld_decl_context
5394 (DECL_CONTEXT (name
));
5395 TYPE_NAME (copy
) = name2
;
5400 return (fld_type_variant
5401 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5404 /* Simplify type T for scenarios where we do not need complete pointer
5408 fld_simplified_type (tree t
, class free_lang_data_d
*fld
)
5412 if (POINTER_TYPE_P (t
))
5413 return fld_incomplete_type_of (t
, fld
);
5414 /* FIXME: This triggers verification error, see PR88140. */
5415 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5416 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5417 fld_simplified_types
, fld
);
5421 /* Reset the expression *EXPR_P, a size or position.
5423 ??? We could reset all non-constant sizes or positions. But it's cheap
5424 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5426 We need to reset self-referential sizes or positions because they cannot
5427 be gimplified and thus can contain a CALL_EXPR after the gimplification
5428 is finished, which will run afoul of LTO streaming. And they need to be
5429 reset to something essentially dummy but not constant, so as to preserve
5430 the properties of the object they are attached to. */
5433 free_lang_data_in_one_sizepos (tree
*expr_p
)
5435 tree expr
= *expr_p
;
5436 if (CONTAINS_PLACEHOLDER_P (expr
))
5437 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5441 /* Reset all the fields in a binfo node BINFO. We only keep
5442 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5445 free_lang_data_in_binfo (tree binfo
)
5450 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5452 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5453 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5454 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5455 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5456 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5457 TREE_PUBLIC (binfo
) = 0;
5459 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5460 free_lang_data_in_binfo (t
);
5464 /* Reset all language specific information still present in TYPE. */
5467 free_lang_data_in_type (tree type
, class free_lang_data_d
*fld
)
5469 gcc_assert (TYPE_P (type
));
5471 /* Give the FE a chance to remove its own data first. */
5472 lang_hooks
.free_lang_data (type
);
5474 TREE_LANG_FLAG_0 (type
) = 0;
5475 TREE_LANG_FLAG_1 (type
) = 0;
5476 TREE_LANG_FLAG_2 (type
) = 0;
5477 TREE_LANG_FLAG_3 (type
) = 0;
5478 TREE_LANG_FLAG_4 (type
) = 0;
5479 TREE_LANG_FLAG_5 (type
) = 0;
5480 TREE_LANG_FLAG_6 (type
) = 0;
5482 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5484 /* Purge non-marked variants from the variants chain, so that they
5485 don't reappear in the IL after free_lang_data. */
5486 while (TYPE_NEXT_VARIANT (type
)
5487 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5489 tree t
= TYPE_NEXT_VARIANT (type
);
5490 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5491 /* Turn the removed types into distinct types. */
5492 TYPE_MAIN_VARIANT (t
) = t
;
5493 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5496 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5498 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5499 /* Remove the const and volatile qualifiers from arguments. The
5500 C++ front end removes them, but the C front end does not,
5501 leading to false ODR violation errors when merging two
5502 instances of the same function signature compiled by
5503 different front ends. */
5504 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5506 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5507 tree arg_type
= TREE_VALUE (p
);
5509 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5511 int quals
= TYPE_QUALS (arg_type
)
5513 & ~TYPE_QUAL_VOLATILE
;
5514 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5515 if (!fld
->pset
.add (TREE_VALUE (p
)))
5516 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5518 /* C++ FE uses TREE_PURPOSE to store initial values. */
5519 TREE_PURPOSE (p
) = NULL
;
5522 else if (TREE_CODE (type
) == METHOD_TYPE
)
5524 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5525 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5527 /* C++ FE uses TREE_PURPOSE to store initial values. */
5528 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5529 TREE_PURPOSE (p
) = NULL
;
5532 else if (RECORD_OR_UNION_TYPE_P (type
))
5534 /* Remove members that are not FIELD_DECLs from the field list
5535 of an aggregate. These occur in C++. */
5536 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5537 if (TREE_CODE (member
) == FIELD_DECL
)
5538 prev
= &DECL_CHAIN (member
);
5540 *prev
= DECL_CHAIN (member
);
5542 TYPE_VFIELD (type
) = NULL_TREE
;
5544 if (TYPE_BINFO (type
))
5546 free_lang_data_in_binfo (TYPE_BINFO (type
));
5547 /* We need to preserve link to bases and virtual table for all
5548 polymorphic types to make devirtualization machinery working. */
5549 if (!BINFO_VTABLE (TYPE_BINFO (type
)))
5550 TYPE_BINFO (type
) = NULL
;
5553 else if (INTEGRAL_TYPE_P (type
)
5554 || SCALAR_FLOAT_TYPE_P (type
)
5555 || FIXED_POINT_TYPE_P (type
))
5557 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5559 ENUM_IS_OPAQUE (type
) = 0;
5560 ENUM_IS_SCOPED (type
) = 0;
5561 /* Type values are used only for C++ ODR checking. Drop them
5562 for all type variants and non-ODR types.
5563 For ODR types the data is freed in free_odr_warning_data. */
5564 if (TYPE_MAIN_VARIANT (type
) != type
5565 || !type_with_linkage_p (type
))
5566 TYPE_VALUES (type
) = NULL
;
5568 /* Simplify representation by recording only values rather
5569 than const decls. */
5570 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5571 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5572 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5574 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5575 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5578 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5580 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5581 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5583 if (TYPE_CONTEXT (type
)
5584 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5586 tree ctx
= TYPE_CONTEXT (type
);
5589 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5591 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5592 TYPE_CONTEXT (type
) = ctx
;
5595 TYPE_STUB_DECL (type
) = NULL
;
5596 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5600 /* Return true if DECL may need an assembler name to be set. */
5603 need_assembler_name_p (tree decl
)
5605 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5606 Rule merging. This makes type_odr_p to return true on those types during
5607 LTO and by comparing the mangled name, we can say what types are intended
5608 to be equivalent across compilation unit.
5610 We do not store names of type_in_anonymous_namespace_p.
5612 Record, union and enumeration type have linkage that allows use
5613 to check type_in_anonymous_namespace_p. We do not mangle compound types
5614 that always can be compared structurally.
5616 Similarly for builtin types, we compare properties of their main variant.
5617 A special case are integer types where mangling do make differences
5618 between char/signed char/unsigned char etc. Storing name for these makes
5619 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5620 See cp/mangle.c:write_builtin_type for details. */
5622 if (TREE_CODE (decl
) == TYPE_DECL
)
5624 if (DECL_NAME (decl
)
5625 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5626 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5627 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5628 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5629 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5630 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5631 && (type_with_linkage_p (TREE_TYPE (decl
))
5632 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5633 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5634 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5637 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5638 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5641 /* If DECL already has its assembler name set, it does not need a
5643 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5644 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5647 /* Abstract decls do not need an assembler name. */
5648 if (DECL_ABSTRACT_P (decl
))
5651 /* For VAR_DECLs, only static, public and external symbols need an
5654 && !TREE_STATIC (decl
)
5655 && !TREE_PUBLIC (decl
)
5656 && !DECL_EXTERNAL (decl
))
5659 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5661 /* Do not set assembler name on builtins. Allow RTL expansion to
5662 decide whether to expand inline or via a regular call. */
5663 if (fndecl_built_in_p (decl
)
5664 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5667 /* Functions represented in the callgraph need an assembler name. */
5668 if (cgraph_node::get (decl
) != NULL
)
5671 /* Unused and not public functions don't need an assembler name. */
5672 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5680 /* Reset all language specific information still present in symbol
5684 free_lang_data_in_decl (tree decl
, class free_lang_data_d
*fld
)
5686 gcc_assert (DECL_P (decl
));
5688 /* Give the FE a chance to remove its own data first. */
5689 lang_hooks
.free_lang_data (decl
);
5691 TREE_LANG_FLAG_0 (decl
) = 0;
5692 TREE_LANG_FLAG_1 (decl
) = 0;
5693 TREE_LANG_FLAG_2 (decl
) = 0;
5694 TREE_LANG_FLAG_3 (decl
) = 0;
5695 TREE_LANG_FLAG_4 (decl
) = 0;
5696 TREE_LANG_FLAG_5 (decl
) = 0;
5697 TREE_LANG_FLAG_6 (decl
) = 0;
5699 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5700 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5701 if (TREE_CODE (decl
) == FIELD_DECL
)
5703 DECL_FCONTEXT (decl
) = NULL
;
5704 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5705 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5706 DECL_QUALIFIER (decl
) = NULL_TREE
;
5709 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5711 struct cgraph_node
*node
;
5712 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5713 the address may be taken in other unit, so this flag has no practical
5716 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5717 for public objects that indeed cannot be adressed, but it is not
5718 the case. Set the flag to true so we do not get merge failures for
5719 i.e. virtual tables between units that take address of it and
5720 units that don't. */
5721 if (TREE_PUBLIC (decl
))
5722 TREE_ADDRESSABLE (decl
) = true;
5723 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5724 if (!(node
= cgraph_node::get (decl
))
5725 || (!node
->definition
&& !node
->clones
))
5728 node
->release_body ();
5731 release_function_body (decl
);
5732 DECL_ARGUMENTS (decl
) = NULL
;
5733 DECL_RESULT (decl
) = NULL
;
5734 DECL_INITIAL (decl
) = error_mark_node
;
5737 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5741 /* If DECL has a gimple body, then the context for its
5742 arguments must be DECL. Otherwise, it doesn't really
5743 matter, as we will not be emitting any code for DECL. In
5744 general, there may be other instances of DECL created by
5745 the front end and since PARM_DECLs are generally shared,
5746 their DECL_CONTEXT changes as the replicas of DECL are
5747 created. The only time where DECL_CONTEXT is important
5748 is for the FUNCTION_DECLs that have a gimple body (since
5749 the PARM_DECL will be used in the function's body). */
5750 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5751 DECL_CONTEXT (t
) = decl
;
5752 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5753 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5754 = target_option_default_node
;
5755 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5756 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5757 = optimization_default_node
;
5760 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5761 At this point, it is not needed anymore. */
5762 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5764 /* Clear the abstract origin if it refers to a method.
5765 Otherwise dwarf2out.c will ICE as we splice functions out of
5766 TYPE_FIELDS and thus the origin will not be output
5768 if (DECL_ABSTRACT_ORIGIN (decl
)
5769 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5770 && RECORD_OR_UNION_TYPE_P
5771 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5772 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5774 DECL_VINDEX (decl
) = NULL_TREE
;
5776 else if (VAR_P (decl
))
5778 /* See comment above why we set the flag for functions. */
5779 if (TREE_PUBLIC (decl
))
5780 TREE_ADDRESSABLE (decl
) = true;
5781 if ((DECL_EXTERNAL (decl
)
5782 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5783 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5784 DECL_INITIAL (decl
) = NULL_TREE
;
5786 else if (TREE_CODE (decl
) == TYPE_DECL
)
5788 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5789 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5790 TREE_PUBLIC (decl
) = 0;
5791 TREE_PRIVATE (decl
) = 0;
5792 DECL_ARTIFICIAL (decl
) = 0;
5793 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5794 DECL_INITIAL (decl
) = NULL_TREE
;
5795 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5796 DECL_MODE (decl
) = VOIDmode
;
5797 SET_DECL_ALIGN (decl
, 0);
5798 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5800 else if (TREE_CODE (decl
) == FIELD_DECL
)
5802 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5803 DECL_INITIAL (decl
) = NULL_TREE
;
5805 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5806 && DECL_INITIAL (decl
)
5807 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5809 /* Strip builtins from the translation-unit BLOCK. We still have targets
5810 without builtin_decl_explicit support and also builtins are shared
5811 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5812 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5816 if (TREE_CODE (var
) == FUNCTION_DECL
5817 && fndecl_built_in_p (var
))
5818 *nextp
= TREE_CHAIN (var
);
5820 nextp
= &TREE_CHAIN (var
);
5823 /* We need to keep field decls associated with their trees. Otherwise tree
5824 merging may merge some fileds and keep others disjoint wich in turn will
5825 not do well with TREE_CHAIN pointers linking them.
5827 Also do not drop containing types for virtual methods and tables because
5828 these are needed by devirtualization.
5829 C++ destructors are special because C++ frontends sometimes produces
5830 virtual destructor as an alias of non-virtual destructor. In
5831 devirutalization code we always walk through aliases and we need
5832 context to be preserved too. See PR89335 */
5833 if (TREE_CODE (decl
) != FIELD_DECL
5834 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5835 || (!DECL_VIRTUAL_P (decl
)
5836 && (TREE_CODE (decl
) != FUNCTION_DECL
5837 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5838 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5842 /* Operand callback helper for free_lang_data_in_node. *TP is the
5843 subtree operand being considered. */
5846 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5849 class free_lang_data_d
*fld
= (class free_lang_data_d
*) data
;
5851 if (TREE_CODE (t
) == TREE_LIST
)
5854 /* Language specific nodes will be removed, so there is no need
5855 to gather anything under them. */
5856 if (is_lang_specific (t
))
5864 /* Note that walk_tree does not traverse every possible field in
5865 decls, so we have to do our own traversals here. */
5866 add_tree_to_fld_list (t
, fld
);
5868 fld_worklist_push (DECL_NAME (t
), fld
);
5869 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5870 fld_worklist_push (DECL_SIZE (t
), fld
);
5871 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5873 /* We are going to remove everything under DECL_INITIAL for
5874 TYPE_DECLs. No point walking them. */
5875 if (TREE_CODE (t
) != TYPE_DECL
)
5876 fld_worklist_push (DECL_INITIAL (t
), fld
);
5878 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5879 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5881 if (TREE_CODE (t
) == FUNCTION_DECL
)
5883 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5884 fld_worklist_push (DECL_RESULT (t
), fld
);
5886 else if (TREE_CODE (t
) == FIELD_DECL
)
5888 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5889 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5890 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5891 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5894 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5895 && DECL_HAS_VALUE_EXPR_P (t
))
5896 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5898 if (TREE_CODE (t
) != FIELD_DECL
5899 && TREE_CODE (t
) != TYPE_DECL
)
5900 fld_worklist_push (TREE_CHAIN (t
), fld
);
5903 else if (TYPE_P (t
))
5905 /* Note that walk_tree does not traverse every possible field in
5906 types, so we have to do our own traversals here. */
5907 add_tree_to_fld_list (t
, fld
);
5909 if (!RECORD_OR_UNION_TYPE_P (t
))
5910 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5911 fld_worklist_push (TYPE_SIZE (t
), fld
);
5912 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5913 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5914 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5915 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5916 fld_worklist_push (TYPE_NAME (t
), fld
);
5917 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5918 lists, we may look types up in these lists and use them while
5919 optimizing the function body. Thus we need to free lang data
5921 if (TREE_CODE (t
) == POINTER_TYPE
)
5922 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5923 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5924 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5925 if (!POINTER_TYPE_P (t
))
5926 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5927 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5928 if (!RECORD_OR_UNION_TYPE_P (t
))
5929 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5930 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5931 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5932 do not and want not to reach unused variants this way. */
5933 if (TYPE_CONTEXT (t
))
5935 tree ctx
= TYPE_CONTEXT (t
);
5936 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5937 So push that instead. */
5938 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5939 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5940 fld_worklist_push (ctx
, fld
);
5942 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
5944 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5948 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5949 fld_worklist_push (TREE_TYPE (tem
), fld
);
5950 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5951 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5953 if (RECORD_OR_UNION_TYPE_P (t
))
5956 /* Push all TYPE_FIELDS - there can be interleaving interesting
5957 and non-interesting things. */
5958 tem
= TYPE_FIELDS (t
);
5961 if (TREE_CODE (tem
) == FIELD_DECL
)
5962 fld_worklist_push (tem
, fld
);
5963 tem
= TREE_CHAIN (tem
);
5966 if (FUNC_OR_METHOD_TYPE_P (t
))
5967 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5969 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5972 else if (TREE_CODE (t
) == BLOCK
)
5974 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5976 if (TREE_CODE (*tem
) != LABEL_DECL
5977 && (TREE_CODE (*tem
) != VAR_DECL
5978 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
))))
5980 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5981 && TREE_CODE (*tem
) != PARM_DECL
);
5982 *tem
= TREE_CHAIN (*tem
);
5986 fld_worklist_push (*tem
, fld
);
5987 tem
= &TREE_CHAIN (*tem
);
5990 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5991 fld_worklist_push (tem
, fld
);
5992 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5995 if (TREE_CODE (t
) != IDENTIFIER_NODE
5996 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5997 fld_worklist_push (TREE_TYPE (t
), fld
);
6003 /* Find decls and types in T. */
6006 find_decls_types (tree t
, class free_lang_data_d
*fld
)
6010 if (!fld
->pset
.contains (t
))
6011 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
6012 if (fld
->worklist
.is_empty ())
6014 t
= fld
->worklist
.pop ();
6018 /* Translate all the types in LIST with the corresponding runtime
6022 get_eh_types_for_runtime (tree list
)
6026 if (list
== NULL_TREE
)
6029 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6031 list
= TREE_CHAIN (list
);
6034 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6035 TREE_CHAIN (prev
) = n
;
6036 prev
= TREE_CHAIN (prev
);
6037 list
= TREE_CHAIN (list
);
6044 /* Find decls and types referenced in EH region R and store them in
6045 FLD->DECLS and FLD->TYPES. */
6048 find_decls_types_in_eh_region (eh_region r
, class free_lang_data_d
*fld
)
6059 /* The types referenced in each catch must first be changed to the
6060 EH types used at runtime. This removes references to FE types
6062 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6064 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6065 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6070 case ERT_ALLOWED_EXCEPTIONS
:
6071 r
->u
.allowed
.type_list
6072 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6073 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6076 case ERT_MUST_NOT_THROW
:
6077 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6078 find_decls_types_r
, fld
, &fld
->pset
);
6084 /* Find decls and types referenced in cgraph node N and store them in
6085 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6086 look for *every* kind of DECL and TYPE node reachable from N,
6087 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6088 NAMESPACE_DECLs, etc). */
6091 find_decls_types_in_node (struct cgraph_node
*n
, class free_lang_data_d
*fld
)
6094 struct function
*fn
;
6098 find_decls_types (n
->decl
, fld
);
6100 if (!gimple_has_body_p (n
->decl
))
6103 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6105 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6107 /* Traverse locals. */
6108 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6109 find_decls_types (t
, fld
);
6111 /* Traverse EH regions in FN. */
6114 FOR_ALL_EH_REGION_FN (r
, fn
)
6115 find_decls_types_in_eh_region (r
, fld
);
6118 /* Traverse every statement in FN. */
6119 FOR_EACH_BB_FN (bb
, fn
)
6122 gimple_stmt_iterator si
;
6125 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6127 gphi
*phi
= psi
.phi ();
6129 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6131 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6132 find_decls_types (*arg_p
, fld
);
6136 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6138 gimple
*stmt
= gsi_stmt (si
);
6140 if (is_gimple_call (stmt
))
6141 find_decls_types (gimple_call_fntype (stmt
), fld
);
6143 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6145 tree arg
= gimple_op (stmt
, i
);
6146 find_decls_types (arg
, fld
);
6147 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6148 which we need for asm stmts. */
6150 && TREE_CODE (arg
) == TREE_LIST
6151 && TREE_PURPOSE (arg
)
6152 && gimple_code (stmt
) == GIMPLE_ASM
)
6153 find_decls_types (TREE_PURPOSE (arg
), fld
);
6160 /* Find decls and types referenced in varpool node N and store them in
6161 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6162 look for *every* kind of DECL and TYPE node reachable from N,
6163 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6164 NAMESPACE_DECLs, etc). */
6167 find_decls_types_in_var (varpool_node
*v
, class free_lang_data_d
*fld
)
6169 find_decls_types (v
->decl
, fld
);
6172 /* If T needs an assembler name, have one created for it. */
6175 assign_assembler_name_if_needed (tree t
)
6177 if (need_assembler_name_p (t
))
6179 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6180 diagnostics that use input_location to show locus
6181 information. The problem here is that, at this point,
6182 input_location is generally anchored to the end of the file
6183 (since the parser is long gone), so we don't have a good
6184 position to pin it to.
6186 To alleviate this problem, this uses the location of T's
6187 declaration. Examples of this are
6188 testsuite/g++.dg/template/cond2.C and
6189 testsuite/g++.dg/template/pr35240.C. */
6190 location_t saved_location
= input_location
;
6191 input_location
= DECL_SOURCE_LOCATION (t
);
6193 decl_assembler_name (t
);
6195 input_location
= saved_location
;
6200 /* Free language specific information for every operand and expression
6201 in every node of the call graph. This process operates in three stages:
6203 1- Every callgraph node and varpool node is traversed looking for
6204 decls and types embedded in them. This is a more exhaustive
6205 search than that done by find_referenced_vars, because it will
6206 also collect individual fields, decls embedded in types, etc.
6208 2- All the decls found are sent to free_lang_data_in_decl.
6210 3- All the types found are sent to free_lang_data_in_type.
6212 The ordering between decls and types is important because
6213 free_lang_data_in_decl sets assembler names, which includes
6214 mangling. So types cannot be freed up until assembler names have
6218 free_lang_data_in_cgraph (class free_lang_data_d
*fld
)
6220 struct cgraph_node
*n
;
6226 /* Find decls and types in the body of every function in the callgraph. */
6227 FOR_EACH_FUNCTION (n
)
6228 find_decls_types_in_node (n
, fld
);
6230 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6231 find_decls_types (p
->decl
, fld
);
6233 /* Find decls and types in every varpool symbol. */
6234 FOR_EACH_VARIABLE (v
)
6235 find_decls_types_in_var (v
, fld
);
6237 /* Set the assembler name on every decl found. We need to do this
6238 now because free_lang_data_in_decl will invalidate data needed
6239 for mangling. This breaks mangling on interdependent decls. */
6240 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6241 assign_assembler_name_if_needed (t
);
6243 /* Traverse every decl found freeing its language data. */
6244 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6245 free_lang_data_in_decl (t
, fld
);
6247 /* Traverse every type found freeing its language data. */
6248 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6249 free_lang_data_in_type (t
, fld
);
6253 /* Free resources that are used by FE but are not needed once they are done. */
6256 free_lang_data (void)
6259 class free_lang_data_d fld
;
6261 /* If we are the LTO frontend we have freed lang-specific data already. */
6263 || (!flag_generate_lto
&& !flag_generate_offload
))
6265 /* Rebuild type inheritance graph even when not doing LTO to get
6266 consistent profile data. */
6267 rebuild_type_inheritance_graph ();
6271 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6272 fld_simplified_types
= new hash_map
<tree
, tree
>;
6274 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6275 if (vec_safe_is_empty (all_translation_units
))
6276 build_translation_unit_decl (NULL_TREE
);
6278 /* Allocate and assign alias sets to the standard integer types
6279 while the slots are still in the way the frontends generated them. */
6280 for (i
= 0; i
< itk_none
; ++i
)
6281 if (integer_types
[i
])
6282 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6284 /* Traverse the IL resetting language specific information for
6285 operands, expressions, etc. */
6286 free_lang_data_in_cgraph (&fld
);
6288 /* Create gimple variants for common types. */
6289 for (unsigned i
= 0;
6290 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6292 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6294 /* Reset some langhooks. Do not reset types_compatible_p, it may
6295 still be used indirectly via the get_alias_set langhook. */
6296 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6297 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6298 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6299 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6300 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6301 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6302 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6303 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6305 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6312 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6316 /* We do not want the default decl_assembler_name implementation,
6317 rather if we have fixed everything we want a wrapper around it
6318 asserting that all non-local symbols already got their assembler
6319 name and only produce assembler names for local symbols. Or rather
6320 make sure we never call decl_assembler_name on local symbols and
6321 devise a separate, middle-end private scheme for it. */
6323 /* Reset diagnostic machinery. */
6324 tree_diagnostics_defaults (global_dc
);
6326 rebuild_type_inheritance_graph ();
6328 delete fld_incomplete_types
;
6329 delete fld_simplified_types
;
6337 const pass_data pass_data_ipa_free_lang_data
=
6339 SIMPLE_IPA_PASS
, /* type */
6340 "*free_lang_data", /* name */
6341 OPTGROUP_NONE
, /* optinfo_flags */
6342 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6343 0, /* properties_required */
6344 0, /* properties_provided */
6345 0, /* properties_destroyed */
6346 0, /* todo_flags_start */
6347 0, /* todo_flags_finish */
6350 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6353 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6354 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6357 /* opt_pass methods: */
6358 virtual unsigned int execute (function
*) { return free_lang_data (); }
6360 }; // class pass_ipa_free_lang_data
6364 simple_ipa_opt_pass
*
6365 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6367 return new pass_ipa_free_lang_data (ctxt
);
6370 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6371 of the various TYPE_QUAL values. */
6374 set_type_quals (tree type
, int type_quals
)
6376 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6377 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6378 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6379 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6380 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6383 /* Returns true iff CAND and BASE have equivalent language-specific
6387 check_lang_type (const_tree cand
, const_tree base
)
6389 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6391 /* type_hash_eq currently only applies to these types. */
6392 if (TREE_CODE (cand
) != FUNCTION_TYPE
6393 && TREE_CODE (cand
) != METHOD_TYPE
)
6395 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6398 /* This function checks to see if TYPE matches the size one of the built-in
6399 atomic types, and returns that core atomic type. */
6402 find_atomic_core_type (const_tree type
)
6404 tree base_atomic_type
;
6406 /* Only handle complete types. */
6407 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6410 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6413 base_atomic_type
= atomicQI_type_node
;
6417 base_atomic_type
= atomicHI_type_node
;
6421 base_atomic_type
= atomicSI_type_node
;
6425 base_atomic_type
= atomicDI_type_node
;
6429 base_atomic_type
= atomicTI_type_node
;
6433 base_atomic_type
= NULL_TREE
;
6436 return base_atomic_type
;
6439 /* Returns true iff unqualified CAND and BASE are equivalent. */
6442 check_base_type (const_tree cand
, const_tree base
)
6444 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6445 /* Apparently this is needed for Objective-C. */
6446 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6447 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6448 TYPE_ATTRIBUTES (base
)))
6450 /* Check alignment. */
6451 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6453 /* Atomic types increase minimal alignment. We must to do so as well
6454 or we get duplicated canonical types. See PR88686. */
6455 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6457 /* See if this object can map to a basic atomic type. */
6458 tree atomic_type
= find_atomic_core_type (cand
);
6459 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6465 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6468 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6470 return (TYPE_QUALS (cand
) == type_quals
6471 && check_base_type (cand
, base
)
6472 && check_lang_type (cand
, base
));
6475 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6478 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6480 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6481 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6482 /* Apparently this is needed for Objective-C. */
6483 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6484 /* Check alignment. */
6485 && TYPE_ALIGN (cand
) == align
6486 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6487 TYPE_ATTRIBUTES (base
))
6488 && check_lang_type (cand
, base
));
6491 /* Return a version of the TYPE, qualified as indicated by the
6492 TYPE_QUALS, if one exists. If no qualified version exists yet,
6493 return NULL_TREE. */
6496 get_qualified_type (tree type
, int type_quals
)
6498 if (TYPE_QUALS (type
) == type_quals
)
6501 tree mv
= TYPE_MAIN_VARIANT (type
);
6502 if (check_qualified_type (mv
, type
, type_quals
))
6505 /* Search the chain of variants to see if there is already one there just
6506 like the one we need to have. If so, use that existing one. We must
6507 preserve the TYPE_NAME, since there is code that depends on this. */
6508 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6509 if (check_qualified_type (*tp
, type
, type_quals
))
6511 /* Put the found variant at the head of the variant list so
6512 frequently searched variants get found faster. The C++ FE
6513 benefits greatly from this. */
6515 *tp
= TYPE_NEXT_VARIANT (t
);
6516 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6517 TYPE_NEXT_VARIANT (mv
) = t
;
6524 /* Like get_qualified_type, but creates the type if it does not
6525 exist. This function never returns NULL_TREE. */
6528 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6532 /* See if we already have the appropriate qualified variant. */
6533 t
= get_qualified_type (type
, type_quals
);
6535 /* If not, build it. */
6538 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6539 set_type_quals (t
, type_quals
);
6541 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6543 /* See if this object can map to a basic atomic type. */
6544 tree atomic_type
= find_atomic_core_type (type
);
6547 /* Ensure the alignment of this type is compatible with
6548 the required alignment of the atomic type. */
6549 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6550 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6554 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6555 /* Propagate structural equality. */
6556 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6557 else if (TYPE_CANONICAL (type
) != type
)
6558 /* Build the underlying canonical type, since it is different
6561 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6562 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6565 /* T is its own canonical type. */
6566 TYPE_CANONICAL (t
) = t
;
6573 /* Create a variant of type T with alignment ALIGN. */
6576 build_aligned_type (tree type
, unsigned int align
)
6580 if (TYPE_PACKED (type
)
6581 || TYPE_ALIGN (type
) == align
)
6584 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6585 if (check_aligned_type (t
, type
, align
))
6588 t
= build_variant_type_copy (type
);
6589 SET_TYPE_ALIGN (t
, align
);
6590 TYPE_USER_ALIGN (t
) = 1;
6595 /* Create a new distinct copy of TYPE. The new type is made its own
6596 MAIN_VARIANT. If TYPE requires structural equality checks, the
6597 resulting type requires structural equality checks; otherwise, its
6598 TYPE_CANONICAL points to itself. */
6601 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6603 tree t
= copy_node (type PASS_MEM_STAT
);
6605 TYPE_POINTER_TO (t
) = 0;
6606 TYPE_REFERENCE_TO (t
) = 0;
6608 /* Set the canonical type either to a new equivalence class, or
6609 propagate the need for structural equality checks. */
6610 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6611 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6613 TYPE_CANONICAL (t
) = t
;
6615 /* Make it its own variant. */
6616 TYPE_MAIN_VARIANT (t
) = t
;
6617 TYPE_NEXT_VARIANT (t
) = 0;
6619 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6620 whose TREE_TYPE is not t. This can also happen in the Ada
6621 frontend when using subtypes. */
6626 /* Create a new variant of TYPE, equivalent but distinct. This is so
6627 the caller can modify it. TYPE_CANONICAL for the return type will
6628 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6629 are considered equal by the language itself (or that both types
6630 require structural equality checks). */
6633 build_variant_type_copy (tree type MEM_STAT_DECL
)
6635 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6637 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6639 /* Since we're building a variant, assume that it is a non-semantic
6640 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6641 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6642 /* Type variants have no alias set defined. */
6643 TYPE_ALIAS_SET (t
) = -1;
6645 /* Add the new type to the chain of variants of TYPE. */
6646 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6647 TYPE_NEXT_VARIANT (m
) = t
;
6648 TYPE_MAIN_VARIANT (t
) = m
;
6653 /* Return true if the from tree in both tree maps are equal. */
6656 tree_map_base_eq (const void *va
, const void *vb
)
6658 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6659 *const b
= (const struct tree_map_base
*) vb
;
6660 return (a
->from
== b
->from
);
6663 /* Hash a from tree in a tree_base_map. */
6666 tree_map_base_hash (const void *item
)
6668 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6671 /* Return true if this tree map structure is marked for garbage collection
6672 purposes. We simply return true if the from tree is marked, so that this
6673 structure goes away when the from tree goes away. */
6676 tree_map_base_marked_p (const void *p
)
6678 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6681 /* Hash a from tree in a tree_map. */
6684 tree_map_hash (const void *item
)
6686 return (((const struct tree_map
*) item
)->hash
);
6689 /* Hash a from tree in a tree_decl_map. */
6692 tree_decl_map_hash (const void *item
)
6694 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6697 /* Return the initialization priority for DECL. */
6700 decl_init_priority_lookup (tree decl
)
6702 symtab_node
*snode
= symtab_node::get (decl
);
6705 return DEFAULT_INIT_PRIORITY
;
6707 snode
->get_init_priority ();
6710 /* Return the finalization priority for DECL. */
6713 decl_fini_priority_lookup (tree decl
)
6715 cgraph_node
*node
= cgraph_node::get (decl
);
6718 return DEFAULT_INIT_PRIORITY
;
6720 node
->get_fini_priority ();
6723 /* Set the initialization priority for DECL to PRIORITY. */
6726 decl_init_priority_insert (tree decl
, priority_type priority
)
6728 struct symtab_node
*snode
;
6730 if (priority
== DEFAULT_INIT_PRIORITY
)
6732 snode
= symtab_node::get (decl
);
6736 else if (VAR_P (decl
))
6737 snode
= varpool_node::get_create (decl
);
6739 snode
= cgraph_node::get_create (decl
);
6740 snode
->set_init_priority (priority
);
6743 /* Set the finalization priority for DECL to PRIORITY. */
6746 decl_fini_priority_insert (tree decl
, priority_type priority
)
6748 struct cgraph_node
*node
;
6750 if (priority
== DEFAULT_INIT_PRIORITY
)
6752 node
= cgraph_node::get (decl
);
6757 node
= cgraph_node::get_create (decl
);
6758 node
->set_fini_priority (priority
);
6761 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6764 print_debug_expr_statistics (void)
6766 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6767 (long) debug_expr_for_decl
->size (),
6768 (long) debug_expr_for_decl
->elements (),
6769 debug_expr_for_decl
->collisions ());
6772 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6775 print_value_expr_statistics (void)
6777 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6778 (long) value_expr_for_decl
->size (),
6779 (long) value_expr_for_decl
->elements (),
6780 value_expr_for_decl
->collisions ());
6783 /* Lookup a debug expression for FROM, and return it if we find one. */
6786 decl_debug_expr_lookup (tree from
)
6788 struct tree_decl_map
*h
, in
;
6789 in
.base
.from
= from
;
6791 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6797 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6800 decl_debug_expr_insert (tree from
, tree to
)
6802 struct tree_decl_map
*h
;
6804 h
= ggc_alloc
<tree_decl_map
> ();
6805 h
->base
.from
= from
;
6807 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6810 /* Lookup a value expression for FROM, and return it if we find one. */
6813 decl_value_expr_lookup (tree from
)
6815 struct tree_decl_map
*h
, in
;
6816 in
.base
.from
= from
;
6818 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6824 /* Insert a mapping FROM->TO in the value expression hashtable. */
6827 decl_value_expr_insert (tree from
, tree to
)
6829 struct tree_decl_map
*h
;
6831 h
= ggc_alloc
<tree_decl_map
> ();
6832 h
->base
.from
= from
;
6834 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6837 /* Lookup a vector of debug arguments for FROM, and return it if we
6841 decl_debug_args_lookup (tree from
)
6843 struct tree_vec_map
*h
, in
;
6845 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6847 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6848 in
.base
.from
= from
;
6849 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6855 /* Insert a mapping FROM->empty vector of debug arguments in the value
6856 expression hashtable. */
6859 decl_debug_args_insert (tree from
)
6861 struct tree_vec_map
*h
;
6864 if (DECL_HAS_DEBUG_ARGS_P (from
))
6865 return decl_debug_args_lookup (from
);
6866 if (debug_args_for_decl
== NULL
)
6867 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6868 h
= ggc_alloc
<tree_vec_map
> ();
6869 h
->base
.from
= from
;
6871 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6873 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6877 /* Hashing of types so that we don't make duplicates.
6878 The entry point is `type_hash_canon'. */
6880 /* Generate the default hash code for TYPE. This is designed for
6881 speed, rather than maximum entropy. */
6884 type_hash_canon_hash (tree type
)
6886 inchash::hash hstate
;
6888 hstate
.add_int (TREE_CODE (type
));
6890 if (TREE_TYPE (type
))
6891 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6893 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6894 /* Just the identifier is adequate to distinguish. */
6895 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6897 switch (TREE_CODE (type
))
6900 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6903 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6904 if (TREE_VALUE (t
) != error_mark_node
)
6905 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6909 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6914 if (TYPE_DOMAIN (type
))
6915 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6916 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6918 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6919 hstate
.add_object (typeless
);
6926 tree t
= TYPE_MAX_VALUE (type
);
6928 t
= TYPE_MIN_VALUE (type
);
6929 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6930 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6935 case FIXED_POINT_TYPE
:
6937 unsigned prec
= TYPE_PRECISION (type
);
6938 hstate
.add_object (prec
);
6943 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6950 return hstate
.end ();
6953 /* These are the Hashtable callback functions. */
6955 /* Returns true iff the types are equivalent. */
6958 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6960 /* First test the things that are the same for all types. */
6961 if (a
->hash
!= b
->hash
6962 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6963 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6964 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6965 TYPE_ATTRIBUTES (b
->type
))
6966 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6967 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6970 /* Be careful about comparing arrays before and after the element type
6971 has been completed; don't compare TYPE_ALIGN unless both types are
6973 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6974 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6975 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6978 switch (TREE_CODE (a
->type
))
6983 case REFERENCE_TYPE
:
6988 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6989 TYPE_VECTOR_SUBPARTS (b
->type
));
6992 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6993 && !(TYPE_VALUES (a
->type
)
6994 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6995 && TYPE_VALUES (b
->type
)
6996 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6997 && type_list_equal (TYPE_VALUES (a
->type
),
6998 TYPE_VALUES (b
->type
))))
7006 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7008 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7009 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7010 TYPE_MAX_VALUE (b
->type
)))
7011 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7012 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7013 TYPE_MIN_VALUE (b
->type
))));
7015 case FIXED_POINT_TYPE
:
7016 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7019 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7022 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7023 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7024 || (TYPE_ARG_TYPES (a
->type
)
7025 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7026 && TYPE_ARG_TYPES (b
->type
)
7027 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7028 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7029 TYPE_ARG_TYPES (b
->type
)))))
7033 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7034 where the flag should be inherited from the element type
7035 and can change after ARRAY_TYPEs are created; on non-aggregates
7036 compare it and hash it, scalars will never have that flag set
7037 and we need to differentiate between arrays created by different
7038 front-ends or middle-end created arrays. */
7039 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7040 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7041 || (TYPE_TYPELESS_STORAGE (a
->type
)
7042 == TYPE_TYPELESS_STORAGE (b
->type
))));
7046 case QUAL_UNION_TYPE
:
7047 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7048 || (TYPE_FIELDS (a
->type
)
7049 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7050 && TYPE_FIELDS (b
->type
)
7051 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7052 && type_list_equal (TYPE_FIELDS (a
->type
),
7053 TYPE_FIELDS (b
->type
))));
7056 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7057 || (TYPE_ARG_TYPES (a
->type
)
7058 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7059 && TYPE_ARG_TYPES (b
->type
)
7060 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7061 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7062 TYPE_ARG_TYPES (b
->type
))))
7070 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7071 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7076 /* Given TYPE, and HASHCODE its hash code, return the canonical
7077 object for an identical type if one already exists.
7078 Otherwise, return TYPE, and record it as the canonical object.
7080 To use this function, first create a type of the sort you want.
7081 Then compute its hash code from the fields of the type that
7082 make it different from other similar types.
7083 Then call this function and use the value. */
7086 type_hash_canon (unsigned int hashcode
, tree type
)
7091 /* The hash table only contains main variants, so ensure that's what we're
7093 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7095 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7096 must call that routine before comparing TYPE_ALIGNs. */
7102 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7105 tree t1
= ((type_hash
*) *loc
)->type
;
7106 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7108 if (TYPE_UID (type
) + 1 == next_type_uid
)
7110 /* Free also min/max values and the cache for integer
7111 types. This can't be done in free_node, as LTO frees
7112 those on its own. */
7113 if (TREE_CODE (type
) == INTEGER_TYPE
)
7115 if (TYPE_MIN_VALUE (type
)
7116 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7118 /* Zero is always in TYPE_CACHED_VALUES. */
7119 if (! TYPE_UNSIGNED (type
))
7120 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7121 ggc_free (TYPE_MIN_VALUE (type
));
7123 if (TYPE_MAX_VALUE (type
)
7124 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7126 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7127 ggc_free (TYPE_MAX_VALUE (type
));
7129 if (TYPE_CACHED_VALUES_P (type
))
7130 ggc_free (TYPE_CACHED_VALUES (type
));
7137 struct type_hash
*h
;
7139 h
= ggc_alloc
<type_hash
> ();
7149 print_type_hash_statistics (void)
7151 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7152 (long) type_hash_table
->size (),
7153 (long) type_hash_table
->elements (),
7154 type_hash_table
->collisions ());
7157 /* Given two lists of types
7158 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7159 return 1 if the lists contain the same types in the same order.
7160 Also, the TREE_PURPOSEs must match. */
7163 type_list_equal (const_tree l1
, const_tree l2
)
7167 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7168 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7169 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7170 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7171 && (TREE_TYPE (TREE_PURPOSE (t1
))
7172 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7178 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7179 given by TYPE. If the argument list accepts variable arguments,
7180 then this function counts only the ordinary arguments. */
7183 type_num_arguments (const_tree fntype
)
7187 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7188 /* If the function does not take a variable number of arguments,
7189 the last element in the list will have type `void'. */
7190 if (VOID_TYPE_P (TREE_VALUE (t
)))
7198 /* Return the type of the function TYPE's argument ARGNO if known.
7199 For vararg function's where ARGNO refers to one of the variadic
7200 arguments return null. Otherwise, return a void_type_node for
7201 out-of-bounds ARGNO. */
7204 type_argument_type (const_tree fntype
, unsigned argno
)
7206 /* Treat zero the same as an out-of-bounds argument number. */
7208 return void_type_node
;
7210 function_args_iterator iter
;
7214 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7216 /* A vararg function's argument list ends in a null. Otherwise,
7217 an ordinary function's argument list ends with void. Return
7218 null if ARGNO refers to a vararg argument, void_type_node if
7219 it's out of bounds, and the formal argument type otherwise. */
7223 if (i
== argno
|| VOID_TYPE_P (argtype
))
7232 /* Nonzero if integer constants T1 and T2
7233 represent the same constant value. */
7236 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7241 if (t1
== 0 || t2
== 0)
7244 STRIP_ANY_LOCATION_WRAPPER (t1
);
7245 STRIP_ANY_LOCATION_WRAPPER (t2
);
7247 if (TREE_CODE (t1
) == INTEGER_CST
7248 && TREE_CODE (t2
) == INTEGER_CST
7249 && wi::to_widest (t1
) == wi::to_widest (t2
))
7255 /* Return true if T is an INTEGER_CST whose numerical value (extended
7256 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7259 tree_fits_shwi_p (const_tree t
)
7261 return (t
!= NULL_TREE
7262 && TREE_CODE (t
) == INTEGER_CST
7263 && wi::fits_shwi_p (wi::to_widest (t
)));
7266 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7267 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7270 tree_fits_poly_int64_p (const_tree t
)
7274 if (POLY_INT_CST_P (t
))
7276 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7277 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7281 return (TREE_CODE (t
) == INTEGER_CST
7282 && wi::fits_shwi_p (wi::to_widest (t
)));
7285 /* Return true if T is an INTEGER_CST whose numerical value (extended
7286 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7289 tree_fits_uhwi_p (const_tree t
)
7291 return (t
!= NULL_TREE
7292 && TREE_CODE (t
) == INTEGER_CST
7293 && wi::fits_uhwi_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_uint64. */
7300 tree_fits_poly_uint64_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_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7311 return (TREE_CODE (t
) == INTEGER_CST
7312 && wi::fits_uhwi_p (wi::to_widest (t
)));
7315 /* T is an INTEGER_CST whose numerical value (extended according to
7316 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7320 tree_to_shwi (const_tree t
)
7322 gcc_assert (tree_fits_shwi_p (t
));
7323 return TREE_INT_CST_LOW (t
);
7326 /* T is an INTEGER_CST whose numerical value (extended according to
7327 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7330 unsigned HOST_WIDE_INT
7331 tree_to_uhwi (const_tree t
)
7333 gcc_assert (tree_fits_uhwi_p (t
));
7334 return TREE_INT_CST_LOW (t
);
7337 /* Return the most significant (sign) bit of T. */
7340 tree_int_cst_sign_bit (const_tree t
)
7342 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7344 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7347 /* Return an indication of the sign of the integer constant T.
7348 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7349 Note that -1 will never be returned if T's type is unsigned. */
7352 tree_int_cst_sgn (const_tree t
)
7354 if (wi::to_wide (t
) == 0)
7356 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7358 else if (wi::neg_p (wi::to_wide (t
)))
7364 /* Return the minimum number of bits needed to represent VALUE in a
7365 signed or unsigned type, UNSIGNEDP says which. */
7368 tree_int_cst_min_precision (tree value
, signop sgn
)
7370 /* If the value is negative, compute its negative minus 1. The latter
7371 adjustment is because the absolute value of the largest negative value
7372 is one larger than the largest positive value. This is equivalent to
7373 a bit-wise negation, so use that operation instead. */
7375 if (tree_int_cst_sgn (value
) < 0)
7376 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7378 /* Return the number of bits needed, taking into account the fact
7379 that we need one more bit for a signed than unsigned type.
7380 If value is 0 or -1, the minimum precision is 1 no matter
7381 whether unsignedp is true or false. */
7383 if (integer_zerop (value
))
7386 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7389 /* Return truthvalue of whether T1 is the same tree structure as T2.
7390 Return 1 if they are the same.
7391 Return 0 if they are understandably different.
7392 Return -1 if either contains tree structure not understood by
7396 simple_cst_equal (const_tree t1
, const_tree t2
)
7398 enum tree_code code1
, code2
;
7404 if (t1
== 0 || t2
== 0)
7407 /* For location wrappers to be the same, they must be at the same
7408 source location (and wrap the same thing). */
7409 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7411 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7413 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7416 code1
= TREE_CODE (t1
);
7417 code2
= TREE_CODE (t2
);
7419 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7421 if (CONVERT_EXPR_CODE_P (code2
)
7422 || code2
== NON_LVALUE_EXPR
)
7423 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7425 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7428 else if (CONVERT_EXPR_CODE_P (code2
)
7429 || code2
== NON_LVALUE_EXPR
)
7430 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7438 return wi::to_widest (t1
) == wi::to_widest (t2
);
7441 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7444 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7447 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7448 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7449 TREE_STRING_LENGTH (t1
)));
7453 unsigned HOST_WIDE_INT idx
;
7454 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7455 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7457 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7460 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7461 /* ??? Should we handle also fields here? */
7462 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7468 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7471 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7474 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7477 const_tree arg1
, arg2
;
7478 const_call_expr_arg_iterator iter1
, iter2
;
7479 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7480 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7482 arg1
= next_const_call_expr_arg (&iter1
),
7483 arg2
= next_const_call_expr_arg (&iter2
))
7485 cmp
= simple_cst_equal (arg1
, arg2
);
7489 return arg1
== arg2
;
7493 /* Special case: if either target is an unallocated VAR_DECL,
7494 it means that it's going to be unified with whatever the
7495 TARGET_EXPR is really supposed to initialize, so treat it
7496 as being equivalent to anything. */
7497 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7498 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7499 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7500 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7501 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7502 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7505 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7510 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7512 case WITH_CLEANUP_EXPR
:
7513 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7517 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7520 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7521 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7532 if (POLY_INT_CST_P (t1
))
7533 /* A false return means maybe_ne rather than known_ne. */
7534 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7535 TYPE_SIGN (TREE_TYPE (t1
))),
7536 poly_widest_int::from (poly_int_cst_value (t2
),
7537 TYPE_SIGN (TREE_TYPE (t2
))));
7541 /* This general rule works for most tree codes. All exceptions should be
7542 handled above. If this is a language-specific tree code, we can't
7543 trust what might be in the operand, so say we don't know
7545 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7548 switch (TREE_CODE_CLASS (code1
))
7552 case tcc_comparison
:
7553 case tcc_expression
:
7557 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7559 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7571 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7572 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7573 than U, respectively. */
7576 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7578 if (tree_int_cst_sgn (t
) < 0)
7580 else if (!tree_fits_uhwi_p (t
))
7582 else if (TREE_INT_CST_LOW (t
) == u
)
7584 else if (TREE_INT_CST_LOW (t
) < u
)
7590 /* Return true if SIZE represents a constant size that is in bounds of
7591 what the middle-end and the backend accepts (covering not more than
7592 half of the address-space).
7593 When PERR is non-null, set *PERR on failure to the description of
7594 why SIZE is not valid. */
7597 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7599 if (POLY_INT_CST_P (size
))
7601 if (TREE_OVERFLOW (size
))
7603 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7604 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7609 cst_size_error error
;
7613 if (TREE_CODE (size
) != INTEGER_CST
)
7615 *perr
= cst_size_not_constant
;
7619 if (TREE_OVERFLOW_P (size
))
7621 *perr
= cst_size_overflow
;
7625 if (tree_int_cst_sgn (size
) < 0)
7627 *perr
= cst_size_negative
;
7630 if (!tree_fits_uhwi_p (size
)
7631 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7632 < wi::to_widest (size
) * 2))
7634 *perr
= cst_size_too_big
;
7641 /* Return the precision of the type, or for a complex or vector type the
7642 precision of the type of its elements. */
7645 element_precision (const_tree type
)
7648 type
= TREE_TYPE (type
);
7649 enum tree_code code
= TREE_CODE (type
);
7650 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7651 type
= TREE_TYPE (type
);
7653 return TYPE_PRECISION (type
);
7656 /* Return true if CODE represents an associative tree code. Otherwise
7659 associative_tree_code (enum tree_code code
)
7678 /* Return true if CODE represents a commutative tree code. Otherwise
7681 commutative_tree_code (enum tree_code code
)
7687 case MULT_HIGHPART_EXPR
:
7695 case UNORDERED_EXPR
:
7699 case TRUTH_AND_EXPR
:
7700 case TRUTH_XOR_EXPR
:
7702 case WIDEN_MULT_EXPR
:
7703 case VEC_WIDEN_MULT_HI_EXPR
:
7704 case VEC_WIDEN_MULT_LO_EXPR
:
7705 case VEC_WIDEN_MULT_EVEN_EXPR
:
7706 case VEC_WIDEN_MULT_ODD_EXPR
:
7715 /* Return true if CODE represents a ternary tree code for which the
7716 first two operands are commutative. Otherwise return false. */
7718 commutative_ternary_tree_code (enum tree_code code
)
7722 case WIDEN_MULT_PLUS_EXPR
:
7723 case WIDEN_MULT_MINUS_EXPR
:
7733 /* Returns true if CODE can overflow. */
7736 operation_can_overflow (enum tree_code code
)
7744 /* Can overflow in various ways. */
7746 case TRUNC_DIV_EXPR
:
7747 case EXACT_DIV_EXPR
:
7748 case FLOOR_DIV_EXPR
:
7750 /* For INT_MIN / -1. */
7757 /* These operators cannot overflow. */
7762 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7763 ftrapv doesn't generate trapping insns for CODE. */
7766 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7768 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7770 /* We don't generate instructions that trap on overflow for complex or vector
7772 if (!INTEGRAL_TYPE_P (type
))
7775 if (!TYPE_OVERFLOW_TRAPS (type
))
7785 /* These operators can overflow, and -ftrapv generates trapping code for
7788 case TRUNC_DIV_EXPR
:
7789 case EXACT_DIV_EXPR
:
7790 case FLOOR_DIV_EXPR
:
7793 /* These operators can overflow, but -ftrapv does not generate trapping
7797 /* These operators cannot overflow. */
7802 /* Constructors for pointer, array and function types.
7803 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7804 constructed by language-dependent code, not here.) */
7806 /* Construct, lay out and return the type of pointers to TO_TYPE with
7807 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7808 reference all of memory. If such a type has already been
7809 constructed, reuse it. */
7812 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7816 bool could_alias
= can_alias_all
;
7818 if (to_type
== error_mark_node
)
7819 return error_mark_node
;
7821 /* If the pointed-to type has the may_alias attribute set, force
7822 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7823 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7824 can_alias_all
= true;
7826 /* In some cases, languages will have things that aren't a POINTER_TYPE
7827 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7828 In that case, return that type without regard to the rest of our
7831 ??? This is a kludge, but consistent with the way this function has
7832 always operated and there doesn't seem to be a good way to avoid this
7834 if (TYPE_POINTER_TO (to_type
) != 0
7835 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7836 return TYPE_POINTER_TO (to_type
);
7838 /* First, if we already have a type for pointers to TO_TYPE and it's
7839 the proper mode, use it. */
7840 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7841 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7844 t
= make_node (POINTER_TYPE
);
7846 TREE_TYPE (t
) = to_type
;
7847 SET_TYPE_MODE (t
, mode
);
7848 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7849 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7850 TYPE_POINTER_TO (to_type
) = t
;
7852 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7853 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7854 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7855 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7857 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7860 /* Lay out the type. This function has many callers that are concerned
7861 with expression-construction, and this simplifies them all. */
7867 /* By default build pointers in ptr_mode. */
7870 build_pointer_type (tree to_type
)
7872 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7873 : TYPE_ADDR_SPACE (to_type
);
7874 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7875 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7878 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7881 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7885 bool could_alias
= can_alias_all
;
7887 if (to_type
== error_mark_node
)
7888 return error_mark_node
;
7890 /* If the pointed-to type has the may_alias attribute set, force
7891 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7892 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7893 can_alias_all
= true;
7895 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7896 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7897 In that case, return that type without regard to the rest of our
7900 ??? This is a kludge, but consistent with the way this function has
7901 always operated and there doesn't seem to be a good way to avoid this
7903 if (TYPE_REFERENCE_TO (to_type
) != 0
7904 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7905 return TYPE_REFERENCE_TO (to_type
);
7907 /* First, if we already have a type for pointers to TO_TYPE and it's
7908 the proper mode, use it. */
7909 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7910 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7913 t
= make_node (REFERENCE_TYPE
);
7915 TREE_TYPE (t
) = to_type
;
7916 SET_TYPE_MODE (t
, mode
);
7917 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7918 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7919 TYPE_REFERENCE_TO (to_type
) = t
;
7921 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7922 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7923 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7924 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7926 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7935 /* Build the node for the type of references-to-TO_TYPE by default
7939 build_reference_type (tree to_type
)
7941 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7942 : TYPE_ADDR_SPACE (to_type
);
7943 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7944 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7947 #define MAX_INT_CACHED_PREC \
7948 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7949 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7951 /* Builds a signed or unsigned integer type of precision PRECISION.
7952 Used for C bitfields whose precision does not match that of
7953 built-in target types. */
7955 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7961 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7963 if (precision
<= MAX_INT_CACHED_PREC
)
7965 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7970 itype
= make_node (INTEGER_TYPE
);
7971 TYPE_PRECISION (itype
) = precision
;
7974 fixup_unsigned_type (itype
);
7976 fixup_signed_type (itype
);
7978 inchash::hash hstate
;
7979 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7980 ret
= type_hash_canon (hstate
.end (), itype
);
7981 if (precision
<= MAX_INT_CACHED_PREC
)
7982 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7987 #define MAX_BOOL_CACHED_PREC \
7988 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7989 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7991 /* Builds a boolean type of precision PRECISION.
7992 Used for boolean vectors to choose proper vector element size. */
7994 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7998 if (precision
<= MAX_BOOL_CACHED_PREC
)
8000 type
= nonstandard_boolean_type_cache
[precision
];
8005 type
= make_node (BOOLEAN_TYPE
);
8006 TYPE_PRECISION (type
) = precision
;
8007 fixup_signed_type (type
);
8009 if (precision
<= MAX_INT_CACHED_PREC
)
8010 nonstandard_boolean_type_cache
[precision
] = type
;
8015 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8016 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8017 is true, reuse such a type that has already been constructed. */
8020 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8022 tree itype
= make_node (INTEGER_TYPE
);
8024 TREE_TYPE (itype
) = type
;
8026 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8027 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8029 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8030 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8031 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8032 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8033 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8034 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8035 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8040 if ((TYPE_MIN_VALUE (itype
)
8041 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8042 || (TYPE_MAX_VALUE (itype
)
8043 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8045 /* Since we cannot reliably merge this type, we need to compare it using
8046 structural equality checks. */
8047 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8051 hashval_t hash
= type_hash_canon_hash (itype
);
8052 itype
= type_hash_canon (hash
, itype
);
8057 /* Wrapper around build_range_type_1 with SHARED set to true. */
8060 build_range_type (tree type
, tree lowval
, tree highval
)
8062 return build_range_type_1 (type
, lowval
, highval
, true);
8065 /* Wrapper around build_range_type_1 with SHARED set to false. */
8068 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8070 return build_range_type_1 (type
, lowval
, highval
, false);
8073 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8074 MAXVAL should be the maximum value in the domain
8075 (one less than the length of the array).
8077 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8078 We don't enforce this limit, that is up to caller (e.g. language front end).
8079 The limit exists because the result is a signed type and we don't handle
8080 sizes that use more than one HOST_WIDE_INT. */
8083 build_index_type (tree maxval
)
8085 return build_range_type (sizetype
, size_zero_node
, maxval
);
8088 /* Return true if the debug information for TYPE, a subtype, should be emitted
8089 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8090 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8091 debug info and doesn't reflect the source code. */
8094 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8096 tree base_type
= TREE_TYPE (type
), low
, high
;
8098 /* Subrange types have a base type which is an integral type. */
8099 if (!INTEGRAL_TYPE_P (base_type
))
8102 /* Get the real bounds of the subtype. */
8103 if (lang_hooks
.types
.get_subrange_bounds
)
8104 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8107 low
= TYPE_MIN_VALUE (type
);
8108 high
= TYPE_MAX_VALUE (type
);
8111 /* If the type and its base type have the same representation and the same
8112 name, then the type is not a subrange but a copy of the base type. */
8113 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8114 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8115 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8116 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8117 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8118 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8128 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8129 and number of elements specified by the range of values of INDEX_TYPE.
8130 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8131 If SHARED is true, reuse such a type that has already been constructed.
8132 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8135 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8136 bool shared
, bool set_canonical
)
8140 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8142 error ("arrays of functions are not meaningful");
8143 elt_type
= integer_type_node
;
8146 t
= make_node (ARRAY_TYPE
);
8147 TREE_TYPE (t
) = elt_type
;
8148 TYPE_DOMAIN (t
) = index_type
;
8149 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8150 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8155 hashval_t hash
= type_hash_canon_hash (t
);
8156 t
= type_hash_canon (hash
, t
);
8159 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
8161 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8162 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8164 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8165 else if (TYPE_CANONICAL (elt_type
) != elt_type
8166 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8168 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8170 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8171 typeless_storage
, shared
, set_canonical
);
8177 /* Wrapper around build_array_type_1 with SHARED set to true. */
8180 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8183 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
8186 /* Wrapper around build_array_type_1 with SHARED set to false. */
8189 build_nonshared_array_type (tree elt_type
, tree index_type
)
8191 return build_array_type_1 (elt_type
, index_type
, false, false, true);
8194 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8198 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8200 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8203 /* Recursively examines the array elements of TYPE, until a non-array
8204 element type is found. */
8207 strip_array_types (tree type
)
8209 while (TREE_CODE (type
) == ARRAY_TYPE
)
8210 type
= TREE_TYPE (type
);
8215 /* Computes the canonical argument types from the argument type list
8218 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8219 on entry to this function, or if any of the ARGTYPES are
8222 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8223 true on entry to this function, or if any of the ARGTYPES are
8226 Returns a canonical argument list, which may be ARGTYPES when the
8227 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8228 true) or would not differ from ARGTYPES. */
8231 maybe_canonicalize_argtypes (tree argtypes
,
8232 bool *any_structural_p
,
8233 bool *any_noncanonical_p
)
8236 bool any_noncanonical_argtypes_p
= false;
8238 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8240 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8241 /* Fail gracefully by stating that the type is structural. */
8242 *any_structural_p
= true;
8243 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8244 *any_structural_p
= true;
8245 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8246 || TREE_PURPOSE (arg
))
8247 /* If the argument has a default argument, we consider it
8248 non-canonical even though the type itself is canonical.
8249 That way, different variants of function and method types
8250 with default arguments will all point to the variant with
8251 no defaults as their canonical type. */
8252 any_noncanonical_argtypes_p
= true;
8255 if (*any_structural_p
)
8258 if (any_noncanonical_argtypes_p
)
8260 /* Build the canonical list of argument types. */
8261 tree canon_argtypes
= NULL_TREE
;
8262 bool is_void
= false;
8264 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8266 if (arg
== void_list_node
)
8269 canon_argtypes
= tree_cons (NULL_TREE
,
8270 TYPE_CANONICAL (TREE_VALUE (arg
)),
8274 canon_argtypes
= nreverse (canon_argtypes
);
8276 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8278 /* There is a non-canonical type. */
8279 *any_noncanonical_p
= true;
8280 return canon_argtypes
;
8283 /* The canonical argument types are the same as ARGTYPES. */
8287 /* Construct, lay out and return
8288 the type of functions returning type VALUE_TYPE
8289 given arguments of types ARG_TYPES.
8290 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8291 are data type nodes for the arguments of the function.
8292 If such a type has already been constructed, reuse it. */
8295 build_function_type (tree value_type
, tree arg_types
)
8298 inchash::hash hstate
;
8299 bool any_structural_p
, any_noncanonical_p
;
8300 tree canon_argtypes
;
8302 gcc_assert (arg_types
!= error_mark_node
);
8304 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8306 error ("function return type cannot be function");
8307 value_type
= integer_type_node
;
8310 /* Make a node of the sort we want. */
8311 t
= make_node (FUNCTION_TYPE
);
8312 TREE_TYPE (t
) = value_type
;
8313 TYPE_ARG_TYPES (t
) = arg_types
;
8315 /* If we already have such a type, use the old one. */
8316 hashval_t hash
= type_hash_canon_hash (t
);
8317 t
= type_hash_canon (hash
, t
);
8319 /* Set up the canonical type. */
8320 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8321 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8322 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8324 &any_noncanonical_p
);
8325 if (any_structural_p
)
8326 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8327 else if (any_noncanonical_p
)
8328 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8331 if (!COMPLETE_TYPE_P (t
))
8336 /* Build a function type. The RETURN_TYPE is the type returned by the
8337 function. If VAARGS is set, no void_type_node is appended to the
8338 list. ARGP must be always be terminated be a NULL_TREE. */
8341 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8345 t
= va_arg (argp
, tree
);
8346 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8347 args
= tree_cons (NULL_TREE
, t
, args
);
8352 if (args
!= NULL_TREE
)
8353 args
= nreverse (args
);
8354 gcc_assert (last
!= void_list_node
);
8356 else if (args
== NULL_TREE
)
8357 args
= void_list_node
;
8361 args
= nreverse (args
);
8362 TREE_CHAIN (last
) = void_list_node
;
8364 args
= build_function_type (return_type
, args
);
8369 /* Build a function type. The RETURN_TYPE is the type returned by the
8370 function. If additional arguments are provided, they are
8371 additional argument types. The list of argument types must always
8372 be terminated by NULL_TREE. */
8375 build_function_type_list (tree return_type
, ...)
8380 va_start (p
, return_type
);
8381 args
= build_function_type_list_1 (false, return_type
, p
);
8386 /* Build a variable argument function type. The RETURN_TYPE is the
8387 type returned by the function. If additional arguments are provided,
8388 they are additional argument types. The list of argument types must
8389 always be terminated by NULL_TREE. */
8392 build_varargs_function_type_list (tree return_type
, ...)
8397 va_start (p
, return_type
);
8398 args
= build_function_type_list_1 (true, return_type
, p
);
8404 /* Build a function type. RETURN_TYPE is the type returned by the
8405 function; VAARGS indicates whether the function takes varargs. The
8406 function takes N named arguments, the types of which are provided in
8410 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8414 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8416 for (i
= n
- 1; i
>= 0; i
--)
8417 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8419 return build_function_type (return_type
, t
);
8422 /* Build a function type. RETURN_TYPE is the type returned by the
8423 function. The function takes N named arguments, the types of which
8424 are provided in ARG_TYPES. */
8427 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8429 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8432 /* Build a variable argument function type. RETURN_TYPE is the type
8433 returned by the function. The function takes N named arguments, the
8434 types of which are provided in ARG_TYPES. */
8437 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8439 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8442 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8443 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8444 for the method. An implicit additional parameter (of type
8445 pointer-to-BASETYPE) is added to the ARGTYPES. */
8448 build_method_type_directly (tree basetype
,
8454 bool any_structural_p
, any_noncanonical_p
;
8455 tree canon_argtypes
;
8457 /* Make a node of the sort we want. */
8458 t
= make_node (METHOD_TYPE
);
8460 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8461 TREE_TYPE (t
) = rettype
;
8462 ptype
= build_pointer_type (basetype
);
8464 /* The actual arglist for this function includes a "hidden" argument
8465 which is "this". Put it into the list of argument types. */
8466 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8467 TYPE_ARG_TYPES (t
) = argtypes
;
8469 /* If we already have such a type, use the old one. */
8470 hashval_t hash
= type_hash_canon_hash (t
);
8471 t
= type_hash_canon (hash
, t
);
8473 /* Set up the canonical type. */
8475 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8476 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8478 = (TYPE_CANONICAL (basetype
) != basetype
8479 || TYPE_CANONICAL (rettype
) != rettype
);
8480 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8482 &any_noncanonical_p
);
8483 if (any_structural_p
)
8484 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8485 else if (any_noncanonical_p
)
8487 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8488 TYPE_CANONICAL (rettype
),
8490 if (!COMPLETE_TYPE_P (t
))
8496 /* Construct, lay out and return the type of methods belonging to class
8497 BASETYPE and whose arguments and values are described by TYPE.
8498 If that type exists already, reuse it.
8499 TYPE must be a FUNCTION_TYPE node. */
8502 build_method_type (tree basetype
, tree type
)
8504 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8506 return build_method_type_directly (basetype
,
8508 TYPE_ARG_TYPES (type
));
8511 /* Construct, lay out and return the type of offsets to a value
8512 of type TYPE, within an object of type BASETYPE.
8513 If a suitable offset type exists already, reuse it. */
8516 build_offset_type (tree basetype
, tree type
)
8520 /* Make a node of the sort we want. */
8521 t
= make_node (OFFSET_TYPE
);
8523 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8524 TREE_TYPE (t
) = type
;
8526 /* If we already have such a type, use the old one. */
8527 hashval_t hash
= type_hash_canon_hash (t
);
8528 t
= type_hash_canon (hash
, t
);
8530 if (!COMPLETE_TYPE_P (t
))
8533 if (TYPE_CANONICAL (t
) == t
)
8535 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8536 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8537 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8538 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8539 || TYPE_CANONICAL (type
) != type
)
8541 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8542 TYPE_CANONICAL (type
));
8548 /* Create a complex type whose components are COMPONENT_TYPE.
8550 If NAMED is true, the type is given a TYPE_NAME. We do not always
8551 do so because this creates a DECL node and thus make the DECL_UIDs
8552 dependent on the type canonicalization hashtable, which is GC-ed,
8553 so the DECL_UIDs would not be stable wrt garbage collection. */
8556 build_complex_type (tree component_type
, bool named
)
8558 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8559 || SCALAR_FLOAT_TYPE_P (component_type
)
8560 || FIXED_POINT_TYPE_P (component_type
));
8562 /* Make a node of the sort we want. */
8563 tree probe
= make_node (COMPLEX_TYPE
);
8565 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8567 /* If we already have such a type, use the old one. */
8568 hashval_t hash
= type_hash_canon_hash (probe
);
8569 tree t
= type_hash_canon (hash
, probe
);
8573 /* We created a new type. The hash insertion will have laid
8574 out the type. We need to check the canonicalization and
8575 maybe set the name. */
8576 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8578 && TYPE_CANONICAL (t
) == t
);
8580 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8581 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8582 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8584 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8586 /* We need to create a name, since complex is a fundamental type. */
8589 const char *name
= NULL
;
8591 if (TREE_TYPE (t
) == char_type_node
)
8592 name
= "complex char";
8593 else if (TREE_TYPE (t
) == signed_char_type_node
)
8594 name
= "complex signed char";
8595 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8596 name
= "complex unsigned char";
8597 else if (TREE_TYPE (t
) == short_integer_type_node
)
8598 name
= "complex short int";
8599 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8600 name
= "complex short unsigned int";
8601 else if (TREE_TYPE (t
) == integer_type_node
)
8602 name
= "complex int";
8603 else if (TREE_TYPE (t
) == unsigned_type_node
)
8604 name
= "complex unsigned int";
8605 else if (TREE_TYPE (t
) == long_integer_type_node
)
8606 name
= "complex long int";
8607 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8608 name
= "complex long unsigned int";
8609 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8610 name
= "complex long long int";
8611 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8612 name
= "complex long long unsigned int";
8615 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8616 get_identifier (name
), t
);
8620 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8623 /* If TYPE is a real or complex floating-point type and the target
8624 does not directly support arithmetic on TYPE then return the wider
8625 type to be used for arithmetic on TYPE. Otherwise, return
8629 excess_precision_type (tree type
)
8631 /* The target can give two different responses to the question of
8632 which excess precision mode it would like depending on whether we
8633 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8635 enum excess_precision_type requested_type
8636 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8637 ? EXCESS_PRECISION_TYPE_FAST
8638 : EXCESS_PRECISION_TYPE_STANDARD
);
8640 enum flt_eval_method target_flt_eval_method
8641 = targetm
.c
.excess_precision (requested_type
);
8643 /* The target should not ask for unpredictable float evaluation (though
8644 it might advertise that implicitly the evaluation is unpredictable,
8645 but we don't care about that here, it will have been reported
8646 elsewhere). If it does ask for unpredictable evaluation, we have
8647 nothing to do here. */
8648 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8650 /* Nothing to do. The target has asked for all types we know about
8651 to be computed with their native precision and range. */
8652 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8655 /* The target will promote this type in a target-dependent way, so excess
8656 precision ought to leave it alone. */
8657 if (targetm
.promoted_type (type
) != NULL_TREE
)
8660 machine_mode float16_type_mode
= (float16_type_node
8661 ? TYPE_MODE (float16_type_node
)
8663 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8664 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8666 switch (TREE_CODE (type
))
8670 machine_mode type_mode
= TYPE_MODE (type
);
8671 switch (target_flt_eval_method
)
8673 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8674 if (type_mode
== float16_type_mode
)
8675 return float_type_node
;
8677 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8678 if (type_mode
== float16_type_mode
8679 || type_mode
== float_type_mode
)
8680 return double_type_node
;
8682 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8683 if (type_mode
== float16_type_mode
8684 || type_mode
== float_type_mode
8685 || type_mode
== double_type_mode
)
8686 return long_double_type_node
;
8695 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8697 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8698 switch (target_flt_eval_method
)
8700 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8701 if (type_mode
== float16_type_mode
)
8702 return complex_float_type_node
;
8704 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8705 if (type_mode
== float16_type_mode
8706 || type_mode
== float_type_mode
)
8707 return complex_double_type_node
;
8709 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8710 if (type_mode
== float16_type_mode
8711 || type_mode
== float_type_mode
8712 || type_mode
== double_type_mode
)
8713 return complex_long_double_type_node
;
8727 /* Return OP, stripped of any conversions to wider types as much as is safe.
8728 Converting the value back to OP's type makes a value equivalent to OP.
8730 If FOR_TYPE is nonzero, we return a value which, if converted to
8731 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8733 OP must have integer, real or enumeral type. Pointers are not allowed!
8735 There are some cases where the obvious value we could return
8736 would regenerate to OP if converted to OP's type,
8737 but would not extend like OP to wider types.
8738 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8739 For example, if OP is (unsigned short)(signed char)-1,
8740 we avoid returning (signed char)-1 if FOR_TYPE is int,
8741 even though extending that to an unsigned short would regenerate OP,
8742 since the result of extending (signed char)-1 to (int)
8743 is different from (int) OP. */
8746 get_unwidened (tree op
, tree for_type
)
8748 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8749 tree type
= TREE_TYPE (op
);
8751 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8753 = (for_type
!= 0 && for_type
!= type
8754 && final_prec
> TYPE_PRECISION (type
)
8755 && TYPE_UNSIGNED (type
));
8758 while (CONVERT_EXPR_P (op
))
8762 /* TYPE_PRECISION on vector types has different meaning
8763 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8764 so avoid them here. */
8765 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8768 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8769 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8771 /* Truncations are many-one so cannot be removed.
8772 Unless we are later going to truncate down even farther. */
8774 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8777 /* See what's inside this conversion. If we decide to strip it,
8779 op
= TREE_OPERAND (op
, 0);
8781 /* If we have not stripped any zero-extensions (uns is 0),
8782 we can strip any kind of extension.
8783 If we have previously stripped a zero-extension,
8784 only zero-extensions can safely be stripped.
8785 Any extension can be stripped if the bits it would produce
8786 are all going to be discarded later by truncating to FOR_TYPE. */
8790 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8792 /* TYPE_UNSIGNED says whether this is a zero-extension.
8793 Let's avoid computing it if it does not affect WIN
8794 and if UNS will not be needed again. */
8796 || CONVERT_EXPR_P (op
))
8797 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8805 /* If we finally reach a constant see if it fits in sth smaller and
8806 in that case convert it. */
8807 if (TREE_CODE (win
) == INTEGER_CST
)
8809 tree wtype
= TREE_TYPE (win
);
8810 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8812 prec
= MAX (prec
, final_prec
);
8813 if (prec
< TYPE_PRECISION (wtype
))
8815 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8816 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8817 win
= fold_convert (t
, win
);
8824 /* Return OP or a simpler expression for a narrower value
8825 which can be sign-extended or zero-extended to give back OP.
8826 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8827 or 0 if the value should be sign-extended. */
8830 get_narrower (tree op
, int *unsignedp_ptr
)
8835 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8837 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8840 op
= TREE_OPERAND (op
, 1);
8841 while (TREE_CODE (op
) == COMPOUND_EXPR
);
8842 tree ret
= get_narrower (op
, unsignedp_ptr
);
8845 auto_vec
<tree
, 16> v
;
8847 for (op
= win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8848 op
= TREE_OPERAND (op
, 1))
8850 FOR_EACH_VEC_ELT_REVERSE (v
, i
, op
)
8851 ret
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8852 TREE_TYPE (win
), TREE_OPERAND (op
, 0),
8856 while (TREE_CODE (op
) == NOP_EXPR
)
8859 = (TYPE_PRECISION (TREE_TYPE (op
))
8860 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8862 /* Truncations are many-one so cannot be removed. */
8866 /* See what's inside this conversion. If we decide to strip it,
8871 op
= TREE_OPERAND (op
, 0);
8872 /* An extension: the outermost one can be stripped,
8873 but remember whether it is zero or sign extension. */
8875 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8876 /* Otherwise, if a sign extension has been stripped,
8877 only sign extensions can now be stripped;
8878 if a zero extension has been stripped, only zero-extensions. */
8879 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8883 else /* bitschange == 0 */
8885 /* A change in nominal type can always be stripped, but we must
8886 preserve the unsignedness. */
8888 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8890 op
= TREE_OPERAND (op
, 0);
8891 /* Keep trying to narrow, but don't assign op to win if it
8892 would turn an integral type into something else. */
8893 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8900 if (TREE_CODE (op
) == COMPONENT_REF
8901 /* Since type_for_size always gives an integer type. */
8902 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8903 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8904 /* Ensure field is laid out already. */
8905 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8906 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8908 unsigned HOST_WIDE_INT innerprec
8909 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8910 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8911 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8912 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8914 /* We can get this structure field in a narrower type that fits it,
8915 but the resulting extension to its nominal type (a fullword type)
8916 must satisfy the same conditions as for other extensions.
8918 Do this only for fields that are aligned (not bit-fields),
8919 because when bit-field insns will be used there is no
8920 advantage in doing this. */
8922 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8923 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8924 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8928 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8929 win
= fold_convert (type
, op
);
8933 *unsignedp_ptr
= uns
;
8937 /* Return true if integer constant C has a value that is permissible
8938 for TYPE, an integral type. */
8941 int_fits_type_p (const_tree c
, const_tree type
)
8943 tree type_low_bound
, type_high_bound
;
8944 bool ok_for_low_bound
, ok_for_high_bound
;
8945 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8947 /* Non-standard boolean types can have arbitrary precision but various
8948 transformations assume that they can only take values 0 and +/-1. */
8949 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8950 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8953 type_low_bound
= TYPE_MIN_VALUE (type
);
8954 type_high_bound
= TYPE_MAX_VALUE (type
);
8956 /* If at least one bound of the type is a constant integer, we can check
8957 ourselves and maybe make a decision. If no such decision is possible, but
8958 this type is a subtype, try checking against that. Otherwise, use
8959 fits_to_tree_p, which checks against the precision.
8961 Compute the status for each possibly constant bound, and return if we see
8962 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8963 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8964 for "constant known to fit". */
8966 /* Check if c >= type_low_bound. */
8967 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8969 if (tree_int_cst_lt (c
, type_low_bound
))
8971 ok_for_low_bound
= true;
8974 ok_for_low_bound
= false;
8976 /* Check if c <= type_high_bound. */
8977 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8979 if (tree_int_cst_lt (type_high_bound
, c
))
8981 ok_for_high_bound
= true;
8984 ok_for_high_bound
= false;
8986 /* If the constant fits both bounds, the result is known. */
8987 if (ok_for_low_bound
&& ok_for_high_bound
)
8990 /* Perform some generic filtering which may allow making a decision
8991 even if the bounds are not constant. First, negative integers
8992 never fit in unsigned types, */
8993 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8996 /* Second, narrower types always fit in wider ones. */
8997 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9000 /* Third, unsigned integers with top bit set never fit signed types. */
9001 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9003 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9004 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9006 /* When a tree_cst is converted to a wide-int, the precision
9007 is taken from the type. However, if the precision of the
9008 mode underneath the type is smaller than that, it is
9009 possible that the value will not fit. The test below
9010 fails if any bit is set between the sign bit of the
9011 underlying mode and the top bit of the type. */
9012 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9015 else if (wi::neg_p (wi::to_wide (c
)))
9019 /* If we haven't been able to decide at this point, there nothing more we
9020 can check ourselves here. Look at the base type if we have one and it
9021 has the same precision. */
9022 if (TREE_CODE (type
) == INTEGER_TYPE
9023 && TREE_TYPE (type
) != 0
9024 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9026 type
= TREE_TYPE (type
);
9030 /* Or to fits_to_tree_p, if nothing else. */
9031 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9034 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9035 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9036 represented (assuming two's-complement arithmetic) within the bit
9037 precision of the type are returned instead. */
9040 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9042 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9043 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9044 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9047 if (TYPE_UNSIGNED (type
))
9048 mpz_set_ui (min
, 0);
9051 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9052 wi::to_mpz (mn
, min
, SIGNED
);
9056 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9057 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9058 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9061 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9062 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9066 /* Return true if VAR is an automatic variable. */
9069 auto_var_p (const_tree var
)
9071 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9072 || TREE_CODE (var
) == PARM_DECL
)
9073 && ! TREE_STATIC (var
))
9074 || TREE_CODE (var
) == RESULT_DECL
);
9077 /* Return true if VAR is an automatic variable defined in function FN. */
9080 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9082 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9083 && (auto_var_p (var
)
9084 || TREE_CODE (var
) == LABEL_DECL
));
9087 /* Subprogram of following function. Called by walk_tree.
9089 Return *TP if it is an automatic variable or parameter of the
9090 function passed in as DATA. */
9093 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9095 tree fn
= (tree
) data
;
9100 else if (DECL_P (*tp
)
9101 && auto_var_in_fn_p (*tp
, fn
))
9107 /* Returns true if T is, contains, or refers to a type with variable
9108 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9109 arguments, but not the return type. If FN is nonzero, only return
9110 true if a modifier of the type or position of FN is a variable or
9111 parameter inside FN.
9113 This concept is more general than that of C99 'variably modified types':
9114 in C99, a struct type is never variably modified because a VLA may not
9115 appear as a structure member. However, in GNU C code like:
9117 struct S { int i[f()]; };
9119 is valid, and other languages may define similar constructs. */
9122 variably_modified_type_p (tree type
, tree fn
)
9126 /* Test if T is either variable (if FN is zero) or an expression containing
9127 a variable in FN. If TYPE isn't gimplified, return true also if
9128 gimplify_one_sizepos would gimplify the expression into a local
9130 #define RETURN_TRUE_IF_VAR(T) \
9131 do { tree _t = (T); \
9132 if (_t != NULL_TREE \
9133 && _t != error_mark_node \
9134 && !CONSTANT_CLASS_P (_t) \
9135 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9137 || (!TYPE_SIZES_GIMPLIFIED (type) \
9138 && (TREE_CODE (_t) != VAR_DECL \
9139 && !CONTAINS_PLACEHOLDER_P (_t))) \
9140 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9141 return true; } while (0)
9143 if (type
== error_mark_node
)
9146 /* If TYPE itself has variable size, it is variably modified. */
9147 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9148 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9150 switch (TREE_CODE (type
))
9153 case REFERENCE_TYPE
:
9155 /* Ada can have pointer types refering to themselves indirectly. */
9156 if (TREE_VISITED (type
))
9158 TREE_VISITED (type
) = true;
9159 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9161 TREE_VISITED (type
) = false;
9164 TREE_VISITED (type
) = false;
9169 /* If TYPE is a function type, it is variably modified if the
9170 return type is variably modified. */
9171 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9177 case FIXED_POINT_TYPE
:
9180 /* Scalar types are variably modified if their end points
9182 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9183 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9188 case QUAL_UNION_TYPE
:
9189 /* We can't see if any of the fields are variably-modified by the
9190 definition we normally use, since that would produce infinite
9191 recursion via pointers. */
9192 /* This is variably modified if some field's type is. */
9193 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9194 if (TREE_CODE (t
) == FIELD_DECL
)
9196 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9197 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9198 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9200 /* If the type is a qualified union, then the DECL_QUALIFIER
9201 of fields can also be an expression containing a variable. */
9202 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9203 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9205 /* If the field is a qualified union, then it's only a container
9206 for what's inside so we look into it. That's necessary in LTO
9207 mode because the sizes of the field tested above have been set
9208 to PLACEHOLDER_EXPRs by free_lang_data. */
9209 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
9210 && variably_modified_type_p (TREE_TYPE (t
), fn
))
9216 /* Do not call ourselves to avoid infinite recursion. This is
9217 variably modified if the element type is. */
9218 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9219 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9226 /* The current language may have other cases to check, but in general,
9227 all other types are not variably modified. */
9228 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9230 #undef RETURN_TRUE_IF_VAR
9233 /* Given a DECL or TYPE, return the scope in which it was declared, or
9234 NULL_TREE if there is no containing scope. */
9237 get_containing_scope (const_tree t
)
9239 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9242 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9245 get_ultimate_context (const_tree decl
)
9247 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9249 if (TREE_CODE (decl
) == BLOCK
)
9250 decl
= BLOCK_SUPERCONTEXT (decl
);
9252 decl
= get_containing_scope (decl
);
9257 /* Return the innermost context enclosing DECL that is
9258 a FUNCTION_DECL, or zero if none. */
9261 decl_function_context (const_tree decl
)
9265 if (TREE_CODE (decl
) == ERROR_MARK
)
9268 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9269 where we look up the function at runtime. Such functions always take
9270 a first argument of type 'pointer to real context'.
9272 C++ should really be fixed to use DECL_CONTEXT for the real context,
9273 and use something else for the "virtual context". */
9274 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9277 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9279 context
= DECL_CONTEXT (decl
);
9281 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9283 if (TREE_CODE (context
) == BLOCK
)
9284 context
= BLOCK_SUPERCONTEXT (context
);
9286 context
= get_containing_scope (context
);
9292 /* Return the innermost context enclosing DECL that is
9293 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9294 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9297 decl_type_context (const_tree decl
)
9299 tree context
= DECL_CONTEXT (decl
);
9302 switch (TREE_CODE (context
))
9304 case NAMESPACE_DECL
:
9305 case TRANSLATION_UNIT_DECL
:
9310 case QUAL_UNION_TYPE
:
9315 context
= DECL_CONTEXT (context
);
9319 context
= BLOCK_SUPERCONTEXT (context
);
9329 /* CALL is a CALL_EXPR. Return the declaration for the function
9330 called, or NULL_TREE if the called function cannot be
9334 get_callee_fndecl (const_tree call
)
9338 if (call
== error_mark_node
)
9339 return error_mark_node
;
9341 /* It's invalid to call this function with anything but a
9343 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9345 /* The first operand to the CALL is the address of the function
9347 addr
= CALL_EXPR_FN (call
);
9349 /* If there is no function, return early. */
9350 if (addr
== NULL_TREE
)
9355 /* If this is a readonly function pointer, extract its initial value. */
9356 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9357 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9358 && DECL_INITIAL (addr
))
9359 addr
= DECL_INITIAL (addr
);
9361 /* If the address is just `&f' for some function `f', then we know
9362 that `f' is being called. */
9363 if (TREE_CODE (addr
) == ADDR_EXPR
9364 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9365 return TREE_OPERAND (addr
, 0);
9367 /* We couldn't figure out what was being called. */
9371 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9372 return the associated function code, otherwise return CFN_LAST. */
9375 get_call_combined_fn (const_tree call
)
9377 /* It's invalid to call this function with anything but a CALL_EXPR. */
9378 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9380 if (!CALL_EXPR_FN (call
))
9381 return as_combined_fn (CALL_EXPR_IFN (call
));
9383 tree fndecl
= get_callee_fndecl (call
);
9384 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9385 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9390 /* Comparator of indices based on tree_node_counts. */
9393 tree_nodes_cmp (const void *p1
, const void *p2
)
9395 const unsigned *n1
= (const unsigned *)p1
;
9396 const unsigned *n2
= (const unsigned *)p2
;
9398 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9401 /* Comparator of indices based on tree_code_counts. */
9404 tree_codes_cmp (const void *p1
, const void *p2
)
9406 const unsigned *n1
= (const unsigned *)p1
;
9407 const unsigned *n2
= (const unsigned *)p2
;
9409 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9412 #define TREE_MEM_USAGE_SPACES 40
9414 /* Print debugging information about tree nodes generated during the compile,
9415 and any language-specific information. */
9418 dump_tree_statistics (void)
9420 if (GATHER_STATISTICS
)
9422 uint64_t total_nodes
, total_bytes
;
9423 fprintf (stderr
, "\nKind Nodes Bytes\n");
9424 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9425 total_nodes
= total_bytes
= 0;
9428 auto_vec
<unsigned> indices (all_kinds
);
9429 for (unsigned i
= 0; i
< all_kinds
; i
++)
9430 indices
.quick_push (i
);
9431 indices
.qsort (tree_nodes_cmp
);
9433 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9435 unsigned j
= indices
[i
];
9436 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9437 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
9438 SIZE_AMOUNT (tree_node_sizes
[j
]));
9439 total_nodes
+= tree_node_counts
[j
];
9440 total_bytes
+= tree_node_sizes
[j
];
9442 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9443 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9444 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9445 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9449 fprintf (stderr
, "Code Nodes\n");
9450 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9452 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9453 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9454 indices
.quick_push (i
);
9455 indices
.qsort (tree_codes_cmp
);
9457 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9459 unsigned j
= indices
[i
];
9460 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9461 get_tree_code_name ((enum tree_code
) j
),
9462 SIZE_AMOUNT (tree_code_counts
[j
]));
9464 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9465 fprintf (stderr
, "\n");
9466 ssanames_print_statistics ();
9467 fprintf (stderr
, "\n");
9468 phinodes_print_statistics ();
9469 fprintf (stderr
, "\n");
9473 fprintf (stderr
, "(No per-node statistics)\n");
9475 print_type_hash_statistics ();
9476 print_debug_expr_statistics ();
9477 print_value_expr_statistics ();
9478 lang_hooks
.print_statistics ();
9481 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9483 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9486 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9488 /* This relies on the raw feedback's top 4 bits being zero. */
9489 #define FEEDBACK(X) ((X) * 0x04c11db7)
9490 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9491 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9492 static const unsigned syndromes
[16] =
9494 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9495 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9496 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9497 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9502 value
<<= (32 - bytes
* 8);
9503 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9505 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9507 chksum
= (chksum
<< 4) ^ feedback
;
9513 /* Generate a crc32 of a string. */
9516 crc32_string (unsigned chksum
, const char *string
)
9519 chksum
= crc32_byte (chksum
, *string
);
9524 /* P is a string that will be used in a symbol. Mask out any characters
9525 that are not valid in that context. */
9528 clean_symbol_name (char *p
)
9532 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9535 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9542 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9544 /* Create a unique anonymous identifier. The identifier is still a
9545 valid assembly label. */
9551 #if !defined (NO_DOT_IN_LABEL)
9553 #elif !defined (NO_DOLLAR_IN_LABEL)
9561 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9562 gcc_checking_assert (len
< int (sizeof (buf
)));
9564 tree id
= get_identifier_with_length (buf
, len
);
9565 IDENTIFIER_ANON_P (id
) = true;
9570 /* Generate a name for a special-purpose function.
9571 The generated name may need to be unique across the whole link.
9572 Changes to this function may also require corresponding changes to
9573 xstrdup_mask_random.
9574 TYPE is some string to identify the purpose of this function to the
9575 linker or collect2; it must start with an uppercase letter,
9577 I - for constructors
9579 N - for C++ anonymous namespaces
9580 F - for DWARF unwind frame information. */
9583 get_file_function_name (const char *type
)
9589 /* If we already have a name we know to be unique, just use that. */
9590 if (first_global_object_name
)
9591 p
= q
= ASTRDUP (first_global_object_name
);
9592 /* If the target is handling the constructors/destructors, they
9593 will be local to this file and the name is only necessary for
9595 We also assign sub_I and sub_D sufixes to constructors called from
9596 the global static constructors. These are always local. */
9597 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9598 || (strncmp (type
, "sub_", 4) == 0
9599 && (type
[4] == 'I' || type
[4] == 'D')))
9601 const char *file
= main_input_filename
;
9603 file
= LOCATION_FILE (input_location
);
9604 /* Just use the file's basename, because the full pathname
9605 might be quite long. */
9606 p
= q
= ASTRDUP (lbasename (file
));
9610 /* Otherwise, the name must be unique across the entire link.
9611 We don't have anything that we know to be unique to this translation
9612 unit, so use what we do have and throw in some randomness. */
9614 const char *name
= weak_global_object_name
;
9615 const char *file
= main_input_filename
;
9620 file
= LOCATION_FILE (input_location
);
9622 len
= strlen (file
);
9623 q
= (char *) alloca (9 + 19 + len
+ 1);
9624 memcpy (q
, file
, len
+ 1);
9626 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9627 crc32_string (0, name
), get_random_seed (false));
9632 clean_symbol_name (q
);
9633 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9636 /* Set up the name of the file-level functions we may need.
9637 Use a global object (which is already required to be unique over
9638 the program) rather than the file name (which imposes extra
9640 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9642 return get_identifier (buf
);
9645 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9647 /* Complain that the tree code of NODE does not match the expected 0
9648 terminated list of trailing codes. The trailing code list can be
9649 empty, for a more vague error message. FILE, LINE, and FUNCTION
9650 are of the caller. */
9653 tree_check_failed (const_tree node
, const char *file
,
9654 int line
, const char *function
, ...)
9658 unsigned length
= 0;
9659 enum tree_code code
;
9661 va_start (args
, function
);
9662 while ((code
= (enum tree_code
) va_arg (args
, int)))
9663 length
+= 4 + strlen (get_tree_code_name (code
));
9668 va_start (args
, function
);
9669 length
+= strlen ("expected ");
9670 buffer
= tmp
= (char *) alloca (length
);
9672 while ((code
= (enum tree_code
) va_arg (args
, int)))
9674 const char *prefix
= length
? " or " : "expected ";
9676 strcpy (tmp
+ length
, prefix
);
9677 length
+= strlen (prefix
);
9678 strcpy (tmp
+ length
, get_tree_code_name (code
));
9679 length
+= strlen (get_tree_code_name (code
));
9684 buffer
= "unexpected node";
9686 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9687 buffer
, get_tree_code_name (TREE_CODE (node
)),
9688 function
, trim_filename (file
), line
);
9691 /* Complain that the tree code of NODE does match the expected 0
9692 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9696 tree_not_check_failed (const_tree node
, const char *file
,
9697 int line
, const char *function
, ...)
9701 unsigned length
= 0;
9702 enum tree_code code
;
9704 va_start (args
, function
);
9705 while ((code
= (enum tree_code
) va_arg (args
, int)))
9706 length
+= 4 + strlen (get_tree_code_name (code
));
9708 va_start (args
, function
);
9709 buffer
= (char *) alloca (length
);
9711 while ((code
= (enum tree_code
) va_arg (args
, int)))
9715 strcpy (buffer
+ length
, " or ");
9718 strcpy (buffer
+ length
, get_tree_code_name (code
));
9719 length
+= strlen (get_tree_code_name (code
));
9723 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9724 buffer
, get_tree_code_name (TREE_CODE (node
)),
9725 function
, trim_filename (file
), line
);
9728 /* Similar to tree_check_failed, except that we check for a class of tree
9729 code, given in CL. */
9732 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9733 const char *file
, int line
, const char *function
)
9736 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9737 TREE_CODE_CLASS_STRING (cl
),
9738 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9739 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9742 /* Similar to tree_check_failed, except that instead of specifying a
9743 dozen codes, use the knowledge that they're all sequential. */
9746 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9747 const char *function
, enum tree_code c1
,
9751 unsigned length
= 0;
9754 for (c
= c1
; c
<= c2
; ++c
)
9755 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9757 length
+= strlen ("expected ");
9758 buffer
= (char *) alloca (length
);
9761 for (c
= c1
; c
<= c2
; ++c
)
9763 const char *prefix
= length
? " or " : "expected ";
9765 strcpy (buffer
+ length
, prefix
);
9766 length
+= strlen (prefix
);
9767 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9768 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9771 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9772 buffer
, get_tree_code_name (TREE_CODE (node
)),
9773 function
, trim_filename (file
), line
);
9777 /* Similar to tree_check_failed, except that we check that a tree does
9778 not have the specified code, given in CL. */
9781 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9782 const char *file
, int line
, const char *function
)
9785 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9786 TREE_CODE_CLASS_STRING (cl
),
9787 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9788 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9792 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9795 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9796 const char *function
, enum omp_clause_code code
)
9798 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9800 omp_clause_code_name
[code
],
9801 get_tree_code_name (TREE_CODE (node
)),
9802 function
, trim_filename (file
), line
);
9806 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9809 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9810 const char *function
, enum omp_clause_code c1
,
9811 enum omp_clause_code c2
)
9814 unsigned length
= 0;
9817 for (c
= c1
; c
<= c2
; ++c
)
9818 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9820 length
+= strlen ("expected ");
9821 buffer
= (char *) alloca (length
);
9824 for (c
= c1
; c
<= c2
; ++c
)
9826 const char *prefix
= length
? " or " : "expected ";
9828 strcpy (buffer
+ length
, prefix
);
9829 length
+= strlen (prefix
);
9830 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9831 length
+= strlen (omp_clause_code_name
[c
]);
9834 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9835 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9836 function
, trim_filename (file
), line
);
9840 #undef DEFTREESTRUCT
9841 #define DEFTREESTRUCT(VAL, NAME) NAME,
9843 static const char *ts_enum_names
[] = {
9844 #include "treestruct.def"
9846 #undef DEFTREESTRUCT
9848 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9850 /* Similar to tree_class_check_failed, except that we check for
9851 whether CODE contains the tree structure identified by EN. */
9854 tree_contains_struct_check_failed (const_tree node
,
9855 const enum tree_node_structure_enum en
,
9856 const char *file
, int line
,
9857 const char *function
)
9860 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9862 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9866 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9867 (dynamically sized) vector. */
9870 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9871 const char *function
)
9874 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
9876 idx
+ 1, len
, function
, trim_filename (file
), line
);
9879 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9880 (dynamically sized) vector. */
9883 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9884 const char *function
)
9887 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
9888 idx
+ 1, len
, function
, trim_filename (file
), line
);
9891 /* Similar to above, except that the check is for the bounds of the operand
9892 vector of an expression node EXP. */
9895 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9896 int line
, const char *function
)
9898 enum tree_code code
= TREE_CODE (exp
);
9900 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9901 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9902 function
, trim_filename (file
), line
);
9905 /* Similar to above, except that the check is for the number of
9906 operands of an OMP_CLAUSE node. */
9909 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9910 int line
, const char *function
)
9913 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
9914 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9915 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9916 trim_filename (file
), line
);
9918 #endif /* ENABLE_TREE_CHECKING */
9920 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9921 and mapped to the machine mode MODE. Initialize its fields and build
9922 the information necessary for debugging output. */
9925 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9928 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9930 t
= make_node (VECTOR_TYPE
);
9931 TREE_TYPE (t
) = mv_innertype
;
9932 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9933 SET_TYPE_MODE (t
, mode
);
9935 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9936 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9937 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9938 || mode
!= VOIDmode
)
9939 && !VECTOR_BOOLEAN_TYPE_P (t
))
9941 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9945 hashval_t hash
= type_hash_canon_hash (t
);
9946 t
= type_hash_canon (hash
, t
);
9948 /* We have built a main variant, based on the main variant of the
9949 inner type. Use it to build the variant we return. */
9950 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9951 && TREE_TYPE (t
) != innertype
)
9952 return build_type_attribute_qual_variant (t
,
9953 TYPE_ATTRIBUTES (innertype
),
9954 TYPE_QUALS (innertype
));
9960 make_or_reuse_type (unsigned size
, int unsignedp
)
9964 if (size
== INT_TYPE_SIZE
)
9965 return unsignedp
? unsigned_type_node
: integer_type_node
;
9966 if (size
== CHAR_TYPE_SIZE
)
9967 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9968 if (size
== SHORT_TYPE_SIZE
)
9969 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9970 if (size
== LONG_TYPE_SIZE
)
9971 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9972 if (size
== LONG_LONG_TYPE_SIZE
)
9973 return (unsignedp
? long_long_unsigned_type_node
9974 : long_long_integer_type_node
);
9976 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9977 if (size
== int_n_data
[i
].bitsize
9978 && int_n_enabled_p
[i
])
9979 return (unsignedp
? int_n_trees
[i
].unsigned_type
9980 : int_n_trees
[i
].signed_type
);
9983 return make_unsigned_type (size
);
9985 return make_signed_type (size
);
9988 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9991 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9995 if (size
== SHORT_FRACT_TYPE_SIZE
)
9996 return unsignedp
? sat_unsigned_short_fract_type_node
9997 : sat_short_fract_type_node
;
9998 if (size
== FRACT_TYPE_SIZE
)
9999 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10000 if (size
== LONG_FRACT_TYPE_SIZE
)
10001 return unsignedp
? sat_unsigned_long_fract_type_node
10002 : sat_long_fract_type_node
;
10003 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10004 return unsignedp
? sat_unsigned_long_long_fract_type_node
10005 : sat_long_long_fract_type_node
;
10009 if (size
== SHORT_FRACT_TYPE_SIZE
)
10010 return unsignedp
? unsigned_short_fract_type_node
10011 : short_fract_type_node
;
10012 if (size
== FRACT_TYPE_SIZE
)
10013 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10014 if (size
== LONG_FRACT_TYPE_SIZE
)
10015 return unsignedp
? unsigned_long_fract_type_node
10016 : long_fract_type_node
;
10017 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10018 return unsignedp
? unsigned_long_long_fract_type_node
10019 : long_long_fract_type_node
;
10022 return make_fract_type (size
, unsignedp
, satp
);
10025 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10028 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10032 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10033 return unsignedp
? sat_unsigned_short_accum_type_node
10034 : sat_short_accum_type_node
;
10035 if (size
== ACCUM_TYPE_SIZE
)
10036 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10037 if (size
== LONG_ACCUM_TYPE_SIZE
)
10038 return unsignedp
? sat_unsigned_long_accum_type_node
10039 : sat_long_accum_type_node
;
10040 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10041 return unsignedp
? sat_unsigned_long_long_accum_type_node
10042 : sat_long_long_accum_type_node
;
10046 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10047 return unsignedp
? unsigned_short_accum_type_node
10048 : short_accum_type_node
;
10049 if (size
== ACCUM_TYPE_SIZE
)
10050 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10051 if (size
== LONG_ACCUM_TYPE_SIZE
)
10052 return unsignedp
? unsigned_long_accum_type_node
10053 : long_accum_type_node
;
10054 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10055 return unsignedp
? unsigned_long_long_accum_type_node
10056 : long_long_accum_type_node
;
10059 return make_accum_type (size
, unsignedp
, satp
);
10063 /* Create an atomic variant node for TYPE. This routine is called
10064 during initialization of data types to create the 5 basic atomic
10065 types. The generic build_variant_type function requires these to
10066 already be set up in order to function properly, so cannot be
10067 called from there. If ALIGN is non-zero, then ensure alignment is
10068 overridden to this value. */
10071 build_atomic_base (tree type
, unsigned int align
)
10075 /* Make sure its not already registered. */
10076 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10079 t
= build_variant_type_copy (type
);
10080 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10083 SET_TYPE_ALIGN (t
, align
);
10088 /* Information about the _FloatN and _FloatNx types. This must be in
10089 the same order as the corresponding TI_* enum values. */
10090 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10102 /* Create nodes for all integer types (and error_mark_node) using the sizes
10103 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10106 build_common_tree_nodes (bool signed_char
)
10110 error_mark_node
= make_node (ERROR_MARK
);
10111 TREE_TYPE (error_mark_node
) = error_mark_node
;
10113 initialize_sizetypes ();
10115 /* Define both `signed char' and `unsigned char'. */
10116 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10117 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10118 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10119 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10121 /* Define `char', which is like either `signed char' or `unsigned char'
10122 but not the same as either. */
10125 ? make_signed_type (CHAR_TYPE_SIZE
)
10126 : make_unsigned_type (CHAR_TYPE_SIZE
));
10127 TYPE_STRING_FLAG (char_type_node
) = 1;
10129 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10130 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10131 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10132 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10133 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10134 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10135 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10136 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10138 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10140 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10141 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10143 if (int_n_enabled_p
[i
])
10145 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10146 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10150 /* Define a boolean type. This type only represents boolean values but
10151 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10152 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10153 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10154 TYPE_PRECISION (boolean_type_node
) = 1;
10155 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10157 /* Define what type to use for size_t. */
10158 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10159 size_type_node
= unsigned_type_node
;
10160 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10161 size_type_node
= long_unsigned_type_node
;
10162 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10163 size_type_node
= long_long_unsigned_type_node
;
10164 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10165 size_type_node
= short_unsigned_type_node
;
10170 size_type_node
= NULL_TREE
;
10171 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10172 if (int_n_enabled_p
[i
])
10174 char name
[50], altname
[50];
10175 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10176 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10178 if (strcmp (name
, SIZE_TYPE
) == 0
10179 || strcmp (altname
, SIZE_TYPE
) == 0)
10181 size_type_node
= int_n_trees
[i
].unsigned_type
;
10184 if (size_type_node
== NULL_TREE
)
10185 gcc_unreachable ();
10188 /* Define what type to use for ptrdiff_t. */
10189 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10190 ptrdiff_type_node
= integer_type_node
;
10191 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10192 ptrdiff_type_node
= long_integer_type_node
;
10193 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10194 ptrdiff_type_node
= long_long_integer_type_node
;
10195 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10196 ptrdiff_type_node
= short_integer_type_node
;
10199 ptrdiff_type_node
= NULL_TREE
;
10200 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10201 if (int_n_enabled_p
[i
])
10203 char name
[50], altname
[50];
10204 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10205 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10207 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10208 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10209 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10211 if (ptrdiff_type_node
== NULL_TREE
)
10212 gcc_unreachable ();
10215 /* Fill in the rest of the sized types. Reuse existing type nodes
10217 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10218 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10219 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10220 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10221 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10223 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10224 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10225 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10226 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10227 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10229 /* Don't call build_qualified type for atomics. That routine does
10230 special processing for atomics, and until they are initialized
10231 it's better not to make that call.
10233 Check to see if there is a target override for atomic types. */
10235 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10236 targetm
.atomic_align_for_mode (QImode
));
10237 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10238 targetm
.atomic_align_for_mode (HImode
));
10239 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10240 targetm
.atomic_align_for_mode (SImode
));
10241 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10242 targetm
.atomic_align_for_mode (DImode
));
10243 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10244 targetm
.atomic_align_for_mode (TImode
));
10246 access_public_node
= get_identifier ("public");
10247 access_protected_node
= get_identifier ("protected");
10248 access_private_node
= get_identifier ("private");
10250 /* Define these next since types below may used them. */
10251 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10252 integer_one_node
= build_int_cst (integer_type_node
, 1);
10253 integer_three_node
= build_int_cst (integer_type_node
, 3);
10254 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10256 size_zero_node
= size_int (0);
10257 size_one_node
= size_int (1);
10258 bitsize_zero_node
= bitsize_int (0);
10259 bitsize_one_node
= bitsize_int (1);
10260 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10262 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10263 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10265 void_type_node
= make_node (VOID_TYPE
);
10266 layout_type (void_type_node
);
10268 /* We are not going to have real types in C with less than byte alignment,
10269 so we might as well not have any types that claim to have it. */
10270 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10271 TYPE_USER_ALIGN (void_type_node
) = 0;
10273 void_node
= make_node (VOID_CST
);
10274 TREE_TYPE (void_node
) = void_type_node
;
10276 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10277 layout_type (TREE_TYPE (null_pointer_node
));
10279 ptr_type_node
= build_pointer_type (void_type_node
);
10280 const_ptr_type_node
10281 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10282 for (unsigned i
= 0;
10283 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10285 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10287 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10289 float_type_node
= make_node (REAL_TYPE
);
10290 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10291 layout_type (float_type_node
);
10293 double_type_node
= make_node (REAL_TYPE
);
10294 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10295 layout_type (double_type_node
);
10297 long_double_type_node
= make_node (REAL_TYPE
);
10298 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10299 layout_type (long_double_type_node
);
10301 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10303 int n
= floatn_nx_types
[i
].n
;
10304 bool extended
= floatn_nx_types
[i
].extended
;
10305 scalar_float_mode mode
;
10306 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10308 int precision
= GET_MODE_PRECISION (mode
);
10309 /* Work around the rs6000 KFmode having precision 113 not
10311 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10312 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10313 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10315 gcc_assert (min_precision
== n
);
10316 if (precision
< min_precision
)
10317 precision
= min_precision
;
10318 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10319 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10320 layout_type (FLOATN_NX_TYPE_NODE (i
));
10321 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10324 float_ptr_type_node
= build_pointer_type (float_type_node
);
10325 double_ptr_type_node
= build_pointer_type (double_type_node
);
10326 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10327 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10329 /* Fixed size integer types. */
10330 uint16_type_node
= make_or_reuse_type (16, 1);
10331 uint32_type_node
= make_or_reuse_type (32, 1);
10332 uint64_type_node
= make_or_reuse_type (64, 1);
10334 /* Decimal float types. */
10335 if (targetm
.decimal_float_supported_p ())
10337 dfloat32_type_node
= make_node (REAL_TYPE
);
10338 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10339 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10340 layout_type (dfloat32_type_node
);
10342 dfloat64_type_node
= make_node (REAL_TYPE
);
10343 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10344 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10345 layout_type (dfloat64_type_node
);
10347 dfloat128_type_node
= make_node (REAL_TYPE
);
10348 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10349 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10350 layout_type (dfloat128_type_node
);
10353 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10354 complex_float_type_node
= build_complex_type (float_type_node
, true);
10355 complex_double_type_node
= build_complex_type (double_type_node
, true);
10356 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10359 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10361 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10362 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10363 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10366 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10367 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10368 sat_ ## KIND ## _type_node = \
10369 make_sat_signed_ ## KIND ## _type (SIZE); \
10370 sat_unsigned_ ## KIND ## _type_node = \
10371 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10372 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10373 unsigned_ ## KIND ## _type_node = \
10374 make_unsigned_ ## KIND ## _type (SIZE);
10376 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10377 sat_ ## WIDTH ## KIND ## _type_node = \
10378 make_sat_signed_ ## KIND ## _type (SIZE); \
10379 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10380 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10381 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10382 unsigned_ ## WIDTH ## KIND ## _type_node = \
10383 make_unsigned_ ## KIND ## _type (SIZE);
10385 /* Make fixed-point type nodes based on four different widths. */
10386 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10387 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10388 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10389 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10390 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10392 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10393 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10394 NAME ## _type_node = \
10395 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10396 u ## NAME ## _type_node = \
10397 make_or_reuse_unsigned_ ## KIND ## _type \
10398 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10399 sat_ ## NAME ## _type_node = \
10400 make_or_reuse_sat_signed_ ## KIND ## _type \
10401 (GET_MODE_BITSIZE (MODE ## mode)); \
10402 sat_u ## NAME ## _type_node = \
10403 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10404 (GET_MODE_BITSIZE (U ## MODE ## mode));
10406 /* Fixed-point type and mode nodes. */
10407 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10408 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10409 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10410 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10411 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10412 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10413 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10414 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10415 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10416 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10417 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10420 tree t
= targetm
.build_builtin_va_list ();
10422 /* Many back-ends define record types without setting TYPE_NAME.
10423 If we copied the record type here, we'd keep the original
10424 record type without a name. This breaks name mangling. So,
10425 don't copy record types and let c_common_nodes_and_builtins()
10426 declare the type to be __builtin_va_list. */
10427 if (TREE_CODE (t
) != RECORD_TYPE
)
10428 t
= build_variant_type_copy (t
);
10430 va_list_type_node
= t
;
10433 /* SCEV analyzer global shared trees. */
10434 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10435 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10436 chrec_known
= make_node (SCEV_KNOWN
);
10437 TREE_TYPE (chrec_known
) = void_type_node
;
10440 /* Modify DECL for given flags.
10441 TM_PURE attribute is set only on types, so the function will modify
10442 DECL's type when ECF_TM_PURE is used. */
10445 set_call_expr_flags (tree decl
, int flags
)
10447 if (flags
& ECF_NOTHROW
)
10448 TREE_NOTHROW (decl
) = 1;
10449 if (flags
& ECF_CONST
)
10450 TREE_READONLY (decl
) = 1;
10451 if (flags
& ECF_PURE
)
10452 DECL_PURE_P (decl
) = 1;
10453 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10454 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10455 if (flags
& ECF_NOVOPS
)
10456 DECL_IS_NOVOPS (decl
) = 1;
10457 if (flags
& ECF_NORETURN
)
10458 TREE_THIS_VOLATILE (decl
) = 1;
10459 if (flags
& ECF_MALLOC
)
10460 DECL_IS_MALLOC (decl
) = 1;
10461 if (flags
& ECF_RETURNS_TWICE
)
10462 DECL_IS_RETURNS_TWICE (decl
) = 1;
10463 if (flags
& ECF_LEAF
)
10464 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10465 NULL
, DECL_ATTRIBUTES (decl
));
10466 if (flags
& ECF_COLD
)
10467 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10468 NULL
, DECL_ATTRIBUTES (decl
));
10469 if (flags
& ECF_RET1
)
10470 DECL_ATTRIBUTES (decl
)
10471 = tree_cons (get_identifier ("fn spec"),
10472 build_tree_list (NULL_TREE
, build_string (1, "1")),
10473 DECL_ATTRIBUTES (decl
));
10474 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10475 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10476 /* Looping const or pure is implied by noreturn.
10477 There is currently no way to declare looping const or looping pure alone. */
10478 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10479 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10483 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10486 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10487 const char *library_name
, int ecf_flags
)
10491 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10492 library_name
, NULL_TREE
);
10493 set_call_expr_flags (decl
, ecf_flags
);
10495 set_builtin_decl (code
, decl
, true);
10498 /* Call this function after instantiating all builtins that the language
10499 front end cares about. This will build the rest of the builtins
10500 and internal functions that are relied upon by the tree optimizers and
10504 build_common_builtin_nodes (void)
10509 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10510 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10512 ftype
= build_function_type (void_type_node
, void_list_node
);
10513 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10514 local_define_builtin ("__builtin_unreachable", ftype
,
10515 BUILT_IN_UNREACHABLE
,
10516 "__builtin_unreachable",
10517 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10518 | ECF_CONST
| ECF_COLD
);
10519 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10520 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10522 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10525 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10526 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10528 ftype
= build_function_type_list (ptr_type_node
,
10529 ptr_type_node
, const_ptr_type_node
,
10530 size_type_node
, NULL_TREE
);
10532 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10533 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10534 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10535 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10536 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10537 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10540 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10542 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10543 const_ptr_type_node
, size_type_node
,
10545 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10546 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10549 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10551 ftype
= build_function_type_list (ptr_type_node
,
10552 ptr_type_node
, integer_type_node
,
10553 size_type_node
, NULL_TREE
);
10554 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10555 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10558 /* If we're checking the stack, `alloca' can throw. */
10559 const int alloca_flags
10560 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10562 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10564 ftype
= build_function_type_list (ptr_type_node
,
10565 size_type_node
, NULL_TREE
);
10566 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10567 "alloca", alloca_flags
);
10570 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10571 size_type_node
, NULL_TREE
);
10572 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10573 BUILT_IN_ALLOCA_WITH_ALIGN
,
10574 "__builtin_alloca_with_align",
10577 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10578 size_type_node
, size_type_node
, NULL_TREE
);
10579 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10580 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10581 "__builtin_alloca_with_align_and_max",
10584 ftype
= build_function_type_list (void_type_node
,
10585 ptr_type_node
, ptr_type_node
,
10586 ptr_type_node
, NULL_TREE
);
10587 local_define_builtin ("__builtin_init_trampoline", ftype
,
10588 BUILT_IN_INIT_TRAMPOLINE
,
10589 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10590 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10591 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10592 "__builtin_init_heap_trampoline",
10593 ECF_NOTHROW
| ECF_LEAF
);
10594 local_define_builtin ("__builtin_init_descriptor", ftype
,
10595 BUILT_IN_INIT_DESCRIPTOR
,
10596 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10598 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10599 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10600 BUILT_IN_ADJUST_TRAMPOLINE
,
10601 "__builtin_adjust_trampoline",
10602 ECF_CONST
| ECF_NOTHROW
);
10603 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10604 BUILT_IN_ADJUST_DESCRIPTOR
,
10605 "__builtin_adjust_descriptor",
10606 ECF_CONST
| ECF_NOTHROW
);
10608 ftype
= build_function_type_list (void_type_node
,
10609 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10610 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10611 BUILT_IN_NONLOCAL_GOTO
,
10612 "__builtin_nonlocal_goto",
10613 ECF_NORETURN
| ECF_NOTHROW
);
10615 ftype
= build_function_type_list (void_type_node
,
10616 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10617 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10618 BUILT_IN_SETJMP_SETUP
,
10619 "__builtin_setjmp_setup", ECF_NOTHROW
);
10621 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10622 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10623 BUILT_IN_SETJMP_RECEIVER
,
10624 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10626 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10627 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10628 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10630 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10631 local_define_builtin ("__builtin_stack_restore", ftype
,
10632 BUILT_IN_STACK_RESTORE
,
10633 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10635 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10636 const_ptr_type_node
, size_type_node
,
10638 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10639 "__builtin_memcmp_eq",
10640 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10642 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10643 "__builtin_strncmp_eq",
10644 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10646 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10647 "__builtin_strcmp_eq",
10648 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10650 /* If there's a possibility that we might use the ARM EABI, build the
10651 alternate __cxa_end_cleanup node used to resume from C++. */
10652 if (targetm
.arm_eabi_unwinder
)
10654 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10655 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10656 BUILT_IN_CXA_END_CLEANUP
,
10657 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10660 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10661 local_define_builtin ("__builtin_unwind_resume", ftype
,
10662 BUILT_IN_UNWIND_RESUME
,
10663 ((targetm_common
.except_unwind_info (&global_options
)
10665 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10668 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10670 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10672 local_define_builtin ("__builtin_return_address", ftype
,
10673 BUILT_IN_RETURN_ADDRESS
,
10674 "__builtin_return_address",
10678 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10679 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10681 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10682 ptr_type_node
, NULL_TREE
);
10683 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10684 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10685 BUILT_IN_PROFILE_FUNC_ENTER
,
10686 "__cyg_profile_func_enter", 0);
10687 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10688 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10689 BUILT_IN_PROFILE_FUNC_EXIT
,
10690 "__cyg_profile_func_exit", 0);
10693 /* The exception object and filter values from the runtime. The argument
10694 must be zero before exception lowering, i.e. from the front end. After
10695 exception lowering, it will be the region number for the exception
10696 landing pad. These functions are PURE instead of CONST to prevent
10697 them from being hoisted past the exception edge that will initialize
10698 its value in the landing pad. */
10699 ftype
= build_function_type_list (ptr_type_node
,
10700 integer_type_node
, NULL_TREE
);
10701 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10702 /* Only use TM_PURE if we have TM language support. */
10703 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10704 ecf_flags
|= ECF_TM_PURE
;
10705 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10706 "__builtin_eh_pointer", ecf_flags
);
10708 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10709 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10710 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10711 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10713 ftype
= build_function_type_list (void_type_node
,
10714 integer_type_node
, integer_type_node
,
10716 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10717 BUILT_IN_EH_COPY_VALUES
,
10718 "__builtin_eh_copy_values", ECF_NOTHROW
);
10720 /* Complex multiplication and division. These are handled as builtins
10721 rather than optabs because emit_library_call_value doesn't support
10722 complex. Further, we can do slightly better with folding these
10723 beasties if the real and complex parts of the arguments are separate. */
10727 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10729 char mode_name_buf
[4], *q
;
10731 enum built_in_function mcode
, dcode
;
10732 tree type
, inner_type
;
10733 const char *prefix
= "__";
10735 if (targetm
.libfunc_gnu_prefix
)
10738 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10741 inner_type
= TREE_TYPE (type
);
10743 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10744 inner_type
, inner_type
, NULL_TREE
);
10746 mcode
= ((enum built_in_function
)
10747 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10748 dcode
= ((enum built_in_function
)
10749 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10751 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10755 /* For -ftrapping-math these should throw from a former
10756 -fnon-call-exception stmt. */
10757 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10759 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10760 built_in_names
[mcode
],
10761 ECF_CONST
| ECF_LEAF
);
10763 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10765 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10766 built_in_names
[dcode
],
10767 ECF_CONST
| ECF_LEAF
);
10771 init_internal_fns ();
10774 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10777 If we requested a pointer to a vector, build up the pointers that
10778 we stripped off while looking for the inner type. Similarly for
10779 return values from functions.
10781 The argument TYPE is the top of the chain, and BOTTOM is the
10782 new type which we will point to. */
10785 reconstruct_complex_type (tree type
, tree bottom
)
10789 if (TREE_CODE (type
) == POINTER_TYPE
)
10791 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10792 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10793 TYPE_REF_CAN_ALIAS_ALL (type
));
10795 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10797 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10798 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10799 TYPE_REF_CAN_ALIAS_ALL (type
));
10801 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10803 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10804 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10806 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10808 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10809 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10811 else if (TREE_CODE (type
) == METHOD_TYPE
)
10813 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10814 /* The build_method_type_directly() routine prepends 'this' to argument list,
10815 so we must compensate by getting rid of it. */
10817 = build_method_type_directly
10818 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10820 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10822 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10824 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10825 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10830 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10831 TYPE_QUALS (type
));
10834 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10837 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10840 unsigned int bitsize
;
10842 switch (GET_MODE_CLASS (mode
))
10844 case MODE_VECTOR_BOOL
:
10845 case MODE_VECTOR_INT
:
10846 case MODE_VECTOR_FLOAT
:
10847 case MODE_VECTOR_FRACT
:
10848 case MODE_VECTOR_UFRACT
:
10849 case MODE_VECTOR_ACCUM
:
10850 case MODE_VECTOR_UACCUM
:
10851 nunits
= GET_MODE_NUNITS (mode
);
10855 /* Check that there are no leftover bits. */
10856 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10857 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10858 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10862 gcc_unreachable ();
10865 return make_vector_type (innertype
, nunits
, mode
);
10868 /* Similarly, but takes the inner type and number of units, which must be
10872 build_vector_type (tree innertype
, poly_int64 nunits
)
10874 return make_vector_type (innertype
, nunits
, VOIDmode
);
10877 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10880 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
10882 gcc_assert (mask_mode
!= BLKmode
);
10884 poly_uint64 vsize
= GET_MODE_BITSIZE (mask_mode
);
10885 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10886 tree bool_type
= build_nonstandard_boolean_type (esize
);
10888 return make_vector_type (bool_type
, nunits
, mask_mode
);
10891 /* Build a vector type that holds one boolean result for each element of
10892 vector type VECTYPE. The public interface for this operation is
10896 build_truth_vector_type_for (tree vectype
)
10898 machine_mode vector_mode
= TYPE_MODE (vectype
);
10899 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
10901 machine_mode mask_mode
;
10902 if (VECTOR_MODE_P (vector_mode
)
10903 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
10904 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
10906 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
10907 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10908 tree bool_type
= build_nonstandard_boolean_type (esize
);
10910 return make_vector_type (bool_type
, nunits
, BLKmode
);
10913 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10917 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10919 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10921 /* We always build the non-opaque variant before the opaque one,
10922 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10923 cand
= TYPE_NEXT_VARIANT (t
);
10925 && TYPE_VECTOR_OPAQUE (cand
)
10926 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10928 /* Othewise build a variant type and make sure to queue it after
10929 the non-opaque type. */
10930 cand
= build_distinct_type_copy (t
);
10931 TYPE_VECTOR_OPAQUE (cand
) = true;
10932 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10933 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10934 TYPE_NEXT_VARIANT (t
) = cand
;
10935 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10939 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10942 vector_cst_int_elt (const_tree t
, unsigned int i
)
10944 /* First handle elements that are directly encoded. */
10945 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10946 if (i
< encoded_nelts
)
10947 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10949 /* Identify the pattern that contains element I and work out the index of
10950 the last encoded element for that pattern. */
10951 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10952 unsigned int pattern
= i
% npatterns
;
10953 unsigned int count
= i
/ npatterns
;
10954 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10956 /* If there are no steps, the final encoded value is the right one. */
10957 if (!VECTOR_CST_STEPPED_P (t
))
10958 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10960 /* Otherwise work out the value from the last two encoded elements. */
10961 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10962 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10963 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10964 return wi::to_wide (v2
) + (count
- 2) * diff
;
10967 /* Return the value of element I of VECTOR_CST T. */
10970 vector_cst_elt (const_tree t
, unsigned int i
)
10972 /* First handle elements that are directly encoded. */
10973 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10974 if (i
< encoded_nelts
)
10975 return VECTOR_CST_ENCODED_ELT (t
, i
);
10977 /* If there are no steps, the final encoded value is the right one. */
10978 if (!VECTOR_CST_STEPPED_P (t
))
10980 /* Identify the pattern that contains element I and work out the index of
10981 the last encoded element for that pattern. */
10982 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10983 unsigned int pattern
= i
% npatterns
;
10984 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10985 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10988 /* Otherwise work out the value from the last two encoded elements. */
10989 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10990 vector_cst_int_elt (t
, i
));
10993 /* Given an initializer INIT, return TRUE if INIT is zero or some
10994 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10995 null, set *NONZERO if and only if INIT is known not to be all
10996 zeros. The combination of return value of false and *NONZERO
10997 false implies that INIT may but need not be all zeros. Other
10998 combinations indicate definitive answers. */
11001 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11007 /* Conservatively clear NONZERO and set it only if INIT is definitely
11013 unsigned HOST_WIDE_INT off
= 0;
11015 switch (TREE_CODE (init
))
11018 if (integer_zerop (init
))
11025 /* ??? Note that this is not correct for C4X float formats. There,
11026 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11027 negative exponent. */
11028 if (real_zerop (init
)
11029 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11036 if (fixed_zerop (init
))
11043 if (integer_zerop (init
)
11044 || (real_zerop (init
)
11045 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11046 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11053 if (VECTOR_CST_NPATTERNS (init
) == 1
11054 && VECTOR_CST_DUPLICATE_P (init
)
11055 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11063 if (TREE_CLOBBER_P (init
))
11066 unsigned HOST_WIDE_INT idx
;
11069 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11070 if (!initializer_zerop (elt
, nonzero
))
11078 tree arg
= TREE_OPERAND (init
, 0);
11079 if (TREE_CODE (arg
) != ADDR_EXPR
)
11081 tree offset
= TREE_OPERAND (init
, 1);
11082 if (TREE_CODE (offset
) != INTEGER_CST
11083 || !tree_fits_uhwi_p (offset
))
11085 off
= tree_to_uhwi (offset
);
11088 arg
= TREE_OPERAND (arg
, 0);
11089 if (TREE_CODE (arg
) != STRING_CST
)
11093 /* Fall through. */
11097 gcc_assert (off
<= INT_MAX
);
11100 int n
= TREE_STRING_LENGTH (init
);
11104 /* We need to loop through all elements to handle cases like
11105 "\0" and "\0foobar". */
11106 for (i
= 0; i
< n
; ++i
)
11107 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11121 /* Return true if EXPR is an initializer expression in which every element
11122 is a constant that is numerically equal to 0 or 1. The elements do not
11123 need to be equal to each other. */
11126 initializer_each_zero_or_onep (const_tree expr
)
11128 STRIP_ANY_LOCATION_WRAPPER (expr
);
11130 switch (TREE_CODE (expr
))
11133 return integer_zerop (expr
) || integer_onep (expr
);
11136 return real_zerop (expr
) || real_onep (expr
);
11140 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11141 if (VECTOR_CST_STEPPED_P (expr
)
11142 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11145 for (unsigned int i
= 0; i
< nelts
; ++i
)
11147 tree elt
= vector_cst_elt (expr
, i
);
11148 if (!initializer_each_zero_or_onep (elt
))
11160 /* Check if vector VEC consists of all the equal elements and
11161 that the number of elements corresponds to the type of VEC.
11162 The function returns first element of the vector
11163 or NULL_TREE if the vector is not uniform. */
11165 uniform_vector_p (const_tree vec
)
11168 unsigned HOST_WIDE_INT i
, nelts
;
11170 if (vec
== NULL_TREE
)
11173 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11175 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11176 return TREE_OPERAND (vec
, 0);
11178 else if (TREE_CODE (vec
) == VECTOR_CST
)
11180 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11181 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11185 else if (TREE_CODE (vec
) == CONSTRUCTOR
11186 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11188 first
= error_mark_node
;
11190 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11197 if (!operand_equal_p (first
, t
, 0))
11209 /* If the argument is INTEGER_CST, return it. If the argument is vector
11210 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11212 Look through location wrappers. */
11215 uniform_integer_cst_p (tree t
)
11217 STRIP_ANY_LOCATION_WRAPPER (t
);
11219 if (TREE_CODE (t
) == INTEGER_CST
)
11222 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11224 t
= uniform_vector_p (t
);
11225 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11232 /* If VECTOR_CST T has a single nonzero element, return the index of that
11233 element, otherwise return -1. */
11236 single_nonzero_element (const_tree t
)
11238 unsigned HOST_WIDE_INT nelts
;
11239 unsigned int repeat_nelts
;
11240 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11241 repeat_nelts
= nelts
;
11242 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11244 nelts
= vector_cst_encoded_nelts (t
);
11245 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11251 for (unsigned int i
= 0; i
< nelts
; ++i
)
11253 tree elt
= vector_cst_elt (t
, i
);
11254 if (!integer_zerop (elt
) && !real_zerop (elt
))
11256 if (res
>= 0 || i
>= repeat_nelts
)
11264 /* Build an empty statement at location LOC. */
11267 build_empty_stmt (location_t loc
)
11269 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11270 SET_EXPR_LOCATION (t
, loc
);
11275 /* Build an OpenMP clause with code CODE. LOC is the location of the
11279 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11284 length
= omp_clause_num_ops
[code
];
11285 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11287 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11289 t
= (tree
) ggc_internal_alloc (size
);
11290 memset (t
, 0, size
);
11291 TREE_SET_CODE (t
, OMP_CLAUSE
);
11292 OMP_CLAUSE_SET_CODE (t
, code
);
11293 OMP_CLAUSE_LOCATION (t
) = loc
;
11298 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11299 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11300 Except for the CODE and operand count field, other storage for the
11301 object is initialized to zeros. */
11304 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11307 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11309 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11310 gcc_assert (len
>= 1);
11312 record_node_allocation_statistics (code
, length
);
11314 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11316 TREE_SET_CODE (t
, code
);
11318 /* Can't use TREE_OPERAND to store the length because if checking is
11319 enabled, it will try to check the length before we store it. :-P */
11320 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11325 /* Helper function for build_call_* functions; build a CALL_EXPR with
11326 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11327 the argument slots. */
11330 build_call_1 (tree return_type
, tree fn
, int nargs
)
11334 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11335 TREE_TYPE (t
) = return_type
;
11336 CALL_EXPR_FN (t
) = fn
;
11337 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11342 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11343 FN and a null static chain slot. NARGS is the number of call arguments
11344 which are specified as "..." arguments. */
11347 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11351 va_start (args
, nargs
);
11352 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11357 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11358 FN and a null static chain slot. NARGS is the number of call arguments
11359 which are specified as a va_list ARGS. */
11362 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11367 t
= build_call_1 (return_type
, fn
, nargs
);
11368 for (i
= 0; i
< nargs
; i
++)
11369 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11370 process_call_operands (t
);
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 a tree array ARGS. */
11379 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11380 int nargs
, const tree
*args
)
11385 t
= build_call_1 (return_type
, fn
, nargs
);
11386 for (i
= 0; i
< nargs
; i
++)
11387 CALL_EXPR_ARG (t
, i
) = args
[i
];
11388 process_call_operands (t
);
11389 SET_EXPR_LOCATION (t
, loc
);
11393 /* Like build_call_array, but takes a vec. */
11396 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11401 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11402 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11403 CALL_EXPR_ARG (ret
, ix
) = t
;
11404 process_call_operands (ret
);
11408 /* Conveniently construct a function call expression. FNDECL names the
11409 function to be called and N arguments are passed in the array
11413 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11415 tree fntype
= TREE_TYPE (fndecl
);
11416 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11418 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11421 /* Conveniently construct a function call expression. FNDECL names the
11422 function to be called and the arguments are passed in the vector
11426 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11428 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11429 vec_safe_address (vec
));
11433 /* Conveniently construct a function call expression. FNDECL names the
11434 function to be called, N is the number of arguments, and the "..."
11435 parameters are the argument expressions. */
11438 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11441 tree
*argarray
= XALLOCAVEC (tree
, n
);
11445 for (i
= 0; i
< n
; i
++)
11446 argarray
[i
] = va_arg (ap
, tree
);
11448 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11451 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11452 varargs macros aren't supported by all bootstrap compilers. */
11455 build_call_expr (tree fndecl
, int n
, ...)
11458 tree
*argarray
= XALLOCAVEC (tree
, n
);
11462 for (i
= 0; i
< n
; i
++)
11463 argarray
[i
] = va_arg (ap
, tree
);
11465 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11468 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11469 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11470 It will get gimplified later into an ordinary internal function. */
11473 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11474 tree type
, int n
, const tree
*args
)
11476 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11477 for (int i
= 0; i
< n
; ++i
)
11478 CALL_EXPR_ARG (t
, i
) = args
[i
];
11479 SET_EXPR_LOCATION (t
, loc
);
11480 CALL_EXPR_IFN (t
) = ifn
;
11481 process_call_operands (t
);
11485 /* Build internal call expression. This is just like CALL_EXPR, except
11486 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11487 internal function. */
11490 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11491 tree type
, int n
, ...)
11494 tree
*argarray
= XALLOCAVEC (tree
, n
);
11498 for (i
= 0; i
< n
; i
++)
11499 argarray
[i
] = va_arg (ap
, tree
);
11501 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11504 /* Return a function call to FN, if the target is guaranteed to support it,
11507 N is the number of arguments, passed in the "...", and TYPE is the
11508 type of the return value. */
11511 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11515 tree
*argarray
= XALLOCAVEC (tree
, n
);
11519 for (i
= 0; i
< n
; i
++)
11520 argarray
[i
] = va_arg (ap
, tree
);
11522 if (internal_fn_p (fn
))
11524 internal_fn ifn
= as_internal_fn (fn
);
11525 if (direct_internal_fn_p (ifn
))
11527 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11528 if (!direct_internal_fn_supported_p (ifn
, types
,
11529 OPTIMIZE_FOR_BOTH
))
11532 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11536 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11539 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11543 /* Return a function call to the appropriate builtin alloca variant.
11545 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11546 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11547 bound for SIZE in case it is not a fixed value. */
11550 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11554 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11556 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11558 else if (align
> 0)
11560 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11561 return build_call_expr (t
, 2, size
, size_int (align
));
11565 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11566 return build_call_expr (t
, 1, size
);
11570 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11571 if SIZE == -1) and return a tree node representing char* pointer to
11572 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11573 is the LEN bytes at STR (the representation of the string, which may
11577 build_string_literal (int len
, const char *str
,
11578 tree eltype
/* = char_type_node */,
11579 unsigned HOST_WIDE_INT size
/* = -1 */)
11581 tree t
= build_string (len
, str
);
11582 /* Set the maximum valid index based on the string length or SIZE. */
11583 unsigned HOST_WIDE_INT maxidx
11584 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11586 tree index
= build_index_type (size_int (maxidx
));
11587 eltype
= build_type_variant (eltype
, 1, 0);
11588 tree type
= build_array_type (eltype
, index
);
11589 TREE_TYPE (t
) = type
;
11590 TREE_CONSTANT (t
) = 1;
11591 TREE_READONLY (t
) = 1;
11592 TREE_STATIC (t
) = 1;
11594 type
= build_pointer_type (eltype
);
11595 t
= build1 (ADDR_EXPR
, type
,
11596 build4 (ARRAY_REF
, eltype
,
11597 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11603 /* Return true if T (assumed to be a DECL) must be assigned a memory
11607 needs_to_live_in_memory (const_tree t
)
11609 return (TREE_ADDRESSABLE (t
)
11610 || is_global_var (t
)
11611 || (TREE_CODE (t
) == RESULT_DECL
11612 && !DECL_BY_REFERENCE (t
)
11613 && aggregate_value_p (t
, current_function_decl
)));
11616 /* Return value of a constant X and sign-extend it. */
11619 int_cst_value (const_tree x
)
11621 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11622 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11624 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11625 gcc_assert (cst_and_fits_in_hwi (x
));
11627 if (bits
< HOST_BITS_PER_WIDE_INT
)
11629 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11631 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11633 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11639 /* If TYPE is an integral or pointer type, return an integer type with
11640 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11641 if TYPE is already an integer type of signedness UNSIGNEDP.
11642 If TYPE is a floating-point type, return an integer type with the same
11643 bitsize and with the signedness given by UNSIGNEDP; this is useful
11644 when doing bit-level operations on a floating-point value. */
11647 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11649 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11652 if (TREE_CODE (type
) == VECTOR_TYPE
)
11654 tree inner
= TREE_TYPE (type
);
11655 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11658 if (inner
== inner2
)
11660 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11663 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11665 tree inner
= TREE_TYPE (type
);
11666 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11669 if (inner
== inner2
)
11671 return build_complex_type (inner2
);
11675 if (INTEGRAL_TYPE_P (type
)
11676 || POINTER_TYPE_P (type
)
11677 || TREE_CODE (type
) == OFFSET_TYPE
)
11678 bits
= TYPE_PRECISION (type
);
11679 else if (TREE_CODE (type
) == REAL_TYPE
)
11680 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11684 return build_nonstandard_integer_type (bits
, unsignedp
);
11687 /* If TYPE is an integral or pointer type, return an integer type with
11688 the same precision which is unsigned, or itself if TYPE is already an
11689 unsigned integer type. If TYPE is a floating-point type, return an
11690 unsigned integer type with the same bitsize as TYPE. */
11693 unsigned_type_for (tree type
)
11695 return signed_or_unsigned_type_for (1, type
);
11698 /* If TYPE is an integral or pointer type, return an integer type with
11699 the same precision which is signed, or itself if TYPE is already a
11700 signed integer type. If TYPE is a floating-point type, return a
11701 signed integer type with the same bitsize as TYPE. */
11704 signed_type_for (tree type
)
11706 return signed_or_unsigned_type_for (0, type
);
11709 /* If TYPE is a vector type, return a signed integer vector type with the
11710 same width and number of subparts. Otherwise return boolean_type_node. */
11713 truth_type_for (tree type
)
11715 if (TREE_CODE (type
) == VECTOR_TYPE
)
11717 if (VECTOR_BOOLEAN_TYPE_P (type
))
11719 return build_truth_vector_type_for (type
);
11722 return boolean_type_node
;
11725 /* Returns the largest value obtainable by casting something in INNER type to
11729 upper_bound_in_type (tree outer
, tree inner
)
11731 unsigned int det
= 0;
11732 unsigned oprec
= TYPE_PRECISION (outer
);
11733 unsigned iprec
= TYPE_PRECISION (inner
);
11736 /* Compute a unique number for every combination. */
11737 det
|= (oprec
> iprec
) ? 4 : 0;
11738 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11739 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11741 /* Determine the exponent to use. */
11746 /* oprec <= iprec, outer: signed, inner: don't care. */
11751 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11755 /* oprec > iprec, outer: signed, inner: signed. */
11759 /* oprec > iprec, outer: signed, inner: unsigned. */
11763 /* oprec > iprec, outer: unsigned, inner: signed. */
11767 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11771 gcc_unreachable ();
11774 return wide_int_to_tree (outer
,
11775 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11778 /* Returns the smallest value obtainable by casting something in INNER type to
11782 lower_bound_in_type (tree outer
, tree inner
)
11784 unsigned oprec
= TYPE_PRECISION (outer
);
11785 unsigned iprec
= TYPE_PRECISION (inner
);
11787 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11789 if (TYPE_UNSIGNED (outer
)
11790 /* If we are widening something of an unsigned type, OUTER type
11791 contains all values of INNER type. In particular, both INNER
11792 and OUTER types have zero in common. */
11793 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11794 return build_int_cst (outer
, 0);
11797 /* If we are widening a signed type to another signed type, we
11798 want to obtain -2^^(iprec-1). If we are keeping the
11799 precision or narrowing to a signed type, we want to obtain
11801 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11802 return wide_int_to_tree (outer
,
11803 wi::mask (prec
- 1, true,
11804 TYPE_PRECISION (outer
)));
11808 /* Return nonzero if two operands that are suitable for PHI nodes are
11809 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11810 SSA_NAME or invariant. Note that this is strictly an optimization.
11811 That is, callers of this function can directly call operand_equal_p
11812 and get the same result, only slower. */
11815 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11819 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11821 return operand_equal_p (arg0
, arg1
, 0);
11824 /* Returns number of zeros at the end of binary representation of X. */
11827 num_ending_zeros (const_tree x
)
11829 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11833 #define WALK_SUBTREE(NODE) \
11836 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11842 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11843 be walked whenever a type is seen in the tree. Rest of operands and return
11844 value are as for walk_tree. */
11847 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11848 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11850 tree result
= NULL_TREE
;
11852 switch (TREE_CODE (type
))
11855 case REFERENCE_TYPE
:
11857 /* We have to worry about mutually recursive pointers. These can't
11858 be written in C. They can in Ada. It's pathological, but
11859 there's an ACATS test (c38102a) that checks it. Deal with this
11860 by checking if we're pointing to another pointer, that one
11861 points to another pointer, that one does too, and we have no htab.
11862 If so, get a hash table. We check three levels deep to avoid
11863 the cost of the hash table if we don't need one. */
11864 if (POINTER_TYPE_P (TREE_TYPE (type
))
11865 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11866 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11869 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11880 WALK_SUBTREE (TREE_TYPE (type
));
11884 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11886 /* Fall through. */
11888 case FUNCTION_TYPE
:
11889 WALK_SUBTREE (TREE_TYPE (type
));
11893 /* We never want to walk into default arguments. */
11894 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11895 WALK_SUBTREE (TREE_VALUE (arg
));
11900 /* Don't follow this nodes's type if a pointer for fear that
11901 we'll have infinite recursion. If we have a PSET, then we
11904 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11905 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11906 WALK_SUBTREE (TREE_TYPE (type
));
11907 WALK_SUBTREE (TYPE_DOMAIN (type
));
11911 WALK_SUBTREE (TREE_TYPE (type
));
11912 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11922 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11923 called with the DATA and the address of each sub-tree. If FUNC returns a
11924 non-NULL value, the traversal is stopped, and the value returned by FUNC
11925 is returned. If PSET is non-NULL it is used to record the nodes visited,
11926 and to avoid visiting a node more than once. */
11929 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11930 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11932 enum tree_code code
;
11936 #define WALK_SUBTREE_TAIL(NODE) \
11940 goto tail_recurse; \
11945 /* Skip empty subtrees. */
11949 /* Don't walk the same tree twice, if the user has requested
11950 that we avoid doing so. */
11951 if (pset
&& pset
->add (*tp
))
11954 /* Call the function. */
11956 result
= (*func
) (tp
, &walk_subtrees
, data
);
11958 /* If we found something, return it. */
11962 code
= TREE_CODE (*tp
);
11964 /* Even if we didn't, FUNC may have decided that there was nothing
11965 interesting below this point in the tree. */
11966 if (!walk_subtrees
)
11968 /* But we still need to check our siblings. */
11969 if (code
== TREE_LIST
)
11970 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11971 else if (code
== OMP_CLAUSE
)
11972 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11979 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11980 if (result
|| !walk_subtrees
)
11987 case IDENTIFIER_NODE
:
11994 case PLACEHOLDER_EXPR
:
11998 /* None of these have subtrees other than those already walked
12003 WALK_SUBTREE (TREE_VALUE (*tp
));
12004 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12009 int len
= TREE_VEC_LENGTH (*tp
);
12014 /* Walk all elements but the first. */
12016 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12018 /* Now walk the first one as a tail call. */
12019 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12023 WALK_SUBTREE (TREE_REALPART (*tp
));
12024 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12028 unsigned HOST_WIDE_INT idx
;
12029 constructor_elt
*ce
;
12031 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12033 WALK_SUBTREE (ce
->value
);
12038 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12043 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12045 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12046 into declarations that are just mentioned, rather than
12047 declared; they don't really belong to this part of the tree.
12048 And, we can see cycles: the initializer for a declaration
12049 can refer to the declaration itself. */
12050 WALK_SUBTREE (DECL_INITIAL (decl
));
12051 WALK_SUBTREE (DECL_SIZE (decl
));
12052 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12054 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12057 case STATEMENT_LIST
:
12059 tree_stmt_iterator i
;
12060 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12061 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12066 switch (OMP_CLAUSE_CODE (*tp
))
12068 case OMP_CLAUSE_GANG
:
12069 case OMP_CLAUSE__GRIDDIM_
:
12070 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12073 case OMP_CLAUSE_ASYNC
:
12074 case OMP_CLAUSE_WAIT
:
12075 case OMP_CLAUSE_WORKER
:
12076 case OMP_CLAUSE_VECTOR
:
12077 case OMP_CLAUSE_NUM_GANGS
:
12078 case OMP_CLAUSE_NUM_WORKERS
:
12079 case OMP_CLAUSE_VECTOR_LENGTH
:
12080 case OMP_CLAUSE_PRIVATE
:
12081 case OMP_CLAUSE_SHARED
:
12082 case OMP_CLAUSE_FIRSTPRIVATE
:
12083 case OMP_CLAUSE_COPYIN
:
12084 case OMP_CLAUSE_COPYPRIVATE
:
12085 case OMP_CLAUSE_FINAL
:
12086 case OMP_CLAUSE_IF
:
12087 case OMP_CLAUSE_NUM_THREADS
:
12088 case OMP_CLAUSE_SCHEDULE
:
12089 case OMP_CLAUSE_UNIFORM
:
12090 case OMP_CLAUSE_DEPEND
:
12091 case OMP_CLAUSE_NONTEMPORAL
:
12092 case OMP_CLAUSE_NUM_TEAMS
:
12093 case OMP_CLAUSE_THREAD_LIMIT
:
12094 case OMP_CLAUSE_DEVICE
:
12095 case OMP_CLAUSE_DIST_SCHEDULE
:
12096 case OMP_CLAUSE_SAFELEN
:
12097 case OMP_CLAUSE_SIMDLEN
:
12098 case OMP_CLAUSE_ORDERED
:
12099 case OMP_CLAUSE_PRIORITY
:
12100 case OMP_CLAUSE_GRAINSIZE
:
12101 case OMP_CLAUSE_NUM_TASKS
:
12102 case OMP_CLAUSE_HINT
:
12103 case OMP_CLAUSE_TO_DECLARE
:
12104 case OMP_CLAUSE_LINK
:
12105 case OMP_CLAUSE_USE_DEVICE_PTR
:
12106 case OMP_CLAUSE_USE_DEVICE_ADDR
:
12107 case OMP_CLAUSE_IS_DEVICE_PTR
:
12108 case OMP_CLAUSE_INCLUSIVE
:
12109 case OMP_CLAUSE_EXCLUSIVE
:
12110 case OMP_CLAUSE__LOOPTEMP_
:
12111 case OMP_CLAUSE__REDUCTEMP_
:
12112 case OMP_CLAUSE__CONDTEMP_
:
12113 case OMP_CLAUSE__SCANTEMP_
:
12114 case OMP_CLAUSE__SIMDUID_
:
12115 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12118 case OMP_CLAUSE_INDEPENDENT
:
12119 case OMP_CLAUSE_NOWAIT
:
12120 case OMP_CLAUSE_DEFAULT
:
12121 case OMP_CLAUSE_UNTIED
:
12122 case OMP_CLAUSE_MERGEABLE
:
12123 case OMP_CLAUSE_PROC_BIND
:
12124 case OMP_CLAUSE_DEVICE_TYPE
:
12125 case OMP_CLAUSE_INBRANCH
:
12126 case OMP_CLAUSE_NOTINBRANCH
:
12127 case OMP_CLAUSE_FOR
:
12128 case OMP_CLAUSE_PARALLEL
:
12129 case OMP_CLAUSE_SECTIONS
:
12130 case OMP_CLAUSE_TASKGROUP
:
12131 case OMP_CLAUSE_NOGROUP
:
12132 case OMP_CLAUSE_THREADS
:
12133 case OMP_CLAUSE_SIMD
:
12134 case OMP_CLAUSE_DEFAULTMAP
:
12135 case OMP_CLAUSE_ORDER
:
12136 case OMP_CLAUSE_BIND
:
12137 case OMP_CLAUSE_AUTO
:
12138 case OMP_CLAUSE_SEQ
:
12139 case OMP_CLAUSE_TILE
:
12140 case OMP_CLAUSE__SIMT_
:
12141 case OMP_CLAUSE_IF_PRESENT
:
12142 case OMP_CLAUSE_FINALIZE
:
12143 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12145 case OMP_CLAUSE_LASTPRIVATE
:
12146 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12147 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12148 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12150 case OMP_CLAUSE_COLLAPSE
:
12153 for (i
= 0; i
< 3; i
++)
12154 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12155 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12158 case OMP_CLAUSE_LINEAR
:
12159 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12160 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12161 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12162 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12164 case OMP_CLAUSE_ALIGNED
:
12165 case OMP_CLAUSE_FROM
:
12166 case OMP_CLAUSE_TO
:
12167 case OMP_CLAUSE_MAP
:
12168 case OMP_CLAUSE__CACHE_
:
12169 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12170 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12171 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12173 case OMP_CLAUSE_REDUCTION
:
12174 case OMP_CLAUSE_TASK_REDUCTION
:
12175 case OMP_CLAUSE_IN_REDUCTION
:
12178 for (i
= 0; i
< 5; i
++)
12179 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12180 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12184 gcc_unreachable ();
12192 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12193 But, we only want to walk once. */
12194 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12195 for (i
= 0; i
< len
; ++i
)
12196 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12197 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12201 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12202 defining. We only want to walk into these fields of a type in this
12203 case and not in the general case of a mere reference to the type.
12205 The criterion is as follows: if the field can be an expression, it
12206 must be walked only here. This should be in keeping with the fields
12207 that are directly gimplified in gimplify_type_sizes in order for the
12208 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12209 variable-sized types.
12211 Note that DECLs get walked as part of processing the BIND_EXPR. */
12212 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12214 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12215 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12218 /* Call the function for the type. See if it returns anything or
12219 doesn't want us to continue. If we are to continue, walk both
12220 the normal fields and those for the declaration case. */
12221 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12222 if (result
|| !walk_subtrees
)
12225 /* But do not walk a pointed-to type since it may itself need to
12226 be walked in the declaration case if it isn't anonymous. */
12227 if (!POINTER_TYPE_P (*type_p
))
12229 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12234 /* If this is a record type, also walk the fields. */
12235 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12239 for (field
= TYPE_FIELDS (*type_p
); field
;
12240 field
= DECL_CHAIN (field
))
12242 /* We'd like to look at the type of the field, but we can
12243 easily get infinite recursion. So assume it's pointed
12244 to elsewhere in the tree. Also, ignore things that
12246 if (TREE_CODE (field
) != FIELD_DECL
)
12249 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12250 WALK_SUBTREE (DECL_SIZE (field
));
12251 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12252 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12253 WALK_SUBTREE (DECL_QUALIFIER (field
));
12257 /* Same for scalar types. */
12258 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12259 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12260 || TREE_CODE (*type_p
) == INTEGER_TYPE
12261 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12262 || TREE_CODE (*type_p
) == REAL_TYPE
)
12264 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12265 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12268 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12269 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12274 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12278 /* Walk over all the sub-trees of this operand. */
12279 len
= TREE_OPERAND_LENGTH (*tp
);
12281 /* Go through the subtrees. We need to do this in forward order so
12282 that the scope of a FOR_EXPR is handled properly. */
12285 for (i
= 0; i
< len
- 1; ++i
)
12286 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12287 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12290 /* If this is a type, walk the needed fields in the type. */
12291 else if (TYPE_P (*tp
))
12292 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12296 /* We didn't find what we were looking for. */
12299 #undef WALK_SUBTREE_TAIL
12301 #undef WALK_SUBTREE
12303 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12306 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12311 hash_set
<tree
> pset
;
12312 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12318 tree_block (tree t
)
12320 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12322 if (IS_EXPR_CODE_CLASS (c
))
12323 return LOCATION_BLOCK (t
->exp
.locus
);
12324 gcc_unreachable ();
12329 tree_set_block (tree t
, tree b
)
12331 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12333 if (IS_EXPR_CODE_CLASS (c
))
12335 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12338 gcc_unreachable ();
12341 /* Create a nameless artificial label and put it in the current
12342 function context. The label has a location of LOC. Returns the
12343 newly created label. */
12346 create_artificial_label (location_t loc
)
12348 tree lab
= build_decl (loc
,
12349 LABEL_DECL
, NULL_TREE
, void_type_node
);
12351 DECL_ARTIFICIAL (lab
) = 1;
12352 DECL_IGNORED_P (lab
) = 1;
12353 DECL_CONTEXT (lab
) = current_function_decl
;
12357 /* Given a tree, try to return a useful variable name that we can use
12358 to prefix a temporary that is being assigned the value of the tree.
12359 I.E. given <temp> = &A, return A. */
12364 tree stripped_decl
;
12367 STRIP_NOPS (stripped_decl
);
12368 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12369 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12370 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12372 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12375 return IDENTIFIER_POINTER (name
);
12379 switch (TREE_CODE (stripped_decl
))
12382 return get_name (TREE_OPERAND (stripped_decl
, 0));
12389 /* Return true if TYPE has a variable argument list. */
12392 stdarg_p (const_tree fntype
)
12394 function_args_iterator args_iter
;
12395 tree n
= NULL_TREE
, t
;
12400 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12405 return n
!= NULL_TREE
&& n
!= void_type_node
;
12408 /* Return true if TYPE has a prototype. */
12411 prototype_p (const_tree fntype
)
12415 gcc_assert (fntype
!= NULL_TREE
);
12417 t
= TYPE_ARG_TYPES (fntype
);
12418 return (t
!= NULL_TREE
);
12421 /* If BLOCK is inlined from an __attribute__((__artificial__))
12422 routine, return pointer to location from where it has been
12425 block_nonartificial_location (tree block
)
12427 location_t
*ret
= NULL
;
12429 while (block
&& TREE_CODE (block
) == BLOCK
12430 && BLOCK_ABSTRACT_ORIGIN (block
))
12432 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12433 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12435 /* If AO is an artificial inline, point RET to the
12436 call site locus at which it has been inlined and continue
12437 the loop, in case AO's caller is also an artificial
12439 if (DECL_DECLARED_INLINE_P (ao
)
12440 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12441 ret
= &BLOCK_SOURCE_LOCATION (block
);
12445 else if (TREE_CODE (ao
) != BLOCK
)
12448 block
= BLOCK_SUPERCONTEXT (block
);
12454 /* If EXP is inlined from an __attribute__((__artificial__))
12455 function, return the location of the original call expression. */
12458 tree_nonartificial_location (tree exp
)
12460 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12465 return EXPR_LOCATION (exp
);
12469 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12472 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12475 cl_option_hasher::hash (tree x
)
12477 const_tree
const t
= x
;
12481 hashval_t hash
= 0;
12483 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12485 p
= (const char *)TREE_OPTIMIZATION (t
);
12486 len
= sizeof (struct cl_optimization
);
12489 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12490 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12493 gcc_unreachable ();
12495 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12497 for (i
= 0; i
< len
; i
++)
12499 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12504 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12505 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12509 cl_option_hasher::equal (tree x
, tree y
)
12511 const_tree
const xt
= x
;
12512 const_tree
const yt
= y
;
12514 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12517 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12518 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12519 TREE_OPTIMIZATION (yt
));
12520 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12521 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12522 TREE_TARGET_OPTION (yt
));
12524 gcc_unreachable ();
12527 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12530 build_optimization_node (struct gcc_options
*opts
)
12534 /* Use the cache of optimization nodes. */
12536 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12539 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12543 /* Insert this one into the hash table. */
12544 t
= cl_optimization_node
;
12547 /* Make a new node for next time round. */
12548 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12554 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12557 build_target_option_node (struct gcc_options
*opts
)
12561 /* Use the cache of optimization nodes. */
12563 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12566 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12570 /* Insert this one into the hash table. */
12571 t
= cl_target_option_node
;
12574 /* Make a new node for next time round. */
12575 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12581 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12582 so that they aren't saved during PCH writing. */
12585 prepare_target_option_nodes_for_pch (void)
12587 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12588 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12589 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12590 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12593 /* Determine the "ultimate origin" of a block. */
12596 block_ultimate_origin (const_tree block
)
12598 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12600 if (origin
== NULL_TREE
)
12604 gcc_checking_assert ((DECL_P (origin
)
12605 && DECL_ORIGIN (origin
) == origin
)
12606 || BLOCK_ORIGIN (origin
) == origin
);
12611 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12615 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12617 /* Do not strip casts into or out of differing address spaces. */
12618 if (POINTER_TYPE_P (outer_type
)
12619 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12621 if (!POINTER_TYPE_P (inner_type
)
12622 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12623 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12626 else if (POINTER_TYPE_P (inner_type
)
12627 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12629 /* We already know that outer_type is not a pointer with
12630 a non-generic address space. */
12634 /* Use precision rather then machine mode when we can, which gives
12635 the correct answer even for submode (bit-field) types. */
12636 if ((INTEGRAL_TYPE_P (outer_type
)
12637 || POINTER_TYPE_P (outer_type
)
12638 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12639 && (INTEGRAL_TYPE_P (inner_type
)
12640 || POINTER_TYPE_P (inner_type
)
12641 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12642 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12644 /* Otherwise fall back on comparing machine modes (e.g. for
12645 aggregate types, floats). */
12646 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12649 /* Return true iff conversion in EXP generates no instruction. Mark
12650 it inline so that we fully inline into the stripping functions even
12651 though we have two uses of this function. */
12654 tree_nop_conversion (const_tree exp
)
12656 tree outer_type
, inner_type
;
12658 if (location_wrapper_p (exp
))
12660 if (!CONVERT_EXPR_P (exp
)
12661 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12664 outer_type
= TREE_TYPE (exp
);
12665 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12666 if (!inner_type
|| inner_type
== error_mark_node
)
12669 return tree_nop_conversion_p (outer_type
, inner_type
);
12672 /* Return true iff conversion in EXP generates no instruction. Don't
12673 consider conversions changing the signedness. */
12676 tree_sign_nop_conversion (const_tree exp
)
12678 tree outer_type
, inner_type
;
12680 if (!tree_nop_conversion (exp
))
12683 outer_type
= TREE_TYPE (exp
);
12684 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12686 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12687 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12690 /* Strip conversions from EXP according to tree_nop_conversion and
12691 return the resulting expression. */
12694 tree_strip_nop_conversions (tree exp
)
12696 while (tree_nop_conversion (exp
))
12697 exp
= TREE_OPERAND (exp
, 0);
12701 /* Strip conversions from EXP according to tree_sign_nop_conversion
12702 and return the resulting expression. */
12705 tree_strip_sign_nop_conversions (tree exp
)
12707 while (tree_sign_nop_conversion (exp
))
12708 exp
= TREE_OPERAND (exp
, 0);
12712 /* Avoid any floating point extensions from EXP. */
12714 strip_float_extensions (tree exp
)
12716 tree sub
, expt
, subt
;
12718 /* For floating point constant look up the narrowest type that can hold
12719 it properly and handle it like (type)(narrowest_type)constant.
12720 This way we can optimize for instance a=a*2.0 where "a" is float
12721 but 2.0 is double constant. */
12722 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12724 REAL_VALUE_TYPE orig
;
12727 orig
= TREE_REAL_CST (exp
);
12728 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12729 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12730 type
= float_type_node
;
12731 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12732 > TYPE_PRECISION (double_type_node
)
12733 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12734 type
= double_type_node
;
12736 return build_real_truncate (type
, orig
);
12739 if (!CONVERT_EXPR_P (exp
))
12742 sub
= TREE_OPERAND (exp
, 0);
12743 subt
= TREE_TYPE (sub
);
12744 expt
= TREE_TYPE (exp
);
12746 if (!FLOAT_TYPE_P (subt
))
12749 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12752 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12755 return strip_float_extensions (sub
);
12758 /* Strip out all handled components that produce invariant
12762 strip_invariant_refs (const_tree op
)
12764 while (handled_component_p (op
))
12766 switch (TREE_CODE (op
))
12769 case ARRAY_RANGE_REF
:
12770 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12771 || TREE_OPERAND (op
, 2) != NULL_TREE
12772 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12776 case COMPONENT_REF
:
12777 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12783 op
= TREE_OPERAND (op
, 0);
12789 static GTY(()) tree gcc_eh_personality_decl
;
12791 /* Return the GCC personality function decl. */
12794 lhd_gcc_personality (void)
12796 if (!gcc_eh_personality_decl
)
12797 gcc_eh_personality_decl
= build_personality_function ("gcc");
12798 return gcc_eh_personality_decl
;
12801 /* TARGET is a call target of GIMPLE call statement
12802 (obtained by gimple_call_fn). Return true if it is
12803 OBJ_TYPE_REF representing an virtual call of C++ method.
12804 (As opposed to OBJ_TYPE_REF representing objc calls
12805 through a cast where middle-end devirtualization machinery
12809 virtual_method_call_p (const_tree target
)
12811 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12813 tree t
= TREE_TYPE (target
);
12814 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12816 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12818 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12819 /* If we do not have BINFO associated, it means that type was built
12820 without devirtualization enabled. Do not consider this a virtual
12822 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12827 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12830 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12833 tree base_binfo
, b
;
12835 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12836 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12837 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12839 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12844 /* Try to find a base info of BINFO that would have its field decl at offset
12845 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12846 found, return, otherwise return NULL_TREE. */
12849 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12851 tree type
= BINFO_TYPE (binfo
);
12855 HOST_WIDE_INT pos
, size
;
12859 if (types_same_for_odr (type
, expected_type
))
12861 if (maybe_lt (offset
, 0))
12864 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12866 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12869 pos
= int_bit_position (fld
);
12870 size
= tree_to_uhwi (DECL_SIZE (fld
));
12871 if (known_in_range_p (offset
, pos
, size
))
12874 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12877 /* Offset 0 indicates the primary base, whose vtable contents are
12878 represented in the binfo for the derived class. */
12879 else if (maybe_ne (offset
, 0))
12881 tree found_binfo
= NULL
, base_binfo
;
12882 /* Offsets in BINFO are in bytes relative to the whole structure
12883 while POS is in bits relative to the containing field. */
12884 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12887 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12888 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12889 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12891 found_binfo
= base_binfo
;
12895 binfo
= found_binfo
;
12897 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12901 type
= TREE_TYPE (fld
);
12906 /* Returns true if X is a typedef decl. */
12909 is_typedef_decl (const_tree x
)
12911 return (x
&& TREE_CODE (x
) == TYPE_DECL
12912 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12915 /* Returns true iff TYPE is a type variant created for a typedef. */
12918 typedef_variant_p (const_tree type
)
12920 return is_typedef_decl (TYPE_NAME (type
));
12923 /* PR 84195: Replace control characters in "unescaped" with their
12924 escaped equivalents. Allow newlines if -fmessage-length has
12925 been set to a non-zero value. This is done here, rather than
12926 where the attribute is recorded as the message length can
12927 change between these two locations. */
12930 escaped_string::escape (const char *unescaped
)
12933 size_t i
, new_i
, len
;
12938 m_str
= const_cast<char *> (unescaped
);
12941 if (unescaped
== NULL
|| *unescaped
== 0)
12944 len
= strlen (unescaped
);
12948 for (i
= 0; i
< len
; i
++)
12950 char c
= unescaped
[i
];
12955 escaped
[new_i
++] = c
;
12959 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
12961 if (escaped
== NULL
)
12963 /* We only allocate space for a new string if we
12964 actually encounter a control character that
12965 needs replacing. */
12966 escaped
= (char *) xmalloc (len
* 2 + 1);
12967 strncpy (escaped
, unescaped
, i
);
12971 escaped
[new_i
++] = '\\';
12975 case '\a': escaped
[new_i
++] = 'a'; break;
12976 case '\b': escaped
[new_i
++] = 'b'; break;
12977 case '\f': escaped
[new_i
++] = 'f'; break;
12978 case '\n': escaped
[new_i
++] = 'n'; break;
12979 case '\r': escaped
[new_i
++] = 'r'; break;
12980 case '\t': escaped
[new_i
++] = 't'; break;
12981 case '\v': escaped
[new_i
++] = 'v'; break;
12982 default: escaped
[new_i
++] = '?'; break;
12986 escaped
[new_i
++] = c
;
12991 escaped
[new_i
] = 0;
12997 /* Warn about a use of an identifier which was marked deprecated. Returns
12998 whether a warning was given. */
13001 warn_deprecated_use (tree node
, tree attr
)
13003 escaped_string msg
;
13005 if (node
== 0 || !warn_deprecated_decl
)
13011 attr
= DECL_ATTRIBUTES (node
);
13012 else if (TYPE_P (node
))
13014 tree decl
= TYPE_STUB_DECL (node
);
13016 attr
= lookup_attribute ("deprecated",
13017 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13022 attr
= lookup_attribute ("deprecated", attr
);
13025 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13030 auto_diagnostic_group d
;
13032 w
= warning (OPT_Wdeprecated_declarations
,
13033 "%qD is deprecated: %s", node
, (const char *) msg
);
13035 w
= warning (OPT_Wdeprecated_declarations
,
13036 "%qD is deprecated", node
);
13038 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13040 else if (TYPE_P (node
))
13042 tree what
= NULL_TREE
;
13043 tree decl
= TYPE_STUB_DECL (node
);
13045 if (TYPE_NAME (node
))
13047 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13048 what
= TYPE_NAME (node
);
13049 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13050 && DECL_NAME (TYPE_NAME (node
)))
13051 what
= DECL_NAME (TYPE_NAME (node
));
13054 auto_diagnostic_group d
;
13058 w
= warning (OPT_Wdeprecated_declarations
,
13059 "%qE is deprecated: %s", what
, (const char *) msg
);
13061 w
= warning (OPT_Wdeprecated_declarations
,
13062 "%qE is deprecated", what
);
13067 w
= warning (OPT_Wdeprecated_declarations
,
13068 "type is deprecated: %s", (const char *) msg
);
13070 w
= warning (OPT_Wdeprecated_declarations
,
13071 "type is deprecated");
13075 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13081 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13082 somewhere in it. */
13085 contains_bitfld_component_ref_p (const_tree ref
)
13087 while (handled_component_p (ref
))
13089 if (TREE_CODE (ref
) == COMPONENT_REF
13090 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13092 ref
= TREE_OPERAND (ref
, 0);
13098 /* Try to determine whether a TRY_CATCH expression can fall through.
13099 This is a subroutine of block_may_fallthru. */
13102 try_catch_may_fallthru (const_tree stmt
)
13104 tree_stmt_iterator i
;
13106 /* If the TRY block can fall through, the whole TRY_CATCH can
13108 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13111 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13112 switch (TREE_CODE (tsi_stmt (i
)))
13115 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13116 catch expression and a body. The whole TRY_CATCH may fall
13117 through iff any of the catch bodies falls through. */
13118 for (; !tsi_end_p (i
); tsi_next (&i
))
13120 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13125 case EH_FILTER_EXPR
:
13126 /* The exception filter expression only matters if there is an
13127 exception. If the exception does not match EH_FILTER_TYPES,
13128 we will execute EH_FILTER_FAILURE, and we will fall through
13129 if that falls through. If the exception does match
13130 EH_FILTER_TYPES, the stack unwinder will continue up the
13131 stack, so we will not fall through. We don't know whether we
13132 will throw an exception which matches EH_FILTER_TYPES or not,
13133 so we just ignore EH_FILTER_TYPES and assume that we might
13134 throw an exception which doesn't match. */
13135 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13138 /* This case represents statements to be executed when an
13139 exception occurs. Those statements are implicitly followed
13140 by a RESX statement to resume execution after the exception.
13141 So in this case the TRY_CATCH never falls through. */
13146 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13147 need not be 100% accurate; simply be conservative and return true if we
13148 don't know. This is used only to avoid stupidly generating extra code.
13149 If we're wrong, we'll just delete the extra code later. */
13152 block_may_fallthru (const_tree block
)
13154 /* This CONST_CAST is okay because expr_last returns its argument
13155 unmodified and we assign it to a const_tree. */
13156 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13158 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13162 /* Easy cases. If the last statement of the block implies
13163 control transfer, then we can't fall through. */
13167 /* If there is a default: label or case labels cover all possible
13168 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13169 to some case label in all cases and all we care is whether the
13170 SWITCH_BODY falls through. */
13171 if (SWITCH_ALL_CASES_P (stmt
))
13172 return block_may_fallthru (SWITCH_BODY (stmt
));
13176 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13178 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13181 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13183 case TRY_CATCH_EXPR
:
13184 return try_catch_may_fallthru (stmt
);
13186 case TRY_FINALLY_EXPR
:
13187 /* The finally clause is always executed after the try clause,
13188 so if it does not fall through, then the try-finally will not
13189 fall through. Otherwise, if the try clause does not fall
13190 through, then when the finally clause falls through it will
13191 resume execution wherever the try clause was going. So the
13192 whole try-finally will only fall through if both the try
13193 clause and the finally clause fall through. */
13194 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13195 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13198 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13201 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13202 stmt
= TREE_OPERAND (stmt
, 1);
13208 /* Functions that do not return do not fall through. */
13209 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13211 case CLEANUP_POINT_EXPR
:
13212 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13215 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13221 return lang_hooks
.block_may_fallthru (stmt
);
13225 /* True if we are using EH to handle cleanups. */
13226 static bool using_eh_for_cleanups_flag
= false;
13228 /* This routine is called from front ends to indicate eh should be used for
13231 using_eh_for_cleanups (void)
13233 using_eh_for_cleanups_flag
= true;
13236 /* Query whether EH is used for cleanups. */
13238 using_eh_for_cleanups_p (void)
13240 return using_eh_for_cleanups_flag
;
13243 /* Wrapper for tree_code_name to ensure that tree code is valid */
13245 get_tree_code_name (enum tree_code code
)
13247 const char *invalid
= "<invalid tree code>";
13249 if (code
>= MAX_TREE_CODES
)
13251 if (code
== 0xa5a5)
13252 return "ggc_freed";
13256 return tree_code_name
[code
];
13259 /* Drops the TREE_OVERFLOW flag from T. */
13262 drop_tree_overflow (tree t
)
13264 gcc_checking_assert (TREE_OVERFLOW (t
));
13266 /* For tree codes with a sharing machinery re-build the result. */
13267 if (poly_int_tree_p (t
))
13268 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13270 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13271 and canonicalize the result. */
13272 if (TREE_CODE (t
) == VECTOR_CST
)
13274 tree_vector_builder builder
;
13275 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13276 unsigned int count
= builder
.encoded_nelts ();
13277 for (unsigned int i
= 0; i
< count
; ++i
)
13279 tree elt
= VECTOR_CST_ELT (t
, i
);
13280 if (TREE_OVERFLOW (elt
))
13281 elt
= drop_tree_overflow (elt
);
13282 builder
.quick_push (elt
);
13284 return builder
.build ();
13287 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13288 and drop the flag. */
13290 TREE_OVERFLOW (t
) = 0;
13292 /* For constants that contain nested constants, drop the flag
13293 from those as well. */
13294 if (TREE_CODE (t
) == COMPLEX_CST
)
13296 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13297 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13298 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13299 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13305 /* Given a memory reference expression T, return its base address.
13306 The base address of a memory reference expression is the main
13307 object being referenced. For instance, the base address for
13308 'array[i].fld[j]' is 'array'. You can think of this as stripping
13309 away the offset part from a memory address.
13311 This function calls handled_component_p to strip away all the inner
13312 parts of the memory reference until it reaches the base object. */
13315 get_base_address (tree t
)
13317 while (handled_component_p (t
))
13318 t
= TREE_OPERAND (t
, 0);
13320 if ((TREE_CODE (t
) == MEM_REF
13321 || TREE_CODE (t
) == TARGET_MEM_REF
)
13322 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13323 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13325 /* ??? Either the alias oracle or all callers need to properly deal
13326 with WITH_SIZE_EXPRs before we can look through those. */
13327 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13333 /* Return a tree of sizetype representing the size, in bytes, of the element
13334 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13337 array_ref_element_size (tree exp
)
13339 tree aligned_size
= TREE_OPERAND (exp
, 3);
13340 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13341 location_t loc
= EXPR_LOCATION (exp
);
13343 /* If a size was specified in the ARRAY_REF, it's the size measured
13344 in alignment units of the element type. So multiply by that value. */
13347 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13348 sizetype from another type of the same width and signedness. */
13349 if (TREE_TYPE (aligned_size
) != sizetype
)
13350 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13351 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13352 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13355 /* Otherwise, take the size from that of the element type. Substitute
13356 any PLACEHOLDER_EXPR that we have. */
13358 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13361 /* Return a tree representing the lower bound of the array mentioned in
13362 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13365 array_ref_low_bound (tree exp
)
13367 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13369 /* If a lower bound is specified in EXP, use it. */
13370 if (TREE_OPERAND (exp
, 2))
13371 return TREE_OPERAND (exp
, 2);
13373 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13374 substituting for a PLACEHOLDER_EXPR as needed. */
13375 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13376 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13378 /* Otherwise, return a zero of the appropriate type. */
13379 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
13380 return (idxtype
== error_mark_node
13381 ? integer_zero_node
: build_int_cst (idxtype
, 0));
13384 /* Return a tree representing the upper bound of the array mentioned in
13385 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13388 array_ref_up_bound (tree exp
)
13390 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13392 /* If there is a domain type and it has an upper bound, use it, substituting
13393 for a PLACEHOLDER_EXPR as needed. */
13394 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13395 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13397 /* Otherwise fail. */
13401 /* Returns true if REF is an array reference, component reference,
13402 or memory reference to an array at the end of a structure.
13403 If this is the case, the array may be allocated larger
13404 than its upper bound implies. */
13407 array_at_struct_end_p (tree ref
)
13411 if (TREE_CODE (ref
) == ARRAY_REF
13412 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13414 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13415 ref
= TREE_OPERAND (ref
, 0);
13417 else if (TREE_CODE (ref
) == COMPONENT_REF
13418 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13419 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13420 else if (TREE_CODE (ref
) == MEM_REF
)
13422 tree arg
= TREE_OPERAND (ref
, 0);
13423 if (TREE_CODE (arg
) == ADDR_EXPR
)
13424 arg
= TREE_OPERAND (arg
, 0);
13425 tree argtype
= TREE_TYPE (arg
);
13426 if (TREE_CODE (argtype
) == RECORD_TYPE
)
13428 if (tree fld
= last_field (argtype
))
13430 atype
= TREE_TYPE (fld
);
13431 if (TREE_CODE (atype
) != ARRAY_TYPE
)
13433 if (VAR_P (arg
) && DECL_SIZE (fld
))
13445 if (TREE_CODE (ref
) == STRING_CST
)
13448 tree ref_to_array
= ref
;
13449 while (handled_component_p (ref
))
13451 /* If the reference chain contains a component reference to a
13452 non-union type and there follows another field the reference
13453 is not at the end of a structure. */
13454 if (TREE_CODE (ref
) == COMPONENT_REF
)
13456 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13458 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13459 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13460 nextf
= DECL_CHAIN (nextf
);
13465 /* If we have a multi-dimensional array we do not consider
13466 a non-innermost dimension as flex array if the whole
13467 multi-dimensional array is at struct end.
13468 Same for an array of aggregates with a trailing array
13470 else if (TREE_CODE (ref
) == ARRAY_REF
)
13472 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13474 /* If we view an underlying object as sth else then what we
13475 gathered up to now is what we have to rely on. */
13476 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13479 gcc_unreachable ();
13481 ref
= TREE_OPERAND (ref
, 0);
13484 /* The array now is at struct end. Treat flexible arrays as
13485 always subject to extend, even into just padding constrained by
13486 an underlying decl. */
13487 if (! TYPE_SIZE (atype
)
13488 || ! TYPE_DOMAIN (atype
)
13489 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13492 if (TREE_CODE (ref
) == MEM_REF
13493 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13494 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13496 /* If the reference is based on a declared entity, the size of the array
13497 is constrained by its given domain. (Do not trust commons PR/69368). */
13499 && !(flag_unconstrained_commons
13500 && VAR_P (ref
) && DECL_COMMON (ref
))
13501 && DECL_SIZE_UNIT (ref
)
13502 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13504 /* Check whether the array domain covers all of the available
13507 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13508 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13509 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13511 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13514 /* If at least one extra element fits it is a flexarray. */
13515 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13516 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13518 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13519 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13528 /* Return a tree representing the offset, in bytes, of the field referenced
13529 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13532 component_ref_field_offset (tree exp
)
13534 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13535 tree field
= TREE_OPERAND (exp
, 1);
13536 location_t loc
= EXPR_LOCATION (exp
);
13538 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13539 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13541 if (aligned_offset
)
13543 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13544 sizetype from another type of the same width and signedness. */
13545 if (TREE_TYPE (aligned_offset
) != sizetype
)
13546 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13547 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13548 size_int (DECL_OFFSET_ALIGN (field
)
13552 /* Otherwise, take the offset from that of the field. Substitute
13553 any PLACEHOLDER_EXPR that we have. */
13555 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13558 /* Given the initializer INIT, return the initializer for the field
13559 DECL if it exists, otherwise null. Used to obtain the initializer
13560 for a flexible array member and determine its size. */
13563 get_initializer_for (tree init
, tree decl
)
13567 tree fld
, fld_init
;
13568 unsigned HOST_WIDE_INT i
;
13569 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13574 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13576 fld_init
= get_initializer_for (fld_init
, decl
);
13585 /* Determines the size of the member referenced by the COMPONENT_REF
13586 REF, using its initializer expression if necessary in order to
13587 determine the size of an initialized flexible array member.
13588 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13589 an interior zero-length array.
13590 Returns the size as sizetype (which might be zero for an object
13591 with an uninitialized flexible array member) or null if the size
13592 cannot be determined. */
13595 component_ref_size (tree ref
, bool *interior_zero_length
/* = NULL */)
13597 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13599 bool int_0_len
= false;
13600 if (!interior_zero_length
)
13601 interior_zero_length
= &int_0_len
;
13603 /* The object/argument referenced by the COMPONENT_REF and its type. */
13604 tree arg
= TREE_OPERAND (ref
, 0);
13605 tree argtype
= TREE_TYPE (arg
);
13606 /* The referenced member. */
13607 tree member
= TREE_OPERAND (ref
, 1);
13609 tree memsize
= DECL_SIZE_UNIT (member
);
13612 tree memtype
= TREE_TYPE (member
);
13613 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13616 bool trailing
= array_at_struct_end_p (ref
);
13617 bool zero_length
= integer_zerop (memsize
);
13618 if (!trailing
&& !zero_length
)
13619 /* MEMBER is either an interior array or is an array with
13620 more than one element. */
13623 *interior_zero_length
= zero_length
&& !trailing
;
13624 if (*interior_zero_length
)
13625 memsize
= NULL_TREE
;
13628 if (tree dom
= TYPE_DOMAIN (memtype
))
13629 if (tree min
= TYPE_MIN_VALUE (dom
))
13630 if (tree max
= TYPE_MAX_VALUE (dom
))
13631 if (TREE_CODE (min
) == INTEGER_CST
13632 && TREE_CODE (max
) == INTEGER_CST
)
13634 offset_int minidx
= wi::to_offset (min
);
13635 offset_int maxidx
= wi::to_offset (max
);
13636 if (maxidx
- minidx
> 0)
13637 /* MEMBER is an array with more than one element. */
13641 /* For a refernce to a zero- or one-element array member of a union
13642 use the size of the union instead of the size of the member. */
13643 if (TREE_CODE (argtype
) == UNION_TYPE
)
13644 memsize
= TYPE_SIZE_UNIT (argtype
);
13647 /* MEMBER is either a bona fide flexible array member, or a zero-length
13648 array member, or an array of length one treated as such. */
13650 /* If the reference is to a declared object and the member a true
13651 flexible array, try to determine its size from its initializer. */
13652 poly_int64 baseoff
= 0;
13653 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13654 if (!base
|| !VAR_P (base
))
13656 if (!*interior_zero_length
)
13659 if (TREE_CODE (arg
) != COMPONENT_REF
)
13663 while (TREE_CODE (base
) == COMPONENT_REF
)
13664 base
= TREE_OPERAND (base
, 0);
13665 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13668 /* BASE is the declared object of which MEMBER is either a member
13669 or that is cast to ARGTYPE (e.g., a char buffer used to store
13670 an ARGTYPE object). */
13671 tree basetype
= TREE_TYPE (base
);
13673 /* Determine the base type of the referenced object. If it's
13674 the same as ARGTYPE and MEMBER has a known size, return it. */
13675 tree bt
= basetype
;
13676 if (!*interior_zero_length
)
13677 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13678 bt
= TREE_TYPE (bt
);
13679 bool typematch
= useless_type_conversion_p (argtype
, bt
);
13680 if (memsize
&& typematch
)
13683 memsize
= NULL_TREE
;
13686 /* MEMBER is a true flexible array member. Compute its size from
13687 the initializer of the BASE object if it has one. */
13688 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13689 if (init
!= error_mark_node
)
13691 init
= get_initializer_for (init
, member
);
13694 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13695 if (tree refsize
= TYPE_SIZE_UNIT (argtype
))
13697 /* Use the larger of the initializer size and the tail
13698 padding in the enclosing struct. */
13699 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13701 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13702 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13714 && DECL_EXTERNAL (base
)
13716 && !*interior_zero_length
)
13717 /* The size of a flexible array member of an extern struct
13718 with no initializer cannot be determined (it's defined
13719 in another translation unit and can have an initializer
13720 with an arbitrary number of elements). */
13723 /* Use the size of the base struct or, for interior zero-length
13724 arrays, the size of the enclosing type. */
13725 memsize
= TYPE_SIZE_UNIT (bt
);
13727 else if (DECL_P (base
))
13728 /* Use the size of the BASE object (possibly an array of some
13729 other type such as char used to store the struct). */
13730 memsize
= DECL_SIZE_UNIT (base
);
13735 /* If the flexible array member has a known size use the greater
13736 of it and the tail padding in the enclosing struct.
13737 Otherwise, when the size of the flexible array member is unknown
13738 and the referenced object is not a struct, use the size of its
13739 type when known. This detects sizes of array buffers when cast
13740 to struct types with flexible array members. */
13743 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13744 if (known_lt (baseoff
, memsz64
))
13746 memsz64
-= baseoff
;
13747 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13749 return size_zero_node
;
13752 /* Return "don't know" for an external non-array object since its
13753 flexible array member can be initialized to have any number of
13754 elements. Otherwise, return zero because the flexible array
13755 member has no elements. */
13756 return (DECL_P (base
)
13757 && DECL_EXTERNAL (base
)
13759 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13760 ? NULL_TREE
: size_zero_node
);
13763 /* Return the machine mode of T. For vectors, returns the mode of the
13764 inner type. The main use case is to feed the result to HONOR_NANS,
13765 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13768 element_mode (const_tree t
)
13772 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13774 return TYPE_MODE (t
);
13777 /* Vector types need to re-check the target flags each time we report
13778 the machine mode. We need to do this because attribute target can
13779 change the result of vector_mode_supported_p and have_regs_of_mode
13780 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13781 change on a per-function basis. */
13782 /* ??? Possibly a better solution is to run through all the types
13783 referenced by a function and re-compute the TYPE_MODE once, rather
13784 than make the TYPE_MODE macro call a function. */
13787 vector_type_mode (const_tree t
)
13791 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13793 mode
= t
->type_common
.mode
;
13794 if (VECTOR_MODE_P (mode
)
13795 && (!targetm
.vector_mode_supported_p (mode
)
13796 || !have_regs_of_mode
[mode
]))
13798 scalar_int_mode innermode
;
13800 /* For integers, try mapping it to a same-sized scalar mode. */
13801 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13803 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13804 * GET_MODE_BITSIZE (innermode
));
13805 scalar_int_mode mode
;
13806 if (int_mode_for_size (size
, 0).exists (&mode
)
13807 && have_regs_of_mode
[mode
])
13817 /* Return the size in bits of each element of vector type TYPE. */
13820 vector_element_bits (const_tree type
)
13822 gcc_checking_assert (VECTOR_TYPE_P (type
));
13823 if (VECTOR_BOOLEAN_TYPE_P (type
))
13824 return vector_element_size (tree_to_poly_uint64 (TYPE_SIZE (type
)),
13825 TYPE_VECTOR_SUBPARTS (type
));
13826 return tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type
)));
13829 /* Calculate the size in bits of each element of vector type TYPE
13830 and return the result as a tree of type bitsizetype. */
13833 vector_element_bits_tree (const_tree type
)
13835 gcc_checking_assert (VECTOR_TYPE_P (type
));
13836 if (VECTOR_BOOLEAN_TYPE_P (type
))
13837 return bitsize_int (vector_element_bits (type
));
13838 return TYPE_SIZE (TREE_TYPE (type
));
13841 /* Verify that basic properties of T match TV and thus T can be a variant of
13842 TV. TV should be the more specified variant (i.e. the main variant). */
13845 verify_type_variant (const_tree t
, tree tv
)
13847 /* Type variant can differ by:
13849 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13850 ENCODE_QUAL_ADDR_SPACE.
13851 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13852 in this case some values may not be set in the variant types
13853 (see TYPE_COMPLETE_P checks).
13854 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13855 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13856 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13857 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13858 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13859 this is necessary to make it possible to merge types form different TUs
13860 - arrays, pointers and references may have TREE_TYPE that is a variant
13861 of TREE_TYPE of their main variants.
13862 - aggregates may have new TYPE_FIELDS list that list variants of
13863 the main variant TYPE_FIELDS.
13864 - vector types may differ by TYPE_VECTOR_OPAQUE
13867 /* Convenience macro for matching individual fields. */
13868 #define verify_variant_match(flag) \
13870 if (flag (tv) != flag (t)) \
13872 error ("type variant differs by %s", #flag); \
13878 /* tree_base checks. */
13880 verify_variant_match (TREE_CODE
);
13881 /* FIXME: Ada builds non-artificial variants of artificial types. */
13882 if (TYPE_ARTIFICIAL (tv
) && 0)
13883 verify_variant_match (TYPE_ARTIFICIAL
);
13884 if (POINTER_TYPE_P (tv
))
13885 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13886 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13887 verify_variant_match (TYPE_UNSIGNED
);
13888 verify_variant_match (TYPE_PACKED
);
13889 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13890 verify_variant_match (TYPE_REF_IS_RVALUE
);
13891 if (AGGREGATE_TYPE_P (t
))
13892 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13894 verify_variant_match (TYPE_SATURATING
);
13895 /* FIXME: This check trigger during libstdc++ build. */
13896 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13897 verify_variant_match (TYPE_FINAL_P
);
13899 /* tree_type_common checks. */
13901 if (COMPLETE_TYPE_P (t
))
13903 verify_variant_match (TYPE_MODE
);
13904 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13905 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13906 verify_variant_match (TYPE_SIZE
);
13907 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13908 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13909 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13911 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13912 TYPE_SIZE_UNIT (tv
), 0));
13913 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13915 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13916 debug_tree (TYPE_SIZE_UNIT (tv
));
13917 error ("type%'s %<TYPE_SIZE_UNIT%>");
13918 debug_tree (TYPE_SIZE_UNIT (t
));
13921 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13923 verify_variant_match (TYPE_PRECISION
);
13924 if (RECORD_OR_UNION_TYPE_P (t
))
13925 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13926 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13927 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13928 /* During LTO we merge variant lists from diferent translation units
13929 that may differ BY TYPE_CONTEXT that in turn may point
13930 to TRANSLATION_UNIT_DECL.
13931 Ada also builds variants of types with different TYPE_CONTEXT. */
13932 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13933 verify_variant_match (TYPE_CONTEXT
);
13934 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13935 verify_variant_match (TYPE_STRING_FLAG
);
13936 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13937 verify_variant_match (TYPE_CXX_ODR_P
);
13938 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13940 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13945 /* tree_type_non_common checks. */
13947 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13948 and dangle the pointer from time to time. */
13949 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13950 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13951 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13953 error ("type variant has different %<TYPE_VFIELD%>");
13957 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13958 || TREE_CODE (t
) == INTEGER_TYPE
13959 || TREE_CODE (t
) == BOOLEAN_TYPE
13960 || TREE_CODE (t
) == REAL_TYPE
13961 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13963 verify_variant_match (TYPE_MAX_VALUE
);
13964 verify_variant_match (TYPE_MIN_VALUE
);
13966 if (TREE_CODE (t
) == METHOD_TYPE
)
13967 verify_variant_match (TYPE_METHOD_BASETYPE
);
13968 if (TREE_CODE (t
) == OFFSET_TYPE
)
13969 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13970 if (TREE_CODE (t
) == ARRAY_TYPE
)
13971 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13972 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13973 or even type's main variant. This is needed to make bootstrap pass
13974 and the bug seems new in GCC 5.
13975 C++ FE should be updated to make this consistent and we should check
13976 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13977 is a match with main variant.
13979 Also disable the check for Java for now because of parser hack that builds
13980 first an dummy BINFO and then sometimes replace it by real BINFO in some
13982 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13983 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13984 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13985 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13986 at LTO time only. */
13987 && (in_lto_p
&& odr_type_p (t
)))
13989 error ("type variant has different %<TYPE_BINFO%>");
13991 error ("type variant%'s %<TYPE_BINFO%>");
13992 debug_tree (TYPE_BINFO (tv
));
13993 error ("type%'s %<TYPE_BINFO%>");
13994 debug_tree (TYPE_BINFO (t
));
13998 /* Check various uses of TYPE_VALUES_RAW. */
13999 if (TREE_CODE (t
) == ENUMERAL_TYPE
14000 && TYPE_VALUES (t
))
14001 verify_variant_match (TYPE_VALUES
);
14002 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14003 verify_variant_match (TYPE_DOMAIN
);
14004 /* Permit incomplete variants of complete type. While FEs may complete
14005 all variants, this does not happen for C++ templates in all cases. */
14006 else if (RECORD_OR_UNION_TYPE_P (t
)
14007 && COMPLETE_TYPE_P (t
)
14008 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
14012 /* Fortran builds qualified variants as new records with items of
14013 qualified type. Verify that they looks same. */
14014 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
14016 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14017 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
14018 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
14019 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
14020 /* FIXME: gfc_nonrestricted_type builds all types as variants
14021 with exception of pointer types. It deeply copies the type
14022 which means that we may end up with a variant type
14023 referring non-variant pointer. We may change it to
14024 produce types as variants, too, like
14025 objc_get_protocol_qualified_type does. */
14026 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
14027 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
14028 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14032 error ("type variant has different %<TYPE_FIELDS%>");
14034 error ("first mismatch is field");
14036 error ("and field");
14041 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14042 verify_variant_match (TYPE_ARG_TYPES
);
14043 /* For C++ the qualified variant of array type is really an array type
14044 of qualified TREE_TYPE.
14045 objc builds variants of pointer where pointer to type is a variant, too
14046 in objc_get_protocol_qualified_type. */
14047 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14048 && ((TREE_CODE (t
) != ARRAY_TYPE
14049 && !POINTER_TYPE_P (t
))
14050 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14051 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14053 error ("type variant has different %<TREE_TYPE%>");
14055 error ("type variant%'s %<TREE_TYPE%>");
14056 debug_tree (TREE_TYPE (tv
));
14057 error ("type%'s %<TREE_TYPE%>");
14058 debug_tree (TREE_TYPE (t
));
14061 if (type_with_alias_set_p (t
)
14062 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14064 error ("type is not compatible with its variant");
14066 error ("type variant%'s %<TREE_TYPE%>");
14067 debug_tree (TREE_TYPE (tv
));
14068 error ("type%'s %<TREE_TYPE%>");
14069 debug_tree (TREE_TYPE (t
));
14073 #undef verify_variant_match
14077 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14078 the middle-end types_compatible_p function. It needs to avoid
14079 claiming types are different for types that should be treated
14080 the same with respect to TBAA. Canonical types are also used
14081 for IL consistency checks via the useless_type_conversion_p
14082 predicate which does not handle all type kinds itself but falls
14083 back to pointer-comparison of TYPE_CANONICAL for aggregates
14086 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14087 type calculation because we need to allow inter-operability between signed
14088 and unsigned variants. */
14091 type_with_interoperable_signedness (const_tree type
)
14093 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14094 signed char and unsigned char. Similarly fortran FE builds
14095 C_SIZE_T as signed type, while C defines it unsigned. */
14097 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14099 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14100 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14103 /* Return true iff T1 and T2 are structurally identical for what
14105 This function is used both by lto.c canonical type merging and by the
14106 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14107 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14108 only for LTO because only in these cases TYPE_CANONICAL equivalence
14109 correspond to one defined by gimple_canonical_types_compatible_p. */
14112 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14113 bool trust_type_canonical
)
14115 /* Type variants should be same as the main variant. When not doing sanity
14116 checking to verify this fact, go to main variants and save some work. */
14117 if (trust_type_canonical
)
14119 t1
= TYPE_MAIN_VARIANT (t1
);
14120 t2
= TYPE_MAIN_VARIANT (t2
);
14123 /* Check first for the obvious case of pointer identity. */
14127 /* Check that we have two types to compare. */
14128 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14131 /* We consider complete types always compatible with incomplete type.
14132 This does not make sense for canonical type calculation and thus we
14133 need to ensure that we are never called on it.
14135 FIXME: For more correctness the function probably should have three modes
14136 1) mode assuming that types are complete mathcing their structure
14137 2) mode allowing incomplete types but producing equivalence classes
14138 and thus ignoring all info from complete types
14139 3) mode allowing incomplete types to match complete but checking
14140 compatibility between complete types.
14142 1 and 2 can be used for canonical type calculation. 3 is the real
14143 definition of type compatibility that can be used i.e. for warnings during
14144 declaration merging. */
14146 gcc_assert (!trust_type_canonical
14147 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14149 /* If the types have been previously registered and found equal
14152 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14153 && trust_type_canonical
)
14155 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14156 they are always NULL, but they are set to non-NULL for types
14157 constructed by build_pointer_type and variants. In this case the
14158 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14159 all pointers are considered equal. Be sure to not return false
14161 gcc_checking_assert (canonical_type_used_p (t1
)
14162 && canonical_type_used_p (t2
));
14163 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14166 /* For types where we do ODR based TBAA the canonical type is always
14167 set correctly, so we know that types are different if their
14168 canonical types does not match. */
14169 if (trust_type_canonical
14170 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14171 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14174 /* Can't be the same type if the types don't have the same code. */
14175 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14176 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14179 /* Qualifiers do not matter for canonical type comparison purposes. */
14181 /* Void types and nullptr types are always the same. */
14182 if (TREE_CODE (t1
) == VOID_TYPE
14183 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14186 /* Can't be the same type if they have different mode. */
14187 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14190 /* Non-aggregate types can be handled cheaply. */
14191 if (INTEGRAL_TYPE_P (t1
)
14192 || SCALAR_FLOAT_TYPE_P (t1
)
14193 || FIXED_POINT_TYPE_P (t1
)
14194 || TREE_CODE (t1
) == VECTOR_TYPE
14195 || TREE_CODE (t1
) == COMPLEX_TYPE
14196 || TREE_CODE (t1
) == OFFSET_TYPE
14197 || POINTER_TYPE_P (t1
))
14199 /* Can't be the same type if they have different recision. */
14200 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14203 /* In some cases the signed and unsigned types are required to be
14205 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14206 && !type_with_interoperable_signedness (t1
))
14209 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14210 interoperable with "signed char". Unless all frontends are revisited
14211 to agree on these types, we must ignore the flag completely. */
14213 /* Fortran standard define C_PTR type that is compatible with every
14214 C pointer. For this reason we need to glob all pointers into one.
14215 Still pointers in different address spaces are not compatible. */
14216 if (POINTER_TYPE_P (t1
))
14218 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14219 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14223 /* Tail-recurse to components. */
14224 if (TREE_CODE (t1
) == VECTOR_TYPE
14225 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14226 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14228 trust_type_canonical
);
14233 /* Do type-specific comparisons. */
14234 switch (TREE_CODE (t1
))
14237 /* Array types are the same if the element types are the same and
14238 the number of elements are the same. */
14239 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14240 trust_type_canonical
)
14241 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14242 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14243 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14247 tree i1
= TYPE_DOMAIN (t1
);
14248 tree i2
= TYPE_DOMAIN (t2
);
14250 /* For an incomplete external array, the type domain can be
14251 NULL_TREE. Check this condition also. */
14252 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14254 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14258 tree min1
= TYPE_MIN_VALUE (i1
);
14259 tree min2
= TYPE_MIN_VALUE (i2
);
14260 tree max1
= TYPE_MAX_VALUE (i1
);
14261 tree max2
= TYPE_MAX_VALUE (i2
);
14263 /* The minimum/maximum values have to be the same. */
14266 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14267 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14268 || operand_equal_p (min1
, min2
, 0))))
14271 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14272 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14273 || operand_equal_p (max1
, max2
, 0)))))
14281 case FUNCTION_TYPE
:
14282 /* Function types are the same if the return type and arguments types
14284 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14285 trust_type_canonical
))
14288 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14292 tree parms1
, parms2
;
14294 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14296 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14298 if (!gimple_canonical_types_compatible_p
14299 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14300 trust_type_canonical
))
14304 if (parms1
|| parms2
)
14312 case QUAL_UNION_TYPE
:
14316 /* Don't try to compare variants of an incomplete type, before
14317 TYPE_FIELDS has been copied around. */
14318 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14322 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14325 /* For aggregate types, all the fields must be the same. */
14326 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14328 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14330 /* Skip non-fields and zero-sized fields. */
14331 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14333 && integer_zerop (DECL_SIZE (f1
)))))
14334 f1
= TREE_CHAIN (f1
);
14335 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14337 && integer_zerop (DECL_SIZE (f2
)))))
14338 f2
= TREE_CHAIN (f2
);
14341 /* The fields must have the same name, offset and type. */
14342 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14343 || !gimple_compare_field_offset (f1
, f2
)
14344 || !gimple_canonical_types_compatible_p
14345 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14346 trust_type_canonical
))
14350 /* If one aggregate has more fields than the other, they
14351 are not the same. */
14359 /* Consider all types with language specific trees in them mutually
14360 compatible. This is executed only from verify_type and false
14361 positives can be tolerated. */
14362 gcc_assert (!in_lto_p
);
14367 /* Verify type T. */
14370 verify_type (const_tree t
)
14372 bool error_found
= false;
14373 tree mv
= TYPE_MAIN_VARIANT (t
);
14376 error ("main variant is not defined");
14377 error_found
= true;
14379 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14381 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14383 error_found
= true;
14385 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14386 error_found
= true;
14388 tree ct
= TYPE_CANONICAL (t
);
14391 else if (TYPE_CANONICAL (t
) != ct
)
14393 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14395 error_found
= true;
14397 /* Method and function types cannot be used to address memory and thus
14398 TYPE_CANONICAL really matters only for determining useless conversions.
14400 FIXME: C++ FE produce declarations of builtin functions that are not
14401 compatible with main variants. */
14402 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14405 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14406 with variably sized arrays because their sizes possibly
14407 gimplified to different variables. */
14408 && !variably_modified_type_p (ct
, NULL
)
14409 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14410 && COMPLETE_TYPE_P (t
))
14412 error ("%<TYPE_CANONICAL%> is not compatible");
14414 error_found
= true;
14417 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14418 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14420 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14422 error_found
= true;
14424 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14426 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14428 debug_tree (TYPE_MAIN_VARIANT (ct
));
14429 error_found
= true;
14433 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14434 if (RECORD_OR_UNION_TYPE_P (t
))
14436 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14437 and danagle the pointer from time to time. */
14438 if (TYPE_VFIELD (t
)
14439 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14440 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14442 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14443 debug_tree (TYPE_VFIELD (t
));
14444 error_found
= true;
14447 else if (TREE_CODE (t
) == POINTER_TYPE
)
14449 if (TYPE_NEXT_PTR_TO (t
)
14450 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14452 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14453 debug_tree (TYPE_NEXT_PTR_TO (t
));
14454 error_found
= true;
14457 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14459 if (TYPE_NEXT_REF_TO (t
)
14460 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14462 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14463 debug_tree (TYPE_NEXT_REF_TO (t
));
14464 error_found
= true;
14467 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14468 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14470 /* FIXME: The following check should pass:
14471 useless_type_conversion_p (const_cast <tree> (t),
14472 TREE_TYPE (TYPE_MIN_VALUE (t))
14473 but does not for C sizetypes in LTO. */
14476 /* Check various uses of TYPE_MAXVAL_RAW. */
14477 if (RECORD_OR_UNION_TYPE_P (t
))
14479 if (!TYPE_BINFO (t
))
14481 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14483 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14484 debug_tree (TYPE_BINFO (t
));
14485 error_found
= true;
14487 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14489 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14490 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14491 error_found
= true;
14494 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14496 if (TYPE_METHOD_BASETYPE (t
)
14497 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14498 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14500 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14501 debug_tree (TYPE_METHOD_BASETYPE (t
));
14502 error_found
= true;
14505 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14507 if (TYPE_OFFSET_BASETYPE (t
)
14508 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14509 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14511 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14512 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14513 error_found
= true;
14516 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14517 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14519 /* FIXME: The following check should pass:
14520 useless_type_conversion_p (const_cast <tree> (t),
14521 TREE_TYPE (TYPE_MAX_VALUE (t))
14522 but does not for C sizetypes in LTO. */
14524 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14526 if (TYPE_ARRAY_MAX_SIZE (t
)
14527 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14529 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14530 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14531 error_found
= true;
14534 else if (TYPE_MAX_VALUE_RAW (t
))
14536 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14537 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14538 error_found
= true;
14541 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14543 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14544 debug_tree (TYPE_LANG_SLOT_1 (t
));
14545 error_found
= true;
14548 /* Check various uses of TYPE_VALUES_RAW. */
14549 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14550 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14552 tree value
= TREE_VALUE (l
);
14553 tree name
= TREE_PURPOSE (l
);
14555 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14556 CONST_DECL of ENUMERAL TYPE. */
14557 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14559 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14560 debug_tree (value
);
14562 error_found
= true;
14564 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14565 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14567 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14569 debug_tree (value
);
14571 error_found
= true;
14573 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14575 error ("enum value name is not %<IDENTIFIER_NODE%>");
14576 debug_tree (value
);
14578 error_found
= true;
14581 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14583 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14585 error ("array %<TYPE_DOMAIN%> is not integer type");
14586 debug_tree (TYPE_DOMAIN (t
));
14587 error_found
= true;
14590 else if (RECORD_OR_UNION_TYPE_P (t
))
14592 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14594 error ("%<TYPE_FIELDS%> defined in incomplete type");
14595 error_found
= true;
14597 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14599 /* TODO: verify properties of decls. */
14600 if (TREE_CODE (fld
) == FIELD_DECL
)
14602 else if (TREE_CODE (fld
) == TYPE_DECL
)
14604 else if (TREE_CODE (fld
) == CONST_DECL
)
14606 else if (VAR_P (fld
))
14608 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14610 else if (TREE_CODE (fld
) == USING_DECL
)
14612 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14616 error ("wrong tree in %<TYPE_FIELDS%> list");
14618 error_found
= true;
14622 else if (TREE_CODE (t
) == INTEGER_TYPE
14623 || TREE_CODE (t
) == BOOLEAN_TYPE
14624 || TREE_CODE (t
) == OFFSET_TYPE
14625 || TREE_CODE (t
) == REFERENCE_TYPE
14626 || TREE_CODE (t
) == NULLPTR_TYPE
14627 || TREE_CODE (t
) == POINTER_TYPE
)
14629 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14631 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14633 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14634 error_found
= true;
14636 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14638 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14639 debug_tree (TYPE_CACHED_VALUES (t
));
14640 error_found
= true;
14642 /* Verify just enough of cache to ensure that no one copied it to new type.
14643 All copying should go by copy_node that should clear it. */
14644 else if (TYPE_CACHED_VALUES_P (t
))
14647 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14648 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14649 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14651 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14652 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14653 error_found
= true;
14658 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14659 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14661 /* C++ FE uses TREE_PURPOSE to store initial values. */
14662 if (TREE_PURPOSE (l
) && in_lto_p
)
14664 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14666 error_found
= true;
14668 if (!TYPE_P (TREE_VALUE (l
)))
14670 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14672 error_found
= true;
14675 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14677 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14678 debug_tree (TYPE_VALUES_RAW (t
));
14679 error_found
= true;
14681 if (TREE_CODE (t
) != INTEGER_TYPE
14682 && TREE_CODE (t
) != BOOLEAN_TYPE
14683 && TREE_CODE (t
) != OFFSET_TYPE
14684 && TREE_CODE (t
) != REFERENCE_TYPE
14685 && TREE_CODE (t
) != NULLPTR_TYPE
14686 && TREE_CODE (t
) != POINTER_TYPE
14687 && TYPE_CACHED_VALUES_P (t
))
14689 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14690 error_found
= true;
14693 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14694 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14696 if (TREE_CODE (t
) == METHOD_TYPE
14697 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14699 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14700 error_found
= true;
14705 debug_tree (const_cast <tree
> (t
));
14706 internal_error ("%qs failed", __func__
);
14711 /* Return 1 if ARG interpreted as signed in its precision is known to be
14712 always positive or 2 if ARG is known to be always negative, or 3 if
14713 ARG may be positive or negative. */
14716 get_range_pos_neg (tree arg
)
14718 if (arg
== error_mark_node
)
14721 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14723 if (TREE_CODE (arg
) == INTEGER_CST
)
14725 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14731 while (CONVERT_EXPR_P (arg
)
14732 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14733 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14735 arg
= TREE_OPERAND (arg
, 0);
14736 /* Narrower value zero extended into wider type
14737 will always result in positive values. */
14738 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14739 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14741 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14746 if (TREE_CODE (arg
) != SSA_NAME
)
14748 wide_int arg_min
, arg_max
;
14749 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14751 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14752 if (is_gimple_assign (g
)
14753 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14755 tree t
= gimple_assign_rhs1 (g
);
14756 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14757 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14759 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14760 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14762 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14771 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14773 /* For unsigned values, the "positive" range comes
14774 below the "negative" range. */
14775 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14777 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14782 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14784 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14793 /* Return true if ARG is marked with the nonnull attribute in the
14794 current function signature. */
14797 nonnull_arg_p (const_tree arg
)
14799 tree t
, attrs
, fntype
;
14800 unsigned HOST_WIDE_INT arg_num
;
14802 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14803 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14804 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14806 /* The static chain decl is always non null. */
14807 if (arg
== cfun
->static_chain_decl
)
14810 /* THIS argument of method is always non-NULL. */
14811 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14812 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14813 && flag_delete_null_pointer_checks
)
14816 /* Values passed by reference are always non-NULL. */
14817 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14818 && flag_delete_null_pointer_checks
)
14821 fntype
= TREE_TYPE (cfun
->decl
);
14822 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14824 attrs
= lookup_attribute ("nonnull", attrs
);
14826 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14827 if (attrs
== NULL_TREE
)
14830 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14831 if (TREE_VALUE (attrs
) == NULL_TREE
)
14834 /* Get the position number for ARG in the function signature. */
14835 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14837 t
= DECL_CHAIN (t
), arg_num
++)
14843 gcc_assert (t
== arg
);
14845 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14846 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14848 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14856 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14860 set_block (location_t loc
, tree block
)
14862 location_t pure_loc
= get_pure_location (loc
);
14863 source_range src_range
= get_range_from_loc (line_table
, loc
);
14864 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14868 set_source_range (tree expr
, location_t start
, location_t finish
)
14870 source_range src_range
;
14871 src_range
.m_start
= start
;
14872 src_range
.m_finish
= finish
;
14873 return set_source_range (expr
, src_range
);
14877 set_source_range (tree expr
, source_range src_range
)
14879 if (!EXPR_P (expr
))
14880 return UNKNOWN_LOCATION
;
14882 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14883 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14887 SET_EXPR_LOCATION (expr
, adhoc
);
14891 /* Return EXPR, potentially wrapped with a node expression LOC,
14892 if !CAN_HAVE_LOCATION_P (expr).
14894 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14895 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14897 Wrapper nodes can be identified using location_wrapper_p. */
14900 maybe_wrap_with_location (tree expr
, location_t loc
)
14904 if (loc
== UNKNOWN_LOCATION
)
14906 if (CAN_HAVE_LOCATION_P (expr
))
14908 /* We should only be adding wrappers for constants and for decls,
14909 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14910 gcc_assert (CONSTANT_CLASS_P (expr
)
14912 || EXCEPTIONAL_CLASS_P (expr
));
14914 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14915 any impact of the wrapper nodes. */
14916 if (EXCEPTIONAL_CLASS_P (expr
))
14919 /* If any auto_suppress_location_wrappers are active, don't create
14921 if (suppress_location_wrappers
> 0)
14925 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14926 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14927 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14928 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14929 /* Mark this node as being a wrapper. */
14930 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14934 int suppress_location_wrappers
;
14936 /* Return the name of combined function FN, for debugging purposes. */
14939 combined_fn_name (combined_fn fn
)
14941 if (builtin_fn_p (fn
))
14943 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14944 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14947 return internal_fn_name (as_internal_fn (fn
));
14950 /* Return a bitmap with a bit set corresponding to each argument in
14951 a function call type FNTYPE declared with attribute nonnull,
14952 or null if none of the function's argument are nonnull. The caller
14953 must free the bitmap. */
14956 get_nonnull_args (const_tree fntype
)
14958 if (fntype
== NULL_TREE
)
14961 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14965 bitmap argmap
= NULL
;
14967 /* A function declaration can specify multiple attribute nonnull,
14968 each with zero or more arguments. The loop below creates a bitmap
14969 representing a union of all the arguments. An empty (but non-null)
14970 bitmap means that all arguments have been declaraed nonnull. */
14971 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14973 attrs
= lookup_attribute ("nonnull", attrs
);
14978 argmap
= BITMAP_ALLOC (NULL
);
14980 if (!TREE_VALUE (attrs
))
14982 /* Clear the bitmap in case a previous attribute nonnull
14983 set it and this one overrides it for all arguments. */
14984 bitmap_clear (argmap
);
14988 /* Iterate over the indices of the format arguments declared nonnull
14989 and set a bit for each. */
14990 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14992 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14993 bitmap_set_bit (argmap
, val
);
15000 /* Returns true if TYPE is a type where it and all of its subobjects
15001 (recursively) are of structure, union, or array type. */
15004 default_is_empty_type (tree type
)
15006 if (RECORD_OR_UNION_TYPE_P (type
))
15008 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
15009 if (TREE_CODE (field
) == FIELD_DECL
15010 && !DECL_PADDING_P (field
)
15011 && !default_is_empty_type (TREE_TYPE (field
)))
15015 else if (TREE_CODE (type
) == ARRAY_TYPE
)
15016 return (integer_minus_onep (array_type_nelts (type
))
15017 || TYPE_DOMAIN (type
) == NULL_TREE
15018 || default_is_empty_type (TREE_TYPE (type
)));
15022 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15023 that shouldn't be passed via stack. */
15026 default_is_empty_record (const_tree type
)
15028 if (!abi_version_at_least (12))
15031 if (type
== error_mark_node
)
15034 if (TREE_ADDRESSABLE (type
))
15037 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
15040 /* Determine whether TYPE is a structure with a flexible array member,
15041 or a union containing such a structure (possibly recursively). */
15044 flexible_array_type_p (const_tree type
)
15047 switch (TREE_CODE (type
))
15051 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15052 if (TREE_CODE (x
) == FIELD_DECL
)
15054 if (last
== NULL_TREE
)
15056 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
15057 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
15058 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
15059 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
15063 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15065 if (TREE_CODE (x
) == FIELD_DECL
15066 && flexible_array_type_p (TREE_TYPE (x
)))
15075 /* Like int_size_in_bytes, but handle empty records specially. */
15078 arg_int_size_in_bytes (const_tree type
)
15080 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15083 /* Like size_in_bytes, but handle empty records specially. */
15086 arg_size_in_bytes (const_tree type
)
15088 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15091 /* Return true if an expression with CODE has to have the same result type as
15092 its first operand. */
15095 expr_type_first_operand_type_p (tree_code code
)
15108 case TRUNC_DIV_EXPR
:
15109 case CEIL_DIV_EXPR
:
15110 case FLOOR_DIV_EXPR
:
15111 case ROUND_DIV_EXPR
:
15112 case TRUNC_MOD_EXPR
:
15113 case CEIL_MOD_EXPR
:
15114 case FLOOR_MOD_EXPR
:
15115 case ROUND_MOD_EXPR
:
15117 case EXACT_DIV_EXPR
:
15135 /* Return a typenode for the "standard" C type with a given name. */
15137 get_typenode_from_name (const char *name
)
15139 if (name
== NULL
|| *name
== '\0')
15142 if (strcmp (name
, "char") == 0)
15143 return char_type_node
;
15144 if (strcmp (name
, "unsigned char") == 0)
15145 return unsigned_char_type_node
;
15146 if (strcmp (name
, "signed char") == 0)
15147 return signed_char_type_node
;
15149 if (strcmp (name
, "short int") == 0)
15150 return short_integer_type_node
;
15151 if (strcmp (name
, "short unsigned int") == 0)
15152 return short_unsigned_type_node
;
15154 if (strcmp (name
, "int") == 0)
15155 return integer_type_node
;
15156 if (strcmp (name
, "unsigned int") == 0)
15157 return unsigned_type_node
;
15159 if (strcmp (name
, "long int") == 0)
15160 return long_integer_type_node
;
15161 if (strcmp (name
, "long unsigned int") == 0)
15162 return long_unsigned_type_node
;
15164 if (strcmp (name
, "long long int") == 0)
15165 return long_long_integer_type_node
;
15166 if (strcmp (name
, "long long unsigned int") == 0)
15167 return long_long_unsigned_type_node
;
15169 gcc_unreachable ();
15172 /* List of pointer types used to declare builtins before we have seen their
15175 Keep the size up to date in tree.h ! */
15176 const builtin_structptr_type builtin_structptr_types
[6] =
15178 { fileptr_type_node
, ptr_type_node
, "FILE" },
15179 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15180 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15181 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15182 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15183 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15186 /* Return the maximum object size. */
15189 max_object_size (void)
15191 /* To do: Make this a configurable parameter. */
15192 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15195 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15196 parameter default to false and that weeds out error_mark_node. */
15199 verify_type_context (location_t loc
, type_context_kind context
,
15200 const_tree type
, bool silent_p
)
15202 if (type
== error_mark_node
)
15205 gcc_assert (TYPE_P (type
));
15206 return (!targetm
.verify_type_context
15207 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
15212 namespace selftest
{
15214 /* Selftests for tree. */
15216 /* Verify that integer constants are sane. */
15219 test_integer_constants ()
15221 ASSERT_TRUE (integer_type_node
!= NULL
);
15222 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15224 tree type
= integer_type_node
;
15226 tree zero
= build_zero_cst (type
);
15227 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15228 ASSERT_EQ (type
, TREE_TYPE (zero
));
15230 tree one
= build_int_cst (type
, 1);
15231 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15232 ASSERT_EQ (type
, TREE_TYPE (zero
));
15235 /* Verify identifiers. */
15238 test_identifiers ()
15240 tree identifier
= get_identifier ("foo");
15241 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15242 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15245 /* Verify LABEL_DECL. */
15250 tree identifier
= get_identifier ("err");
15251 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15252 identifier
, void_type_node
);
15253 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15254 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15257 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15258 are given by VALS. */
15261 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15263 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15264 tree_vector_builder
builder (type
, vals
.length (), 1);
15265 builder
.splice (vals
);
15266 return builder
.build ();
15269 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15272 check_vector_cst (vec
<tree
> expected
, tree actual
)
15274 ASSERT_KNOWN_EQ (expected
.length (),
15275 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15276 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15277 ASSERT_EQ (wi::to_wide (expected
[i
]),
15278 wi::to_wide (vector_cst_elt (actual
, i
)));
15281 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15282 and that its elements match EXPECTED. */
15285 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15286 unsigned int npatterns
)
15288 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15289 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15290 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15291 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15292 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15293 check_vector_cst (expected
, actual
);
15296 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15297 and NPATTERNS background elements, and that its elements match
15301 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15302 unsigned int npatterns
)
15304 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15305 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15306 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15307 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15308 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15309 check_vector_cst (expected
, actual
);
15312 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15313 and that its elements match EXPECTED. */
15316 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15317 unsigned int npatterns
)
15319 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15320 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15321 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15322 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15323 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15324 check_vector_cst (expected
, actual
);
15327 /* Test the creation of VECTOR_CSTs. */
15330 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15332 auto_vec
<tree
, 8> elements (8);
15333 elements
.quick_grow (8);
15334 tree element_type
= build_nonstandard_integer_type (16, true);
15335 tree vector_type
= build_vector_type (element_type
, 8);
15337 /* Test a simple linear series with a base of 0 and a step of 1:
15338 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15339 for (unsigned int i
= 0; i
< 8; ++i
)
15340 elements
[i
] = build_int_cst (element_type
, i
);
15341 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15342 check_vector_cst_stepped (elements
, vector
, 1);
15344 /* Try the same with the first element replaced by 100:
15345 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15346 elements
[0] = build_int_cst (element_type
, 100);
15347 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15348 check_vector_cst_stepped (elements
, vector
, 1);
15350 /* Try a series that wraps around.
15351 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15352 for (unsigned int i
= 1; i
< 8; ++i
)
15353 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15354 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15355 check_vector_cst_stepped (elements
, vector
, 1);
15357 /* Try a downward series:
15358 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15359 for (unsigned int i
= 1; i
< 8; ++i
)
15360 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15361 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15362 check_vector_cst_stepped (elements
, vector
, 1);
15364 /* Try two interleaved series with different bases and steps:
15365 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15366 elements
[1] = build_int_cst (element_type
, 53);
15367 for (unsigned int i
= 2; i
< 8; i
+= 2)
15369 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15370 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15372 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15373 check_vector_cst_stepped (elements
, vector
, 2);
15375 /* Try a duplicated value:
15376 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15377 for (unsigned int i
= 1; i
< 8; ++i
)
15378 elements
[i
] = elements
[0];
15379 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15380 check_vector_cst_duplicate (elements
, vector
, 1);
15382 /* Try an interleaved duplicated value:
15383 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15384 elements
[1] = build_int_cst (element_type
, 55);
15385 for (unsigned int i
= 2; i
< 8; ++i
)
15386 elements
[i
] = elements
[i
- 2];
15387 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15388 check_vector_cst_duplicate (elements
, vector
, 2);
15390 /* Try a duplicated value with 2 exceptions
15391 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15392 elements
[0] = build_int_cst (element_type
, 41);
15393 elements
[1] = build_int_cst (element_type
, 97);
15394 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15395 check_vector_cst_fill (elements
, vector
, 2);
15397 /* Try with and without a step
15398 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15399 for (unsigned int i
= 3; i
< 8; i
+= 2)
15400 elements
[i
] = build_int_cst (element_type
, i
* 7);
15401 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15402 check_vector_cst_stepped (elements
, vector
, 2);
15404 /* Try a fully-general constant:
15405 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15406 elements
[5] = build_int_cst (element_type
, 9990);
15407 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15408 check_vector_cst_fill (elements
, vector
, 4);
15411 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15412 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15413 modifying its argument in-place. */
15416 check_strip_nops (tree node
, tree expected
)
15419 ASSERT_EQ (expected
, node
);
15422 /* Verify location wrappers. */
15425 test_location_wrappers ()
15427 location_t loc
= BUILTINS_LOCATION
;
15429 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15431 /* Wrapping a constant. */
15432 tree int_cst
= build_int_cst (integer_type_node
, 42);
15433 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15434 ASSERT_FALSE (location_wrapper_p (int_cst
));
15436 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15437 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15438 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15439 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15441 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15442 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15444 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15445 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15446 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15447 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15449 /* Wrapping a STRING_CST. */
15450 tree string_cst
= build_string (4, "foo");
15451 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15452 ASSERT_FALSE (location_wrapper_p (string_cst
));
15454 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15455 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15456 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15457 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15458 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15461 /* Wrapping a variable. */
15462 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15463 get_identifier ("some_int_var"),
15464 integer_type_node
);
15465 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15466 ASSERT_FALSE (location_wrapper_p (int_var
));
15468 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15469 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15470 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15471 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15473 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15475 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15476 ASSERT_FALSE (location_wrapper_p (r_cast
));
15477 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15479 /* Verify that STRIP_NOPS removes wrappers. */
15480 check_strip_nops (wrapped_int_cst
, int_cst
);
15481 check_strip_nops (wrapped_string_cst
, string_cst
);
15482 check_strip_nops (wrapped_int_var
, int_var
);
15485 /* Test various tree predicates. Verify that location wrappers don't
15486 affect the results. */
15491 /* Build various constants and wrappers around them. */
15493 location_t loc
= BUILTINS_LOCATION
;
15495 tree i_0
= build_int_cst (integer_type_node
, 0);
15496 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15498 tree i_1
= build_int_cst (integer_type_node
, 1);
15499 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15501 tree i_m1
= build_int_cst (integer_type_node
, -1);
15502 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15504 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15505 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15506 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15507 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15508 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15509 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15511 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15512 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15513 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15515 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15516 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15517 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15519 /* TODO: vector constants. */
15521 /* Test integer_onep. */
15522 ASSERT_FALSE (integer_onep (i_0
));
15523 ASSERT_FALSE (integer_onep (wr_i_0
));
15524 ASSERT_TRUE (integer_onep (i_1
));
15525 ASSERT_TRUE (integer_onep (wr_i_1
));
15526 ASSERT_FALSE (integer_onep (i_m1
));
15527 ASSERT_FALSE (integer_onep (wr_i_m1
));
15528 ASSERT_FALSE (integer_onep (f_0
));
15529 ASSERT_FALSE (integer_onep (wr_f_0
));
15530 ASSERT_FALSE (integer_onep (f_1
));
15531 ASSERT_FALSE (integer_onep (wr_f_1
));
15532 ASSERT_FALSE (integer_onep (f_m1
));
15533 ASSERT_FALSE (integer_onep (wr_f_m1
));
15534 ASSERT_FALSE (integer_onep (c_i_0
));
15535 ASSERT_TRUE (integer_onep (c_i_1
));
15536 ASSERT_FALSE (integer_onep (c_i_m1
));
15537 ASSERT_FALSE (integer_onep (c_f_0
));
15538 ASSERT_FALSE (integer_onep (c_f_1
));
15539 ASSERT_FALSE (integer_onep (c_f_m1
));
15541 /* Test integer_zerop. */
15542 ASSERT_TRUE (integer_zerop (i_0
));
15543 ASSERT_TRUE (integer_zerop (wr_i_0
));
15544 ASSERT_FALSE (integer_zerop (i_1
));
15545 ASSERT_FALSE (integer_zerop (wr_i_1
));
15546 ASSERT_FALSE (integer_zerop (i_m1
));
15547 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15548 ASSERT_FALSE (integer_zerop (f_0
));
15549 ASSERT_FALSE (integer_zerop (wr_f_0
));
15550 ASSERT_FALSE (integer_zerop (f_1
));
15551 ASSERT_FALSE (integer_zerop (wr_f_1
));
15552 ASSERT_FALSE (integer_zerop (f_m1
));
15553 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15554 ASSERT_TRUE (integer_zerop (c_i_0
));
15555 ASSERT_FALSE (integer_zerop (c_i_1
));
15556 ASSERT_FALSE (integer_zerop (c_i_m1
));
15557 ASSERT_FALSE (integer_zerop (c_f_0
));
15558 ASSERT_FALSE (integer_zerop (c_f_1
));
15559 ASSERT_FALSE (integer_zerop (c_f_m1
));
15561 /* Test integer_all_onesp. */
15562 ASSERT_FALSE (integer_all_onesp (i_0
));
15563 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15564 ASSERT_FALSE (integer_all_onesp (i_1
));
15565 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15566 ASSERT_TRUE (integer_all_onesp (i_m1
));
15567 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15568 ASSERT_FALSE (integer_all_onesp (f_0
));
15569 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15570 ASSERT_FALSE (integer_all_onesp (f_1
));
15571 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15572 ASSERT_FALSE (integer_all_onesp (f_m1
));
15573 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15574 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15575 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15576 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15577 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15578 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15579 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15581 /* Test integer_minus_onep. */
15582 ASSERT_FALSE (integer_minus_onep (i_0
));
15583 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15584 ASSERT_FALSE (integer_minus_onep (i_1
));
15585 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15586 ASSERT_TRUE (integer_minus_onep (i_m1
));
15587 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15588 ASSERT_FALSE (integer_minus_onep (f_0
));
15589 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15590 ASSERT_FALSE (integer_minus_onep (f_1
));
15591 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15592 ASSERT_FALSE (integer_minus_onep (f_m1
));
15593 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15594 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15595 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15596 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15597 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15598 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15599 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15601 /* Test integer_each_onep. */
15602 ASSERT_FALSE (integer_each_onep (i_0
));
15603 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15604 ASSERT_TRUE (integer_each_onep (i_1
));
15605 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15606 ASSERT_FALSE (integer_each_onep (i_m1
));
15607 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15608 ASSERT_FALSE (integer_each_onep (f_0
));
15609 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15610 ASSERT_FALSE (integer_each_onep (f_1
));
15611 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15612 ASSERT_FALSE (integer_each_onep (f_m1
));
15613 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15614 ASSERT_FALSE (integer_each_onep (c_i_0
));
15615 ASSERT_FALSE (integer_each_onep (c_i_1
));
15616 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15617 ASSERT_FALSE (integer_each_onep (c_f_0
));
15618 ASSERT_FALSE (integer_each_onep (c_f_1
));
15619 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15621 /* Test integer_truep. */
15622 ASSERT_FALSE (integer_truep (i_0
));
15623 ASSERT_FALSE (integer_truep (wr_i_0
));
15624 ASSERT_TRUE (integer_truep (i_1
));
15625 ASSERT_TRUE (integer_truep (wr_i_1
));
15626 ASSERT_FALSE (integer_truep (i_m1
));
15627 ASSERT_FALSE (integer_truep (wr_i_m1
));
15628 ASSERT_FALSE (integer_truep (f_0
));
15629 ASSERT_FALSE (integer_truep (wr_f_0
));
15630 ASSERT_FALSE (integer_truep (f_1
));
15631 ASSERT_FALSE (integer_truep (wr_f_1
));
15632 ASSERT_FALSE (integer_truep (f_m1
));
15633 ASSERT_FALSE (integer_truep (wr_f_m1
));
15634 ASSERT_FALSE (integer_truep (c_i_0
));
15635 ASSERT_TRUE (integer_truep (c_i_1
));
15636 ASSERT_FALSE (integer_truep (c_i_m1
));
15637 ASSERT_FALSE (integer_truep (c_f_0
));
15638 ASSERT_FALSE (integer_truep (c_f_1
));
15639 ASSERT_FALSE (integer_truep (c_f_m1
));
15641 /* Test integer_nonzerop. */
15642 ASSERT_FALSE (integer_nonzerop (i_0
));
15643 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15644 ASSERT_TRUE (integer_nonzerop (i_1
));
15645 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15646 ASSERT_TRUE (integer_nonzerop (i_m1
));
15647 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15648 ASSERT_FALSE (integer_nonzerop (f_0
));
15649 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15650 ASSERT_FALSE (integer_nonzerop (f_1
));
15651 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15652 ASSERT_FALSE (integer_nonzerop (f_m1
));
15653 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15654 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15655 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15656 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15657 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15658 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15659 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15661 /* Test real_zerop. */
15662 ASSERT_FALSE (real_zerop (i_0
));
15663 ASSERT_FALSE (real_zerop (wr_i_0
));
15664 ASSERT_FALSE (real_zerop (i_1
));
15665 ASSERT_FALSE (real_zerop (wr_i_1
));
15666 ASSERT_FALSE (real_zerop (i_m1
));
15667 ASSERT_FALSE (real_zerop (wr_i_m1
));
15668 ASSERT_TRUE (real_zerop (f_0
));
15669 ASSERT_TRUE (real_zerop (wr_f_0
));
15670 ASSERT_FALSE (real_zerop (f_1
));
15671 ASSERT_FALSE (real_zerop (wr_f_1
));
15672 ASSERT_FALSE (real_zerop (f_m1
));
15673 ASSERT_FALSE (real_zerop (wr_f_m1
));
15674 ASSERT_FALSE (real_zerop (c_i_0
));
15675 ASSERT_FALSE (real_zerop (c_i_1
));
15676 ASSERT_FALSE (real_zerop (c_i_m1
));
15677 ASSERT_TRUE (real_zerop (c_f_0
));
15678 ASSERT_FALSE (real_zerop (c_f_1
));
15679 ASSERT_FALSE (real_zerop (c_f_m1
));
15681 /* Test real_onep. */
15682 ASSERT_FALSE (real_onep (i_0
));
15683 ASSERT_FALSE (real_onep (wr_i_0
));
15684 ASSERT_FALSE (real_onep (i_1
));
15685 ASSERT_FALSE (real_onep (wr_i_1
));
15686 ASSERT_FALSE (real_onep (i_m1
));
15687 ASSERT_FALSE (real_onep (wr_i_m1
));
15688 ASSERT_FALSE (real_onep (f_0
));
15689 ASSERT_FALSE (real_onep (wr_f_0
));
15690 ASSERT_TRUE (real_onep (f_1
));
15691 ASSERT_TRUE (real_onep (wr_f_1
));
15692 ASSERT_FALSE (real_onep (f_m1
));
15693 ASSERT_FALSE (real_onep (wr_f_m1
));
15694 ASSERT_FALSE (real_onep (c_i_0
));
15695 ASSERT_FALSE (real_onep (c_i_1
));
15696 ASSERT_FALSE (real_onep (c_i_m1
));
15697 ASSERT_FALSE (real_onep (c_f_0
));
15698 ASSERT_TRUE (real_onep (c_f_1
));
15699 ASSERT_FALSE (real_onep (c_f_m1
));
15701 /* Test real_minus_onep. */
15702 ASSERT_FALSE (real_minus_onep (i_0
));
15703 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15704 ASSERT_FALSE (real_minus_onep (i_1
));
15705 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15706 ASSERT_FALSE (real_minus_onep (i_m1
));
15707 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15708 ASSERT_FALSE (real_minus_onep (f_0
));
15709 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15710 ASSERT_FALSE (real_minus_onep (f_1
));
15711 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15712 ASSERT_TRUE (real_minus_onep (f_m1
));
15713 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15714 ASSERT_FALSE (real_minus_onep (c_i_0
));
15715 ASSERT_FALSE (real_minus_onep (c_i_1
));
15716 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15717 ASSERT_FALSE (real_minus_onep (c_f_0
));
15718 ASSERT_FALSE (real_minus_onep (c_f_1
));
15719 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15722 ASSERT_TRUE (zerop (i_0
));
15723 ASSERT_TRUE (zerop (wr_i_0
));
15724 ASSERT_FALSE (zerop (i_1
));
15725 ASSERT_FALSE (zerop (wr_i_1
));
15726 ASSERT_FALSE (zerop (i_m1
));
15727 ASSERT_FALSE (zerop (wr_i_m1
));
15728 ASSERT_TRUE (zerop (f_0
));
15729 ASSERT_TRUE (zerop (wr_f_0
));
15730 ASSERT_FALSE (zerop (f_1
));
15731 ASSERT_FALSE (zerop (wr_f_1
));
15732 ASSERT_FALSE (zerop (f_m1
));
15733 ASSERT_FALSE (zerop (wr_f_m1
));
15734 ASSERT_TRUE (zerop (c_i_0
));
15735 ASSERT_FALSE (zerop (c_i_1
));
15736 ASSERT_FALSE (zerop (c_i_m1
));
15737 ASSERT_TRUE (zerop (c_f_0
));
15738 ASSERT_FALSE (zerop (c_f_1
));
15739 ASSERT_FALSE (zerop (c_f_m1
));
15741 /* Test tree_expr_nonnegative_p. */
15742 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15743 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15744 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15745 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15746 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15747 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15748 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15749 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15750 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15751 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15752 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15753 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15754 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15755 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15756 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15757 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15758 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15759 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15761 /* Test tree_expr_nonzero_p. */
15762 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15763 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15764 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15765 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15766 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15767 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15769 /* Test integer_valued_real_p. */
15770 ASSERT_FALSE (integer_valued_real_p (i_0
));
15771 ASSERT_TRUE (integer_valued_real_p (f_0
));
15772 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15773 ASSERT_TRUE (integer_valued_real_p (f_1
));
15774 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15776 /* Test integer_pow2p. */
15777 ASSERT_FALSE (integer_pow2p (i_0
));
15778 ASSERT_TRUE (integer_pow2p (i_1
));
15779 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15781 /* Test uniform_integer_cst_p. */
15782 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15783 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15784 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15785 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15786 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15787 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15788 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15789 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15790 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15791 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15792 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15793 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15794 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15795 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15796 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15797 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15798 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15799 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15802 /* Check that string escaping works correctly. */
15805 test_escaped_strings (void)
15808 escaped_string msg
;
15811 /* ASSERT_STREQ does not accept NULL as a valid test
15812 result, so we have to use ASSERT_EQ instead. */
15813 ASSERT_EQ (NULL
, (const char *) msg
);
15816 ASSERT_STREQ ("", (const char *) msg
);
15818 msg
.escape ("foobar");
15819 ASSERT_STREQ ("foobar", (const char *) msg
);
15821 /* Ensure that we have -fmessage-length set to 0. */
15822 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15823 pp_line_cutoff (global_dc
->printer
) = 0;
15825 msg
.escape ("foo\nbar");
15826 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15828 msg
.escape ("\a\b\f\n\r\t\v");
15829 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15831 /* Now repeat the tests with -fmessage-length set to 5. */
15832 pp_line_cutoff (global_dc
->printer
) = 5;
15834 /* Note that the newline is not translated into an escape. */
15835 msg
.escape ("foo\nbar");
15836 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15838 msg
.escape ("\a\b\f\n\r\t\v");
15839 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15841 /* Restore the original message length setting. */
15842 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15845 /* Run all of the selftests within this file. */
15850 test_integer_constants ();
15851 test_identifiers ();
15853 test_vector_cst_patterns ();
15854 test_location_wrappers ();
15855 test_predicates ();
15856 test_escaped_strings ();
15859 } // namespace selftest
15861 #endif /* CHECKING_P */
15863 #include "gt-tree.h"