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 0, /* OMP_CLAUSE_IF_PRESENT */
361 0, /* OMP_CLAUSE_FINALIZE */
364 const char * const omp_clause_code_name
[] =
449 /* Return the tree node structure used by tree code CODE. */
451 static inline enum tree_node_structure_enum
452 tree_node_structure_for_code (enum tree_code code
)
454 switch (TREE_CODE_CLASS (code
))
456 case tcc_declaration
:
459 case CONST_DECL
: return TS_CONST_DECL
;
460 case DEBUG_EXPR_DECL
: return TS_DECL_WRTL
;
461 case FIELD_DECL
: return TS_FIELD_DECL
;
462 case FUNCTION_DECL
: return TS_FUNCTION_DECL
;
463 case LABEL_DECL
: return TS_LABEL_DECL
;
464 case PARM_DECL
: return TS_PARM_DECL
;
465 case RESULT_DECL
: return TS_RESULT_DECL
;
466 case TRANSLATION_UNIT_DECL
: return TS_TRANSLATION_UNIT_DECL
;
467 case TYPE_DECL
: return TS_TYPE_DECL
;
468 case VAR_DECL
: return TS_VAR_DECL
;
469 default: return TS_DECL_NON_COMMON
;
472 case tcc_type
: return TS_TYPE_NON_COMMON
;
480 case tcc_vl_exp
: return TS_EXP
;
482 default: /* tcc_constant and tcc_exceptional */
488 /* tcc_constant cases. */
489 case COMPLEX_CST
: return TS_COMPLEX
;
490 case FIXED_CST
: return TS_FIXED_CST
;
491 case INTEGER_CST
: return TS_INT_CST
;
492 case POLY_INT_CST
: return TS_POLY_INT_CST
;
493 case REAL_CST
: return TS_REAL_CST
;
494 case STRING_CST
: return TS_STRING
;
495 case VECTOR_CST
: return TS_VECTOR
;
496 case VOID_CST
: return TS_TYPED
;
498 /* tcc_exceptional cases. */
499 case BLOCK
: return TS_BLOCK
;
500 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
501 case ERROR_MARK
: return TS_COMMON
;
502 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
503 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
504 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
505 case PLACEHOLDER_EXPR
: return TS_COMMON
;
506 case SSA_NAME
: return TS_SSA_NAME
;
507 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
508 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
509 case TREE_BINFO
: return TS_BINFO
;
510 case TREE_LIST
: return TS_LIST
;
511 case TREE_VEC
: return TS_VEC
;
519 /* Initialize tree_contains_struct to describe the hierarchy of tree
523 initialize_tree_contains_struct (void)
527 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
530 enum tree_node_structure_enum ts_code
;
532 code
= (enum tree_code
) i
;
533 ts_code
= tree_node_structure_for_code (code
);
535 /* Mark the TS structure itself. */
536 tree_contains_struct
[code
][ts_code
] = 1;
538 /* Mark all the structures that TS is derived from. */
543 case TS_OPTIMIZATION
:
544 case TS_TARGET_OPTION
:
550 case TS_POLY_INT_CST
:
559 case TS_STATEMENT_LIST
:
560 MARK_TS_TYPED (code
);
564 case TS_DECL_MINIMAL
:
570 MARK_TS_COMMON (code
);
573 case TS_TYPE_WITH_LANG_SPECIFIC
:
574 MARK_TS_TYPE_COMMON (code
);
577 case TS_TYPE_NON_COMMON
:
578 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
582 MARK_TS_DECL_MINIMAL (code
);
587 MARK_TS_DECL_COMMON (code
);
590 case TS_DECL_NON_COMMON
:
591 MARK_TS_DECL_WITH_VIS (code
);
594 case TS_DECL_WITH_VIS
:
598 MARK_TS_DECL_WRTL (code
);
602 MARK_TS_DECL_COMMON (code
);
606 MARK_TS_DECL_WITH_VIS (code
);
610 case TS_FUNCTION_DECL
:
611 MARK_TS_DECL_NON_COMMON (code
);
614 case TS_TRANSLATION_UNIT_DECL
:
615 MARK_TS_DECL_COMMON (code
);
623 /* Basic consistency checks for attributes used in fold. */
624 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
625 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
626 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
632 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
633 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
634 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
635 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
636 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
637 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
638 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
639 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
640 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
645 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
647 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
649 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
650 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
651 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
652 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
653 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
654 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
655 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
656 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
657 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
658 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
659 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
660 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
661 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
662 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
663 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
672 /* Initialize the hash table of types. */
674 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
677 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
680 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
682 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
684 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
686 int_cst_node
= make_int_cst (1, 1);
688 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
690 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
691 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
693 /* Initialize the tree_contains_struct array. */
694 initialize_tree_contains_struct ();
695 lang_hooks
.init_ts ();
699 /* The name of the object as the assembler will see it (but before any
700 translations made by ASM_OUTPUT_LABELREF). Often this is the same
701 as DECL_NAME. It is an IDENTIFIER_NODE. */
703 decl_assembler_name (tree decl
)
705 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
706 lang_hooks
.set_decl_assembler_name (decl
);
707 return DECL_ASSEMBLER_NAME_RAW (decl
);
710 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
711 (either of which may be NULL). Inform the FE, if this changes the
715 overwrite_decl_assembler_name (tree decl
, tree name
)
717 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
718 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
721 /* When the target supports COMDAT groups, this indicates which group the
722 DECL is associated with. This can be either an IDENTIFIER_NODE or a
723 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
725 decl_comdat_group (const_tree node
)
727 struct symtab_node
*snode
= symtab_node::get (node
);
730 return snode
->get_comdat_group ();
733 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
735 decl_comdat_group_id (const_tree node
)
737 struct symtab_node
*snode
= symtab_node::get (node
);
740 return snode
->get_comdat_group_id ();
743 /* When the target supports named section, return its name as IDENTIFIER_NODE
744 or NULL if it is in no section. */
746 decl_section_name (const_tree node
)
748 struct symtab_node
*snode
= symtab_node::get (node
);
751 return snode
->get_section ();
754 /* Set section name of NODE to VALUE (that is expected to be
757 set_decl_section_name (tree node
, const char *value
)
759 struct symtab_node
*snode
;
763 snode
= symtab_node::get (node
);
767 else if (VAR_P (node
))
768 snode
= varpool_node::get_create (node
);
770 snode
= cgraph_node::get_create (node
);
771 snode
->set_section (value
);
774 /* Return TLS model of a variable NODE. */
776 decl_tls_model (const_tree node
)
778 struct varpool_node
*snode
= varpool_node::get (node
);
780 return TLS_MODEL_NONE
;
781 return snode
->tls_model
;
784 /* Set TLS model of variable NODE to MODEL. */
786 set_decl_tls_model (tree node
, enum tls_model model
)
788 struct varpool_node
*vnode
;
790 if (model
== TLS_MODEL_NONE
)
792 vnode
= varpool_node::get (node
);
797 vnode
= varpool_node::get_create (node
);
798 vnode
->tls_model
= model
;
801 /* Compute the number of bytes occupied by a tree with code CODE.
802 This function cannot be used for nodes that have variable sizes,
803 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
805 tree_code_size (enum tree_code code
)
807 switch (TREE_CODE_CLASS (code
))
809 case tcc_declaration
: /* A decl node */
812 case FIELD_DECL
: return sizeof (tree_field_decl
);
813 case PARM_DECL
: return sizeof (tree_parm_decl
);
814 case VAR_DECL
: return sizeof (tree_var_decl
);
815 case LABEL_DECL
: return sizeof (tree_label_decl
);
816 case RESULT_DECL
: return sizeof (tree_result_decl
);
817 case CONST_DECL
: return sizeof (tree_const_decl
);
818 case TYPE_DECL
: return sizeof (tree_type_decl
);
819 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
820 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
821 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
824 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
826 gcc_checking_assert (code
>= NUM_TREE_CODES
);
827 return lang_hooks
.tree_size (code
);
830 case tcc_type
: /* a type node */
841 case FIXED_POINT_TYPE
:
847 case QUAL_UNION_TYPE
:
851 case LANG_TYPE
: return sizeof (tree_type_non_common
);
853 gcc_checking_assert (code
>= NUM_TREE_CODES
);
854 return lang_hooks
.tree_size (code
);
857 case tcc_reference
: /* a reference */
858 case tcc_expression
: /* an expression */
859 case tcc_statement
: /* an expression with side effects */
860 case tcc_comparison
: /* a comparison expression */
861 case tcc_unary
: /* a unary arithmetic expression */
862 case tcc_binary
: /* a binary arithmetic expression */
863 return (sizeof (struct tree_exp
)
864 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
866 case tcc_constant
: /* a constant */
869 case VOID_CST
: return sizeof (tree_typed
);
870 case INTEGER_CST
: gcc_unreachable ();
871 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
872 case REAL_CST
: return sizeof (tree_real_cst
);
873 case FIXED_CST
: return sizeof (tree_fixed_cst
);
874 case COMPLEX_CST
: return sizeof (tree_complex
);
875 case VECTOR_CST
: gcc_unreachable ();
876 case STRING_CST
: gcc_unreachable ();
878 gcc_checking_assert (code
>= NUM_TREE_CODES
);
879 return lang_hooks
.tree_size (code
);
882 case tcc_exceptional
: /* something random, like an identifier. */
885 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
886 case TREE_LIST
: return sizeof (tree_list
);
889 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
891 case TREE_VEC
: gcc_unreachable ();
892 case OMP_CLAUSE
: gcc_unreachable ();
894 case SSA_NAME
: return sizeof (tree_ssa_name
);
896 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
897 case BLOCK
: return sizeof (struct tree_block
);
898 case CONSTRUCTOR
: return sizeof (tree_constructor
);
899 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
900 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
903 gcc_checking_assert (code
>= NUM_TREE_CODES
);
904 return lang_hooks
.tree_size (code
);
912 /* Compute the number of bytes occupied by NODE. This routine only
913 looks at TREE_CODE, except for those nodes that have variable sizes. */
915 tree_size (const_tree node
)
917 const enum tree_code code
= TREE_CODE (node
);
921 return (sizeof (struct tree_int_cst
)
922 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
925 return (offsetof (struct tree_binfo
, base_binfos
)
927 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
930 return (sizeof (struct tree_vec
)
931 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
934 return (sizeof (struct tree_vector
)
935 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
938 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
941 return (sizeof (struct tree_omp_clause
)
942 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
946 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
947 return (sizeof (struct tree_exp
)
948 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
950 return tree_code_size (code
);
954 /* Return tree node kind based on tree CODE. */
956 static tree_node_kind
957 get_stats_node_kind (enum tree_code code
)
959 enum tree_code_class type
= TREE_CODE_CLASS (code
);
963 case tcc_declaration
: /* A decl node */
965 case tcc_type
: /* a type node */
967 case tcc_statement
: /* an expression with side effects */
969 case tcc_reference
: /* a reference */
971 case tcc_expression
: /* an expression */
972 case tcc_comparison
: /* a comparison expression */
973 case tcc_unary
: /* a unary arithmetic expression */
974 case tcc_binary
: /* a binary arithmetic expression */
976 case tcc_constant
: /* a constant */
978 case tcc_exceptional
: /* something random, like an identifier. */
981 case IDENTIFIER_NODE
:
988 return ssa_name_kind
;
994 return omp_clause_kind
;
1006 /* Record interesting allocation statistics for a tree node with CODE
1010 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1012 if (!GATHER_STATISTICS
)
1015 tree_node_kind kind
= get_stats_node_kind (code
);
1017 tree_code_counts
[(int) code
]++;
1018 tree_node_counts
[(int) kind
]++;
1019 tree_node_sizes
[(int) kind
] += length
;
1022 /* Allocate and return a new UID from the DECL_UID namespace. */
1025 allocate_decl_uid (void)
1027 return next_decl_uid
++;
1030 /* Return a newly allocated node of code CODE. For decl and type
1031 nodes, some other fields are initialized. The rest of the node is
1032 initialized to zero. This function cannot be used for TREE_VEC,
1033 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1036 Achoo! I got a code in the node. */
1039 make_node (enum tree_code code MEM_STAT_DECL
)
1042 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1043 size_t length
= tree_code_size (code
);
1045 record_node_allocation_statistics (code
, length
);
1047 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1048 TREE_SET_CODE (t
, code
);
1053 if (code
!= DEBUG_BEGIN_STMT
)
1054 TREE_SIDE_EFFECTS (t
) = 1;
1057 case tcc_declaration
:
1058 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1060 if (code
== FUNCTION_DECL
)
1062 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1063 SET_DECL_MODE (t
, FUNCTION_MODE
);
1066 SET_DECL_ALIGN (t
, 1);
1068 DECL_SOURCE_LOCATION (t
) = input_location
;
1069 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1070 DECL_UID (t
) = --next_debug_decl_uid
;
1073 DECL_UID (t
) = allocate_decl_uid ();
1074 SET_DECL_PT_UID (t
, -1);
1076 if (TREE_CODE (t
) == LABEL_DECL
)
1077 LABEL_DECL_UID (t
) = -1;
1082 TYPE_UID (t
) = next_type_uid
++;
1083 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1084 TYPE_USER_ALIGN (t
) = 0;
1085 TYPE_MAIN_VARIANT (t
) = t
;
1086 TYPE_CANONICAL (t
) = t
;
1088 /* Default to no attributes for type, but let target change that. */
1089 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1090 targetm
.set_default_type_attributes (t
);
1092 /* We have not yet computed the alias set for this type. */
1093 TYPE_ALIAS_SET (t
) = -1;
1097 TREE_CONSTANT (t
) = 1;
1100 case tcc_expression
:
1106 case PREDECREMENT_EXPR
:
1107 case PREINCREMENT_EXPR
:
1108 case POSTDECREMENT_EXPR
:
1109 case POSTINCREMENT_EXPR
:
1110 /* All of these have side-effects, no matter what their
1112 TREE_SIDE_EFFECTS (t
) = 1;
1120 case tcc_exceptional
:
1123 case TARGET_OPTION_NODE
:
1124 TREE_TARGET_OPTION(t
)
1125 = ggc_cleared_alloc
<struct cl_target_option
> ();
1128 case OPTIMIZATION_NODE
:
1129 TREE_OPTIMIZATION (t
)
1130 = ggc_cleared_alloc
<struct cl_optimization
> ();
1139 /* Other classes need no special treatment. */
1146 /* Free tree node. */
1149 free_node (tree node
)
1151 enum tree_code code
= TREE_CODE (node
);
1152 if (GATHER_STATISTICS
)
1154 enum tree_node_kind kind
= get_stats_node_kind (code
);
1156 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1157 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1158 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1160 tree_code_counts
[(int) TREE_CODE (node
)]--;
1161 tree_node_counts
[(int) kind
]--;
1162 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1164 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1165 vec_free (CONSTRUCTOR_ELTS (node
));
1166 else if (code
== BLOCK
)
1167 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1168 else if (code
== TREE_BINFO
)
1169 vec_free (BINFO_BASE_ACCESSES (node
));
1170 else if (code
== OPTIMIZATION_NODE
)
1171 cl_optimization_option_free (TREE_OPTIMIZATION (node
));
1172 else if (code
== TARGET_OPTION_NODE
)
1173 cl_target_option_free (TREE_TARGET_OPTION (node
));
1177 /* Return a new node with the same contents as NODE except that its
1178 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1181 copy_node (tree node MEM_STAT_DECL
)
1184 enum tree_code code
= TREE_CODE (node
);
1187 gcc_assert (code
!= STATEMENT_LIST
);
1189 length
= tree_size (node
);
1190 record_node_allocation_statistics (code
, length
);
1191 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1192 memcpy (t
, node
, length
);
1194 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1196 TREE_ASM_WRITTEN (t
) = 0;
1197 TREE_VISITED (t
) = 0;
1199 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1201 if (code
== DEBUG_EXPR_DECL
)
1202 DECL_UID (t
) = --next_debug_decl_uid
;
1205 DECL_UID (t
) = allocate_decl_uid ();
1206 if (DECL_PT_UID_SET_P (node
))
1207 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1209 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1210 && DECL_HAS_VALUE_EXPR_P (node
))
1212 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1213 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1215 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1218 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1219 t
->decl_with_vis
.symtab_node
= NULL
;
1221 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1223 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1224 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1226 if (TREE_CODE (node
) == FUNCTION_DECL
)
1228 DECL_STRUCT_FUNCTION (t
) = NULL
;
1229 t
->decl_with_vis
.symtab_node
= NULL
;
1232 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1234 TYPE_UID (t
) = next_type_uid
++;
1235 /* The following is so that the debug code for
1236 the copy is different from the original type.
1237 The two statements usually duplicate each other
1238 (because they clear fields of the same union),
1239 but the optimizer should catch that. */
1240 TYPE_SYMTAB_ADDRESS (t
) = 0;
1241 TYPE_SYMTAB_DIE (t
) = 0;
1243 /* Do not copy the values cache. */
1244 if (TYPE_CACHED_VALUES_P (t
))
1246 TYPE_CACHED_VALUES_P (t
) = 0;
1247 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1250 else if (code
== TARGET_OPTION_NODE
)
1252 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1253 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1254 sizeof (struct cl_target_option
));
1256 else if (code
== OPTIMIZATION_NODE
)
1258 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1259 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1260 sizeof (struct cl_optimization
));
1266 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1267 For example, this can copy a list made of TREE_LIST nodes. */
1270 copy_list (tree list
)
1278 head
= prev
= copy_node (list
);
1279 next
= TREE_CHAIN (list
);
1282 TREE_CHAIN (prev
) = copy_node (next
);
1283 prev
= TREE_CHAIN (prev
);
1284 next
= TREE_CHAIN (next
);
1290 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1291 INTEGER_CST with value CST and type TYPE. */
1294 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1296 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1297 /* We need extra HWIs if CST is an unsigned integer with its
1299 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1300 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1301 return cst
.get_len ();
1304 /* Return a new INTEGER_CST with value CST and type TYPE. */
1307 build_new_int_cst (tree type
, const wide_int
&cst
)
1309 unsigned int len
= cst
.get_len ();
1310 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1311 tree nt
= make_int_cst (len
, ext_len
);
1316 TREE_INT_CST_ELT (nt
, ext_len
)
1317 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1318 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1319 TREE_INT_CST_ELT (nt
, i
) = -1;
1321 else if (TYPE_UNSIGNED (type
)
1322 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1325 TREE_INT_CST_ELT (nt
, len
)
1326 = zext_hwi (cst
.elt (len
),
1327 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1330 for (unsigned int i
= 0; i
< len
; i
++)
1331 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1332 TREE_TYPE (nt
) = type
;
1336 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1339 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1342 size_t length
= sizeof (struct tree_poly_int_cst
);
1343 record_node_allocation_statistics (POLY_INT_CST
, length
);
1345 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1347 TREE_SET_CODE (t
, POLY_INT_CST
);
1348 TREE_CONSTANT (t
) = 1;
1349 TREE_TYPE (t
) = type
;
1350 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1351 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1355 /* Create a constant tree that contains CST sign-extended to TYPE. */
1358 build_int_cst (tree type
, poly_int64 cst
)
1360 /* Support legacy code. */
1362 type
= integer_type_node
;
1364 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1367 /* Create a constant tree that contains CST zero-extended to TYPE. */
1370 build_int_cstu (tree type
, poly_uint64 cst
)
1372 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1375 /* Create a constant tree that contains CST sign-extended to TYPE. */
1378 build_int_cst_type (tree type
, poly_int64 cst
)
1381 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1384 /* Constructs tree in type TYPE from with value given by CST. Signedness
1385 of CST is assumed to be the same as the signedness of TYPE. */
1388 double_int_to_tree (tree type
, double_int cst
)
1390 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1393 /* We force the wide_int CST to the range of the type TYPE by sign or
1394 zero extending it. OVERFLOWABLE indicates if we are interested in
1395 overflow of the value, when >0 we are only interested in signed
1396 overflow, for <0 we are interested in any overflow. OVERFLOWED
1397 indicates whether overflow has already occurred. CONST_OVERFLOWED
1398 indicates whether constant overflow has already occurred. We force
1399 T's value to be within range of T's type (by setting to 0 or 1 all
1400 the bits outside the type's range). We set TREE_OVERFLOWED if,
1401 OVERFLOWED is nonzero,
1402 or OVERFLOWABLE is >0 and signed overflow occurs
1403 or OVERFLOWABLE is <0 and any overflow occurs
1404 We return a new tree node for the extended wide_int. The node
1405 is shared if no overflow flags are set. */
1409 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1410 int overflowable
, bool overflowed
)
1412 signop sign
= TYPE_SIGN (type
);
1414 /* If we need to set overflow flags, return a new unshared node. */
1415 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1419 || (overflowable
> 0 && sign
== SIGNED
))
1421 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1424 if (tmp
.is_constant ())
1425 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1428 tree coeffs
[NUM_POLY_INT_COEFFS
];
1429 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1431 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1432 TREE_OVERFLOW (coeffs
[i
]) = 1;
1434 t
= build_new_poly_int_cst (type
, coeffs
);
1436 TREE_OVERFLOW (t
) = 1;
1441 /* Else build a shared node. */
1442 return wide_int_to_tree (type
, cst
);
1445 /* These are the hash table functions for the hash table of INTEGER_CST
1446 nodes of a sizetype. */
1448 /* Return the hash code X, an INTEGER_CST. */
1451 int_cst_hasher::hash (tree x
)
1453 const_tree
const t
= x
;
1454 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1457 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1458 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1463 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1464 is the same as that given by *Y, which is the same. */
1467 int_cst_hasher::equal (tree x
, tree y
)
1469 const_tree
const xt
= x
;
1470 const_tree
const yt
= y
;
1472 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1473 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1474 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1477 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1478 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1484 /* Cache wide_int CST into the TYPE_CACHED_VALUES cache for TYPE.
1485 SLOT is the slot entry to store it in, and MAX_SLOTS is the maximum
1486 number of slots that can be cached for the type. */
1489 cache_wide_int_in_type_cache (tree type
, const wide_int
&cst
,
1490 int slot
, int max_slots
)
1492 gcc_checking_assert (slot
>= 0);
1493 /* Initialize cache. */
1494 if (!TYPE_CACHED_VALUES_P (type
))
1496 TYPE_CACHED_VALUES_P (type
) = 1;
1497 TYPE_CACHED_VALUES (type
) = make_tree_vec (max_slots
);
1499 tree t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
);
1502 /* Create a new shared int. */
1503 t
= build_new_int_cst (type
, cst
);
1504 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), slot
) = t
;
1509 /* Create an INT_CST node of TYPE and value CST.
1510 The returned node is always shared. For small integers we use a
1511 per-type vector cache, for larger ones we use a single hash table.
1512 The value is extended from its precision according to the sign of
1513 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1514 the upper bits and ensures that hashing and value equality based
1515 upon the underlying HOST_WIDE_INTs works without masking. */
1518 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1525 unsigned int prec
= TYPE_PRECISION (type
);
1526 signop sgn
= TYPE_SIGN (type
);
1528 /* Verify that everything is canonical. */
1529 int l
= pcst
.get_len ();
1532 if (pcst
.elt (l
- 1) == 0)
1533 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1534 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1535 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1538 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1539 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1541 enum tree_code code
= TREE_CODE (type
);
1542 if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
1544 /* Cache NULL pointer and zero bounds. */
1547 /* Cache upper bounds of pointers. */
1548 else if (cst
== wi::max_value (prec
, sgn
))
1550 /* Cache 1 which is used for a non-zero range. */
1556 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, 3);
1557 /* Make sure no one is clobbering the shared constant. */
1558 gcc_checking_assert (TREE_TYPE (t
) == type
1559 && cst
== wi::to_wide (t
));
1565 /* We just need to store a single HOST_WIDE_INT. */
1567 if (TYPE_UNSIGNED (type
))
1568 hwi
= cst
.to_uhwi ();
1570 hwi
= cst
.to_shwi ();
1575 gcc_assert (hwi
== 0);
1579 case REFERENCE_TYPE
:
1580 /* Ignore pointers, as they were already handled above. */
1584 /* Cache false or true. */
1586 if (IN_RANGE (hwi
, 0, 1))
1592 if (TYPE_SIGN (type
) == UNSIGNED
)
1595 limit
= param_integer_share_limit
;
1596 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1601 /* Cache [-1, N). */
1602 limit
= param_integer_share_limit
+ 1;
1603 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1617 t
= cache_wide_int_in_type_cache (type
, cst
, ix
, limit
);
1618 /* Make sure no one is clobbering the shared constant. */
1619 gcc_checking_assert (TREE_TYPE (t
) == type
1620 && TREE_INT_CST_NUNITS (t
) == 1
1621 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1622 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1623 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1628 /* Use the cache of larger shared ints, using int_cst_node as
1631 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1632 TREE_TYPE (int_cst_node
) = type
;
1634 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1638 /* Insert this one into the hash table. */
1641 /* Make a new node for next time round. */
1642 int_cst_node
= make_int_cst (1, 1);
1648 /* The value either hashes properly or we drop it on the floor
1649 for the gc to take care of. There will not be enough of them
1652 tree nt
= build_new_int_cst (type
, cst
);
1653 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1657 /* Insert this one into the hash table. */
1669 poly_int_cst_hasher::hash (tree t
)
1671 inchash::hash hstate
;
1673 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1674 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1675 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1677 return hstate
.end ();
1681 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1683 if (TREE_TYPE (x
) != y
.first
)
1685 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1686 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1691 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1692 The elements must also have type TYPE. */
1695 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1697 unsigned int prec
= TYPE_PRECISION (type
);
1698 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1699 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1702 h
.add_int (TYPE_UID (type
));
1703 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1704 h
.add_wide_int (c
.coeffs
[i
]);
1705 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1706 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1708 if (*slot
== NULL_TREE
)
1710 tree coeffs
[NUM_POLY_INT_COEFFS
];
1711 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1712 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1713 *slot
= build_new_poly_int_cst (type
, coeffs
);
1718 /* Create a constant tree with value VALUE in type TYPE. */
1721 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1723 if (value
.is_constant ())
1724 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1725 return build_poly_int_cst (type
, value
);
1729 cache_integer_cst (tree t
)
1731 tree type
= TREE_TYPE (t
);
1734 int prec
= TYPE_PRECISION (type
);
1736 gcc_assert (!TREE_OVERFLOW (t
));
1738 switch (TREE_CODE (type
))
1741 gcc_assert (integer_zerop (t
));
1745 case REFERENCE_TYPE
:
1746 /* Cache NULL pointer. */
1747 if (integer_zerop (t
))
1755 /* Cache false or true. */
1757 if (wi::ltu_p (wi::to_wide (t
), 2))
1758 ix
= TREE_INT_CST_ELT (t
, 0);
1763 if (TYPE_UNSIGNED (type
))
1766 limit
= param_integer_share_limit
;
1768 /* This is a little hokie, but if the prec is smaller than
1769 what is necessary to hold param_integer_share_limit, then the
1770 obvious test will not get the correct answer. */
1771 if (prec
< HOST_BITS_PER_WIDE_INT
)
1773 if (tree_to_uhwi (t
)
1774 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1775 ix
= tree_to_uhwi (t
);
1777 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1778 ix
= tree_to_uhwi (t
);
1783 limit
= param_integer_share_limit
+ 1;
1785 if (integer_minus_onep (t
))
1787 else if (!wi::neg_p (wi::to_wide (t
)))
1789 if (prec
< HOST_BITS_PER_WIDE_INT
)
1791 if (tree_to_shwi (t
) < param_integer_share_limit
)
1792 ix
= tree_to_shwi (t
) + 1;
1794 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1795 ix
= tree_to_shwi (t
) + 1;
1801 /* The slot used by TYPE_CACHED_VALUES is used for the enum
1811 /* Look for it in the type's vector of small shared ints. */
1812 if (!TYPE_CACHED_VALUES_P (type
))
1814 TYPE_CACHED_VALUES_P (type
) = 1;
1815 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1818 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1819 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1823 /* Use the cache of larger shared ints. */
1824 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1825 /* If there is already an entry for the number verify it's the
1828 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1830 /* Otherwise insert this one into the hash table. */
1836 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1837 and the rest are zeros. */
1840 build_low_bits_mask (tree type
, unsigned bits
)
1842 gcc_assert (bits
<= TYPE_PRECISION (type
));
1844 return wide_int_to_tree (type
, wi::mask (bits
, false,
1845 TYPE_PRECISION (type
)));
1848 /* Checks that X is integer constant that can be expressed in (unsigned)
1849 HOST_WIDE_INT without loss of precision. */
1852 cst_and_fits_in_hwi (const_tree x
)
1854 return (TREE_CODE (x
) == INTEGER_CST
1855 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1858 /* Build a newly constructed VECTOR_CST with the given values of
1859 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1862 make_vector (unsigned log2_npatterns
,
1863 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1865 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1867 unsigned npatterns
= 1 << log2_npatterns
;
1868 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1869 unsigned length
= (sizeof (struct tree_vector
)
1870 + (encoded_nelts
- 1) * sizeof (tree
));
1872 record_node_allocation_statistics (VECTOR_CST
, length
);
1874 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1876 TREE_SET_CODE (t
, VECTOR_CST
);
1877 TREE_CONSTANT (t
) = 1;
1878 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1879 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1884 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1885 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1888 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1890 if (vec_safe_length (v
) == 0)
1891 return build_zero_cst (type
);
1893 unsigned HOST_WIDE_INT idx
, nelts
;
1896 /* We can't construct a VECTOR_CST for a variable number of elements. */
1897 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1898 tree_vector_builder
vec (type
, nelts
, 1);
1899 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1901 if (TREE_CODE (value
) == VECTOR_CST
)
1903 /* If NELTS is constant then this must be too. */
1904 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1905 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1906 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1909 vec
.quick_push (value
);
1911 while (vec
.length () < nelts
)
1912 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1914 return vec
.build ();
1917 /* Build a vector of type VECTYPE where all the elements are SCs. */
1919 build_vector_from_val (tree vectype
, tree sc
)
1921 unsigned HOST_WIDE_INT i
, nunits
;
1923 if (sc
== error_mark_node
)
1926 /* Verify that the vector type is suitable for SC. Note that there
1927 is some inconsistency in the type-system with respect to restrict
1928 qualifications of pointers. Vector types always have a main-variant
1929 element type and the qualification is applied to the vector-type.
1930 So TREE_TYPE (vector-type) does not return a properly qualified
1931 vector element-type. */
1932 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1933 TREE_TYPE (vectype
)));
1935 if (CONSTANT_CLASS_P (sc
))
1937 tree_vector_builder
v (vectype
, 1, 1);
1941 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1942 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1945 vec
<constructor_elt
, va_gc
> *v
;
1946 vec_alloc (v
, nunits
);
1947 for (i
= 0; i
< nunits
; ++i
)
1948 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1949 return build_constructor (vectype
, v
);
1953 /* If TYPE is not a vector type, just return SC, otherwise return
1954 build_vector_from_val (TYPE, SC). */
1957 build_uniform_cst (tree type
, tree sc
)
1959 if (!VECTOR_TYPE_P (type
))
1962 return build_vector_from_val (type
, sc
);
1965 /* Build a vector series of type TYPE in which element I has the value
1966 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1967 and a VEC_SERIES_EXPR otherwise. */
1970 build_vec_series (tree type
, tree base
, tree step
)
1972 if (integer_zerop (step
))
1973 return build_vector_from_val (type
, base
);
1974 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1976 tree_vector_builder
builder (type
, 1, 3);
1977 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1978 wi::to_wide (base
) + wi::to_wide (step
));
1979 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1980 wi::to_wide (elt1
) + wi::to_wide (step
));
1981 builder
.quick_push (base
);
1982 builder
.quick_push (elt1
);
1983 builder
.quick_push (elt2
);
1984 return builder
.build ();
1986 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1989 /* Return a vector with the same number of units and number of bits
1990 as VEC_TYPE, but in which the elements are a linear series of unsigned
1991 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1994 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1996 tree index_vec_type
= vec_type
;
1997 tree index_elt_type
= TREE_TYPE (vec_type
);
1998 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1999 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
2001 index_elt_type
= build_nonstandard_integer_type
2002 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
2003 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
2006 tree_vector_builder
v (index_vec_type
, 1, 3);
2007 for (unsigned int i
= 0; i
< 3; ++i
)
2008 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
2012 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
2013 elements are A and the rest are B. */
2016 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
2018 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
2019 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
2020 /* Optimize the constant case. */
2021 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
2023 tree_vector_builder
builder (vec_type
, count
, 2);
2024 for (unsigned int i
= 0; i
< count
* 2; ++i
)
2025 builder
.quick_push (i
< num_a
? a
: b
);
2026 return builder
.build ();
2029 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2030 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2033 recompute_constructor_flags (tree c
)
2037 bool constant_p
= true;
2038 bool side_effects_p
= false;
2039 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2041 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2043 /* Mostly ctors will have elts that don't have side-effects, so
2044 the usual case is to scan all the elements. Hence a single
2045 loop for both const and side effects, rather than one loop
2046 each (with early outs). */
2047 if (!TREE_CONSTANT (val
))
2049 if (TREE_SIDE_EFFECTS (val
))
2050 side_effects_p
= true;
2053 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2054 TREE_CONSTANT (c
) = constant_p
;
2057 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2061 verify_constructor_flags (tree c
)
2065 bool constant_p
= TREE_CONSTANT (c
);
2066 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2067 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2069 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2071 if (constant_p
&& !TREE_CONSTANT (val
))
2072 internal_error ("non-constant element in constant CONSTRUCTOR");
2073 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2074 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2078 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2079 are in the vec pointed to by VALS. */
2081 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2083 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2085 TREE_TYPE (c
) = type
;
2086 CONSTRUCTOR_ELTS (c
) = vals
;
2088 recompute_constructor_flags (c
);
2093 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2096 build_constructor_single (tree type
, tree index
, tree value
)
2098 vec
<constructor_elt
, va_gc
> *v
;
2099 constructor_elt elt
= {index
, value
};
2102 v
->quick_push (elt
);
2104 return build_constructor (type
, v
);
2108 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2109 are in a list pointed to by VALS. */
2111 build_constructor_from_list (tree type
, tree vals
)
2114 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2118 vec_alloc (v
, list_length (vals
));
2119 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2120 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2123 return build_constructor (type
, v
);
2126 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2127 of elements, provided as index/value pairs. */
2130 build_constructor_va (tree type
, int nelts
, ...)
2132 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2135 va_start (p
, nelts
);
2136 vec_alloc (v
, nelts
);
2139 tree index
= va_arg (p
, tree
);
2140 tree value
= va_arg (p
, tree
);
2141 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2144 return build_constructor (type
, v
);
2147 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2150 build_clobber (tree type
)
2152 tree clobber
= build_constructor (type
, NULL
);
2153 TREE_THIS_VOLATILE (clobber
) = true;
2157 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2160 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2163 FIXED_VALUE_TYPE
*fp
;
2165 v
= make_node (FIXED_CST
);
2166 fp
= ggc_alloc
<fixed_value
> ();
2167 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2169 TREE_TYPE (v
) = type
;
2170 TREE_FIXED_CST_PTR (v
) = fp
;
2174 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2177 build_real (tree type
, REAL_VALUE_TYPE d
)
2180 REAL_VALUE_TYPE
*dp
;
2183 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2184 Consider doing it via real_convert now. */
2186 v
= make_node (REAL_CST
);
2187 dp
= ggc_alloc
<real_value
> ();
2188 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2190 TREE_TYPE (v
) = type
;
2191 TREE_REAL_CST_PTR (v
) = dp
;
2192 TREE_OVERFLOW (v
) = overflow
;
2196 /* Like build_real, but first truncate D to the type. */
2199 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2201 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2204 /* Return a new REAL_CST node whose type is TYPE
2205 and whose value is the integer value of the INTEGER_CST node I. */
2208 real_value_from_int_cst (const_tree type
, const_tree i
)
2212 /* Clear all bits of the real value type so that we can later do
2213 bitwise comparisons to see if two values are the same. */
2214 memset (&d
, 0, sizeof d
);
2216 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2217 TYPE_SIGN (TREE_TYPE (i
)));
2221 /* Given a tree representing an integer constant I, return a tree
2222 representing the same value as a floating-point constant of type TYPE. */
2225 build_real_from_int_cst (tree type
, const_tree i
)
2228 int overflow
= TREE_OVERFLOW (i
);
2230 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2232 TREE_OVERFLOW (v
) |= overflow
;
2236 /* Return a newly constructed STRING_CST node whose value is the LEN
2237 characters at STR when STR is nonnull, or all zeros otherwise.
2238 Note that for a C string literal, LEN should include the trailing NUL.
2239 The TREE_TYPE is not initialized. */
2242 build_string (unsigned len
, const char *str
/*= NULL */)
2244 /* Do not waste bytes provided by padding of struct tree_string. */
2245 unsigned size
= len
+ offsetof (struct tree_string
, str
) + 1;
2247 record_node_allocation_statistics (STRING_CST
, size
);
2249 tree s
= (tree
) ggc_internal_alloc (size
);
2251 memset (s
, 0, sizeof (struct tree_typed
));
2252 TREE_SET_CODE (s
, STRING_CST
);
2253 TREE_CONSTANT (s
) = 1;
2254 TREE_STRING_LENGTH (s
) = len
;
2256 memcpy (s
->string
.str
, str
, len
);
2258 memset (s
->string
.str
, 0, len
);
2259 s
->string
.str
[len
] = '\0';
2264 /* Return a newly constructed COMPLEX_CST node whose value is
2265 specified by the real and imaginary parts REAL and IMAG.
2266 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2267 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2270 build_complex (tree type
, tree real
, tree imag
)
2272 gcc_assert (CONSTANT_CLASS_P (real
));
2273 gcc_assert (CONSTANT_CLASS_P (imag
));
2275 tree t
= make_node (COMPLEX_CST
);
2277 TREE_REALPART (t
) = real
;
2278 TREE_IMAGPART (t
) = imag
;
2279 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2280 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2284 /* Build a complex (inf +- 0i), such as for the result of cproj.
2285 TYPE is the complex tree type of the result. If NEG is true, the
2286 imaginary zero is negative. */
2289 build_complex_inf (tree type
, bool neg
)
2291 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2295 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2296 build_real (TREE_TYPE (type
), rzero
));
2299 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2300 element is set to 1. In particular, this is 1 + i for complex types. */
2303 build_each_one_cst (tree type
)
2305 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2307 tree scalar
= build_one_cst (TREE_TYPE (type
));
2308 return build_complex (type
, scalar
, scalar
);
2311 return build_one_cst (type
);
2314 /* Return a constant of arithmetic type TYPE which is the
2315 multiplicative identity of the set TYPE. */
2318 build_one_cst (tree type
)
2320 switch (TREE_CODE (type
))
2322 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2323 case POINTER_TYPE
: case REFERENCE_TYPE
:
2325 return build_int_cst (type
, 1);
2328 return build_real (type
, dconst1
);
2330 case FIXED_POINT_TYPE
:
2331 /* We can only generate 1 for accum types. */
2332 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2333 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2337 tree scalar
= build_one_cst (TREE_TYPE (type
));
2339 return build_vector_from_val (type
, scalar
);
2343 return build_complex (type
,
2344 build_one_cst (TREE_TYPE (type
)),
2345 build_zero_cst (TREE_TYPE (type
)));
2352 /* Return an integer of type TYPE containing all 1's in as much precision as
2353 it contains, or a complex or vector whose subparts are such integers. */
2356 build_all_ones_cst (tree type
)
2358 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2360 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2361 return build_complex (type
, scalar
, scalar
);
2364 return build_minus_one_cst (type
);
2367 /* Return a constant of arithmetic type TYPE which is the
2368 opposite of the multiplicative identity of the set TYPE. */
2371 build_minus_one_cst (tree type
)
2373 switch (TREE_CODE (type
))
2375 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2376 case POINTER_TYPE
: case REFERENCE_TYPE
:
2378 return build_int_cst (type
, -1);
2381 return build_real (type
, dconstm1
);
2383 case FIXED_POINT_TYPE
:
2384 /* We can only generate 1 for accum types. */
2385 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2386 return build_fixed (type
,
2387 fixed_from_double_int (double_int_minus_one
,
2388 SCALAR_TYPE_MODE (type
)));
2392 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2394 return build_vector_from_val (type
, scalar
);
2398 return build_complex (type
,
2399 build_minus_one_cst (TREE_TYPE (type
)),
2400 build_zero_cst (TREE_TYPE (type
)));
2407 /* Build 0 constant of type TYPE. This is used by constructor folding
2408 and thus the constant should be represented in memory by
2412 build_zero_cst (tree type
)
2414 switch (TREE_CODE (type
))
2416 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2417 case POINTER_TYPE
: case REFERENCE_TYPE
:
2418 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2419 return build_int_cst (type
, 0);
2422 return build_real (type
, dconst0
);
2424 case FIXED_POINT_TYPE
:
2425 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2429 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2431 return build_vector_from_val (type
, scalar
);
2436 tree zero
= build_zero_cst (TREE_TYPE (type
));
2438 return build_complex (type
, zero
, zero
);
2442 if (!AGGREGATE_TYPE_P (type
))
2443 return fold_convert (type
, integer_zero_node
);
2444 return build_constructor (type
, NULL
);
2449 /* Build a BINFO with LEN language slots. */
2452 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2455 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2456 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2458 record_node_allocation_statistics (TREE_BINFO
, length
);
2460 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2462 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2464 TREE_SET_CODE (t
, TREE_BINFO
);
2466 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2471 /* Create a CASE_LABEL_EXPR tree node and return it. */
2474 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2476 tree t
= make_node (CASE_LABEL_EXPR
);
2478 TREE_TYPE (t
) = void_type_node
;
2479 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2481 CASE_LOW (t
) = low_value
;
2482 CASE_HIGH (t
) = high_value
;
2483 CASE_LABEL (t
) = label_decl
;
2484 CASE_CHAIN (t
) = NULL_TREE
;
2489 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2490 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2491 The latter determines the length of the HOST_WIDE_INT vector. */
2494 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2497 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2498 + sizeof (struct tree_int_cst
));
2501 record_node_allocation_statistics (INTEGER_CST
, length
);
2503 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2505 TREE_SET_CODE (t
, INTEGER_CST
);
2506 TREE_INT_CST_NUNITS (t
) = len
;
2507 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2508 /* to_offset can only be applied to trees that are offset_int-sized
2509 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2510 must be exactly the precision of offset_int and so LEN is correct. */
2511 if (ext_len
<= OFFSET_INT_ELTS
)
2512 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2514 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2516 TREE_CONSTANT (t
) = 1;
2521 /* Build a newly constructed TREE_VEC node of length LEN. */
2524 make_tree_vec (int len MEM_STAT_DECL
)
2527 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2529 record_node_allocation_statistics (TREE_VEC
, length
);
2531 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2533 TREE_SET_CODE (t
, TREE_VEC
);
2534 TREE_VEC_LENGTH (t
) = len
;
2539 /* Grow a TREE_VEC node to new length LEN. */
2542 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2544 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2546 int oldlen
= TREE_VEC_LENGTH (v
);
2547 gcc_assert (len
> oldlen
);
2549 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2550 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2552 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2554 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2556 TREE_VEC_LENGTH (v
) = len
;
2561 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2562 fixed, and scalar, complex or vector. */
2565 zerop (const_tree expr
)
2567 return (integer_zerop (expr
)
2568 || real_zerop (expr
)
2569 || fixed_zerop (expr
));
2572 /* Return 1 if EXPR is the integer constant zero or a complex constant
2573 of zero, or a location wrapper for such a constant. */
2576 integer_zerop (const_tree expr
)
2578 STRIP_ANY_LOCATION_WRAPPER (expr
);
2580 switch (TREE_CODE (expr
))
2583 return wi::to_wide (expr
) == 0;
2585 return (integer_zerop (TREE_REALPART (expr
))
2586 && integer_zerop (TREE_IMAGPART (expr
)));
2588 return (VECTOR_CST_NPATTERNS (expr
) == 1
2589 && VECTOR_CST_DUPLICATE_P (expr
)
2590 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2596 /* Return 1 if EXPR is the integer constant one or the corresponding
2597 complex constant, or a location wrapper for such a constant. */
2600 integer_onep (const_tree expr
)
2602 STRIP_ANY_LOCATION_WRAPPER (expr
);
2604 switch (TREE_CODE (expr
))
2607 return wi::eq_p (wi::to_widest (expr
), 1);
2609 return (integer_onep (TREE_REALPART (expr
))
2610 && integer_zerop (TREE_IMAGPART (expr
)));
2612 return (VECTOR_CST_NPATTERNS (expr
) == 1
2613 && VECTOR_CST_DUPLICATE_P (expr
)
2614 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2620 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2621 return 1 if every piece is the integer constant one.
2622 Also return 1 for location wrappers for such a constant. */
2625 integer_each_onep (const_tree expr
)
2627 STRIP_ANY_LOCATION_WRAPPER (expr
);
2629 if (TREE_CODE (expr
) == COMPLEX_CST
)
2630 return (integer_onep (TREE_REALPART (expr
))
2631 && integer_onep (TREE_IMAGPART (expr
)));
2633 return integer_onep (expr
);
2636 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2637 it contains, or a complex or vector whose subparts are such integers,
2638 or a location wrapper for such a constant. */
2641 integer_all_onesp (const_tree expr
)
2643 STRIP_ANY_LOCATION_WRAPPER (expr
);
2645 if (TREE_CODE (expr
) == COMPLEX_CST
2646 && integer_all_onesp (TREE_REALPART (expr
))
2647 && integer_all_onesp (TREE_IMAGPART (expr
)))
2650 else if (TREE_CODE (expr
) == VECTOR_CST
)
2651 return (VECTOR_CST_NPATTERNS (expr
) == 1
2652 && VECTOR_CST_DUPLICATE_P (expr
)
2653 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2655 else if (TREE_CODE (expr
) != INTEGER_CST
)
2658 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2659 == wi::to_wide (expr
));
2662 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2663 for such a constant. */
2666 integer_minus_onep (const_tree expr
)
2668 STRIP_ANY_LOCATION_WRAPPER (expr
);
2670 if (TREE_CODE (expr
) == COMPLEX_CST
)
2671 return (integer_all_onesp (TREE_REALPART (expr
))
2672 && integer_zerop (TREE_IMAGPART (expr
)));
2674 return integer_all_onesp (expr
);
2677 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2678 one bit on), or a location wrapper for such a constant. */
2681 integer_pow2p (const_tree expr
)
2683 STRIP_ANY_LOCATION_WRAPPER (expr
);
2685 if (TREE_CODE (expr
) == COMPLEX_CST
2686 && integer_pow2p (TREE_REALPART (expr
))
2687 && integer_zerop (TREE_IMAGPART (expr
)))
2690 if (TREE_CODE (expr
) != INTEGER_CST
)
2693 return wi::popcount (wi::to_wide (expr
)) == 1;
2696 /* Return 1 if EXPR is an integer constant other than zero or a
2697 complex constant other than zero, or a location wrapper for such a
2701 integer_nonzerop (const_tree expr
)
2703 STRIP_ANY_LOCATION_WRAPPER (expr
);
2705 return ((TREE_CODE (expr
) == INTEGER_CST
2706 && wi::to_wide (expr
) != 0)
2707 || (TREE_CODE (expr
) == COMPLEX_CST
2708 && (integer_nonzerop (TREE_REALPART (expr
))
2709 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2712 /* Return 1 if EXPR is the integer constant one. For vector,
2713 return 1 if every piece is the integer constant minus one
2714 (representing the value TRUE).
2715 Also return 1 for location wrappers for such a constant. */
2718 integer_truep (const_tree expr
)
2720 STRIP_ANY_LOCATION_WRAPPER (expr
);
2722 if (TREE_CODE (expr
) == VECTOR_CST
)
2723 return integer_all_onesp (expr
);
2724 return integer_onep (expr
);
2727 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2728 for such a constant. */
2731 fixed_zerop (const_tree expr
)
2733 STRIP_ANY_LOCATION_WRAPPER (expr
);
2735 return (TREE_CODE (expr
) == FIXED_CST
2736 && TREE_FIXED_CST (expr
).data
.is_zero ());
2739 /* Return the power of two represented by a tree node known to be a
2743 tree_log2 (const_tree expr
)
2745 if (TREE_CODE (expr
) == COMPLEX_CST
)
2746 return tree_log2 (TREE_REALPART (expr
));
2748 return wi::exact_log2 (wi::to_wide (expr
));
2751 /* Similar, but return the largest integer Y such that 2 ** Y is less
2752 than or equal to EXPR. */
2755 tree_floor_log2 (const_tree expr
)
2757 if (TREE_CODE (expr
) == COMPLEX_CST
)
2758 return tree_log2 (TREE_REALPART (expr
));
2760 return wi::floor_log2 (wi::to_wide (expr
));
2763 /* Return number of known trailing zero bits in EXPR, or, if the value of
2764 EXPR is known to be zero, the precision of it's type. */
2767 tree_ctz (const_tree expr
)
2769 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2770 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2773 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2774 switch (TREE_CODE (expr
))
2777 ret1
= wi::ctz (wi::to_wide (expr
));
2778 return MIN (ret1
, prec
);
2780 ret1
= wi::ctz (get_nonzero_bits (expr
));
2781 return MIN (ret1
, prec
);
2788 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2791 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2792 return MIN (ret1
, ret2
);
2793 case POINTER_PLUS_EXPR
:
2794 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2795 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2796 /* Second operand is sizetype, which could be in theory
2797 wider than pointer's precision. Make sure we never
2798 return more than prec. */
2799 ret2
= MIN (ret2
, prec
);
2800 return MIN (ret1
, ret2
);
2802 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2803 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2804 return MAX (ret1
, ret2
);
2806 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2807 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2808 return MIN (ret1
+ ret2
, prec
);
2810 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2811 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2812 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2814 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2815 return MIN (ret1
+ ret2
, prec
);
2819 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2820 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2822 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2823 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2828 case TRUNC_DIV_EXPR
:
2830 case FLOOR_DIV_EXPR
:
2831 case ROUND_DIV_EXPR
:
2832 case EXACT_DIV_EXPR
:
2833 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2834 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2836 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2839 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2847 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2848 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2850 return MIN (ret1
, prec
);
2852 return tree_ctz (TREE_OPERAND (expr
, 0));
2854 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2857 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2858 return MIN (ret1
, ret2
);
2860 return tree_ctz (TREE_OPERAND (expr
, 1));
2862 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2863 if (ret1
> BITS_PER_UNIT
)
2865 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2866 return MIN (ret1
, prec
);
2874 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2875 decimal float constants, so don't return 1 for them.
2876 Also return 1 for location wrappers around such a constant. */
2879 real_zerop (const_tree expr
)
2881 STRIP_ANY_LOCATION_WRAPPER (expr
);
2883 switch (TREE_CODE (expr
))
2886 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2887 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2889 return real_zerop (TREE_REALPART (expr
))
2890 && real_zerop (TREE_IMAGPART (expr
));
2893 /* Don't simply check for a duplicate because the predicate
2894 accepts both +0.0 and -0.0. */
2895 unsigned count
= vector_cst_encoded_nelts (expr
);
2896 for (unsigned int i
= 0; i
< count
; ++i
)
2897 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2906 /* Return 1 if EXPR is the real constant one in real or complex form.
2907 Trailing zeroes matter for decimal float constants, so don't return
2909 Also return 1 for location wrappers around such a constant. */
2912 real_onep (const_tree expr
)
2914 STRIP_ANY_LOCATION_WRAPPER (expr
);
2916 switch (TREE_CODE (expr
))
2919 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2920 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2922 return real_onep (TREE_REALPART (expr
))
2923 && real_zerop (TREE_IMAGPART (expr
));
2925 return (VECTOR_CST_NPATTERNS (expr
) == 1
2926 && VECTOR_CST_DUPLICATE_P (expr
)
2927 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2933 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2934 matter for decimal float constants, so don't return 1 for them.
2935 Also return 1 for location wrappers around such a constant. */
2938 real_minus_onep (const_tree expr
)
2940 STRIP_ANY_LOCATION_WRAPPER (expr
);
2942 switch (TREE_CODE (expr
))
2945 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2946 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2948 return real_minus_onep (TREE_REALPART (expr
))
2949 && real_zerop (TREE_IMAGPART (expr
));
2951 return (VECTOR_CST_NPATTERNS (expr
) == 1
2952 && VECTOR_CST_DUPLICATE_P (expr
)
2953 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2959 /* Nonzero if EXP is a constant or a cast of a constant. */
2962 really_constant_p (const_tree exp
)
2964 /* This is not quite the same as STRIP_NOPS. It does more. */
2965 while (CONVERT_EXPR_P (exp
)
2966 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2967 exp
= TREE_OPERAND (exp
, 0);
2968 return TREE_CONSTANT (exp
);
2971 /* Return true if T holds a polynomial pointer difference, storing it in
2972 *VALUE if so. A true return means that T's precision is no greater
2973 than 64 bits, which is the largest address space we support, so *VALUE
2974 never loses precision. However, the signedness of the result does
2975 not necessarily match the signedness of T: sometimes an unsigned type
2976 like sizetype is used to encode a value that is actually negative. */
2979 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2983 if (TREE_CODE (t
) == INTEGER_CST
)
2985 if (!cst_and_fits_in_hwi (t
))
2987 *value
= int_cst_value (t
);
2990 if (POLY_INT_CST_P (t
))
2992 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2993 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2995 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2996 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
3003 tree_to_poly_int64 (const_tree t
)
3005 gcc_assert (tree_fits_poly_int64_p (t
));
3006 if (POLY_INT_CST_P (t
))
3007 return poly_int_cst_value (t
).force_shwi ();
3008 return TREE_INT_CST_LOW (t
);
3012 tree_to_poly_uint64 (const_tree t
)
3014 gcc_assert (tree_fits_poly_uint64_p (t
));
3015 if (POLY_INT_CST_P (t
))
3016 return poly_int_cst_value (t
).force_uhwi ();
3017 return TREE_INT_CST_LOW (t
);
3020 /* Return first list element whose TREE_VALUE is ELEM.
3021 Return 0 if ELEM is not in LIST. */
3024 value_member (tree elem
, tree list
)
3028 if (elem
== TREE_VALUE (list
))
3030 list
= TREE_CHAIN (list
);
3035 /* Return first list element whose TREE_PURPOSE is ELEM.
3036 Return 0 if ELEM is not in LIST. */
3039 purpose_member (const_tree elem
, tree list
)
3043 if (elem
== TREE_PURPOSE (list
))
3045 list
= TREE_CHAIN (list
);
3050 /* Return true if ELEM is in V. */
3053 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3057 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3063 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3067 chain_index (int idx
, tree chain
)
3069 for (; chain
&& idx
> 0; --idx
)
3070 chain
= TREE_CHAIN (chain
);
3074 /* Return nonzero if ELEM is part of the chain CHAIN. */
3077 chain_member (const_tree elem
, const_tree chain
)
3083 chain
= DECL_CHAIN (chain
);
3089 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3090 We expect a null pointer to mark the end of the chain.
3091 This is the Lisp primitive `length'. */
3094 list_length (const_tree t
)
3097 #ifdef ENABLE_TREE_CHECKING
3105 #ifdef ENABLE_TREE_CHECKING
3108 gcc_assert (p
!= q
);
3116 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3117 UNION_TYPE TYPE, or NULL_TREE if none. */
3120 first_field (const_tree type
)
3122 tree t
= TYPE_FIELDS (type
);
3123 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3128 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3129 UNION_TYPE TYPE, or NULL_TREE if none. */
3132 last_field (const_tree type
)
3134 tree last
= NULL_TREE
;
3136 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3138 if (TREE_CODE (fld
) != FIELD_DECL
)
3147 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3148 by modifying the last node in chain 1 to point to chain 2.
3149 This is the Lisp primitive `nconc'. */
3152 chainon (tree op1
, tree op2
)
3161 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3163 TREE_CHAIN (t1
) = op2
;
3165 #ifdef ENABLE_TREE_CHECKING
3168 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3169 gcc_assert (t2
!= t1
);
3176 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3179 tree_last (tree chain
)
3183 while ((next
= TREE_CHAIN (chain
)))
3188 /* Reverse the order of elements in the chain T,
3189 and return the new head of the chain (old last element). */
3194 tree prev
= 0, decl
, next
;
3195 for (decl
= t
; decl
; decl
= next
)
3197 /* We shouldn't be using this function to reverse BLOCK chains; we
3198 have blocks_nreverse for that. */
3199 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3200 next
= TREE_CHAIN (decl
);
3201 TREE_CHAIN (decl
) = prev
;
3207 /* Return a newly created TREE_LIST node whose
3208 purpose and value fields are PARM and VALUE. */
3211 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3213 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3214 TREE_PURPOSE (t
) = parm
;
3215 TREE_VALUE (t
) = value
;
3219 /* Build a chain of TREE_LIST nodes from a vector. */
3222 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3224 tree ret
= NULL_TREE
;
3228 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3230 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3231 pp
= &TREE_CHAIN (*pp
);
3236 /* Return a newly created TREE_LIST node whose
3237 purpose and value fields are PURPOSE and VALUE
3238 and whose TREE_CHAIN is CHAIN. */
3241 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3245 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3246 memset (node
, 0, sizeof (struct tree_common
));
3248 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3250 TREE_SET_CODE (node
, TREE_LIST
);
3251 TREE_CHAIN (node
) = chain
;
3252 TREE_PURPOSE (node
) = purpose
;
3253 TREE_VALUE (node
) = value
;
3257 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3261 ctor_to_vec (tree ctor
)
3263 vec
<tree
, va_gc
> *vec
;
3264 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3268 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3269 vec
->quick_push (val
);
3274 /* Return the size nominally occupied by an object of type TYPE
3275 when it resides in memory. The value is measured in units of bytes,
3276 and its data type is that normally used for type sizes
3277 (which is the first type created by make_signed_type or
3278 make_unsigned_type). */
3281 size_in_bytes_loc (location_t loc
, const_tree type
)
3285 if (type
== error_mark_node
)
3286 return integer_zero_node
;
3288 type
= TYPE_MAIN_VARIANT (type
);
3289 t
= TYPE_SIZE_UNIT (type
);
3293 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3294 return size_zero_node
;
3300 /* Return the size of TYPE (in bytes) as a wide integer
3301 or return -1 if the size can vary or is larger than an integer. */
3304 int_size_in_bytes (const_tree type
)
3308 if (type
== error_mark_node
)
3311 type
= TYPE_MAIN_VARIANT (type
);
3312 t
= TYPE_SIZE_UNIT (type
);
3314 if (t
&& tree_fits_uhwi_p (t
))
3315 return TREE_INT_CST_LOW (t
);
3320 /* Return the maximum size of TYPE (in bytes) as a wide integer
3321 or return -1 if the size can vary or is larger than an integer. */
3324 max_int_size_in_bytes (const_tree type
)
3326 HOST_WIDE_INT size
= -1;
3329 /* If this is an array type, check for a possible MAX_SIZE attached. */
3331 if (TREE_CODE (type
) == ARRAY_TYPE
)
3333 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3335 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3336 size
= tree_to_uhwi (size_tree
);
3339 /* If we still haven't been able to get a size, see if the language
3340 can compute a maximum size. */
3344 size_tree
= lang_hooks
.types
.max_size (type
);
3346 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3347 size
= tree_to_uhwi (size_tree
);
3353 /* Return the bit position of FIELD, in bits from the start of the record.
3354 This is a tree of type bitsizetype. */
3357 bit_position (const_tree field
)
3359 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3360 DECL_FIELD_BIT_OFFSET (field
));
3363 /* Return the byte position of FIELD, in bytes from the start of the record.
3364 This is a tree of type sizetype. */
3367 byte_position (const_tree field
)
3369 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3370 DECL_FIELD_BIT_OFFSET (field
));
3373 /* Likewise, but return as an integer. It must be representable in
3374 that way (since it could be a signed value, we don't have the
3375 option of returning -1 like int_size_in_byte can. */
3378 int_byte_position (const_tree field
)
3380 return tree_to_shwi (byte_position (field
));
3383 /* Return, as a tree node, the number of elements for TYPE (which is an
3384 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3387 array_type_nelts (const_tree type
)
3389 tree index_type
, min
, max
;
3391 /* If they did it with unspecified bounds, then we should have already
3392 given an error about it before we got here. */
3393 if (! TYPE_DOMAIN (type
))
3394 return error_mark_node
;
3396 index_type
= TYPE_DOMAIN (type
);
3397 min
= TYPE_MIN_VALUE (index_type
);
3398 max
= TYPE_MAX_VALUE (index_type
);
3400 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3402 return error_mark_node
;
3404 return (integer_zerop (min
)
3406 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3409 /* If arg is static -- a reference to an object in static storage -- then
3410 return the object. This is not the same as the C meaning of `static'.
3411 If arg isn't static, return NULL. */
3416 switch (TREE_CODE (arg
))
3419 /* Nested functions are static, even though taking their address will
3420 involve a trampoline as we unnest the nested function and create
3421 the trampoline on the tree level. */
3425 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3426 && ! DECL_THREAD_LOCAL_P (arg
)
3427 && ! DECL_DLLIMPORT_P (arg
)
3431 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3435 return TREE_STATIC (arg
) ? arg
: NULL
;
3442 /* If the thing being referenced is not a field, then it is
3443 something language specific. */
3444 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3446 /* If we are referencing a bitfield, we can't evaluate an
3447 ADDR_EXPR at compile time and so it isn't a constant. */
3448 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3451 return staticp (TREE_OPERAND (arg
, 0));
3457 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3460 case ARRAY_RANGE_REF
:
3461 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3462 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3463 return staticp (TREE_OPERAND (arg
, 0));
3467 case COMPOUND_LITERAL_EXPR
:
3468 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3478 /* Return whether OP is a DECL whose address is function-invariant. */
3481 decl_address_invariant_p (const_tree op
)
3483 /* The conditions below are slightly less strict than the one in
3486 switch (TREE_CODE (op
))
3495 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3496 || DECL_THREAD_LOCAL_P (op
)
3497 || DECL_CONTEXT (op
) == current_function_decl
3498 || decl_function_context (op
) == current_function_decl
)
3503 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3504 || decl_function_context (op
) == current_function_decl
)
3515 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3518 decl_address_ip_invariant_p (const_tree op
)
3520 /* The conditions below are slightly less strict than the one in
3523 switch (TREE_CODE (op
))
3531 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3532 && !DECL_DLLIMPORT_P (op
))
3533 || DECL_THREAD_LOCAL_P (op
))
3538 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3550 /* Return true if T is function-invariant (internal function, does
3551 not handle arithmetic; that's handled in skip_simple_arithmetic and
3552 tree_invariant_p). */
3555 tree_invariant_p_1 (tree t
)
3559 if (TREE_CONSTANT (t
)
3560 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3563 switch (TREE_CODE (t
))
3569 op
= TREE_OPERAND (t
, 0);
3570 while (handled_component_p (op
))
3572 switch (TREE_CODE (op
))
3575 case ARRAY_RANGE_REF
:
3576 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3577 || TREE_OPERAND (op
, 2) != NULL_TREE
3578 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3583 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3589 op
= TREE_OPERAND (op
, 0);
3592 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3601 /* Return true if T is function-invariant. */
3604 tree_invariant_p (tree t
)
3606 tree inner
= skip_simple_arithmetic (t
);
3607 return tree_invariant_p_1 (inner
);
3610 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3611 Do this to any expression which may be used in more than one place,
3612 but must be evaluated only once.
3614 Normally, expand_expr would reevaluate the expression each time.
3615 Calling save_expr produces something that is evaluated and recorded
3616 the first time expand_expr is called on it. Subsequent calls to
3617 expand_expr just reuse the recorded value.
3619 The call to expand_expr that generates code that actually computes
3620 the value is the first call *at compile time*. Subsequent calls
3621 *at compile time* generate code to use the saved value.
3622 This produces correct result provided that *at run time* control
3623 always flows through the insns made by the first expand_expr
3624 before reaching the other places where the save_expr was evaluated.
3625 You, the caller of save_expr, must make sure this is so.
3627 Constants, and certain read-only nodes, are returned with no
3628 SAVE_EXPR because that is safe. Expressions containing placeholders
3629 are not touched; see tree.def for an explanation of what these
3633 save_expr (tree expr
)
3637 /* If the tree evaluates to a constant, then we don't want to hide that
3638 fact (i.e. this allows further folding, and direct checks for constants).
3639 However, a read-only object that has side effects cannot be bypassed.
3640 Since it is no problem to reevaluate literals, we just return the
3642 inner
= skip_simple_arithmetic (expr
);
3643 if (TREE_CODE (inner
) == ERROR_MARK
)
3646 if (tree_invariant_p_1 (inner
))
3649 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3650 it means that the size or offset of some field of an object depends on
3651 the value within another field.
3653 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3654 and some variable since it would then need to be both evaluated once and
3655 evaluated more than once. Front-ends must assure this case cannot
3656 happen by surrounding any such subexpressions in their own SAVE_EXPR
3657 and forcing evaluation at the proper time. */
3658 if (contains_placeholder_p (inner
))
3661 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3663 /* This expression might be placed ahead of a jump to ensure that the
3664 value was computed on both sides of the jump. So make sure it isn't
3665 eliminated as dead. */
3666 TREE_SIDE_EFFECTS (expr
) = 1;
3670 /* Look inside EXPR into any simple arithmetic operations. Return the
3671 outermost non-arithmetic or non-invariant node. */
3674 skip_simple_arithmetic (tree expr
)
3676 /* We don't care about whether this can be used as an lvalue in this
3678 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3679 expr
= TREE_OPERAND (expr
, 0);
3681 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3682 a constant, it will be more efficient to not make another SAVE_EXPR since
3683 it will allow better simplification and GCSE will be able to merge the
3684 computations if they actually occur. */
3687 if (UNARY_CLASS_P (expr
))
3688 expr
= TREE_OPERAND (expr
, 0);
3689 else if (BINARY_CLASS_P (expr
))
3691 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3692 expr
= TREE_OPERAND (expr
, 0);
3693 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3694 expr
= TREE_OPERAND (expr
, 1);
3705 /* Look inside EXPR into simple arithmetic operations involving constants.
3706 Return the outermost non-arithmetic or non-constant node. */
3709 skip_simple_constant_arithmetic (tree expr
)
3711 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3712 expr
= TREE_OPERAND (expr
, 0);
3716 if (UNARY_CLASS_P (expr
))
3717 expr
= TREE_OPERAND (expr
, 0);
3718 else if (BINARY_CLASS_P (expr
))
3720 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3721 expr
= TREE_OPERAND (expr
, 0);
3722 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3723 expr
= TREE_OPERAND (expr
, 1);
3734 /* Return which tree structure is used by T. */
3736 enum tree_node_structure_enum
3737 tree_node_structure (const_tree t
)
3739 const enum tree_code code
= TREE_CODE (t
);
3740 return tree_node_structure_for_code (code
);
3743 /* Set various status flags when building a CALL_EXPR object T. */
3746 process_call_operands (tree t
)
3748 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3749 bool read_only
= false;
3750 int i
= call_expr_flags (t
);
3752 /* Calls have side-effects, except those to const or pure functions. */
3753 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3754 side_effects
= true;
3755 /* Propagate TREE_READONLY of arguments for const functions. */
3759 if (!side_effects
|| read_only
)
3760 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3762 tree op
= TREE_OPERAND (t
, i
);
3763 if (op
&& TREE_SIDE_EFFECTS (op
))
3764 side_effects
= true;
3765 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3769 TREE_SIDE_EFFECTS (t
) = side_effects
;
3770 TREE_READONLY (t
) = read_only
;
3773 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3774 size or offset that depends on a field within a record. */
3777 contains_placeholder_p (const_tree exp
)
3779 enum tree_code code
;
3784 code
= TREE_CODE (exp
);
3785 if (code
== PLACEHOLDER_EXPR
)
3788 switch (TREE_CODE_CLASS (code
))
3791 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3792 position computations since they will be converted into a
3793 WITH_RECORD_EXPR involving the reference, which will assume
3794 here will be valid. */
3795 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3797 case tcc_exceptional
:
3798 if (code
== TREE_LIST
)
3799 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3800 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3805 case tcc_comparison
:
3806 case tcc_expression
:
3810 /* Ignoring the first operand isn't quite right, but works best. */
3811 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3814 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3815 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3816 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3819 /* The save_expr function never wraps anything containing
3820 a PLACEHOLDER_EXPR. */
3827 switch (TREE_CODE_LENGTH (code
))
3830 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3832 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3833 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3844 const_call_expr_arg_iterator iter
;
3845 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3846 if (CONTAINS_PLACEHOLDER_P (arg
))
3860 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3861 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3865 type_contains_placeholder_1 (const_tree type
)
3867 /* If the size contains a placeholder or the parent type (component type in
3868 the case of arrays) type involves a placeholder, this type does. */
3869 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3870 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3871 || (!POINTER_TYPE_P (type
)
3873 && type_contains_placeholder_p (TREE_TYPE (type
))))
3876 /* Now do type-specific checks. Note that the last part of the check above
3877 greatly limits what we have to do below. */
3878 switch (TREE_CODE (type
))
3886 case REFERENCE_TYPE
:
3895 case FIXED_POINT_TYPE
:
3896 /* Here we just check the bounds. */
3897 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3898 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3901 /* We have already checked the component type above, so just check
3902 the domain type. Flexible array members have a null domain. */
3903 return TYPE_DOMAIN (type
) ?
3904 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3908 case QUAL_UNION_TYPE
:
3912 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3913 if (TREE_CODE (field
) == FIELD_DECL
3914 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3915 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3916 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3917 || type_contains_placeholder_p (TREE_TYPE (field
))))
3928 /* Wrapper around above function used to cache its result. */
3931 type_contains_placeholder_p (tree type
)
3935 /* If the contains_placeholder_bits field has been initialized,
3936 then we know the answer. */
3937 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3938 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3940 /* Indicate that we've seen this type node, and the answer is false.
3941 This is what we want to return if we run into recursion via fields. */
3942 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3944 /* Compute the real value. */
3945 result
= type_contains_placeholder_1 (type
);
3947 /* Store the real value. */
3948 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3953 /* Push tree EXP onto vector QUEUE if it is not already present. */
3956 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3961 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3962 if (simple_cst_equal (iter
, exp
) == 1)
3966 queue
->safe_push (exp
);
3969 /* Given a tree EXP, find all occurrences of references to fields
3970 in a PLACEHOLDER_EXPR and place them in vector REFS without
3971 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3972 we assume here that EXP contains only arithmetic expressions
3973 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3977 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3979 enum tree_code code
= TREE_CODE (exp
);
3983 /* We handle TREE_LIST and COMPONENT_REF separately. */
3984 if (code
== TREE_LIST
)
3986 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3987 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3989 else if (code
== COMPONENT_REF
)
3991 for (inner
= TREE_OPERAND (exp
, 0);
3992 REFERENCE_CLASS_P (inner
);
3993 inner
= TREE_OPERAND (inner
, 0))
3996 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3997 push_without_duplicates (exp
, refs
);
3999 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
4002 switch (TREE_CODE_CLASS (code
))
4007 case tcc_declaration
:
4008 /* Variables allocated to static storage can stay. */
4009 if (!TREE_STATIC (exp
))
4010 push_without_duplicates (exp
, refs
);
4013 case tcc_expression
:
4014 /* This is the pattern built in ada/make_aligning_type. */
4015 if (code
== ADDR_EXPR
4016 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
4018 push_without_duplicates (exp
, refs
);
4024 case tcc_exceptional
:
4027 case tcc_comparison
:
4029 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4030 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4034 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4035 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4043 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4044 return a tree with all occurrences of references to F in a
4045 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4046 CONST_DECLs. Note that we assume here that EXP contains only
4047 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4048 occurring only in their argument list. */
4051 substitute_in_expr (tree exp
, tree f
, tree r
)
4053 enum tree_code code
= TREE_CODE (exp
);
4054 tree op0
, op1
, op2
, op3
;
4057 /* We handle TREE_LIST and COMPONENT_REF separately. */
4058 if (code
== TREE_LIST
)
4060 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4061 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4062 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4065 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4067 else if (code
== COMPONENT_REF
)
4071 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4072 and it is the right field, replace it with R. */
4073 for (inner
= TREE_OPERAND (exp
, 0);
4074 REFERENCE_CLASS_P (inner
);
4075 inner
= TREE_OPERAND (inner
, 0))
4079 op1
= TREE_OPERAND (exp
, 1);
4081 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4084 /* If this expression hasn't been completed let, leave it alone. */
4085 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4088 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4089 if (op0
== TREE_OPERAND (exp
, 0))
4093 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4096 switch (TREE_CODE_CLASS (code
))
4101 case tcc_declaration
:
4107 case tcc_expression
:
4113 case tcc_exceptional
:
4116 case tcc_comparison
:
4118 switch (TREE_CODE_LENGTH (code
))
4124 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4125 if (op0
== TREE_OPERAND (exp
, 0))
4128 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4132 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4133 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4135 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4138 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4142 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4143 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4144 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4146 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4147 && op2
== TREE_OPERAND (exp
, 2))
4150 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4154 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4155 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4156 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4157 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4159 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4160 && op2
== TREE_OPERAND (exp
, 2)
4161 && op3
== TREE_OPERAND (exp
, 3))
4165 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4177 new_tree
= NULL_TREE
;
4179 /* If we are trying to replace F with a constant or with another
4180 instance of one of the arguments of the call, inline back
4181 functions which do nothing else than computing a value from
4182 the arguments they are passed. This makes it possible to
4183 fold partially or entirely the replacement expression. */
4184 if (code
== CALL_EXPR
)
4186 bool maybe_inline
= false;
4187 if (CONSTANT_CLASS_P (r
))
4188 maybe_inline
= true;
4190 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4191 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4193 maybe_inline
= true;
4198 tree t
= maybe_inline_call_in_expr (exp
);
4200 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4204 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4206 tree op
= TREE_OPERAND (exp
, i
);
4207 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4211 new_tree
= copy_node (exp
);
4212 TREE_OPERAND (new_tree
, i
) = new_op
;
4218 new_tree
= fold (new_tree
);
4219 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4220 process_call_operands (new_tree
);
4231 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4233 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4234 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4239 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4240 for it within OBJ, a tree that is an object or a chain of references. */
4243 substitute_placeholder_in_expr (tree exp
, tree obj
)
4245 enum tree_code code
= TREE_CODE (exp
);
4246 tree op0
, op1
, op2
, op3
;
4249 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4250 in the chain of OBJ. */
4251 if (code
== PLACEHOLDER_EXPR
)
4253 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4256 for (elt
= obj
; elt
!= 0;
4257 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4258 || TREE_CODE (elt
) == COND_EXPR
)
4259 ? TREE_OPERAND (elt
, 1)
4260 : (REFERENCE_CLASS_P (elt
)
4261 || UNARY_CLASS_P (elt
)
4262 || BINARY_CLASS_P (elt
)
4263 || VL_EXP_CLASS_P (elt
)
4264 || EXPRESSION_CLASS_P (elt
))
4265 ? TREE_OPERAND (elt
, 0) : 0))
4266 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4269 for (elt
= obj
; elt
!= 0;
4270 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4271 || TREE_CODE (elt
) == COND_EXPR
)
4272 ? TREE_OPERAND (elt
, 1)
4273 : (REFERENCE_CLASS_P (elt
)
4274 || UNARY_CLASS_P (elt
)
4275 || BINARY_CLASS_P (elt
)
4276 || VL_EXP_CLASS_P (elt
)
4277 || EXPRESSION_CLASS_P (elt
))
4278 ? TREE_OPERAND (elt
, 0) : 0))
4279 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4280 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4282 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4284 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4285 survives until RTL generation, there will be an error. */
4289 /* TREE_LIST is special because we need to look at TREE_VALUE
4290 and TREE_CHAIN, not TREE_OPERANDS. */
4291 else if (code
== TREE_LIST
)
4293 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4294 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4295 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4298 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4301 switch (TREE_CODE_CLASS (code
))
4304 case tcc_declaration
:
4307 case tcc_exceptional
:
4310 case tcc_comparison
:
4311 case tcc_expression
:
4314 switch (TREE_CODE_LENGTH (code
))
4320 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4321 if (op0
== TREE_OPERAND (exp
, 0))
4324 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4328 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4329 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4331 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4334 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4338 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4339 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4340 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4342 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4343 && op2
== TREE_OPERAND (exp
, 2))
4346 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4350 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4351 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4352 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4353 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4355 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4356 && op2
== TREE_OPERAND (exp
, 2)
4357 && op3
== TREE_OPERAND (exp
, 3))
4361 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4373 new_tree
= NULL_TREE
;
4375 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4377 tree op
= TREE_OPERAND (exp
, i
);
4378 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4382 new_tree
= copy_node (exp
);
4383 TREE_OPERAND (new_tree
, i
) = new_op
;
4389 new_tree
= fold (new_tree
);
4390 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4391 process_call_operands (new_tree
);
4402 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4404 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4405 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4411 /* Subroutine of stabilize_reference; this is called for subtrees of
4412 references. Any expression with side-effects must be put in a SAVE_EXPR
4413 to ensure that it is only evaluated once.
4415 We don't put SAVE_EXPR nodes around everything, because assigning very
4416 simple expressions to temporaries causes us to miss good opportunities
4417 for optimizations. Among other things, the opportunity to fold in the
4418 addition of a constant into an addressing mode often gets lost, e.g.
4419 "y[i+1] += x;". In general, we take the approach that we should not make
4420 an assignment unless we are forced into it - i.e., that any non-side effect
4421 operator should be allowed, and that cse should take care of coalescing
4422 multiple utterances of the same expression should that prove fruitful. */
4425 stabilize_reference_1 (tree e
)
4428 enum tree_code code
= TREE_CODE (e
);
4430 /* We cannot ignore const expressions because it might be a reference
4431 to a const array but whose index contains side-effects. But we can
4432 ignore things that are actual constant or that already have been
4433 handled by this function. */
4435 if (tree_invariant_p (e
))
4438 switch (TREE_CODE_CLASS (code
))
4440 case tcc_exceptional
:
4441 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4442 have side-effects. */
4443 if (code
== STATEMENT_LIST
)
4444 return save_expr (e
);
4447 case tcc_declaration
:
4448 case tcc_comparison
:
4450 case tcc_expression
:
4453 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4454 so that it will only be evaluated once. */
4455 /* The reference (r) and comparison (<) classes could be handled as
4456 below, but it is generally faster to only evaluate them once. */
4457 if (TREE_SIDE_EFFECTS (e
))
4458 return save_expr (e
);
4462 /* Constants need no processing. In fact, we should never reach
4467 /* Division is slow and tends to be compiled with jumps,
4468 especially the division by powers of 2 that is often
4469 found inside of an array reference. So do it just once. */
4470 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4471 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4472 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4473 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4474 return save_expr (e
);
4475 /* Recursively stabilize each operand. */
4476 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4477 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4481 /* Recursively stabilize each operand. */
4482 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4489 TREE_TYPE (result
) = TREE_TYPE (e
);
4490 TREE_READONLY (result
) = TREE_READONLY (e
);
4491 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4492 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4497 /* Stabilize a reference so that we can use it any number of times
4498 without causing its operands to be evaluated more than once.
4499 Returns the stabilized reference. This works by means of save_expr,
4500 so see the caveats in the comments about save_expr.
4502 Also allows conversion expressions whose operands are references.
4503 Any other kind of expression is returned unchanged. */
4506 stabilize_reference (tree ref
)
4509 enum tree_code code
= TREE_CODE (ref
);
4516 /* No action is needed in this case. */
4521 case FIX_TRUNC_EXPR
:
4522 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4526 result
= build_nt (INDIRECT_REF
,
4527 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4531 result
= build_nt (COMPONENT_REF
,
4532 stabilize_reference (TREE_OPERAND (ref
, 0)),
4533 TREE_OPERAND (ref
, 1), NULL_TREE
);
4537 result
= build_nt (BIT_FIELD_REF
,
4538 stabilize_reference (TREE_OPERAND (ref
, 0)),
4539 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4540 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4544 result
= build_nt (ARRAY_REF
,
4545 stabilize_reference (TREE_OPERAND (ref
, 0)),
4546 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4547 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4550 case ARRAY_RANGE_REF
:
4551 result
= build_nt (ARRAY_RANGE_REF
,
4552 stabilize_reference (TREE_OPERAND (ref
, 0)),
4553 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4554 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4558 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4559 it wouldn't be ignored. This matters when dealing with
4561 return stabilize_reference_1 (ref
);
4563 /* If arg isn't a kind of lvalue we recognize, make no change.
4564 Caller should recognize the error for an invalid lvalue. */
4569 return error_mark_node
;
4572 TREE_TYPE (result
) = TREE_TYPE (ref
);
4573 TREE_READONLY (result
) = TREE_READONLY (ref
);
4574 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4575 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4580 /* Low-level constructors for expressions. */
4582 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4583 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4586 recompute_tree_invariant_for_addr_expr (tree t
)
4589 bool tc
= true, se
= false;
4591 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4593 /* We started out assuming this address is both invariant and constant, but
4594 does not have side effects. Now go down any handled components and see if
4595 any of them involve offsets that are either non-constant or non-invariant.
4596 Also check for side-effects.
4598 ??? Note that this code makes no attempt to deal with the case where
4599 taking the address of something causes a copy due to misalignment. */
4601 #define UPDATE_FLAGS(NODE) \
4602 do { tree _node = (NODE); \
4603 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4604 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4606 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4607 node
= TREE_OPERAND (node
, 0))
4609 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4610 array reference (probably made temporarily by the G++ front end),
4611 so ignore all the operands. */
4612 if ((TREE_CODE (node
) == ARRAY_REF
4613 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4614 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4616 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4617 if (TREE_OPERAND (node
, 2))
4618 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4619 if (TREE_OPERAND (node
, 3))
4620 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4622 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4623 FIELD_DECL, apparently. The G++ front end can put something else
4624 there, at least temporarily. */
4625 else if (TREE_CODE (node
) == COMPONENT_REF
4626 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4628 if (TREE_OPERAND (node
, 2))
4629 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4633 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4635 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4636 the address, since &(*a)->b is a form of addition. If it's a constant, the
4637 address is constant too. If it's a decl, its address is constant if the
4638 decl is static. Everything else is not constant and, furthermore,
4639 taking the address of a volatile variable is not volatile. */
4640 if (TREE_CODE (node
) == INDIRECT_REF
4641 || TREE_CODE (node
) == MEM_REF
)
4642 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4643 else if (CONSTANT_CLASS_P (node
))
4645 else if (DECL_P (node
))
4646 tc
&= (staticp (node
) != NULL_TREE
);
4650 se
|= TREE_SIDE_EFFECTS (node
);
4654 TREE_CONSTANT (t
) = tc
;
4655 TREE_SIDE_EFFECTS (t
) = se
;
4659 /* Build an expression of code CODE, data type TYPE, and operands as
4660 specified. Expressions and reference nodes can be created this way.
4661 Constants, decls, types and misc nodes cannot be.
4663 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4664 enough for all extant tree codes. */
4667 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4671 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4673 t
= make_node (code PASS_MEM_STAT
);
4680 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4682 int length
= sizeof (struct tree_exp
);
4685 record_node_allocation_statistics (code
, length
);
4687 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4689 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4691 memset (t
, 0, sizeof (struct tree_common
));
4693 TREE_SET_CODE (t
, code
);
4695 TREE_TYPE (t
) = type
;
4696 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4697 TREE_OPERAND (t
, 0) = node
;
4698 if (node
&& !TYPE_P (node
))
4700 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4701 TREE_READONLY (t
) = TREE_READONLY (node
);
4704 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4706 if (code
!= DEBUG_BEGIN_STMT
)
4707 TREE_SIDE_EFFECTS (t
) = 1;
4712 /* All of these have side-effects, no matter what their
4714 TREE_SIDE_EFFECTS (t
) = 1;
4715 TREE_READONLY (t
) = 0;
4719 /* Whether a dereference is readonly has nothing to do with whether
4720 its operand is readonly. */
4721 TREE_READONLY (t
) = 0;
4726 recompute_tree_invariant_for_addr_expr (t
);
4730 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4731 && node
&& !TYPE_P (node
)
4732 && TREE_CONSTANT (node
))
4733 TREE_CONSTANT (t
) = 1;
4734 if (TREE_CODE_CLASS (code
) == tcc_reference
4735 && node
&& TREE_THIS_VOLATILE (node
))
4736 TREE_THIS_VOLATILE (t
) = 1;
4743 #define PROCESS_ARG(N) \
4745 TREE_OPERAND (t, N) = arg##N; \
4746 if (arg##N &&!TYPE_P (arg##N)) \
4748 if (TREE_SIDE_EFFECTS (arg##N)) \
4750 if (!TREE_READONLY (arg##N) \
4751 && !CONSTANT_CLASS_P (arg##N)) \
4752 (void) (read_only = 0); \
4753 if (!TREE_CONSTANT (arg##N)) \
4754 (void) (constant = 0); \
4759 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4761 bool constant
, read_only
, side_effects
, div_by_zero
;
4764 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4766 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4767 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4768 /* When sizetype precision doesn't match that of pointers
4769 we need to be able to build explicit extensions or truncations
4770 of the offset argument. */
4771 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4772 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4773 && TREE_CODE (arg1
) == INTEGER_CST
);
4775 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4776 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4777 && ptrofftype_p (TREE_TYPE (arg1
)));
4779 t
= make_node (code PASS_MEM_STAT
);
4782 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4783 result based on those same flags for the arguments. But if the
4784 arguments aren't really even `tree' expressions, we shouldn't be trying
4787 /* Expressions without side effects may be constant if their
4788 arguments are as well. */
4789 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4790 || TREE_CODE_CLASS (code
) == tcc_binary
);
4792 side_effects
= TREE_SIDE_EFFECTS (t
);
4796 case TRUNC_DIV_EXPR
:
4798 case FLOOR_DIV_EXPR
:
4799 case ROUND_DIV_EXPR
:
4800 case EXACT_DIV_EXPR
:
4802 case FLOOR_MOD_EXPR
:
4803 case ROUND_MOD_EXPR
:
4804 case TRUNC_MOD_EXPR
:
4805 div_by_zero
= integer_zerop (arg1
);
4808 div_by_zero
= false;
4814 TREE_SIDE_EFFECTS (t
) = side_effects
;
4815 if (code
== MEM_REF
)
4817 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4819 tree o
= TREE_OPERAND (arg0
, 0);
4820 TREE_READONLY (t
) = TREE_READONLY (o
);
4821 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4826 TREE_READONLY (t
) = read_only
;
4827 /* Don't mark X / 0 as constant. */
4828 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4829 TREE_THIS_VOLATILE (t
)
4830 = (TREE_CODE_CLASS (code
) == tcc_reference
4831 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4839 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4840 tree arg2 MEM_STAT_DECL
)
4842 bool constant
, read_only
, side_effects
;
4845 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4846 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4848 t
= make_node (code PASS_MEM_STAT
);
4853 /* As a special exception, if COND_EXPR has NULL branches, we
4854 assume that it is a gimple statement and always consider
4855 it to have side effects. */
4856 if (code
== COND_EXPR
4857 && tt
== void_type_node
4858 && arg1
== NULL_TREE
4859 && arg2
== NULL_TREE
)
4860 side_effects
= true;
4862 side_effects
= TREE_SIDE_EFFECTS (t
);
4868 if (code
== COND_EXPR
)
4869 TREE_READONLY (t
) = read_only
;
4871 TREE_SIDE_EFFECTS (t
) = side_effects
;
4872 TREE_THIS_VOLATILE (t
)
4873 = (TREE_CODE_CLASS (code
) == tcc_reference
4874 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4880 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4881 tree arg2
, tree arg3 MEM_STAT_DECL
)
4883 bool constant
, read_only
, side_effects
;
4886 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4888 t
= make_node (code PASS_MEM_STAT
);
4891 side_effects
= TREE_SIDE_EFFECTS (t
);
4898 TREE_SIDE_EFFECTS (t
) = side_effects
;
4899 TREE_THIS_VOLATILE (t
)
4900 = (TREE_CODE_CLASS (code
) == tcc_reference
4901 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4907 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4908 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4910 bool constant
, read_only
, side_effects
;
4913 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4915 t
= make_node (code PASS_MEM_STAT
);
4918 side_effects
= TREE_SIDE_EFFECTS (t
);
4926 TREE_SIDE_EFFECTS (t
) = side_effects
;
4927 if (code
== TARGET_MEM_REF
)
4929 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4931 tree o
= TREE_OPERAND (arg0
, 0);
4932 TREE_READONLY (t
) = TREE_READONLY (o
);
4933 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4937 TREE_THIS_VOLATILE (t
)
4938 = (TREE_CODE_CLASS (code
) == tcc_reference
4939 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4944 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4945 on the pointer PTR. */
4948 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4950 poly_int64 offset
= 0;
4951 tree ptype
= TREE_TYPE (ptr
);
4953 /* For convenience allow addresses that collapse to a simple base
4955 if (TREE_CODE (ptr
) == ADDR_EXPR
4956 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4957 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4959 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4961 if (TREE_CODE (ptr
) == MEM_REF
)
4963 offset
+= mem_ref_offset (ptr
).force_shwi ();
4964 ptr
= TREE_OPERAND (ptr
, 0);
4967 ptr
= build_fold_addr_expr (ptr
);
4968 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4970 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4971 ptr
, build_int_cst (ptype
, offset
));
4972 SET_EXPR_LOCATION (tem
, loc
);
4976 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4979 mem_ref_offset (const_tree t
)
4981 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4985 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4986 offsetted by OFFSET units. */
4989 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4991 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4992 build_fold_addr_expr (base
),
4993 build_int_cst (ptr_type_node
, offset
));
4994 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4995 recompute_tree_invariant_for_addr_expr (addr
);
4999 /* Similar except don't specify the TREE_TYPE
5000 and leave the TREE_SIDE_EFFECTS as 0.
5001 It is permissible for arguments to be null,
5002 or even garbage if their values do not matter. */
5005 build_nt (enum tree_code code
, ...)
5012 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5016 t
= make_node (code
);
5017 length
= TREE_CODE_LENGTH (code
);
5019 for (i
= 0; i
< length
; i
++)
5020 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
5026 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5030 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5035 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5036 CALL_EXPR_FN (ret
) = fn
;
5037 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5038 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5039 CALL_EXPR_ARG (ret
, ix
) = t
;
5043 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5045 We do NOT enter this node in any sort of symbol table.
5047 LOC is the location of the decl.
5049 layout_decl is used to set up the decl's storage layout.
5050 Other slots are initialized to 0 or null pointers. */
5053 build_decl (location_t loc
, enum tree_code code
, tree name
,
5054 tree type MEM_STAT_DECL
)
5058 t
= make_node (code PASS_MEM_STAT
);
5059 DECL_SOURCE_LOCATION (t
) = loc
;
5061 /* if (type == error_mark_node)
5062 type = integer_type_node; */
5063 /* That is not done, deliberately, so that having error_mark_node
5064 as the type can suppress useless errors in the use of this variable. */
5066 DECL_NAME (t
) = name
;
5067 TREE_TYPE (t
) = type
;
5069 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5075 /* Builds and returns function declaration with NAME and TYPE. */
5078 build_fn_decl (const char *name
, tree type
)
5080 tree id
= get_identifier (name
);
5081 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5083 DECL_EXTERNAL (decl
) = 1;
5084 TREE_PUBLIC (decl
) = 1;
5085 DECL_ARTIFICIAL (decl
) = 1;
5086 TREE_NOTHROW (decl
) = 1;
5091 vec
<tree
, va_gc
> *all_translation_units
;
5093 /* Builds a new translation-unit decl with name NAME, queues it in the
5094 global list of translation-unit decls and returns it. */
5097 build_translation_unit_decl (tree name
)
5099 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5101 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5102 vec_safe_push (all_translation_units
, tu
);
5107 /* BLOCK nodes are used to represent the structure of binding contours
5108 and declarations, once those contours have been exited and their contents
5109 compiled. This information is used for outputting debugging info. */
5112 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5114 tree block
= make_node (BLOCK
);
5116 BLOCK_VARS (block
) = vars
;
5117 BLOCK_SUBBLOCKS (block
) = subblocks
;
5118 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5119 BLOCK_CHAIN (block
) = chain
;
5124 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5126 LOC is the location to use in tree T. */
5129 protected_set_expr_location (tree t
, location_t loc
)
5131 if (CAN_HAVE_LOCATION_P (t
))
5132 SET_EXPR_LOCATION (t
, loc
);
5133 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5135 t
= expr_single (t
);
5136 if (t
&& CAN_HAVE_LOCATION_P (t
))
5137 SET_EXPR_LOCATION (t
, loc
);
5141 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5142 UNKNOWN_LOCATION. */
5145 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5147 t
= expr_single (t
);
5148 if (t
&& !EXPR_HAS_LOCATION (t
))
5149 protected_set_expr_location (t
, loc
);
5152 /* Data used when collecting DECLs and TYPEs for language data removal. */
5154 class free_lang_data_d
5157 free_lang_data_d () : decls (100), types (100) {}
5159 /* Worklist to avoid excessive recursion. */
5160 auto_vec
<tree
> worklist
;
5162 /* Set of traversed objects. Used to avoid duplicate visits. */
5163 hash_set
<tree
> pset
;
5165 /* Array of symbols to process with free_lang_data_in_decl. */
5166 auto_vec
<tree
> decls
;
5168 /* Array of types to process with free_lang_data_in_type. */
5169 auto_vec
<tree
> types
;
5173 /* Add type or decl T to one of the list of tree nodes that need their
5174 language data removed. The lists are held inside FLD. */
5177 add_tree_to_fld_list (tree t
, class free_lang_data_d
*fld
)
5180 fld
->decls
.safe_push (t
);
5181 else if (TYPE_P (t
))
5182 fld
->types
.safe_push (t
);
5187 /* Push tree node T into FLD->WORKLIST. */
5190 fld_worklist_push (tree t
, class free_lang_data_d
*fld
)
5192 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5193 fld
->worklist
.safe_push ((t
));
5198 /* Return simplified TYPE_NAME of TYPE. */
5201 fld_simplified_type_name (tree type
)
5203 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5204 return TYPE_NAME (type
);
5205 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5206 TYPE_DECL if the type doesn't have linkage.
5207 this must match fld_ */
5208 if (type
!= TYPE_MAIN_VARIANT (type
)
5209 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5210 && (TREE_CODE (type
) != RECORD_TYPE
5211 || !TYPE_BINFO (type
)
5212 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5213 return DECL_NAME (TYPE_NAME (type
));
5214 return TYPE_NAME (type
);
5217 /* Do same comparsion as check_qualified_type skipping lang part of type
5218 and be more permissive about type names: we only care that names are
5219 same (for diagnostics) and that ODR names are the same.
5220 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5223 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5225 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5226 /* We want to match incomplete variants with complete types.
5227 In this case we need to ignore alignment. */
5228 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5229 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5230 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5231 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5232 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5233 TYPE_ATTRIBUTES (v
))
5234 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5240 /* Find variant of FIRST that match T and create new one if necessary.
5241 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5244 fld_type_variant (tree first
, tree t
, class free_lang_data_d
*fld
,
5245 tree inner_type
= NULL
)
5247 if (first
== TYPE_MAIN_VARIANT (t
))
5249 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5250 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5252 tree v
= build_variant_type_copy (first
);
5253 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5254 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5255 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5256 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5257 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5258 TYPE_NAME (v
) = TYPE_NAME (t
);
5259 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5260 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5261 /* Variants of incomplete types should have alignment
5262 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5263 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5265 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5266 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5269 TREE_TYPE (v
) = inner_type
;
5270 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5271 if (!fld
->pset
.add (v
))
5272 add_tree_to_fld_list (v
, fld
);
5276 /* Map complete types to incomplete types. */
5278 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5280 /* Map types to simplified types. */
5282 static hash_map
<tree
, tree
> *fld_simplified_types
;
5284 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5285 use MAP to prevent duplicates. */
5288 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5289 class free_lang_data_d
*fld
)
5291 if (TREE_TYPE (t
) == t2
)
5294 if (TYPE_MAIN_VARIANT (t
) != t
)
5296 return fld_type_variant
5297 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5298 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5304 = map
->get_or_insert (t
, &existed
);
5308 = build_array_type_1 (t2
, TYPE_DOMAIN (t
), TYPE_TYPELESS_STORAGE (t
),
5310 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5311 if (!fld
->pset
.add (array
))
5312 add_tree_to_fld_list (array
, fld
);
5317 /* Return CTX after removal of contexts that are not relevant */
5320 fld_decl_context (tree ctx
)
5322 /* Variably modified types are needed for tree_is_indexable to decide
5323 whether the type needs to go to local or global section.
5324 This code is semi-broken but for now it is easiest to keep contexts
5326 if (ctx
&& TYPE_P (ctx
)
5327 && !variably_modified_type_p (ctx
, NULL_TREE
))
5329 while (ctx
&& TYPE_P (ctx
))
5330 ctx
= TYPE_CONTEXT (ctx
);
5335 /* For T being aggregate type try to turn it into a incomplete variant.
5336 Return T if no simplification is possible. */
5339 fld_incomplete_type_of (tree t
, class free_lang_data_d
*fld
)
5343 if (POINTER_TYPE_P (t
))
5345 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5346 if (t2
!= TREE_TYPE (t
))
5349 if (TREE_CODE (t
) == POINTER_TYPE
)
5350 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5351 TYPE_REF_CAN_ALIAS_ALL (t
));
5353 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5354 TYPE_REF_CAN_ALIAS_ALL (t
));
5355 gcc_assert (TYPE_CANONICAL (t2
) != t2
5356 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5357 if (!fld
->pset
.add (first
))
5358 add_tree_to_fld_list (first
, fld
);
5359 return fld_type_variant (first
, t
, fld
);
5363 if (TREE_CODE (t
) == ARRAY_TYPE
)
5364 return fld_process_array_type (t
,
5365 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5366 fld_incomplete_types
, fld
);
5367 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5368 || !COMPLETE_TYPE_P (t
))
5370 if (TYPE_MAIN_VARIANT (t
) == t
)
5374 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5378 copy
= build_distinct_type_copy (t
);
5380 /* It is possible that type was not seen by free_lang_data yet. */
5381 if (!fld
->pset
.add (copy
))
5382 add_tree_to_fld_list (copy
, fld
);
5383 TYPE_SIZE (copy
) = NULL
;
5384 TYPE_USER_ALIGN (copy
) = 0;
5385 TYPE_SIZE_UNIT (copy
) = NULL
;
5386 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5387 TREE_ADDRESSABLE (copy
) = 0;
5388 if (AGGREGATE_TYPE_P (t
))
5390 SET_TYPE_MODE (copy
, VOIDmode
);
5391 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5392 TYPE_TYPELESS_STORAGE (copy
) = 0;
5393 TYPE_FIELDS (copy
) = NULL
;
5394 TYPE_BINFO (copy
) = NULL
;
5395 TYPE_FINAL_P (copy
) = 0;
5396 TYPE_EMPTY_P (copy
) = 0;
5400 TYPE_VALUES (copy
) = NULL
;
5401 ENUM_IS_OPAQUE (copy
) = 0;
5402 ENUM_IS_SCOPED (copy
) = 0;
5405 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5406 This is needed for ODR violation warnings to come out right (we
5407 want duplicate TYPE_DECLs whenever the type is duplicated because
5408 of ODR violation. Because lang data in the TYPE_DECL may not
5409 have been freed yet, rebuild it from scratch and copy relevant
5411 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5412 tree name
= TYPE_NAME (copy
);
5414 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5416 gcc_checking_assert (TREE_TYPE (name
) == t
);
5417 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5418 DECL_NAME (name
), copy
);
5419 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5420 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5421 SET_DECL_ALIGN (name2
, 0);
5422 DECL_CONTEXT (name2
) = fld_decl_context
5423 (DECL_CONTEXT (name
));
5424 TYPE_NAME (copy
) = name2
;
5429 return (fld_type_variant
5430 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5433 /* Simplify type T for scenarios where we do not need complete pointer
5437 fld_simplified_type (tree t
, class free_lang_data_d
*fld
)
5441 if (POINTER_TYPE_P (t
))
5442 return fld_incomplete_type_of (t
, fld
);
5443 /* FIXME: This triggers verification error, see PR88140. */
5444 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5445 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5446 fld_simplified_types
, fld
);
5450 /* Reset the expression *EXPR_P, a size or position.
5452 ??? We could reset all non-constant sizes or positions. But it's cheap
5453 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5455 We need to reset self-referential sizes or positions because they cannot
5456 be gimplified and thus can contain a CALL_EXPR after the gimplification
5457 is finished, which will run afoul of LTO streaming. And they need to be
5458 reset to something essentially dummy but not constant, so as to preserve
5459 the properties of the object they are attached to. */
5462 free_lang_data_in_one_sizepos (tree
*expr_p
)
5464 tree expr
= *expr_p
;
5465 if (CONTAINS_PLACEHOLDER_P (expr
))
5466 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5470 /* Reset all the fields in a binfo node BINFO. We only keep
5471 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5474 free_lang_data_in_binfo (tree binfo
)
5479 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5481 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5482 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5483 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5484 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5485 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5486 TREE_PUBLIC (binfo
) = 0;
5488 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5489 free_lang_data_in_binfo (t
);
5493 /* Reset all language specific information still present in TYPE. */
5496 free_lang_data_in_type (tree type
, class free_lang_data_d
*fld
)
5498 gcc_assert (TYPE_P (type
));
5500 /* Give the FE a chance to remove its own data first. */
5501 lang_hooks
.free_lang_data (type
);
5503 TREE_LANG_FLAG_0 (type
) = 0;
5504 TREE_LANG_FLAG_1 (type
) = 0;
5505 TREE_LANG_FLAG_2 (type
) = 0;
5506 TREE_LANG_FLAG_3 (type
) = 0;
5507 TREE_LANG_FLAG_4 (type
) = 0;
5508 TREE_LANG_FLAG_5 (type
) = 0;
5509 TREE_LANG_FLAG_6 (type
) = 0;
5511 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5513 /* Purge non-marked variants from the variants chain, so that they
5514 don't reappear in the IL after free_lang_data. */
5515 while (TYPE_NEXT_VARIANT (type
)
5516 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5518 tree t
= TYPE_NEXT_VARIANT (type
);
5519 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5520 /* Turn the removed types into distinct types. */
5521 TYPE_MAIN_VARIANT (t
) = t
;
5522 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5525 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5527 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5528 /* Remove the const and volatile qualifiers from arguments. The
5529 C++ front end removes them, but the C front end does not,
5530 leading to false ODR violation errors when merging two
5531 instances of the same function signature compiled by
5532 different front ends. */
5533 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5535 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5536 tree arg_type
= TREE_VALUE (p
);
5538 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5540 int quals
= TYPE_QUALS (arg_type
)
5542 & ~TYPE_QUAL_VOLATILE
;
5543 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5544 if (!fld
->pset
.add (TREE_VALUE (p
)))
5545 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5547 /* C++ FE uses TREE_PURPOSE to store initial values. */
5548 TREE_PURPOSE (p
) = NULL
;
5551 else if (TREE_CODE (type
) == METHOD_TYPE
)
5553 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5554 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5556 /* C++ FE uses TREE_PURPOSE to store initial values. */
5557 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5558 TREE_PURPOSE (p
) = NULL
;
5561 else if (RECORD_OR_UNION_TYPE_P (type
))
5563 /* Remove members that are not FIELD_DECLs from the field list
5564 of an aggregate. These occur in C++. */
5565 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5566 if (TREE_CODE (member
) == FIELD_DECL
)
5567 prev
= &DECL_CHAIN (member
);
5569 *prev
= DECL_CHAIN (member
);
5571 TYPE_VFIELD (type
) = NULL_TREE
;
5573 if (TYPE_BINFO (type
))
5575 free_lang_data_in_binfo (TYPE_BINFO (type
));
5576 /* We need to preserve link to bases and virtual table for all
5577 polymorphic types to make devirtualization machinery working. */
5578 if (!BINFO_VTABLE (TYPE_BINFO (type
)))
5579 TYPE_BINFO (type
) = NULL
;
5582 else if (INTEGRAL_TYPE_P (type
)
5583 || SCALAR_FLOAT_TYPE_P (type
)
5584 || FIXED_POINT_TYPE_P (type
))
5586 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5588 ENUM_IS_OPAQUE (type
) = 0;
5589 ENUM_IS_SCOPED (type
) = 0;
5590 /* Type values are used only for C++ ODR checking. Drop them
5591 for all type variants and non-ODR types.
5592 For ODR types the data is freed in free_odr_warning_data. */
5593 if (!TYPE_VALUES (type
))
5595 else if (TYPE_MAIN_VARIANT (type
) != type
5596 || !type_with_linkage_p (type
)
5597 || type_in_anonymous_namespace_p (type
))
5598 TYPE_VALUES (type
) = NULL
;
5600 register_odr_enum (type
);
5602 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5603 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5606 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5608 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5609 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5611 if (TYPE_CONTEXT (type
)
5612 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5614 tree ctx
= TYPE_CONTEXT (type
);
5617 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5619 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5620 TYPE_CONTEXT (type
) = ctx
;
5623 TYPE_STUB_DECL (type
) = NULL
;
5624 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5628 /* Return true if DECL may need an assembler name to be set. */
5631 need_assembler_name_p (tree decl
)
5633 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5634 Rule merging. This makes type_odr_p to return true on those types during
5635 LTO and by comparing the mangled name, we can say what types are intended
5636 to be equivalent across compilation unit.
5638 We do not store names of type_in_anonymous_namespace_p.
5640 Record, union and enumeration type have linkage that allows use
5641 to check type_in_anonymous_namespace_p. We do not mangle compound types
5642 that always can be compared structurally.
5644 Similarly for builtin types, we compare properties of their main variant.
5645 A special case are integer types where mangling do make differences
5646 between char/signed char/unsigned char etc. Storing name for these makes
5647 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5648 See cp/mangle.c:write_builtin_type for details. */
5650 if (TREE_CODE (decl
) == TYPE_DECL
)
5652 if (DECL_NAME (decl
)
5653 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5654 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5655 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5656 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5657 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5658 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5659 && (type_with_linkage_p (TREE_TYPE (decl
))
5660 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5661 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5662 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5665 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5666 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5669 /* If DECL already has its assembler name set, it does not need a
5671 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5672 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5675 /* Abstract decls do not need an assembler name. */
5676 if (DECL_ABSTRACT_P (decl
))
5679 /* For VAR_DECLs, only static, public and external symbols need an
5682 && !TREE_STATIC (decl
)
5683 && !TREE_PUBLIC (decl
)
5684 && !DECL_EXTERNAL (decl
))
5687 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5689 /* Do not set assembler name on builtins. Allow RTL expansion to
5690 decide whether to expand inline or via a regular call. */
5691 if (fndecl_built_in_p (decl
)
5692 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5695 /* Functions represented in the callgraph need an assembler name. */
5696 if (cgraph_node::get (decl
) != NULL
)
5699 /* Unused and not public functions don't need an assembler name. */
5700 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5708 /* Reset all language specific information still present in symbol
5712 free_lang_data_in_decl (tree decl
, class free_lang_data_d
*fld
)
5714 gcc_assert (DECL_P (decl
));
5716 /* Give the FE a chance to remove its own data first. */
5717 lang_hooks
.free_lang_data (decl
);
5719 TREE_LANG_FLAG_0 (decl
) = 0;
5720 TREE_LANG_FLAG_1 (decl
) = 0;
5721 TREE_LANG_FLAG_2 (decl
) = 0;
5722 TREE_LANG_FLAG_3 (decl
) = 0;
5723 TREE_LANG_FLAG_4 (decl
) = 0;
5724 TREE_LANG_FLAG_5 (decl
) = 0;
5725 TREE_LANG_FLAG_6 (decl
) = 0;
5727 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5728 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5729 if (TREE_CODE (decl
) == FIELD_DECL
)
5731 DECL_FCONTEXT (decl
) = NULL
;
5732 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5733 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5734 DECL_QUALIFIER (decl
) = NULL_TREE
;
5737 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5739 struct cgraph_node
*node
;
5740 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5741 the address may be taken in other unit, so this flag has no practical
5744 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5745 for public objects that indeed cannot be adressed, but it is not
5746 the case. Set the flag to true so we do not get merge failures for
5747 i.e. virtual tables between units that take address of it and
5748 units that don't. */
5749 if (TREE_PUBLIC (decl
))
5750 TREE_ADDRESSABLE (decl
) = true;
5751 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5752 if (!(node
= cgraph_node::get (decl
))
5753 || (!node
->definition
&& !node
->clones
))
5756 node
->release_body ();
5759 release_function_body (decl
);
5760 DECL_ARGUMENTS (decl
) = NULL
;
5761 DECL_RESULT (decl
) = NULL
;
5762 DECL_INITIAL (decl
) = error_mark_node
;
5765 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5769 /* If DECL has a gimple body, then the context for its
5770 arguments must be DECL. Otherwise, it doesn't really
5771 matter, as we will not be emitting any code for DECL. In
5772 general, there may be other instances of DECL created by
5773 the front end and since PARM_DECLs are generally shared,
5774 their DECL_CONTEXT changes as the replicas of DECL are
5775 created. The only time where DECL_CONTEXT is important
5776 is for the FUNCTION_DECLs that have a gimple body (since
5777 the PARM_DECL will be used in the function's body). */
5778 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5779 DECL_CONTEXT (t
) = decl
;
5780 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5781 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5782 = target_option_default_node
;
5783 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5784 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5785 = optimization_default_node
;
5788 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5789 At this point, it is not needed anymore. */
5790 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5792 /* Clear the abstract origin if it refers to a method.
5793 Otherwise dwarf2out.c will ICE as we splice functions out of
5794 TYPE_FIELDS and thus the origin will not be output
5796 if (DECL_ABSTRACT_ORIGIN (decl
)
5797 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5798 && RECORD_OR_UNION_TYPE_P
5799 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5800 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5802 DECL_VINDEX (decl
) = NULL_TREE
;
5804 else if (VAR_P (decl
))
5806 /* See comment above why we set the flag for functions. */
5807 if (TREE_PUBLIC (decl
))
5808 TREE_ADDRESSABLE (decl
) = true;
5809 if ((DECL_EXTERNAL (decl
)
5810 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5811 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5812 DECL_INITIAL (decl
) = NULL_TREE
;
5814 else if (TREE_CODE (decl
) == TYPE_DECL
)
5816 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5817 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5818 TREE_PUBLIC (decl
) = 0;
5819 TREE_PRIVATE (decl
) = 0;
5820 DECL_ARTIFICIAL (decl
) = 0;
5821 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5822 DECL_INITIAL (decl
) = NULL_TREE
;
5823 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5824 DECL_MODE (decl
) = VOIDmode
;
5825 SET_DECL_ALIGN (decl
, 0);
5826 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5828 else if (TREE_CODE (decl
) == FIELD_DECL
)
5830 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5831 DECL_INITIAL (decl
) = NULL_TREE
;
5833 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5834 && DECL_INITIAL (decl
)
5835 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5837 /* Strip builtins from the translation-unit BLOCK. We still have targets
5838 without builtin_decl_explicit support and also builtins are shared
5839 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5840 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5844 if (TREE_CODE (var
) == FUNCTION_DECL
5845 && fndecl_built_in_p (var
))
5846 *nextp
= TREE_CHAIN (var
);
5848 nextp
= &TREE_CHAIN (var
);
5851 /* We need to keep field decls associated with their trees. Otherwise tree
5852 merging may merge some fileds and keep others disjoint wich in turn will
5853 not do well with TREE_CHAIN pointers linking them.
5855 Also do not drop containing types for virtual methods and tables because
5856 these are needed by devirtualization.
5857 C++ destructors are special because C++ frontends sometimes produces
5858 virtual destructor as an alias of non-virtual destructor. In
5859 devirutalization code we always walk through aliases and we need
5860 context to be preserved too. See PR89335 */
5861 if (TREE_CODE (decl
) != FIELD_DECL
5862 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5863 || (!DECL_VIRTUAL_P (decl
)
5864 && (TREE_CODE (decl
) != FUNCTION_DECL
5865 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5866 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5870 /* Operand callback helper for free_lang_data_in_node. *TP is the
5871 subtree operand being considered. */
5874 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5877 class free_lang_data_d
*fld
= (class free_lang_data_d
*) data
;
5879 if (TREE_CODE (t
) == TREE_LIST
)
5882 /* Language specific nodes will be removed, so there is no need
5883 to gather anything under them. */
5884 if (is_lang_specific (t
))
5892 /* Note that walk_tree does not traverse every possible field in
5893 decls, so we have to do our own traversals here. */
5894 add_tree_to_fld_list (t
, fld
);
5896 fld_worklist_push (DECL_NAME (t
), fld
);
5897 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5898 fld_worklist_push (DECL_SIZE (t
), fld
);
5899 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5901 /* We are going to remove everything under DECL_INITIAL for
5902 TYPE_DECLs. No point walking them. */
5903 if (TREE_CODE (t
) != TYPE_DECL
)
5904 fld_worklist_push (DECL_INITIAL (t
), fld
);
5906 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5907 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5909 if (TREE_CODE (t
) == FUNCTION_DECL
)
5911 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5912 fld_worklist_push (DECL_RESULT (t
), fld
);
5914 else if (TREE_CODE (t
) == FIELD_DECL
)
5916 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5917 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5918 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5919 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5922 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5923 && DECL_HAS_VALUE_EXPR_P (t
))
5924 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5926 if (TREE_CODE (t
) != FIELD_DECL
5927 && TREE_CODE (t
) != TYPE_DECL
)
5928 fld_worklist_push (TREE_CHAIN (t
), fld
);
5931 else if (TYPE_P (t
))
5933 /* Note that walk_tree does not traverse every possible field in
5934 types, so we have to do our own traversals here. */
5935 add_tree_to_fld_list (t
, fld
);
5937 if (!RECORD_OR_UNION_TYPE_P (t
))
5938 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5939 fld_worklist_push (TYPE_SIZE (t
), fld
);
5940 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5941 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5942 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5943 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5944 fld_worklist_push (TYPE_NAME (t
), fld
);
5945 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5946 lists, we may look types up in these lists and use them while
5947 optimizing the function body. Thus we need to free lang data
5949 if (TREE_CODE (t
) == POINTER_TYPE
)
5950 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5951 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5952 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5953 if (!POINTER_TYPE_P (t
))
5954 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5955 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5956 if (!RECORD_OR_UNION_TYPE_P (t
))
5957 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5958 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5959 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5960 do not and want not to reach unused variants this way. */
5961 if (TYPE_CONTEXT (t
))
5963 tree ctx
= TYPE_CONTEXT (t
);
5964 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5965 So push that instead. */
5966 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5967 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5968 fld_worklist_push (ctx
, fld
);
5970 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
5972 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5976 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5977 fld_worklist_push (TREE_TYPE (tem
), fld
);
5978 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5979 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5981 if (RECORD_OR_UNION_TYPE_P (t
))
5984 /* Push all TYPE_FIELDS - there can be interleaving interesting
5985 and non-interesting things. */
5986 tem
= TYPE_FIELDS (t
);
5989 if (TREE_CODE (tem
) == FIELD_DECL
)
5990 fld_worklist_push (tem
, fld
);
5991 tem
= TREE_CHAIN (tem
);
5994 if (FUNC_OR_METHOD_TYPE_P (t
))
5995 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5997 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
6000 else if (TREE_CODE (t
) == BLOCK
)
6002 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
6004 if (TREE_CODE (*tem
) != LABEL_DECL
6005 && (TREE_CODE (*tem
) != VAR_DECL
6006 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
))))
6008 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
6009 && TREE_CODE (*tem
) != PARM_DECL
);
6010 *tem
= TREE_CHAIN (*tem
);
6014 fld_worklist_push (*tem
, fld
);
6015 tem
= &TREE_CHAIN (*tem
);
6018 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
6019 fld_worklist_push (tem
, fld
);
6020 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
6023 if (TREE_CODE (t
) != IDENTIFIER_NODE
6024 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
6025 fld_worklist_push (TREE_TYPE (t
), fld
);
6031 /* Find decls and types in T. */
6034 find_decls_types (tree t
, class free_lang_data_d
*fld
)
6038 if (!fld
->pset
.contains (t
))
6039 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
6040 if (fld
->worklist
.is_empty ())
6042 t
= fld
->worklist
.pop ();
6046 /* Translate all the types in LIST with the corresponding runtime
6050 get_eh_types_for_runtime (tree list
)
6054 if (list
== NULL_TREE
)
6057 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6059 list
= TREE_CHAIN (list
);
6062 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6063 TREE_CHAIN (prev
) = n
;
6064 prev
= TREE_CHAIN (prev
);
6065 list
= TREE_CHAIN (list
);
6072 /* Find decls and types referenced in EH region R and store them in
6073 FLD->DECLS and FLD->TYPES. */
6076 find_decls_types_in_eh_region (eh_region r
, class free_lang_data_d
*fld
)
6087 /* The types referenced in each catch must first be changed to the
6088 EH types used at runtime. This removes references to FE types
6090 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6092 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6093 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6098 case ERT_ALLOWED_EXCEPTIONS
:
6099 r
->u
.allowed
.type_list
6100 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6101 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6104 case ERT_MUST_NOT_THROW
:
6105 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6106 find_decls_types_r
, fld
, &fld
->pset
);
6112 /* Find decls and types referenced in cgraph node N and store them in
6113 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6114 look for *every* kind of DECL and TYPE node reachable from N,
6115 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6116 NAMESPACE_DECLs, etc). */
6119 find_decls_types_in_node (struct cgraph_node
*n
, class free_lang_data_d
*fld
)
6122 struct function
*fn
;
6126 find_decls_types (n
->decl
, fld
);
6128 if (!gimple_has_body_p (n
->decl
))
6131 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6133 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6135 /* Traverse locals. */
6136 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6137 find_decls_types (t
, fld
);
6139 /* Traverse EH regions in FN. */
6142 FOR_ALL_EH_REGION_FN (r
, fn
)
6143 find_decls_types_in_eh_region (r
, fld
);
6146 /* Traverse every statement in FN. */
6147 FOR_EACH_BB_FN (bb
, fn
)
6150 gimple_stmt_iterator si
;
6153 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6155 gphi
*phi
= psi
.phi ();
6157 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6159 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6160 find_decls_types (*arg_p
, fld
);
6164 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6166 gimple
*stmt
= gsi_stmt (si
);
6168 if (is_gimple_call (stmt
))
6169 find_decls_types (gimple_call_fntype (stmt
), fld
);
6171 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6173 tree arg
= gimple_op (stmt
, i
);
6174 find_decls_types (arg
, fld
);
6175 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6176 which we need for asm stmts. */
6178 && TREE_CODE (arg
) == TREE_LIST
6179 && TREE_PURPOSE (arg
)
6180 && gimple_code (stmt
) == GIMPLE_ASM
)
6181 find_decls_types (TREE_PURPOSE (arg
), fld
);
6188 /* Find decls and types referenced in varpool node N and store them in
6189 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6190 look for *every* kind of DECL and TYPE node reachable from N,
6191 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6192 NAMESPACE_DECLs, etc). */
6195 find_decls_types_in_var (varpool_node
*v
, class free_lang_data_d
*fld
)
6197 find_decls_types (v
->decl
, fld
);
6200 /* If T needs an assembler name, have one created for it. */
6203 assign_assembler_name_if_needed (tree t
)
6205 if (need_assembler_name_p (t
))
6207 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6208 diagnostics that use input_location to show locus
6209 information. The problem here is that, at this point,
6210 input_location is generally anchored to the end of the file
6211 (since the parser is long gone), so we don't have a good
6212 position to pin it to.
6214 To alleviate this problem, this uses the location of T's
6215 declaration. Examples of this are
6216 testsuite/g++.dg/template/cond2.C and
6217 testsuite/g++.dg/template/pr35240.C. */
6218 location_t saved_location
= input_location
;
6219 input_location
= DECL_SOURCE_LOCATION (t
);
6221 decl_assembler_name (t
);
6223 input_location
= saved_location
;
6228 /* Free language specific information for every operand and expression
6229 in every node of the call graph. This process operates in three stages:
6231 1- Every callgraph node and varpool node is traversed looking for
6232 decls and types embedded in them. This is a more exhaustive
6233 search than that done by find_referenced_vars, because it will
6234 also collect individual fields, decls embedded in types, etc.
6236 2- All the decls found are sent to free_lang_data_in_decl.
6238 3- All the types found are sent to free_lang_data_in_type.
6240 The ordering between decls and types is important because
6241 free_lang_data_in_decl sets assembler names, which includes
6242 mangling. So types cannot be freed up until assembler names have
6246 free_lang_data_in_cgraph (class free_lang_data_d
*fld
)
6248 struct cgraph_node
*n
;
6254 /* Find decls and types in the body of every function in the callgraph. */
6255 FOR_EACH_FUNCTION (n
)
6256 find_decls_types_in_node (n
, fld
);
6258 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6259 find_decls_types (p
->decl
, fld
);
6261 /* Find decls and types in every varpool symbol. */
6262 FOR_EACH_VARIABLE (v
)
6263 find_decls_types_in_var (v
, fld
);
6265 /* Set the assembler name on every decl found. We need to do this
6266 now because free_lang_data_in_decl will invalidate data needed
6267 for mangling. This breaks mangling on interdependent decls. */
6268 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6269 assign_assembler_name_if_needed (t
);
6271 /* Traverse every decl found freeing its language data. */
6272 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6273 free_lang_data_in_decl (t
, fld
);
6275 /* Traverse every type found freeing its language data. */
6276 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6277 free_lang_data_in_type (t
, fld
);
6281 /* Free resources that are used by FE but are not needed once they are done. */
6284 free_lang_data (void)
6287 class free_lang_data_d fld
;
6289 /* If we are the LTO frontend we have freed lang-specific data already. */
6291 || (!flag_generate_lto
&& !flag_generate_offload
))
6293 /* Rebuild type inheritance graph even when not doing LTO to get
6294 consistent profile data. */
6295 rebuild_type_inheritance_graph ();
6299 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6300 fld_simplified_types
= new hash_map
<tree
, tree
>;
6302 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6303 if (vec_safe_is_empty (all_translation_units
))
6304 build_translation_unit_decl (NULL_TREE
);
6306 /* Allocate and assign alias sets to the standard integer types
6307 while the slots are still in the way the frontends generated them. */
6308 for (i
= 0; i
< itk_none
; ++i
)
6309 if (integer_types
[i
])
6310 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6312 /* Traverse the IL resetting language specific information for
6313 operands, expressions, etc. */
6314 free_lang_data_in_cgraph (&fld
);
6316 /* Create gimple variants for common types. */
6317 for (unsigned i
= 0;
6318 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6320 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6322 /* Reset some langhooks. Do not reset types_compatible_p, it may
6323 still be used indirectly via the get_alias_set langhook. */
6324 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6325 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6326 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6327 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6328 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6329 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6330 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6331 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6333 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6340 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6344 /* We do not want the default decl_assembler_name implementation,
6345 rather if we have fixed everything we want a wrapper around it
6346 asserting that all non-local symbols already got their assembler
6347 name and only produce assembler names for local symbols. Or rather
6348 make sure we never call decl_assembler_name on local symbols and
6349 devise a separate, middle-end private scheme for it. */
6351 /* Reset diagnostic machinery. */
6352 tree_diagnostics_defaults (global_dc
);
6354 rebuild_type_inheritance_graph ();
6356 delete fld_incomplete_types
;
6357 delete fld_simplified_types
;
6365 const pass_data pass_data_ipa_free_lang_data
=
6367 SIMPLE_IPA_PASS
, /* type */
6368 "*free_lang_data", /* name */
6369 OPTGROUP_NONE
, /* optinfo_flags */
6370 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6371 0, /* properties_required */
6372 0, /* properties_provided */
6373 0, /* properties_destroyed */
6374 0, /* todo_flags_start */
6375 0, /* todo_flags_finish */
6378 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6381 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6382 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6385 /* opt_pass methods: */
6386 virtual unsigned int execute (function
*) { return free_lang_data (); }
6388 }; // class pass_ipa_free_lang_data
6392 simple_ipa_opt_pass
*
6393 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6395 return new pass_ipa_free_lang_data (ctxt
);
6398 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6399 of the various TYPE_QUAL values. */
6402 set_type_quals (tree type
, int type_quals
)
6404 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6405 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6406 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6407 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6408 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6411 /* Returns true iff CAND and BASE have equivalent language-specific
6415 check_lang_type (const_tree cand
, const_tree base
)
6417 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6419 /* type_hash_eq currently only applies to these types. */
6420 if (TREE_CODE (cand
) != FUNCTION_TYPE
6421 && TREE_CODE (cand
) != METHOD_TYPE
)
6423 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6426 /* This function checks to see if TYPE matches the size one of the built-in
6427 atomic types, and returns that core atomic type. */
6430 find_atomic_core_type (const_tree type
)
6432 tree base_atomic_type
;
6434 /* Only handle complete types. */
6435 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6438 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6441 base_atomic_type
= atomicQI_type_node
;
6445 base_atomic_type
= atomicHI_type_node
;
6449 base_atomic_type
= atomicSI_type_node
;
6453 base_atomic_type
= atomicDI_type_node
;
6457 base_atomic_type
= atomicTI_type_node
;
6461 base_atomic_type
= NULL_TREE
;
6464 return base_atomic_type
;
6467 /* Returns true iff unqualified CAND and BASE are equivalent. */
6470 check_base_type (const_tree cand
, const_tree base
)
6472 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6473 /* Apparently this is needed for Objective-C. */
6474 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6475 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6476 TYPE_ATTRIBUTES (base
)))
6478 /* Check alignment. */
6479 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6481 /* Atomic types increase minimal alignment. We must to do so as well
6482 or we get duplicated canonical types. See PR88686. */
6483 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6485 /* See if this object can map to a basic atomic type. */
6486 tree atomic_type
= find_atomic_core_type (cand
);
6487 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6493 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6496 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6498 return (TYPE_QUALS (cand
) == type_quals
6499 && check_base_type (cand
, base
)
6500 && check_lang_type (cand
, base
));
6503 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6506 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6508 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6509 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6510 /* Apparently this is needed for Objective-C. */
6511 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6512 /* Check alignment. */
6513 && TYPE_ALIGN (cand
) == align
6514 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6515 TYPE_ATTRIBUTES (base
))
6516 && check_lang_type (cand
, base
));
6519 /* Return a version of the TYPE, qualified as indicated by the
6520 TYPE_QUALS, if one exists. If no qualified version exists yet,
6521 return NULL_TREE. */
6524 get_qualified_type (tree type
, int type_quals
)
6526 if (TYPE_QUALS (type
) == type_quals
)
6529 tree mv
= TYPE_MAIN_VARIANT (type
);
6530 if (check_qualified_type (mv
, type
, type_quals
))
6533 /* Search the chain of variants to see if there is already one there just
6534 like the one we need to have. If so, use that existing one. We must
6535 preserve the TYPE_NAME, since there is code that depends on this. */
6536 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6537 if (check_qualified_type (*tp
, type
, type_quals
))
6539 /* Put the found variant at the head of the variant list so
6540 frequently searched variants get found faster. The C++ FE
6541 benefits greatly from this. */
6543 *tp
= TYPE_NEXT_VARIANT (t
);
6544 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6545 TYPE_NEXT_VARIANT (mv
) = t
;
6552 /* Like get_qualified_type, but creates the type if it does not
6553 exist. This function never returns NULL_TREE. */
6556 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6560 /* See if we already have the appropriate qualified variant. */
6561 t
= get_qualified_type (type
, type_quals
);
6563 /* If not, build it. */
6566 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6567 set_type_quals (t
, type_quals
);
6569 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6571 /* See if this object can map to a basic atomic type. */
6572 tree atomic_type
= find_atomic_core_type (type
);
6575 /* Ensure the alignment of this type is compatible with
6576 the required alignment of the atomic type. */
6577 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6578 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6582 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6583 /* Propagate structural equality. */
6584 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6585 else if (TYPE_CANONICAL (type
) != type
)
6586 /* Build the underlying canonical type, since it is different
6589 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6590 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6593 /* T is its own canonical type. */
6594 TYPE_CANONICAL (t
) = t
;
6601 /* Create a variant of type T with alignment ALIGN. */
6604 build_aligned_type (tree type
, unsigned int align
)
6608 if (TYPE_PACKED (type
)
6609 || TYPE_ALIGN (type
) == align
)
6612 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6613 if (check_aligned_type (t
, type
, align
))
6616 t
= build_variant_type_copy (type
);
6617 SET_TYPE_ALIGN (t
, align
);
6618 TYPE_USER_ALIGN (t
) = 1;
6623 /* Create a new distinct copy of TYPE. The new type is made its own
6624 MAIN_VARIANT. If TYPE requires structural equality checks, the
6625 resulting type requires structural equality checks; otherwise, its
6626 TYPE_CANONICAL points to itself. */
6629 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6631 tree t
= copy_node (type PASS_MEM_STAT
);
6633 TYPE_POINTER_TO (t
) = 0;
6634 TYPE_REFERENCE_TO (t
) = 0;
6636 /* Set the canonical type either to a new equivalence class, or
6637 propagate the need for structural equality checks. */
6638 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6639 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6641 TYPE_CANONICAL (t
) = t
;
6643 /* Make it its own variant. */
6644 TYPE_MAIN_VARIANT (t
) = t
;
6645 TYPE_NEXT_VARIANT (t
) = 0;
6647 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6648 whose TREE_TYPE is not t. This can also happen in the Ada
6649 frontend when using subtypes. */
6654 /* Create a new variant of TYPE, equivalent but distinct. This is so
6655 the caller can modify it. TYPE_CANONICAL for the return type will
6656 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6657 are considered equal by the language itself (or that both types
6658 require structural equality checks). */
6661 build_variant_type_copy (tree type MEM_STAT_DECL
)
6663 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6665 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6667 /* Since we're building a variant, assume that it is a non-semantic
6668 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6669 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6670 /* Type variants have no alias set defined. */
6671 TYPE_ALIAS_SET (t
) = -1;
6673 /* Add the new type to the chain of variants of TYPE. */
6674 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6675 TYPE_NEXT_VARIANT (m
) = t
;
6676 TYPE_MAIN_VARIANT (t
) = m
;
6681 /* Return true if the from tree in both tree maps are equal. */
6684 tree_map_base_eq (const void *va
, const void *vb
)
6686 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6687 *const b
= (const struct tree_map_base
*) vb
;
6688 return (a
->from
== b
->from
);
6691 /* Hash a from tree in a tree_base_map. */
6694 tree_map_base_hash (const void *item
)
6696 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6699 /* Return true if this tree map structure is marked for garbage collection
6700 purposes. We simply return true if the from tree is marked, so that this
6701 structure goes away when the from tree goes away. */
6704 tree_map_base_marked_p (const void *p
)
6706 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6709 /* Hash a from tree in a tree_map. */
6712 tree_map_hash (const void *item
)
6714 return (((const struct tree_map
*) item
)->hash
);
6717 /* Hash a from tree in a tree_decl_map. */
6720 tree_decl_map_hash (const void *item
)
6722 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6725 /* Return the initialization priority for DECL. */
6728 decl_init_priority_lookup (tree decl
)
6730 symtab_node
*snode
= symtab_node::get (decl
);
6733 return DEFAULT_INIT_PRIORITY
;
6735 snode
->get_init_priority ();
6738 /* Return the finalization priority for DECL. */
6741 decl_fini_priority_lookup (tree decl
)
6743 cgraph_node
*node
= cgraph_node::get (decl
);
6746 return DEFAULT_INIT_PRIORITY
;
6748 node
->get_fini_priority ();
6751 /* Set the initialization priority for DECL to PRIORITY. */
6754 decl_init_priority_insert (tree decl
, priority_type priority
)
6756 struct symtab_node
*snode
;
6758 if (priority
== DEFAULT_INIT_PRIORITY
)
6760 snode
= symtab_node::get (decl
);
6764 else if (VAR_P (decl
))
6765 snode
= varpool_node::get_create (decl
);
6767 snode
= cgraph_node::get_create (decl
);
6768 snode
->set_init_priority (priority
);
6771 /* Set the finalization priority for DECL to PRIORITY. */
6774 decl_fini_priority_insert (tree decl
, priority_type priority
)
6776 struct cgraph_node
*node
;
6778 if (priority
== DEFAULT_INIT_PRIORITY
)
6780 node
= cgraph_node::get (decl
);
6785 node
= cgraph_node::get_create (decl
);
6786 node
->set_fini_priority (priority
);
6789 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6792 print_debug_expr_statistics (void)
6794 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6795 (long) debug_expr_for_decl
->size (),
6796 (long) debug_expr_for_decl
->elements (),
6797 debug_expr_for_decl
->collisions ());
6800 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6803 print_value_expr_statistics (void)
6805 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6806 (long) value_expr_for_decl
->size (),
6807 (long) value_expr_for_decl
->elements (),
6808 value_expr_for_decl
->collisions ());
6811 /* Lookup a debug expression for FROM, and return it if we find one. */
6814 decl_debug_expr_lookup (tree from
)
6816 struct tree_decl_map
*h
, in
;
6817 in
.base
.from
= from
;
6819 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6825 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6828 decl_debug_expr_insert (tree from
, tree to
)
6830 struct tree_decl_map
*h
;
6832 h
= ggc_alloc
<tree_decl_map
> ();
6833 h
->base
.from
= from
;
6835 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6838 /* Lookup a value expression for FROM, and return it if we find one. */
6841 decl_value_expr_lookup (tree from
)
6843 struct tree_decl_map
*h
, in
;
6844 in
.base
.from
= from
;
6846 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6852 /* Insert a mapping FROM->TO in the value expression hashtable. */
6855 decl_value_expr_insert (tree from
, tree to
)
6857 struct tree_decl_map
*h
;
6859 h
= ggc_alloc
<tree_decl_map
> ();
6860 h
->base
.from
= from
;
6862 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6865 /* Lookup a vector of debug arguments for FROM, and return it if we
6869 decl_debug_args_lookup (tree from
)
6871 struct tree_vec_map
*h
, in
;
6873 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6875 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6876 in
.base
.from
= from
;
6877 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6883 /* Insert a mapping FROM->empty vector of debug arguments in the value
6884 expression hashtable. */
6887 decl_debug_args_insert (tree from
)
6889 struct tree_vec_map
*h
;
6892 if (DECL_HAS_DEBUG_ARGS_P (from
))
6893 return decl_debug_args_lookup (from
);
6894 if (debug_args_for_decl
== NULL
)
6895 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6896 h
= ggc_alloc
<tree_vec_map
> ();
6897 h
->base
.from
= from
;
6899 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6901 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6905 /* Hashing of types so that we don't make duplicates.
6906 The entry point is `type_hash_canon'. */
6908 /* Generate the default hash code for TYPE. This is designed for
6909 speed, rather than maximum entropy. */
6912 type_hash_canon_hash (tree type
)
6914 inchash::hash hstate
;
6916 hstate
.add_int (TREE_CODE (type
));
6918 if (TREE_TYPE (type
))
6919 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6921 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6922 /* Just the identifier is adequate to distinguish. */
6923 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6925 switch (TREE_CODE (type
))
6928 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6931 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6932 if (TREE_VALUE (t
) != error_mark_node
)
6933 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6937 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6942 if (TYPE_DOMAIN (type
))
6943 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6944 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6946 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6947 hstate
.add_object (typeless
);
6954 tree t
= TYPE_MAX_VALUE (type
);
6956 t
= TYPE_MIN_VALUE (type
);
6957 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6958 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6963 case FIXED_POINT_TYPE
:
6965 unsigned prec
= TYPE_PRECISION (type
);
6966 hstate
.add_object (prec
);
6971 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6978 return hstate
.end ();
6981 /* These are the Hashtable callback functions. */
6983 /* Returns true iff the types are equivalent. */
6986 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6988 /* First test the things that are the same for all types. */
6989 if (a
->hash
!= b
->hash
6990 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6991 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6992 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6993 TYPE_ATTRIBUTES (b
->type
))
6994 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6995 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6998 /* Be careful about comparing arrays before and after the element type
6999 has been completed; don't compare TYPE_ALIGN unless both types are
7001 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7002 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7003 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7006 switch (TREE_CODE (a
->type
))
7011 case REFERENCE_TYPE
:
7016 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
7017 TYPE_VECTOR_SUBPARTS (b
->type
));
7020 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7021 && !(TYPE_VALUES (a
->type
)
7022 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7023 && TYPE_VALUES (b
->type
)
7024 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7025 && type_list_equal (TYPE_VALUES (a
->type
),
7026 TYPE_VALUES (b
->type
))))
7034 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7036 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7037 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7038 TYPE_MAX_VALUE (b
->type
)))
7039 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7040 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7041 TYPE_MIN_VALUE (b
->type
))));
7043 case FIXED_POINT_TYPE
:
7044 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7047 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7050 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7051 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7052 || (TYPE_ARG_TYPES (a
->type
)
7053 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7054 && TYPE_ARG_TYPES (b
->type
)
7055 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7056 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7057 TYPE_ARG_TYPES (b
->type
)))))
7061 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7062 where the flag should be inherited from the element type
7063 and can change after ARRAY_TYPEs are created; on non-aggregates
7064 compare it and hash it, scalars will never have that flag set
7065 and we need to differentiate between arrays created by different
7066 front-ends or middle-end created arrays. */
7067 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7068 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7069 || (TYPE_TYPELESS_STORAGE (a
->type
)
7070 == TYPE_TYPELESS_STORAGE (b
->type
))));
7074 case QUAL_UNION_TYPE
:
7075 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7076 || (TYPE_FIELDS (a
->type
)
7077 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7078 && TYPE_FIELDS (b
->type
)
7079 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7080 && type_list_equal (TYPE_FIELDS (a
->type
),
7081 TYPE_FIELDS (b
->type
))));
7084 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7085 || (TYPE_ARG_TYPES (a
->type
)
7086 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7087 && TYPE_ARG_TYPES (b
->type
)
7088 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7089 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7090 TYPE_ARG_TYPES (b
->type
))))
7098 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7099 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7104 /* Given TYPE, and HASHCODE its hash code, return the canonical
7105 object for an identical type if one already exists.
7106 Otherwise, return TYPE, and record it as the canonical object.
7108 To use this function, first create a type of the sort you want.
7109 Then compute its hash code from the fields of the type that
7110 make it different from other similar types.
7111 Then call this function and use the value. */
7114 type_hash_canon (unsigned int hashcode
, tree type
)
7119 /* The hash table only contains main variants, so ensure that's what we're
7121 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7123 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7124 must call that routine before comparing TYPE_ALIGNs. */
7130 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7133 tree t1
= ((type_hash
*) *loc
)->type
;
7134 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7136 if (TYPE_UID (type
) + 1 == next_type_uid
)
7138 /* Free also min/max values and the cache for integer
7139 types. This can't be done in free_node, as LTO frees
7140 those on its own. */
7141 if (TREE_CODE (type
) == INTEGER_TYPE
)
7143 if (TYPE_MIN_VALUE (type
)
7144 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7146 /* Zero is always in TYPE_CACHED_VALUES. */
7147 if (! TYPE_UNSIGNED (type
))
7148 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7149 ggc_free (TYPE_MIN_VALUE (type
));
7151 if (TYPE_MAX_VALUE (type
)
7152 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7154 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7155 ggc_free (TYPE_MAX_VALUE (type
));
7157 if (TYPE_CACHED_VALUES_P (type
))
7158 ggc_free (TYPE_CACHED_VALUES (type
));
7165 struct type_hash
*h
;
7167 h
= ggc_alloc
<type_hash
> ();
7177 print_type_hash_statistics (void)
7179 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7180 (long) type_hash_table
->size (),
7181 (long) type_hash_table
->elements (),
7182 type_hash_table
->collisions ());
7185 /* Given two lists of types
7186 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7187 return 1 if the lists contain the same types in the same order.
7188 Also, the TREE_PURPOSEs must match. */
7191 type_list_equal (const_tree l1
, const_tree l2
)
7195 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7196 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7197 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7198 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7199 && (TREE_TYPE (TREE_PURPOSE (t1
))
7200 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7206 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7207 given by TYPE. If the argument list accepts variable arguments,
7208 then this function counts only the ordinary arguments. */
7211 type_num_arguments (const_tree fntype
)
7215 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7216 /* If the function does not take a variable number of arguments,
7217 the last element in the list will have type `void'. */
7218 if (VOID_TYPE_P (TREE_VALUE (t
)))
7226 /* Return the type of the function TYPE's argument ARGNO if known.
7227 For vararg function's where ARGNO refers to one of the variadic
7228 arguments return null. Otherwise, return a void_type_node for
7229 out-of-bounds ARGNO. */
7232 type_argument_type (const_tree fntype
, unsigned argno
)
7234 /* Treat zero the same as an out-of-bounds argument number. */
7236 return void_type_node
;
7238 function_args_iterator iter
;
7242 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7244 /* A vararg function's argument list ends in a null. Otherwise,
7245 an ordinary function's argument list ends with void. Return
7246 null if ARGNO refers to a vararg argument, void_type_node if
7247 it's out of bounds, and the formal argument type otherwise. */
7251 if (i
== argno
|| VOID_TYPE_P (argtype
))
7260 /* Nonzero if integer constants T1 and T2
7261 represent the same constant value. */
7264 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7269 if (t1
== 0 || t2
== 0)
7272 STRIP_ANY_LOCATION_WRAPPER (t1
);
7273 STRIP_ANY_LOCATION_WRAPPER (t2
);
7275 if (TREE_CODE (t1
) == INTEGER_CST
7276 && TREE_CODE (t2
) == INTEGER_CST
7277 && wi::to_widest (t1
) == wi::to_widest (t2
))
7283 /* Return true if T is an INTEGER_CST whose numerical value (extended
7284 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7287 tree_fits_shwi_p (const_tree t
)
7289 return (t
!= NULL_TREE
7290 && TREE_CODE (t
) == INTEGER_CST
7291 && wi::fits_shwi_p (wi::to_widest (t
)));
7294 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7295 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7298 tree_fits_poly_int64_p (const_tree t
)
7302 if (POLY_INT_CST_P (t
))
7304 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7305 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7309 return (TREE_CODE (t
) == INTEGER_CST
7310 && wi::fits_shwi_p (wi::to_widest (t
)));
7313 /* Return true if T is an INTEGER_CST whose numerical value (extended
7314 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7317 tree_fits_uhwi_p (const_tree t
)
7319 return (t
!= NULL_TREE
7320 && TREE_CODE (t
) == INTEGER_CST
7321 && wi::fits_uhwi_p (wi::to_widest (t
)));
7324 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7325 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7328 tree_fits_poly_uint64_p (const_tree t
)
7332 if (POLY_INT_CST_P (t
))
7334 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7335 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7339 return (TREE_CODE (t
) == INTEGER_CST
7340 && wi::fits_uhwi_p (wi::to_widest (t
)));
7343 /* T is an INTEGER_CST whose numerical value (extended according to
7344 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7348 tree_to_shwi (const_tree t
)
7350 gcc_assert (tree_fits_shwi_p (t
));
7351 return TREE_INT_CST_LOW (t
);
7354 /* T is an INTEGER_CST whose numerical value (extended according to
7355 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7358 unsigned HOST_WIDE_INT
7359 tree_to_uhwi (const_tree t
)
7361 gcc_assert (tree_fits_uhwi_p (t
));
7362 return TREE_INT_CST_LOW (t
);
7365 /* Return the most significant (sign) bit of T. */
7368 tree_int_cst_sign_bit (const_tree t
)
7370 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7372 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7375 /* Return an indication of the sign of the integer constant T.
7376 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7377 Note that -1 will never be returned if T's type is unsigned. */
7380 tree_int_cst_sgn (const_tree t
)
7382 if (wi::to_wide (t
) == 0)
7384 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7386 else if (wi::neg_p (wi::to_wide (t
)))
7392 /* Return the minimum number of bits needed to represent VALUE in a
7393 signed or unsigned type, UNSIGNEDP says which. */
7396 tree_int_cst_min_precision (tree value
, signop sgn
)
7398 /* If the value is negative, compute its negative minus 1. The latter
7399 adjustment is because the absolute value of the largest negative value
7400 is one larger than the largest positive value. This is equivalent to
7401 a bit-wise negation, so use that operation instead. */
7403 if (tree_int_cst_sgn (value
) < 0)
7404 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7406 /* Return the number of bits needed, taking into account the fact
7407 that we need one more bit for a signed than unsigned type.
7408 If value is 0 or -1, the minimum precision is 1 no matter
7409 whether unsignedp is true or false. */
7411 if (integer_zerop (value
))
7414 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7417 /* Return truthvalue of whether T1 is the same tree structure as T2.
7418 Return 1 if they are the same.
7419 Return 0 if they are understandably different.
7420 Return -1 if either contains tree structure not understood by
7424 simple_cst_equal (const_tree t1
, const_tree t2
)
7426 enum tree_code code1
, code2
;
7432 if (t1
== 0 || t2
== 0)
7435 /* For location wrappers to be the same, they must be at the same
7436 source location (and wrap the same thing). */
7437 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7439 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7441 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7444 code1
= TREE_CODE (t1
);
7445 code2
= TREE_CODE (t2
);
7447 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7449 if (CONVERT_EXPR_CODE_P (code2
)
7450 || code2
== NON_LVALUE_EXPR
)
7451 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7453 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7456 else if (CONVERT_EXPR_CODE_P (code2
)
7457 || code2
== NON_LVALUE_EXPR
)
7458 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7466 return wi::to_widest (t1
) == wi::to_widest (t2
);
7469 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7472 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7475 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7476 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7477 TREE_STRING_LENGTH (t1
)));
7481 unsigned HOST_WIDE_INT idx
;
7482 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7483 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7485 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7488 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7489 /* ??? Should we handle also fields here? */
7490 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7496 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7499 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7502 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7505 const_tree arg1
, arg2
;
7506 const_call_expr_arg_iterator iter1
, iter2
;
7507 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7508 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7510 arg1
= next_const_call_expr_arg (&iter1
),
7511 arg2
= next_const_call_expr_arg (&iter2
))
7513 cmp
= simple_cst_equal (arg1
, arg2
);
7517 return arg1
== arg2
;
7521 /* Special case: if either target is an unallocated VAR_DECL,
7522 it means that it's going to be unified with whatever the
7523 TARGET_EXPR is really supposed to initialize, so treat it
7524 as being equivalent to anything. */
7525 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7526 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7527 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7528 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7529 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7530 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7533 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7538 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7540 case WITH_CLEANUP_EXPR
:
7541 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7545 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7548 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7549 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7560 if (POLY_INT_CST_P (t1
))
7561 /* A false return means maybe_ne rather than known_ne. */
7562 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7563 TYPE_SIGN (TREE_TYPE (t1
))),
7564 poly_widest_int::from (poly_int_cst_value (t2
),
7565 TYPE_SIGN (TREE_TYPE (t2
))));
7569 /* This general rule works for most tree codes. All exceptions should be
7570 handled above. If this is a language-specific tree code, we can't
7571 trust what might be in the operand, so say we don't know
7573 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7576 switch (TREE_CODE_CLASS (code1
))
7580 case tcc_comparison
:
7581 case tcc_expression
:
7585 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7587 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7599 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7600 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7601 than U, respectively. */
7604 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7606 if (tree_int_cst_sgn (t
) < 0)
7608 else if (!tree_fits_uhwi_p (t
))
7610 else if (TREE_INT_CST_LOW (t
) == u
)
7612 else if (TREE_INT_CST_LOW (t
) < u
)
7618 /* Return true if SIZE represents a constant size that is in bounds of
7619 what the middle-end and the backend accepts (covering not more than
7620 half of the address-space).
7621 When PERR is non-null, set *PERR on failure to the description of
7622 why SIZE is not valid. */
7625 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7627 if (POLY_INT_CST_P (size
))
7629 if (TREE_OVERFLOW (size
))
7631 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7632 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7637 cst_size_error error
;
7641 if (TREE_CODE (size
) != INTEGER_CST
)
7643 *perr
= cst_size_not_constant
;
7647 if (TREE_OVERFLOW_P (size
))
7649 *perr
= cst_size_overflow
;
7653 if (tree_int_cst_sgn (size
) < 0)
7655 *perr
= cst_size_negative
;
7658 if (!tree_fits_uhwi_p (size
)
7659 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7660 < wi::to_widest (size
) * 2))
7662 *perr
= cst_size_too_big
;
7669 /* Return the precision of the type, or for a complex or vector type the
7670 precision of the type of its elements. */
7673 element_precision (const_tree type
)
7676 type
= TREE_TYPE (type
);
7677 enum tree_code code
= TREE_CODE (type
);
7678 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7679 type
= TREE_TYPE (type
);
7681 return TYPE_PRECISION (type
);
7684 /* Return true if CODE represents an associative tree code. Otherwise
7687 associative_tree_code (enum tree_code code
)
7706 /* Return true if CODE represents a commutative tree code. Otherwise
7709 commutative_tree_code (enum tree_code code
)
7715 case MULT_HIGHPART_EXPR
:
7723 case UNORDERED_EXPR
:
7727 case TRUTH_AND_EXPR
:
7728 case TRUTH_XOR_EXPR
:
7730 case WIDEN_MULT_EXPR
:
7731 case VEC_WIDEN_MULT_HI_EXPR
:
7732 case VEC_WIDEN_MULT_LO_EXPR
:
7733 case VEC_WIDEN_MULT_EVEN_EXPR
:
7734 case VEC_WIDEN_MULT_ODD_EXPR
:
7743 /* Return true if CODE represents a ternary tree code for which the
7744 first two operands are commutative. Otherwise return false. */
7746 commutative_ternary_tree_code (enum tree_code code
)
7750 case WIDEN_MULT_PLUS_EXPR
:
7751 case WIDEN_MULT_MINUS_EXPR
:
7761 /* Returns true if CODE can overflow. */
7764 operation_can_overflow (enum tree_code code
)
7772 /* Can overflow in various ways. */
7774 case TRUNC_DIV_EXPR
:
7775 case EXACT_DIV_EXPR
:
7776 case FLOOR_DIV_EXPR
:
7778 /* For INT_MIN / -1. */
7785 /* These operators cannot overflow. */
7790 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7791 ftrapv doesn't generate trapping insns for CODE. */
7794 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7796 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7798 /* We don't generate instructions that trap on overflow for complex or vector
7800 if (!INTEGRAL_TYPE_P (type
))
7803 if (!TYPE_OVERFLOW_TRAPS (type
))
7813 /* These operators can overflow, and -ftrapv generates trapping code for
7816 case TRUNC_DIV_EXPR
:
7817 case EXACT_DIV_EXPR
:
7818 case FLOOR_DIV_EXPR
:
7821 /* These operators can overflow, but -ftrapv does not generate trapping
7825 /* These operators cannot overflow. */
7830 /* Constructors for pointer, array and function types.
7831 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7832 constructed by language-dependent code, not here.) */
7834 /* Construct, lay out and return the type of pointers to TO_TYPE with
7835 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7836 reference all of memory. If such a type has already been
7837 constructed, reuse it. */
7840 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7844 bool could_alias
= can_alias_all
;
7846 if (to_type
== error_mark_node
)
7847 return error_mark_node
;
7849 /* If the pointed-to type has the may_alias attribute set, force
7850 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7851 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7852 can_alias_all
= true;
7854 /* In some cases, languages will have things that aren't a POINTER_TYPE
7855 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7856 In that case, return that type without regard to the rest of our
7859 ??? This is a kludge, but consistent with the way this function has
7860 always operated and there doesn't seem to be a good way to avoid this
7862 if (TYPE_POINTER_TO (to_type
) != 0
7863 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7864 return TYPE_POINTER_TO (to_type
);
7866 /* First, if we already have a type for pointers to TO_TYPE and it's
7867 the proper mode, use it. */
7868 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7869 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7872 t
= make_node (POINTER_TYPE
);
7874 TREE_TYPE (t
) = to_type
;
7875 SET_TYPE_MODE (t
, mode
);
7876 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7877 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7878 TYPE_POINTER_TO (to_type
) = t
;
7880 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7881 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7882 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7883 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7885 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7888 /* Lay out the type. This function has many callers that are concerned
7889 with expression-construction, and this simplifies them all. */
7895 /* By default build pointers in ptr_mode. */
7898 build_pointer_type (tree to_type
)
7900 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7901 : TYPE_ADDR_SPACE (to_type
);
7902 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7903 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7906 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7909 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7913 bool could_alias
= can_alias_all
;
7915 if (to_type
== error_mark_node
)
7916 return error_mark_node
;
7918 /* If the pointed-to type has the may_alias attribute set, force
7919 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7920 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7921 can_alias_all
= true;
7923 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7924 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7925 In that case, return that type without regard to the rest of our
7928 ??? This is a kludge, but consistent with the way this function has
7929 always operated and there doesn't seem to be a good way to avoid this
7931 if (TYPE_REFERENCE_TO (to_type
) != 0
7932 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7933 return TYPE_REFERENCE_TO (to_type
);
7935 /* First, if we already have a type for pointers to TO_TYPE and it's
7936 the proper mode, use it. */
7937 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7938 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7941 t
= make_node (REFERENCE_TYPE
);
7943 TREE_TYPE (t
) = to_type
;
7944 SET_TYPE_MODE (t
, mode
);
7945 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7946 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7947 TYPE_REFERENCE_TO (to_type
) = t
;
7949 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7950 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7951 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7952 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7954 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7963 /* Build the node for the type of references-to-TO_TYPE by default
7967 build_reference_type (tree to_type
)
7969 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7970 : TYPE_ADDR_SPACE (to_type
);
7971 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7972 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7975 #define MAX_INT_CACHED_PREC \
7976 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7977 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7979 /* Builds a signed or unsigned integer type of precision PRECISION.
7980 Used for C bitfields whose precision does not match that of
7981 built-in target types. */
7983 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7989 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7991 if (precision
<= MAX_INT_CACHED_PREC
)
7993 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7998 itype
= make_node (INTEGER_TYPE
);
7999 TYPE_PRECISION (itype
) = precision
;
8002 fixup_unsigned_type (itype
);
8004 fixup_signed_type (itype
);
8006 inchash::hash hstate
;
8007 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8008 ret
= type_hash_canon (hstate
.end (), itype
);
8009 if (precision
<= MAX_INT_CACHED_PREC
)
8010 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8015 #define MAX_BOOL_CACHED_PREC \
8016 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8017 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8019 /* Builds a boolean type of precision PRECISION.
8020 Used for boolean vectors to choose proper vector element size. */
8022 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8026 if (precision
<= MAX_BOOL_CACHED_PREC
)
8028 type
= nonstandard_boolean_type_cache
[precision
];
8033 type
= make_node (BOOLEAN_TYPE
);
8034 TYPE_PRECISION (type
) = precision
;
8035 fixup_signed_type (type
);
8037 if (precision
<= MAX_INT_CACHED_PREC
)
8038 nonstandard_boolean_type_cache
[precision
] = type
;
8043 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8044 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8045 is true, reuse such a type that has already been constructed. */
8048 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8050 tree itype
= make_node (INTEGER_TYPE
);
8052 TREE_TYPE (itype
) = type
;
8054 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8055 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8057 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8058 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8059 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8060 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8061 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8062 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8063 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8068 if ((TYPE_MIN_VALUE (itype
)
8069 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8070 || (TYPE_MAX_VALUE (itype
)
8071 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8073 /* Since we cannot reliably merge this type, we need to compare it using
8074 structural equality checks. */
8075 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8079 hashval_t hash
= type_hash_canon_hash (itype
);
8080 itype
= type_hash_canon (hash
, itype
);
8085 /* Wrapper around build_range_type_1 with SHARED set to true. */
8088 build_range_type (tree type
, tree lowval
, tree highval
)
8090 return build_range_type_1 (type
, lowval
, highval
, true);
8093 /* Wrapper around build_range_type_1 with SHARED set to false. */
8096 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8098 return build_range_type_1 (type
, lowval
, highval
, false);
8101 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8102 MAXVAL should be the maximum value in the domain
8103 (one less than the length of the array).
8105 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8106 We don't enforce this limit, that is up to caller (e.g. language front end).
8107 The limit exists because the result is a signed type and we don't handle
8108 sizes that use more than one HOST_WIDE_INT. */
8111 build_index_type (tree maxval
)
8113 return build_range_type (sizetype
, size_zero_node
, maxval
);
8116 /* Return true if the debug information for TYPE, a subtype, should be emitted
8117 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8118 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8119 debug info and doesn't reflect the source code. */
8122 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8124 tree base_type
= TREE_TYPE (type
), low
, high
;
8126 /* Subrange types have a base type which is an integral type. */
8127 if (!INTEGRAL_TYPE_P (base_type
))
8130 /* Get the real bounds of the subtype. */
8131 if (lang_hooks
.types
.get_subrange_bounds
)
8132 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8135 low
= TYPE_MIN_VALUE (type
);
8136 high
= TYPE_MAX_VALUE (type
);
8139 /* If the type and its base type have the same representation and the same
8140 name, then the type is not a subrange but a copy of the base type. */
8141 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8142 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8143 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8144 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8145 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8146 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8156 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8157 and number of elements specified by the range of values of INDEX_TYPE.
8158 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8159 If SHARED is true, reuse such a type that has already been constructed.
8160 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8163 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8164 bool shared
, bool set_canonical
)
8168 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8170 error ("arrays of functions are not meaningful");
8171 elt_type
= integer_type_node
;
8174 t
= make_node (ARRAY_TYPE
);
8175 TREE_TYPE (t
) = elt_type
;
8176 TYPE_DOMAIN (t
) = index_type
;
8177 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8178 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8183 hashval_t hash
= type_hash_canon_hash (t
);
8184 t
= type_hash_canon (hash
, t
);
8187 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
8189 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8190 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8192 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8193 else if (TYPE_CANONICAL (elt_type
) != elt_type
8194 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8196 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8198 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8199 typeless_storage
, shared
, set_canonical
);
8205 /* Wrapper around build_array_type_1 with SHARED set to true. */
8208 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8211 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
8214 /* Wrapper around build_array_type_1 with SHARED set to false. */
8217 build_nonshared_array_type (tree elt_type
, tree index_type
)
8219 return build_array_type_1 (elt_type
, index_type
, false, false, true);
8222 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8226 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8228 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8231 /* Recursively examines the array elements of TYPE, until a non-array
8232 element type is found. */
8235 strip_array_types (tree type
)
8237 while (TREE_CODE (type
) == ARRAY_TYPE
)
8238 type
= TREE_TYPE (type
);
8243 /* Computes the canonical argument types from the argument type list
8246 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8247 on entry to this function, or if any of the ARGTYPES are
8250 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8251 true on entry to this function, or if any of the ARGTYPES are
8254 Returns a canonical argument list, which may be ARGTYPES when the
8255 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8256 true) or would not differ from ARGTYPES. */
8259 maybe_canonicalize_argtypes (tree argtypes
,
8260 bool *any_structural_p
,
8261 bool *any_noncanonical_p
)
8264 bool any_noncanonical_argtypes_p
= false;
8266 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8268 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8269 /* Fail gracefully by stating that the type is structural. */
8270 *any_structural_p
= true;
8271 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8272 *any_structural_p
= true;
8273 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8274 || TREE_PURPOSE (arg
))
8275 /* If the argument has a default argument, we consider it
8276 non-canonical even though the type itself is canonical.
8277 That way, different variants of function and method types
8278 with default arguments will all point to the variant with
8279 no defaults as their canonical type. */
8280 any_noncanonical_argtypes_p
= true;
8283 if (*any_structural_p
)
8286 if (any_noncanonical_argtypes_p
)
8288 /* Build the canonical list of argument types. */
8289 tree canon_argtypes
= NULL_TREE
;
8290 bool is_void
= false;
8292 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8294 if (arg
== void_list_node
)
8297 canon_argtypes
= tree_cons (NULL_TREE
,
8298 TYPE_CANONICAL (TREE_VALUE (arg
)),
8302 canon_argtypes
= nreverse (canon_argtypes
);
8304 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8306 /* There is a non-canonical type. */
8307 *any_noncanonical_p
= true;
8308 return canon_argtypes
;
8311 /* The canonical argument types are the same as ARGTYPES. */
8315 /* Construct, lay out and return
8316 the type of functions returning type VALUE_TYPE
8317 given arguments of types ARG_TYPES.
8318 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8319 are data type nodes for the arguments of the function.
8320 If such a type has already been constructed, reuse it. */
8323 build_function_type (tree value_type
, tree arg_types
)
8326 inchash::hash hstate
;
8327 bool any_structural_p
, any_noncanonical_p
;
8328 tree canon_argtypes
;
8330 gcc_assert (arg_types
!= error_mark_node
);
8332 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8334 error ("function return type cannot be function");
8335 value_type
= integer_type_node
;
8338 /* Make a node of the sort we want. */
8339 t
= make_node (FUNCTION_TYPE
);
8340 TREE_TYPE (t
) = value_type
;
8341 TYPE_ARG_TYPES (t
) = arg_types
;
8343 /* If we already have such a type, use the old one. */
8344 hashval_t hash
= type_hash_canon_hash (t
);
8345 t
= type_hash_canon (hash
, t
);
8347 /* Set up the canonical type. */
8348 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8349 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8350 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8352 &any_noncanonical_p
);
8353 if (any_structural_p
)
8354 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8355 else if (any_noncanonical_p
)
8356 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8359 if (!COMPLETE_TYPE_P (t
))
8364 /* Build a function type. The RETURN_TYPE is the type returned by the
8365 function. If VAARGS is set, no void_type_node is appended to the
8366 list. ARGP must be always be terminated be a NULL_TREE. */
8369 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8373 t
= va_arg (argp
, tree
);
8374 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8375 args
= tree_cons (NULL_TREE
, t
, args
);
8380 if (args
!= NULL_TREE
)
8381 args
= nreverse (args
);
8382 gcc_assert (last
!= void_list_node
);
8384 else if (args
== NULL_TREE
)
8385 args
= void_list_node
;
8389 args
= nreverse (args
);
8390 TREE_CHAIN (last
) = void_list_node
;
8392 args
= build_function_type (return_type
, args
);
8397 /* Build a function type. The RETURN_TYPE is the type returned by the
8398 function. If additional arguments are provided, they are
8399 additional argument types. The list of argument types must always
8400 be terminated by NULL_TREE. */
8403 build_function_type_list (tree return_type
, ...)
8408 va_start (p
, return_type
);
8409 args
= build_function_type_list_1 (false, return_type
, p
);
8414 /* Build a variable argument function type. The RETURN_TYPE is the
8415 type returned by the function. If additional arguments are provided,
8416 they are additional argument types. The list of argument types must
8417 always be terminated by NULL_TREE. */
8420 build_varargs_function_type_list (tree return_type
, ...)
8425 va_start (p
, return_type
);
8426 args
= build_function_type_list_1 (true, return_type
, p
);
8432 /* Build a function type. RETURN_TYPE is the type returned by the
8433 function; VAARGS indicates whether the function takes varargs. The
8434 function takes N named arguments, the types of which are provided in
8438 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8442 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8444 for (i
= n
- 1; i
>= 0; i
--)
8445 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8447 return build_function_type (return_type
, t
);
8450 /* Build a function type. RETURN_TYPE is the type returned by the
8451 function. The function takes N named arguments, the types of which
8452 are provided in ARG_TYPES. */
8455 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8457 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8460 /* Build a variable argument function type. RETURN_TYPE is the type
8461 returned by the function. The function takes N named arguments, the
8462 types of which are provided in ARG_TYPES. */
8465 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8467 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8470 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8471 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8472 for the method. An implicit additional parameter (of type
8473 pointer-to-BASETYPE) is added to the ARGTYPES. */
8476 build_method_type_directly (tree basetype
,
8482 bool any_structural_p
, any_noncanonical_p
;
8483 tree canon_argtypes
;
8485 /* Make a node of the sort we want. */
8486 t
= make_node (METHOD_TYPE
);
8488 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8489 TREE_TYPE (t
) = rettype
;
8490 ptype
= build_pointer_type (basetype
);
8492 /* The actual arglist for this function includes a "hidden" argument
8493 which is "this". Put it into the list of argument types. */
8494 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8495 TYPE_ARG_TYPES (t
) = argtypes
;
8497 /* If we already have such a type, use the old one. */
8498 hashval_t hash
= type_hash_canon_hash (t
);
8499 t
= type_hash_canon (hash
, t
);
8501 /* Set up the canonical type. */
8503 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8504 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8506 = (TYPE_CANONICAL (basetype
) != basetype
8507 || TYPE_CANONICAL (rettype
) != rettype
);
8508 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8510 &any_noncanonical_p
);
8511 if (any_structural_p
)
8512 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8513 else if (any_noncanonical_p
)
8515 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8516 TYPE_CANONICAL (rettype
),
8518 if (!COMPLETE_TYPE_P (t
))
8524 /* Construct, lay out and return the type of methods belonging to class
8525 BASETYPE and whose arguments and values are described by TYPE.
8526 If that type exists already, reuse it.
8527 TYPE must be a FUNCTION_TYPE node. */
8530 build_method_type (tree basetype
, tree type
)
8532 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8534 return build_method_type_directly (basetype
,
8536 TYPE_ARG_TYPES (type
));
8539 /* Construct, lay out and return the type of offsets to a value
8540 of type TYPE, within an object of type BASETYPE.
8541 If a suitable offset type exists already, reuse it. */
8544 build_offset_type (tree basetype
, tree type
)
8548 /* Make a node of the sort we want. */
8549 t
= make_node (OFFSET_TYPE
);
8551 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8552 TREE_TYPE (t
) = type
;
8554 /* If we already have such a type, use the old one. */
8555 hashval_t hash
= type_hash_canon_hash (t
);
8556 t
= type_hash_canon (hash
, t
);
8558 if (!COMPLETE_TYPE_P (t
))
8561 if (TYPE_CANONICAL (t
) == t
)
8563 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8564 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8565 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8566 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8567 || TYPE_CANONICAL (type
) != type
)
8569 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8570 TYPE_CANONICAL (type
));
8576 /* Create a complex type whose components are COMPONENT_TYPE.
8578 If NAMED is true, the type is given a TYPE_NAME. We do not always
8579 do so because this creates a DECL node and thus make the DECL_UIDs
8580 dependent on the type canonicalization hashtable, which is GC-ed,
8581 so the DECL_UIDs would not be stable wrt garbage collection. */
8584 build_complex_type (tree component_type
, bool named
)
8586 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8587 || SCALAR_FLOAT_TYPE_P (component_type
)
8588 || FIXED_POINT_TYPE_P (component_type
));
8590 /* Make a node of the sort we want. */
8591 tree probe
= make_node (COMPLEX_TYPE
);
8593 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8595 /* If we already have such a type, use the old one. */
8596 hashval_t hash
= type_hash_canon_hash (probe
);
8597 tree t
= type_hash_canon (hash
, probe
);
8601 /* We created a new type. The hash insertion will have laid
8602 out the type. We need to check the canonicalization and
8603 maybe set the name. */
8604 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8606 && TYPE_CANONICAL (t
) == t
);
8608 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8609 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8610 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8612 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8614 /* We need to create a name, since complex is a fundamental type. */
8617 const char *name
= NULL
;
8619 if (TREE_TYPE (t
) == char_type_node
)
8620 name
= "complex char";
8621 else if (TREE_TYPE (t
) == signed_char_type_node
)
8622 name
= "complex signed char";
8623 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8624 name
= "complex unsigned char";
8625 else if (TREE_TYPE (t
) == short_integer_type_node
)
8626 name
= "complex short int";
8627 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8628 name
= "complex short unsigned int";
8629 else if (TREE_TYPE (t
) == integer_type_node
)
8630 name
= "complex int";
8631 else if (TREE_TYPE (t
) == unsigned_type_node
)
8632 name
= "complex unsigned int";
8633 else if (TREE_TYPE (t
) == long_integer_type_node
)
8634 name
= "complex long int";
8635 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8636 name
= "complex long unsigned int";
8637 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8638 name
= "complex long long int";
8639 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8640 name
= "complex long long unsigned int";
8643 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8644 get_identifier (name
), t
);
8648 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8651 /* If TYPE is a real or complex floating-point type and the target
8652 does not directly support arithmetic on TYPE then return the wider
8653 type to be used for arithmetic on TYPE. Otherwise, return
8657 excess_precision_type (tree type
)
8659 /* The target can give two different responses to the question of
8660 which excess precision mode it would like depending on whether we
8661 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8663 enum excess_precision_type requested_type
8664 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8665 ? EXCESS_PRECISION_TYPE_FAST
8666 : EXCESS_PRECISION_TYPE_STANDARD
);
8668 enum flt_eval_method target_flt_eval_method
8669 = targetm
.c
.excess_precision (requested_type
);
8671 /* The target should not ask for unpredictable float evaluation (though
8672 it might advertise that implicitly the evaluation is unpredictable,
8673 but we don't care about that here, it will have been reported
8674 elsewhere). If it does ask for unpredictable evaluation, we have
8675 nothing to do here. */
8676 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8678 /* Nothing to do. The target has asked for all types we know about
8679 to be computed with their native precision and range. */
8680 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8683 /* The target will promote this type in a target-dependent way, so excess
8684 precision ought to leave it alone. */
8685 if (targetm
.promoted_type (type
) != NULL_TREE
)
8688 machine_mode float16_type_mode
= (float16_type_node
8689 ? TYPE_MODE (float16_type_node
)
8691 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8692 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8694 switch (TREE_CODE (type
))
8698 machine_mode type_mode
= TYPE_MODE (type
);
8699 switch (target_flt_eval_method
)
8701 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8702 if (type_mode
== float16_type_mode
)
8703 return float_type_node
;
8705 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8706 if (type_mode
== float16_type_mode
8707 || type_mode
== float_type_mode
)
8708 return double_type_node
;
8710 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8711 if (type_mode
== float16_type_mode
8712 || type_mode
== float_type_mode
8713 || type_mode
== double_type_mode
)
8714 return long_double_type_node
;
8723 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8725 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8726 switch (target_flt_eval_method
)
8728 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8729 if (type_mode
== float16_type_mode
)
8730 return complex_float_type_node
;
8732 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8733 if (type_mode
== float16_type_mode
8734 || type_mode
== float_type_mode
)
8735 return complex_double_type_node
;
8737 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8738 if (type_mode
== float16_type_mode
8739 || type_mode
== float_type_mode
8740 || type_mode
== double_type_mode
)
8741 return complex_long_double_type_node
;
8755 /* Return OP, stripped of any conversions to wider types as much as is safe.
8756 Converting the value back to OP's type makes a value equivalent to OP.
8758 If FOR_TYPE is nonzero, we return a value which, if converted to
8759 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8761 OP must have integer, real or enumeral type. Pointers are not allowed!
8763 There are some cases where the obvious value we could return
8764 would regenerate to OP if converted to OP's type,
8765 but would not extend like OP to wider types.
8766 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8767 For example, if OP is (unsigned short)(signed char)-1,
8768 we avoid returning (signed char)-1 if FOR_TYPE is int,
8769 even though extending that to an unsigned short would regenerate OP,
8770 since the result of extending (signed char)-1 to (int)
8771 is different from (int) OP. */
8774 get_unwidened (tree op
, tree for_type
)
8776 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8777 tree type
= TREE_TYPE (op
);
8779 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8781 = (for_type
!= 0 && for_type
!= type
8782 && final_prec
> TYPE_PRECISION (type
)
8783 && TYPE_UNSIGNED (type
));
8786 while (CONVERT_EXPR_P (op
))
8790 /* TYPE_PRECISION on vector types has different meaning
8791 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8792 so avoid them here. */
8793 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8796 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8797 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8799 /* Truncations are many-one so cannot be removed.
8800 Unless we are later going to truncate down even farther. */
8802 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8805 /* See what's inside this conversion. If we decide to strip it,
8807 op
= TREE_OPERAND (op
, 0);
8809 /* If we have not stripped any zero-extensions (uns is 0),
8810 we can strip any kind of extension.
8811 If we have previously stripped a zero-extension,
8812 only zero-extensions can safely be stripped.
8813 Any extension can be stripped if the bits it would produce
8814 are all going to be discarded later by truncating to FOR_TYPE. */
8818 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8820 /* TYPE_UNSIGNED says whether this is a zero-extension.
8821 Let's avoid computing it if it does not affect WIN
8822 and if UNS will not be needed again. */
8824 || CONVERT_EXPR_P (op
))
8825 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8833 /* If we finally reach a constant see if it fits in sth smaller and
8834 in that case convert it. */
8835 if (TREE_CODE (win
) == INTEGER_CST
)
8837 tree wtype
= TREE_TYPE (win
);
8838 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8840 prec
= MAX (prec
, final_prec
);
8841 if (prec
< TYPE_PRECISION (wtype
))
8843 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8844 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8845 win
= fold_convert (t
, win
);
8852 /* Return OP or a simpler expression for a narrower value
8853 which can be sign-extended or zero-extended to give back OP.
8854 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8855 or 0 if the value should be sign-extended. */
8858 get_narrower (tree op
, int *unsignedp_ptr
)
8863 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8865 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8868 op
= TREE_OPERAND (op
, 1);
8869 while (TREE_CODE (op
) == COMPOUND_EXPR
);
8870 tree ret
= get_narrower (op
, unsignedp_ptr
);
8873 auto_vec
<tree
, 16> v
;
8875 for (op
= win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8876 op
= TREE_OPERAND (op
, 1))
8878 FOR_EACH_VEC_ELT_REVERSE (v
, i
, op
)
8879 ret
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8880 TREE_TYPE (ret
), TREE_OPERAND (op
, 0),
8884 while (TREE_CODE (op
) == NOP_EXPR
)
8887 = (TYPE_PRECISION (TREE_TYPE (op
))
8888 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8890 /* Truncations are many-one so cannot be removed. */
8894 /* See what's inside this conversion. If we decide to strip it,
8899 op
= TREE_OPERAND (op
, 0);
8900 /* An extension: the outermost one can be stripped,
8901 but remember whether it is zero or sign extension. */
8903 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8904 /* Otherwise, if a sign extension has been stripped,
8905 only sign extensions can now be stripped;
8906 if a zero extension has been stripped, only zero-extensions. */
8907 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8911 else /* bitschange == 0 */
8913 /* A change in nominal type can always be stripped, but we must
8914 preserve the unsignedness. */
8916 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8918 op
= TREE_OPERAND (op
, 0);
8919 /* Keep trying to narrow, but don't assign op to win if it
8920 would turn an integral type into something else. */
8921 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8928 if (TREE_CODE (op
) == COMPONENT_REF
8929 /* Since type_for_size always gives an integer type. */
8930 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8931 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8932 /* Ensure field is laid out already. */
8933 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8934 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8936 unsigned HOST_WIDE_INT innerprec
8937 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8938 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8939 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8940 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8942 /* We can get this structure field in a narrower type that fits it,
8943 but the resulting extension to its nominal type (a fullword type)
8944 must satisfy the same conditions as for other extensions.
8946 Do this only for fields that are aligned (not bit-fields),
8947 because when bit-field insns will be used there is no
8948 advantage in doing this. */
8950 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8951 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8952 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8956 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8957 win
= fold_convert (type
, op
);
8961 *unsignedp_ptr
= uns
;
8965 /* Return true if integer constant C has a value that is permissible
8966 for TYPE, an integral type. */
8969 int_fits_type_p (const_tree c
, const_tree type
)
8971 tree type_low_bound
, type_high_bound
;
8972 bool ok_for_low_bound
, ok_for_high_bound
;
8973 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8975 /* Non-standard boolean types can have arbitrary precision but various
8976 transformations assume that they can only take values 0 and +/-1. */
8977 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8978 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8981 type_low_bound
= TYPE_MIN_VALUE (type
);
8982 type_high_bound
= TYPE_MAX_VALUE (type
);
8984 /* If at least one bound of the type is a constant integer, we can check
8985 ourselves and maybe make a decision. If no such decision is possible, but
8986 this type is a subtype, try checking against that. Otherwise, use
8987 fits_to_tree_p, which checks against the precision.
8989 Compute the status for each possibly constant bound, and return if we see
8990 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8991 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8992 for "constant known to fit". */
8994 /* Check if c >= type_low_bound. */
8995 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8997 if (tree_int_cst_lt (c
, type_low_bound
))
8999 ok_for_low_bound
= true;
9002 ok_for_low_bound
= false;
9004 /* Check if c <= type_high_bound. */
9005 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9007 if (tree_int_cst_lt (type_high_bound
, c
))
9009 ok_for_high_bound
= true;
9012 ok_for_high_bound
= false;
9014 /* If the constant fits both bounds, the result is known. */
9015 if (ok_for_low_bound
&& ok_for_high_bound
)
9018 /* Perform some generic filtering which may allow making a decision
9019 even if the bounds are not constant. First, negative integers
9020 never fit in unsigned types, */
9021 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9024 /* Second, narrower types always fit in wider ones. */
9025 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9028 /* Third, unsigned integers with top bit set never fit signed types. */
9029 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9031 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9032 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9034 /* When a tree_cst is converted to a wide-int, the precision
9035 is taken from the type. However, if the precision of the
9036 mode underneath the type is smaller than that, it is
9037 possible that the value will not fit. The test below
9038 fails if any bit is set between the sign bit of the
9039 underlying mode and the top bit of the type. */
9040 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9043 else if (wi::neg_p (wi::to_wide (c
)))
9047 /* If we haven't been able to decide at this point, there nothing more we
9048 can check ourselves here. Look at the base type if we have one and it
9049 has the same precision. */
9050 if (TREE_CODE (type
) == INTEGER_TYPE
9051 && TREE_TYPE (type
) != 0
9052 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9054 type
= TREE_TYPE (type
);
9058 /* Or to fits_to_tree_p, if nothing else. */
9059 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9062 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9063 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9064 represented (assuming two's-complement arithmetic) within the bit
9065 precision of the type are returned instead. */
9068 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9070 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9071 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9072 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9075 if (TYPE_UNSIGNED (type
))
9076 mpz_set_ui (min
, 0);
9079 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9080 wi::to_mpz (mn
, min
, SIGNED
);
9084 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9085 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9086 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9089 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9090 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9094 /* Return true if VAR is an automatic variable. */
9097 auto_var_p (const_tree var
)
9099 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9100 || TREE_CODE (var
) == PARM_DECL
)
9101 && ! TREE_STATIC (var
))
9102 || TREE_CODE (var
) == RESULT_DECL
);
9105 /* Return true if VAR is an automatic variable defined in function FN. */
9108 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9110 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9111 && (auto_var_p (var
)
9112 || TREE_CODE (var
) == LABEL_DECL
));
9115 /* Subprogram of following function. Called by walk_tree.
9117 Return *TP if it is an automatic variable or parameter of the
9118 function passed in as DATA. */
9121 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9123 tree fn
= (tree
) data
;
9128 else if (DECL_P (*tp
)
9129 && auto_var_in_fn_p (*tp
, fn
))
9135 /* Returns true if T is, contains, or refers to a type with variable
9136 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9137 arguments, but not the return type. If FN is nonzero, only return
9138 true if a modifier of the type or position of FN is a variable or
9139 parameter inside FN.
9141 This concept is more general than that of C99 'variably modified types':
9142 in C99, a struct type is never variably modified because a VLA may not
9143 appear as a structure member. However, in GNU C code like:
9145 struct S { int i[f()]; };
9147 is valid, and other languages may define similar constructs. */
9150 variably_modified_type_p (tree type
, tree fn
)
9154 /* Test if T is either variable (if FN is zero) or an expression containing
9155 a variable in FN. If TYPE isn't gimplified, return true also if
9156 gimplify_one_sizepos would gimplify the expression into a local
9158 #define RETURN_TRUE_IF_VAR(T) \
9159 do { tree _t = (T); \
9160 if (_t != NULL_TREE \
9161 && _t != error_mark_node \
9162 && !CONSTANT_CLASS_P (_t) \
9163 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9165 || (!TYPE_SIZES_GIMPLIFIED (type) \
9166 && (TREE_CODE (_t) != VAR_DECL \
9167 && !CONTAINS_PLACEHOLDER_P (_t))) \
9168 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9169 return true; } while (0)
9171 if (type
== error_mark_node
)
9174 /* If TYPE itself has variable size, it is variably modified. */
9175 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9176 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9178 switch (TREE_CODE (type
))
9181 case REFERENCE_TYPE
:
9183 /* Ada can have pointer types refering to themselves indirectly. */
9184 if (TREE_VISITED (type
))
9186 TREE_VISITED (type
) = true;
9187 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9189 TREE_VISITED (type
) = false;
9192 TREE_VISITED (type
) = false;
9197 /* If TYPE is a function type, it is variably modified if the
9198 return type is variably modified. */
9199 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9205 case FIXED_POINT_TYPE
:
9208 /* Scalar types are variably modified if their end points
9210 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9211 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9216 case QUAL_UNION_TYPE
:
9217 /* We can't see if any of the fields are variably-modified by the
9218 definition we normally use, since that would produce infinite
9219 recursion via pointers. */
9220 /* This is variably modified if some field's type is. */
9221 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9222 if (TREE_CODE (t
) == FIELD_DECL
)
9224 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9225 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9226 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9228 /* If the type is a qualified union, then the DECL_QUALIFIER
9229 of fields can also be an expression containing a variable. */
9230 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9231 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9233 /* If the field is a qualified union, then it's only a container
9234 for what's inside so we look into it. That's necessary in LTO
9235 mode because the sizes of the field tested above have been set
9236 to PLACEHOLDER_EXPRs by free_lang_data. */
9237 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
9238 && variably_modified_type_p (TREE_TYPE (t
), fn
))
9244 /* Do not call ourselves to avoid infinite recursion. This is
9245 variably modified if the element type is. */
9246 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9247 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9254 /* The current language may have other cases to check, but in general,
9255 all other types are not variably modified. */
9256 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9258 #undef RETURN_TRUE_IF_VAR
9261 /* Given a DECL or TYPE, return the scope in which it was declared, or
9262 NULL_TREE if there is no containing scope. */
9265 get_containing_scope (const_tree t
)
9267 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9270 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9273 get_ultimate_context (const_tree decl
)
9275 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9277 if (TREE_CODE (decl
) == BLOCK
)
9278 decl
= BLOCK_SUPERCONTEXT (decl
);
9280 decl
= get_containing_scope (decl
);
9285 /* Return the innermost context enclosing DECL that is
9286 a FUNCTION_DECL, or zero if none. */
9289 decl_function_context (const_tree decl
)
9293 if (TREE_CODE (decl
) == ERROR_MARK
)
9296 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9297 where we look up the function at runtime. Such functions always take
9298 a first argument of type 'pointer to real context'.
9300 C++ should really be fixed to use DECL_CONTEXT for the real context,
9301 and use something else for the "virtual context". */
9302 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9305 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9307 context
= DECL_CONTEXT (decl
);
9309 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9311 if (TREE_CODE (context
) == BLOCK
)
9312 context
= BLOCK_SUPERCONTEXT (context
);
9314 context
= get_containing_scope (context
);
9320 /* Return the innermost context enclosing DECL that is
9321 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9322 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9325 decl_type_context (const_tree decl
)
9327 tree context
= DECL_CONTEXT (decl
);
9330 switch (TREE_CODE (context
))
9332 case NAMESPACE_DECL
:
9333 case TRANSLATION_UNIT_DECL
:
9338 case QUAL_UNION_TYPE
:
9343 context
= DECL_CONTEXT (context
);
9347 context
= BLOCK_SUPERCONTEXT (context
);
9357 /* CALL is a CALL_EXPR. Return the declaration for the function
9358 called, or NULL_TREE if the called function cannot be
9362 get_callee_fndecl (const_tree call
)
9366 if (call
== error_mark_node
)
9367 return error_mark_node
;
9369 /* It's invalid to call this function with anything but a
9371 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9373 /* The first operand to the CALL is the address of the function
9375 addr
= CALL_EXPR_FN (call
);
9377 /* If there is no function, return early. */
9378 if (addr
== NULL_TREE
)
9383 /* If this is a readonly function pointer, extract its initial value. */
9384 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9385 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9386 && DECL_INITIAL (addr
))
9387 addr
= DECL_INITIAL (addr
);
9389 /* If the address is just `&f' for some function `f', then we know
9390 that `f' is being called. */
9391 if (TREE_CODE (addr
) == ADDR_EXPR
9392 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9393 return TREE_OPERAND (addr
, 0);
9395 /* We couldn't figure out what was being called. */
9399 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9400 return the associated function code, otherwise return CFN_LAST. */
9403 get_call_combined_fn (const_tree call
)
9405 /* It's invalid to call this function with anything but a CALL_EXPR. */
9406 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9408 if (!CALL_EXPR_FN (call
))
9409 return as_combined_fn (CALL_EXPR_IFN (call
));
9411 tree fndecl
= get_callee_fndecl (call
);
9412 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9413 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9418 /* Comparator of indices based on tree_node_counts. */
9421 tree_nodes_cmp (const void *p1
, const void *p2
)
9423 const unsigned *n1
= (const unsigned *)p1
;
9424 const unsigned *n2
= (const unsigned *)p2
;
9426 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9429 /* Comparator of indices based on tree_code_counts. */
9432 tree_codes_cmp (const void *p1
, const void *p2
)
9434 const unsigned *n1
= (const unsigned *)p1
;
9435 const unsigned *n2
= (const unsigned *)p2
;
9437 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9440 #define TREE_MEM_USAGE_SPACES 40
9442 /* Print debugging information about tree nodes generated during the compile,
9443 and any language-specific information. */
9446 dump_tree_statistics (void)
9448 if (GATHER_STATISTICS
)
9450 uint64_t total_nodes
, total_bytes
;
9451 fprintf (stderr
, "\nKind Nodes Bytes\n");
9452 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9453 total_nodes
= total_bytes
= 0;
9456 auto_vec
<unsigned> indices (all_kinds
);
9457 for (unsigned i
= 0; i
< all_kinds
; i
++)
9458 indices
.quick_push (i
);
9459 indices
.qsort (tree_nodes_cmp
);
9461 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9463 unsigned j
= indices
[i
];
9464 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9465 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
9466 SIZE_AMOUNT (tree_node_sizes
[j
]));
9467 total_nodes
+= tree_node_counts
[j
];
9468 total_bytes
+= tree_node_sizes
[j
];
9470 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9471 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9472 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9473 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9477 fprintf (stderr
, "Code Nodes\n");
9478 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9480 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9481 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9482 indices
.quick_push (i
);
9483 indices
.qsort (tree_codes_cmp
);
9485 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9487 unsigned j
= indices
[i
];
9488 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9489 get_tree_code_name ((enum tree_code
) j
),
9490 SIZE_AMOUNT (tree_code_counts
[j
]));
9492 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9493 fprintf (stderr
, "\n");
9494 ssanames_print_statistics ();
9495 fprintf (stderr
, "\n");
9496 phinodes_print_statistics ();
9497 fprintf (stderr
, "\n");
9501 fprintf (stderr
, "(No per-node statistics)\n");
9503 print_type_hash_statistics ();
9504 print_debug_expr_statistics ();
9505 print_value_expr_statistics ();
9506 lang_hooks
.print_statistics ();
9509 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9511 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9514 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9516 /* This relies on the raw feedback's top 4 bits being zero. */
9517 #define FEEDBACK(X) ((X) * 0x04c11db7)
9518 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9519 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9520 static const unsigned syndromes
[16] =
9522 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9523 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9524 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9525 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9530 value
<<= (32 - bytes
* 8);
9531 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9533 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9535 chksum
= (chksum
<< 4) ^ feedback
;
9541 /* Generate a crc32 of a string. */
9544 crc32_string (unsigned chksum
, const char *string
)
9547 chksum
= crc32_byte (chksum
, *string
);
9552 /* P is a string that will be used in a symbol. Mask out any characters
9553 that are not valid in that context. */
9556 clean_symbol_name (char *p
)
9560 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9563 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9570 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9572 /* Create a unique anonymous identifier. The identifier is still a
9573 valid assembly label. */
9579 #if !defined (NO_DOT_IN_LABEL)
9581 #elif !defined (NO_DOLLAR_IN_LABEL)
9589 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9590 gcc_checking_assert (len
< int (sizeof (buf
)));
9592 tree id
= get_identifier_with_length (buf
, len
);
9593 IDENTIFIER_ANON_P (id
) = true;
9598 /* Generate a name for a special-purpose function.
9599 The generated name may need to be unique across the whole link.
9600 Changes to this function may also require corresponding changes to
9601 xstrdup_mask_random.
9602 TYPE is some string to identify the purpose of this function to the
9603 linker or collect2; it must start with an uppercase letter,
9605 I - for constructors
9607 N - for C++ anonymous namespaces
9608 F - for DWARF unwind frame information. */
9611 get_file_function_name (const char *type
)
9617 /* If we already have a name we know to be unique, just use that. */
9618 if (first_global_object_name
)
9619 p
= q
= ASTRDUP (first_global_object_name
);
9620 /* If the target is handling the constructors/destructors, they
9621 will be local to this file and the name is only necessary for
9623 We also assign sub_I and sub_D sufixes to constructors called from
9624 the global static constructors. These are always local. */
9625 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9626 || (strncmp (type
, "sub_", 4) == 0
9627 && (type
[4] == 'I' || type
[4] == 'D')))
9629 const char *file
= main_input_filename
;
9631 file
= LOCATION_FILE (input_location
);
9632 /* Just use the file's basename, because the full pathname
9633 might be quite long. */
9634 p
= q
= ASTRDUP (lbasename (file
));
9638 /* Otherwise, the name must be unique across the entire link.
9639 We don't have anything that we know to be unique to this translation
9640 unit, so use what we do have and throw in some randomness. */
9642 const char *name
= weak_global_object_name
;
9643 const char *file
= main_input_filename
;
9648 file
= LOCATION_FILE (input_location
);
9650 len
= strlen (file
);
9651 q
= (char *) alloca (9 + 19 + len
+ 1);
9652 memcpy (q
, file
, len
+ 1);
9654 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9655 crc32_string (0, name
), get_random_seed (false));
9660 clean_symbol_name (q
);
9661 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9664 /* Set up the name of the file-level functions we may need.
9665 Use a global object (which is already required to be unique over
9666 the program) rather than the file name (which imposes extra
9668 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9670 return get_identifier (buf
);
9673 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9675 /* Complain that the tree code of NODE does not match the expected 0
9676 terminated list of trailing codes. The trailing code list can be
9677 empty, for a more vague error message. FILE, LINE, and FUNCTION
9678 are of the caller. */
9681 tree_check_failed (const_tree node
, const char *file
,
9682 int line
, const char *function
, ...)
9686 unsigned length
= 0;
9687 enum tree_code code
;
9689 va_start (args
, function
);
9690 while ((code
= (enum tree_code
) va_arg (args
, int)))
9691 length
+= 4 + strlen (get_tree_code_name (code
));
9696 va_start (args
, function
);
9697 length
+= strlen ("expected ");
9698 buffer
= tmp
= (char *) alloca (length
);
9700 while ((code
= (enum tree_code
) va_arg (args
, int)))
9702 const char *prefix
= length
? " or " : "expected ";
9704 strcpy (tmp
+ length
, prefix
);
9705 length
+= strlen (prefix
);
9706 strcpy (tmp
+ length
, get_tree_code_name (code
));
9707 length
+= strlen (get_tree_code_name (code
));
9712 buffer
= "unexpected node";
9714 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9715 buffer
, get_tree_code_name (TREE_CODE (node
)),
9716 function
, trim_filename (file
), line
);
9719 /* Complain that the tree code of NODE does match the expected 0
9720 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9724 tree_not_check_failed (const_tree node
, const char *file
,
9725 int line
, const char *function
, ...)
9729 unsigned length
= 0;
9730 enum tree_code code
;
9732 va_start (args
, function
);
9733 while ((code
= (enum tree_code
) va_arg (args
, int)))
9734 length
+= 4 + strlen (get_tree_code_name (code
));
9736 va_start (args
, function
);
9737 buffer
= (char *) alloca (length
);
9739 while ((code
= (enum tree_code
) va_arg (args
, int)))
9743 strcpy (buffer
+ length
, " or ");
9746 strcpy (buffer
+ length
, get_tree_code_name (code
));
9747 length
+= strlen (get_tree_code_name (code
));
9751 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9752 buffer
, get_tree_code_name (TREE_CODE (node
)),
9753 function
, trim_filename (file
), line
);
9756 /* Similar to tree_check_failed, except that we check for a class of tree
9757 code, given in CL. */
9760 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9761 const char *file
, int line
, const char *function
)
9764 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9765 TREE_CODE_CLASS_STRING (cl
),
9766 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9767 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9770 /* Similar to tree_check_failed, except that instead of specifying a
9771 dozen codes, use the knowledge that they're all sequential. */
9774 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9775 const char *function
, enum tree_code c1
,
9779 unsigned length
= 0;
9782 for (c
= c1
; c
<= c2
; ++c
)
9783 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9785 length
+= strlen ("expected ");
9786 buffer
= (char *) alloca (length
);
9789 for (c
= c1
; c
<= c2
; ++c
)
9791 const char *prefix
= length
? " or " : "expected ";
9793 strcpy (buffer
+ length
, prefix
);
9794 length
+= strlen (prefix
);
9795 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9796 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9799 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9800 buffer
, get_tree_code_name (TREE_CODE (node
)),
9801 function
, trim_filename (file
), line
);
9805 /* Similar to tree_check_failed, except that we check that a tree does
9806 not have the specified code, given in CL. */
9809 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9810 const char *file
, int line
, const char *function
)
9813 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9814 TREE_CODE_CLASS_STRING (cl
),
9815 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9816 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9820 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9823 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9824 const char *function
, enum omp_clause_code code
)
9826 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9828 omp_clause_code_name
[code
],
9829 get_tree_code_name (TREE_CODE (node
)),
9830 function
, trim_filename (file
), line
);
9834 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9837 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9838 const char *function
, enum omp_clause_code c1
,
9839 enum omp_clause_code c2
)
9842 unsigned length
= 0;
9845 for (c
= c1
; c
<= c2
; ++c
)
9846 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9848 length
+= strlen ("expected ");
9849 buffer
= (char *) alloca (length
);
9852 for (c
= c1
; c
<= c2
; ++c
)
9854 const char *prefix
= length
? " or " : "expected ";
9856 strcpy (buffer
+ length
, prefix
);
9857 length
+= strlen (prefix
);
9858 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9859 length
+= strlen (omp_clause_code_name
[c
]);
9862 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9863 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9864 function
, trim_filename (file
), line
);
9868 #undef DEFTREESTRUCT
9869 #define DEFTREESTRUCT(VAL, NAME) NAME,
9871 static const char *ts_enum_names
[] = {
9872 #include "treestruct.def"
9874 #undef DEFTREESTRUCT
9876 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9878 /* Similar to tree_class_check_failed, except that we check for
9879 whether CODE contains the tree structure identified by EN. */
9882 tree_contains_struct_check_failed (const_tree node
,
9883 const enum tree_node_structure_enum en
,
9884 const char *file
, int line
,
9885 const char *function
)
9888 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9890 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9894 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9895 (dynamically sized) vector. */
9898 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9899 const char *function
)
9902 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
9904 idx
+ 1, len
, function
, trim_filename (file
), line
);
9907 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9908 (dynamically sized) vector. */
9911 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9912 const char *function
)
9915 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
9916 idx
+ 1, len
, function
, trim_filename (file
), line
);
9919 /* Similar to above, except that the check is for the bounds of the operand
9920 vector of an expression node EXP. */
9923 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9924 int line
, const char *function
)
9926 enum tree_code code
= TREE_CODE (exp
);
9928 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9929 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9930 function
, trim_filename (file
), line
);
9933 /* Similar to above, except that the check is for the number of
9934 operands of an OMP_CLAUSE node. */
9937 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9938 int line
, const char *function
)
9941 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
9942 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9943 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9944 trim_filename (file
), line
);
9946 #endif /* ENABLE_TREE_CHECKING */
9948 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9949 and mapped to the machine mode MODE. Initialize its fields and build
9950 the information necessary for debugging output. */
9953 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9956 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9958 t
= make_node (VECTOR_TYPE
);
9959 TREE_TYPE (t
) = mv_innertype
;
9960 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9961 SET_TYPE_MODE (t
, mode
);
9963 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9964 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9965 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9966 || mode
!= VOIDmode
)
9967 && !VECTOR_BOOLEAN_TYPE_P (t
))
9969 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9973 hashval_t hash
= type_hash_canon_hash (t
);
9974 t
= type_hash_canon (hash
, t
);
9976 /* We have built a main variant, based on the main variant of the
9977 inner type. Use it to build the variant we return. */
9978 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9979 && TREE_TYPE (t
) != innertype
)
9980 return build_type_attribute_qual_variant (t
,
9981 TYPE_ATTRIBUTES (innertype
),
9982 TYPE_QUALS (innertype
));
9988 make_or_reuse_type (unsigned size
, int unsignedp
)
9992 if (size
== INT_TYPE_SIZE
)
9993 return unsignedp
? unsigned_type_node
: integer_type_node
;
9994 if (size
== CHAR_TYPE_SIZE
)
9995 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9996 if (size
== SHORT_TYPE_SIZE
)
9997 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9998 if (size
== LONG_TYPE_SIZE
)
9999 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10000 if (size
== LONG_LONG_TYPE_SIZE
)
10001 return (unsignedp
? long_long_unsigned_type_node
10002 : long_long_integer_type_node
);
10004 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10005 if (size
== int_n_data
[i
].bitsize
10006 && int_n_enabled_p
[i
])
10007 return (unsignedp
? int_n_trees
[i
].unsigned_type
10008 : int_n_trees
[i
].signed_type
);
10011 return make_unsigned_type (size
);
10013 return make_signed_type (size
);
10016 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10019 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10023 if (size
== SHORT_FRACT_TYPE_SIZE
)
10024 return unsignedp
? sat_unsigned_short_fract_type_node
10025 : sat_short_fract_type_node
;
10026 if (size
== FRACT_TYPE_SIZE
)
10027 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10028 if (size
== LONG_FRACT_TYPE_SIZE
)
10029 return unsignedp
? sat_unsigned_long_fract_type_node
10030 : sat_long_fract_type_node
;
10031 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10032 return unsignedp
? sat_unsigned_long_long_fract_type_node
10033 : sat_long_long_fract_type_node
;
10037 if (size
== SHORT_FRACT_TYPE_SIZE
)
10038 return unsignedp
? unsigned_short_fract_type_node
10039 : short_fract_type_node
;
10040 if (size
== FRACT_TYPE_SIZE
)
10041 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10042 if (size
== LONG_FRACT_TYPE_SIZE
)
10043 return unsignedp
? unsigned_long_fract_type_node
10044 : long_fract_type_node
;
10045 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10046 return unsignedp
? unsigned_long_long_fract_type_node
10047 : long_long_fract_type_node
;
10050 return make_fract_type (size
, unsignedp
, satp
);
10053 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10056 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10060 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10061 return unsignedp
? sat_unsigned_short_accum_type_node
10062 : sat_short_accum_type_node
;
10063 if (size
== ACCUM_TYPE_SIZE
)
10064 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10065 if (size
== LONG_ACCUM_TYPE_SIZE
)
10066 return unsignedp
? sat_unsigned_long_accum_type_node
10067 : sat_long_accum_type_node
;
10068 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10069 return unsignedp
? sat_unsigned_long_long_accum_type_node
10070 : sat_long_long_accum_type_node
;
10074 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10075 return unsignedp
? unsigned_short_accum_type_node
10076 : short_accum_type_node
;
10077 if (size
== ACCUM_TYPE_SIZE
)
10078 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10079 if (size
== LONG_ACCUM_TYPE_SIZE
)
10080 return unsignedp
? unsigned_long_accum_type_node
10081 : long_accum_type_node
;
10082 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10083 return unsignedp
? unsigned_long_long_accum_type_node
10084 : long_long_accum_type_node
;
10087 return make_accum_type (size
, unsignedp
, satp
);
10091 /* Create an atomic variant node for TYPE. This routine is called
10092 during initialization of data types to create the 5 basic atomic
10093 types. The generic build_variant_type function requires these to
10094 already be set up in order to function properly, so cannot be
10095 called from there. If ALIGN is non-zero, then ensure alignment is
10096 overridden to this value. */
10099 build_atomic_base (tree type
, unsigned int align
)
10103 /* Make sure its not already registered. */
10104 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10107 t
= build_variant_type_copy (type
);
10108 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10111 SET_TYPE_ALIGN (t
, align
);
10116 /* Information about the _FloatN and _FloatNx types. This must be in
10117 the same order as the corresponding TI_* enum values. */
10118 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10130 /* Create nodes for all integer types (and error_mark_node) using the sizes
10131 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10134 build_common_tree_nodes (bool signed_char
)
10138 error_mark_node
= make_node (ERROR_MARK
);
10139 TREE_TYPE (error_mark_node
) = error_mark_node
;
10141 initialize_sizetypes ();
10143 /* Define both `signed char' and `unsigned char'. */
10144 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10145 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10146 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10147 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10149 /* Define `char', which is like either `signed char' or `unsigned char'
10150 but not the same as either. */
10153 ? make_signed_type (CHAR_TYPE_SIZE
)
10154 : make_unsigned_type (CHAR_TYPE_SIZE
));
10155 TYPE_STRING_FLAG (char_type_node
) = 1;
10157 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10158 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10159 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10160 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10161 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10162 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10163 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10164 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10166 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10168 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10169 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10171 if (int_n_enabled_p
[i
])
10173 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10174 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10178 /* Define a boolean type. This type only represents boolean values but
10179 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10180 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10181 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10182 TYPE_PRECISION (boolean_type_node
) = 1;
10183 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10185 /* Define what type to use for size_t. */
10186 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10187 size_type_node
= unsigned_type_node
;
10188 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10189 size_type_node
= long_unsigned_type_node
;
10190 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10191 size_type_node
= long_long_unsigned_type_node
;
10192 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10193 size_type_node
= short_unsigned_type_node
;
10198 size_type_node
= NULL_TREE
;
10199 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10200 if (int_n_enabled_p
[i
])
10202 char name
[50], altname
[50];
10203 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10204 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10206 if (strcmp (name
, SIZE_TYPE
) == 0
10207 || strcmp (altname
, SIZE_TYPE
) == 0)
10209 size_type_node
= int_n_trees
[i
].unsigned_type
;
10212 if (size_type_node
== NULL_TREE
)
10213 gcc_unreachable ();
10216 /* Define what type to use for ptrdiff_t. */
10217 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10218 ptrdiff_type_node
= integer_type_node
;
10219 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10220 ptrdiff_type_node
= long_integer_type_node
;
10221 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10222 ptrdiff_type_node
= long_long_integer_type_node
;
10223 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10224 ptrdiff_type_node
= short_integer_type_node
;
10227 ptrdiff_type_node
= NULL_TREE
;
10228 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10229 if (int_n_enabled_p
[i
])
10231 char name
[50], altname
[50];
10232 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10233 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10235 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10236 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10237 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10239 if (ptrdiff_type_node
== NULL_TREE
)
10240 gcc_unreachable ();
10243 /* Fill in the rest of the sized types. Reuse existing type nodes
10245 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10246 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10247 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10248 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10249 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10251 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10252 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10253 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10254 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10255 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10257 /* Don't call build_qualified type for atomics. That routine does
10258 special processing for atomics, and until they are initialized
10259 it's better not to make that call.
10261 Check to see if there is a target override for atomic types. */
10263 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10264 targetm
.atomic_align_for_mode (QImode
));
10265 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10266 targetm
.atomic_align_for_mode (HImode
));
10267 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10268 targetm
.atomic_align_for_mode (SImode
));
10269 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10270 targetm
.atomic_align_for_mode (DImode
));
10271 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10272 targetm
.atomic_align_for_mode (TImode
));
10274 access_public_node
= get_identifier ("public");
10275 access_protected_node
= get_identifier ("protected");
10276 access_private_node
= get_identifier ("private");
10278 /* Define these next since types below may used them. */
10279 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10280 integer_one_node
= build_int_cst (integer_type_node
, 1);
10281 integer_three_node
= build_int_cst (integer_type_node
, 3);
10282 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10284 size_zero_node
= size_int (0);
10285 size_one_node
= size_int (1);
10286 bitsize_zero_node
= bitsize_int (0);
10287 bitsize_one_node
= bitsize_int (1);
10288 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10290 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10291 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10293 void_type_node
= make_node (VOID_TYPE
);
10294 layout_type (void_type_node
);
10296 /* We are not going to have real types in C with less than byte alignment,
10297 so we might as well not have any types that claim to have it. */
10298 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10299 TYPE_USER_ALIGN (void_type_node
) = 0;
10301 void_node
= make_node (VOID_CST
);
10302 TREE_TYPE (void_node
) = void_type_node
;
10304 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10305 layout_type (TREE_TYPE (null_pointer_node
));
10307 ptr_type_node
= build_pointer_type (void_type_node
);
10308 const_ptr_type_node
10309 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10310 for (unsigned i
= 0;
10311 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10313 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10315 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10317 float_type_node
= make_node (REAL_TYPE
);
10318 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10319 layout_type (float_type_node
);
10321 double_type_node
= make_node (REAL_TYPE
);
10322 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10323 layout_type (double_type_node
);
10325 long_double_type_node
= make_node (REAL_TYPE
);
10326 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10327 layout_type (long_double_type_node
);
10329 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10331 int n
= floatn_nx_types
[i
].n
;
10332 bool extended
= floatn_nx_types
[i
].extended
;
10333 scalar_float_mode mode
;
10334 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10336 int precision
= GET_MODE_PRECISION (mode
);
10337 /* Work around the rs6000 KFmode having precision 113 not
10339 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10340 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10341 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10343 gcc_assert (min_precision
== n
);
10344 if (precision
< min_precision
)
10345 precision
= min_precision
;
10346 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10347 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10348 layout_type (FLOATN_NX_TYPE_NODE (i
));
10349 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10352 float_ptr_type_node
= build_pointer_type (float_type_node
);
10353 double_ptr_type_node
= build_pointer_type (double_type_node
);
10354 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10355 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10357 /* Fixed size integer types. */
10358 uint16_type_node
= make_or_reuse_type (16, 1);
10359 uint32_type_node
= make_or_reuse_type (32, 1);
10360 uint64_type_node
= make_or_reuse_type (64, 1);
10361 if (targetm
.scalar_mode_supported_p (TImode
))
10362 uint128_type_node
= make_or_reuse_type (128, 1);
10364 /* Decimal float types. */
10365 if (targetm
.decimal_float_supported_p ())
10367 dfloat32_type_node
= make_node (REAL_TYPE
);
10368 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10369 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10370 layout_type (dfloat32_type_node
);
10372 dfloat64_type_node
= make_node (REAL_TYPE
);
10373 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10374 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10375 layout_type (dfloat64_type_node
);
10377 dfloat128_type_node
= make_node (REAL_TYPE
);
10378 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10379 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10380 layout_type (dfloat128_type_node
);
10383 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10384 complex_float_type_node
= build_complex_type (float_type_node
, true);
10385 complex_double_type_node
= build_complex_type (double_type_node
, true);
10386 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10389 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10391 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10392 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10393 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10396 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10397 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10398 sat_ ## KIND ## _type_node = \
10399 make_sat_signed_ ## KIND ## _type (SIZE); \
10400 sat_unsigned_ ## KIND ## _type_node = \
10401 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10402 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10403 unsigned_ ## KIND ## _type_node = \
10404 make_unsigned_ ## KIND ## _type (SIZE);
10406 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10407 sat_ ## WIDTH ## KIND ## _type_node = \
10408 make_sat_signed_ ## KIND ## _type (SIZE); \
10409 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10410 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10411 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10412 unsigned_ ## WIDTH ## KIND ## _type_node = \
10413 make_unsigned_ ## KIND ## _type (SIZE);
10415 /* Make fixed-point type nodes based on four different widths. */
10416 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10417 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10418 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10419 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10420 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10422 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10423 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10424 NAME ## _type_node = \
10425 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10426 u ## NAME ## _type_node = \
10427 make_or_reuse_unsigned_ ## KIND ## _type \
10428 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10429 sat_ ## NAME ## _type_node = \
10430 make_or_reuse_sat_signed_ ## KIND ## _type \
10431 (GET_MODE_BITSIZE (MODE ## mode)); \
10432 sat_u ## NAME ## _type_node = \
10433 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10434 (GET_MODE_BITSIZE (U ## MODE ## mode));
10436 /* Fixed-point type and mode nodes. */
10437 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10438 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10439 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10440 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10441 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10442 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10443 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10444 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10445 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10446 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10447 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10450 tree t
= targetm
.build_builtin_va_list ();
10452 /* Many back-ends define record types without setting TYPE_NAME.
10453 If we copied the record type here, we'd keep the original
10454 record type without a name. This breaks name mangling. So,
10455 don't copy record types and let c_common_nodes_and_builtins()
10456 declare the type to be __builtin_va_list. */
10457 if (TREE_CODE (t
) != RECORD_TYPE
)
10458 t
= build_variant_type_copy (t
);
10460 va_list_type_node
= t
;
10463 /* SCEV analyzer global shared trees. */
10464 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10465 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10466 chrec_known
= make_node (SCEV_KNOWN
);
10467 TREE_TYPE (chrec_known
) = void_type_node
;
10470 /* Modify DECL for given flags.
10471 TM_PURE attribute is set only on types, so the function will modify
10472 DECL's type when ECF_TM_PURE is used. */
10475 set_call_expr_flags (tree decl
, int flags
)
10477 if (flags
& ECF_NOTHROW
)
10478 TREE_NOTHROW (decl
) = 1;
10479 if (flags
& ECF_CONST
)
10480 TREE_READONLY (decl
) = 1;
10481 if (flags
& ECF_PURE
)
10482 DECL_PURE_P (decl
) = 1;
10483 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10484 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10485 if (flags
& ECF_NOVOPS
)
10486 DECL_IS_NOVOPS (decl
) = 1;
10487 if (flags
& ECF_NORETURN
)
10488 TREE_THIS_VOLATILE (decl
) = 1;
10489 if (flags
& ECF_MALLOC
)
10490 DECL_IS_MALLOC (decl
) = 1;
10491 if (flags
& ECF_RETURNS_TWICE
)
10492 DECL_IS_RETURNS_TWICE (decl
) = 1;
10493 if (flags
& ECF_LEAF
)
10494 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10495 NULL
, DECL_ATTRIBUTES (decl
));
10496 if (flags
& ECF_COLD
)
10497 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10498 NULL
, DECL_ATTRIBUTES (decl
));
10499 if (flags
& ECF_RET1
)
10500 DECL_ATTRIBUTES (decl
)
10501 = tree_cons (get_identifier ("fn spec"),
10502 build_tree_list (NULL_TREE
, build_string (1, "1")),
10503 DECL_ATTRIBUTES (decl
));
10504 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10505 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10506 /* Looping const or pure is implied by noreturn.
10507 There is currently no way to declare looping const or looping pure alone. */
10508 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10509 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10513 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10516 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10517 const char *library_name
, int ecf_flags
)
10521 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10522 library_name
, NULL_TREE
);
10523 set_call_expr_flags (decl
, ecf_flags
);
10525 set_builtin_decl (code
, decl
, true);
10528 /* Call this function after instantiating all builtins that the language
10529 front end cares about. This will build the rest of the builtins
10530 and internal functions that are relied upon by the tree optimizers and
10534 build_common_builtin_nodes (void)
10539 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10540 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10542 ftype
= build_function_type (void_type_node
, void_list_node
);
10543 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10544 local_define_builtin ("__builtin_unreachable", ftype
,
10545 BUILT_IN_UNREACHABLE
,
10546 "__builtin_unreachable",
10547 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10548 | ECF_CONST
| ECF_COLD
);
10549 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10550 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10552 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10555 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10556 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10558 ftype
= build_function_type_list (ptr_type_node
,
10559 ptr_type_node
, const_ptr_type_node
,
10560 size_type_node
, NULL_TREE
);
10562 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10563 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10564 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10565 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10566 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10567 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10570 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10572 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10573 const_ptr_type_node
, size_type_node
,
10575 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10576 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10579 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10581 ftype
= build_function_type_list (ptr_type_node
,
10582 ptr_type_node
, integer_type_node
,
10583 size_type_node
, NULL_TREE
);
10584 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10585 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10588 /* If we're checking the stack, `alloca' can throw. */
10589 const int alloca_flags
10590 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10592 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10594 ftype
= build_function_type_list (ptr_type_node
,
10595 size_type_node
, NULL_TREE
);
10596 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10597 "alloca", alloca_flags
);
10600 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10601 size_type_node
, NULL_TREE
);
10602 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10603 BUILT_IN_ALLOCA_WITH_ALIGN
,
10604 "__builtin_alloca_with_align",
10607 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10608 size_type_node
, size_type_node
, NULL_TREE
);
10609 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10610 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10611 "__builtin_alloca_with_align_and_max",
10614 ftype
= build_function_type_list (void_type_node
,
10615 ptr_type_node
, ptr_type_node
,
10616 ptr_type_node
, NULL_TREE
);
10617 local_define_builtin ("__builtin_init_trampoline", ftype
,
10618 BUILT_IN_INIT_TRAMPOLINE
,
10619 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10620 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10621 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10622 "__builtin_init_heap_trampoline",
10623 ECF_NOTHROW
| ECF_LEAF
);
10624 local_define_builtin ("__builtin_init_descriptor", ftype
,
10625 BUILT_IN_INIT_DESCRIPTOR
,
10626 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10628 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10629 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10630 BUILT_IN_ADJUST_TRAMPOLINE
,
10631 "__builtin_adjust_trampoline",
10632 ECF_CONST
| ECF_NOTHROW
);
10633 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10634 BUILT_IN_ADJUST_DESCRIPTOR
,
10635 "__builtin_adjust_descriptor",
10636 ECF_CONST
| ECF_NOTHROW
);
10638 ftype
= build_function_type_list (void_type_node
,
10639 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10640 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10641 BUILT_IN_NONLOCAL_GOTO
,
10642 "__builtin_nonlocal_goto",
10643 ECF_NORETURN
| ECF_NOTHROW
);
10645 ftype
= build_function_type_list (void_type_node
,
10646 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10647 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10648 BUILT_IN_SETJMP_SETUP
,
10649 "__builtin_setjmp_setup", ECF_NOTHROW
);
10651 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10652 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10653 BUILT_IN_SETJMP_RECEIVER
,
10654 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10656 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10657 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10658 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10660 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10661 local_define_builtin ("__builtin_stack_restore", ftype
,
10662 BUILT_IN_STACK_RESTORE
,
10663 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10665 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10666 const_ptr_type_node
, size_type_node
,
10668 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10669 "__builtin_memcmp_eq",
10670 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10672 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10673 "__builtin_strncmp_eq",
10674 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10676 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10677 "__builtin_strcmp_eq",
10678 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10680 /* If there's a possibility that we might use the ARM EABI, build the
10681 alternate __cxa_end_cleanup node used to resume from C++. */
10682 if (targetm
.arm_eabi_unwinder
)
10684 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10685 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10686 BUILT_IN_CXA_END_CLEANUP
,
10687 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10690 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10691 local_define_builtin ("__builtin_unwind_resume", ftype
,
10692 BUILT_IN_UNWIND_RESUME
,
10693 ((targetm_common
.except_unwind_info (&global_options
)
10695 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10698 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10700 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10702 local_define_builtin ("__builtin_return_address", ftype
,
10703 BUILT_IN_RETURN_ADDRESS
,
10704 "__builtin_return_address",
10708 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10709 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10711 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10712 ptr_type_node
, NULL_TREE
);
10713 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10714 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10715 BUILT_IN_PROFILE_FUNC_ENTER
,
10716 "__cyg_profile_func_enter", 0);
10717 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10718 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10719 BUILT_IN_PROFILE_FUNC_EXIT
,
10720 "__cyg_profile_func_exit", 0);
10723 /* The exception object and filter values from the runtime. The argument
10724 must be zero before exception lowering, i.e. from the front end. After
10725 exception lowering, it will be the region number for the exception
10726 landing pad. These functions are PURE instead of CONST to prevent
10727 them from being hoisted past the exception edge that will initialize
10728 its value in the landing pad. */
10729 ftype
= build_function_type_list (ptr_type_node
,
10730 integer_type_node
, NULL_TREE
);
10731 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10732 /* Only use TM_PURE if we have TM language support. */
10733 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10734 ecf_flags
|= ECF_TM_PURE
;
10735 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10736 "__builtin_eh_pointer", ecf_flags
);
10738 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10739 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10740 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10741 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10743 ftype
= build_function_type_list (void_type_node
,
10744 integer_type_node
, integer_type_node
,
10746 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10747 BUILT_IN_EH_COPY_VALUES
,
10748 "__builtin_eh_copy_values", ECF_NOTHROW
);
10750 /* Complex multiplication and division. These are handled as builtins
10751 rather than optabs because emit_library_call_value doesn't support
10752 complex. Further, we can do slightly better with folding these
10753 beasties if the real and complex parts of the arguments are separate. */
10757 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10759 char mode_name_buf
[4], *q
;
10761 enum built_in_function mcode
, dcode
;
10762 tree type
, inner_type
;
10763 const char *prefix
= "__";
10765 if (targetm
.libfunc_gnu_prefix
)
10768 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10771 inner_type
= TREE_TYPE (type
);
10773 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10774 inner_type
, inner_type
, NULL_TREE
);
10776 mcode
= ((enum built_in_function
)
10777 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10778 dcode
= ((enum built_in_function
)
10779 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10781 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10785 /* For -ftrapping-math these should throw from a former
10786 -fnon-call-exception stmt. */
10787 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10789 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10790 built_in_names
[mcode
],
10791 ECF_CONST
| ECF_LEAF
);
10793 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10795 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10796 built_in_names
[dcode
],
10797 ECF_CONST
| ECF_LEAF
);
10801 init_internal_fns ();
10804 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10807 If we requested a pointer to a vector, build up the pointers that
10808 we stripped off while looking for the inner type. Similarly for
10809 return values from functions.
10811 The argument TYPE is the top of the chain, and BOTTOM is the
10812 new type which we will point to. */
10815 reconstruct_complex_type (tree type
, tree bottom
)
10819 if (TREE_CODE (type
) == POINTER_TYPE
)
10821 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10822 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10823 TYPE_REF_CAN_ALIAS_ALL (type
));
10825 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10827 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10828 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10829 TYPE_REF_CAN_ALIAS_ALL (type
));
10831 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10833 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10834 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10836 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10838 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10839 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10841 else if (TREE_CODE (type
) == METHOD_TYPE
)
10843 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10844 /* The build_method_type_directly() routine prepends 'this' to argument list,
10845 so we must compensate by getting rid of it. */
10847 = build_method_type_directly
10848 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10850 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10852 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10854 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10855 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10860 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10861 TYPE_QUALS (type
));
10864 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10867 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10870 unsigned int bitsize
;
10872 switch (GET_MODE_CLASS (mode
))
10874 case MODE_VECTOR_BOOL
:
10875 case MODE_VECTOR_INT
:
10876 case MODE_VECTOR_FLOAT
:
10877 case MODE_VECTOR_FRACT
:
10878 case MODE_VECTOR_UFRACT
:
10879 case MODE_VECTOR_ACCUM
:
10880 case MODE_VECTOR_UACCUM
:
10881 nunits
= GET_MODE_NUNITS (mode
);
10885 /* Check that there are no leftover bits. */
10886 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10887 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10888 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10892 gcc_unreachable ();
10895 return make_vector_type (innertype
, nunits
, mode
);
10898 /* Similarly, but takes the inner type and number of units, which must be
10902 build_vector_type (tree innertype
, poly_int64 nunits
)
10904 return make_vector_type (innertype
, nunits
, VOIDmode
);
10907 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10910 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
10912 gcc_assert (mask_mode
!= BLKmode
);
10914 poly_uint64 vsize
= GET_MODE_BITSIZE (mask_mode
);
10915 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10916 tree bool_type
= build_nonstandard_boolean_type (esize
);
10918 return make_vector_type (bool_type
, nunits
, mask_mode
);
10921 /* Build a vector type that holds one boolean result for each element of
10922 vector type VECTYPE. The public interface for this operation is
10926 build_truth_vector_type_for (tree vectype
)
10928 machine_mode vector_mode
= TYPE_MODE (vectype
);
10929 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
10931 machine_mode mask_mode
;
10932 if (VECTOR_MODE_P (vector_mode
)
10933 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
10934 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
10936 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
10937 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10938 tree bool_type
= build_nonstandard_boolean_type (esize
);
10940 return make_vector_type (bool_type
, nunits
, BLKmode
);
10943 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10947 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10949 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10951 /* We always build the non-opaque variant before the opaque one,
10952 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10953 cand
= TYPE_NEXT_VARIANT (t
);
10955 && TYPE_VECTOR_OPAQUE (cand
)
10956 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10958 /* Othewise build a variant type and make sure to queue it after
10959 the non-opaque type. */
10960 cand
= build_distinct_type_copy (t
);
10961 TYPE_VECTOR_OPAQUE (cand
) = true;
10962 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10963 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10964 TYPE_NEXT_VARIANT (t
) = cand
;
10965 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10969 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10972 vector_cst_int_elt (const_tree t
, unsigned int i
)
10974 /* First handle elements that are directly encoded. */
10975 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10976 if (i
< encoded_nelts
)
10977 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10979 /* Identify the pattern that contains element I and work out the index of
10980 the last encoded element for that pattern. */
10981 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10982 unsigned int pattern
= i
% npatterns
;
10983 unsigned int count
= i
/ npatterns
;
10984 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10986 /* If there are no steps, the final encoded value is the right one. */
10987 if (!VECTOR_CST_STEPPED_P (t
))
10988 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10990 /* Otherwise work out the value from the last two encoded elements. */
10991 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10992 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10993 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10994 return wi::to_wide (v2
) + (count
- 2) * diff
;
10997 /* Return the value of element I of VECTOR_CST T. */
11000 vector_cst_elt (const_tree t
, unsigned int i
)
11002 /* First handle elements that are directly encoded. */
11003 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11004 if (i
< encoded_nelts
)
11005 return VECTOR_CST_ENCODED_ELT (t
, i
);
11007 /* If there are no steps, the final encoded value is the right one. */
11008 if (!VECTOR_CST_STEPPED_P (t
))
11010 /* Identify the pattern that contains element I and work out the index of
11011 the last encoded element for that pattern. */
11012 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11013 unsigned int pattern
= i
% npatterns
;
11014 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11015 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11018 /* Otherwise work out the value from the last two encoded elements. */
11019 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11020 vector_cst_int_elt (t
, i
));
11023 /* Given an initializer INIT, return TRUE if INIT is zero or some
11024 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11025 null, set *NONZERO if and only if INIT is known not to be all
11026 zeros. The combination of return value of false and *NONZERO
11027 false implies that INIT may but need not be all zeros. Other
11028 combinations indicate definitive answers. */
11031 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11037 /* Conservatively clear NONZERO and set it only if INIT is definitely
11043 unsigned HOST_WIDE_INT off
= 0;
11045 switch (TREE_CODE (init
))
11048 if (integer_zerop (init
))
11055 /* ??? Note that this is not correct for C4X float formats. There,
11056 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11057 negative exponent. */
11058 if (real_zerop (init
)
11059 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11066 if (fixed_zerop (init
))
11073 if (integer_zerop (init
)
11074 || (real_zerop (init
)
11075 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11076 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11083 if (VECTOR_CST_NPATTERNS (init
) == 1
11084 && VECTOR_CST_DUPLICATE_P (init
)
11085 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11093 if (TREE_CLOBBER_P (init
))
11096 unsigned HOST_WIDE_INT idx
;
11099 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11100 if (!initializer_zerop (elt
, nonzero
))
11108 tree arg
= TREE_OPERAND (init
, 0);
11109 if (TREE_CODE (arg
) != ADDR_EXPR
)
11111 tree offset
= TREE_OPERAND (init
, 1);
11112 if (TREE_CODE (offset
) != INTEGER_CST
11113 || !tree_fits_uhwi_p (offset
))
11115 off
= tree_to_uhwi (offset
);
11118 arg
= TREE_OPERAND (arg
, 0);
11119 if (TREE_CODE (arg
) != STRING_CST
)
11123 /* Fall through. */
11127 gcc_assert (off
<= INT_MAX
);
11130 int n
= TREE_STRING_LENGTH (init
);
11134 /* We need to loop through all elements to handle cases like
11135 "\0" and "\0foobar". */
11136 for (i
= 0; i
< n
; ++i
)
11137 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11151 /* Return true if EXPR is an initializer expression in which every element
11152 is a constant that is numerically equal to 0 or 1. The elements do not
11153 need to be equal to each other. */
11156 initializer_each_zero_or_onep (const_tree expr
)
11158 STRIP_ANY_LOCATION_WRAPPER (expr
);
11160 switch (TREE_CODE (expr
))
11163 return integer_zerop (expr
) || integer_onep (expr
);
11166 return real_zerop (expr
) || real_onep (expr
);
11170 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11171 if (VECTOR_CST_STEPPED_P (expr
)
11172 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11175 for (unsigned int i
= 0; i
< nelts
; ++i
)
11177 tree elt
= vector_cst_elt (expr
, i
);
11178 if (!initializer_each_zero_or_onep (elt
))
11190 /* Check if vector VEC consists of all the equal elements and
11191 that the number of elements corresponds to the type of VEC.
11192 The function returns first element of the vector
11193 or NULL_TREE if the vector is not uniform. */
11195 uniform_vector_p (const_tree vec
)
11198 unsigned HOST_WIDE_INT i
, nelts
;
11200 if (vec
== NULL_TREE
)
11203 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11205 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11206 return TREE_OPERAND (vec
, 0);
11208 else if (TREE_CODE (vec
) == VECTOR_CST
)
11210 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11211 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11215 else if (TREE_CODE (vec
) == CONSTRUCTOR
11216 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11218 first
= error_mark_node
;
11220 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11227 if (!operand_equal_p (first
, t
, 0))
11239 /* If the argument is INTEGER_CST, return it. If the argument is vector
11240 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11242 Look through location wrappers. */
11245 uniform_integer_cst_p (tree t
)
11247 STRIP_ANY_LOCATION_WRAPPER (t
);
11249 if (TREE_CODE (t
) == INTEGER_CST
)
11252 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11254 t
= uniform_vector_p (t
);
11255 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11262 /* If VECTOR_CST T has a single nonzero element, return the index of that
11263 element, otherwise return -1. */
11266 single_nonzero_element (const_tree t
)
11268 unsigned HOST_WIDE_INT nelts
;
11269 unsigned int repeat_nelts
;
11270 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11271 repeat_nelts
= nelts
;
11272 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11274 nelts
= vector_cst_encoded_nelts (t
);
11275 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11281 for (unsigned int i
= 0; i
< nelts
; ++i
)
11283 tree elt
= vector_cst_elt (t
, i
);
11284 if (!integer_zerop (elt
) && !real_zerop (elt
))
11286 if (res
>= 0 || i
>= repeat_nelts
)
11294 /* Build an empty statement at location LOC. */
11297 build_empty_stmt (location_t loc
)
11299 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11300 SET_EXPR_LOCATION (t
, loc
);
11305 /* Build an OpenMP clause with code CODE. LOC is the location of the
11309 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11314 length
= omp_clause_num_ops
[code
];
11315 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11317 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11319 t
= (tree
) ggc_internal_alloc (size
);
11320 memset (t
, 0, size
);
11321 TREE_SET_CODE (t
, OMP_CLAUSE
);
11322 OMP_CLAUSE_SET_CODE (t
, code
);
11323 OMP_CLAUSE_LOCATION (t
) = loc
;
11328 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11329 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11330 Except for the CODE and operand count field, other storage for the
11331 object is initialized to zeros. */
11334 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11337 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11339 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11340 gcc_assert (len
>= 1);
11342 record_node_allocation_statistics (code
, length
);
11344 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11346 TREE_SET_CODE (t
, code
);
11348 /* Can't use TREE_OPERAND to store the length because if checking is
11349 enabled, it will try to check the length before we store it. :-P */
11350 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11355 /* Helper function for build_call_* functions; build a CALL_EXPR with
11356 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11357 the argument slots. */
11360 build_call_1 (tree return_type
, tree fn
, int nargs
)
11364 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11365 TREE_TYPE (t
) = return_type
;
11366 CALL_EXPR_FN (t
) = fn
;
11367 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11372 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11373 FN and a null static chain slot. NARGS is the number of call arguments
11374 which are specified as "..." arguments. */
11377 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11381 va_start (args
, nargs
);
11382 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11387 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11388 FN and a null static chain slot. NARGS is the number of call arguments
11389 which are specified as a va_list ARGS. */
11392 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11397 t
= build_call_1 (return_type
, fn
, nargs
);
11398 for (i
= 0; i
< nargs
; i
++)
11399 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11400 process_call_operands (t
);
11404 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11405 FN and a null static chain slot. NARGS is the number of call arguments
11406 which are specified as a tree array ARGS. */
11409 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11410 int nargs
, const tree
*args
)
11415 t
= build_call_1 (return_type
, fn
, nargs
);
11416 for (i
= 0; i
< nargs
; i
++)
11417 CALL_EXPR_ARG (t
, i
) = args
[i
];
11418 process_call_operands (t
);
11419 SET_EXPR_LOCATION (t
, loc
);
11423 /* Like build_call_array, but takes a vec. */
11426 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11431 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11432 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11433 CALL_EXPR_ARG (ret
, ix
) = t
;
11434 process_call_operands (ret
);
11438 /* Conveniently construct a function call expression. FNDECL names the
11439 function to be called and N arguments are passed in the array
11443 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11445 tree fntype
= TREE_TYPE (fndecl
);
11446 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11448 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11451 /* Conveniently construct a function call expression. FNDECL names the
11452 function to be called and the arguments are passed in the vector
11456 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11458 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11459 vec_safe_address (vec
));
11463 /* Conveniently construct a function call expression. FNDECL names the
11464 function to be called, N is the number of arguments, and the "..."
11465 parameters are the argument expressions. */
11468 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11471 tree
*argarray
= XALLOCAVEC (tree
, n
);
11475 for (i
= 0; i
< n
; i
++)
11476 argarray
[i
] = va_arg (ap
, tree
);
11478 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11481 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11482 varargs macros aren't supported by all bootstrap compilers. */
11485 build_call_expr (tree fndecl
, int n
, ...)
11488 tree
*argarray
= XALLOCAVEC (tree
, n
);
11492 for (i
= 0; i
< n
; i
++)
11493 argarray
[i
] = va_arg (ap
, tree
);
11495 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11498 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11499 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11500 It will get gimplified later into an ordinary internal function. */
11503 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11504 tree type
, int n
, const tree
*args
)
11506 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11507 for (int i
= 0; i
< n
; ++i
)
11508 CALL_EXPR_ARG (t
, i
) = args
[i
];
11509 SET_EXPR_LOCATION (t
, loc
);
11510 CALL_EXPR_IFN (t
) = ifn
;
11511 process_call_operands (t
);
11515 /* Build internal call expression. This is just like CALL_EXPR, except
11516 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11517 internal function. */
11520 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11521 tree type
, int n
, ...)
11524 tree
*argarray
= XALLOCAVEC (tree
, n
);
11528 for (i
= 0; i
< n
; i
++)
11529 argarray
[i
] = va_arg (ap
, tree
);
11531 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11534 /* Return a function call to FN, if the target is guaranteed to support it,
11537 N is the number of arguments, passed in the "...", and TYPE is the
11538 type of the return value. */
11541 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11545 tree
*argarray
= XALLOCAVEC (tree
, n
);
11549 for (i
= 0; i
< n
; i
++)
11550 argarray
[i
] = va_arg (ap
, tree
);
11552 if (internal_fn_p (fn
))
11554 internal_fn ifn
= as_internal_fn (fn
);
11555 if (direct_internal_fn_p (ifn
))
11557 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11558 if (!direct_internal_fn_supported_p (ifn
, types
,
11559 OPTIMIZE_FOR_BOTH
))
11562 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11566 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11569 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11573 /* Return a function call to the appropriate builtin alloca variant.
11575 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11576 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11577 bound for SIZE in case it is not a fixed value. */
11580 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11584 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11586 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11588 else if (align
> 0)
11590 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11591 return build_call_expr (t
, 2, size
, size_int (align
));
11595 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11596 return build_call_expr (t
, 1, size
);
11600 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11601 if SIZE == -1) and return a tree node representing char* pointer to
11602 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). When STR is nonnull
11603 the STRING_CST value is the LEN bytes at STR (the representation
11604 of the string, which may be wide). Otherwise it's all zeros. */
11607 build_string_literal (unsigned len
, const char *str
/* = NULL */,
11608 tree eltype
/* = char_type_node */,
11609 unsigned HOST_WIDE_INT size
/* = -1 */)
11611 tree t
= build_string (len
, str
);
11612 /* Set the maximum valid index based on the string length or SIZE. */
11613 unsigned HOST_WIDE_INT maxidx
11614 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11616 tree index
= build_index_type (size_int (maxidx
));
11617 eltype
= build_type_variant (eltype
, 1, 0);
11618 tree type
= build_array_type (eltype
, index
);
11619 TREE_TYPE (t
) = type
;
11620 TREE_CONSTANT (t
) = 1;
11621 TREE_READONLY (t
) = 1;
11622 TREE_STATIC (t
) = 1;
11624 type
= build_pointer_type (eltype
);
11625 t
= build1 (ADDR_EXPR
, type
,
11626 build4 (ARRAY_REF
, eltype
,
11627 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11633 /* Return true if T (assumed to be a DECL) must be assigned a memory
11637 needs_to_live_in_memory (const_tree t
)
11639 return (TREE_ADDRESSABLE (t
)
11640 || is_global_var (t
)
11641 || (TREE_CODE (t
) == RESULT_DECL
11642 && !DECL_BY_REFERENCE (t
)
11643 && aggregate_value_p (t
, current_function_decl
)));
11646 /* Return value of a constant X and sign-extend it. */
11649 int_cst_value (const_tree x
)
11651 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11652 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11654 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11655 gcc_assert (cst_and_fits_in_hwi (x
));
11657 if (bits
< HOST_BITS_PER_WIDE_INT
)
11659 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11661 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11663 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11669 /* If TYPE is an integral or pointer type, return an integer type with
11670 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11671 if TYPE is already an integer type of signedness UNSIGNEDP.
11672 If TYPE is a floating-point type, return an integer type with the same
11673 bitsize and with the signedness given by UNSIGNEDP; this is useful
11674 when doing bit-level operations on a floating-point value. */
11677 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11679 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11682 if (TREE_CODE (type
) == VECTOR_TYPE
)
11684 tree inner
= TREE_TYPE (type
);
11685 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11688 if (inner
== inner2
)
11690 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11693 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11695 tree inner
= TREE_TYPE (type
);
11696 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11699 if (inner
== inner2
)
11701 return build_complex_type (inner2
);
11705 if (INTEGRAL_TYPE_P (type
)
11706 || POINTER_TYPE_P (type
)
11707 || TREE_CODE (type
) == OFFSET_TYPE
)
11708 bits
= TYPE_PRECISION (type
);
11709 else if (TREE_CODE (type
) == REAL_TYPE
)
11710 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11714 return build_nonstandard_integer_type (bits
, unsignedp
);
11717 /* If TYPE is an integral or pointer type, return an integer type with
11718 the same precision which is unsigned, or itself if TYPE is already an
11719 unsigned integer type. If TYPE is a floating-point type, return an
11720 unsigned integer type with the same bitsize as TYPE. */
11723 unsigned_type_for (tree type
)
11725 return signed_or_unsigned_type_for (1, type
);
11728 /* If TYPE is an integral or pointer type, return an integer type with
11729 the same precision which is signed, or itself if TYPE is already a
11730 signed integer type. If TYPE is a floating-point type, return a
11731 signed integer type with the same bitsize as TYPE. */
11734 signed_type_for (tree type
)
11736 return signed_or_unsigned_type_for (0, type
);
11739 /* If TYPE is a vector type, return a signed integer vector type with the
11740 same width and number of subparts. Otherwise return boolean_type_node. */
11743 truth_type_for (tree type
)
11745 if (TREE_CODE (type
) == VECTOR_TYPE
)
11747 if (VECTOR_BOOLEAN_TYPE_P (type
))
11749 return build_truth_vector_type_for (type
);
11752 return boolean_type_node
;
11755 /* Returns the largest value obtainable by casting something in INNER type to
11759 upper_bound_in_type (tree outer
, tree inner
)
11761 unsigned int det
= 0;
11762 unsigned oprec
= TYPE_PRECISION (outer
);
11763 unsigned iprec
= TYPE_PRECISION (inner
);
11766 /* Compute a unique number for every combination. */
11767 det
|= (oprec
> iprec
) ? 4 : 0;
11768 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11769 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11771 /* Determine the exponent to use. */
11776 /* oprec <= iprec, outer: signed, inner: don't care. */
11781 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11785 /* oprec > iprec, outer: signed, inner: signed. */
11789 /* oprec > iprec, outer: signed, inner: unsigned. */
11793 /* oprec > iprec, outer: unsigned, inner: signed. */
11797 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11801 gcc_unreachable ();
11804 return wide_int_to_tree (outer
,
11805 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11808 /* Returns the smallest value obtainable by casting something in INNER type to
11812 lower_bound_in_type (tree outer
, tree inner
)
11814 unsigned oprec
= TYPE_PRECISION (outer
);
11815 unsigned iprec
= TYPE_PRECISION (inner
);
11817 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11819 if (TYPE_UNSIGNED (outer
)
11820 /* If we are widening something of an unsigned type, OUTER type
11821 contains all values of INNER type. In particular, both INNER
11822 and OUTER types have zero in common. */
11823 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11824 return build_int_cst (outer
, 0);
11827 /* If we are widening a signed type to another signed type, we
11828 want to obtain -2^^(iprec-1). If we are keeping the
11829 precision or narrowing to a signed type, we want to obtain
11831 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11832 return wide_int_to_tree (outer
,
11833 wi::mask (prec
- 1, true,
11834 TYPE_PRECISION (outer
)));
11838 /* Return nonzero if two operands that are suitable for PHI nodes are
11839 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11840 SSA_NAME or invariant. Note that this is strictly an optimization.
11841 That is, callers of this function can directly call operand_equal_p
11842 and get the same result, only slower. */
11845 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11849 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11851 return operand_equal_p (arg0
, arg1
, 0);
11854 /* Returns number of zeros at the end of binary representation of X. */
11857 num_ending_zeros (const_tree x
)
11859 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11863 #define WALK_SUBTREE(NODE) \
11866 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11872 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11873 be walked whenever a type is seen in the tree. Rest of operands and return
11874 value are as for walk_tree. */
11877 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11878 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11880 tree result
= NULL_TREE
;
11882 switch (TREE_CODE (type
))
11885 case REFERENCE_TYPE
:
11887 /* We have to worry about mutually recursive pointers. These can't
11888 be written in C. They can in Ada. It's pathological, but
11889 there's an ACATS test (c38102a) that checks it. Deal with this
11890 by checking if we're pointing to another pointer, that one
11891 points to another pointer, that one does too, and we have no htab.
11892 If so, get a hash table. We check three levels deep to avoid
11893 the cost of the hash table if we don't need one. */
11894 if (POINTER_TYPE_P (TREE_TYPE (type
))
11895 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11896 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11899 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11910 WALK_SUBTREE (TREE_TYPE (type
));
11914 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11916 /* Fall through. */
11918 case FUNCTION_TYPE
:
11919 WALK_SUBTREE (TREE_TYPE (type
));
11923 /* We never want to walk into default arguments. */
11924 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11925 WALK_SUBTREE (TREE_VALUE (arg
));
11930 /* Don't follow this nodes's type if a pointer for fear that
11931 we'll have infinite recursion. If we have a PSET, then we
11934 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11935 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11936 WALK_SUBTREE (TREE_TYPE (type
));
11937 WALK_SUBTREE (TYPE_DOMAIN (type
));
11941 WALK_SUBTREE (TREE_TYPE (type
));
11942 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11952 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11953 called with the DATA and the address of each sub-tree. If FUNC returns a
11954 non-NULL value, the traversal is stopped, and the value returned by FUNC
11955 is returned. If PSET is non-NULL it is used to record the nodes visited,
11956 and to avoid visiting a node more than once. */
11959 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11960 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11962 enum tree_code code
;
11966 #define WALK_SUBTREE_TAIL(NODE) \
11970 goto tail_recurse; \
11975 /* Skip empty subtrees. */
11979 /* Don't walk the same tree twice, if the user has requested
11980 that we avoid doing so. */
11981 if (pset
&& pset
->add (*tp
))
11984 /* Call the function. */
11986 result
= (*func
) (tp
, &walk_subtrees
, data
);
11988 /* If we found something, return it. */
11992 code
= TREE_CODE (*tp
);
11994 /* Even if we didn't, FUNC may have decided that there was nothing
11995 interesting below this point in the tree. */
11996 if (!walk_subtrees
)
11998 /* But we still need to check our siblings. */
11999 if (code
== TREE_LIST
)
12000 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12001 else if (code
== OMP_CLAUSE
)
12002 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12009 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12010 if (result
|| !walk_subtrees
)
12017 case IDENTIFIER_NODE
:
12024 case PLACEHOLDER_EXPR
:
12028 /* None of these have subtrees other than those already walked
12033 WALK_SUBTREE (TREE_VALUE (*tp
));
12034 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12039 int len
= TREE_VEC_LENGTH (*tp
);
12044 /* Walk all elements but the first. */
12046 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12048 /* Now walk the first one as a tail call. */
12049 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12053 WALK_SUBTREE (TREE_REALPART (*tp
));
12054 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12058 unsigned HOST_WIDE_INT idx
;
12059 constructor_elt
*ce
;
12061 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12063 WALK_SUBTREE (ce
->value
);
12068 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12073 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12075 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12076 into declarations that are just mentioned, rather than
12077 declared; they don't really belong to this part of the tree.
12078 And, we can see cycles: the initializer for a declaration
12079 can refer to the declaration itself. */
12080 WALK_SUBTREE (DECL_INITIAL (decl
));
12081 WALK_SUBTREE (DECL_SIZE (decl
));
12082 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12084 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12087 case STATEMENT_LIST
:
12089 tree_stmt_iterator i
;
12090 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12091 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12096 switch (OMP_CLAUSE_CODE (*tp
))
12098 case OMP_CLAUSE_GANG
:
12099 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12102 case OMP_CLAUSE_ASYNC
:
12103 case OMP_CLAUSE_WAIT
:
12104 case OMP_CLAUSE_WORKER
:
12105 case OMP_CLAUSE_VECTOR
:
12106 case OMP_CLAUSE_NUM_GANGS
:
12107 case OMP_CLAUSE_NUM_WORKERS
:
12108 case OMP_CLAUSE_VECTOR_LENGTH
:
12109 case OMP_CLAUSE_PRIVATE
:
12110 case OMP_CLAUSE_SHARED
:
12111 case OMP_CLAUSE_FIRSTPRIVATE
:
12112 case OMP_CLAUSE_COPYIN
:
12113 case OMP_CLAUSE_COPYPRIVATE
:
12114 case OMP_CLAUSE_FINAL
:
12115 case OMP_CLAUSE_IF
:
12116 case OMP_CLAUSE_NUM_THREADS
:
12117 case OMP_CLAUSE_SCHEDULE
:
12118 case OMP_CLAUSE_UNIFORM
:
12119 case OMP_CLAUSE_DEPEND
:
12120 case OMP_CLAUSE_NONTEMPORAL
:
12121 case OMP_CLAUSE_NUM_TEAMS
:
12122 case OMP_CLAUSE_THREAD_LIMIT
:
12123 case OMP_CLAUSE_DEVICE
:
12124 case OMP_CLAUSE_DIST_SCHEDULE
:
12125 case OMP_CLAUSE_SAFELEN
:
12126 case OMP_CLAUSE_SIMDLEN
:
12127 case OMP_CLAUSE_ORDERED
:
12128 case OMP_CLAUSE_PRIORITY
:
12129 case OMP_CLAUSE_GRAINSIZE
:
12130 case OMP_CLAUSE_NUM_TASKS
:
12131 case OMP_CLAUSE_HINT
:
12132 case OMP_CLAUSE_TO_DECLARE
:
12133 case OMP_CLAUSE_LINK
:
12134 case OMP_CLAUSE_USE_DEVICE_PTR
:
12135 case OMP_CLAUSE_USE_DEVICE_ADDR
:
12136 case OMP_CLAUSE_IS_DEVICE_PTR
:
12137 case OMP_CLAUSE_INCLUSIVE
:
12138 case OMP_CLAUSE_EXCLUSIVE
:
12139 case OMP_CLAUSE__LOOPTEMP_
:
12140 case OMP_CLAUSE__REDUCTEMP_
:
12141 case OMP_CLAUSE__CONDTEMP_
:
12142 case OMP_CLAUSE__SCANTEMP_
:
12143 case OMP_CLAUSE__SIMDUID_
:
12144 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12147 case OMP_CLAUSE_INDEPENDENT
:
12148 case OMP_CLAUSE_NOWAIT
:
12149 case OMP_CLAUSE_DEFAULT
:
12150 case OMP_CLAUSE_UNTIED
:
12151 case OMP_CLAUSE_MERGEABLE
:
12152 case OMP_CLAUSE_PROC_BIND
:
12153 case OMP_CLAUSE_DEVICE_TYPE
:
12154 case OMP_CLAUSE_INBRANCH
:
12155 case OMP_CLAUSE_NOTINBRANCH
:
12156 case OMP_CLAUSE_FOR
:
12157 case OMP_CLAUSE_PARALLEL
:
12158 case OMP_CLAUSE_SECTIONS
:
12159 case OMP_CLAUSE_TASKGROUP
:
12160 case OMP_CLAUSE_NOGROUP
:
12161 case OMP_CLAUSE_THREADS
:
12162 case OMP_CLAUSE_SIMD
:
12163 case OMP_CLAUSE_DEFAULTMAP
:
12164 case OMP_CLAUSE_ORDER
:
12165 case OMP_CLAUSE_BIND
:
12166 case OMP_CLAUSE_AUTO
:
12167 case OMP_CLAUSE_SEQ
:
12168 case OMP_CLAUSE_TILE
:
12169 case OMP_CLAUSE__SIMT_
:
12170 case OMP_CLAUSE_IF_PRESENT
:
12171 case OMP_CLAUSE_FINALIZE
:
12172 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12174 case OMP_CLAUSE_LASTPRIVATE
:
12175 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12176 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12177 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12179 case OMP_CLAUSE_COLLAPSE
:
12182 for (i
= 0; i
< 3; i
++)
12183 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12184 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12187 case OMP_CLAUSE_LINEAR
:
12188 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12189 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12190 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12191 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12193 case OMP_CLAUSE_ALIGNED
:
12194 case OMP_CLAUSE_FROM
:
12195 case OMP_CLAUSE_TO
:
12196 case OMP_CLAUSE_MAP
:
12197 case OMP_CLAUSE__CACHE_
:
12198 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12199 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12200 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12202 case OMP_CLAUSE_REDUCTION
:
12203 case OMP_CLAUSE_TASK_REDUCTION
:
12204 case OMP_CLAUSE_IN_REDUCTION
:
12207 for (i
= 0; i
< 5; i
++)
12208 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12209 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12213 gcc_unreachable ();
12221 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12222 But, we only want to walk once. */
12223 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12224 for (i
= 0; i
< len
; ++i
)
12225 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12226 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12230 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12231 defining. We only want to walk into these fields of a type in this
12232 case and not in the general case of a mere reference to the type.
12234 The criterion is as follows: if the field can be an expression, it
12235 must be walked only here. This should be in keeping with the fields
12236 that are directly gimplified in gimplify_type_sizes in order for the
12237 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12238 variable-sized types.
12240 Note that DECLs get walked as part of processing the BIND_EXPR. */
12241 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12243 /* Call the function for the decl so e.g. copy_tree_body_r can
12244 replace it with the remapped one. */
12245 result
= (*func
) (&DECL_EXPR_DECL (*tp
), &walk_subtrees
, data
);
12246 if (result
|| !walk_subtrees
)
12249 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12250 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12253 /* Call the function for the type. See if it returns anything or
12254 doesn't want us to continue. If we are to continue, walk both
12255 the normal fields and those for the declaration case. */
12256 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12257 if (result
|| !walk_subtrees
)
12260 /* But do not walk a pointed-to type since it may itself need to
12261 be walked in the declaration case if it isn't anonymous. */
12262 if (!POINTER_TYPE_P (*type_p
))
12264 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12269 /* If this is a record type, also walk the fields. */
12270 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12274 for (field
= TYPE_FIELDS (*type_p
); field
;
12275 field
= DECL_CHAIN (field
))
12277 /* We'd like to look at the type of the field, but we can
12278 easily get infinite recursion. So assume it's pointed
12279 to elsewhere in the tree. Also, ignore things that
12281 if (TREE_CODE (field
) != FIELD_DECL
)
12284 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12285 WALK_SUBTREE (DECL_SIZE (field
));
12286 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12287 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12288 WALK_SUBTREE (DECL_QUALIFIER (field
));
12292 /* Same for scalar types. */
12293 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12294 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12295 || TREE_CODE (*type_p
) == INTEGER_TYPE
12296 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12297 || TREE_CODE (*type_p
) == REAL_TYPE
)
12299 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12300 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12303 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12304 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12309 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12313 /* Walk over all the sub-trees of this operand. */
12314 len
= TREE_OPERAND_LENGTH (*tp
);
12316 /* Go through the subtrees. We need to do this in forward order so
12317 that the scope of a FOR_EXPR is handled properly. */
12320 for (i
= 0; i
< len
- 1; ++i
)
12321 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12322 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12325 /* If this is a type, walk the needed fields in the type. */
12326 else if (TYPE_P (*tp
))
12327 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12331 /* We didn't find what we were looking for. */
12334 #undef WALK_SUBTREE_TAIL
12336 #undef WALK_SUBTREE
12338 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12341 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12346 hash_set
<tree
> pset
;
12347 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12353 tree_block (tree t
)
12355 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12357 if (IS_EXPR_CODE_CLASS (c
))
12358 return LOCATION_BLOCK (t
->exp
.locus
);
12359 gcc_unreachable ();
12364 tree_set_block (tree t
, tree b
)
12366 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12368 if (IS_EXPR_CODE_CLASS (c
))
12370 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12373 gcc_unreachable ();
12376 /* Create a nameless artificial label and put it in the current
12377 function context. The label has a location of LOC. Returns the
12378 newly created label. */
12381 create_artificial_label (location_t loc
)
12383 tree lab
= build_decl (loc
,
12384 LABEL_DECL
, NULL_TREE
, void_type_node
);
12386 DECL_ARTIFICIAL (lab
) = 1;
12387 DECL_IGNORED_P (lab
) = 1;
12388 DECL_CONTEXT (lab
) = current_function_decl
;
12392 /* Given a tree, try to return a useful variable name that we can use
12393 to prefix a temporary that is being assigned the value of the tree.
12394 I.E. given <temp> = &A, return A. */
12399 tree stripped_decl
;
12402 STRIP_NOPS (stripped_decl
);
12403 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12404 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12405 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12407 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12410 return IDENTIFIER_POINTER (name
);
12414 switch (TREE_CODE (stripped_decl
))
12417 return get_name (TREE_OPERAND (stripped_decl
, 0));
12424 /* Return true if TYPE has a variable argument list. */
12427 stdarg_p (const_tree fntype
)
12429 function_args_iterator args_iter
;
12430 tree n
= NULL_TREE
, t
;
12435 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12440 return n
!= NULL_TREE
&& n
!= void_type_node
;
12443 /* Return true if TYPE has a prototype. */
12446 prototype_p (const_tree fntype
)
12450 gcc_assert (fntype
!= NULL_TREE
);
12452 t
= TYPE_ARG_TYPES (fntype
);
12453 return (t
!= NULL_TREE
);
12456 /* If BLOCK is inlined from an __attribute__((__artificial__))
12457 routine, return pointer to location from where it has been
12460 block_nonartificial_location (tree block
)
12462 location_t
*ret
= NULL
;
12464 while (block
&& TREE_CODE (block
) == BLOCK
12465 && BLOCK_ABSTRACT_ORIGIN (block
))
12467 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12468 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12470 /* If AO is an artificial inline, point RET to the
12471 call site locus at which it has been inlined and continue
12472 the loop, in case AO's caller is also an artificial
12474 if (DECL_DECLARED_INLINE_P (ao
)
12475 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12476 ret
= &BLOCK_SOURCE_LOCATION (block
);
12480 else if (TREE_CODE (ao
) != BLOCK
)
12483 block
= BLOCK_SUPERCONTEXT (block
);
12489 /* If EXP is inlined from an __attribute__((__artificial__))
12490 function, return the location of the original call expression. */
12493 tree_nonartificial_location (tree exp
)
12495 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12500 return EXPR_LOCATION (exp
);
12504 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12507 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12510 cl_option_hasher::hash (tree x
)
12512 const_tree
const t
= x
;
12516 hashval_t hash
= 0;
12518 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12520 p
= (const char *)TREE_OPTIMIZATION (t
);
12521 len
= sizeof (struct cl_optimization
);
12524 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12525 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12528 gcc_unreachable ();
12530 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12532 for (i
= 0; i
< len
; i
++)
12534 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12539 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12540 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12544 cl_option_hasher::equal (tree x
, tree y
)
12546 const_tree
const xt
= x
;
12547 const_tree
const yt
= y
;
12549 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12552 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12553 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12554 TREE_OPTIMIZATION (yt
));
12555 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12556 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12557 TREE_TARGET_OPTION (yt
));
12559 gcc_unreachable ();
12562 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12565 build_optimization_node (struct gcc_options
*opts
)
12569 /* Use the cache of optimization nodes. */
12571 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12574 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12578 /* Insert this one into the hash table. */
12579 t
= cl_optimization_node
;
12582 /* Make a new node for next time round. */
12583 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12589 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12592 build_target_option_node (struct gcc_options
*opts
)
12596 /* Use the cache of optimization nodes. */
12598 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12601 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12605 /* Insert this one into the hash table. */
12606 t
= cl_target_option_node
;
12609 /* Make a new node for next time round. */
12610 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12616 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12617 so that they aren't saved during PCH writing. */
12620 prepare_target_option_nodes_for_pch (void)
12622 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12623 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12624 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12625 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12628 /* Determine the "ultimate origin" of a block. */
12631 block_ultimate_origin (const_tree block
)
12633 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12635 if (origin
== NULL_TREE
)
12639 gcc_checking_assert ((DECL_P (origin
)
12640 && DECL_ORIGIN (origin
) == origin
)
12641 || BLOCK_ORIGIN (origin
) == origin
);
12646 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12650 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12652 /* Do not strip casts into or out of differing address spaces. */
12653 if (POINTER_TYPE_P (outer_type
)
12654 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12656 if (!POINTER_TYPE_P (inner_type
)
12657 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12658 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12661 else if (POINTER_TYPE_P (inner_type
)
12662 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12664 /* We already know that outer_type is not a pointer with
12665 a non-generic address space. */
12669 /* Use precision rather then machine mode when we can, which gives
12670 the correct answer even for submode (bit-field) types. */
12671 if ((INTEGRAL_TYPE_P (outer_type
)
12672 || POINTER_TYPE_P (outer_type
)
12673 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12674 && (INTEGRAL_TYPE_P (inner_type
)
12675 || POINTER_TYPE_P (inner_type
)
12676 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12677 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12679 /* Otherwise fall back on comparing machine modes (e.g. for
12680 aggregate types, floats). */
12681 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12684 /* Return true iff conversion in EXP generates no instruction. Mark
12685 it inline so that we fully inline into the stripping functions even
12686 though we have two uses of this function. */
12689 tree_nop_conversion (const_tree exp
)
12691 tree outer_type
, inner_type
;
12693 if (location_wrapper_p (exp
))
12695 if (!CONVERT_EXPR_P (exp
)
12696 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12699 outer_type
= TREE_TYPE (exp
);
12700 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12701 if (!inner_type
|| inner_type
== error_mark_node
)
12704 return tree_nop_conversion_p (outer_type
, inner_type
);
12707 /* Return true iff conversion in EXP generates no instruction. Don't
12708 consider conversions changing the signedness. */
12711 tree_sign_nop_conversion (const_tree exp
)
12713 tree outer_type
, inner_type
;
12715 if (!tree_nop_conversion (exp
))
12718 outer_type
= TREE_TYPE (exp
);
12719 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12721 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12722 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12725 /* Strip conversions from EXP according to tree_nop_conversion and
12726 return the resulting expression. */
12729 tree_strip_nop_conversions (tree exp
)
12731 while (tree_nop_conversion (exp
))
12732 exp
= TREE_OPERAND (exp
, 0);
12736 /* Strip conversions from EXP according to tree_sign_nop_conversion
12737 and return the resulting expression. */
12740 tree_strip_sign_nop_conversions (tree exp
)
12742 while (tree_sign_nop_conversion (exp
))
12743 exp
= TREE_OPERAND (exp
, 0);
12747 /* Avoid any floating point extensions from EXP. */
12749 strip_float_extensions (tree exp
)
12751 tree sub
, expt
, subt
;
12753 /* For floating point constant look up the narrowest type that can hold
12754 it properly and handle it like (type)(narrowest_type)constant.
12755 This way we can optimize for instance a=a*2.0 where "a" is float
12756 but 2.0 is double constant. */
12757 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12759 REAL_VALUE_TYPE orig
;
12762 orig
= TREE_REAL_CST (exp
);
12763 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12764 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12765 type
= float_type_node
;
12766 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12767 > TYPE_PRECISION (double_type_node
)
12768 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12769 type
= double_type_node
;
12771 return build_real_truncate (type
, orig
);
12774 if (!CONVERT_EXPR_P (exp
))
12777 sub
= TREE_OPERAND (exp
, 0);
12778 subt
= TREE_TYPE (sub
);
12779 expt
= TREE_TYPE (exp
);
12781 if (!FLOAT_TYPE_P (subt
))
12784 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12787 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12790 return strip_float_extensions (sub
);
12793 /* Strip out all handled components that produce invariant
12797 strip_invariant_refs (const_tree op
)
12799 while (handled_component_p (op
))
12801 switch (TREE_CODE (op
))
12804 case ARRAY_RANGE_REF
:
12805 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12806 || TREE_OPERAND (op
, 2) != NULL_TREE
12807 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12811 case COMPONENT_REF
:
12812 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12818 op
= TREE_OPERAND (op
, 0);
12824 static GTY(()) tree gcc_eh_personality_decl
;
12826 /* Return the GCC personality function decl. */
12829 lhd_gcc_personality (void)
12831 if (!gcc_eh_personality_decl
)
12832 gcc_eh_personality_decl
= build_personality_function ("gcc");
12833 return gcc_eh_personality_decl
;
12836 /* TARGET is a call target of GIMPLE call statement
12837 (obtained by gimple_call_fn). Return true if it is
12838 OBJ_TYPE_REF representing an virtual call of C++ method.
12839 (As opposed to OBJ_TYPE_REF representing objc calls
12840 through a cast where middle-end devirtualization machinery
12841 can't apply.) FOR_DUMP_P is true when being called from
12842 the dump routines. */
12845 virtual_method_call_p (const_tree target
, bool for_dump_p
)
12847 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12849 tree t
= TREE_TYPE (target
);
12850 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12852 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12854 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12855 /* If we do not have BINFO associated, it means that type was built
12856 without devirtualization enabled. Do not consider this a virtual
12858 if (!TYPE_BINFO (obj_type_ref_class (target
, for_dump_p
)))
12863 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12866 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12869 tree base_binfo
, b
;
12871 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12872 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12873 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12875 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12880 /* Try to find a base info of BINFO that would have its field decl at offset
12881 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12882 found, return, otherwise return NULL_TREE. */
12885 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12887 tree type
= BINFO_TYPE (binfo
);
12891 HOST_WIDE_INT pos
, size
;
12895 if (types_same_for_odr (type
, expected_type
))
12897 if (maybe_lt (offset
, 0))
12900 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12902 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12905 pos
= int_bit_position (fld
);
12906 size
= tree_to_uhwi (DECL_SIZE (fld
));
12907 if (known_in_range_p (offset
, pos
, size
))
12910 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12913 /* Offset 0 indicates the primary base, whose vtable contents are
12914 represented in the binfo for the derived class. */
12915 else if (maybe_ne (offset
, 0))
12917 tree found_binfo
= NULL
, base_binfo
;
12918 /* Offsets in BINFO are in bytes relative to the whole structure
12919 while POS is in bits relative to the containing field. */
12920 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12923 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12924 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12925 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12927 found_binfo
= base_binfo
;
12931 binfo
= found_binfo
;
12933 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12937 type
= TREE_TYPE (fld
);
12942 /* Returns true if X is a typedef decl. */
12945 is_typedef_decl (const_tree x
)
12947 return (x
&& TREE_CODE (x
) == TYPE_DECL
12948 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12951 /* Returns true iff TYPE is a type variant created for a typedef. */
12954 typedef_variant_p (const_tree type
)
12956 return is_typedef_decl (TYPE_NAME (type
));
12959 /* PR 84195: Replace control characters in "unescaped" with their
12960 escaped equivalents. Allow newlines if -fmessage-length has
12961 been set to a non-zero value. This is done here, rather than
12962 where the attribute is recorded as the message length can
12963 change between these two locations. */
12966 escaped_string::escape (const char *unescaped
)
12969 size_t i
, new_i
, len
;
12974 m_str
= const_cast<char *> (unescaped
);
12977 if (unescaped
== NULL
|| *unescaped
== 0)
12980 len
= strlen (unescaped
);
12984 for (i
= 0; i
< len
; i
++)
12986 char c
= unescaped
[i
];
12991 escaped
[new_i
++] = c
;
12995 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
12997 if (escaped
== NULL
)
12999 /* We only allocate space for a new string if we
13000 actually encounter a control character that
13001 needs replacing. */
13002 escaped
= (char *) xmalloc (len
* 2 + 1);
13003 strncpy (escaped
, unescaped
, i
);
13007 escaped
[new_i
++] = '\\';
13011 case '\a': escaped
[new_i
++] = 'a'; break;
13012 case '\b': escaped
[new_i
++] = 'b'; break;
13013 case '\f': escaped
[new_i
++] = 'f'; break;
13014 case '\n': escaped
[new_i
++] = 'n'; break;
13015 case '\r': escaped
[new_i
++] = 'r'; break;
13016 case '\t': escaped
[new_i
++] = 't'; break;
13017 case '\v': escaped
[new_i
++] = 'v'; break;
13018 default: escaped
[new_i
++] = '?'; break;
13022 escaped
[new_i
++] = c
;
13027 escaped
[new_i
] = 0;
13033 /* Warn about a use of an identifier which was marked deprecated. Returns
13034 whether a warning was given. */
13037 warn_deprecated_use (tree node
, tree attr
)
13039 escaped_string msg
;
13041 if (node
== 0 || !warn_deprecated_decl
)
13047 attr
= DECL_ATTRIBUTES (node
);
13048 else if (TYPE_P (node
))
13050 tree decl
= TYPE_STUB_DECL (node
);
13052 attr
= lookup_attribute ("deprecated",
13053 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13058 attr
= lookup_attribute ("deprecated", attr
);
13061 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13066 auto_diagnostic_group d
;
13068 w
= warning (OPT_Wdeprecated_declarations
,
13069 "%qD is deprecated: %s", node
, (const char *) msg
);
13071 w
= warning (OPT_Wdeprecated_declarations
,
13072 "%qD is deprecated", node
);
13074 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13076 else if (TYPE_P (node
))
13078 tree what
= NULL_TREE
;
13079 tree decl
= TYPE_STUB_DECL (node
);
13081 if (TYPE_NAME (node
))
13083 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13084 what
= TYPE_NAME (node
);
13085 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13086 && DECL_NAME (TYPE_NAME (node
)))
13087 what
= DECL_NAME (TYPE_NAME (node
));
13090 auto_diagnostic_group d
;
13094 w
= warning (OPT_Wdeprecated_declarations
,
13095 "%qE is deprecated: %s", what
, (const char *) msg
);
13097 w
= warning (OPT_Wdeprecated_declarations
,
13098 "%qE is deprecated", what
);
13103 w
= warning (OPT_Wdeprecated_declarations
,
13104 "type is deprecated: %s", (const char *) msg
);
13106 w
= warning (OPT_Wdeprecated_declarations
,
13107 "type is deprecated");
13111 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13117 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13118 somewhere in it. */
13121 contains_bitfld_component_ref_p (const_tree ref
)
13123 while (handled_component_p (ref
))
13125 if (TREE_CODE (ref
) == COMPONENT_REF
13126 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13128 ref
= TREE_OPERAND (ref
, 0);
13134 /* Try to determine whether a TRY_CATCH expression can fall through.
13135 This is a subroutine of block_may_fallthru. */
13138 try_catch_may_fallthru (const_tree stmt
)
13140 tree_stmt_iterator i
;
13142 /* If the TRY block can fall through, the whole TRY_CATCH can
13144 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13147 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13148 switch (TREE_CODE (tsi_stmt (i
)))
13151 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13152 catch expression and a body. The whole TRY_CATCH may fall
13153 through iff any of the catch bodies falls through. */
13154 for (; !tsi_end_p (i
); tsi_next (&i
))
13156 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13161 case EH_FILTER_EXPR
:
13162 /* The exception filter expression only matters if there is an
13163 exception. If the exception does not match EH_FILTER_TYPES,
13164 we will execute EH_FILTER_FAILURE, and we will fall through
13165 if that falls through. If the exception does match
13166 EH_FILTER_TYPES, the stack unwinder will continue up the
13167 stack, so we will not fall through. We don't know whether we
13168 will throw an exception which matches EH_FILTER_TYPES or not,
13169 so we just ignore EH_FILTER_TYPES and assume that we might
13170 throw an exception which doesn't match. */
13171 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13174 /* This case represents statements to be executed when an
13175 exception occurs. Those statements are implicitly followed
13176 by a RESX statement to resume execution after the exception.
13177 So in this case the TRY_CATCH never falls through. */
13182 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13183 need not be 100% accurate; simply be conservative and return true if we
13184 don't know. This is used only to avoid stupidly generating extra code.
13185 If we're wrong, we'll just delete the extra code later. */
13188 block_may_fallthru (const_tree block
)
13190 /* This CONST_CAST is okay because expr_last returns its argument
13191 unmodified and we assign it to a const_tree. */
13192 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13194 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13198 /* Easy cases. If the last statement of the block implies
13199 control transfer, then we can't fall through. */
13203 /* If there is a default: label or case labels cover all possible
13204 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13205 to some case label in all cases and all we care is whether the
13206 SWITCH_BODY falls through. */
13207 if (SWITCH_ALL_CASES_P (stmt
))
13208 return block_may_fallthru (SWITCH_BODY (stmt
));
13212 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13214 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13217 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13219 case TRY_CATCH_EXPR
:
13220 return try_catch_may_fallthru (stmt
);
13222 case TRY_FINALLY_EXPR
:
13223 /* The finally clause is always executed after the try clause,
13224 so if it does not fall through, then the try-finally will not
13225 fall through. Otherwise, if the try clause does not fall
13226 through, then when the finally clause falls through it will
13227 resume execution wherever the try clause was going. So the
13228 whole try-finally will only fall through if both the try
13229 clause and the finally clause fall through. */
13230 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13231 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13234 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13237 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13238 stmt
= TREE_OPERAND (stmt
, 1);
13244 /* Functions that do not return do not fall through. */
13245 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13247 case CLEANUP_POINT_EXPR
:
13248 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13251 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13257 return lang_hooks
.block_may_fallthru (stmt
);
13261 /* True if we are using EH to handle cleanups. */
13262 static bool using_eh_for_cleanups_flag
= false;
13264 /* This routine is called from front ends to indicate eh should be used for
13267 using_eh_for_cleanups (void)
13269 using_eh_for_cleanups_flag
= true;
13272 /* Query whether EH is used for cleanups. */
13274 using_eh_for_cleanups_p (void)
13276 return using_eh_for_cleanups_flag
;
13279 /* Wrapper for tree_code_name to ensure that tree code is valid */
13281 get_tree_code_name (enum tree_code code
)
13283 const char *invalid
= "<invalid tree code>";
13285 /* The tree_code enum promotes to signed, but we could be getting
13286 invalid values, so force an unsigned comparison. */
13287 if (unsigned (code
) >= MAX_TREE_CODES
)
13289 if (code
== 0xa5a5)
13290 return "ggc_freed";
13294 return tree_code_name
[code
];
13297 /* Drops the TREE_OVERFLOW flag from T. */
13300 drop_tree_overflow (tree t
)
13302 gcc_checking_assert (TREE_OVERFLOW (t
));
13304 /* For tree codes with a sharing machinery re-build the result. */
13305 if (poly_int_tree_p (t
))
13306 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13308 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13309 and canonicalize the result. */
13310 if (TREE_CODE (t
) == VECTOR_CST
)
13312 tree_vector_builder builder
;
13313 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13314 unsigned int count
= builder
.encoded_nelts ();
13315 for (unsigned int i
= 0; i
< count
; ++i
)
13317 tree elt
= VECTOR_CST_ELT (t
, i
);
13318 if (TREE_OVERFLOW (elt
))
13319 elt
= drop_tree_overflow (elt
);
13320 builder
.quick_push (elt
);
13322 return builder
.build ();
13325 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13326 and drop the flag. */
13328 TREE_OVERFLOW (t
) = 0;
13330 /* For constants that contain nested constants, drop the flag
13331 from those as well. */
13332 if (TREE_CODE (t
) == COMPLEX_CST
)
13334 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13335 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13336 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13337 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13343 /* Given a memory reference expression T, return its base address.
13344 The base address of a memory reference expression is the main
13345 object being referenced. For instance, the base address for
13346 'array[i].fld[j]' is 'array'. You can think of this as stripping
13347 away the offset part from a memory address.
13349 This function calls handled_component_p to strip away all the inner
13350 parts of the memory reference until it reaches the base object. */
13353 get_base_address (tree t
)
13355 while (handled_component_p (t
))
13356 t
= TREE_OPERAND (t
, 0);
13358 if ((TREE_CODE (t
) == MEM_REF
13359 || TREE_CODE (t
) == TARGET_MEM_REF
)
13360 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13361 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13363 /* ??? Either the alias oracle or all callers need to properly deal
13364 with WITH_SIZE_EXPRs before we can look through those. */
13365 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13371 /* Return a tree of sizetype representing the size, in bytes, of the element
13372 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13375 array_ref_element_size (tree exp
)
13377 tree aligned_size
= TREE_OPERAND (exp
, 3);
13378 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13379 location_t loc
= EXPR_LOCATION (exp
);
13381 /* If a size was specified in the ARRAY_REF, it's the size measured
13382 in alignment units of the element type. So multiply by that value. */
13385 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13386 sizetype from another type of the same width and signedness. */
13387 if (TREE_TYPE (aligned_size
) != sizetype
)
13388 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13389 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13390 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13393 /* Otherwise, take the size from that of the element type. Substitute
13394 any PLACEHOLDER_EXPR that we have. */
13396 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13399 /* Return a tree representing the lower bound of the array mentioned in
13400 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13403 array_ref_low_bound (tree exp
)
13405 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13407 /* If a lower bound is specified in EXP, use it. */
13408 if (TREE_OPERAND (exp
, 2))
13409 return TREE_OPERAND (exp
, 2);
13411 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13412 substituting for a PLACEHOLDER_EXPR as needed. */
13413 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13414 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13416 /* Otherwise, return a zero of the appropriate type. */
13417 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
13418 return (idxtype
== error_mark_node
13419 ? integer_zero_node
: build_int_cst (idxtype
, 0));
13422 /* Return a tree representing the upper bound of the array mentioned in
13423 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13426 array_ref_up_bound (tree exp
)
13428 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13430 /* If there is a domain type and it has an upper bound, use it, substituting
13431 for a PLACEHOLDER_EXPR as needed. */
13432 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13433 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13435 /* Otherwise fail. */
13439 /* Returns true if REF is an array reference, component reference,
13440 or memory reference to an array at the end of a structure.
13441 If this is the case, the array may be allocated larger
13442 than its upper bound implies. */
13445 array_at_struct_end_p (tree ref
)
13449 if (TREE_CODE (ref
) == ARRAY_REF
13450 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13452 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13453 ref
= TREE_OPERAND (ref
, 0);
13455 else if (TREE_CODE (ref
) == COMPONENT_REF
13456 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13457 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13458 else if (TREE_CODE (ref
) == MEM_REF
)
13460 tree arg
= TREE_OPERAND (ref
, 0);
13461 if (TREE_CODE (arg
) == ADDR_EXPR
)
13462 arg
= TREE_OPERAND (arg
, 0);
13463 tree argtype
= TREE_TYPE (arg
);
13464 if (TREE_CODE (argtype
) == RECORD_TYPE
)
13466 if (tree fld
= last_field (argtype
))
13468 atype
= TREE_TYPE (fld
);
13469 if (TREE_CODE (atype
) != ARRAY_TYPE
)
13471 if (VAR_P (arg
) && DECL_SIZE (fld
))
13483 if (TREE_CODE (ref
) == STRING_CST
)
13486 tree ref_to_array
= ref
;
13487 while (handled_component_p (ref
))
13489 /* If the reference chain contains a component reference to a
13490 non-union type and there follows another field the reference
13491 is not at the end of a structure. */
13492 if (TREE_CODE (ref
) == COMPONENT_REF
)
13494 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13496 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13497 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13498 nextf
= DECL_CHAIN (nextf
);
13503 /* If we have a multi-dimensional array we do not consider
13504 a non-innermost dimension as flex array if the whole
13505 multi-dimensional array is at struct end.
13506 Same for an array of aggregates with a trailing array
13508 else if (TREE_CODE (ref
) == ARRAY_REF
)
13510 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13512 /* If we view an underlying object as sth else then what we
13513 gathered up to now is what we have to rely on. */
13514 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13517 gcc_unreachable ();
13519 ref
= TREE_OPERAND (ref
, 0);
13522 /* The array now is at struct end. Treat flexible arrays as
13523 always subject to extend, even into just padding constrained by
13524 an underlying decl. */
13525 if (! TYPE_SIZE (atype
)
13526 || ! TYPE_DOMAIN (atype
)
13527 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13530 if (TREE_CODE (ref
) == MEM_REF
13531 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13532 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13534 /* If the reference is based on a declared entity, the size of the array
13535 is constrained by its given domain. (Do not trust commons PR/69368). */
13537 && !(flag_unconstrained_commons
13538 && VAR_P (ref
) && DECL_COMMON (ref
))
13539 && DECL_SIZE_UNIT (ref
)
13540 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13542 /* Check whether the array domain covers all of the available
13545 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13546 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13547 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13549 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13552 /* If at least one extra element fits it is a flexarray. */
13553 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13554 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13556 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13557 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13566 /* Return a tree representing the offset, in bytes, of the field referenced
13567 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13570 component_ref_field_offset (tree exp
)
13572 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13573 tree field
= TREE_OPERAND (exp
, 1);
13574 location_t loc
= EXPR_LOCATION (exp
);
13576 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13577 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13579 if (aligned_offset
)
13581 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13582 sizetype from another type of the same width and signedness. */
13583 if (TREE_TYPE (aligned_offset
) != sizetype
)
13584 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13585 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13586 size_int (DECL_OFFSET_ALIGN (field
)
13590 /* Otherwise, take the offset from that of the field. Substitute
13591 any PLACEHOLDER_EXPR that we have. */
13593 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13596 /* Given the initializer INIT, return the initializer for the field
13597 DECL if it exists, otherwise null. Used to obtain the initializer
13598 for a flexible array member and determine its size. */
13601 get_initializer_for (tree init
, tree decl
)
13605 tree fld
, fld_init
;
13606 unsigned HOST_WIDE_INT i
;
13607 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13612 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13614 fld_init
= get_initializer_for (fld_init
, decl
);
13623 /* Determines the size of the member referenced by the COMPONENT_REF
13624 REF, using its initializer expression if necessary in order to
13625 determine the size of an initialized flexible array member.
13626 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13627 an interior zero-length array.
13628 Returns the size as sizetype (which might be zero for an object
13629 with an uninitialized flexible array member) or null if the size
13630 cannot be determined. */
13633 component_ref_size (tree ref
, bool *interior_zero_length
/* = NULL */)
13635 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13637 bool int_0_len
= false;
13638 if (!interior_zero_length
)
13639 interior_zero_length
= &int_0_len
;
13641 /* The object/argument referenced by the COMPONENT_REF and its type. */
13642 tree arg
= TREE_OPERAND (ref
, 0);
13643 tree argtype
= TREE_TYPE (arg
);
13644 /* The referenced member. */
13645 tree member
= TREE_OPERAND (ref
, 1);
13647 tree memsize
= DECL_SIZE_UNIT (member
);
13650 tree memtype
= TREE_TYPE (member
);
13651 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13654 bool trailing
= array_at_struct_end_p (ref
);
13655 bool zero_length
= integer_zerop (memsize
);
13656 if (!trailing
&& !zero_length
)
13657 /* MEMBER is either an interior array or is an array with
13658 more than one element. */
13661 *interior_zero_length
= zero_length
&& !trailing
;
13662 if (*interior_zero_length
)
13663 memsize
= NULL_TREE
;
13666 if (tree dom
= TYPE_DOMAIN (memtype
))
13667 if (tree min
= TYPE_MIN_VALUE (dom
))
13668 if (tree max
= TYPE_MAX_VALUE (dom
))
13669 if (TREE_CODE (min
) == INTEGER_CST
13670 && TREE_CODE (max
) == INTEGER_CST
)
13672 offset_int minidx
= wi::to_offset (min
);
13673 offset_int maxidx
= wi::to_offset (max
);
13674 if (maxidx
- minidx
> 0)
13675 /* MEMBER is an array with more than one element. */
13679 /* For a refernce to a zero- or one-element array member of a union
13680 use the size of the union instead of the size of the member. */
13681 if (TREE_CODE (argtype
) == UNION_TYPE
)
13682 memsize
= TYPE_SIZE_UNIT (argtype
);
13685 /* MEMBER is either a bona fide flexible array member, or a zero-length
13686 array member, or an array of length one treated as such. */
13688 /* If the reference is to a declared object and the member a true
13689 flexible array, try to determine its size from its initializer. */
13690 poly_int64 baseoff
= 0;
13691 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13692 if (!base
|| !VAR_P (base
))
13694 if (!*interior_zero_length
)
13697 if (TREE_CODE (arg
) != COMPONENT_REF
)
13701 while (TREE_CODE (base
) == COMPONENT_REF
)
13702 base
= TREE_OPERAND (base
, 0);
13703 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13706 /* BASE is the declared object of which MEMBER is either a member
13707 or that is cast to ARGTYPE (e.g., a char buffer used to store
13708 an ARGTYPE object). */
13709 tree basetype
= TREE_TYPE (base
);
13711 /* Determine the base type of the referenced object. If it's
13712 the same as ARGTYPE and MEMBER has a known size, return it. */
13713 tree bt
= basetype
;
13714 if (!*interior_zero_length
)
13715 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13716 bt
= TREE_TYPE (bt
);
13717 bool typematch
= useless_type_conversion_p (argtype
, bt
);
13718 if (memsize
&& typematch
)
13721 memsize
= NULL_TREE
;
13724 /* MEMBER is a true flexible array member. Compute its size from
13725 the initializer of the BASE object if it has one. */
13726 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13727 if (init
!= error_mark_node
)
13729 init
= get_initializer_for (init
, member
);
13732 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13733 if (tree refsize
= TYPE_SIZE_UNIT (argtype
))
13735 /* Use the larger of the initializer size and the tail
13736 padding in the enclosing struct. */
13737 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13739 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13740 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13752 && DECL_EXTERNAL (base
)
13754 && !*interior_zero_length
)
13755 /* The size of a flexible array member of an extern struct
13756 with no initializer cannot be determined (it's defined
13757 in another translation unit and can have an initializer
13758 with an arbitrary number of elements). */
13761 /* Use the size of the base struct or, for interior zero-length
13762 arrays, the size of the enclosing type. */
13763 memsize
= TYPE_SIZE_UNIT (bt
);
13765 else if (DECL_P (base
))
13766 /* Use the size of the BASE object (possibly an array of some
13767 other type such as char used to store the struct). */
13768 memsize
= DECL_SIZE_UNIT (base
);
13773 /* If the flexible array member has a known size use the greater
13774 of it and the tail padding in the enclosing struct.
13775 Otherwise, when the size of the flexible array member is unknown
13776 and the referenced object is not a struct, use the size of its
13777 type when known. This detects sizes of array buffers when cast
13778 to struct types with flexible array members. */
13781 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13782 if (known_lt (baseoff
, memsz64
))
13784 memsz64
-= baseoff
;
13785 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13787 return size_zero_node
;
13790 /* Return "don't know" for an external non-array object since its
13791 flexible array member can be initialized to have any number of
13792 elements. Otherwise, return zero because the flexible array
13793 member has no elements. */
13794 return (DECL_P (base
)
13795 && DECL_EXTERNAL (base
)
13797 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13798 ? NULL_TREE
: size_zero_node
);
13801 /* Return the machine mode of T. For vectors, returns the mode of the
13802 inner type. The main use case is to feed the result to HONOR_NANS,
13803 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13806 element_mode (const_tree t
)
13810 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13812 return TYPE_MODE (t
);
13815 /* Vector types need to re-check the target flags each time we report
13816 the machine mode. We need to do this because attribute target can
13817 change the result of vector_mode_supported_p and have_regs_of_mode
13818 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13819 change on a per-function basis. */
13820 /* ??? Possibly a better solution is to run through all the types
13821 referenced by a function and re-compute the TYPE_MODE once, rather
13822 than make the TYPE_MODE macro call a function. */
13825 vector_type_mode (const_tree t
)
13829 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13831 mode
= t
->type_common
.mode
;
13832 if (VECTOR_MODE_P (mode
)
13833 && (!targetm
.vector_mode_supported_p (mode
)
13834 || !have_regs_of_mode
[mode
]))
13836 scalar_int_mode innermode
;
13838 /* For integers, try mapping it to a same-sized scalar mode. */
13839 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13841 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13842 * GET_MODE_BITSIZE (innermode
));
13843 scalar_int_mode mode
;
13844 if (int_mode_for_size (size
, 0).exists (&mode
)
13845 && have_regs_of_mode
[mode
])
13855 /* Return the size in bits of each element of vector type TYPE. */
13858 vector_element_bits (const_tree type
)
13860 gcc_checking_assert (VECTOR_TYPE_P (type
));
13861 if (VECTOR_BOOLEAN_TYPE_P (type
))
13862 return vector_element_size (tree_to_poly_uint64 (TYPE_SIZE (type
)),
13863 TYPE_VECTOR_SUBPARTS (type
));
13864 return tree_to_uhwi (TYPE_SIZE (TREE_TYPE (type
)));
13867 /* Calculate the size in bits of each element of vector type TYPE
13868 and return the result as a tree of type bitsizetype. */
13871 vector_element_bits_tree (const_tree type
)
13873 gcc_checking_assert (VECTOR_TYPE_P (type
));
13874 if (VECTOR_BOOLEAN_TYPE_P (type
))
13875 return bitsize_int (vector_element_bits (type
));
13876 return TYPE_SIZE (TREE_TYPE (type
));
13879 /* Verify that basic properties of T match TV and thus T can be a variant of
13880 TV. TV should be the more specified variant (i.e. the main variant). */
13883 verify_type_variant (const_tree t
, tree tv
)
13885 /* Type variant can differ by:
13887 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13888 ENCODE_QUAL_ADDR_SPACE.
13889 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13890 in this case some values may not be set in the variant types
13891 (see TYPE_COMPLETE_P checks).
13892 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13893 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13894 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13895 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13896 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13897 this is necessary to make it possible to merge types form different TUs
13898 - arrays, pointers and references may have TREE_TYPE that is a variant
13899 of TREE_TYPE of their main variants.
13900 - aggregates may have new TYPE_FIELDS list that list variants of
13901 the main variant TYPE_FIELDS.
13902 - vector types may differ by TYPE_VECTOR_OPAQUE
13905 /* Convenience macro for matching individual fields. */
13906 #define verify_variant_match(flag) \
13908 if (flag (tv) != flag (t)) \
13910 error ("type variant differs by %s", #flag); \
13916 /* tree_base checks. */
13918 verify_variant_match (TREE_CODE
);
13919 /* FIXME: Ada builds non-artificial variants of artificial types. */
13920 if (TYPE_ARTIFICIAL (tv
) && 0)
13921 verify_variant_match (TYPE_ARTIFICIAL
);
13922 if (POINTER_TYPE_P (tv
))
13923 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13924 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13925 verify_variant_match (TYPE_UNSIGNED
);
13926 verify_variant_match (TYPE_PACKED
);
13927 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13928 verify_variant_match (TYPE_REF_IS_RVALUE
);
13929 if (AGGREGATE_TYPE_P (t
))
13930 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13932 verify_variant_match (TYPE_SATURATING
);
13933 /* FIXME: This check trigger during libstdc++ build. */
13934 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13935 verify_variant_match (TYPE_FINAL_P
);
13937 /* tree_type_common checks. */
13939 if (COMPLETE_TYPE_P (t
))
13941 verify_variant_match (TYPE_MODE
);
13942 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13943 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13944 verify_variant_match (TYPE_SIZE
);
13945 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13946 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13947 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13949 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13950 TYPE_SIZE_UNIT (tv
), 0));
13951 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13953 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13954 debug_tree (TYPE_SIZE_UNIT (tv
));
13955 error ("type%'s %<TYPE_SIZE_UNIT%>");
13956 debug_tree (TYPE_SIZE_UNIT (t
));
13959 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13961 verify_variant_match (TYPE_PRECISION
);
13962 if (RECORD_OR_UNION_TYPE_P (t
))
13963 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13964 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13965 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13966 /* During LTO we merge variant lists from diferent translation units
13967 that may differ BY TYPE_CONTEXT that in turn may point
13968 to TRANSLATION_UNIT_DECL.
13969 Ada also builds variants of types with different TYPE_CONTEXT. */
13970 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13971 verify_variant_match (TYPE_CONTEXT
);
13972 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13973 verify_variant_match (TYPE_STRING_FLAG
);
13974 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13975 verify_variant_match (TYPE_CXX_ODR_P
);
13976 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13978 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13983 /* tree_type_non_common checks. */
13985 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13986 and dangle the pointer from time to time. */
13987 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13988 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13989 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13991 error ("type variant has different %<TYPE_VFIELD%>");
13995 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13996 || TREE_CODE (t
) == INTEGER_TYPE
13997 || TREE_CODE (t
) == BOOLEAN_TYPE
13998 || TREE_CODE (t
) == REAL_TYPE
13999 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14001 verify_variant_match (TYPE_MAX_VALUE
);
14002 verify_variant_match (TYPE_MIN_VALUE
);
14004 if (TREE_CODE (t
) == METHOD_TYPE
)
14005 verify_variant_match (TYPE_METHOD_BASETYPE
);
14006 if (TREE_CODE (t
) == OFFSET_TYPE
)
14007 verify_variant_match (TYPE_OFFSET_BASETYPE
);
14008 if (TREE_CODE (t
) == ARRAY_TYPE
)
14009 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
14010 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
14011 or even type's main variant. This is needed to make bootstrap pass
14012 and the bug seems new in GCC 5.
14013 C++ FE should be updated to make this consistent and we should check
14014 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
14015 is a match with main variant.
14017 Also disable the check for Java for now because of parser hack that builds
14018 first an dummy BINFO and then sometimes replace it by real BINFO in some
14020 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
14021 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
14022 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
14023 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
14024 at LTO time only. */
14025 && (in_lto_p
&& odr_type_p (t
)))
14027 error ("type variant has different %<TYPE_BINFO%>");
14029 error ("type variant%'s %<TYPE_BINFO%>");
14030 debug_tree (TYPE_BINFO (tv
));
14031 error ("type%'s %<TYPE_BINFO%>");
14032 debug_tree (TYPE_BINFO (t
));
14036 /* Check various uses of TYPE_VALUES_RAW. */
14037 if (TREE_CODE (t
) == ENUMERAL_TYPE
14038 && TYPE_VALUES (t
))
14039 verify_variant_match (TYPE_VALUES
);
14040 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14041 verify_variant_match (TYPE_DOMAIN
);
14042 /* Permit incomplete variants of complete type. While FEs may complete
14043 all variants, this does not happen for C++ templates in all cases. */
14044 else if (RECORD_OR_UNION_TYPE_P (t
)
14045 && COMPLETE_TYPE_P (t
)
14046 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
14050 /* Fortran builds qualified variants as new records with items of
14051 qualified type. Verify that they looks same. */
14052 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
14054 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14055 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
14056 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
14057 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
14058 /* FIXME: gfc_nonrestricted_type builds all types as variants
14059 with exception of pointer types. It deeply copies the type
14060 which means that we may end up with a variant type
14061 referring non-variant pointer. We may change it to
14062 produce types as variants, too, like
14063 objc_get_protocol_qualified_type does. */
14064 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
14065 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
14066 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14070 error ("type variant has different %<TYPE_FIELDS%>");
14072 error ("first mismatch is field");
14074 error ("and field");
14079 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14080 verify_variant_match (TYPE_ARG_TYPES
);
14081 /* For C++ the qualified variant of array type is really an array type
14082 of qualified TREE_TYPE.
14083 objc builds variants of pointer where pointer to type is a variant, too
14084 in objc_get_protocol_qualified_type. */
14085 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14086 && ((TREE_CODE (t
) != ARRAY_TYPE
14087 && !POINTER_TYPE_P (t
))
14088 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14089 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14091 error ("type variant has different %<TREE_TYPE%>");
14093 error ("type variant%'s %<TREE_TYPE%>");
14094 debug_tree (TREE_TYPE (tv
));
14095 error ("type%'s %<TREE_TYPE%>");
14096 debug_tree (TREE_TYPE (t
));
14099 if (type_with_alias_set_p (t
)
14100 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14102 error ("type is not compatible with its variant");
14104 error ("type variant%'s %<TREE_TYPE%>");
14105 debug_tree (TREE_TYPE (tv
));
14106 error ("type%'s %<TREE_TYPE%>");
14107 debug_tree (TREE_TYPE (t
));
14111 #undef verify_variant_match
14115 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14116 the middle-end types_compatible_p function. It needs to avoid
14117 claiming types are different for types that should be treated
14118 the same with respect to TBAA. Canonical types are also used
14119 for IL consistency checks via the useless_type_conversion_p
14120 predicate which does not handle all type kinds itself but falls
14121 back to pointer-comparison of TYPE_CANONICAL for aggregates
14124 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14125 type calculation because we need to allow inter-operability between signed
14126 and unsigned variants. */
14129 type_with_interoperable_signedness (const_tree type
)
14131 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14132 signed char and unsigned char. Similarly fortran FE builds
14133 C_SIZE_T as signed type, while C defines it unsigned. */
14135 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14137 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14138 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14141 /* Return true iff T1 and T2 are structurally identical for what
14143 This function is used both by lto.c canonical type merging and by the
14144 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14145 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14146 only for LTO because only in these cases TYPE_CANONICAL equivalence
14147 correspond to one defined by gimple_canonical_types_compatible_p. */
14150 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14151 bool trust_type_canonical
)
14153 /* Type variants should be same as the main variant. When not doing sanity
14154 checking to verify this fact, go to main variants and save some work. */
14155 if (trust_type_canonical
)
14157 t1
= TYPE_MAIN_VARIANT (t1
);
14158 t2
= TYPE_MAIN_VARIANT (t2
);
14161 /* Check first for the obvious case of pointer identity. */
14165 /* Check that we have two types to compare. */
14166 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14169 /* We consider complete types always compatible with incomplete type.
14170 This does not make sense for canonical type calculation and thus we
14171 need to ensure that we are never called on it.
14173 FIXME: For more correctness the function probably should have three modes
14174 1) mode assuming that types are complete mathcing their structure
14175 2) mode allowing incomplete types but producing equivalence classes
14176 and thus ignoring all info from complete types
14177 3) mode allowing incomplete types to match complete but checking
14178 compatibility between complete types.
14180 1 and 2 can be used for canonical type calculation. 3 is the real
14181 definition of type compatibility that can be used i.e. for warnings during
14182 declaration merging. */
14184 gcc_assert (!trust_type_canonical
14185 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14187 /* If the types have been previously registered and found equal
14190 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14191 && trust_type_canonical
)
14193 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14194 they are always NULL, but they are set to non-NULL for types
14195 constructed by build_pointer_type and variants. In this case the
14196 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14197 all pointers are considered equal. Be sure to not return false
14199 gcc_checking_assert (canonical_type_used_p (t1
)
14200 && canonical_type_used_p (t2
));
14201 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14204 /* For types where we do ODR based TBAA the canonical type is always
14205 set correctly, so we know that types are different if their
14206 canonical types does not match. */
14207 if (trust_type_canonical
14208 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14209 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14212 /* Can't be the same type if the types don't have the same code. */
14213 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14214 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14217 /* Qualifiers do not matter for canonical type comparison purposes. */
14219 /* Void types and nullptr types are always the same. */
14220 if (TREE_CODE (t1
) == VOID_TYPE
14221 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14224 /* Can't be the same type if they have different mode. */
14225 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14228 /* Non-aggregate types can be handled cheaply. */
14229 if (INTEGRAL_TYPE_P (t1
)
14230 || SCALAR_FLOAT_TYPE_P (t1
)
14231 || FIXED_POINT_TYPE_P (t1
)
14232 || TREE_CODE (t1
) == VECTOR_TYPE
14233 || TREE_CODE (t1
) == COMPLEX_TYPE
14234 || TREE_CODE (t1
) == OFFSET_TYPE
14235 || POINTER_TYPE_P (t1
))
14237 /* Can't be the same type if they have different recision. */
14238 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14241 /* In some cases the signed and unsigned types are required to be
14243 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14244 && !type_with_interoperable_signedness (t1
))
14247 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14248 interoperable with "signed char". Unless all frontends are revisited
14249 to agree on these types, we must ignore the flag completely. */
14251 /* Fortran standard define C_PTR type that is compatible with every
14252 C pointer. For this reason we need to glob all pointers into one.
14253 Still pointers in different address spaces are not compatible. */
14254 if (POINTER_TYPE_P (t1
))
14256 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14257 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14261 /* Tail-recurse to components. */
14262 if (TREE_CODE (t1
) == VECTOR_TYPE
14263 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14264 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14266 trust_type_canonical
);
14271 /* Do type-specific comparisons. */
14272 switch (TREE_CODE (t1
))
14275 /* Array types are the same if the element types are the same and
14276 the number of elements are the same. */
14277 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14278 trust_type_canonical
)
14279 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14280 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14281 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14285 tree i1
= TYPE_DOMAIN (t1
);
14286 tree i2
= TYPE_DOMAIN (t2
);
14288 /* For an incomplete external array, the type domain can be
14289 NULL_TREE. Check this condition also. */
14290 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14292 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14296 tree min1
= TYPE_MIN_VALUE (i1
);
14297 tree min2
= TYPE_MIN_VALUE (i2
);
14298 tree max1
= TYPE_MAX_VALUE (i1
);
14299 tree max2
= TYPE_MAX_VALUE (i2
);
14301 /* The minimum/maximum values have to be the same. */
14304 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14305 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14306 || operand_equal_p (min1
, min2
, 0))))
14309 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14310 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14311 || operand_equal_p (max1
, max2
, 0)))))
14319 case FUNCTION_TYPE
:
14320 /* Function types are the same if the return type and arguments types
14322 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14323 trust_type_canonical
))
14326 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14330 tree parms1
, parms2
;
14332 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14334 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14336 if (!gimple_canonical_types_compatible_p
14337 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14338 trust_type_canonical
))
14342 if (parms1
|| parms2
)
14350 case QUAL_UNION_TYPE
:
14354 /* Don't try to compare variants of an incomplete type, before
14355 TYPE_FIELDS has been copied around. */
14356 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14360 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14363 /* For aggregate types, all the fields must be the same. */
14364 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14366 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14368 /* Skip non-fields and zero-sized fields. */
14369 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14371 && integer_zerop (DECL_SIZE (f1
)))))
14372 f1
= TREE_CHAIN (f1
);
14373 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14375 && integer_zerop (DECL_SIZE (f2
)))))
14376 f2
= TREE_CHAIN (f2
);
14379 /* The fields must have the same name, offset and type. */
14380 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14381 || !gimple_compare_field_offset (f1
, f2
)
14382 || !gimple_canonical_types_compatible_p
14383 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14384 trust_type_canonical
))
14388 /* If one aggregate has more fields than the other, they
14389 are not the same. */
14397 /* Consider all types with language specific trees in them mutually
14398 compatible. This is executed only from verify_type and false
14399 positives can be tolerated. */
14400 gcc_assert (!in_lto_p
);
14405 /* Verify type T. */
14408 verify_type (const_tree t
)
14410 bool error_found
= false;
14411 tree mv
= TYPE_MAIN_VARIANT (t
);
14414 error ("main variant is not defined");
14415 error_found
= true;
14417 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14419 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14421 error_found
= true;
14423 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14424 error_found
= true;
14426 tree ct
= TYPE_CANONICAL (t
);
14429 else if (TYPE_CANONICAL (t
) != ct
)
14431 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14433 error_found
= true;
14435 /* Method and function types cannot be used to address memory and thus
14436 TYPE_CANONICAL really matters only for determining useless conversions.
14438 FIXME: C++ FE produce declarations of builtin functions that are not
14439 compatible with main variants. */
14440 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14443 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14444 with variably sized arrays because their sizes possibly
14445 gimplified to different variables. */
14446 && !variably_modified_type_p (ct
, NULL
)
14447 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14448 && COMPLETE_TYPE_P (t
))
14450 error ("%<TYPE_CANONICAL%> is not compatible");
14452 error_found
= true;
14455 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14456 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14458 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14460 error_found
= true;
14462 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14464 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14466 debug_tree (TYPE_MAIN_VARIANT (ct
));
14467 error_found
= true;
14471 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14472 if (RECORD_OR_UNION_TYPE_P (t
))
14474 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14475 and danagle the pointer from time to time. */
14476 if (TYPE_VFIELD (t
)
14477 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14478 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14480 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14481 debug_tree (TYPE_VFIELD (t
));
14482 error_found
= true;
14485 else if (TREE_CODE (t
) == POINTER_TYPE
)
14487 if (TYPE_NEXT_PTR_TO (t
)
14488 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14490 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14491 debug_tree (TYPE_NEXT_PTR_TO (t
));
14492 error_found
= true;
14495 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14497 if (TYPE_NEXT_REF_TO (t
)
14498 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14500 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14501 debug_tree (TYPE_NEXT_REF_TO (t
));
14502 error_found
= true;
14505 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14506 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14508 /* FIXME: The following check should pass:
14509 useless_type_conversion_p (const_cast <tree> (t),
14510 TREE_TYPE (TYPE_MIN_VALUE (t))
14511 but does not for C sizetypes in LTO. */
14514 /* Check various uses of TYPE_MAXVAL_RAW. */
14515 if (RECORD_OR_UNION_TYPE_P (t
))
14517 if (!TYPE_BINFO (t
))
14519 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14521 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14522 debug_tree (TYPE_BINFO (t
));
14523 error_found
= true;
14525 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14527 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14528 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14529 error_found
= true;
14532 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14534 if (TYPE_METHOD_BASETYPE (t
)
14535 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14536 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14538 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14539 debug_tree (TYPE_METHOD_BASETYPE (t
));
14540 error_found
= true;
14543 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14545 if (TYPE_OFFSET_BASETYPE (t
)
14546 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14547 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14549 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14550 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14551 error_found
= true;
14554 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14555 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14557 /* FIXME: The following check should pass:
14558 useless_type_conversion_p (const_cast <tree> (t),
14559 TREE_TYPE (TYPE_MAX_VALUE (t))
14560 but does not for C sizetypes in LTO. */
14562 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14564 if (TYPE_ARRAY_MAX_SIZE (t
)
14565 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14567 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14568 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14569 error_found
= true;
14572 else if (TYPE_MAX_VALUE_RAW (t
))
14574 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14575 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14576 error_found
= true;
14579 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14581 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14582 debug_tree (TYPE_LANG_SLOT_1 (t
));
14583 error_found
= true;
14586 /* Check various uses of TYPE_VALUES_RAW. */
14587 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14588 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14590 tree value
= TREE_VALUE (l
);
14591 tree name
= TREE_PURPOSE (l
);
14593 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14594 CONST_DECL of ENUMERAL TYPE. */
14595 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14597 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14598 debug_tree (value
);
14600 error_found
= true;
14602 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14603 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14605 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14607 debug_tree (value
);
14609 error_found
= true;
14611 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14613 error ("enum value name is not %<IDENTIFIER_NODE%>");
14614 debug_tree (value
);
14616 error_found
= true;
14619 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14621 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14623 error ("array %<TYPE_DOMAIN%> is not integer type");
14624 debug_tree (TYPE_DOMAIN (t
));
14625 error_found
= true;
14628 else if (RECORD_OR_UNION_TYPE_P (t
))
14630 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14632 error ("%<TYPE_FIELDS%> defined in incomplete type");
14633 error_found
= true;
14635 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14637 /* TODO: verify properties of decls. */
14638 if (TREE_CODE (fld
) == FIELD_DECL
)
14640 else if (TREE_CODE (fld
) == TYPE_DECL
)
14642 else if (TREE_CODE (fld
) == CONST_DECL
)
14644 else if (VAR_P (fld
))
14646 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14648 else if (TREE_CODE (fld
) == USING_DECL
)
14650 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14654 error ("wrong tree in %<TYPE_FIELDS%> list");
14656 error_found
= true;
14660 else if (TREE_CODE (t
) == INTEGER_TYPE
14661 || TREE_CODE (t
) == BOOLEAN_TYPE
14662 || TREE_CODE (t
) == OFFSET_TYPE
14663 || TREE_CODE (t
) == REFERENCE_TYPE
14664 || TREE_CODE (t
) == NULLPTR_TYPE
14665 || TREE_CODE (t
) == POINTER_TYPE
)
14667 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14669 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14671 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14672 error_found
= true;
14674 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14676 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14677 debug_tree (TYPE_CACHED_VALUES (t
));
14678 error_found
= true;
14680 /* Verify just enough of cache to ensure that no one copied it to new type.
14681 All copying should go by copy_node that should clear it. */
14682 else if (TYPE_CACHED_VALUES_P (t
))
14685 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14686 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14687 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14689 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14690 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14691 error_found
= true;
14696 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14697 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14699 /* C++ FE uses TREE_PURPOSE to store initial values. */
14700 if (TREE_PURPOSE (l
) && in_lto_p
)
14702 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14704 error_found
= true;
14706 if (!TYPE_P (TREE_VALUE (l
)))
14708 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14710 error_found
= true;
14713 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14715 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14716 debug_tree (TYPE_VALUES_RAW (t
));
14717 error_found
= true;
14719 if (TREE_CODE (t
) != INTEGER_TYPE
14720 && TREE_CODE (t
) != BOOLEAN_TYPE
14721 && TREE_CODE (t
) != OFFSET_TYPE
14722 && TREE_CODE (t
) != REFERENCE_TYPE
14723 && TREE_CODE (t
) != NULLPTR_TYPE
14724 && TREE_CODE (t
) != POINTER_TYPE
14725 && TYPE_CACHED_VALUES_P (t
))
14727 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14728 error_found
= true;
14731 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14732 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14734 if (TREE_CODE (t
) == METHOD_TYPE
14735 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14737 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14738 error_found
= true;
14743 debug_tree (const_cast <tree
> (t
));
14744 internal_error ("%qs failed", __func__
);
14749 /* Return 1 if ARG interpreted as signed in its precision is known to be
14750 always positive or 2 if ARG is known to be always negative, or 3 if
14751 ARG may be positive or negative. */
14754 get_range_pos_neg (tree arg
)
14756 if (arg
== error_mark_node
)
14759 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14761 if (TREE_CODE (arg
) == INTEGER_CST
)
14763 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14769 while (CONVERT_EXPR_P (arg
)
14770 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14771 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14773 arg
= TREE_OPERAND (arg
, 0);
14774 /* Narrower value zero extended into wider type
14775 will always result in positive values. */
14776 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14777 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14779 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14784 if (TREE_CODE (arg
) != SSA_NAME
)
14786 wide_int arg_min
, arg_max
;
14787 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14789 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14790 if (is_gimple_assign (g
)
14791 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14793 tree t
= gimple_assign_rhs1 (g
);
14794 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14795 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14797 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14798 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14800 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14809 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14811 /* For unsigned values, the "positive" range comes
14812 below the "negative" range. */
14813 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14815 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14820 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14822 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14831 /* Return true if ARG is marked with the nonnull attribute in the
14832 current function signature. */
14835 nonnull_arg_p (const_tree arg
)
14837 tree t
, attrs
, fntype
;
14838 unsigned HOST_WIDE_INT arg_num
;
14840 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14841 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14842 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14844 /* The static chain decl is always non null. */
14845 if (arg
== cfun
->static_chain_decl
)
14848 /* THIS argument of method is always non-NULL. */
14849 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14850 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14851 && flag_delete_null_pointer_checks
)
14854 /* Values passed by reference are always non-NULL. */
14855 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14856 && flag_delete_null_pointer_checks
)
14859 fntype
= TREE_TYPE (cfun
->decl
);
14860 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14862 attrs
= lookup_attribute ("nonnull", attrs
);
14864 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14865 if (attrs
== NULL_TREE
)
14868 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14869 if (TREE_VALUE (attrs
) == NULL_TREE
)
14872 /* Get the position number for ARG in the function signature. */
14873 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14875 t
= DECL_CHAIN (t
), arg_num
++)
14881 gcc_assert (t
== arg
);
14883 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14884 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14886 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14894 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14898 set_block (location_t loc
, tree block
)
14900 location_t pure_loc
= get_pure_location (loc
);
14901 source_range src_range
= get_range_from_loc (line_table
, loc
);
14902 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14906 set_source_range (tree expr
, location_t start
, location_t finish
)
14908 source_range src_range
;
14909 src_range
.m_start
= start
;
14910 src_range
.m_finish
= finish
;
14911 return set_source_range (expr
, src_range
);
14915 set_source_range (tree expr
, source_range src_range
)
14917 if (!EXPR_P (expr
))
14918 return UNKNOWN_LOCATION
;
14920 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14921 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14925 SET_EXPR_LOCATION (expr
, adhoc
);
14929 /* Return EXPR, potentially wrapped with a node expression LOC,
14930 if !CAN_HAVE_LOCATION_P (expr).
14932 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14933 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14935 Wrapper nodes can be identified using location_wrapper_p. */
14938 maybe_wrap_with_location (tree expr
, location_t loc
)
14942 if (loc
== UNKNOWN_LOCATION
)
14944 if (CAN_HAVE_LOCATION_P (expr
))
14946 /* We should only be adding wrappers for constants and for decls,
14947 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14948 gcc_assert (CONSTANT_CLASS_P (expr
)
14950 || EXCEPTIONAL_CLASS_P (expr
));
14952 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14953 any impact of the wrapper nodes. */
14954 if (EXCEPTIONAL_CLASS_P (expr
))
14957 /* If any auto_suppress_location_wrappers are active, don't create
14959 if (suppress_location_wrappers
> 0)
14963 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14964 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14965 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14966 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14967 /* Mark this node as being a wrapper. */
14968 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14972 int suppress_location_wrappers
;
14974 /* Return the name of combined function FN, for debugging purposes. */
14977 combined_fn_name (combined_fn fn
)
14979 if (builtin_fn_p (fn
))
14981 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14982 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14985 return internal_fn_name (as_internal_fn (fn
));
14988 /* Return a bitmap with a bit set corresponding to each argument in
14989 a function call type FNTYPE declared with attribute nonnull,
14990 or null if none of the function's argument are nonnull. The caller
14991 must free the bitmap. */
14994 get_nonnull_args (const_tree fntype
)
14996 if (fntype
== NULL_TREE
)
14999 bitmap argmap
= NULL
;
15000 if (TREE_CODE (fntype
) == METHOD_TYPE
)
15002 /* The this pointer in C++ non-static member functions is
15003 implicitly nonnull whether or not it's declared as such. */
15004 argmap
= BITMAP_ALLOC (NULL
);
15005 bitmap_set_bit (argmap
, 0);
15008 tree attrs
= TYPE_ATTRIBUTES (fntype
);
15012 /* A function declaration can specify multiple attribute nonnull,
15013 each with zero or more arguments. The loop below creates a bitmap
15014 representing a union of all the arguments. An empty (but non-null)
15015 bitmap means that all arguments have been declaraed nonnull. */
15016 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
15018 attrs
= lookup_attribute ("nonnull", attrs
);
15023 argmap
= BITMAP_ALLOC (NULL
);
15025 if (!TREE_VALUE (attrs
))
15027 /* Clear the bitmap in case a previous attribute nonnull
15028 set it and this one overrides it for all arguments. */
15029 bitmap_clear (argmap
);
15033 /* Iterate over the indices of the format arguments declared nonnull
15034 and set a bit for each. */
15035 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
15037 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
15038 bitmap_set_bit (argmap
, val
);
15045 /* Returns true if TYPE is a type where it and all of its subobjects
15046 (recursively) are of structure, union, or array type. */
15049 default_is_empty_type (tree type
)
15051 if (RECORD_OR_UNION_TYPE_P (type
))
15053 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
15054 if (TREE_CODE (field
) == FIELD_DECL
15055 && !DECL_PADDING_P (field
)
15056 && !default_is_empty_type (TREE_TYPE (field
)))
15060 else if (TREE_CODE (type
) == ARRAY_TYPE
)
15061 return (integer_minus_onep (array_type_nelts (type
))
15062 || TYPE_DOMAIN (type
) == NULL_TREE
15063 || default_is_empty_type (TREE_TYPE (type
)));
15067 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15068 that shouldn't be passed via stack. */
15071 default_is_empty_record (const_tree type
)
15073 if (!abi_version_at_least (12))
15076 if (type
== error_mark_node
)
15079 if (TREE_ADDRESSABLE (type
))
15082 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
15085 /* Determine whether TYPE is a structure with a flexible array member,
15086 or a union containing such a structure (possibly recursively). */
15089 flexible_array_type_p (const_tree type
)
15092 switch (TREE_CODE (type
))
15096 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15097 if (TREE_CODE (x
) == FIELD_DECL
)
15099 if (last
== NULL_TREE
)
15101 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
15102 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
15103 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
15104 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
15108 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15110 if (TREE_CODE (x
) == FIELD_DECL
15111 && flexible_array_type_p (TREE_TYPE (x
)))
15120 /* Like int_size_in_bytes, but handle empty records specially. */
15123 arg_int_size_in_bytes (const_tree type
)
15125 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15128 /* Like size_in_bytes, but handle empty records specially. */
15131 arg_size_in_bytes (const_tree type
)
15133 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15136 /* Return true if an expression with CODE has to have the same result type as
15137 its first operand. */
15140 expr_type_first_operand_type_p (tree_code code
)
15153 case TRUNC_DIV_EXPR
:
15154 case CEIL_DIV_EXPR
:
15155 case FLOOR_DIV_EXPR
:
15156 case ROUND_DIV_EXPR
:
15157 case TRUNC_MOD_EXPR
:
15158 case CEIL_MOD_EXPR
:
15159 case FLOOR_MOD_EXPR
:
15160 case ROUND_MOD_EXPR
:
15162 case EXACT_DIV_EXPR
:
15180 /* Return a typenode for the "standard" C type with a given name. */
15182 get_typenode_from_name (const char *name
)
15184 if (name
== NULL
|| *name
== '\0')
15187 if (strcmp (name
, "char") == 0)
15188 return char_type_node
;
15189 if (strcmp (name
, "unsigned char") == 0)
15190 return unsigned_char_type_node
;
15191 if (strcmp (name
, "signed char") == 0)
15192 return signed_char_type_node
;
15194 if (strcmp (name
, "short int") == 0)
15195 return short_integer_type_node
;
15196 if (strcmp (name
, "short unsigned int") == 0)
15197 return short_unsigned_type_node
;
15199 if (strcmp (name
, "int") == 0)
15200 return integer_type_node
;
15201 if (strcmp (name
, "unsigned int") == 0)
15202 return unsigned_type_node
;
15204 if (strcmp (name
, "long int") == 0)
15205 return long_integer_type_node
;
15206 if (strcmp (name
, "long unsigned int") == 0)
15207 return long_unsigned_type_node
;
15209 if (strcmp (name
, "long long int") == 0)
15210 return long_long_integer_type_node
;
15211 if (strcmp (name
, "long long unsigned int") == 0)
15212 return long_long_unsigned_type_node
;
15214 gcc_unreachable ();
15217 /* List of pointer types used to declare builtins before we have seen their
15220 Keep the size up to date in tree.h ! */
15221 const builtin_structptr_type builtin_structptr_types
[6] =
15223 { fileptr_type_node
, ptr_type_node
, "FILE" },
15224 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15225 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15226 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15227 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15228 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15231 /* Return the maximum object size. */
15234 max_object_size (void)
15236 /* To do: Make this a configurable parameter. */
15237 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15240 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15241 parameter default to false and that weeds out error_mark_node. */
15244 verify_type_context (location_t loc
, type_context_kind context
,
15245 const_tree type
, bool silent_p
)
15247 if (type
== error_mark_node
)
15250 gcc_assert (TYPE_P (type
));
15251 return (!targetm
.verify_type_context
15252 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
15257 namespace selftest
{
15259 /* Selftests for tree. */
15261 /* Verify that integer constants are sane. */
15264 test_integer_constants ()
15266 ASSERT_TRUE (integer_type_node
!= NULL
);
15267 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15269 tree type
= integer_type_node
;
15271 tree zero
= build_zero_cst (type
);
15272 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15273 ASSERT_EQ (type
, TREE_TYPE (zero
));
15275 tree one
= build_int_cst (type
, 1);
15276 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15277 ASSERT_EQ (type
, TREE_TYPE (zero
));
15280 /* Verify identifiers. */
15283 test_identifiers ()
15285 tree identifier
= get_identifier ("foo");
15286 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15287 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15290 /* Verify LABEL_DECL. */
15295 tree identifier
= get_identifier ("err");
15296 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15297 identifier
, void_type_node
);
15298 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15299 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15302 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15303 are given by VALS. */
15306 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15308 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15309 tree_vector_builder
builder (type
, vals
.length (), 1);
15310 builder
.splice (vals
);
15311 return builder
.build ();
15314 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15317 check_vector_cst (vec
<tree
> expected
, tree actual
)
15319 ASSERT_KNOWN_EQ (expected
.length (),
15320 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15321 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15322 ASSERT_EQ (wi::to_wide (expected
[i
]),
15323 wi::to_wide (vector_cst_elt (actual
, i
)));
15326 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15327 and that its elements match EXPECTED. */
15330 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15331 unsigned int npatterns
)
15333 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15334 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15335 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15336 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15337 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15338 check_vector_cst (expected
, actual
);
15341 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15342 and NPATTERNS background elements, and that its elements match
15346 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15347 unsigned int npatterns
)
15349 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15350 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15351 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15352 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15353 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15354 check_vector_cst (expected
, actual
);
15357 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15358 and that its elements match EXPECTED. */
15361 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15362 unsigned int npatterns
)
15364 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15365 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15366 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15367 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15368 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15369 check_vector_cst (expected
, actual
);
15372 /* Test the creation of VECTOR_CSTs. */
15375 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15377 auto_vec
<tree
, 8> elements (8);
15378 elements
.quick_grow (8);
15379 tree element_type
= build_nonstandard_integer_type (16, true);
15380 tree vector_type
= build_vector_type (element_type
, 8);
15382 /* Test a simple linear series with a base of 0 and a step of 1:
15383 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15384 for (unsigned int i
= 0; i
< 8; ++i
)
15385 elements
[i
] = build_int_cst (element_type
, i
);
15386 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15387 check_vector_cst_stepped (elements
, vector
, 1);
15389 /* Try the same with the first element replaced by 100:
15390 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15391 elements
[0] = build_int_cst (element_type
, 100);
15392 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15393 check_vector_cst_stepped (elements
, vector
, 1);
15395 /* Try a series that wraps around.
15396 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15397 for (unsigned int i
= 1; i
< 8; ++i
)
15398 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15399 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15400 check_vector_cst_stepped (elements
, vector
, 1);
15402 /* Try a downward series:
15403 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15404 for (unsigned int i
= 1; i
< 8; ++i
)
15405 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15406 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15407 check_vector_cst_stepped (elements
, vector
, 1);
15409 /* Try two interleaved series with different bases and steps:
15410 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15411 elements
[1] = build_int_cst (element_type
, 53);
15412 for (unsigned int i
= 2; i
< 8; i
+= 2)
15414 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15415 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15417 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15418 check_vector_cst_stepped (elements
, vector
, 2);
15420 /* Try a duplicated value:
15421 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15422 for (unsigned int i
= 1; i
< 8; ++i
)
15423 elements
[i
] = elements
[0];
15424 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15425 check_vector_cst_duplicate (elements
, vector
, 1);
15427 /* Try an interleaved duplicated value:
15428 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15429 elements
[1] = build_int_cst (element_type
, 55);
15430 for (unsigned int i
= 2; i
< 8; ++i
)
15431 elements
[i
] = elements
[i
- 2];
15432 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15433 check_vector_cst_duplicate (elements
, vector
, 2);
15435 /* Try a duplicated value with 2 exceptions
15436 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15437 elements
[0] = build_int_cst (element_type
, 41);
15438 elements
[1] = build_int_cst (element_type
, 97);
15439 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15440 check_vector_cst_fill (elements
, vector
, 2);
15442 /* Try with and without a step
15443 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15444 for (unsigned int i
= 3; i
< 8; i
+= 2)
15445 elements
[i
] = build_int_cst (element_type
, i
* 7);
15446 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15447 check_vector_cst_stepped (elements
, vector
, 2);
15449 /* Try a fully-general constant:
15450 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15451 elements
[5] = build_int_cst (element_type
, 9990);
15452 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15453 check_vector_cst_fill (elements
, vector
, 4);
15456 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15457 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15458 modifying its argument in-place. */
15461 check_strip_nops (tree node
, tree expected
)
15464 ASSERT_EQ (expected
, node
);
15467 /* Verify location wrappers. */
15470 test_location_wrappers ()
15472 location_t loc
= BUILTINS_LOCATION
;
15474 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15476 /* Wrapping a constant. */
15477 tree int_cst
= build_int_cst (integer_type_node
, 42);
15478 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15479 ASSERT_FALSE (location_wrapper_p (int_cst
));
15481 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15482 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15483 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15484 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15486 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15487 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15489 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15490 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15491 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15492 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15494 /* Wrapping a STRING_CST. */
15495 tree string_cst
= build_string (4, "foo");
15496 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15497 ASSERT_FALSE (location_wrapper_p (string_cst
));
15499 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15500 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15501 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15502 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15503 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15506 /* Wrapping a variable. */
15507 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15508 get_identifier ("some_int_var"),
15509 integer_type_node
);
15510 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15511 ASSERT_FALSE (location_wrapper_p (int_var
));
15513 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15514 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15515 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15516 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15518 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15520 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15521 ASSERT_FALSE (location_wrapper_p (r_cast
));
15522 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15524 /* Verify that STRIP_NOPS removes wrappers. */
15525 check_strip_nops (wrapped_int_cst
, int_cst
);
15526 check_strip_nops (wrapped_string_cst
, string_cst
);
15527 check_strip_nops (wrapped_int_var
, int_var
);
15530 /* Test various tree predicates. Verify that location wrappers don't
15531 affect the results. */
15536 /* Build various constants and wrappers around them. */
15538 location_t loc
= BUILTINS_LOCATION
;
15540 tree i_0
= build_int_cst (integer_type_node
, 0);
15541 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15543 tree i_1
= build_int_cst (integer_type_node
, 1);
15544 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15546 tree i_m1
= build_int_cst (integer_type_node
, -1);
15547 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15549 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15550 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15551 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15552 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15553 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15554 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15556 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15557 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15558 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15560 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15561 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15562 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15564 /* TODO: vector constants. */
15566 /* Test integer_onep. */
15567 ASSERT_FALSE (integer_onep (i_0
));
15568 ASSERT_FALSE (integer_onep (wr_i_0
));
15569 ASSERT_TRUE (integer_onep (i_1
));
15570 ASSERT_TRUE (integer_onep (wr_i_1
));
15571 ASSERT_FALSE (integer_onep (i_m1
));
15572 ASSERT_FALSE (integer_onep (wr_i_m1
));
15573 ASSERT_FALSE (integer_onep (f_0
));
15574 ASSERT_FALSE (integer_onep (wr_f_0
));
15575 ASSERT_FALSE (integer_onep (f_1
));
15576 ASSERT_FALSE (integer_onep (wr_f_1
));
15577 ASSERT_FALSE (integer_onep (f_m1
));
15578 ASSERT_FALSE (integer_onep (wr_f_m1
));
15579 ASSERT_FALSE (integer_onep (c_i_0
));
15580 ASSERT_TRUE (integer_onep (c_i_1
));
15581 ASSERT_FALSE (integer_onep (c_i_m1
));
15582 ASSERT_FALSE (integer_onep (c_f_0
));
15583 ASSERT_FALSE (integer_onep (c_f_1
));
15584 ASSERT_FALSE (integer_onep (c_f_m1
));
15586 /* Test integer_zerop. */
15587 ASSERT_TRUE (integer_zerop (i_0
));
15588 ASSERT_TRUE (integer_zerop (wr_i_0
));
15589 ASSERT_FALSE (integer_zerop (i_1
));
15590 ASSERT_FALSE (integer_zerop (wr_i_1
));
15591 ASSERT_FALSE (integer_zerop (i_m1
));
15592 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15593 ASSERT_FALSE (integer_zerop (f_0
));
15594 ASSERT_FALSE (integer_zerop (wr_f_0
));
15595 ASSERT_FALSE (integer_zerop (f_1
));
15596 ASSERT_FALSE (integer_zerop (wr_f_1
));
15597 ASSERT_FALSE (integer_zerop (f_m1
));
15598 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15599 ASSERT_TRUE (integer_zerop (c_i_0
));
15600 ASSERT_FALSE (integer_zerop (c_i_1
));
15601 ASSERT_FALSE (integer_zerop (c_i_m1
));
15602 ASSERT_FALSE (integer_zerop (c_f_0
));
15603 ASSERT_FALSE (integer_zerop (c_f_1
));
15604 ASSERT_FALSE (integer_zerop (c_f_m1
));
15606 /* Test integer_all_onesp. */
15607 ASSERT_FALSE (integer_all_onesp (i_0
));
15608 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15609 ASSERT_FALSE (integer_all_onesp (i_1
));
15610 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15611 ASSERT_TRUE (integer_all_onesp (i_m1
));
15612 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15613 ASSERT_FALSE (integer_all_onesp (f_0
));
15614 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15615 ASSERT_FALSE (integer_all_onesp (f_1
));
15616 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15617 ASSERT_FALSE (integer_all_onesp (f_m1
));
15618 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15619 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15620 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15621 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15622 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15623 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15624 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15626 /* Test integer_minus_onep. */
15627 ASSERT_FALSE (integer_minus_onep (i_0
));
15628 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15629 ASSERT_FALSE (integer_minus_onep (i_1
));
15630 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15631 ASSERT_TRUE (integer_minus_onep (i_m1
));
15632 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15633 ASSERT_FALSE (integer_minus_onep (f_0
));
15634 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15635 ASSERT_FALSE (integer_minus_onep (f_1
));
15636 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15637 ASSERT_FALSE (integer_minus_onep (f_m1
));
15638 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15639 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15640 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15641 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15642 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15643 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15644 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15646 /* Test integer_each_onep. */
15647 ASSERT_FALSE (integer_each_onep (i_0
));
15648 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15649 ASSERT_TRUE (integer_each_onep (i_1
));
15650 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15651 ASSERT_FALSE (integer_each_onep (i_m1
));
15652 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15653 ASSERT_FALSE (integer_each_onep (f_0
));
15654 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15655 ASSERT_FALSE (integer_each_onep (f_1
));
15656 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15657 ASSERT_FALSE (integer_each_onep (f_m1
));
15658 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15659 ASSERT_FALSE (integer_each_onep (c_i_0
));
15660 ASSERT_FALSE (integer_each_onep (c_i_1
));
15661 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15662 ASSERT_FALSE (integer_each_onep (c_f_0
));
15663 ASSERT_FALSE (integer_each_onep (c_f_1
));
15664 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15666 /* Test integer_truep. */
15667 ASSERT_FALSE (integer_truep (i_0
));
15668 ASSERT_FALSE (integer_truep (wr_i_0
));
15669 ASSERT_TRUE (integer_truep (i_1
));
15670 ASSERT_TRUE (integer_truep (wr_i_1
));
15671 ASSERT_FALSE (integer_truep (i_m1
));
15672 ASSERT_FALSE (integer_truep (wr_i_m1
));
15673 ASSERT_FALSE (integer_truep (f_0
));
15674 ASSERT_FALSE (integer_truep (wr_f_0
));
15675 ASSERT_FALSE (integer_truep (f_1
));
15676 ASSERT_FALSE (integer_truep (wr_f_1
));
15677 ASSERT_FALSE (integer_truep (f_m1
));
15678 ASSERT_FALSE (integer_truep (wr_f_m1
));
15679 ASSERT_FALSE (integer_truep (c_i_0
));
15680 ASSERT_TRUE (integer_truep (c_i_1
));
15681 ASSERT_FALSE (integer_truep (c_i_m1
));
15682 ASSERT_FALSE (integer_truep (c_f_0
));
15683 ASSERT_FALSE (integer_truep (c_f_1
));
15684 ASSERT_FALSE (integer_truep (c_f_m1
));
15686 /* Test integer_nonzerop. */
15687 ASSERT_FALSE (integer_nonzerop (i_0
));
15688 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15689 ASSERT_TRUE (integer_nonzerop (i_1
));
15690 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15691 ASSERT_TRUE (integer_nonzerop (i_m1
));
15692 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15693 ASSERT_FALSE (integer_nonzerop (f_0
));
15694 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15695 ASSERT_FALSE (integer_nonzerop (f_1
));
15696 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15697 ASSERT_FALSE (integer_nonzerop (f_m1
));
15698 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15699 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15700 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15701 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15702 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15703 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15704 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15706 /* Test real_zerop. */
15707 ASSERT_FALSE (real_zerop (i_0
));
15708 ASSERT_FALSE (real_zerop (wr_i_0
));
15709 ASSERT_FALSE (real_zerop (i_1
));
15710 ASSERT_FALSE (real_zerop (wr_i_1
));
15711 ASSERT_FALSE (real_zerop (i_m1
));
15712 ASSERT_FALSE (real_zerop (wr_i_m1
));
15713 ASSERT_TRUE (real_zerop (f_0
));
15714 ASSERT_TRUE (real_zerop (wr_f_0
));
15715 ASSERT_FALSE (real_zerop (f_1
));
15716 ASSERT_FALSE (real_zerop (wr_f_1
));
15717 ASSERT_FALSE (real_zerop (f_m1
));
15718 ASSERT_FALSE (real_zerop (wr_f_m1
));
15719 ASSERT_FALSE (real_zerop (c_i_0
));
15720 ASSERT_FALSE (real_zerop (c_i_1
));
15721 ASSERT_FALSE (real_zerop (c_i_m1
));
15722 ASSERT_TRUE (real_zerop (c_f_0
));
15723 ASSERT_FALSE (real_zerop (c_f_1
));
15724 ASSERT_FALSE (real_zerop (c_f_m1
));
15726 /* Test real_onep. */
15727 ASSERT_FALSE (real_onep (i_0
));
15728 ASSERT_FALSE (real_onep (wr_i_0
));
15729 ASSERT_FALSE (real_onep (i_1
));
15730 ASSERT_FALSE (real_onep (wr_i_1
));
15731 ASSERT_FALSE (real_onep (i_m1
));
15732 ASSERT_FALSE (real_onep (wr_i_m1
));
15733 ASSERT_FALSE (real_onep (f_0
));
15734 ASSERT_FALSE (real_onep (wr_f_0
));
15735 ASSERT_TRUE (real_onep (f_1
));
15736 ASSERT_TRUE (real_onep (wr_f_1
));
15737 ASSERT_FALSE (real_onep (f_m1
));
15738 ASSERT_FALSE (real_onep (wr_f_m1
));
15739 ASSERT_FALSE (real_onep (c_i_0
));
15740 ASSERT_FALSE (real_onep (c_i_1
));
15741 ASSERT_FALSE (real_onep (c_i_m1
));
15742 ASSERT_FALSE (real_onep (c_f_0
));
15743 ASSERT_TRUE (real_onep (c_f_1
));
15744 ASSERT_FALSE (real_onep (c_f_m1
));
15746 /* Test real_minus_onep. */
15747 ASSERT_FALSE (real_minus_onep (i_0
));
15748 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15749 ASSERT_FALSE (real_minus_onep (i_1
));
15750 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15751 ASSERT_FALSE (real_minus_onep (i_m1
));
15752 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15753 ASSERT_FALSE (real_minus_onep (f_0
));
15754 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15755 ASSERT_FALSE (real_minus_onep (f_1
));
15756 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15757 ASSERT_TRUE (real_minus_onep (f_m1
));
15758 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15759 ASSERT_FALSE (real_minus_onep (c_i_0
));
15760 ASSERT_FALSE (real_minus_onep (c_i_1
));
15761 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15762 ASSERT_FALSE (real_minus_onep (c_f_0
));
15763 ASSERT_FALSE (real_minus_onep (c_f_1
));
15764 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15767 ASSERT_TRUE (zerop (i_0
));
15768 ASSERT_TRUE (zerop (wr_i_0
));
15769 ASSERT_FALSE (zerop (i_1
));
15770 ASSERT_FALSE (zerop (wr_i_1
));
15771 ASSERT_FALSE (zerop (i_m1
));
15772 ASSERT_FALSE (zerop (wr_i_m1
));
15773 ASSERT_TRUE (zerop (f_0
));
15774 ASSERT_TRUE (zerop (wr_f_0
));
15775 ASSERT_FALSE (zerop (f_1
));
15776 ASSERT_FALSE (zerop (wr_f_1
));
15777 ASSERT_FALSE (zerop (f_m1
));
15778 ASSERT_FALSE (zerop (wr_f_m1
));
15779 ASSERT_TRUE (zerop (c_i_0
));
15780 ASSERT_FALSE (zerop (c_i_1
));
15781 ASSERT_FALSE (zerop (c_i_m1
));
15782 ASSERT_TRUE (zerop (c_f_0
));
15783 ASSERT_FALSE (zerop (c_f_1
));
15784 ASSERT_FALSE (zerop (c_f_m1
));
15786 /* Test tree_expr_nonnegative_p. */
15787 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15788 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15789 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15790 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15791 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15792 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15793 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15794 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15795 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15796 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15797 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15798 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15799 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15800 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15801 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15802 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15803 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15804 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15806 /* Test tree_expr_nonzero_p. */
15807 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15808 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15809 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15810 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15811 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15812 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15814 /* Test integer_valued_real_p. */
15815 ASSERT_FALSE (integer_valued_real_p (i_0
));
15816 ASSERT_TRUE (integer_valued_real_p (f_0
));
15817 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15818 ASSERT_TRUE (integer_valued_real_p (f_1
));
15819 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15821 /* Test integer_pow2p. */
15822 ASSERT_FALSE (integer_pow2p (i_0
));
15823 ASSERT_TRUE (integer_pow2p (i_1
));
15824 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15826 /* Test uniform_integer_cst_p. */
15827 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15828 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15829 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15830 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15831 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15832 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15833 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15834 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15835 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15836 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15837 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15838 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15839 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15840 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15841 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15842 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15843 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15844 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15847 /* Check that string escaping works correctly. */
15850 test_escaped_strings (void)
15853 escaped_string msg
;
15856 /* ASSERT_STREQ does not accept NULL as a valid test
15857 result, so we have to use ASSERT_EQ instead. */
15858 ASSERT_EQ (NULL
, (const char *) msg
);
15861 ASSERT_STREQ ("", (const char *) msg
);
15863 msg
.escape ("foobar");
15864 ASSERT_STREQ ("foobar", (const char *) msg
);
15866 /* Ensure that we have -fmessage-length set to 0. */
15867 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15868 pp_line_cutoff (global_dc
->printer
) = 0;
15870 msg
.escape ("foo\nbar");
15871 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15873 msg
.escape ("\a\b\f\n\r\t\v");
15874 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15876 /* Now repeat the tests with -fmessage-length set to 5. */
15877 pp_line_cutoff (global_dc
->printer
) = 5;
15879 /* Note that the newline is not translated into an escape. */
15880 msg
.escape ("foo\nbar");
15881 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15883 msg
.escape ("\a\b\f\n\r\t\v");
15884 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15886 /* Restore the original message length setting. */
15887 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15890 /* Run all of the selftests within this file. */
15895 test_integer_constants ();
15896 test_identifiers ();
15898 test_vector_cst_patterns ();
15899 test_location_wrappers ();
15900 test_predicates ();
15901 test_escaped_strings ();
15904 } // namespace selftest
15906 #endif /* CHECKING_P */
15908 #include "gt-tree.h"