1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
57 #include "langhooks-def.h"
58 #include "tree-diagnostic.h"
61 #include "print-tree.h"
62 #include "ipa-utils.h"
64 #include "stringpool.h"
68 #include "tree-vector-builder.h"
69 #include "gimple-fold.h"
70 #include "escaped_string.h"
72 /* Tree code classes. */
74 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
75 #define END_OF_BASE_TREE_CODES tcc_exceptional,
77 const enum tree_code_class tree_code_type
[] = {
78 #include "all-tree.def"
82 #undef END_OF_BASE_TREE_CODES
84 /* Table indexed by tree code giving number of expression
85 operands beyond the fixed part of the node structure.
86 Not used for types or decls. */
88 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
89 #define END_OF_BASE_TREE_CODES 0,
91 const unsigned char tree_code_length
[] = {
92 #include "all-tree.def"
96 #undef END_OF_BASE_TREE_CODES
98 /* Names of tree components.
99 Used for printing out the tree and error messages. */
100 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
101 #define END_OF_BASE_TREE_CODES "@dummy",
103 static const char *const tree_code_name
[] = {
104 #include "all-tree.def"
108 #undef END_OF_BASE_TREE_CODES
110 /* Each tree code class has an associated string representation.
111 These must correspond to the tree_code_class entries. */
113 const char *const tree_code_class_strings
[] =
128 /* obstack.[ch] explicitly declined to prototype this. */
129 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
131 /* Statistics-gathering stuff. */
133 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
134 uint64_t tree_node_counts
[(int) all_kinds
];
135 uint64_t tree_node_sizes
[(int) all_kinds
];
137 /* Keep in sync with tree.h:enum tree_node_kind. */
138 static const char * const tree_node_kind_names
[] = {
157 /* Unique id for next decl created. */
158 static GTY(()) int next_decl_uid
;
159 /* Unique id for next type created. */
160 static GTY(()) unsigned next_type_uid
= 1;
161 /* Unique id for next debug decl created. Use negative numbers,
162 to catch erroneous uses. */
163 static GTY(()) int next_debug_decl_uid
;
165 /* Since we cannot rehash a type after it is in the table, we have to
166 keep the hash code. */
168 struct GTY((for_user
)) type_hash
{
173 /* Initial size of the hash table (rounded to next prime). */
174 #define TYPE_HASH_INITIAL_SIZE 1000
176 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
178 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
179 static bool equal (type_hash
*a
, type_hash
*b
);
182 keep_cache_entry (type_hash
*&t
)
184 return ggc_marked_p (t
->type
);
188 /* Now here is the hash table. When recording a type, it is added to
189 the slot whose index is the hash code. Note that the hash table is
190 used for several kinds of types (function types, array types and
191 array index range types, for now). While all these live in the
192 same table, they are completely independent, and the hash code is
193 computed differently for each of these. */
195 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
197 /* Hash table and temporary node for larger integer const values. */
198 static GTY (()) tree int_cst_node
;
200 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
202 static hashval_t
hash (tree t
);
203 static bool equal (tree x
, tree y
);
206 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
208 /* Class and variable for making sure that there is a single POLY_INT_CST
209 for a given value. */
210 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
212 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
213 static hashval_t
hash (tree t
);
214 static bool equal (tree x
, const compare_type
&y
);
217 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
219 /* Hash table for optimization flags and target option flags. Use the same
220 hash table for both sets of options. Nodes for building the current
221 optimization and target option nodes. The assumption is most of the time
222 the options created will already be in the hash table, so we avoid
223 allocating and freeing up a node repeatably. */
224 static GTY (()) tree cl_optimization_node
;
225 static GTY (()) tree cl_target_option_node
;
227 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
229 static hashval_t
hash (tree t
);
230 static bool equal (tree x
, tree y
);
233 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
235 /* General tree->tree mapping structure for use in hash tables. */
239 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
242 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
244 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
246 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
249 equal (tree_vec_map
*a
, tree_vec_map
*b
)
251 return a
->base
.from
== b
->base
.from
;
255 keep_cache_entry (tree_vec_map
*&m
)
257 return ggc_marked_p (m
->base
.from
);
262 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
264 static void set_type_quals (tree
, int);
265 static void print_type_hash_statistics (void);
266 static void print_debug_expr_statistics (void);
267 static void print_value_expr_statistics (void);
269 static tree
build_array_type_1 (tree
, tree
, bool, bool, bool);
271 tree global_trees
[TI_MAX
];
272 tree integer_types
[itk_none
];
274 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
275 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
277 bool tree_contains_struct
[MAX_TREE_CODES
][64];
279 /* Number of operands for each OpenMP clause. */
280 unsigned const char omp_clause_num_ops
[] =
282 0, /* OMP_CLAUSE_ERROR */
283 1, /* OMP_CLAUSE_PRIVATE */
284 1, /* OMP_CLAUSE_SHARED */
285 1, /* OMP_CLAUSE_FIRSTPRIVATE */
286 2, /* OMP_CLAUSE_LASTPRIVATE */
287 5, /* OMP_CLAUSE_REDUCTION */
288 5, /* OMP_CLAUSE_TASK_REDUCTION */
289 5, /* OMP_CLAUSE_IN_REDUCTION */
290 1, /* OMP_CLAUSE_COPYIN */
291 1, /* OMP_CLAUSE_COPYPRIVATE */
292 3, /* OMP_CLAUSE_LINEAR */
293 2, /* OMP_CLAUSE_ALIGNED */
294 1, /* OMP_CLAUSE_DEPEND */
295 1, /* OMP_CLAUSE_NONTEMPORAL */
296 1, /* OMP_CLAUSE_UNIFORM */
297 1, /* OMP_CLAUSE_TO_DECLARE */
298 1, /* OMP_CLAUSE_LINK */
299 2, /* OMP_CLAUSE_FROM */
300 2, /* OMP_CLAUSE_TO */
301 2, /* OMP_CLAUSE_MAP */
302 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
303 1, /* OMP_CLAUSE_USE_DEVICE_ADDR */
304 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
305 1, /* OMP_CLAUSE_INCLUSIVE */
306 1, /* OMP_CLAUSE_EXCLUSIVE */
307 2, /* OMP_CLAUSE__CACHE_ */
308 2, /* OMP_CLAUSE_GANG */
309 1, /* OMP_CLAUSE_ASYNC */
310 1, /* OMP_CLAUSE_WAIT */
311 0, /* OMP_CLAUSE_AUTO */
312 0, /* OMP_CLAUSE_SEQ */
313 1, /* OMP_CLAUSE__LOOPTEMP_ */
314 1, /* OMP_CLAUSE__REDUCTEMP_ */
315 1, /* OMP_CLAUSE__CONDTEMP_ */
316 1, /* OMP_CLAUSE__SCANTEMP_ */
317 1, /* OMP_CLAUSE_IF */
318 1, /* OMP_CLAUSE_NUM_THREADS */
319 1, /* OMP_CLAUSE_SCHEDULE */
320 0, /* OMP_CLAUSE_NOWAIT */
321 1, /* OMP_CLAUSE_ORDERED */
322 0, /* OMP_CLAUSE_DEFAULT */
323 3, /* OMP_CLAUSE_COLLAPSE */
324 0, /* OMP_CLAUSE_UNTIED */
325 1, /* OMP_CLAUSE_FINAL */
326 0, /* OMP_CLAUSE_MERGEABLE */
327 1, /* OMP_CLAUSE_DEVICE */
328 1, /* OMP_CLAUSE_DIST_SCHEDULE */
329 0, /* OMP_CLAUSE_INBRANCH */
330 0, /* OMP_CLAUSE_NOTINBRANCH */
331 1, /* OMP_CLAUSE_NUM_TEAMS */
332 1, /* OMP_CLAUSE_THREAD_LIMIT */
333 0, /* OMP_CLAUSE_PROC_BIND */
334 1, /* OMP_CLAUSE_SAFELEN */
335 1, /* OMP_CLAUSE_SIMDLEN */
336 0, /* OMP_CLAUSE_DEVICE_TYPE */
337 0, /* OMP_CLAUSE_FOR */
338 0, /* OMP_CLAUSE_PARALLEL */
339 0, /* OMP_CLAUSE_SECTIONS */
340 0, /* OMP_CLAUSE_TASKGROUP */
341 1, /* OMP_CLAUSE_PRIORITY */
342 1, /* OMP_CLAUSE_GRAINSIZE */
343 1, /* OMP_CLAUSE_NUM_TASKS */
344 0, /* OMP_CLAUSE_NOGROUP */
345 0, /* OMP_CLAUSE_THREADS */
346 0, /* OMP_CLAUSE_SIMD */
347 1, /* OMP_CLAUSE_HINT */
348 0, /* OMP_CLAUSE_DEFAULTMAP */
349 0, /* OMP_CLAUSE_ORDER */
350 0, /* OMP_CLAUSE_BIND */
351 1, /* OMP_CLAUSE__SIMDUID_ */
352 0, /* OMP_CLAUSE__SIMT_ */
353 0, /* OMP_CLAUSE_INDEPENDENT */
354 1, /* OMP_CLAUSE_WORKER */
355 1, /* OMP_CLAUSE_VECTOR */
356 1, /* OMP_CLAUSE_NUM_GANGS */
357 1, /* OMP_CLAUSE_NUM_WORKERS */
358 1, /* OMP_CLAUSE_VECTOR_LENGTH */
359 3, /* OMP_CLAUSE_TILE */
360 2, /* OMP_CLAUSE__GRIDDIM_ */
361 0, /* OMP_CLAUSE_IF_PRESENT */
362 0, /* OMP_CLAUSE_FINALIZE */
365 const char * const omp_clause_code_name
[] =
451 /* Return the tree node structure used by tree code CODE. */
453 static inline enum tree_node_structure_enum
454 tree_node_structure_for_code (enum tree_code code
)
456 switch (TREE_CODE_CLASS (code
))
458 case tcc_declaration
:
461 case CONST_DECL
: return TS_CONST_DECL
;
462 case DEBUG_EXPR_DECL
: return TS_DECL_WRTL
;
463 case FIELD_DECL
: return TS_FIELD_DECL
;
464 case FUNCTION_DECL
: return TS_FUNCTION_DECL
;
465 case LABEL_DECL
: return TS_LABEL_DECL
;
466 case PARM_DECL
: return TS_PARM_DECL
;
467 case RESULT_DECL
: return TS_RESULT_DECL
;
468 case TRANSLATION_UNIT_DECL
: return TS_TRANSLATION_UNIT_DECL
;
469 case TYPE_DECL
: return TS_TYPE_DECL
;
470 case VAR_DECL
: return TS_VAR_DECL
;
471 default: return TS_DECL_NON_COMMON
;
474 case tcc_type
: return TS_TYPE_NON_COMMON
;
482 case tcc_vl_exp
: return TS_EXP
;
484 default: /* tcc_constant and tcc_exceptional */
490 /* tcc_constant cases. */
491 case COMPLEX_CST
: return TS_COMPLEX
;
492 case FIXED_CST
: return TS_FIXED_CST
;
493 case INTEGER_CST
: return TS_INT_CST
;
494 case POLY_INT_CST
: return TS_POLY_INT_CST
;
495 case REAL_CST
: return TS_REAL_CST
;
496 case STRING_CST
: return TS_STRING
;
497 case VECTOR_CST
: return TS_VECTOR
;
498 case VOID_CST
: return TS_TYPED
;
500 /* tcc_exceptional cases. */
501 case BLOCK
: return TS_BLOCK
;
502 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
503 case ERROR_MARK
: return TS_COMMON
;
504 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
505 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
506 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
507 case PLACEHOLDER_EXPR
: return TS_COMMON
;
508 case SSA_NAME
: return TS_SSA_NAME
;
509 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
510 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
511 case TREE_BINFO
: return TS_BINFO
;
512 case TREE_LIST
: return TS_LIST
;
513 case TREE_VEC
: return TS_VEC
;
521 /* Initialize tree_contains_struct to describe the hierarchy of tree
525 initialize_tree_contains_struct (void)
529 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
532 enum tree_node_structure_enum ts_code
;
534 code
= (enum tree_code
) i
;
535 ts_code
= tree_node_structure_for_code (code
);
537 /* Mark the TS structure itself. */
538 tree_contains_struct
[code
][ts_code
] = 1;
540 /* Mark all the structures that TS is derived from. */
545 case TS_OPTIMIZATION
:
546 case TS_TARGET_OPTION
:
552 case TS_POLY_INT_CST
:
561 case TS_STATEMENT_LIST
:
562 MARK_TS_TYPED (code
);
566 case TS_DECL_MINIMAL
:
572 MARK_TS_COMMON (code
);
575 case TS_TYPE_WITH_LANG_SPECIFIC
:
576 MARK_TS_TYPE_COMMON (code
);
579 case TS_TYPE_NON_COMMON
:
580 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
584 MARK_TS_DECL_MINIMAL (code
);
589 MARK_TS_DECL_COMMON (code
);
592 case TS_DECL_NON_COMMON
:
593 MARK_TS_DECL_WITH_VIS (code
);
596 case TS_DECL_WITH_VIS
:
600 MARK_TS_DECL_WRTL (code
);
604 MARK_TS_DECL_COMMON (code
);
608 MARK_TS_DECL_WITH_VIS (code
);
612 case TS_FUNCTION_DECL
:
613 MARK_TS_DECL_NON_COMMON (code
);
616 case TS_TRANSLATION_UNIT_DECL
:
617 MARK_TS_DECL_COMMON (code
);
625 /* Basic consistency checks for attributes used in fold. */
626 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
627 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
628 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
632 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
633 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
634 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
635 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
636 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
637 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
638 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
639 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
640 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
641 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
642 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
645 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
647 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
649 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
650 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
651 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
652 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
653 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
654 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
655 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
656 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
657 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
658 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
659 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
660 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
661 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
662 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
663 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
664 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
665 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
674 /* Initialize the hash table of types. */
676 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
679 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
682 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
684 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
686 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
688 int_cst_node
= make_int_cst (1, 1);
690 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
692 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
693 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
695 /* Initialize the tree_contains_struct array. */
696 initialize_tree_contains_struct ();
697 lang_hooks
.init_ts ();
701 /* The name of the object as the assembler will see it (but before any
702 translations made by ASM_OUTPUT_LABELREF). Often this is the same
703 as DECL_NAME. It is an IDENTIFIER_NODE. */
705 decl_assembler_name (tree decl
)
707 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
708 lang_hooks
.set_decl_assembler_name (decl
);
709 return DECL_ASSEMBLER_NAME_RAW (decl
);
712 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
713 (either of which may be NULL). Inform the FE, if this changes the
717 overwrite_decl_assembler_name (tree decl
, tree name
)
719 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
720 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
723 /* When the target supports COMDAT groups, this indicates which group the
724 DECL is associated with. This can be either an IDENTIFIER_NODE or a
725 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
727 decl_comdat_group (const_tree node
)
729 struct symtab_node
*snode
= symtab_node::get (node
);
732 return snode
->get_comdat_group ();
735 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
737 decl_comdat_group_id (const_tree node
)
739 struct symtab_node
*snode
= symtab_node::get (node
);
742 return snode
->get_comdat_group_id ();
745 /* When the target supports named section, return its name as IDENTIFIER_NODE
746 or NULL if it is in no section. */
748 decl_section_name (const_tree node
)
750 struct symtab_node
*snode
= symtab_node::get (node
);
753 return snode
->get_section ();
756 /* Set section name of NODE to VALUE (that is expected to be
759 set_decl_section_name (tree node
, const char *value
)
761 struct symtab_node
*snode
;
765 snode
= symtab_node::get (node
);
769 else if (VAR_P (node
))
770 snode
= varpool_node::get_create (node
);
772 snode
= cgraph_node::get_create (node
);
773 snode
->set_section (value
);
776 /* Return TLS model of a variable NODE. */
778 decl_tls_model (const_tree node
)
780 struct varpool_node
*snode
= varpool_node::get (node
);
782 return TLS_MODEL_NONE
;
783 return snode
->tls_model
;
786 /* Set TLS model of variable NODE to MODEL. */
788 set_decl_tls_model (tree node
, enum tls_model model
)
790 struct varpool_node
*vnode
;
792 if (model
== TLS_MODEL_NONE
)
794 vnode
= varpool_node::get (node
);
799 vnode
= varpool_node::get_create (node
);
800 vnode
->tls_model
= model
;
803 /* Compute the number of bytes occupied by a tree with code CODE.
804 This function cannot be used for nodes that have variable sizes,
805 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
807 tree_code_size (enum tree_code code
)
809 switch (TREE_CODE_CLASS (code
))
811 case tcc_declaration
: /* A decl node */
814 case FIELD_DECL
: return sizeof (tree_field_decl
);
815 case PARM_DECL
: return sizeof (tree_parm_decl
);
816 case VAR_DECL
: return sizeof (tree_var_decl
);
817 case LABEL_DECL
: return sizeof (tree_label_decl
);
818 case RESULT_DECL
: return sizeof (tree_result_decl
);
819 case CONST_DECL
: return sizeof (tree_const_decl
);
820 case TYPE_DECL
: return sizeof (tree_type_decl
);
821 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
822 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
823 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
826 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
828 gcc_checking_assert (code
>= NUM_TREE_CODES
);
829 return lang_hooks
.tree_size (code
);
832 case tcc_type
: /* a type node */
843 case FIXED_POINT_TYPE
:
849 case QUAL_UNION_TYPE
:
853 case LANG_TYPE
: return sizeof (tree_type_non_common
);
855 gcc_checking_assert (code
>= NUM_TREE_CODES
);
856 return lang_hooks
.tree_size (code
);
859 case tcc_reference
: /* a reference */
860 case tcc_expression
: /* an expression */
861 case tcc_statement
: /* an expression with side effects */
862 case tcc_comparison
: /* a comparison expression */
863 case tcc_unary
: /* a unary arithmetic expression */
864 case tcc_binary
: /* a binary arithmetic expression */
865 return (sizeof (struct tree_exp
)
866 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
868 case tcc_constant
: /* a constant */
871 case VOID_CST
: return sizeof (tree_typed
);
872 case INTEGER_CST
: gcc_unreachable ();
873 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
874 case REAL_CST
: return sizeof (tree_real_cst
);
875 case FIXED_CST
: return sizeof (tree_fixed_cst
);
876 case COMPLEX_CST
: return sizeof (tree_complex
);
877 case VECTOR_CST
: gcc_unreachable ();
878 case STRING_CST
: gcc_unreachable ();
880 gcc_checking_assert (code
>= NUM_TREE_CODES
);
881 return lang_hooks
.tree_size (code
);
884 case tcc_exceptional
: /* something random, like an identifier. */
887 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
888 case TREE_LIST
: return sizeof (tree_list
);
891 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
893 case TREE_VEC
: gcc_unreachable ();
894 case OMP_CLAUSE
: gcc_unreachable ();
896 case SSA_NAME
: return sizeof (tree_ssa_name
);
898 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
899 case BLOCK
: return sizeof (struct tree_block
);
900 case CONSTRUCTOR
: return sizeof (tree_constructor
);
901 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
902 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
905 gcc_checking_assert (code
>= NUM_TREE_CODES
);
906 return lang_hooks
.tree_size (code
);
914 /* Compute the number of bytes occupied by NODE. This routine only
915 looks at TREE_CODE, except for those nodes that have variable sizes. */
917 tree_size (const_tree node
)
919 const enum tree_code code
= TREE_CODE (node
);
923 return (sizeof (struct tree_int_cst
)
924 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
927 return (offsetof (struct tree_binfo
, base_binfos
)
929 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
932 return (sizeof (struct tree_vec
)
933 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
936 return (sizeof (struct tree_vector
)
937 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
940 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
943 return (sizeof (struct tree_omp_clause
)
944 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
948 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
949 return (sizeof (struct tree_exp
)
950 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
952 return tree_code_size (code
);
956 /* Return tree node kind based on tree CODE. */
958 static tree_node_kind
959 get_stats_node_kind (enum tree_code code
)
961 enum tree_code_class type
= TREE_CODE_CLASS (code
);
965 case tcc_declaration
: /* A decl node */
967 case tcc_type
: /* a type node */
969 case tcc_statement
: /* an expression with side effects */
971 case tcc_reference
: /* a reference */
973 case tcc_expression
: /* an expression */
974 case tcc_comparison
: /* a comparison expression */
975 case tcc_unary
: /* a unary arithmetic expression */
976 case tcc_binary
: /* a binary arithmetic expression */
978 case tcc_constant
: /* a constant */
980 case tcc_exceptional
: /* something random, like an identifier. */
983 case IDENTIFIER_NODE
:
990 return ssa_name_kind
;
996 return omp_clause_kind
;
1008 /* Record interesting allocation statistics for a tree node with CODE
1012 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1014 if (!GATHER_STATISTICS
)
1017 tree_node_kind kind
= get_stats_node_kind (code
);
1019 tree_code_counts
[(int) code
]++;
1020 tree_node_counts
[(int) kind
]++;
1021 tree_node_sizes
[(int) kind
] += length
;
1024 /* Allocate and return a new UID from the DECL_UID namespace. */
1027 allocate_decl_uid (void)
1029 return next_decl_uid
++;
1032 /* Return a newly allocated node of code CODE. For decl and type
1033 nodes, some other fields are initialized. The rest of the node is
1034 initialized to zero. This function cannot be used for TREE_VEC,
1035 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1038 Achoo! I got a code in the node. */
1041 make_node (enum tree_code code MEM_STAT_DECL
)
1044 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1045 size_t length
= tree_code_size (code
);
1047 record_node_allocation_statistics (code
, length
);
1049 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1050 TREE_SET_CODE (t
, code
);
1055 if (code
!= DEBUG_BEGIN_STMT
)
1056 TREE_SIDE_EFFECTS (t
) = 1;
1059 case tcc_declaration
:
1060 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1062 if (code
== FUNCTION_DECL
)
1064 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1065 SET_DECL_MODE (t
, FUNCTION_MODE
);
1068 SET_DECL_ALIGN (t
, 1);
1070 DECL_SOURCE_LOCATION (t
) = input_location
;
1071 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1072 DECL_UID (t
) = --next_debug_decl_uid
;
1075 DECL_UID (t
) = allocate_decl_uid ();
1076 SET_DECL_PT_UID (t
, -1);
1078 if (TREE_CODE (t
) == LABEL_DECL
)
1079 LABEL_DECL_UID (t
) = -1;
1084 TYPE_UID (t
) = next_type_uid
++;
1085 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1086 TYPE_USER_ALIGN (t
) = 0;
1087 TYPE_MAIN_VARIANT (t
) = t
;
1088 TYPE_CANONICAL (t
) = t
;
1090 /* Default to no attributes for type, but let target change that. */
1091 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1092 targetm
.set_default_type_attributes (t
);
1094 /* We have not yet computed the alias set for this type. */
1095 TYPE_ALIAS_SET (t
) = -1;
1099 TREE_CONSTANT (t
) = 1;
1102 case tcc_expression
:
1108 case PREDECREMENT_EXPR
:
1109 case PREINCREMENT_EXPR
:
1110 case POSTDECREMENT_EXPR
:
1111 case POSTINCREMENT_EXPR
:
1112 /* All of these have side-effects, no matter what their
1114 TREE_SIDE_EFFECTS (t
) = 1;
1122 case tcc_exceptional
:
1125 case TARGET_OPTION_NODE
:
1126 TREE_TARGET_OPTION(t
)
1127 = ggc_cleared_alloc
<struct cl_target_option
> ();
1130 case OPTIMIZATION_NODE
:
1131 TREE_OPTIMIZATION (t
)
1132 = ggc_cleared_alloc
<struct cl_optimization
> ();
1141 /* Other classes need no special treatment. */
1148 /* Free tree node. */
1151 free_node (tree node
)
1153 enum tree_code code
= TREE_CODE (node
);
1154 if (GATHER_STATISTICS
)
1156 enum tree_node_kind kind
= get_stats_node_kind (code
);
1158 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1159 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1160 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1162 tree_code_counts
[(int) TREE_CODE (node
)]--;
1163 tree_node_counts
[(int) kind
]--;
1164 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1166 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1167 vec_free (CONSTRUCTOR_ELTS (node
));
1168 else if (code
== BLOCK
)
1169 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1170 else if (code
== TREE_BINFO
)
1171 vec_free (BINFO_BASE_ACCESSES (node
));
1172 else if (code
== OPTIMIZATION_NODE
)
1173 cl_optimization_option_free (TREE_OPTIMIZATION (node
));
1174 else if (code
== TARGET_OPTION_NODE
)
1175 cl_target_option_free (TREE_TARGET_OPTION (node
));
1179 /* Return a new node with the same contents as NODE except that its
1180 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1183 copy_node (tree node MEM_STAT_DECL
)
1186 enum tree_code code
= TREE_CODE (node
);
1189 gcc_assert (code
!= STATEMENT_LIST
);
1191 length
= tree_size (node
);
1192 record_node_allocation_statistics (code
, length
);
1193 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1194 memcpy (t
, node
, length
);
1196 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1198 TREE_ASM_WRITTEN (t
) = 0;
1199 TREE_VISITED (t
) = 0;
1201 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1203 if (code
== DEBUG_EXPR_DECL
)
1204 DECL_UID (t
) = --next_debug_decl_uid
;
1207 DECL_UID (t
) = allocate_decl_uid ();
1208 if (DECL_PT_UID_SET_P (node
))
1209 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1211 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1212 && DECL_HAS_VALUE_EXPR_P (node
))
1214 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1215 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1217 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1220 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1221 t
->decl_with_vis
.symtab_node
= NULL
;
1223 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1225 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1226 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1228 if (TREE_CODE (node
) == FUNCTION_DECL
)
1230 DECL_STRUCT_FUNCTION (t
) = NULL
;
1231 t
->decl_with_vis
.symtab_node
= NULL
;
1234 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1236 TYPE_UID (t
) = next_type_uid
++;
1237 /* The following is so that the debug code for
1238 the copy is different from the original type.
1239 The two statements usually duplicate each other
1240 (because they clear fields of the same union),
1241 but the optimizer should catch that. */
1242 TYPE_SYMTAB_ADDRESS (t
) = 0;
1243 TYPE_SYMTAB_DIE (t
) = 0;
1245 /* Do not copy the values cache. */
1246 if (TYPE_CACHED_VALUES_P (t
))
1248 TYPE_CACHED_VALUES_P (t
) = 0;
1249 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1252 else if (code
== TARGET_OPTION_NODE
)
1254 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1255 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1256 sizeof (struct cl_target_option
));
1258 else if (code
== OPTIMIZATION_NODE
)
1260 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1261 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1262 sizeof (struct cl_optimization
));
1268 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1269 For example, this can copy a list made of TREE_LIST nodes. */
1272 copy_list (tree list
)
1280 head
= prev
= copy_node (list
);
1281 next
= TREE_CHAIN (list
);
1284 TREE_CHAIN (prev
) = copy_node (next
);
1285 prev
= TREE_CHAIN (prev
);
1286 next
= TREE_CHAIN (next
);
1292 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1293 INTEGER_CST with value CST and type TYPE. */
1296 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1298 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1299 /* We need extra HWIs if CST is an unsigned integer with its
1301 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1302 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1303 return cst
.get_len ();
1306 /* Return a new INTEGER_CST with value CST and type TYPE. */
1309 build_new_int_cst (tree type
, const wide_int
&cst
)
1311 unsigned int len
= cst
.get_len ();
1312 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1313 tree nt
= make_int_cst (len
, ext_len
);
1318 TREE_INT_CST_ELT (nt
, ext_len
)
1319 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1320 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1321 TREE_INT_CST_ELT (nt
, i
) = -1;
1323 else if (TYPE_UNSIGNED (type
)
1324 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1327 TREE_INT_CST_ELT (nt
, len
)
1328 = zext_hwi (cst
.elt (len
),
1329 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1332 for (unsigned int i
= 0; i
< len
; i
++)
1333 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1334 TREE_TYPE (nt
) = type
;
1338 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1341 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1344 size_t length
= sizeof (struct tree_poly_int_cst
);
1345 record_node_allocation_statistics (POLY_INT_CST
, length
);
1347 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1349 TREE_SET_CODE (t
, POLY_INT_CST
);
1350 TREE_CONSTANT (t
) = 1;
1351 TREE_TYPE (t
) = type
;
1352 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1353 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1357 /* Create a constant tree that contains CST sign-extended to TYPE. */
1360 build_int_cst (tree type
, poly_int64 cst
)
1362 /* Support legacy code. */
1364 type
= integer_type_node
;
1366 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1369 /* Create a constant tree that contains CST zero-extended to TYPE. */
1372 build_int_cstu (tree type
, poly_uint64 cst
)
1374 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1377 /* Create a constant tree that contains CST sign-extended to TYPE. */
1380 build_int_cst_type (tree type
, poly_int64 cst
)
1383 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1386 /* Constructs tree in type TYPE from with value given by CST. Signedness
1387 of CST is assumed to be the same as the signedness of TYPE. */
1390 double_int_to_tree (tree type
, double_int cst
)
1392 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1395 /* We force the wide_int CST to the range of the type TYPE by sign or
1396 zero extending it. OVERFLOWABLE indicates if we are interested in
1397 overflow of the value, when >0 we are only interested in signed
1398 overflow, for <0 we are interested in any overflow. OVERFLOWED
1399 indicates whether overflow has already occurred. CONST_OVERFLOWED
1400 indicates whether constant overflow has already occurred. We force
1401 T's value to be within range of T's type (by setting to 0 or 1 all
1402 the bits outside the type's range). We set TREE_OVERFLOWED if,
1403 OVERFLOWED is nonzero,
1404 or OVERFLOWABLE is >0 and signed overflow occurs
1405 or OVERFLOWABLE is <0 and any overflow occurs
1406 We return a new tree node for the extended wide_int. The node
1407 is shared if no overflow flags are set. */
1411 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1412 int overflowable
, bool overflowed
)
1414 signop sign
= TYPE_SIGN (type
);
1416 /* If we need to set overflow flags, return a new unshared node. */
1417 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1421 || (overflowable
> 0 && sign
== SIGNED
))
1423 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1426 if (tmp
.is_constant ())
1427 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1430 tree coeffs
[NUM_POLY_INT_COEFFS
];
1431 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1433 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1434 TREE_OVERFLOW (coeffs
[i
]) = 1;
1436 t
= build_new_poly_int_cst (type
, coeffs
);
1438 TREE_OVERFLOW (t
) = 1;
1443 /* Else build a shared node. */
1444 return wide_int_to_tree (type
, cst
);
1447 /* These are the hash table functions for the hash table of INTEGER_CST
1448 nodes of a sizetype. */
1450 /* Return the hash code X, an INTEGER_CST. */
1453 int_cst_hasher::hash (tree x
)
1455 const_tree
const t
= x
;
1456 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1459 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1460 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1465 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1466 is the same as that given by *Y, which is the same. */
1469 int_cst_hasher::equal (tree x
, tree y
)
1471 const_tree
const xt
= x
;
1472 const_tree
const yt
= y
;
1474 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1475 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1476 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1479 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1480 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1486 /* Create an INT_CST node of TYPE and value CST.
1487 The returned node is always shared. For small integers we use a
1488 per-type vector cache, for larger ones we use a single hash table.
1489 The value is extended from its precision according to the sign of
1490 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1491 the upper bits and ensures that hashing and value equality based
1492 upon the underlying HOST_WIDE_INTs works without masking. */
1495 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1502 unsigned int prec
= TYPE_PRECISION (type
);
1503 signop sgn
= TYPE_SIGN (type
);
1505 /* Verify that everything is canonical. */
1506 int l
= pcst
.get_len ();
1509 if (pcst
.elt (l
- 1) == 0)
1510 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1511 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1512 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1515 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1516 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1520 /* We just need to store a single HOST_WIDE_INT. */
1522 if (TYPE_UNSIGNED (type
))
1523 hwi
= cst
.to_uhwi ();
1525 hwi
= cst
.to_shwi ();
1527 switch (TREE_CODE (type
))
1530 gcc_assert (hwi
== 0);
1534 case REFERENCE_TYPE
:
1535 /* Cache NULL pointer and zero bounds. */
1544 /* Cache false or true. */
1546 if (IN_RANGE (hwi
, 0, 1))
1552 if (TYPE_SIGN (type
) == UNSIGNED
)
1555 limit
= param_integer_share_limit
;
1556 if (IN_RANGE (hwi
, 0, param_integer_share_limit
- 1))
1561 /* Cache [-1, N). */
1562 limit
= param_integer_share_limit
+ 1;
1563 if (IN_RANGE (hwi
, -1, param_integer_share_limit
- 1))
1577 /* Look for it in the type's vector of small shared ints. */
1578 if (!TYPE_CACHED_VALUES_P (type
))
1580 TYPE_CACHED_VALUES_P (type
) = 1;
1581 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1584 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1586 /* Make sure no one is clobbering the shared constant. */
1587 gcc_checking_assert (TREE_TYPE (t
) == type
1588 && TREE_INT_CST_NUNITS (t
) == 1
1589 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1590 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1591 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1594 /* Create a new shared int. */
1595 t
= build_new_int_cst (type
, cst
);
1596 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1601 /* Use the cache of larger shared ints, using int_cst_node as
1604 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1605 TREE_TYPE (int_cst_node
) = type
;
1607 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1611 /* Insert this one into the hash table. */
1614 /* Make a new node for next time round. */
1615 int_cst_node
= make_int_cst (1, 1);
1621 /* The value either hashes properly or we drop it on the floor
1622 for the gc to take care of. There will not be enough of them
1625 tree nt
= build_new_int_cst (type
, cst
);
1626 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1630 /* Insert this one into the hash table. */
1642 poly_int_cst_hasher::hash (tree t
)
1644 inchash::hash hstate
;
1646 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1647 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1648 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1650 return hstate
.end ();
1654 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1656 if (TREE_TYPE (x
) != y
.first
)
1658 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1659 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1664 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1665 The elements must also have type TYPE. */
1668 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1670 unsigned int prec
= TYPE_PRECISION (type
);
1671 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1672 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1675 h
.add_int (TYPE_UID (type
));
1676 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1677 h
.add_wide_int (c
.coeffs
[i
]);
1678 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1679 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1681 if (*slot
== NULL_TREE
)
1683 tree coeffs
[NUM_POLY_INT_COEFFS
];
1684 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1685 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1686 *slot
= build_new_poly_int_cst (type
, coeffs
);
1691 /* Create a constant tree with value VALUE in type TYPE. */
1694 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1696 if (value
.is_constant ())
1697 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1698 return build_poly_int_cst (type
, value
);
1702 cache_integer_cst (tree t
)
1704 tree type
= TREE_TYPE (t
);
1707 int prec
= TYPE_PRECISION (type
);
1709 gcc_assert (!TREE_OVERFLOW (t
));
1711 switch (TREE_CODE (type
))
1714 gcc_assert (integer_zerop (t
));
1718 case REFERENCE_TYPE
:
1719 /* Cache NULL pointer. */
1720 if (integer_zerop (t
))
1728 /* Cache false or true. */
1730 if (wi::ltu_p (wi::to_wide (t
), 2))
1731 ix
= TREE_INT_CST_ELT (t
, 0);
1736 if (TYPE_UNSIGNED (type
))
1739 limit
= param_integer_share_limit
;
1741 /* This is a little hokie, but if the prec is smaller than
1742 what is necessary to hold param_integer_share_limit, then the
1743 obvious test will not get the correct answer. */
1744 if (prec
< HOST_BITS_PER_WIDE_INT
)
1746 if (tree_to_uhwi (t
)
1747 < (unsigned HOST_WIDE_INT
) param_integer_share_limit
)
1748 ix
= tree_to_uhwi (t
);
1750 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1751 ix
= tree_to_uhwi (t
);
1756 limit
= param_integer_share_limit
+ 1;
1758 if (integer_minus_onep (t
))
1760 else if (!wi::neg_p (wi::to_wide (t
)))
1762 if (prec
< HOST_BITS_PER_WIDE_INT
)
1764 if (tree_to_shwi (t
) < param_integer_share_limit
)
1765 ix
= tree_to_shwi (t
) + 1;
1767 else if (wi::ltu_p (wi::to_wide (t
), param_integer_share_limit
))
1768 ix
= tree_to_shwi (t
) + 1;
1782 /* Look for it in the type's vector of small shared ints. */
1783 if (!TYPE_CACHED_VALUES_P (type
))
1785 TYPE_CACHED_VALUES_P (type
) = 1;
1786 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1789 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1790 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1794 /* Use the cache of larger shared ints. */
1795 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1796 /* If there is already an entry for the number verify it's the
1799 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1801 /* Otherwise insert this one into the hash table. */
1807 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1808 and the rest are zeros. */
1811 build_low_bits_mask (tree type
, unsigned bits
)
1813 gcc_assert (bits
<= TYPE_PRECISION (type
));
1815 return wide_int_to_tree (type
, wi::mask (bits
, false,
1816 TYPE_PRECISION (type
)));
1819 /* Checks that X is integer constant that can be expressed in (unsigned)
1820 HOST_WIDE_INT without loss of precision. */
1823 cst_and_fits_in_hwi (const_tree x
)
1825 return (TREE_CODE (x
) == INTEGER_CST
1826 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1829 /* Build a newly constructed VECTOR_CST with the given values of
1830 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1833 make_vector (unsigned log2_npatterns
,
1834 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1836 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1838 unsigned npatterns
= 1 << log2_npatterns
;
1839 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1840 unsigned length
= (sizeof (struct tree_vector
)
1841 + (encoded_nelts
- 1) * sizeof (tree
));
1843 record_node_allocation_statistics (VECTOR_CST
, length
);
1845 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1847 TREE_SET_CODE (t
, VECTOR_CST
);
1848 TREE_CONSTANT (t
) = 1;
1849 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1850 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1855 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1856 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1859 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1861 if (vec_safe_length (v
) == 0)
1862 return build_zero_cst (type
);
1864 unsigned HOST_WIDE_INT idx
, nelts
;
1867 /* We can't construct a VECTOR_CST for a variable number of elements. */
1868 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1869 tree_vector_builder
vec (type
, nelts
, 1);
1870 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1872 if (TREE_CODE (value
) == VECTOR_CST
)
1874 /* If NELTS is constant then this must be too. */
1875 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1876 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1877 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1880 vec
.quick_push (value
);
1882 while (vec
.length () < nelts
)
1883 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1885 return vec
.build ();
1888 /* Build a vector of type VECTYPE where all the elements are SCs. */
1890 build_vector_from_val (tree vectype
, tree sc
)
1892 unsigned HOST_WIDE_INT i
, nunits
;
1894 if (sc
== error_mark_node
)
1897 /* Verify that the vector type is suitable for SC. Note that there
1898 is some inconsistency in the type-system with respect to restrict
1899 qualifications of pointers. Vector types always have a main-variant
1900 element type and the qualification is applied to the vector-type.
1901 So TREE_TYPE (vector-type) does not return a properly qualified
1902 vector element-type. */
1903 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1904 TREE_TYPE (vectype
)));
1906 if (CONSTANT_CLASS_P (sc
))
1908 tree_vector_builder
v (vectype
, 1, 1);
1912 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1913 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1916 vec
<constructor_elt
, va_gc
> *v
;
1917 vec_alloc (v
, nunits
);
1918 for (i
= 0; i
< nunits
; ++i
)
1919 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1920 return build_constructor (vectype
, v
);
1924 /* If TYPE is not a vector type, just return SC, otherwise return
1925 build_vector_from_val (TYPE, SC). */
1928 build_uniform_cst (tree type
, tree sc
)
1930 if (!VECTOR_TYPE_P (type
))
1933 return build_vector_from_val (type
, sc
);
1936 /* Build a vector series of type TYPE in which element I has the value
1937 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1938 and a VEC_SERIES_EXPR otherwise. */
1941 build_vec_series (tree type
, tree base
, tree step
)
1943 if (integer_zerop (step
))
1944 return build_vector_from_val (type
, base
);
1945 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1947 tree_vector_builder
builder (type
, 1, 3);
1948 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1949 wi::to_wide (base
) + wi::to_wide (step
));
1950 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1951 wi::to_wide (elt1
) + wi::to_wide (step
));
1952 builder
.quick_push (base
);
1953 builder
.quick_push (elt1
);
1954 builder
.quick_push (elt2
);
1955 return builder
.build ();
1957 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1960 /* Return a vector with the same number of units and number of bits
1961 as VEC_TYPE, but in which the elements are a linear series of unsigned
1962 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1965 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1967 tree index_vec_type
= vec_type
;
1968 tree index_elt_type
= TREE_TYPE (vec_type
);
1969 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1970 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1972 index_elt_type
= build_nonstandard_integer_type
1973 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1974 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1977 tree_vector_builder
v (index_vec_type
, 1, 3);
1978 for (unsigned int i
= 0; i
< 3; ++i
)
1979 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1983 /* Return a VECTOR_CST of type VEC_TYPE in which the first NUM_A
1984 elements are A and the rest are B. */
1987 build_vector_a_then_b (tree vec_type
, unsigned int num_a
, tree a
, tree b
)
1989 gcc_assert (known_le (num_a
, TYPE_VECTOR_SUBPARTS (vec_type
)));
1990 unsigned int count
= constant_lower_bound (TYPE_VECTOR_SUBPARTS (vec_type
));
1991 /* Optimize the constant case. */
1992 if ((count
& 1) == 0 && TYPE_VECTOR_SUBPARTS (vec_type
).is_constant ())
1994 tree_vector_builder
builder (vec_type
, count
, 2);
1995 for (unsigned int i
= 0; i
< count
* 2; ++i
)
1996 builder
.quick_push (i
< num_a
? a
: b
);
1997 return builder
.build ();
2000 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
2001 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
2004 recompute_constructor_flags (tree c
)
2008 bool constant_p
= true;
2009 bool side_effects_p
= false;
2010 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2012 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2014 /* Mostly ctors will have elts that don't have side-effects, so
2015 the usual case is to scan all the elements. Hence a single
2016 loop for both const and side effects, rather than one loop
2017 each (with early outs). */
2018 if (!TREE_CONSTANT (val
))
2020 if (TREE_SIDE_EFFECTS (val
))
2021 side_effects_p
= true;
2024 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2025 TREE_CONSTANT (c
) = constant_p
;
2028 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2032 verify_constructor_flags (tree c
)
2036 bool constant_p
= TREE_CONSTANT (c
);
2037 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2038 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2040 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2042 if (constant_p
&& !TREE_CONSTANT (val
))
2043 internal_error ("non-constant element in constant CONSTRUCTOR");
2044 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2045 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2049 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2050 are in the vec pointed to by VALS. */
2052 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2054 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2056 TREE_TYPE (c
) = type
;
2057 CONSTRUCTOR_ELTS (c
) = vals
;
2059 recompute_constructor_flags (c
);
2064 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2067 build_constructor_single (tree type
, tree index
, tree value
)
2069 vec
<constructor_elt
, va_gc
> *v
;
2070 constructor_elt elt
= {index
, value
};
2073 v
->quick_push (elt
);
2075 return build_constructor (type
, v
);
2079 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2080 are in a list pointed to by VALS. */
2082 build_constructor_from_list (tree type
, tree vals
)
2085 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2089 vec_alloc (v
, list_length (vals
));
2090 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2091 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2094 return build_constructor (type
, v
);
2097 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2098 of elements, provided as index/value pairs. */
2101 build_constructor_va (tree type
, int nelts
, ...)
2103 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2106 va_start (p
, nelts
);
2107 vec_alloc (v
, nelts
);
2110 tree index
= va_arg (p
, tree
);
2111 tree value
= va_arg (p
, tree
);
2112 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2115 return build_constructor (type
, v
);
2118 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2121 build_clobber (tree type
)
2123 tree clobber
= build_constructor (type
, NULL
);
2124 TREE_THIS_VOLATILE (clobber
) = true;
2128 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2131 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2134 FIXED_VALUE_TYPE
*fp
;
2136 v
= make_node (FIXED_CST
);
2137 fp
= ggc_alloc
<fixed_value
> ();
2138 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2140 TREE_TYPE (v
) = type
;
2141 TREE_FIXED_CST_PTR (v
) = fp
;
2145 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2148 build_real (tree type
, REAL_VALUE_TYPE d
)
2151 REAL_VALUE_TYPE
*dp
;
2154 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2155 Consider doing it via real_convert now. */
2157 v
= make_node (REAL_CST
);
2158 dp
= ggc_alloc
<real_value
> ();
2159 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2161 TREE_TYPE (v
) = type
;
2162 TREE_REAL_CST_PTR (v
) = dp
;
2163 TREE_OVERFLOW (v
) = overflow
;
2167 /* Like build_real, but first truncate D to the type. */
2170 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2172 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2175 /* Return a new REAL_CST node whose type is TYPE
2176 and whose value is the integer value of the INTEGER_CST node I. */
2179 real_value_from_int_cst (const_tree type
, const_tree i
)
2183 /* Clear all bits of the real value type so that we can later do
2184 bitwise comparisons to see if two values are the same. */
2185 memset (&d
, 0, sizeof d
);
2187 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2188 TYPE_SIGN (TREE_TYPE (i
)));
2192 /* Given a tree representing an integer constant I, return a tree
2193 representing the same value as a floating-point constant of type TYPE. */
2196 build_real_from_int_cst (tree type
, const_tree i
)
2199 int overflow
= TREE_OVERFLOW (i
);
2201 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2203 TREE_OVERFLOW (v
) |= overflow
;
2207 /* Return a newly constructed STRING_CST node whose value is
2208 the LEN characters at STR.
2209 Note that for a C string literal, LEN should include the trailing NUL.
2210 The TREE_TYPE is not initialized. */
2213 build_string (int len
, const char *str
)
2218 /* Do not waste bytes provided by padding of struct tree_string. */
2219 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2221 record_node_allocation_statistics (STRING_CST
, length
);
2223 s
= (tree
) ggc_internal_alloc (length
);
2225 memset (s
, 0, sizeof (struct tree_typed
));
2226 TREE_SET_CODE (s
, STRING_CST
);
2227 TREE_CONSTANT (s
) = 1;
2228 TREE_STRING_LENGTH (s
) = len
;
2229 memcpy (s
->string
.str
, str
, len
);
2230 s
->string
.str
[len
] = '\0';
2235 /* Return a newly constructed COMPLEX_CST node whose value is
2236 specified by the real and imaginary parts REAL and IMAG.
2237 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2238 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2241 build_complex (tree type
, tree real
, tree imag
)
2243 gcc_assert (CONSTANT_CLASS_P (real
));
2244 gcc_assert (CONSTANT_CLASS_P (imag
));
2246 tree t
= make_node (COMPLEX_CST
);
2248 TREE_REALPART (t
) = real
;
2249 TREE_IMAGPART (t
) = imag
;
2250 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2251 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2255 /* Build a complex (inf +- 0i), such as for the result of cproj.
2256 TYPE is the complex tree type of the result. If NEG is true, the
2257 imaginary zero is negative. */
2260 build_complex_inf (tree type
, bool neg
)
2262 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2266 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2267 build_real (TREE_TYPE (type
), rzero
));
2270 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2271 element is set to 1. In particular, this is 1 + i for complex types. */
2274 build_each_one_cst (tree type
)
2276 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2278 tree scalar
= build_one_cst (TREE_TYPE (type
));
2279 return build_complex (type
, scalar
, scalar
);
2282 return build_one_cst (type
);
2285 /* Return a constant of arithmetic type TYPE which is the
2286 multiplicative identity of the set TYPE. */
2289 build_one_cst (tree type
)
2291 switch (TREE_CODE (type
))
2293 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2294 case POINTER_TYPE
: case REFERENCE_TYPE
:
2296 return build_int_cst (type
, 1);
2299 return build_real (type
, dconst1
);
2301 case FIXED_POINT_TYPE
:
2302 /* We can only generate 1 for accum types. */
2303 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2304 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2308 tree scalar
= build_one_cst (TREE_TYPE (type
));
2310 return build_vector_from_val (type
, scalar
);
2314 return build_complex (type
,
2315 build_one_cst (TREE_TYPE (type
)),
2316 build_zero_cst (TREE_TYPE (type
)));
2323 /* Return an integer of type TYPE containing all 1's in as much precision as
2324 it contains, or a complex or vector whose subparts are such integers. */
2327 build_all_ones_cst (tree type
)
2329 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2331 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2332 return build_complex (type
, scalar
, scalar
);
2335 return build_minus_one_cst (type
);
2338 /* Return a constant of arithmetic type TYPE which is the
2339 opposite of the multiplicative identity of the set TYPE. */
2342 build_minus_one_cst (tree type
)
2344 switch (TREE_CODE (type
))
2346 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2347 case POINTER_TYPE
: case REFERENCE_TYPE
:
2349 return build_int_cst (type
, -1);
2352 return build_real (type
, dconstm1
);
2354 case FIXED_POINT_TYPE
:
2355 /* We can only generate 1 for accum types. */
2356 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2357 return build_fixed (type
,
2358 fixed_from_double_int (double_int_minus_one
,
2359 SCALAR_TYPE_MODE (type
)));
2363 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2365 return build_vector_from_val (type
, scalar
);
2369 return build_complex (type
,
2370 build_minus_one_cst (TREE_TYPE (type
)),
2371 build_zero_cst (TREE_TYPE (type
)));
2378 /* Build 0 constant of type TYPE. This is used by constructor folding
2379 and thus the constant should be represented in memory by
2383 build_zero_cst (tree type
)
2385 switch (TREE_CODE (type
))
2387 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2388 case POINTER_TYPE
: case REFERENCE_TYPE
:
2389 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2390 return build_int_cst (type
, 0);
2393 return build_real (type
, dconst0
);
2395 case FIXED_POINT_TYPE
:
2396 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2400 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2402 return build_vector_from_val (type
, scalar
);
2407 tree zero
= build_zero_cst (TREE_TYPE (type
));
2409 return build_complex (type
, zero
, zero
);
2413 if (!AGGREGATE_TYPE_P (type
))
2414 return fold_convert (type
, integer_zero_node
);
2415 return build_constructor (type
, NULL
);
2420 /* Build a BINFO with LEN language slots. */
2423 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2426 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2427 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2429 record_node_allocation_statistics (TREE_BINFO
, length
);
2431 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2433 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2435 TREE_SET_CODE (t
, TREE_BINFO
);
2437 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2442 /* Create a CASE_LABEL_EXPR tree node and return it. */
2445 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2447 tree t
= make_node (CASE_LABEL_EXPR
);
2449 TREE_TYPE (t
) = void_type_node
;
2450 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2452 CASE_LOW (t
) = low_value
;
2453 CASE_HIGH (t
) = high_value
;
2454 CASE_LABEL (t
) = label_decl
;
2455 CASE_CHAIN (t
) = NULL_TREE
;
2460 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2461 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2462 The latter determines the length of the HOST_WIDE_INT vector. */
2465 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2468 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2469 + sizeof (struct tree_int_cst
));
2472 record_node_allocation_statistics (INTEGER_CST
, length
);
2474 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2476 TREE_SET_CODE (t
, INTEGER_CST
);
2477 TREE_INT_CST_NUNITS (t
) = len
;
2478 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2479 /* to_offset can only be applied to trees that are offset_int-sized
2480 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2481 must be exactly the precision of offset_int and so LEN is correct. */
2482 if (ext_len
<= OFFSET_INT_ELTS
)
2483 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2485 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2487 TREE_CONSTANT (t
) = 1;
2492 /* Build a newly constructed TREE_VEC node of length LEN. */
2495 make_tree_vec (int len MEM_STAT_DECL
)
2498 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2500 record_node_allocation_statistics (TREE_VEC
, length
);
2502 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2504 TREE_SET_CODE (t
, TREE_VEC
);
2505 TREE_VEC_LENGTH (t
) = len
;
2510 /* Grow a TREE_VEC node to new length LEN. */
2513 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2515 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2517 int oldlen
= TREE_VEC_LENGTH (v
);
2518 gcc_assert (len
> oldlen
);
2520 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2521 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2523 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2525 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2527 TREE_VEC_LENGTH (v
) = len
;
2532 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2533 fixed, and scalar, complex or vector. */
2536 zerop (const_tree expr
)
2538 return (integer_zerop (expr
)
2539 || real_zerop (expr
)
2540 || fixed_zerop (expr
));
2543 /* Return 1 if EXPR is the integer constant zero or a complex constant
2544 of zero, or a location wrapper for such a constant. */
2547 integer_zerop (const_tree expr
)
2549 STRIP_ANY_LOCATION_WRAPPER (expr
);
2551 switch (TREE_CODE (expr
))
2554 return wi::to_wide (expr
) == 0;
2556 return (integer_zerop (TREE_REALPART (expr
))
2557 && integer_zerop (TREE_IMAGPART (expr
)));
2559 return (VECTOR_CST_NPATTERNS (expr
) == 1
2560 && VECTOR_CST_DUPLICATE_P (expr
)
2561 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2567 /* Return 1 if EXPR is the integer constant one or the corresponding
2568 complex constant, or a location wrapper for such a constant. */
2571 integer_onep (const_tree expr
)
2573 STRIP_ANY_LOCATION_WRAPPER (expr
);
2575 switch (TREE_CODE (expr
))
2578 return wi::eq_p (wi::to_widest (expr
), 1);
2580 return (integer_onep (TREE_REALPART (expr
))
2581 && integer_zerop (TREE_IMAGPART (expr
)));
2583 return (VECTOR_CST_NPATTERNS (expr
) == 1
2584 && VECTOR_CST_DUPLICATE_P (expr
)
2585 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2591 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2592 return 1 if every piece is the integer constant one.
2593 Also return 1 for location wrappers for such a constant. */
2596 integer_each_onep (const_tree expr
)
2598 STRIP_ANY_LOCATION_WRAPPER (expr
);
2600 if (TREE_CODE (expr
) == COMPLEX_CST
)
2601 return (integer_onep (TREE_REALPART (expr
))
2602 && integer_onep (TREE_IMAGPART (expr
)));
2604 return integer_onep (expr
);
2607 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2608 it contains, or a complex or vector whose subparts are such integers,
2609 or a location wrapper for such a constant. */
2612 integer_all_onesp (const_tree expr
)
2614 STRIP_ANY_LOCATION_WRAPPER (expr
);
2616 if (TREE_CODE (expr
) == COMPLEX_CST
2617 && integer_all_onesp (TREE_REALPART (expr
))
2618 && integer_all_onesp (TREE_IMAGPART (expr
)))
2621 else if (TREE_CODE (expr
) == VECTOR_CST
)
2622 return (VECTOR_CST_NPATTERNS (expr
) == 1
2623 && VECTOR_CST_DUPLICATE_P (expr
)
2624 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2626 else if (TREE_CODE (expr
) != INTEGER_CST
)
2629 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2630 == wi::to_wide (expr
));
2633 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2634 for such a constant. */
2637 integer_minus_onep (const_tree expr
)
2639 STRIP_ANY_LOCATION_WRAPPER (expr
);
2641 if (TREE_CODE (expr
) == COMPLEX_CST
)
2642 return (integer_all_onesp (TREE_REALPART (expr
))
2643 && integer_zerop (TREE_IMAGPART (expr
)));
2645 return integer_all_onesp (expr
);
2648 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2649 one bit on), or a location wrapper for such a constant. */
2652 integer_pow2p (const_tree expr
)
2654 STRIP_ANY_LOCATION_WRAPPER (expr
);
2656 if (TREE_CODE (expr
) == COMPLEX_CST
2657 && integer_pow2p (TREE_REALPART (expr
))
2658 && integer_zerop (TREE_IMAGPART (expr
)))
2661 if (TREE_CODE (expr
) != INTEGER_CST
)
2664 return wi::popcount (wi::to_wide (expr
)) == 1;
2667 /* Return 1 if EXPR is an integer constant other than zero or a
2668 complex constant other than zero, or a location wrapper for such a
2672 integer_nonzerop (const_tree expr
)
2674 STRIP_ANY_LOCATION_WRAPPER (expr
);
2676 return ((TREE_CODE (expr
) == INTEGER_CST
2677 && wi::to_wide (expr
) != 0)
2678 || (TREE_CODE (expr
) == COMPLEX_CST
2679 && (integer_nonzerop (TREE_REALPART (expr
))
2680 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2683 /* Return 1 if EXPR is the integer constant one. For vector,
2684 return 1 if every piece is the integer constant minus one
2685 (representing the value TRUE).
2686 Also return 1 for location wrappers for such a constant. */
2689 integer_truep (const_tree expr
)
2691 STRIP_ANY_LOCATION_WRAPPER (expr
);
2693 if (TREE_CODE (expr
) == VECTOR_CST
)
2694 return integer_all_onesp (expr
);
2695 return integer_onep (expr
);
2698 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2699 for such a constant. */
2702 fixed_zerop (const_tree expr
)
2704 STRIP_ANY_LOCATION_WRAPPER (expr
);
2706 return (TREE_CODE (expr
) == FIXED_CST
2707 && TREE_FIXED_CST (expr
).data
.is_zero ());
2710 /* Return the power of two represented by a tree node known to be a
2714 tree_log2 (const_tree expr
)
2716 if (TREE_CODE (expr
) == COMPLEX_CST
)
2717 return tree_log2 (TREE_REALPART (expr
));
2719 return wi::exact_log2 (wi::to_wide (expr
));
2722 /* Similar, but return the largest integer Y such that 2 ** Y is less
2723 than or equal to EXPR. */
2726 tree_floor_log2 (const_tree expr
)
2728 if (TREE_CODE (expr
) == COMPLEX_CST
)
2729 return tree_log2 (TREE_REALPART (expr
));
2731 return wi::floor_log2 (wi::to_wide (expr
));
2734 /* Return number of known trailing zero bits in EXPR, or, if the value of
2735 EXPR is known to be zero, the precision of it's type. */
2738 tree_ctz (const_tree expr
)
2740 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2741 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2744 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2745 switch (TREE_CODE (expr
))
2748 ret1
= wi::ctz (wi::to_wide (expr
));
2749 return MIN (ret1
, prec
);
2751 ret1
= wi::ctz (get_nonzero_bits (expr
));
2752 return MIN (ret1
, prec
);
2759 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2762 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2763 return MIN (ret1
, ret2
);
2764 case POINTER_PLUS_EXPR
:
2765 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2766 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2767 /* Second operand is sizetype, which could be in theory
2768 wider than pointer's precision. Make sure we never
2769 return more than prec. */
2770 ret2
= MIN (ret2
, prec
);
2771 return MIN (ret1
, ret2
);
2773 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2774 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2775 return MAX (ret1
, ret2
);
2777 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2778 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2779 return MIN (ret1
+ ret2
, prec
);
2781 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2782 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2783 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2785 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2786 return MIN (ret1
+ ret2
, prec
);
2790 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2791 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2793 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2794 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2799 case TRUNC_DIV_EXPR
:
2801 case FLOOR_DIV_EXPR
:
2802 case ROUND_DIV_EXPR
:
2803 case EXACT_DIV_EXPR
:
2804 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2805 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2807 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2810 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2818 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2819 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2821 return MIN (ret1
, prec
);
2823 return tree_ctz (TREE_OPERAND (expr
, 0));
2825 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2828 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2829 return MIN (ret1
, ret2
);
2831 return tree_ctz (TREE_OPERAND (expr
, 1));
2833 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2834 if (ret1
> BITS_PER_UNIT
)
2836 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2837 return MIN (ret1
, prec
);
2845 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2846 decimal float constants, so don't return 1 for them.
2847 Also return 1 for location wrappers around such a constant. */
2850 real_zerop (const_tree expr
)
2852 STRIP_ANY_LOCATION_WRAPPER (expr
);
2854 switch (TREE_CODE (expr
))
2857 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2858 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2860 return real_zerop (TREE_REALPART (expr
))
2861 && real_zerop (TREE_IMAGPART (expr
));
2864 /* Don't simply check for a duplicate because the predicate
2865 accepts both +0.0 and -0.0. */
2866 unsigned count
= vector_cst_encoded_nelts (expr
);
2867 for (unsigned int i
= 0; i
< count
; ++i
)
2868 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2877 /* Return 1 if EXPR is the real constant one in real or complex form.
2878 Trailing zeroes matter for decimal float constants, so don't return
2880 Also return 1 for location wrappers around such a constant. */
2883 real_onep (const_tree expr
)
2885 STRIP_ANY_LOCATION_WRAPPER (expr
);
2887 switch (TREE_CODE (expr
))
2890 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2891 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2893 return real_onep (TREE_REALPART (expr
))
2894 && real_zerop (TREE_IMAGPART (expr
));
2896 return (VECTOR_CST_NPATTERNS (expr
) == 1
2897 && VECTOR_CST_DUPLICATE_P (expr
)
2898 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2904 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2905 matter for decimal float constants, so don't return 1 for them.
2906 Also return 1 for location wrappers around such a constant. */
2909 real_minus_onep (const_tree expr
)
2911 STRIP_ANY_LOCATION_WRAPPER (expr
);
2913 switch (TREE_CODE (expr
))
2916 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2917 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2919 return real_minus_onep (TREE_REALPART (expr
))
2920 && real_zerop (TREE_IMAGPART (expr
));
2922 return (VECTOR_CST_NPATTERNS (expr
) == 1
2923 && VECTOR_CST_DUPLICATE_P (expr
)
2924 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2930 /* Nonzero if EXP is a constant or a cast of a constant. */
2933 really_constant_p (const_tree exp
)
2935 /* This is not quite the same as STRIP_NOPS. It does more. */
2936 while (CONVERT_EXPR_P (exp
)
2937 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2938 exp
= TREE_OPERAND (exp
, 0);
2939 return TREE_CONSTANT (exp
);
2942 /* Return true if T holds a polynomial pointer difference, storing it in
2943 *VALUE if so. A true return means that T's precision is no greater
2944 than 64 bits, which is the largest address space we support, so *VALUE
2945 never loses precision. However, the signedness of the result does
2946 not necessarily match the signedness of T: sometimes an unsigned type
2947 like sizetype is used to encode a value that is actually negative. */
2950 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2954 if (TREE_CODE (t
) == INTEGER_CST
)
2956 if (!cst_and_fits_in_hwi (t
))
2958 *value
= int_cst_value (t
);
2961 if (POLY_INT_CST_P (t
))
2963 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2964 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2966 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2967 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2974 tree_to_poly_int64 (const_tree t
)
2976 gcc_assert (tree_fits_poly_int64_p (t
));
2977 if (POLY_INT_CST_P (t
))
2978 return poly_int_cst_value (t
).force_shwi ();
2979 return TREE_INT_CST_LOW (t
);
2983 tree_to_poly_uint64 (const_tree t
)
2985 gcc_assert (tree_fits_poly_uint64_p (t
));
2986 if (POLY_INT_CST_P (t
))
2987 return poly_int_cst_value (t
).force_uhwi ();
2988 return TREE_INT_CST_LOW (t
);
2991 /* Return first list element whose TREE_VALUE is ELEM.
2992 Return 0 if ELEM is not in LIST. */
2995 value_member (tree elem
, tree list
)
2999 if (elem
== TREE_VALUE (list
))
3001 list
= TREE_CHAIN (list
);
3006 /* Return first list element whose TREE_PURPOSE is ELEM.
3007 Return 0 if ELEM is not in LIST. */
3010 purpose_member (const_tree elem
, tree list
)
3014 if (elem
== TREE_PURPOSE (list
))
3016 list
= TREE_CHAIN (list
);
3021 /* Return true if ELEM is in V. */
3024 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3028 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3034 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3038 chain_index (int idx
, tree chain
)
3040 for (; chain
&& idx
> 0; --idx
)
3041 chain
= TREE_CHAIN (chain
);
3045 /* Return nonzero if ELEM is part of the chain CHAIN. */
3048 chain_member (const_tree elem
, const_tree chain
)
3054 chain
= DECL_CHAIN (chain
);
3060 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3061 We expect a null pointer to mark the end of the chain.
3062 This is the Lisp primitive `length'. */
3065 list_length (const_tree t
)
3068 #ifdef ENABLE_TREE_CHECKING
3076 #ifdef ENABLE_TREE_CHECKING
3079 gcc_assert (p
!= q
);
3087 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3088 UNION_TYPE TYPE, or NULL_TREE if none. */
3091 first_field (const_tree type
)
3093 tree t
= TYPE_FIELDS (type
);
3094 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3099 /* Returns the last FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3100 UNION_TYPE TYPE, or NULL_TREE if none. */
3103 last_field (const_tree type
)
3105 tree last
= NULL_TREE
;
3107 for (tree fld
= TYPE_FIELDS (type
); fld
; fld
= TREE_CHAIN (fld
))
3109 if (TREE_CODE (fld
) != FIELD_DECL
)
3118 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3119 by modifying the last node in chain 1 to point to chain 2.
3120 This is the Lisp primitive `nconc'. */
3123 chainon (tree op1
, tree op2
)
3132 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3134 TREE_CHAIN (t1
) = op2
;
3136 #ifdef ENABLE_TREE_CHECKING
3139 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3140 gcc_assert (t2
!= t1
);
3147 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3150 tree_last (tree chain
)
3154 while ((next
= TREE_CHAIN (chain
)))
3159 /* Reverse the order of elements in the chain T,
3160 and return the new head of the chain (old last element). */
3165 tree prev
= 0, decl
, next
;
3166 for (decl
= t
; decl
; decl
= next
)
3168 /* We shouldn't be using this function to reverse BLOCK chains; we
3169 have blocks_nreverse for that. */
3170 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3171 next
= TREE_CHAIN (decl
);
3172 TREE_CHAIN (decl
) = prev
;
3178 /* Return a newly created TREE_LIST node whose
3179 purpose and value fields are PARM and VALUE. */
3182 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3184 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3185 TREE_PURPOSE (t
) = parm
;
3186 TREE_VALUE (t
) = value
;
3190 /* Build a chain of TREE_LIST nodes from a vector. */
3193 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3195 tree ret
= NULL_TREE
;
3199 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3201 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3202 pp
= &TREE_CHAIN (*pp
);
3207 /* Return a newly created TREE_LIST node whose
3208 purpose and value fields are PURPOSE and VALUE
3209 and whose TREE_CHAIN is CHAIN. */
3212 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3216 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3217 memset (node
, 0, sizeof (struct tree_common
));
3219 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3221 TREE_SET_CODE (node
, TREE_LIST
);
3222 TREE_CHAIN (node
) = chain
;
3223 TREE_PURPOSE (node
) = purpose
;
3224 TREE_VALUE (node
) = value
;
3228 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3232 ctor_to_vec (tree ctor
)
3234 vec
<tree
, va_gc
> *vec
;
3235 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3239 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3240 vec
->quick_push (val
);
3245 /* Return the size nominally occupied by an object of type TYPE
3246 when it resides in memory. The value is measured in units of bytes,
3247 and its data type is that normally used for type sizes
3248 (which is the first type created by make_signed_type or
3249 make_unsigned_type). */
3252 size_in_bytes_loc (location_t loc
, const_tree type
)
3256 if (type
== error_mark_node
)
3257 return integer_zero_node
;
3259 type
= TYPE_MAIN_VARIANT (type
);
3260 t
= TYPE_SIZE_UNIT (type
);
3264 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3265 return size_zero_node
;
3271 /* Return the size of TYPE (in bytes) as a wide integer
3272 or return -1 if the size can vary or is larger than an integer. */
3275 int_size_in_bytes (const_tree type
)
3279 if (type
== error_mark_node
)
3282 type
= TYPE_MAIN_VARIANT (type
);
3283 t
= TYPE_SIZE_UNIT (type
);
3285 if (t
&& tree_fits_uhwi_p (t
))
3286 return TREE_INT_CST_LOW (t
);
3291 /* Return the maximum size of TYPE (in bytes) as a wide integer
3292 or return -1 if the size can vary or is larger than an integer. */
3295 max_int_size_in_bytes (const_tree type
)
3297 HOST_WIDE_INT size
= -1;
3300 /* If this is an array type, check for a possible MAX_SIZE attached. */
3302 if (TREE_CODE (type
) == ARRAY_TYPE
)
3304 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3306 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3307 size
= tree_to_uhwi (size_tree
);
3310 /* If we still haven't been able to get a size, see if the language
3311 can compute a maximum size. */
3315 size_tree
= lang_hooks
.types
.max_size (type
);
3317 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3318 size
= tree_to_uhwi (size_tree
);
3324 /* Return the bit position of FIELD, in bits from the start of the record.
3325 This is a tree of type bitsizetype. */
3328 bit_position (const_tree field
)
3330 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3331 DECL_FIELD_BIT_OFFSET (field
));
3334 /* Return the byte position of FIELD, in bytes from the start of the record.
3335 This is a tree of type sizetype. */
3338 byte_position (const_tree field
)
3340 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3341 DECL_FIELD_BIT_OFFSET (field
));
3344 /* Likewise, but return as an integer. It must be representable in
3345 that way (since it could be a signed value, we don't have the
3346 option of returning -1 like int_size_in_byte can. */
3349 int_byte_position (const_tree field
)
3351 return tree_to_shwi (byte_position (field
));
3354 /* Return the strictest alignment, in bits, that T is known to have. */
3357 expr_align (const_tree t
)
3359 unsigned int align0
, align1
;
3361 switch (TREE_CODE (t
))
3363 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3364 /* If we have conversions, we know that the alignment of the
3365 object must meet each of the alignments of the types. */
3366 align0
= expr_align (TREE_OPERAND (t
, 0));
3367 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3368 return MAX (align0
, align1
);
3370 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3371 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3372 case CLEANUP_POINT_EXPR
:
3373 /* These don't change the alignment of an object. */
3374 return expr_align (TREE_OPERAND (t
, 0));
3377 /* The best we can do is say that the alignment is the least aligned
3379 align0
= expr_align (TREE_OPERAND (t
, 1));
3380 align1
= expr_align (TREE_OPERAND (t
, 2));
3381 return MIN (align0
, align1
);
3383 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3384 meaningfully, it's always 1. */
3385 case LABEL_DECL
: case CONST_DECL
:
3386 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3388 gcc_assert (DECL_ALIGN (t
) != 0);
3389 return DECL_ALIGN (t
);
3395 /* Otherwise take the alignment from that of the type. */
3396 return TYPE_ALIGN (TREE_TYPE (t
));
3399 /* Return, as a tree node, the number of elements for TYPE (which is an
3400 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3403 array_type_nelts (const_tree type
)
3405 tree index_type
, min
, max
;
3407 /* If they did it with unspecified bounds, then we should have already
3408 given an error about it before we got here. */
3409 if (! TYPE_DOMAIN (type
))
3410 return error_mark_node
;
3412 index_type
= TYPE_DOMAIN (type
);
3413 min
= TYPE_MIN_VALUE (index_type
);
3414 max
= TYPE_MAX_VALUE (index_type
);
3416 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3418 return error_mark_node
;
3420 return (integer_zerop (min
)
3422 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3425 /* If arg is static -- a reference to an object in static storage -- then
3426 return the object. This is not the same as the C meaning of `static'.
3427 If arg isn't static, return NULL. */
3432 switch (TREE_CODE (arg
))
3435 /* Nested functions are static, even though taking their address will
3436 involve a trampoline as we unnest the nested function and create
3437 the trampoline on the tree level. */
3441 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3442 && ! DECL_THREAD_LOCAL_P (arg
)
3443 && ! DECL_DLLIMPORT_P (arg
)
3447 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3451 return TREE_STATIC (arg
) ? arg
: NULL
;
3458 /* If the thing being referenced is not a field, then it is
3459 something language specific. */
3460 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3462 /* If we are referencing a bitfield, we can't evaluate an
3463 ADDR_EXPR at compile time and so it isn't a constant. */
3464 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3467 return staticp (TREE_OPERAND (arg
, 0));
3473 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3476 case ARRAY_RANGE_REF
:
3477 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3478 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3479 return staticp (TREE_OPERAND (arg
, 0));
3483 case COMPOUND_LITERAL_EXPR
:
3484 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3494 /* Return whether OP is a DECL whose address is function-invariant. */
3497 decl_address_invariant_p (const_tree op
)
3499 /* The conditions below are slightly less strict than the one in
3502 switch (TREE_CODE (op
))
3511 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3512 || DECL_THREAD_LOCAL_P (op
)
3513 || DECL_CONTEXT (op
) == current_function_decl
3514 || decl_function_context (op
) == current_function_decl
)
3519 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3520 || decl_function_context (op
) == current_function_decl
)
3531 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3534 decl_address_ip_invariant_p (const_tree op
)
3536 /* The conditions below are slightly less strict than the one in
3539 switch (TREE_CODE (op
))
3547 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3548 && !DECL_DLLIMPORT_P (op
))
3549 || DECL_THREAD_LOCAL_P (op
))
3554 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3566 /* Return true if T is function-invariant (internal function, does
3567 not handle arithmetic; that's handled in skip_simple_arithmetic and
3568 tree_invariant_p). */
3571 tree_invariant_p_1 (tree t
)
3575 if (TREE_CONSTANT (t
)
3576 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3579 switch (TREE_CODE (t
))
3585 op
= TREE_OPERAND (t
, 0);
3586 while (handled_component_p (op
))
3588 switch (TREE_CODE (op
))
3591 case ARRAY_RANGE_REF
:
3592 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3593 || TREE_OPERAND (op
, 2) != NULL_TREE
3594 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3599 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3605 op
= TREE_OPERAND (op
, 0);
3608 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3617 /* Return true if T is function-invariant. */
3620 tree_invariant_p (tree t
)
3622 tree inner
= skip_simple_arithmetic (t
);
3623 return tree_invariant_p_1 (inner
);
3626 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3627 Do this to any expression which may be used in more than one place,
3628 but must be evaluated only once.
3630 Normally, expand_expr would reevaluate the expression each time.
3631 Calling save_expr produces something that is evaluated and recorded
3632 the first time expand_expr is called on it. Subsequent calls to
3633 expand_expr just reuse the recorded value.
3635 The call to expand_expr that generates code that actually computes
3636 the value is the first call *at compile time*. Subsequent calls
3637 *at compile time* generate code to use the saved value.
3638 This produces correct result provided that *at run time* control
3639 always flows through the insns made by the first expand_expr
3640 before reaching the other places where the save_expr was evaluated.
3641 You, the caller of save_expr, must make sure this is so.
3643 Constants, and certain read-only nodes, are returned with no
3644 SAVE_EXPR because that is safe. Expressions containing placeholders
3645 are not touched; see tree.def for an explanation of what these
3649 save_expr (tree expr
)
3653 /* If the tree evaluates to a constant, then we don't want to hide that
3654 fact (i.e. this allows further folding, and direct checks for constants).
3655 However, a read-only object that has side effects cannot be bypassed.
3656 Since it is no problem to reevaluate literals, we just return the
3658 inner
= skip_simple_arithmetic (expr
);
3659 if (TREE_CODE (inner
) == ERROR_MARK
)
3662 if (tree_invariant_p_1 (inner
))
3665 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3666 it means that the size or offset of some field of an object depends on
3667 the value within another field.
3669 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3670 and some variable since it would then need to be both evaluated once and
3671 evaluated more than once. Front-ends must assure this case cannot
3672 happen by surrounding any such subexpressions in their own SAVE_EXPR
3673 and forcing evaluation at the proper time. */
3674 if (contains_placeholder_p (inner
))
3677 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3679 /* This expression might be placed ahead of a jump to ensure that the
3680 value was computed on both sides of the jump. So make sure it isn't
3681 eliminated as dead. */
3682 TREE_SIDE_EFFECTS (expr
) = 1;
3686 /* Look inside EXPR into any simple arithmetic operations. Return the
3687 outermost non-arithmetic or non-invariant node. */
3690 skip_simple_arithmetic (tree expr
)
3692 /* We don't care about whether this can be used as an lvalue in this
3694 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3695 expr
= TREE_OPERAND (expr
, 0);
3697 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3698 a constant, it will be more efficient to not make another SAVE_EXPR since
3699 it will allow better simplification and GCSE will be able to merge the
3700 computations if they actually occur. */
3703 if (UNARY_CLASS_P (expr
))
3704 expr
= TREE_OPERAND (expr
, 0);
3705 else if (BINARY_CLASS_P (expr
))
3707 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3708 expr
= TREE_OPERAND (expr
, 0);
3709 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3710 expr
= TREE_OPERAND (expr
, 1);
3721 /* Look inside EXPR into simple arithmetic operations involving constants.
3722 Return the outermost non-arithmetic or non-constant node. */
3725 skip_simple_constant_arithmetic (tree expr
)
3727 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3728 expr
= TREE_OPERAND (expr
, 0);
3732 if (UNARY_CLASS_P (expr
))
3733 expr
= TREE_OPERAND (expr
, 0);
3734 else if (BINARY_CLASS_P (expr
))
3736 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3737 expr
= TREE_OPERAND (expr
, 0);
3738 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3739 expr
= TREE_OPERAND (expr
, 1);
3750 /* Return which tree structure is used by T. */
3752 enum tree_node_structure_enum
3753 tree_node_structure (const_tree t
)
3755 const enum tree_code code
= TREE_CODE (t
);
3756 return tree_node_structure_for_code (code
);
3759 /* Set various status flags when building a CALL_EXPR object T. */
3762 process_call_operands (tree t
)
3764 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3765 bool read_only
= false;
3766 int i
= call_expr_flags (t
);
3768 /* Calls have side-effects, except those to const or pure functions. */
3769 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3770 side_effects
= true;
3771 /* Propagate TREE_READONLY of arguments for const functions. */
3775 if (!side_effects
|| read_only
)
3776 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3778 tree op
= TREE_OPERAND (t
, i
);
3779 if (op
&& TREE_SIDE_EFFECTS (op
))
3780 side_effects
= true;
3781 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3785 TREE_SIDE_EFFECTS (t
) = side_effects
;
3786 TREE_READONLY (t
) = read_only
;
3789 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3790 size or offset that depends on a field within a record. */
3793 contains_placeholder_p (const_tree exp
)
3795 enum tree_code code
;
3800 code
= TREE_CODE (exp
);
3801 if (code
== PLACEHOLDER_EXPR
)
3804 switch (TREE_CODE_CLASS (code
))
3807 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3808 position computations since they will be converted into a
3809 WITH_RECORD_EXPR involving the reference, which will assume
3810 here will be valid. */
3811 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3813 case tcc_exceptional
:
3814 if (code
== TREE_LIST
)
3815 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3816 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3821 case tcc_comparison
:
3822 case tcc_expression
:
3826 /* Ignoring the first operand isn't quite right, but works best. */
3827 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3830 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3831 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3832 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3835 /* The save_expr function never wraps anything containing
3836 a PLACEHOLDER_EXPR. */
3843 switch (TREE_CODE_LENGTH (code
))
3846 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3848 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3849 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3860 const_call_expr_arg_iterator iter
;
3861 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3862 if (CONTAINS_PLACEHOLDER_P (arg
))
3876 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3877 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3881 type_contains_placeholder_1 (const_tree type
)
3883 /* If the size contains a placeholder or the parent type (component type in
3884 the case of arrays) type involves a placeholder, this type does. */
3885 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3886 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3887 || (!POINTER_TYPE_P (type
)
3889 && type_contains_placeholder_p (TREE_TYPE (type
))))
3892 /* Now do type-specific checks. Note that the last part of the check above
3893 greatly limits what we have to do below. */
3894 switch (TREE_CODE (type
))
3902 case REFERENCE_TYPE
:
3911 case FIXED_POINT_TYPE
:
3912 /* Here we just check the bounds. */
3913 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3914 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3917 /* We have already checked the component type above, so just check
3918 the domain type. Flexible array members have a null domain. */
3919 return TYPE_DOMAIN (type
) ?
3920 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3924 case QUAL_UNION_TYPE
:
3928 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3929 if (TREE_CODE (field
) == FIELD_DECL
3930 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3931 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3932 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3933 || type_contains_placeholder_p (TREE_TYPE (field
))))
3944 /* Wrapper around above function used to cache its result. */
3947 type_contains_placeholder_p (tree type
)
3951 /* If the contains_placeholder_bits field has been initialized,
3952 then we know the answer. */
3953 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3954 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3956 /* Indicate that we've seen this type node, and the answer is false.
3957 This is what we want to return if we run into recursion via fields. */
3958 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3960 /* Compute the real value. */
3961 result
= type_contains_placeholder_1 (type
);
3963 /* Store the real value. */
3964 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3969 /* Push tree EXP onto vector QUEUE if it is not already present. */
3972 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3977 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3978 if (simple_cst_equal (iter
, exp
) == 1)
3982 queue
->safe_push (exp
);
3985 /* Given a tree EXP, find all occurrences of references to fields
3986 in a PLACEHOLDER_EXPR and place them in vector REFS without
3987 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3988 we assume here that EXP contains only arithmetic expressions
3989 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3993 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3995 enum tree_code code
= TREE_CODE (exp
);
3999 /* We handle TREE_LIST and COMPONENT_REF separately. */
4000 if (code
== TREE_LIST
)
4002 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
4003 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
4005 else if (code
== COMPONENT_REF
)
4007 for (inner
= TREE_OPERAND (exp
, 0);
4008 REFERENCE_CLASS_P (inner
);
4009 inner
= TREE_OPERAND (inner
, 0))
4012 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
4013 push_without_duplicates (exp
, refs
);
4015 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
4018 switch (TREE_CODE_CLASS (code
))
4023 case tcc_declaration
:
4024 /* Variables allocated to static storage can stay. */
4025 if (!TREE_STATIC (exp
))
4026 push_without_duplicates (exp
, refs
);
4029 case tcc_expression
:
4030 /* This is the pattern built in ada/make_aligning_type. */
4031 if (code
== ADDR_EXPR
4032 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
4034 push_without_duplicates (exp
, refs
);
4040 case tcc_exceptional
:
4043 case tcc_comparison
:
4045 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4046 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4050 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4051 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4059 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4060 return a tree with all occurrences of references to F in a
4061 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4062 CONST_DECLs. Note that we assume here that EXP contains only
4063 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4064 occurring only in their argument list. */
4067 substitute_in_expr (tree exp
, tree f
, tree r
)
4069 enum tree_code code
= TREE_CODE (exp
);
4070 tree op0
, op1
, op2
, op3
;
4073 /* We handle TREE_LIST and COMPONENT_REF separately. */
4074 if (code
== TREE_LIST
)
4076 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4077 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4078 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4081 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4083 else if (code
== COMPONENT_REF
)
4087 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4088 and it is the right field, replace it with R. */
4089 for (inner
= TREE_OPERAND (exp
, 0);
4090 REFERENCE_CLASS_P (inner
);
4091 inner
= TREE_OPERAND (inner
, 0))
4095 op1
= TREE_OPERAND (exp
, 1);
4097 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4100 /* If this expression hasn't been completed let, leave it alone. */
4101 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4104 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4105 if (op0
== TREE_OPERAND (exp
, 0))
4109 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4112 switch (TREE_CODE_CLASS (code
))
4117 case tcc_declaration
:
4123 case tcc_expression
:
4129 case tcc_exceptional
:
4132 case tcc_comparison
:
4134 switch (TREE_CODE_LENGTH (code
))
4140 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4141 if (op0
== TREE_OPERAND (exp
, 0))
4144 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4148 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4149 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4151 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4154 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4158 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4159 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4160 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4162 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4163 && op2
== TREE_OPERAND (exp
, 2))
4166 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4170 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4171 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4172 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4173 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4175 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4176 && op2
== TREE_OPERAND (exp
, 2)
4177 && op3
== TREE_OPERAND (exp
, 3))
4181 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4193 new_tree
= NULL_TREE
;
4195 /* If we are trying to replace F with a constant or with another
4196 instance of one of the arguments of the call, inline back
4197 functions which do nothing else than computing a value from
4198 the arguments they are passed. This makes it possible to
4199 fold partially or entirely the replacement expression. */
4200 if (code
== CALL_EXPR
)
4202 bool maybe_inline
= false;
4203 if (CONSTANT_CLASS_P (r
))
4204 maybe_inline
= true;
4206 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4207 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4209 maybe_inline
= true;
4214 tree t
= maybe_inline_call_in_expr (exp
);
4216 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4220 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4222 tree op
= TREE_OPERAND (exp
, i
);
4223 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4227 new_tree
= copy_node (exp
);
4228 TREE_OPERAND (new_tree
, i
) = new_op
;
4234 new_tree
= fold (new_tree
);
4235 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4236 process_call_operands (new_tree
);
4247 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4249 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4250 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4255 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4256 for it within OBJ, a tree that is an object or a chain of references. */
4259 substitute_placeholder_in_expr (tree exp
, tree obj
)
4261 enum tree_code code
= TREE_CODE (exp
);
4262 tree op0
, op1
, op2
, op3
;
4265 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4266 in the chain of OBJ. */
4267 if (code
== PLACEHOLDER_EXPR
)
4269 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4272 for (elt
= obj
; elt
!= 0;
4273 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4274 || TREE_CODE (elt
) == COND_EXPR
)
4275 ? TREE_OPERAND (elt
, 1)
4276 : (REFERENCE_CLASS_P (elt
)
4277 || UNARY_CLASS_P (elt
)
4278 || BINARY_CLASS_P (elt
)
4279 || VL_EXP_CLASS_P (elt
)
4280 || EXPRESSION_CLASS_P (elt
))
4281 ? TREE_OPERAND (elt
, 0) : 0))
4282 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4285 for (elt
= obj
; elt
!= 0;
4286 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4287 || TREE_CODE (elt
) == COND_EXPR
)
4288 ? TREE_OPERAND (elt
, 1)
4289 : (REFERENCE_CLASS_P (elt
)
4290 || UNARY_CLASS_P (elt
)
4291 || BINARY_CLASS_P (elt
)
4292 || VL_EXP_CLASS_P (elt
)
4293 || EXPRESSION_CLASS_P (elt
))
4294 ? TREE_OPERAND (elt
, 0) : 0))
4295 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4296 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4298 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4300 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4301 survives until RTL generation, there will be an error. */
4305 /* TREE_LIST is special because we need to look at TREE_VALUE
4306 and TREE_CHAIN, not TREE_OPERANDS. */
4307 else if (code
== TREE_LIST
)
4309 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4310 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4311 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4314 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4317 switch (TREE_CODE_CLASS (code
))
4320 case tcc_declaration
:
4323 case tcc_exceptional
:
4326 case tcc_comparison
:
4327 case tcc_expression
:
4330 switch (TREE_CODE_LENGTH (code
))
4336 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4337 if (op0
== TREE_OPERAND (exp
, 0))
4340 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4344 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4345 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4347 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4350 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4354 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4355 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4356 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4358 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4359 && op2
== TREE_OPERAND (exp
, 2))
4362 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4366 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4367 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4368 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4369 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4371 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4372 && op2
== TREE_OPERAND (exp
, 2)
4373 && op3
== TREE_OPERAND (exp
, 3))
4377 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4389 new_tree
= NULL_TREE
;
4391 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4393 tree op
= TREE_OPERAND (exp
, i
);
4394 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4398 new_tree
= copy_node (exp
);
4399 TREE_OPERAND (new_tree
, i
) = new_op
;
4405 new_tree
= fold (new_tree
);
4406 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4407 process_call_operands (new_tree
);
4418 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4420 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4421 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4427 /* Subroutine of stabilize_reference; this is called for subtrees of
4428 references. Any expression with side-effects must be put in a SAVE_EXPR
4429 to ensure that it is only evaluated once.
4431 We don't put SAVE_EXPR nodes around everything, because assigning very
4432 simple expressions to temporaries causes us to miss good opportunities
4433 for optimizations. Among other things, the opportunity to fold in the
4434 addition of a constant into an addressing mode often gets lost, e.g.
4435 "y[i+1] += x;". In general, we take the approach that we should not make
4436 an assignment unless we are forced into it - i.e., that any non-side effect
4437 operator should be allowed, and that cse should take care of coalescing
4438 multiple utterances of the same expression should that prove fruitful. */
4441 stabilize_reference_1 (tree e
)
4444 enum tree_code code
= TREE_CODE (e
);
4446 /* We cannot ignore const expressions because it might be a reference
4447 to a const array but whose index contains side-effects. But we can
4448 ignore things that are actual constant or that already have been
4449 handled by this function. */
4451 if (tree_invariant_p (e
))
4454 switch (TREE_CODE_CLASS (code
))
4456 case tcc_exceptional
:
4457 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4458 have side-effects. */
4459 if (code
== STATEMENT_LIST
)
4460 return save_expr (e
);
4463 case tcc_declaration
:
4464 case tcc_comparison
:
4466 case tcc_expression
:
4469 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4470 so that it will only be evaluated once. */
4471 /* The reference (r) and comparison (<) classes could be handled as
4472 below, but it is generally faster to only evaluate them once. */
4473 if (TREE_SIDE_EFFECTS (e
))
4474 return save_expr (e
);
4478 /* Constants need no processing. In fact, we should never reach
4483 /* Division is slow and tends to be compiled with jumps,
4484 especially the division by powers of 2 that is often
4485 found inside of an array reference. So do it just once. */
4486 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4487 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4488 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4489 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4490 return save_expr (e
);
4491 /* Recursively stabilize each operand. */
4492 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4493 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4497 /* Recursively stabilize each operand. */
4498 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4505 TREE_TYPE (result
) = TREE_TYPE (e
);
4506 TREE_READONLY (result
) = TREE_READONLY (e
);
4507 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4508 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4513 /* Stabilize a reference so that we can use it any number of times
4514 without causing its operands to be evaluated more than once.
4515 Returns the stabilized reference. This works by means of save_expr,
4516 so see the caveats in the comments about save_expr.
4518 Also allows conversion expressions whose operands are references.
4519 Any other kind of expression is returned unchanged. */
4522 stabilize_reference (tree ref
)
4525 enum tree_code code
= TREE_CODE (ref
);
4532 /* No action is needed in this case. */
4537 case FIX_TRUNC_EXPR
:
4538 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4542 result
= build_nt (INDIRECT_REF
,
4543 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4547 result
= build_nt (COMPONENT_REF
,
4548 stabilize_reference (TREE_OPERAND (ref
, 0)),
4549 TREE_OPERAND (ref
, 1), NULL_TREE
);
4553 result
= build_nt (BIT_FIELD_REF
,
4554 stabilize_reference (TREE_OPERAND (ref
, 0)),
4555 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4556 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4560 result
= build_nt (ARRAY_REF
,
4561 stabilize_reference (TREE_OPERAND (ref
, 0)),
4562 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4563 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4566 case ARRAY_RANGE_REF
:
4567 result
= build_nt (ARRAY_RANGE_REF
,
4568 stabilize_reference (TREE_OPERAND (ref
, 0)),
4569 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4570 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4574 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4575 it wouldn't be ignored. This matters when dealing with
4577 return stabilize_reference_1 (ref
);
4579 /* If arg isn't a kind of lvalue we recognize, make no change.
4580 Caller should recognize the error for an invalid lvalue. */
4585 return error_mark_node
;
4588 TREE_TYPE (result
) = TREE_TYPE (ref
);
4589 TREE_READONLY (result
) = TREE_READONLY (ref
);
4590 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4591 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4596 /* Low-level constructors for expressions. */
4598 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4599 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4602 recompute_tree_invariant_for_addr_expr (tree t
)
4605 bool tc
= true, se
= false;
4607 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4609 /* We started out assuming this address is both invariant and constant, but
4610 does not have side effects. Now go down any handled components and see if
4611 any of them involve offsets that are either non-constant or non-invariant.
4612 Also check for side-effects.
4614 ??? Note that this code makes no attempt to deal with the case where
4615 taking the address of something causes a copy due to misalignment. */
4617 #define UPDATE_FLAGS(NODE) \
4618 do { tree _node = (NODE); \
4619 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4620 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4622 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4623 node
= TREE_OPERAND (node
, 0))
4625 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4626 array reference (probably made temporarily by the G++ front end),
4627 so ignore all the operands. */
4628 if ((TREE_CODE (node
) == ARRAY_REF
4629 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4630 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4632 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4633 if (TREE_OPERAND (node
, 2))
4634 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4635 if (TREE_OPERAND (node
, 3))
4636 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4638 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4639 FIELD_DECL, apparently. The G++ front end can put something else
4640 there, at least temporarily. */
4641 else if (TREE_CODE (node
) == COMPONENT_REF
4642 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4644 if (TREE_OPERAND (node
, 2))
4645 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4649 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4651 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4652 the address, since &(*a)->b is a form of addition. If it's a constant, the
4653 address is constant too. If it's a decl, its address is constant if the
4654 decl is static. Everything else is not constant and, furthermore,
4655 taking the address of a volatile variable is not volatile. */
4656 if (TREE_CODE (node
) == INDIRECT_REF
4657 || TREE_CODE (node
) == MEM_REF
)
4658 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4659 else if (CONSTANT_CLASS_P (node
))
4661 else if (DECL_P (node
))
4662 tc
&= (staticp (node
) != NULL_TREE
);
4666 se
|= TREE_SIDE_EFFECTS (node
);
4670 TREE_CONSTANT (t
) = tc
;
4671 TREE_SIDE_EFFECTS (t
) = se
;
4675 /* Build an expression of code CODE, data type TYPE, and operands as
4676 specified. Expressions and reference nodes can be created this way.
4677 Constants, decls, types and misc nodes cannot be.
4679 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4680 enough for all extant tree codes. */
4683 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4687 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4689 t
= make_node (code PASS_MEM_STAT
);
4696 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4698 int length
= sizeof (struct tree_exp
);
4701 record_node_allocation_statistics (code
, length
);
4703 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4705 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4707 memset (t
, 0, sizeof (struct tree_common
));
4709 TREE_SET_CODE (t
, code
);
4711 TREE_TYPE (t
) = type
;
4712 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4713 TREE_OPERAND (t
, 0) = node
;
4714 if (node
&& !TYPE_P (node
))
4716 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4717 TREE_READONLY (t
) = TREE_READONLY (node
);
4720 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4722 if (code
!= DEBUG_BEGIN_STMT
)
4723 TREE_SIDE_EFFECTS (t
) = 1;
4728 /* All of these have side-effects, no matter what their
4730 TREE_SIDE_EFFECTS (t
) = 1;
4731 TREE_READONLY (t
) = 0;
4735 /* Whether a dereference is readonly has nothing to do with whether
4736 its operand is readonly. */
4737 TREE_READONLY (t
) = 0;
4742 recompute_tree_invariant_for_addr_expr (t
);
4746 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4747 && node
&& !TYPE_P (node
)
4748 && TREE_CONSTANT (node
))
4749 TREE_CONSTANT (t
) = 1;
4750 if (TREE_CODE_CLASS (code
) == tcc_reference
4751 && node
&& TREE_THIS_VOLATILE (node
))
4752 TREE_THIS_VOLATILE (t
) = 1;
4759 #define PROCESS_ARG(N) \
4761 TREE_OPERAND (t, N) = arg##N; \
4762 if (arg##N &&!TYPE_P (arg##N)) \
4764 if (TREE_SIDE_EFFECTS (arg##N)) \
4766 if (!TREE_READONLY (arg##N) \
4767 && !CONSTANT_CLASS_P (arg##N)) \
4768 (void) (read_only = 0); \
4769 if (!TREE_CONSTANT (arg##N)) \
4770 (void) (constant = 0); \
4775 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4777 bool constant
, read_only
, side_effects
, div_by_zero
;
4780 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4782 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4783 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4784 /* When sizetype precision doesn't match that of pointers
4785 we need to be able to build explicit extensions or truncations
4786 of the offset argument. */
4787 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4788 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4789 && TREE_CODE (arg1
) == INTEGER_CST
);
4791 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4792 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4793 && ptrofftype_p (TREE_TYPE (arg1
)));
4795 t
= make_node (code PASS_MEM_STAT
);
4798 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4799 result based on those same flags for the arguments. But if the
4800 arguments aren't really even `tree' expressions, we shouldn't be trying
4803 /* Expressions without side effects may be constant if their
4804 arguments are as well. */
4805 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4806 || TREE_CODE_CLASS (code
) == tcc_binary
);
4808 side_effects
= TREE_SIDE_EFFECTS (t
);
4812 case TRUNC_DIV_EXPR
:
4814 case FLOOR_DIV_EXPR
:
4815 case ROUND_DIV_EXPR
:
4816 case EXACT_DIV_EXPR
:
4818 case FLOOR_MOD_EXPR
:
4819 case ROUND_MOD_EXPR
:
4820 case TRUNC_MOD_EXPR
:
4821 div_by_zero
= integer_zerop (arg1
);
4824 div_by_zero
= false;
4830 TREE_SIDE_EFFECTS (t
) = side_effects
;
4831 if (code
== MEM_REF
)
4833 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4835 tree o
= TREE_OPERAND (arg0
, 0);
4836 TREE_READONLY (t
) = TREE_READONLY (o
);
4837 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4842 TREE_READONLY (t
) = read_only
;
4843 /* Don't mark X / 0 as constant. */
4844 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4845 TREE_THIS_VOLATILE (t
)
4846 = (TREE_CODE_CLASS (code
) == tcc_reference
4847 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4855 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4856 tree arg2 MEM_STAT_DECL
)
4858 bool constant
, read_only
, side_effects
;
4861 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4862 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4864 t
= make_node (code PASS_MEM_STAT
);
4869 /* As a special exception, if COND_EXPR has NULL branches, we
4870 assume that it is a gimple statement and always consider
4871 it to have side effects. */
4872 if (code
== COND_EXPR
4873 && tt
== void_type_node
4874 && arg1
== NULL_TREE
4875 && arg2
== NULL_TREE
)
4876 side_effects
= true;
4878 side_effects
= TREE_SIDE_EFFECTS (t
);
4884 if (code
== COND_EXPR
)
4885 TREE_READONLY (t
) = read_only
;
4887 TREE_SIDE_EFFECTS (t
) = side_effects
;
4888 TREE_THIS_VOLATILE (t
)
4889 = (TREE_CODE_CLASS (code
) == tcc_reference
4890 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4896 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4897 tree arg2
, tree arg3 MEM_STAT_DECL
)
4899 bool constant
, read_only
, side_effects
;
4902 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4904 t
= make_node (code PASS_MEM_STAT
);
4907 side_effects
= TREE_SIDE_EFFECTS (t
);
4914 TREE_SIDE_EFFECTS (t
) = side_effects
;
4915 TREE_THIS_VOLATILE (t
)
4916 = (TREE_CODE_CLASS (code
) == tcc_reference
4917 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4923 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4924 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4926 bool constant
, read_only
, side_effects
;
4929 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4931 t
= make_node (code PASS_MEM_STAT
);
4934 side_effects
= TREE_SIDE_EFFECTS (t
);
4942 TREE_SIDE_EFFECTS (t
) = side_effects
;
4943 if (code
== TARGET_MEM_REF
)
4945 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4947 tree o
= TREE_OPERAND (arg0
, 0);
4948 TREE_READONLY (t
) = TREE_READONLY (o
);
4949 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4953 TREE_THIS_VOLATILE (t
)
4954 = (TREE_CODE_CLASS (code
) == tcc_reference
4955 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4960 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4961 on the pointer PTR. */
4964 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4966 poly_int64 offset
= 0;
4967 tree ptype
= TREE_TYPE (ptr
);
4969 /* For convenience allow addresses that collapse to a simple base
4971 if (TREE_CODE (ptr
) == ADDR_EXPR
4972 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4973 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4975 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4977 if (TREE_CODE (ptr
) == MEM_REF
)
4979 offset
+= mem_ref_offset (ptr
).force_shwi ();
4980 ptr
= TREE_OPERAND (ptr
, 0);
4983 ptr
= build_fold_addr_expr (ptr
);
4984 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4986 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4987 ptr
, build_int_cst (ptype
, offset
));
4988 SET_EXPR_LOCATION (tem
, loc
);
4992 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4995 mem_ref_offset (const_tree t
)
4997 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
5001 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
5002 offsetted by OFFSET units. */
5005 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
5007 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
5008 build_fold_addr_expr (base
),
5009 build_int_cst (ptr_type_node
, offset
));
5010 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
5011 recompute_tree_invariant_for_addr_expr (addr
);
5015 /* Similar except don't specify the TREE_TYPE
5016 and leave the TREE_SIDE_EFFECTS as 0.
5017 It is permissible for arguments to be null,
5018 or even garbage if their values do not matter. */
5021 build_nt (enum tree_code code
, ...)
5028 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
5032 t
= make_node (code
);
5033 length
= TREE_CODE_LENGTH (code
);
5035 for (i
= 0; i
< length
; i
++)
5036 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
5042 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5046 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5051 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5052 CALL_EXPR_FN (ret
) = fn
;
5053 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5054 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5055 CALL_EXPR_ARG (ret
, ix
) = t
;
5059 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5061 We do NOT enter this node in any sort of symbol table.
5063 LOC is the location of the decl.
5065 layout_decl is used to set up the decl's storage layout.
5066 Other slots are initialized to 0 or null pointers. */
5069 build_decl (location_t loc
, enum tree_code code
, tree name
,
5070 tree type MEM_STAT_DECL
)
5074 t
= make_node (code PASS_MEM_STAT
);
5075 DECL_SOURCE_LOCATION (t
) = loc
;
5077 /* if (type == error_mark_node)
5078 type = integer_type_node; */
5079 /* That is not done, deliberately, so that having error_mark_node
5080 as the type can suppress useless errors in the use of this variable. */
5082 DECL_NAME (t
) = name
;
5083 TREE_TYPE (t
) = type
;
5085 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5091 /* Builds and returns function declaration with NAME and TYPE. */
5094 build_fn_decl (const char *name
, tree type
)
5096 tree id
= get_identifier (name
);
5097 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5099 DECL_EXTERNAL (decl
) = 1;
5100 TREE_PUBLIC (decl
) = 1;
5101 DECL_ARTIFICIAL (decl
) = 1;
5102 TREE_NOTHROW (decl
) = 1;
5107 vec
<tree
, va_gc
> *all_translation_units
;
5109 /* Builds a new translation-unit decl with name NAME, queues it in the
5110 global list of translation-unit decls and returns it. */
5113 build_translation_unit_decl (tree name
)
5115 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5117 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5118 vec_safe_push (all_translation_units
, tu
);
5123 /* BLOCK nodes are used to represent the structure of binding contours
5124 and declarations, once those contours have been exited and their contents
5125 compiled. This information is used for outputting debugging info. */
5128 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5130 tree block
= make_node (BLOCK
);
5132 BLOCK_VARS (block
) = vars
;
5133 BLOCK_SUBBLOCKS (block
) = subblocks
;
5134 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5135 BLOCK_CHAIN (block
) = chain
;
5140 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5142 LOC is the location to use in tree T. */
5145 protected_set_expr_location (tree t
, location_t loc
)
5147 if (CAN_HAVE_LOCATION_P (t
))
5148 SET_EXPR_LOCATION (t
, loc
);
5149 else if (t
&& TREE_CODE (t
) == STATEMENT_LIST
)
5151 t
= expr_single (t
);
5152 if (t
&& CAN_HAVE_LOCATION_P (t
))
5153 SET_EXPR_LOCATION (t
, loc
);
5157 /* Like PROTECTED_SET_EXPR_LOCATION, but only do that if T has
5158 UNKNOWN_LOCATION. */
5161 protected_set_expr_location_if_unset (tree t
, location_t loc
)
5163 t
= expr_single (t
);
5164 if (t
&& !EXPR_HAS_LOCATION (t
))
5165 protected_set_expr_location (t
, loc
);
5168 /* Data used when collecting DECLs and TYPEs for language data removal. */
5170 class free_lang_data_d
5173 free_lang_data_d () : decls (100), types (100) {}
5175 /* Worklist to avoid excessive recursion. */
5176 auto_vec
<tree
> worklist
;
5178 /* Set of traversed objects. Used to avoid duplicate visits. */
5179 hash_set
<tree
> pset
;
5181 /* Array of symbols to process with free_lang_data_in_decl. */
5182 auto_vec
<tree
> decls
;
5184 /* Array of types to process with free_lang_data_in_type. */
5185 auto_vec
<tree
> types
;
5189 /* Add type or decl T to one of the list of tree nodes that need their
5190 language data removed. The lists are held inside FLD. */
5193 add_tree_to_fld_list (tree t
, class free_lang_data_d
*fld
)
5196 fld
->decls
.safe_push (t
);
5197 else if (TYPE_P (t
))
5198 fld
->types
.safe_push (t
);
5203 /* Push tree node T into FLD->WORKLIST. */
5206 fld_worklist_push (tree t
, class free_lang_data_d
*fld
)
5208 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5209 fld
->worklist
.safe_push ((t
));
5214 /* Return simplified TYPE_NAME of TYPE. */
5217 fld_simplified_type_name (tree type
)
5219 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5220 return TYPE_NAME (type
);
5221 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5222 TYPE_DECL if the type doesn't have linkage.
5223 this must match fld_ */
5224 if (type
!= TYPE_MAIN_VARIANT (type
)
5225 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5226 && (TREE_CODE (type
) != RECORD_TYPE
5227 || !TYPE_BINFO (type
)
5228 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5229 return DECL_NAME (TYPE_NAME (type
));
5230 return TYPE_NAME (type
);
5233 /* Do same comparsion as check_qualified_type skipping lang part of type
5234 and be more permissive about type names: we only care that names are
5235 same (for diagnostics) and that ODR names are the same.
5236 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5239 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5241 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5242 /* We want to match incomplete variants with complete types.
5243 In this case we need to ignore alignment. */
5244 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5245 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5246 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5247 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5248 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5249 TYPE_ATTRIBUTES (v
))
5250 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5256 /* Find variant of FIRST that match T and create new one if necessary.
5257 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5260 fld_type_variant (tree first
, tree t
, class free_lang_data_d
*fld
,
5261 tree inner_type
= NULL
)
5263 if (first
== TYPE_MAIN_VARIANT (t
))
5265 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5266 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5268 tree v
= build_variant_type_copy (first
);
5269 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5270 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5271 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5272 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5273 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5274 TYPE_NAME (v
) = TYPE_NAME (t
);
5275 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5276 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5277 /* Variants of incomplete types should have alignment
5278 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5279 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5281 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5282 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5285 TREE_TYPE (v
) = inner_type
;
5286 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5287 if (!fld
->pset
.add (v
))
5288 add_tree_to_fld_list (v
, fld
);
5292 /* Map complete types to incomplete types. */
5294 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5296 /* Map types to simplified types. */
5298 static hash_map
<tree
, tree
> *fld_simplified_types
;
5300 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5301 use MAP to prevent duplicates. */
5304 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5305 class free_lang_data_d
*fld
)
5307 if (TREE_TYPE (t
) == t2
)
5310 if (TYPE_MAIN_VARIANT (t
) != t
)
5312 return fld_type_variant
5313 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5314 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5320 = map
->get_or_insert (t
, &existed
);
5324 = build_array_type_1 (t2
, TYPE_DOMAIN (t
), TYPE_TYPELESS_STORAGE (t
),
5326 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5327 if (!fld
->pset
.add (array
))
5328 add_tree_to_fld_list (array
, fld
);
5333 /* Return CTX after removal of contexts that are not relevant */
5336 fld_decl_context (tree ctx
)
5338 /* Variably modified types are needed for tree_is_indexable to decide
5339 whether the type needs to go to local or global section.
5340 This code is semi-broken but for now it is easiest to keep contexts
5342 if (ctx
&& TYPE_P (ctx
)
5343 && !variably_modified_type_p (ctx
, NULL_TREE
))
5345 while (ctx
&& TYPE_P (ctx
))
5346 ctx
= TYPE_CONTEXT (ctx
);
5351 /* For T being aggregate type try to turn it into a incomplete variant.
5352 Return T if no simplification is possible. */
5355 fld_incomplete_type_of (tree t
, class free_lang_data_d
*fld
)
5359 if (POINTER_TYPE_P (t
))
5361 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5362 if (t2
!= TREE_TYPE (t
))
5365 if (TREE_CODE (t
) == POINTER_TYPE
)
5366 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5367 TYPE_REF_CAN_ALIAS_ALL (t
));
5369 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5370 TYPE_REF_CAN_ALIAS_ALL (t
));
5371 gcc_assert (TYPE_CANONICAL (t2
) != t2
5372 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5373 if (!fld
->pset
.add (first
))
5374 add_tree_to_fld_list (first
, fld
);
5375 return fld_type_variant (first
, t
, fld
);
5379 if (TREE_CODE (t
) == ARRAY_TYPE
)
5380 return fld_process_array_type (t
,
5381 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5382 fld_incomplete_types
, fld
);
5383 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5384 || !COMPLETE_TYPE_P (t
))
5386 if (TYPE_MAIN_VARIANT (t
) == t
)
5390 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5394 copy
= build_distinct_type_copy (t
);
5396 /* It is possible that type was not seen by free_lang_data yet. */
5397 if (!fld
->pset
.add (copy
))
5398 add_tree_to_fld_list (copy
, fld
);
5399 TYPE_SIZE (copy
) = NULL
;
5400 TYPE_USER_ALIGN (copy
) = 0;
5401 TYPE_SIZE_UNIT (copy
) = NULL
;
5402 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5403 TREE_ADDRESSABLE (copy
) = 0;
5404 if (AGGREGATE_TYPE_P (t
))
5406 SET_TYPE_MODE (copy
, VOIDmode
);
5407 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5408 TYPE_TYPELESS_STORAGE (copy
) = 0;
5409 TYPE_FIELDS (copy
) = NULL
;
5410 TYPE_BINFO (copy
) = NULL
;
5411 TYPE_FINAL_P (copy
) = 0;
5412 TYPE_EMPTY_P (copy
) = 0;
5416 TYPE_VALUES (copy
) = NULL
;
5417 ENUM_IS_OPAQUE (copy
) = 0;
5418 ENUM_IS_SCOPED (copy
) = 0;
5421 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5422 This is needed for ODR violation warnings to come out right (we
5423 want duplicate TYPE_DECLs whenever the type is duplicated because
5424 of ODR violation. Because lang data in the TYPE_DECL may not
5425 have been freed yet, rebuild it from scratch and copy relevant
5427 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5428 tree name
= TYPE_NAME (copy
);
5430 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5432 gcc_checking_assert (TREE_TYPE (name
) == t
);
5433 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5434 DECL_NAME (name
), copy
);
5435 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5436 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5437 SET_DECL_ALIGN (name2
, 0);
5438 DECL_CONTEXT (name2
) = fld_decl_context
5439 (DECL_CONTEXT (name
));
5440 TYPE_NAME (copy
) = name2
;
5445 return (fld_type_variant
5446 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5449 /* Simplify type T for scenarios where we do not need complete pointer
5453 fld_simplified_type (tree t
, class free_lang_data_d
*fld
)
5457 if (POINTER_TYPE_P (t
))
5458 return fld_incomplete_type_of (t
, fld
);
5459 /* FIXME: This triggers verification error, see PR88140. */
5460 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5461 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5462 fld_simplified_types
, fld
);
5466 /* Reset the expression *EXPR_P, a size or position.
5468 ??? We could reset all non-constant sizes or positions. But it's cheap
5469 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5471 We need to reset self-referential sizes or positions because they cannot
5472 be gimplified and thus can contain a CALL_EXPR after the gimplification
5473 is finished, which will run afoul of LTO streaming. And they need to be
5474 reset to something essentially dummy but not constant, so as to preserve
5475 the properties of the object they are attached to. */
5478 free_lang_data_in_one_sizepos (tree
*expr_p
)
5480 tree expr
= *expr_p
;
5481 if (CONTAINS_PLACEHOLDER_P (expr
))
5482 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5486 /* Reset all the fields in a binfo node BINFO. We only keep
5487 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5490 free_lang_data_in_binfo (tree binfo
)
5495 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5497 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5498 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5499 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5500 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5501 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5502 TREE_PUBLIC (binfo
) = 0;
5504 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5505 free_lang_data_in_binfo (t
);
5509 /* Reset all language specific information still present in TYPE. */
5512 free_lang_data_in_type (tree type
, class free_lang_data_d
*fld
)
5514 gcc_assert (TYPE_P (type
));
5516 /* Give the FE a chance to remove its own data first. */
5517 lang_hooks
.free_lang_data (type
);
5519 TREE_LANG_FLAG_0 (type
) = 0;
5520 TREE_LANG_FLAG_1 (type
) = 0;
5521 TREE_LANG_FLAG_2 (type
) = 0;
5522 TREE_LANG_FLAG_3 (type
) = 0;
5523 TREE_LANG_FLAG_4 (type
) = 0;
5524 TREE_LANG_FLAG_5 (type
) = 0;
5525 TREE_LANG_FLAG_6 (type
) = 0;
5527 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5529 /* Purge non-marked variants from the variants chain, so that they
5530 don't reappear in the IL after free_lang_data. */
5531 while (TYPE_NEXT_VARIANT (type
)
5532 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5534 tree t
= TYPE_NEXT_VARIANT (type
);
5535 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5536 /* Turn the removed types into distinct types. */
5537 TYPE_MAIN_VARIANT (t
) = t
;
5538 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5541 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5543 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5544 /* Remove the const and volatile qualifiers from arguments. The
5545 C++ front end removes them, but the C front end does not,
5546 leading to false ODR violation errors when merging two
5547 instances of the same function signature compiled by
5548 different front ends. */
5549 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5551 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5552 tree arg_type
= TREE_VALUE (p
);
5554 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5556 int quals
= TYPE_QUALS (arg_type
)
5558 & ~TYPE_QUAL_VOLATILE
;
5559 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5560 if (!fld
->pset
.add (TREE_VALUE (p
)))
5561 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5563 /* C++ FE uses TREE_PURPOSE to store initial values. */
5564 TREE_PURPOSE (p
) = NULL
;
5567 else if (TREE_CODE (type
) == METHOD_TYPE
)
5569 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5570 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5572 /* C++ FE uses TREE_PURPOSE to store initial values. */
5573 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5574 TREE_PURPOSE (p
) = NULL
;
5577 else if (RECORD_OR_UNION_TYPE_P (type
))
5579 /* Remove members that are not FIELD_DECLs from the field list
5580 of an aggregate. These occur in C++. */
5581 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5582 if (TREE_CODE (member
) == FIELD_DECL
)
5583 prev
= &DECL_CHAIN (member
);
5585 *prev
= DECL_CHAIN (member
);
5587 TYPE_VFIELD (type
) = NULL_TREE
;
5589 if (TYPE_BINFO (type
))
5591 free_lang_data_in_binfo (TYPE_BINFO (type
));
5592 /* We need to preserve link to bases and virtual table for all
5593 polymorphic types to make devirtualization machinery working. */
5594 if (!BINFO_VTABLE (TYPE_BINFO (type
)))
5595 TYPE_BINFO (type
) = NULL
;
5598 else if (INTEGRAL_TYPE_P (type
)
5599 || SCALAR_FLOAT_TYPE_P (type
)
5600 || FIXED_POINT_TYPE_P (type
))
5602 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5604 ENUM_IS_OPAQUE (type
) = 0;
5605 ENUM_IS_SCOPED (type
) = 0;
5606 /* Type values are used only for C++ ODR checking. Drop them
5607 for all type variants and non-ODR types.
5608 For ODR types the data is freed in free_odr_warning_data. */
5609 if (TYPE_MAIN_VARIANT (type
) != type
5610 || !type_with_linkage_p (type
))
5611 TYPE_VALUES (type
) = NULL
;
5613 /* Simplify representation by recording only values rather
5614 than const decls. */
5615 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5616 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5617 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5619 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5620 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5623 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5625 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5626 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5628 if (TYPE_CONTEXT (type
)
5629 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5631 tree ctx
= TYPE_CONTEXT (type
);
5634 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5636 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5637 TYPE_CONTEXT (type
) = ctx
;
5640 TYPE_STUB_DECL (type
) = NULL
;
5641 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5645 /* Return true if DECL may need an assembler name to be set. */
5648 need_assembler_name_p (tree decl
)
5650 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5651 Rule merging. This makes type_odr_p to return true on those types during
5652 LTO and by comparing the mangled name, we can say what types are intended
5653 to be equivalent across compilation unit.
5655 We do not store names of type_in_anonymous_namespace_p.
5657 Record, union and enumeration type have linkage that allows use
5658 to check type_in_anonymous_namespace_p. We do not mangle compound types
5659 that always can be compared structurally.
5661 Similarly for builtin types, we compare properties of their main variant.
5662 A special case are integer types where mangling do make differences
5663 between char/signed char/unsigned char etc. Storing name for these makes
5664 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5665 See cp/mangle.c:write_builtin_type for details. */
5667 if (TREE_CODE (decl
) == TYPE_DECL
)
5669 if (DECL_NAME (decl
)
5670 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5671 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5672 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5673 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5674 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5675 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5676 && (type_with_linkage_p (TREE_TYPE (decl
))
5677 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5678 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5679 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5682 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5683 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5686 /* If DECL already has its assembler name set, it does not need a
5688 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5689 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5692 /* Abstract decls do not need an assembler name. */
5693 if (DECL_ABSTRACT_P (decl
))
5696 /* For VAR_DECLs, only static, public and external symbols need an
5699 && !TREE_STATIC (decl
)
5700 && !TREE_PUBLIC (decl
)
5701 && !DECL_EXTERNAL (decl
))
5704 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5706 /* Do not set assembler name on builtins. Allow RTL expansion to
5707 decide whether to expand inline or via a regular call. */
5708 if (fndecl_built_in_p (decl
)
5709 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5712 /* Functions represented in the callgraph need an assembler name. */
5713 if (cgraph_node::get (decl
) != NULL
)
5716 /* Unused and not public functions don't need an assembler name. */
5717 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5725 /* Reset all language specific information still present in symbol
5729 free_lang_data_in_decl (tree decl
, class free_lang_data_d
*fld
)
5731 gcc_assert (DECL_P (decl
));
5733 /* Give the FE a chance to remove its own data first. */
5734 lang_hooks
.free_lang_data (decl
);
5736 TREE_LANG_FLAG_0 (decl
) = 0;
5737 TREE_LANG_FLAG_1 (decl
) = 0;
5738 TREE_LANG_FLAG_2 (decl
) = 0;
5739 TREE_LANG_FLAG_3 (decl
) = 0;
5740 TREE_LANG_FLAG_4 (decl
) = 0;
5741 TREE_LANG_FLAG_5 (decl
) = 0;
5742 TREE_LANG_FLAG_6 (decl
) = 0;
5744 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5745 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5746 if (TREE_CODE (decl
) == FIELD_DECL
)
5748 DECL_FCONTEXT (decl
) = NULL
;
5749 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5750 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5751 DECL_QUALIFIER (decl
) = NULL_TREE
;
5754 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5756 struct cgraph_node
*node
;
5757 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5758 the address may be taken in other unit, so this flag has no practical
5761 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5762 for public objects that indeed cannot be adressed, but it is not
5763 the case. Set the flag to true so we do not get merge failures for
5764 i.e. virtual tables between units that take address of it and
5765 units that don't. */
5766 if (TREE_PUBLIC (decl
))
5767 TREE_ADDRESSABLE (decl
) = true;
5768 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5769 if (!(node
= cgraph_node::get (decl
))
5770 || (!node
->definition
&& !node
->clones
))
5773 node
->release_body ();
5776 release_function_body (decl
);
5777 DECL_ARGUMENTS (decl
) = NULL
;
5778 DECL_RESULT (decl
) = NULL
;
5779 DECL_INITIAL (decl
) = error_mark_node
;
5782 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5786 /* If DECL has a gimple body, then the context for its
5787 arguments must be DECL. Otherwise, it doesn't really
5788 matter, as we will not be emitting any code for DECL. In
5789 general, there may be other instances of DECL created by
5790 the front end and since PARM_DECLs are generally shared,
5791 their DECL_CONTEXT changes as the replicas of DECL are
5792 created. The only time where DECL_CONTEXT is important
5793 is for the FUNCTION_DECLs that have a gimple body (since
5794 the PARM_DECL will be used in the function's body). */
5795 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5796 DECL_CONTEXT (t
) = decl
;
5797 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5798 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5799 = target_option_default_node
;
5800 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5801 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5802 = optimization_default_node
;
5805 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5806 At this point, it is not needed anymore. */
5807 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5809 /* Clear the abstract origin if it refers to a method.
5810 Otherwise dwarf2out.c will ICE as we splice functions out of
5811 TYPE_FIELDS and thus the origin will not be output
5813 if (DECL_ABSTRACT_ORIGIN (decl
)
5814 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5815 && RECORD_OR_UNION_TYPE_P
5816 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5817 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5819 DECL_VINDEX (decl
) = NULL_TREE
;
5821 else if (VAR_P (decl
))
5823 /* See comment above why we set the flag for functions. */
5824 if (TREE_PUBLIC (decl
))
5825 TREE_ADDRESSABLE (decl
) = true;
5826 if ((DECL_EXTERNAL (decl
)
5827 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5828 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5829 DECL_INITIAL (decl
) = NULL_TREE
;
5831 else if (TREE_CODE (decl
) == TYPE_DECL
)
5833 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5834 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5835 TREE_PUBLIC (decl
) = 0;
5836 TREE_PRIVATE (decl
) = 0;
5837 DECL_ARTIFICIAL (decl
) = 0;
5838 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5839 DECL_INITIAL (decl
) = NULL_TREE
;
5840 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5841 DECL_MODE (decl
) = VOIDmode
;
5842 SET_DECL_ALIGN (decl
, 0);
5843 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5845 else if (TREE_CODE (decl
) == FIELD_DECL
)
5847 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5848 DECL_INITIAL (decl
) = NULL_TREE
;
5850 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5851 && DECL_INITIAL (decl
)
5852 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5854 /* Strip builtins from the translation-unit BLOCK. We still have targets
5855 without builtin_decl_explicit support and also builtins are shared
5856 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5857 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5861 if (TREE_CODE (var
) == FUNCTION_DECL
5862 && fndecl_built_in_p (var
))
5863 *nextp
= TREE_CHAIN (var
);
5865 nextp
= &TREE_CHAIN (var
);
5868 /* We need to keep field decls associated with their trees. Otherwise tree
5869 merging may merge some fileds and keep others disjoint wich in turn will
5870 not do well with TREE_CHAIN pointers linking them.
5872 Also do not drop containing types for virtual methods and tables because
5873 these are needed by devirtualization.
5874 C++ destructors are special because C++ frontends sometimes produces
5875 virtual destructor as an alias of non-virtual destructor. In
5876 devirutalization code we always walk through aliases and we need
5877 context to be preserved too. See PR89335 */
5878 if (TREE_CODE (decl
) != FIELD_DECL
5879 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5880 || (!DECL_VIRTUAL_P (decl
)
5881 && (TREE_CODE (decl
) != FUNCTION_DECL
5882 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5883 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5887 /* Operand callback helper for free_lang_data_in_node. *TP is the
5888 subtree operand being considered. */
5891 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5894 class free_lang_data_d
*fld
= (class free_lang_data_d
*) data
;
5896 if (TREE_CODE (t
) == TREE_LIST
)
5899 /* Language specific nodes will be removed, so there is no need
5900 to gather anything under them. */
5901 if (is_lang_specific (t
))
5909 /* Note that walk_tree does not traverse every possible field in
5910 decls, so we have to do our own traversals here. */
5911 add_tree_to_fld_list (t
, fld
);
5913 fld_worklist_push (DECL_NAME (t
), fld
);
5914 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5915 fld_worklist_push (DECL_SIZE (t
), fld
);
5916 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5918 /* We are going to remove everything under DECL_INITIAL for
5919 TYPE_DECLs. No point walking them. */
5920 if (TREE_CODE (t
) != TYPE_DECL
)
5921 fld_worklist_push (DECL_INITIAL (t
), fld
);
5923 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5924 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5926 if (TREE_CODE (t
) == FUNCTION_DECL
)
5928 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5929 fld_worklist_push (DECL_RESULT (t
), fld
);
5931 else if (TREE_CODE (t
) == FIELD_DECL
)
5933 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5934 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5935 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5936 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5939 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5940 && DECL_HAS_VALUE_EXPR_P (t
))
5941 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5943 if (TREE_CODE (t
) != FIELD_DECL
5944 && TREE_CODE (t
) != TYPE_DECL
)
5945 fld_worklist_push (TREE_CHAIN (t
), fld
);
5948 else if (TYPE_P (t
))
5950 /* Note that walk_tree does not traverse every possible field in
5951 types, so we have to do our own traversals here. */
5952 add_tree_to_fld_list (t
, fld
);
5954 if (!RECORD_OR_UNION_TYPE_P (t
))
5955 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5956 fld_worklist_push (TYPE_SIZE (t
), fld
);
5957 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5958 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5959 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5960 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5961 fld_worklist_push (TYPE_NAME (t
), fld
);
5962 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5963 lists, we may look types up in these lists and use them while
5964 optimizing the function body. Thus we need to free lang data
5966 if (TREE_CODE (t
) == POINTER_TYPE
)
5967 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5968 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5969 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5970 if (!POINTER_TYPE_P (t
))
5971 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5972 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5973 if (!RECORD_OR_UNION_TYPE_P (t
))
5974 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5975 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5976 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5977 do not and want not to reach unused variants this way. */
5978 if (TYPE_CONTEXT (t
))
5980 tree ctx
= TYPE_CONTEXT (t
);
5981 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5982 So push that instead. */
5983 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5984 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5985 fld_worklist_push (ctx
, fld
);
5987 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
5989 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5993 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5994 fld_worklist_push (TREE_TYPE (tem
), fld
);
5995 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5996 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5998 if (RECORD_OR_UNION_TYPE_P (t
))
6001 /* Push all TYPE_FIELDS - there can be interleaving interesting
6002 and non-interesting things. */
6003 tem
= TYPE_FIELDS (t
);
6006 if (TREE_CODE (tem
) == FIELD_DECL
)
6007 fld_worklist_push (tem
, fld
);
6008 tem
= TREE_CHAIN (tem
);
6011 if (FUNC_OR_METHOD_TYPE_P (t
))
6012 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
6014 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
6017 else if (TREE_CODE (t
) == BLOCK
)
6019 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
6021 if (TREE_CODE (*tem
) != LABEL_DECL
6022 && (TREE_CODE (*tem
) != VAR_DECL
6023 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
))))
6025 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
6026 && TREE_CODE (*tem
) != PARM_DECL
);
6027 *tem
= TREE_CHAIN (*tem
);
6031 fld_worklist_push (*tem
, fld
);
6032 tem
= &TREE_CHAIN (*tem
);
6035 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
6036 fld_worklist_push (tem
, fld
);
6037 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
6040 if (TREE_CODE (t
) != IDENTIFIER_NODE
6041 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
6042 fld_worklist_push (TREE_TYPE (t
), fld
);
6048 /* Find decls and types in T. */
6051 find_decls_types (tree t
, class free_lang_data_d
*fld
)
6055 if (!fld
->pset
.contains (t
))
6056 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
6057 if (fld
->worklist
.is_empty ())
6059 t
= fld
->worklist
.pop ();
6063 /* Translate all the types in LIST with the corresponding runtime
6067 get_eh_types_for_runtime (tree list
)
6071 if (list
== NULL_TREE
)
6074 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6076 list
= TREE_CHAIN (list
);
6079 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6080 TREE_CHAIN (prev
) = n
;
6081 prev
= TREE_CHAIN (prev
);
6082 list
= TREE_CHAIN (list
);
6089 /* Find decls and types referenced in EH region R and store them in
6090 FLD->DECLS and FLD->TYPES. */
6093 find_decls_types_in_eh_region (eh_region r
, class free_lang_data_d
*fld
)
6104 /* The types referenced in each catch must first be changed to the
6105 EH types used at runtime. This removes references to FE types
6107 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6109 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6110 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6115 case ERT_ALLOWED_EXCEPTIONS
:
6116 r
->u
.allowed
.type_list
6117 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6118 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6121 case ERT_MUST_NOT_THROW
:
6122 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6123 find_decls_types_r
, fld
, &fld
->pset
);
6129 /* Find decls and types referenced in cgraph node N and store them in
6130 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6131 look for *every* kind of DECL and TYPE node reachable from N,
6132 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6133 NAMESPACE_DECLs, etc). */
6136 find_decls_types_in_node (struct cgraph_node
*n
, class free_lang_data_d
*fld
)
6139 struct function
*fn
;
6143 find_decls_types (n
->decl
, fld
);
6145 if (!gimple_has_body_p (n
->decl
))
6148 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6150 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6152 /* Traverse locals. */
6153 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6154 find_decls_types (t
, fld
);
6156 /* Traverse EH regions in FN. */
6159 FOR_ALL_EH_REGION_FN (r
, fn
)
6160 find_decls_types_in_eh_region (r
, fld
);
6163 /* Traverse every statement in FN. */
6164 FOR_EACH_BB_FN (bb
, fn
)
6167 gimple_stmt_iterator si
;
6170 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6172 gphi
*phi
= psi
.phi ();
6174 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6176 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6177 find_decls_types (*arg_p
, fld
);
6181 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6183 gimple
*stmt
= gsi_stmt (si
);
6185 if (is_gimple_call (stmt
))
6186 find_decls_types (gimple_call_fntype (stmt
), fld
);
6188 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6190 tree arg
= gimple_op (stmt
, i
);
6191 find_decls_types (arg
, fld
);
6192 /* find_decls_types doesn't walk TREE_PURPOSE of TREE_LISTs,
6193 which we need for asm stmts. */
6195 && TREE_CODE (arg
) == TREE_LIST
6196 && TREE_PURPOSE (arg
)
6197 && gimple_code (stmt
) == GIMPLE_ASM
)
6198 find_decls_types (TREE_PURPOSE (arg
), fld
);
6205 /* Find decls and types referenced in varpool node N and store them in
6206 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6207 look for *every* kind of DECL and TYPE node reachable from N,
6208 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6209 NAMESPACE_DECLs, etc). */
6212 find_decls_types_in_var (varpool_node
*v
, class free_lang_data_d
*fld
)
6214 find_decls_types (v
->decl
, fld
);
6217 /* If T needs an assembler name, have one created for it. */
6220 assign_assembler_name_if_needed (tree t
)
6222 if (need_assembler_name_p (t
))
6224 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6225 diagnostics that use input_location to show locus
6226 information. The problem here is that, at this point,
6227 input_location is generally anchored to the end of the file
6228 (since the parser is long gone), so we don't have a good
6229 position to pin it to.
6231 To alleviate this problem, this uses the location of T's
6232 declaration. Examples of this are
6233 testsuite/g++.dg/template/cond2.C and
6234 testsuite/g++.dg/template/pr35240.C. */
6235 location_t saved_location
= input_location
;
6236 input_location
= DECL_SOURCE_LOCATION (t
);
6238 decl_assembler_name (t
);
6240 input_location
= saved_location
;
6245 /* Free language specific information for every operand and expression
6246 in every node of the call graph. This process operates in three stages:
6248 1- Every callgraph node and varpool node is traversed looking for
6249 decls and types embedded in them. This is a more exhaustive
6250 search than that done by find_referenced_vars, because it will
6251 also collect individual fields, decls embedded in types, etc.
6253 2- All the decls found are sent to free_lang_data_in_decl.
6255 3- All the types found are sent to free_lang_data_in_type.
6257 The ordering between decls and types is important because
6258 free_lang_data_in_decl sets assembler names, which includes
6259 mangling. So types cannot be freed up until assembler names have
6263 free_lang_data_in_cgraph (class free_lang_data_d
*fld
)
6265 struct cgraph_node
*n
;
6271 /* Find decls and types in the body of every function in the callgraph. */
6272 FOR_EACH_FUNCTION (n
)
6273 find_decls_types_in_node (n
, fld
);
6275 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6276 find_decls_types (p
->decl
, fld
);
6278 /* Find decls and types in every varpool symbol. */
6279 FOR_EACH_VARIABLE (v
)
6280 find_decls_types_in_var (v
, fld
);
6282 /* Set the assembler name on every decl found. We need to do this
6283 now because free_lang_data_in_decl will invalidate data needed
6284 for mangling. This breaks mangling on interdependent decls. */
6285 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6286 assign_assembler_name_if_needed (t
);
6288 /* Traverse every decl found freeing its language data. */
6289 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6290 free_lang_data_in_decl (t
, fld
);
6292 /* Traverse every type found freeing its language data. */
6293 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6294 free_lang_data_in_type (t
, fld
);
6298 /* Free resources that are used by FE but are not needed once they are done. */
6301 free_lang_data (void)
6304 class free_lang_data_d fld
;
6306 /* If we are the LTO frontend we have freed lang-specific data already. */
6308 || (!flag_generate_lto
&& !flag_generate_offload
))
6310 /* Rebuild type inheritance graph even when not doing LTO to get
6311 consistent profile data. */
6312 rebuild_type_inheritance_graph ();
6316 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6317 fld_simplified_types
= new hash_map
<tree
, tree
>;
6319 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6320 if (vec_safe_is_empty (all_translation_units
))
6321 build_translation_unit_decl (NULL_TREE
);
6323 /* Allocate and assign alias sets to the standard integer types
6324 while the slots are still in the way the frontends generated them. */
6325 for (i
= 0; i
< itk_none
; ++i
)
6326 if (integer_types
[i
])
6327 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6329 /* Traverse the IL resetting language specific information for
6330 operands, expressions, etc. */
6331 free_lang_data_in_cgraph (&fld
);
6333 /* Create gimple variants for common types. */
6334 for (unsigned i
= 0;
6335 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6337 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6339 /* Reset some langhooks. Do not reset types_compatible_p, it may
6340 still be used indirectly via the get_alias_set langhook. */
6341 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6342 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6343 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6344 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6345 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6346 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6347 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6348 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6350 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6357 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6361 /* We do not want the default decl_assembler_name implementation,
6362 rather if we have fixed everything we want a wrapper around it
6363 asserting that all non-local symbols already got their assembler
6364 name and only produce assembler names for local symbols. Or rather
6365 make sure we never call decl_assembler_name on local symbols and
6366 devise a separate, middle-end private scheme for it. */
6368 /* Reset diagnostic machinery. */
6369 tree_diagnostics_defaults (global_dc
);
6371 rebuild_type_inheritance_graph ();
6373 delete fld_incomplete_types
;
6374 delete fld_simplified_types
;
6382 const pass_data pass_data_ipa_free_lang_data
=
6384 SIMPLE_IPA_PASS
, /* type */
6385 "*free_lang_data", /* name */
6386 OPTGROUP_NONE
, /* optinfo_flags */
6387 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6388 0, /* properties_required */
6389 0, /* properties_provided */
6390 0, /* properties_destroyed */
6391 0, /* todo_flags_start */
6392 0, /* todo_flags_finish */
6395 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6398 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6399 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6402 /* opt_pass methods: */
6403 virtual unsigned int execute (function
*) { return free_lang_data (); }
6405 }; // class pass_ipa_free_lang_data
6409 simple_ipa_opt_pass
*
6410 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6412 return new pass_ipa_free_lang_data (ctxt
);
6415 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6416 of the various TYPE_QUAL values. */
6419 set_type_quals (tree type
, int type_quals
)
6421 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6422 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6423 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6424 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6425 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6428 /* Returns true iff CAND and BASE have equivalent language-specific
6432 check_lang_type (const_tree cand
, const_tree base
)
6434 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6436 /* type_hash_eq currently only applies to these types. */
6437 if (TREE_CODE (cand
) != FUNCTION_TYPE
6438 && TREE_CODE (cand
) != METHOD_TYPE
)
6440 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6443 /* This function checks to see if TYPE matches the size one of the built-in
6444 atomic types, and returns that core atomic type. */
6447 find_atomic_core_type (const_tree type
)
6449 tree base_atomic_type
;
6451 /* Only handle complete types. */
6452 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6455 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6458 base_atomic_type
= atomicQI_type_node
;
6462 base_atomic_type
= atomicHI_type_node
;
6466 base_atomic_type
= atomicSI_type_node
;
6470 base_atomic_type
= atomicDI_type_node
;
6474 base_atomic_type
= atomicTI_type_node
;
6478 base_atomic_type
= NULL_TREE
;
6481 return base_atomic_type
;
6484 /* Returns true iff unqualified CAND and BASE are equivalent. */
6487 check_base_type (const_tree cand
, const_tree base
)
6489 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6490 /* Apparently this is needed for Objective-C. */
6491 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6492 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6493 TYPE_ATTRIBUTES (base
)))
6495 /* Check alignment. */
6496 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6498 /* Atomic types increase minimal alignment. We must to do so as well
6499 or we get duplicated canonical types. See PR88686. */
6500 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6502 /* See if this object can map to a basic atomic type. */
6503 tree atomic_type
= find_atomic_core_type (cand
);
6504 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6510 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6513 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6515 return (TYPE_QUALS (cand
) == type_quals
6516 && check_base_type (cand
, base
)
6517 && check_lang_type (cand
, base
));
6520 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6523 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6525 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6526 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6527 /* Apparently this is needed for Objective-C. */
6528 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6529 /* Check alignment. */
6530 && TYPE_ALIGN (cand
) == align
6531 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6532 TYPE_ATTRIBUTES (base
))
6533 && check_lang_type (cand
, base
));
6536 /* Return a version of the TYPE, qualified as indicated by the
6537 TYPE_QUALS, if one exists. If no qualified version exists yet,
6538 return NULL_TREE. */
6541 get_qualified_type (tree type
, int type_quals
)
6543 if (TYPE_QUALS (type
) == type_quals
)
6546 tree mv
= TYPE_MAIN_VARIANT (type
);
6547 if (check_qualified_type (mv
, type
, type_quals
))
6550 /* Search the chain of variants to see if there is already one there just
6551 like the one we need to have. If so, use that existing one. We must
6552 preserve the TYPE_NAME, since there is code that depends on this. */
6553 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6554 if (check_qualified_type (*tp
, type
, type_quals
))
6556 /* Put the found variant at the head of the variant list so
6557 frequently searched variants get found faster. The C++ FE
6558 benefits greatly from this. */
6560 *tp
= TYPE_NEXT_VARIANT (t
);
6561 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6562 TYPE_NEXT_VARIANT (mv
) = t
;
6569 /* Like get_qualified_type, but creates the type if it does not
6570 exist. This function never returns NULL_TREE. */
6573 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6577 /* See if we already have the appropriate qualified variant. */
6578 t
= get_qualified_type (type
, type_quals
);
6580 /* If not, build it. */
6583 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6584 set_type_quals (t
, type_quals
);
6586 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6588 /* See if this object can map to a basic atomic type. */
6589 tree atomic_type
= find_atomic_core_type (type
);
6592 /* Ensure the alignment of this type is compatible with
6593 the required alignment of the atomic type. */
6594 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6595 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6599 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6600 /* Propagate structural equality. */
6601 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6602 else if (TYPE_CANONICAL (type
) != type
)
6603 /* Build the underlying canonical type, since it is different
6606 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6607 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6610 /* T is its own canonical type. */
6611 TYPE_CANONICAL (t
) = t
;
6618 /* Create a variant of type T with alignment ALIGN. */
6621 build_aligned_type (tree type
, unsigned int align
)
6625 if (TYPE_PACKED (type
)
6626 || TYPE_ALIGN (type
) == align
)
6629 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6630 if (check_aligned_type (t
, type
, align
))
6633 t
= build_variant_type_copy (type
);
6634 SET_TYPE_ALIGN (t
, align
);
6635 TYPE_USER_ALIGN (t
) = 1;
6640 /* Create a new distinct copy of TYPE. The new type is made its own
6641 MAIN_VARIANT. If TYPE requires structural equality checks, the
6642 resulting type requires structural equality checks; otherwise, its
6643 TYPE_CANONICAL points to itself. */
6646 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6648 tree t
= copy_node (type PASS_MEM_STAT
);
6650 TYPE_POINTER_TO (t
) = 0;
6651 TYPE_REFERENCE_TO (t
) = 0;
6653 /* Set the canonical type either to a new equivalence class, or
6654 propagate the need for structural equality checks. */
6655 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6656 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6658 TYPE_CANONICAL (t
) = t
;
6660 /* Make it its own variant. */
6661 TYPE_MAIN_VARIANT (t
) = t
;
6662 TYPE_NEXT_VARIANT (t
) = 0;
6664 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6665 whose TREE_TYPE is not t. This can also happen in the Ada
6666 frontend when using subtypes. */
6671 /* Create a new variant of TYPE, equivalent but distinct. This is so
6672 the caller can modify it. TYPE_CANONICAL for the return type will
6673 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6674 are considered equal by the language itself (or that both types
6675 require structural equality checks). */
6678 build_variant_type_copy (tree type MEM_STAT_DECL
)
6680 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6682 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6684 /* Since we're building a variant, assume that it is a non-semantic
6685 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6686 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6687 /* Type variants have no alias set defined. */
6688 TYPE_ALIAS_SET (t
) = -1;
6690 /* Add the new type to the chain of variants of TYPE. */
6691 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6692 TYPE_NEXT_VARIANT (m
) = t
;
6693 TYPE_MAIN_VARIANT (t
) = m
;
6698 /* Return true if the from tree in both tree maps are equal. */
6701 tree_map_base_eq (const void *va
, const void *vb
)
6703 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6704 *const b
= (const struct tree_map_base
*) vb
;
6705 return (a
->from
== b
->from
);
6708 /* Hash a from tree in a tree_base_map. */
6711 tree_map_base_hash (const void *item
)
6713 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6716 /* Return true if this tree map structure is marked for garbage collection
6717 purposes. We simply return true if the from tree is marked, so that this
6718 structure goes away when the from tree goes away. */
6721 tree_map_base_marked_p (const void *p
)
6723 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6726 /* Hash a from tree in a tree_map. */
6729 tree_map_hash (const void *item
)
6731 return (((const struct tree_map
*) item
)->hash
);
6734 /* Hash a from tree in a tree_decl_map. */
6737 tree_decl_map_hash (const void *item
)
6739 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6742 /* Return the initialization priority for DECL. */
6745 decl_init_priority_lookup (tree decl
)
6747 symtab_node
*snode
= symtab_node::get (decl
);
6750 return DEFAULT_INIT_PRIORITY
;
6752 snode
->get_init_priority ();
6755 /* Return the finalization priority for DECL. */
6758 decl_fini_priority_lookup (tree decl
)
6760 cgraph_node
*node
= cgraph_node::get (decl
);
6763 return DEFAULT_INIT_PRIORITY
;
6765 node
->get_fini_priority ();
6768 /* Set the initialization priority for DECL to PRIORITY. */
6771 decl_init_priority_insert (tree decl
, priority_type priority
)
6773 struct symtab_node
*snode
;
6775 if (priority
== DEFAULT_INIT_PRIORITY
)
6777 snode
= symtab_node::get (decl
);
6781 else if (VAR_P (decl
))
6782 snode
= varpool_node::get_create (decl
);
6784 snode
= cgraph_node::get_create (decl
);
6785 snode
->set_init_priority (priority
);
6788 /* Set the finalization priority for DECL to PRIORITY. */
6791 decl_fini_priority_insert (tree decl
, priority_type priority
)
6793 struct cgraph_node
*node
;
6795 if (priority
== DEFAULT_INIT_PRIORITY
)
6797 node
= cgraph_node::get (decl
);
6802 node
= cgraph_node::get_create (decl
);
6803 node
->set_fini_priority (priority
);
6806 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6809 print_debug_expr_statistics (void)
6811 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6812 (long) debug_expr_for_decl
->size (),
6813 (long) debug_expr_for_decl
->elements (),
6814 debug_expr_for_decl
->collisions ());
6817 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6820 print_value_expr_statistics (void)
6822 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6823 (long) value_expr_for_decl
->size (),
6824 (long) value_expr_for_decl
->elements (),
6825 value_expr_for_decl
->collisions ());
6828 /* Lookup a debug expression for FROM, and return it if we find one. */
6831 decl_debug_expr_lookup (tree from
)
6833 struct tree_decl_map
*h
, in
;
6834 in
.base
.from
= from
;
6836 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6842 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6845 decl_debug_expr_insert (tree from
, tree to
)
6847 struct tree_decl_map
*h
;
6849 h
= ggc_alloc
<tree_decl_map
> ();
6850 h
->base
.from
= from
;
6852 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6855 /* Lookup a value expression for FROM, and return it if we find one. */
6858 decl_value_expr_lookup (tree from
)
6860 struct tree_decl_map
*h
, in
;
6861 in
.base
.from
= from
;
6863 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6869 /* Insert a mapping FROM->TO in the value expression hashtable. */
6872 decl_value_expr_insert (tree from
, tree to
)
6874 struct tree_decl_map
*h
;
6876 h
= ggc_alloc
<tree_decl_map
> ();
6877 h
->base
.from
= from
;
6879 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6882 /* Lookup a vector of debug arguments for FROM, and return it if we
6886 decl_debug_args_lookup (tree from
)
6888 struct tree_vec_map
*h
, in
;
6890 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6892 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6893 in
.base
.from
= from
;
6894 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6900 /* Insert a mapping FROM->empty vector of debug arguments in the value
6901 expression hashtable. */
6904 decl_debug_args_insert (tree from
)
6906 struct tree_vec_map
*h
;
6909 if (DECL_HAS_DEBUG_ARGS_P (from
))
6910 return decl_debug_args_lookup (from
);
6911 if (debug_args_for_decl
== NULL
)
6912 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6913 h
= ggc_alloc
<tree_vec_map
> ();
6914 h
->base
.from
= from
;
6916 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6918 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6922 /* Hashing of types so that we don't make duplicates.
6923 The entry point is `type_hash_canon'. */
6925 /* Generate the default hash code for TYPE. This is designed for
6926 speed, rather than maximum entropy. */
6929 type_hash_canon_hash (tree type
)
6931 inchash::hash hstate
;
6933 hstate
.add_int (TREE_CODE (type
));
6935 if (TREE_TYPE (type
))
6936 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6938 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6939 /* Just the identifier is adequate to distinguish. */
6940 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6942 switch (TREE_CODE (type
))
6945 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6948 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6949 if (TREE_VALUE (t
) != error_mark_node
)
6950 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6954 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6959 if (TYPE_DOMAIN (type
))
6960 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6961 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6963 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6964 hstate
.add_object (typeless
);
6971 tree t
= TYPE_MAX_VALUE (type
);
6973 t
= TYPE_MIN_VALUE (type
);
6974 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6975 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6980 case FIXED_POINT_TYPE
:
6982 unsigned prec
= TYPE_PRECISION (type
);
6983 hstate
.add_object (prec
);
6988 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6995 return hstate
.end ();
6998 /* These are the Hashtable callback functions. */
7000 /* Returns true iff the types are equivalent. */
7003 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
7005 /* First test the things that are the same for all types. */
7006 if (a
->hash
!= b
->hash
7007 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
7008 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
7009 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
7010 TYPE_ATTRIBUTES (b
->type
))
7011 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
7012 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7015 /* Be careful about comparing arrays before and after the element type
7016 has been completed; don't compare TYPE_ALIGN unless both types are
7018 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7019 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7020 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7023 switch (TREE_CODE (a
->type
))
7028 case REFERENCE_TYPE
:
7033 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
7034 TYPE_VECTOR_SUBPARTS (b
->type
));
7037 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7038 && !(TYPE_VALUES (a
->type
)
7039 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7040 && TYPE_VALUES (b
->type
)
7041 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7042 && type_list_equal (TYPE_VALUES (a
->type
),
7043 TYPE_VALUES (b
->type
))))
7051 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7053 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7054 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7055 TYPE_MAX_VALUE (b
->type
)))
7056 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7057 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7058 TYPE_MIN_VALUE (b
->type
))));
7060 case FIXED_POINT_TYPE
:
7061 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7064 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7067 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7068 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7069 || (TYPE_ARG_TYPES (a
->type
)
7070 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7071 && TYPE_ARG_TYPES (b
->type
)
7072 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7073 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7074 TYPE_ARG_TYPES (b
->type
)))))
7078 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7079 where the flag should be inherited from the element type
7080 and can change after ARRAY_TYPEs are created; on non-aggregates
7081 compare it and hash it, scalars will never have that flag set
7082 and we need to differentiate between arrays created by different
7083 front-ends or middle-end created arrays. */
7084 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7085 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7086 || (TYPE_TYPELESS_STORAGE (a
->type
)
7087 == TYPE_TYPELESS_STORAGE (b
->type
))));
7091 case QUAL_UNION_TYPE
:
7092 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7093 || (TYPE_FIELDS (a
->type
)
7094 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7095 && TYPE_FIELDS (b
->type
)
7096 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7097 && type_list_equal (TYPE_FIELDS (a
->type
),
7098 TYPE_FIELDS (b
->type
))));
7101 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7102 || (TYPE_ARG_TYPES (a
->type
)
7103 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7104 && TYPE_ARG_TYPES (b
->type
)
7105 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7106 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7107 TYPE_ARG_TYPES (b
->type
))))
7115 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7116 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7121 /* Given TYPE, and HASHCODE its hash code, return the canonical
7122 object for an identical type if one already exists.
7123 Otherwise, return TYPE, and record it as the canonical object.
7125 To use this function, first create a type of the sort you want.
7126 Then compute its hash code from the fields of the type that
7127 make it different from other similar types.
7128 Then call this function and use the value. */
7131 type_hash_canon (unsigned int hashcode
, tree type
)
7136 /* The hash table only contains main variants, so ensure that's what we're
7138 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7140 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7141 must call that routine before comparing TYPE_ALIGNs. */
7147 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7150 tree t1
= ((type_hash
*) *loc
)->type
;
7151 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7153 if (TYPE_UID (type
) + 1 == next_type_uid
)
7155 /* Free also min/max values and the cache for integer
7156 types. This can't be done in free_node, as LTO frees
7157 those on its own. */
7158 if (TREE_CODE (type
) == INTEGER_TYPE
)
7160 if (TYPE_MIN_VALUE (type
)
7161 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7163 /* Zero is always in TYPE_CACHED_VALUES. */
7164 if (! TYPE_UNSIGNED (type
))
7165 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7166 ggc_free (TYPE_MIN_VALUE (type
));
7168 if (TYPE_MAX_VALUE (type
)
7169 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7171 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7172 ggc_free (TYPE_MAX_VALUE (type
));
7174 if (TYPE_CACHED_VALUES_P (type
))
7175 ggc_free (TYPE_CACHED_VALUES (type
));
7182 struct type_hash
*h
;
7184 h
= ggc_alloc
<type_hash
> ();
7194 print_type_hash_statistics (void)
7196 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7197 (long) type_hash_table
->size (),
7198 (long) type_hash_table
->elements (),
7199 type_hash_table
->collisions ());
7202 /* Given two lists of types
7203 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7204 return 1 if the lists contain the same types in the same order.
7205 Also, the TREE_PURPOSEs must match. */
7208 type_list_equal (const_tree l1
, const_tree l2
)
7212 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7213 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7214 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7215 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7216 && (TREE_TYPE (TREE_PURPOSE (t1
))
7217 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7223 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7224 given by TYPE. If the argument list accepts variable arguments,
7225 then this function counts only the ordinary arguments. */
7228 type_num_arguments (const_tree fntype
)
7232 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7233 /* If the function does not take a variable number of arguments,
7234 the last element in the list will have type `void'. */
7235 if (VOID_TYPE_P (TREE_VALUE (t
)))
7243 /* Return the type of the function TYPE's argument ARGNO if known.
7244 For vararg function's where ARGNO refers to one of the variadic
7245 arguments return null. Otherwise, return a void_type_node for
7246 out-of-bounds ARGNO. */
7249 type_argument_type (const_tree fntype
, unsigned argno
)
7251 /* Treat zero the same as an out-of-bounds argument number. */
7253 return void_type_node
;
7255 function_args_iterator iter
;
7259 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7261 /* A vararg function's argument list ends in a null. Otherwise,
7262 an ordinary function's argument list ends with void. Return
7263 null if ARGNO refers to a vararg argument, void_type_node if
7264 it's out of bounds, and the formal argument type otherwise. */
7268 if (i
== argno
|| VOID_TYPE_P (argtype
))
7277 /* Nonzero if integer constants T1 and T2
7278 represent the same constant value. */
7281 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7286 if (t1
== 0 || t2
== 0)
7289 STRIP_ANY_LOCATION_WRAPPER (t1
);
7290 STRIP_ANY_LOCATION_WRAPPER (t2
);
7292 if (TREE_CODE (t1
) == INTEGER_CST
7293 && TREE_CODE (t2
) == INTEGER_CST
7294 && wi::to_widest (t1
) == wi::to_widest (t2
))
7300 /* Return true if T is an INTEGER_CST whose numerical value (extended
7301 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7304 tree_fits_shwi_p (const_tree t
)
7306 return (t
!= NULL_TREE
7307 && TREE_CODE (t
) == INTEGER_CST
7308 && wi::fits_shwi_p (wi::to_widest (t
)));
7311 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7312 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7315 tree_fits_poly_int64_p (const_tree t
)
7319 if (POLY_INT_CST_P (t
))
7321 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7322 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7326 return (TREE_CODE (t
) == INTEGER_CST
7327 && wi::fits_shwi_p (wi::to_widest (t
)));
7330 /* Return true if T is an INTEGER_CST whose numerical value (extended
7331 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7334 tree_fits_uhwi_p (const_tree t
)
7336 return (t
!= NULL_TREE
7337 && TREE_CODE (t
) == INTEGER_CST
7338 && wi::fits_uhwi_p (wi::to_widest (t
)));
7341 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7342 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7345 tree_fits_poly_uint64_p (const_tree t
)
7349 if (POLY_INT_CST_P (t
))
7351 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7352 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7356 return (TREE_CODE (t
) == INTEGER_CST
7357 && wi::fits_uhwi_p (wi::to_widest (t
)));
7360 /* T is an INTEGER_CST whose numerical value (extended according to
7361 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7365 tree_to_shwi (const_tree t
)
7367 gcc_assert (tree_fits_shwi_p (t
));
7368 return TREE_INT_CST_LOW (t
);
7371 /* T is an INTEGER_CST whose numerical value (extended according to
7372 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7375 unsigned HOST_WIDE_INT
7376 tree_to_uhwi (const_tree t
)
7378 gcc_assert (tree_fits_uhwi_p (t
));
7379 return TREE_INT_CST_LOW (t
);
7382 /* Return the most significant (sign) bit of T. */
7385 tree_int_cst_sign_bit (const_tree t
)
7387 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7389 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7392 /* Return an indication of the sign of the integer constant T.
7393 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7394 Note that -1 will never be returned if T's type is unsigned. */
7397 tree_int_cst_sgn (const_tree t
)
7399 if (wi::to_wide (t
) == 0)
7401 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7403 else if (wi::neg_p (wi::to_wide (t
)))
7409 /* Return the minimum number of bits needed to represent VALUE in a
7410 signed or unsigned type, UNSIGNEDP says which. */
7413 tree_int_cst_min_precision (tree value
, signop sgn
)
7415 /* If the value is negative, compute its negative minus 1. The latter
7416 adjustment is because the absolute value of the largest negative value
7417 is one larger than the largest positive value. This is equivalent to
7418 a bit-wise negation, so use that operation instead. */
7420 if (tree_int_cst_sgn (value
) < 0)
7421 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7423 /* Return the number of bits needed, taking into account the fact
7424 that we need one more bit for a signed than unsigned type.
7425 If value is 0 or -1, the minimum precision is 1 no matter
7426 whether unsignedp is true or false. */
7428 if (integer_zerop (value
))
7431 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7434 /* Return truthvalue of whether T1 is the same tree structure as T2.
7435 Return 1 if they are the same.
7436 Return 0 if they are understandably different.
7437 Return -1 if either contains tree structure not understood by
7441 simple_cst_equal (const_tree t1
, const_tree t2
)
7443 enum tree_code code1
, code2
;
7449 if (t1
== 0 || t2
== 0)
7452 /* For location wrappers to be the same, they must be at the same
7453 source location (and wrap the same thing). */
7454 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7456 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7458 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7461 code1
= TREE_CODE (t1
);
7462 code2
= TREE_CODE (t2
);
7464 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7466 if (CONVERT_EXPR_CODE_P (code2
)
7467 || code2
== NON_LVALUE_EXPR
)
7468 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7470 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7473 else if (CONVERT_EXPR_CODE_P (code2
)
7474 || code2
== NON_LVALUE_EXPR
)
7475 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7483 return wi::to_widest (t1
) == wi::to_widest (t2
);
7486 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7489 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7492 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7493 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7494 TREE_STRING_LENGTH (t1
)));
7498 unsigned HOST_WIDE_INT idx
;
7499 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7500 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7502 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7505 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7506 /* ??? Should we handle also fields here? */
7507 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7513 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7516 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7519 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7522 const_tree arg1
, arg2
;
7523 const_call_expr_arg_iterator iter1
, iter2
;
7524 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7525 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7527 arg1
= next_const_call_expr_arg (&iter1
),
7528 arg2
= next_const_call_expr_arg (&iter2
))
7530 cmp
= simple_cst_equal (arg1
, arg2
);
7534 return arg1
== arg2
;
7538 /* Special case: if either target is an unallocated VAR_DECL,
7539 it means that it's going to be unified with whatever the
7540 TARGET_EXPR is really supposed to initialize, so treat it
7541 as being equivalent to anything. */
7542 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7543 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7544 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7545 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7546 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7547 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7550 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7555 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7557 case WITH_CLEANUP_EXPR
:
7558 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7562 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7565 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7566 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7577 if (POLY_INT_CST_P (t1
))
7578 /* A false return means maybe_ne rather than known_ne. */
7579 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7580 TYPE_SIGN (TREE_TYPE (t1
))),
7581 poly_widest_int::from (poly_int_cst_value (t2
),
7582 TYPE_SIGN (TREE_TYPE (t2
))));
7586 /* This general rule works for most tree codes. All exceptions should be
7587 handled above. If this is a language-specific tree code, we can't
7588 trust what might be in the operand, so say we don't know
7590 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7593 switch (TREE_CODE_CLASS (code1
))
7597 case tcc_comparison
:
7598 case tcc_expression
:
7602 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7604 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7616 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7617 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7618 than U, respectively. */
7621 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7623 if (tree_int_cst_sgn (t
) < 0)
7625 else if (!tree_fits_uhwi_p (t
))
7627 else if (TREE_INT_CST_LOW (t
) == u
)
7629 else if (TREE_INT_CST_LOW (t
) < u
)
7635 /* Return true if SIZE represents a constant size that is in bounds of
7636 what the middle-end and the backend accepts (covering not more than
7637 half of the address-space).
7638 When PERR is non-null, set *PERR on failure to the description of
7639 why SIZE is not valid. */
7642 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7644 if (POLY_INT_CST_P (size
))
7646 if (TREE_OVERFLOW (size
))
7648 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7649 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7654 cst_size_error error
;
7658 if (TREE_CODE (size
) != INTEGER_CST
)
7660 *perr
= cst_size_not_constant
;
7664 if (TREE_OVERFLOW_P (size
))
7666 *perr
= cst_size_overflow
;
7670 if (tree_int_cst_sgn (size
) < 0)
7672 *perr
= cst_size_negative
;
7675 if (!tree_fits_uhwi_p (size
)
7676 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7677 < wi::to_widest (size
) * 2))
7679 *perr
= cst_size_too_big
;
7686 /* Return the precision of the type, or for a complex or vector type the
7687 precision of the type of its elements. */
7690 element_precision (const_tree type
)
7693 type
= TREE_TYPE (type
);
7694 enum tree_code code
= TREE_CODE (type
);
7695 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7696 type
= TREE_TYPE (type
);
7698 return TYPE_PRECISION (type
);
7701 /* Return true if CODE represents an associative tree code. Otherwise
7704 associative_tree_code (enum tree_code code
)
7723 /* Return true if CODE represents a commutative tree code. Otherwise
7726 commutative_tree_code (enum tree_code code
)
7732 case MULT_HIGHPART_EXPR
:
7740 case UNORDERED_EXPR
:
7744 case TRUTH_AND_EXPR
:
7745 case TRUTH_XOR_EXPR
:
7747 case WIDEN_MULT_EXPR
:
7748 case VEC_WIDEN_MULT_HI_EXPR
:
7749 case VEC_WIDEN_MULT_LO_EXPR
:
7750 case VEC_WIDEN_MULT_EVEN_EXPR
:
7751 case VEC_WIDEN_MULT_ODD_EXPR
:
7760 /* Return true if CODE represents a ternary tree code for which the
7761 first two operands are commutative. Otherwise return false. */
7763 commutative_ternary_tree_code (enum tree_code code
)
7767 case WIDEN_MULT_PLUS_EXPR
:
7768 case WIDEN_MULT_MINUS_EXPR
:
7778 /* Returns true if CODE can overflow. */
7781 operation_can_overflow (enum tree_code code
)
7789 /* Can overflow in various ways. */
7791 case TRUNC_DIV_EXPR
:
7792 case EXACT_DIV_EXPR
:
7793 case FLOOR_DIV_EXPR
:
7795 /* For INT_MIN / -1. */
7802 /* These operators cannot overflow. */
7807 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7808 ftrapv doesn't generate trapping insns for CODE. */
7811 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7813 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7815 /* We don't generate instructions that trap on overflow for complex or vector
7817 if (!INTEGRAL_TYPE_P (type
))
7820 if (!TYPE_OVERFLOW_TRAPS (type
))
7830 /* These operators can overflow, and -ftrapv generates trapping code for
7833 case TRUNC_DIV_EXPR
:
7834 case EXACT_DIV_EXPR
:
7835 case FLOOR_DIV_EXPR
:
7838 /* These operators can overflow, but -ftrapv does not generate trapping
7842 /* These operators cannot overflow. */
7847 /* Constructors for pointer, array and function types.
7848 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7849 constructed by language-dependent code, not here.) */
7851 /* Construct, lay out and return the type of pointers to TO_TYPE with
7852 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7853 reference all of memory. If such a type has already been
7854 constructed, reuse it. */
7857 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7861 bool could_alias
= can_alias_all
;
7863 if (to_type
== error_mark_node
)
7864 return error_mark_node
;
7866 /* If the pointed-to type has the may_alias attribute set, force
7867 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7868 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7869 can_alias_all
= true;
7871 /* In some cases, languages will have things that aren't a POINTER_TYPE
7872 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7873 In that case, return that type without regard to the rest of our
7876 ??? This is a kludge, but consistent with the way this function has
7877 always operated and there doesn't seem to be a good way to avoid this
7879 if (TYPE_POINTER_TO (to_type
) != 0
7880 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7881 return TYPE_POINTER_TO (to_type
);
7883 /* First, if we already have a type for pointers to TO_TYPE and it's
7884 the proper mode, use it. */
7885 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7886 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7889 t
= make_node (POINTER_TYPE
);
7891 TREE_TYPE (t
) = to_type
;
7892 SET_TYPE_MODE (t
, mode
);
7893 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7894 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7895 TYPE_POINTER_TO (to_type
) = t
;
7897 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7898 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7899 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7900 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7902 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7905 /* Lay out the type. This function has many callers that are concerned
7906 with expression-construction, and this simplifies them all. */
7912 /* By default build pointers in ptr_mode. */
7915 build_pointer_type (tree to_type
)
7917 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7918 : TYPE_ADDR_SPACE (to_type
);
7919 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7920 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7923 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7926 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7930 bool could_alias
= can_alias_all
;
7932 if (to_type
== error_mark_node
)
7933 return error_mark_node
;
7935 /* If the pointed-to type has the may_alias attribute set, force
7936 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7937 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7938 can_alias_all
= true;
7940 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7941 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7942 In that case, return that type without regard to the rest of our
7945 ??? This is a kludge, but consistent with the way this function has
7946 always operated and there doesn't seem to be a good way to avoid this
7948 if (TYPE_REFERENCE_TO (to_type
) != 0
7949 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7950 return TYPE_REFERENCE_TO (to_type
);
7952 /* First, if we already have a type for pointers to TO_TYPE and it's
7953 the proper mode, use it. */
7954 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7955 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7958 t
= make_node (REFERENCE_TYPE
);
7960 TREE_TYPE (t
) = to_type
;
7961 SET_TYPE_MODE (t
, mode
);
7962 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7963 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7964 TYPE_REFERENCE_TO (to_type
) = t
;
7966 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7967 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7968 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7969 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7971 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7980 /* Build the node for the type of references-to-TO_TYPE by default
7984 build_reference_type (tree to_type
)
7986 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7987 : TYPE_ADDR_SPACE (to_type
);
7988 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7989 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7992 #define MAX_INT_CACHED_PREC \
7993 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7994 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7996 /* Builds a signed or unsigned integer type of precision PRECISION.
7997 Used for C bitfields whose precision does not match that of
7998 built-in target types. */
8000 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8006 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8008 if (precision
<= MAX_INT_CACHED_PREC
)
8010 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8015 itype
= make_node (INTEGER_TYPE
);
8016 TYPE_PRECISION (itype
) = precision
;
8019 fixup_unsigned_type (itype
);
8021 fixup_signed_type (itype
);
8023 inchash::hash hstate
;
8024 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8025 ret
= type_hash_canon (hstate
.end (), itype
);
8026 if (precision
<= MAX_INT_CACHED_PREC
)
8027 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8032 #define MAX_BOOL_CACHED_PREC \
8033 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8034 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8036 /* Builds a boolean type of precision PRECISION.
8037 Used for boolean vectors to choose proper vector element size. */
8039 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8043 if (precision
<= MAX_BOOL_CACHED_PREC
)
8045 type
= nonstandard_boolean_type_cache
[precision
];
8050 type
= make_node (BOOLEAN_TYPE
);
8051 TYPE_PRECISION (type
) = precision
;
8052 fixup_signed_type (type
);
8054 if (precision
<= MAX_INT_CACHED_PREC
)
8055 nonstandard_boolean_type_cache
[precision
] = type
;
8060 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8061 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8062 is true, reuse such a type that has already been constructed. */
8065 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8067 tree itype
= make_node (INTEGER_TYPE
);
8069 TREE_TYPE (itype
) = type
;
8071 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8072 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8074 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8075 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8076 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8077 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8078 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8079 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8080 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8085 if ((TYPE_MIN_VALUE (itype
)
8086 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8087 || (TYPE_MAX_VALUE (itype
)
8088 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8090 /* Since we cannot reliably merge this type, we need to compare it using
8091 structural equality checks. */
8092 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8096 hashval_t hash
= type_hash_canon_hash (itype
);
8097 itype
= type_hash_canon (hash
, itype
);
8102 /* Wrapper around build_range_type_1 with SHARED set to true. */
8105 build_range_type (tree type
, tree lowval
, tree highval
)
8107 return build_range_type_1 (type
, lowval
, highval
, true);
8110 /* Wrapper around build_range_type_1 with SHARED set to false. */
8113 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8115 return build_range_type_1 (type
, lowval
, highval
, false);
8118 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8119 MAXVAL should be the maximum value in the domain
8120 (one less than the length of the array).
8122 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8123 We don't enforce this limit, that is up to caller (e.g. language front end).
8124 The limit exists because the result is a signed type and we don't handle
8125 sizes that use more than one HOST_WIDE_INT. */
8128 build_index_type (tree maxval
)
8130 return build_range_type (sizetype
, size_zero_node
, maxval
);
8133 /* Return true if the debug information for TYPE, a subtype, should be emitted
8134 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8135 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8136 debug info and doesn't reflect the source code. */
8139 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8141 tree base_type
= TREE_TYPE (type
), low
, high
;
8143 /* Subrange types have a base type which is an integral type. */
8144 if (!INTEGRAL_TYPE_P (base_type
))
8147 /* Get the real bounds of the subtype. */
8148 if (lang_hooks
.types
.get_subrange_bounds
)
8149 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8152 low
= TYPE_MIN_VALUE (type
);
8153 high
= TYPE_MAX_VALUE (type
);
8156 /* If the type and its base type have the same representation and the same
8157 name, then the type is not a subrange but a copy of the base type. */
8158 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8159 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8160 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8161 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8162 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8163 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8173 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8174 and number of elements specified by the range of values of INDEX_TYPE.
8175 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8176 If SHARED is true, reuse such a type that has already been constructed.
8177 If SET_CANONICAL is true, compute TYPE_CANONICAL from the element type. */
8180 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8181 bool shared
, bool set_canonical
)
8185 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8187 error ("arrays of functions are not meaningful");
8188 elt_type
= integer_type_node
;
8191 t
= make_node (ARRAY_TYPE
);
8192 TREE_TYPE (t
) = elt_type
;
8193 TYPE_DOMAIN (t
) = index_type
;
8194 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8195 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8200 hashval_t hash
= type_hash_canon_hash (t
);
8201 t
= type_hash_canon (hash
, t
);
8204 if (TYPE_CANONICAL (t
) == t
&& set_canonical
)
8206 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8207 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8209 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8210 else if (TYPE_CANONICAL (elt_type
) != elt_type
8211 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8213 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8215 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8216 typeless_storage
, shared
, set_canonical
);
8222 /* Wrapper around build_array_type_1 with SHARED set to true. */
8225 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8228 build_array_type_1 (elt_type
, index_type
, typeless_storage
, true, true);
8231 /* Wrapper around build_array_type_1 with SHARED set to false. */
8234 build_nonshared_array_type (tree elt_type
, tree index_type
)
8236 return build_array_type_1 (elt_type
, index_type
, false, false, true);
8239 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8243 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8245 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8248 /* Recursively examines the array elements of TYPE, until a non-array
8249 element type is found. */
8252 strip_array_types (tree type
)
8254 while (TREE_CODE (type
) == ARRAY_TYPE
)
8255 type
= TREE_TYPE (type
);
8260 /* Computes the canonical argument types from the argument type list
8263 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8264 on entry to this function, or if any of the ARGTYPES are
8267 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8268 true on entry to this function, or if any of the ARGTYPES are
8271 Returns a canonical argument list, which may be ARGTYPES when the
8272 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8273 true) or would not differ from ARGTYPES. */
8276 maybe_canonicalize_argtypes (tree argtypes
,
8277 bool *any_structural_p
,
8278 bool *any_noncanonical_p
)
8281 bool any_noncanonical_argtypes_p
= false;
8283 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8285 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8286 /* Fail gracefully by stating that the type is structural. */
8287 *any_structural_p
= true;
8288 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8289 *any_structural_p
= true;
8290 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8291 || TREE_PURPOSE (arg
))
8292 /* If the argument has a default argument, we consider it
8293 non-canonical even though the type itself is canonical.
8294 That way, different variants of function and method types
8295 with default arguments will all point to the variant with
8296 no defaults as their canonical type. */
8297 any_noncanonical_argtypes_p
= true;
8300 if (*any_structural_p
)
8303 if (any_noncanonical_argtypes_p
)
8305 /* Build the canonical list of argument types. */
8306 tree canon_argtypes
= NULL_TREE
;
8307 bool is_void
= false;
8309 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8311 if (arg
== void_list_node
)
8314 canon_argtypes
= tree_cons (NULL_TREE
,
8315 TYPE_CANONICAL (TREE_VALUE (arg
)),
8319 canon_argtypes
= nreverse (canon_argtypes
);
8321 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8323 /* There is a non-canonical type. */
8324 *any_noncanonical_p
= true;
8325 return canon_argtypes
;
8328 /* The canonical argument types are the same as ARGTYPES. */
8332 /* Construct, lay out and return
8333 the type of functions returning type VALUE_TYPE
8334 given arguments of types ARG_TYPES.
8335 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8336 are data type nodes for the arguments of the function.
8337 If such a type has already been constructed, reuse it. */
8340 build_function_type (tree value_type
, tree arg_types
)
8343 inchash::hash hstate
;
8344 bool any_structural_p
, any_noncanonical_p
;
8345 tree canon_argtypes
;
8347 gcc_assert (arg_types
!= error_mark_node
);
8349 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8351 error ("function return type cannot be function");
8352 value_type
= integer_type_node
;
8355 /* Make a node of the sort we want. */
8356 t
= make_node (FUNCTION_TYPE
);
8357 TREE_TYPE (t
) = value_type
;
8358 TYPE_ARG_TYPES (t
) = arg_types
;
8360 /* If we already have such a type, use the old one. */
8361 hashval_t hash
= type_hash_canon_hash (t
);
8362 t
= type_hash_canon (hash
, t
);
8364 /* Set up the canonical type. */
8365 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8366 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8367 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8369 &any_noncanonical_p
);
8370 if (any_structural_p
)
8371 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8372 else if (any_noncanonical_p
)
8373 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8376 if (!COMPLETE_TYPE_P (t
))
8381 /* Build a function type. The RETURN_TYPE is the type returned by the
8382 function. If VAARGS is set, no void_type_node is appended to the
8383 list. ARGP must be always be terminated be a NULL_TREE. */
8386 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8390 t
= va_arg (argp
, tree
);
8391 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8392 args
= tree_cons (NULL_TREE
, t
, args
);
8397 if (args
!= NULL_TREE
)
8398 args
= nreverse (args
);
8399 gcc_assert (last
!= void_list_node
);
8401 else if (args
== NULL_TREE
)
8402 args
= void_list_node
;
8406 args
= nreverse (args
);
8407 TREE_CHAIN (last
) = void_list_node
;
8409 args
= build_function_type (return_type
, args
);
8414 /* Build a function type. The RETURN_TYPE is the type returned by the
8415 function. If additional arguments are provided, they are
8416 additional argument types. The list of argument types must always
8417 be terminated by NULL_TREE. */
8420 build_function_type_list (tree return_type
, ...)
8425 va_start (p
, return_type
);
8426 args
= build_function_type_list_1 (false, return_type
, p
);
8431 /* Build a variable argument function type. The RETURN_TYPE is the
8432 type returned by the function. If additional arguments are provided,
8433 they are additional argument types. The list of argument types must
8434 always be terminated by NULL_TREE. */
8437 build_varargs_function_type_list (tree return_type
, ...)
8442 va_start (p
, return_type
);
8443 args
= build_function_type_list_1 (true, return_type
, p
);
8449 /* Build a function type. RETURN_TYPE is the type returned by the
8450 function; VAARGS indicates whether the function takes varargs. The
8451 function takes N named arguments, the types of which are provided in
8455 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8459 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8461 for (i
= n
- 1; i
>= 0; i
--)
8462 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8464 return build_function_type (return_type
, t
);
8467 /* Build a function type. RETURN_TYPE is the type returned by the
8468 function. The function takes N named arguments, the types of which
8469 are provided in ARG_TYPES. */
8472 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8474 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8477 /* Build a variable argument function type. RETURN_TYPE is the type
8478 returned by the function. The function takes N named arguments, the
8479 types of which are provided in ARG_TYPES. */
8482 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8484 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8487 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8488 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8489 for the method. An implicit additional parameter (of type
8490 pointer-to-BASETYPE) is added to the ARGTYPES. */
8493 build_method_type_directly (tree basetype
,
8499 bool any_structural_p
, any_noncanonical_p
;
8500 tree canon_argtypes
;
8502 /* Make a node of the sort we want. */
8503 t
= make_node (METHOD_TYPE
);
8505 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8506 TREE_TYPE (t
) = rettype
;
8507 ptype
= build_pointer_type (basetype
);
8509 /* The actual arglist for this function includes a "hidden" argument
8510 which is "this". Put it into the list of argument types. */
8511 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8512 TYPE_ARG_TYPES (t
) = argtypes
;
8514 /* If we already have such a type, use the old one. */
8515 hashval_t hash
= type_hash_canon_hash (t
);
8516 t
= type_hash_canon (hash
, t
);
8518 /* Set up the canonical type. */
8520 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8521 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8523 = (TYPE_CANONICAL (basetype
) != basetype
8524 || TYPE_CANONICAL (rettype
) != rettype
);
8525 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8527 &any_noncanonical_p
);
8528 if (any_structural_p
)
8529 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8530 else if (any_noncanonical_p
)
8532 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8533 TYPE_CANONICAL (rettype
),
8535 if (!COMPLETE_TYPE_P (t
))
8541 /* Construct, lay out and return the type of methods belonging to class
8542 BASETYPE and whose arguments and values are described by TYPE.
8543 If that type exists already, reuse it.
8544 TYPE must be a FUNCTION_TYPE node. */
8547 build_method_type (tree basetype
, tree type
)
8549 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8551 return build_method_type_directly (basetype
,
8553 TYPE_ARG_TYPES (type
));
8556 /* Construct, lay out and return the type of offsets to a value
8557 of type TYPE, within an object of type BASETYPE.
8558 If a suitable offset type exists already, reuse it. */
8561 build_offset_type (tree basetype
, tree type
)
8565 /* Make a node of the sort we want. */
8566 t
= make_node (OFFSET_TYPE
);
8568 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8569 TREE_TYPE (t
) = type
;
8571 /* If we already have such a type, use the old one. */
8572 hashval_t hash
= type_hash_canon_hash (t
);
8573 t
= type_hash_canon (hash
, t
);
8575 if (!COMPLETE_TYPE_P (t
))
8578 if (TYPE_CANONICAL (t
) == t
)
8580 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8581 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8582 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8583 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8584 || TYPE_CANONICAL (type
) != type
)
8586 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8587 TYPE_CANONICAL (type
));
8593 /* Create a complex type whose components are COMPONENT_TYPE.
8595 If NAMED is true, the type is given a TYPE_NAME. We do not always
8596 do so because this creates a DECL node and thus make the DECL_UIDs
8597 dependent on the type canonicalization hashtable, which is GC-ed,
8598 so the DECL_UIDs would not be stable wrt garbage collection. */
8601 build_complex_type (tree component_type
, bool named
)
8603 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8604 || SCALAR_FLOAT_TYPE_P (component_type
)
8605 || FIXED_POINT_TYPE_P (component_type
));
8607 /* Make a node of the sort we want. */
8608 tree probe
= make_node (COMPLEX_TYPE
);
8610 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8612 /* If we already have such a type, use the old one. */
8613 hashval_t hash
= type_hash_canon_hash (probe
);
8614 tree t
= type_hash_canon (hash
, probe
);
8618 /* We created a new type. The hash insertion will have laid
8619 out the type. We need to check the canonicalization and
8620 maybe set the name. */
8621 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8623 && TYPE_CANONICAL (t
) == t
);
8625 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8626 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8627 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8629 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8631 /* We need to create a name, since complex is a fundamental type. */
8634 const char *name
= NULL
;
8636 if (TREE_TYPE (t
) == char_type_node
)
8637 name
= "complex char";
8638 else if (TREE_TYPE (t
) == signed_char_type_node
)
8639 name
= "complex signed char";
8640 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8641 name
= "complex unsigned char";
8642 else if (TREE_TYPE (t
) == short_integer_type_node
)
8643 name
= "complex short int";
8644 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8645 name
= "complex short unsigned int";
8646 else if (TREE_TYPE (t
) == integer_type_node
)
8647 name
= "complex int";
8648 else if (TREE_TYPE (t
) == unsigned_type_node
)
8649 name
= "complex unsigned int";
8650 else if (TREE_TYPE (t
) == long_integer_type_node
)
8651 name
= "complex long int";
8652 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8653 name
= "complex long unsigned int";
8654 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8655 name
= "complex long long int";
8656 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8657 name
= "complex long long unsigned int";
8660 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8661 get_identifier (name
), t
);
8665 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8668 /* If TYPE is a real or complex floating-point type and the target
8669 does not directly support arithmetic on TYPE then return the wider
8670 type to be used for arithmetic on TYPE. Otherwise, return
8674 excess_precision_type (tree type
)
8676 /* The target can give two different responses to the question of
8677 which excess precision mode it would like depending on whether we
8678 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8680 enum excess_precision_type requested_type
8681 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8682 ? EXCESS_PRECISION_TYPE_FAST
8683 : EXCESS_PRECISION_TYPE_STANDARD
);
8685 enum flt_eval_method target_flt_eval_method
8686 = targetm
.c
.excess_precision (requested_type
);
8688 /* The target should not ask for unpredictable float evaluation (though
8689 it might advertise that implicitly the evaluation is unpredictable,
8690 but we don't care about that here, it will have been reported
8691 elsewhere). If it does ask for unpredictable evaluation, we have
8692 nothing to do here. */
8693 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8695 /* Nothing to do. The target has asked for all types we know about
8696 to be computed with their native precision and range. */
8697 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8700 /* The target will promote this type in a target-dependent way, so excess
8701 precision ought to leave it alone. */
8702 if (targetm
.promoted_type (type
) != NULL_TREE
)
8705 machine_mode float16_type_mode
= (float16_type_node
8706 ? TYPE_MODE (float16_type_node
)
8708 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8709 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8711 switch (TREE_CODE (type
))
8715 machine_mode type_mode
= TYPE_MODE (type
);
8716 switch (target_flt_eval_method
)
8718 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8719 if (type_mode
== float16_type_mode
)
8720 return float_type_node
;
8722 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8723 if (type_mode
== float16_type_mode
8724 || type_mode
== float_type_mode
)
8725 return double_type_node
;
8727 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8728 if (type_mode
== float16_type_mode
8729 || type_mode
== float_type_mode
8730 || type_mode
== double_type_mode
)
8731 return long_double_type_node
;
8740 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8742 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8743 switch (target_flt_eval_method
)
8745 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8746 if (type_mode
== float16_type_mode
)
8747 return complex_float_type_node
;
8749 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8750 if (type_mode
== float16_type_mode
8751 || type_mode
== float_type_mode
)
8752 return complex_double_type_node
;
8754 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8755 if (type_mode
== float16_type_mode
8756 || type_mode
== float_type_mode
8757 || type_mode
== double_type_mode
)
8758 return complex_long_double_type_node
;
8772 /* Return OP, stripped of any conversions to wider types as much as is safe.
8773 Converting the value back to OP's type makes a value equivalent to OP.
8775 If FOR_TYPE is nonzero, we return a value which, if converted to
8776 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8778 OP must have integer, real or enumeral type. Pointers are not allowed!
8780 There are some cases where the obvious value we could return
8781 would regenerate to OP if converted to OP's type,
8782 but would not extend like OP to wider types.
8783 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8784 For example, if OP is (unsigned short)(signed char)-1,
8785 we avoid returning (signed char)-1 if FOR_TYPE is int,
8786 even though extending that to an unsigned short would regenerate OP,
8787 since the result of extending (signed char)-1 to (int)
8788 is different from (int) OP. */
8791 get_unwidened (tree op
, tree for_type
)
8793 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8794 tree type
= TREE_TYPE (op
);
8796 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8798 = (for_type
!= 0 && for_type
!= type
8799 && final_prec
> TYPE_PRECISION (type
)
8800 && TYPE_UNSIGNED (type
));
8803 while (CONVERT_EXPR_P (op
))
8807 /* TYPE_PRECISION on vector types has different meaning
8808 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8809 so avoid them here. */
8810 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8813 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8814 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8816 /* Truncations are many-one so cannot be removed.
8817 Unless we are later going to truncate down even farther. */
8819 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8822 /* See what's inside this conversion. If we decide to strip it,
8824 op
= TREE_OPERAND (op
, 0);
8826 /* If we have not stripped any zero-extensions (uns is 0),
8827 we can strip any kind of extension.
8828 If we have previously stripped a zero-extension,
8829 only zero-extensions can safely be stripped.
8830 Any extension can be stripped if the bits it would produce
8831 are all going to be discarded later by truncating to FOR_TYPE. */
8835 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8837 /* TYPE_UNSIGNED says whether this is a zero-extension.
8838 Let's avoid computing it if it does not affect WIN
8839 and if UNS will not be needed again. */
8841 || CONVERT_EXPR_P (op
))
8842 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8850 /* If we finally reach a constant see if it fits in sth smaller and
8851 in that case convert it. */
8852 if (TREE_CODE (win
) == INTEGER_CST
)
8854 tree wtype
= TREE_TYPE (win
);
8855 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8857 prec
= MAX (prec
, final_prec
);
8858 if (prec
< TYPE_PRECISION (wtype
))
8860 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8861 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8862 win
= fold_convert (t
, win
);
8869 /* Return OP or a simpler expression for a narrower value
8870 which can be sign-extended or zero-extended to give back OP.
8871 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8872 or 0 if the value should be sign-extended. */
8875 get_narrower (tree op
, int *unsignedp_ptr
)
8880 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8882 if (TREE_CODE (op
) == COMPOUND_EXPR
)
8884 while (TREE_CODE (op
) == COMPOUND_EXPR
)
8885 op
= TREE_OPERAND (op
, 1);
8886 tree ret
= get_narrower (op
, unsignedp_ptr
);
8890 for (tree
*p
= &win
; TREE_CODE (op
) == COMPOUND_EXPR
;
8891 op
= TREE_OPERAND (op
, 1), p
= &TREE_OPERAND (*p
, 1))
8892 *p
= build2_loc (EXPR_LOCATION (op
), COMPOUND_EXPR
,
8893 TREE_TYPE (ret
), TREE_OPERAND (op
, 0),
8897 while (TREE_CODE (op
) == NOP_EXPR
)
8900 = (TYPE_PRECISION (TREE_TYPE (op
))
8901 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8903 /* Truncations are many-one so cannot be removed. */
8907 /* See what's inside this conversion. If we decide to strip it,
8912 op
= TREE_OPERAND (op
, 0);
8913 /* An extension: the outermost one can be stripped,
8914 but remember whether it is zero or sign extension. */
8916 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8917 /* Otherwise, if a sign extension has been stripped,
8918 only sign extensions can now be stripped;
8919 if a zero extension has been stripped, only zero-extensions. */
8920 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8924 else /* bitschange == 0 */
8926 /* A change in nominal type can always be stripped, but we must
8927 preserve the unsignedness. */
8929 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8931 op
= TREE_OPERAND (op
, 0);
8932 /* Keep trying to narrow, but don't assign op to win if it
8933 would turn an integral type into something else. */
8934 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8941 if (TREE_CODE (op
) == COMPONENT_REF
8942 /* Since type_for_size always gives an integer type. */
8943 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8944 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8945 /* Ensure field is laid out already. */
8946 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8947 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8949 unsigned HOST_WIDE_INT innerprec
8950 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8951 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8952 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8953 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8955 /* We can get this structure field in a narrower type that fits it,
8956 but the resulting extension to its nominal type (a fullword type)
8957 must satisfy the same conditions as for other extensions.
8959 Do this only for fields that are aligned (not bit-fields),
8960 because when bit-field insns will be used there is no
8961 advantage in doing this. */
8963 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8964 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8965 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8969 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8970 win
= fold_convert (type
, op
);
8974 *unsignedp_ptr
= uns
;
8978 /* Return true if integer constant C has a value that is permissible
8979 for TYPE, an integral type. */
8982 int_fits_type_p (const_tree c
, const_tree type
)
8984 tree type_low_bound
, type_high_bound
;
8985 bool ok_for_low_bound
, ok_for_high_bound
;
8986 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8988 /* Non-standard boolean types can have arbitrary precision but various
8989 transformations assume that they can only take values 0 and +/-1. */
8990 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8991 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8994 type_low_bound
= TYPE_MIN_VALUE (type
);
8995 type_high_bound
= TYPE_MAX_VALUE (type
);
8997 /* If at least one bound of the type is a constant integer, we can check
8998 ourselves and maybe make a decision. If no such decision is possible, but
8999 this type is a subtype, try checking against that. Otherwise, use
9000 fits_to_tree_p, which checks against the precision.
9002 Compute the status for each possibly constant bound, and return if we see
9003 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9004 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9005 for "constant known to fit". */
9007 /* Check if c >= type_low_bound. */
9008 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9010 if (tree_int_cst_lt (c
, type_low_bound
))
9012 ok_for_low_bound
= true;
9015 ok_for_low_bound
= false;
9017 /* Check if c <= type_high_bound. */
9018 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9020 if (tree_int_cst_lt (type_high_bound
, c
))
9022 ok_for_high_bound
= true;
9025 ok_for_high_bound
= false;
9027 /* If the constant fits both bounds, the result is known. */
9028 if (ok_for_low_bound
&& ok_for_high_bound
)
9031 /* Perform some generic filtering which may allow making a decision
9032 even if the bounds are not constant. First, negative integers
9033 never fit in unsigned types, */
9034 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9037 /* Second, narrower types always fit in wider ones. */
9038 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9041 /* Third, unsigned integers with top bit set never fit signed types. */
9042 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9044 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9045 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9047 /* When a tree_cst is converted to a wide-int, the precision
9048 is taken from the type. However, if the precision of the
9049 mode underneath the type is smaller than that, it is
9050 possible that the value will not fit. The test below
9051 fails if any bit is set between the sign bit of the
9052 underlying mode and the top bit of the type. */
9053 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9056 else if (wi::neg_p (wi::to_wide (c
)))
9060 /* If we haven't been able to decide at this point, there nothing more we
9061 can check ourselves here. Look at the base type if we have one and it
9062 has the same precision. */
9063 if (TREE_CODE (type
) == INTEGER_TYPE
9064 && TREE_TYPE (type
) != 0
9065 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9067 type
= TREE_TYPE (type
);
9071 /* Or to fits_to_tree_p, if nothing else. */
9072 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9075 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9076 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9077 represented (assuming two's-complement arithmetic) within the bit
9078 precision of the type are returned instead. */
9081 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9083 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9084 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9085 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9088 if (TYPE_UNSIGNED (type
))
9089 mpz_set_ui (min
, 0);
9092 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9093 wi::to_mpz (mn
, min
, SIGNED
);
9097 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9098 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9099 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9102 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9103 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9107 /* Return true if VAR is an automatic variable. */
9110 auto_var_p (const_tree var
)
9112 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9113 || TREE_CODE (var
) == PARM_DECL
)
9114 && ! TREE_STATIC (var
))
9115 || TREE_CODE (var
) == RESULT_DECL
);
9118 /* Return true if VAR is an automatic variable defined in function FN. */
9121 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9123 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9124 && (auto_var_p (var
)
9125 || TREE_CODE (var
) == LABEL_DECL
));
9128 /* Subprogram of following function. Called by walk_tree.
9130 Return *TP if it is an automatic variable or parameter of the
9131 function passed in as DATA. */
9134 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9136 tree fn
= (tree
) data
;
9141 else if (DECL_P (*tp
)
9142 && auto_var_in_fn_p (*tp
, fn
))
9148 /* Returns true if T is, contains, or refers to a type with variable
9149 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9150 arguments, but not the return type. If FN is nonzero, only return
9151 true if a modifier of the type or position of FN is a variable or
9152 parameter inside FN.
9154 This concept is more general than that of C99 'variably modified types':
9155 in C99, a struct type is never variably modified because a VLA may not
9156 appear as a structure member. However, in GNU C code like:
9158 struct S { int i[f()]; };
9160 is valid, and other languages may define similar constructs. */
9163 variably_modified_type_p (tree type
, tree fn
)
9167 /* Test if T is either variable (if FN is zero) or an expression containing
9168 a variable in FN. If TYPE isn't gimplified, return true also if
9169 gimplify_one_sizepos would gimplify the expression into a local
9171 #define RETURN_TRUE_IF_VAR(T) \
9172 do { tree _t = (T); \
9173 if (_t != NULL_TREE \
9174 && _t != error_mark_node \
9175 && !CONSTANT_CLASS_P (_t) \
9176 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9178 || (!TYPE_SIZES_GIMPLIFIED (type) \
9179 && (TREE_CODE (_t) != VAR_DECL \
9180 && !CONTAINS_PLACEHOLDER_P (_t))) \
9181 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9182 return true; } while (0)
9184 if (type
== error_mark_node
)
9187 /* If TYPE itself has variable size, it is variably modified. */
9188 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9189 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9191 switch (TREE_CODE (type
))
9194 case REFERENCE_TYPE
:
9196 /* Ada can have pointer types refering to themselves indirectly. */
9197 if (TREE_VISITED (type
))
9199 TREE_VISITED (type
) = true;
9200 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9202 TREE_VISITED (type
) = false;
9205 TREE_VISITED (type
) = false;
9210 /* If TYPE is a function type, it is variably modified if the
9211 return type is variably modified. */
9212 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9218 case FIXED_POINT_TYPE
:
9221 /* Scalar types are variably modified if their end points
9223 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9224 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9229 case QUAL_UNION_TYPE
:
9230 /* We can't see if any of the fields are variably-modified by the
9231 definition we normally use, since that would produce infinite
9232 recursion via pointers. */
9233 /* This is variably modified if some field's type is. */
9234 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9235 if (TREE_CODE (t
) == FIELD_DECL
)
9237 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9238 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9239 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9241 /* If the type is a qualified union, then the DECL_QUALIFIER
9242 of fields can also be an expression containing a variable. */
9243 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9244 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9246 /* If the field is a qualified union, then it's only a container
9247 for what's inside so we look into it. That's necessary in LTO
9248 mode because the sizes of the field tested above have been set
9249 to PLACEHOLDER_EXPRs by free_lang_data. */
9250 if (TREE_CODE (TREE_TYPE (t
)) == QUAL_UNION_TYPE
9251 && variably_modified_type_p (TREE_TYPE (t
), fn
))
9257 /* Do not call ourselves to avoid infinite recursion. This is
9258 variably modified if the element type is. */
9259 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9260 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9267 /* The current language may have other cases to check, but in general,
9268 all other types are not variably modified. */
9269 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9271 #undef RETURN_TRUE_IF_VAR
9274 /* Given a DECL or TYPE, return the scope in which it was declared, or
9275 NULL_TREE if there is no containing scope. */
9278 get_containing_scope (const_tree t
)
9280 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9283 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9286 get_ultimate_context (const_tree decl
)
9288 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9290 if (TREE_CODE (decl
) == BLOCK
)
9291 decl
= BLOCK_SUPERCONTEXT (decl
);
9293 decl
= get_containing_scope (decl
);
9298 /* Return the innermost context enclosing DECL that is
9299 a FUNCTION_DECL, or zero if none. */
9302 decl_function_context (const_tree decl
)
9306 if (TREE_CODE (decl
) == ERROR_MARK
)
9309 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9310 where we look up the function at runtime. Such functions always take
9311 a first argument of type 'pointer to real context'.
9313 C++ should really be fixed to use DECL_CONTEXT for the real context,
9314 and use something else for the "virtual context". */
9315 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9318 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9320 context
= DECL_CONTEXT (decl
);
9322 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9324 if (TREE_CODE (context
) == BLOCK
)
9325 context
= BLOCK_SUPERCONTEXT (context
);
9327 context
= get_containing_scope (context
);
9333 /* Return the innermost context enclosing DECL that is
9334 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9335 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9338 decl_type_context (const_tree decl
)
9340 tree context
= DECL_CONTEXT (decl
);
9343 switch (TREE_CODE (context
))
9345 case NAMESPACE_DECL
:
9346 case TRANSLATION_UNIT_DECL
:
9351 case QUAL_UNION_TYPE
:
9356 context
= DECL_CONTEXT (context
);
9360 context
= BLOCK_SUPERCONTEXT (context
);
9370 /* CALL is a CALL_EXPR. Return the declaration for the function
9371 called, or NULL_TREE if the called function cannot be
9375 get_callee_fndecl (const_tree call
)
9379 if (call
== error_mark_node
)
9380 return error_mark_node
;
9382 /* It's invalid to call this function with anything but a
9384 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9386 /* The first operand to the CALL is the address of the function
9388 addr
= CALL_EXPR_FN (call
);
9390 /* If there is no function, return early. */
9391 if (addr
== NULL_TREE
)
9396 /* If this is a readonly function pointer, extract its initial value. */
9397 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9398 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9399 && DECL_INITIAL (addr
))
9400 addr
= DECL_INITIAL (addr
);
9402 /* If the address is just `&f' for some function `f', then we know
9403 that `f' is being called. */
9404 if (TREE_CODE (addr
) == ADDR_EXPR
9405 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9406 return TREE_OPERAND (addr
, 0);
9408 /* We couldn't figure out what was being called. */
9412 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9413 return the associated function code, otherwise return CFN_LAST. */
9416 get_call_combined_fn (const_tree call
)
9418 /* It's invalid to call this function with anything but a CALL_EXPR. */
9419 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9421 if (!CALL_EXPR_FN (call
))
9422 return as_combined_fn (CALL_EXPR_IFN (call
));
9424 tree fndecl
= get_callee_fndecl (call
);
9425 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9426 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9431 /* Comparator of indices based on tree_node_counts. */
9434 tree_nodes_cmp (const void *p1
, const void *p2
)
9436 const unsigned *n1
= (const unsigned *)p1
;
9437 const unsigned *n2
= (const unsigned *)p2
;
9439 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9442 /* Comparator of indices based on tree_code_counts. */
9445 tree_codes_cmp (const void *p1
, const void *p2
)
9447 const unsigned *n1
= (const unsigned *)p1
;
9448 const unsigned *n2
= (const unsigned *)p2
;
9450 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9453 #define TREE_MEM_USAGE_SPACES 40
9455 /* Print debugging information about tree nodes generated during the compile,
9456 and any language-specific information. */
9459 dump_tree_statistics (void)
9461 if (GATHER_STATISTICS
)
9463 uint64_t total_nodes
, total_bytes
;
9464 fprintf (stderr
, "\nKind Nodes Bytes\n");
9465 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9466 total_nodes
= total_bytes
= 0;
9469 auto_vec
<unsigned> indices (all_kinds
);
9470 for (unsigned i
= 0; i
< all_kinds
; i
++)
9471 indices
.quick_push (i
);
9472 indices
.qsort (tree_nodes_cmp
);
9474 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9476 unsigned j
= indices
[i
];
9477 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9478 tree_node_kind_names
[j
], SIZE_AMOUNT (tree_node_counts
[j
]),
9479 SIZE_AMOUNT (tree_node_sizes
[j
]));
9480 total_nodes
+= tree_node_counts
[j
];
9481 total_bytes
+= tree_node_sizes
[j
];
9483 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9484 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9485 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9486 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9490 fprintf (stderr
, "Code Nodes\n");
9491 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9493 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9494 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9495 indices
.quick_push (i
);
9496 indices
.qsort (tree_codes_cmp
);
9498 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9500 unsigned j
= indices
[i
];
9501 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9502 get_tree_code_name ((enum tree_code
) j
),
9503 SIZE_AMOUNT (tree_code_counts
[j
]));
9505 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9506 fprintf (stderr
, "\n");
9507 ssanames_print_statistics ();
9508 fprintf (stderr
, "\n");
9509 phinodes_print_statistics ();
9510 fprintf (stderr
, "\n");
9514 fprintf (stderr
, "(No per-node statistics)\n");
9516 print_type_hash_statistics ();
9517 print_debug_expr_statistics ();
9518 print_value_expr_statistics ();
9519 lang_hooks
.print_statistics ();
9522 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9524 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9527 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9529 /* This relies on the raw feedback's top 4 bits being zero. */
9530 #define FEEDBACK(X) ((X) * 0x04c11db7)
9531 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9532 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9533 static const unsigned syndromes
[16] =
9535 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9536 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9537 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9538 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9543 value
<<= (32 - bytes
* 8);
9544 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9546 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9548 chksum
= (chksum
<< 4) ^ feedback
;
9554 /* Generate a crc32 of a string. */
9557 crc32_string (unsigned chksum
, const char *string
)
9560 chksum
= crc32_byte (chksum
, *string
);
9565 /* P is a string that will be used in a symbol. Mask out any characters
9566 that are not valid in that context. */
9569 clean_symbol_name (char *p
)
9573 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9576 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9583 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9585 /* Create a unique anonymous identifier. The identifier is still a
9586 valid assembly label. */
9592 #if !defined (NO_DOT_IN_LABEL)
9594 #elif !defined (NO_DOLLAR_IN_LABEL)
9602 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9603 gcc_checking_assert (len
< int (sizeof (buf
)));
9605 tree id
= get_identifier_with_length (buf
, len
);
9606 IDENTIFIER_ANON_P (id
) = true;
9611 /* Generate a name for a special-purpose function.
9612 The generated name may need to be unique across the whole link.
9613 Changes to this function may also require corresponding changes to
9614 xstrdup_mask_random.
9615 TYPE is some string to identify the purpose of this function to the
9616 linker or collect2; it must start with an uppercase letter,
9618 I - for constructors
9620 N - for C++ anonymous namespaces
9621 F - for DWARF unwind frame information. */
9624 get_file_function_name (const char *type
)
9630 /* If we already have a name we know to be unique, just use that. */
9631 if (first_global_object_name
)
9632 p
= q
= ASTRDUP (first_global_object_name
);
9633 /* If the target is handling the constructors/destructors, they
9634 will be local to this file and the name is only necessary for
9636 We also assign sub_I and sub_D sufixes to constructors called from
9637 the global static constructors. These are always local. */
9638 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9639 || (strncmp (type
, "sub_", 4) == 0
9640 && (type
[4] == 'I' || type
[4] == 'D')))
9642 const char *file
= main_input_filename
;
9644 file
= LOCATION_FILE (input_location
);
9645 /* Just use the file's basename, because the full pathname
9646 might be quite long. */
9647 p
= q
= ASTRDUP (lbasename (file
));
9651 /* Otherwise, the name must be unique across the entire link.
9652 We don't have anything that we know to be unique to this translation
9653 unit, so use what we do have and throw in some randomness. */
9655 const char *name
= weak_global_object_name
;
9656 const char *file
= main_input_filename
;
9661 file
= LOCATION_FILE (input_location
);
9663 len
= strlen (file
);
9664 q
= (char *) alloca (9 + 19 + len
+ 1);
9665 memcpy (q
, file
, len
+ 1);
9667 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9668 crc32_string (0, name
), get_random_seed (false));
9673 clean_symbol_name (q
);
9674 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9677 /* Set up the name of the file-level functions we may need.
9678 Use a global object (which is already required to be unique over
9679 the program) rather than the file name (which imposes extra
9681 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9683 return get_identifier (buf
);
9686 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9688 /* Complain that the tree code of NODE does not match the expected 0
9689 terminated list of trailing codes. The trailing code list can be
9690 empty, for a more vague error message. FILE, LINE, and FUNCTION
9691 are of the caller. */
9694 tree_check_failed (const_tree node
, const char *file
,
9695 int line
, const char *function
, ...)
9699 unsigned length
= 0;
9700 enum tree_code code
;
9702 va_start (args
, function
);
9703 while ((code
= (enum tree_code
) va_arg (args
, int)))
9704 length
+= 4 + strlen (get_tree_code_name (code
));
9709 va_start (args
, function
);
9710 length
+= strlen ("expected ");
9711 buffer
= tmp
= (char *) alloca (length
);
9713 while ((code
= (enum tree_code
) va_arg (args
, int)))
9715 const char *prefix
= length
? " or " : "expected ";
9717 strcpy (tmp
+ length
, prefix
);
9718 length
+= strlen (prefix
);
9719 strcpy (tmp
+ length
, get_tree_code_name (code
));
9720 length
+= strlen (get_tree_code_name (code
));
9725 buffer
= "unexpected node";
9727 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9728 buffer
, get_tree_code_name (TREE_CODE (node
)),
9729 function
, trim_filename (file
), line
);
9732 /* Complain that the tree code of NODE does match the expected 0
9733 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9737 tree_not_check_failed (const_tree node
, const char *file
,
9738 int line
, const char *function
, ...)
9742 unsigned length
= 0;
9743 enum tree_code code
;
9745 va_start (args
, function
);
9746 while ((code
= (enum tree_code
) va_arg (args
, int)))
9747 length
+= 4 + strlen (get_tree_code_name (code
));
9749 va_start (args
, function
);
9750 buffer
= (char *) alloca (length
);
9752 while ((code
= (enum tree_code
) va_arg (args
, int)))
9756 strcpy (buffer
+ length
, " or ");
9759 strcpy (buffer
+ length
, get_tree_code_name (code
));
9760 length
+= strlen (get_tree_code_name (code
));
9764 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9765 buffer
, get_tree_code_name (TREE_CODE (node
)),
9766 function
, trim_filename (file
), line
);
9769 /* Similar to tree_check_failed, except that we check for a class of tree
9770 code, given in CL. */
9773 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9774 const char *file
, int line
, const char *function
)
9777 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9778 TREE_CODE_CLASS_STRING (cl
),
9779 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9780 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9783 /* Similar to tree_check_failed, except that instead of specifying a
9784 dozen codes, use the knowledge that they're all sequential. */
9787 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9788 const char *function
, enum tree_code c1
,
9792 unsigned length
= 0;
9795 for (c
= c1
; c
<= c2
; ++c
)
9796 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9798 length
+= strlen ("expected ");
9799 buffer
= (char *) alloca (length
);
9802 for (c
= c1
; c
<= c2
; ++c
)
9804 const char *prefix
= length
? " or " : "expected ";
9806 strcpy (buffer
+ length
, prefix
);
9807 length
+= strlen (prefix
);
9808 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9809 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9812 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9813 buffer
, get_tree_code_name (TREE_CODE (node
)),
9814 function
, trim_filename (file
), line
);
9818 /* Similar to tree_check_failed, except that we check that a tree does
9819 not have the specified code, given in CL. */
9822 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9823 const char *file
, int line
, const char *function
)
9826 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9827 TREE_CODE_CLASS_STRING (cl
),
9828 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9829 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9833 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9836 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9837 const char *function
, enum omp_clause_code code
)
9839 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
9841 omp_clause_code_name
[code
],
9842 get_tree_code_name (TREE_CODE (node
)),
9843 function
, trim_filename (file
), line
);
9847 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9850 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9851 const char *function
, enum omp_clause_code c1
,
9852 enum omp_clause_code c2
)
9855 unsigned length
= 0;
9858 for (c
= c1
; c
<= c2
; ++c
)
9859 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9861 length
+= strlen ("expected ");
9862 buffer
= (char *) alloca (length
);
9865 for (c
= c1
; c
<= c2
; ++c
)
9867 const char *prefix
= length
? " or " : "expected ";
9869 strcpy (buffer
+ length
, prefix
);
9870 length
+= strlen (prefix
);
9871 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9872 length
+= strlen (omp_clause_code_name
[c
]);
9875 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9876 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9877 function
, trim_filename (file
), line
);
9881 #undef DEFTREESTRUCT
9882 #define DEFTREESTRUCT(VAL, NAME) NAME,
9884 static const char *ts_enum_names
[] = {
9885 #include "treestruct.def"
9887 #undef DEFTREESTRUCT
9889 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9891 /* Similar to tree_class_check_failed, except that we check for
9892 whether CODE contains the tree structure identified by EN. */
9895 tree_contains_struct_check_failed (const_tree node
,
9896 const enum tree_node_structure_enum en
,
9897 const char *file
, int line
,
9898 const char *function
)
9901 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9903 get_tree_code_name (TREE_CODE (node
)), 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_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9912 const char *function
)
9915 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
9917 idx
+ 1, len
, function
, trim_filename (file
), line
);
9920 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9921 (dynamically sized) vector. */
9924 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9925 const char *function
)
9928 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
9929 idx
+ 1, len
, function
, trim_filename (file
), line
);
9932 /* Similar to above, except that the check is for the bounds of the operand
9933 vector of an expression node EXP. */
9936 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9937 int line
, const char *function
)
9939 enum tree_code code
= TREE_CODE (exp
);
9941 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9942 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9943 function
, trim_filename (file
), line
);
9946 /* Similar to above, except that the check is for the number of
9947 operands of an OMP_CLAUSE node. */
9950 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9951 int line
, const char *function
)
9954 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
9955 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9956 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9957 trim_filename (file
), line
);
9959 #endif /* ENABLE_TREE_CHECKING */
9961 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9962 and mapped to the machine mode MODE. Initialize its fields and build
9963 the information necessary for debugging output. */
9966 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9969 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9971 t
= make_node (VECTOR_TYPE
);
9972 TREE_TYPE (t
) = mv_innertype
;
9973 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9974 SET_TYPE_MODE (t
, mode
);
9976 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9977 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9978 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9979 || mode
!= VOIDmode
)
9980 && !VECTOR_BOOLEAN_TYPE_P (t
))
9982 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9986 hashval_t hash
= type_hash_canon_hash (t
);
9987 t
= type_hash_canon (hash
, t
);
9989 /* We have built a main variant, based on the main variant of the
9990 inner type. Use it to build the variant we return. */
9991 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9992 && TREE_TYPE (t
) != innertype
)
9993 return build_type_attribute_qual_variant (t
,
9994 TYPE_ATTRIBUTES (innertype
),
9995 TYPE_QUALS (innertype
));
10001 make_or_reuse_type (unsigned size
, int unsignedp
)
10005 if (size
== INT_TYPE_SIZE
)
10006 return unsignedp
? unsigned_type_node
: integer_type_node
;
10007 if (size
== CHAR_TYPE_SIZE
)
10008 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10009 if (size
== SHORT_TYPE_SIZE
)
10010 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10011 if (size
== LONG_TYPE_SIZE
)
10012 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10013 if (size
== LONG_LONG_TYPE_SIZE
)
10014 return (unsignedp
? long_long_unsigned_type_node
10015 : long_long_integer_type_node
);
10017 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10018 if (size
== int_n_data
[i
].bitsize
10019 && int_n_enabled_p
[i
])
10020 return (unsignedp
? int_n_trees
[i
].unsigned_type
10021 : int_n_trees
[i
].signed_type
);
10024 return make_unsigned_type (size
);
10026 return make_signed_type (size
);
10029 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10032 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10036 if (size
== SHORT_FRACT_TYPE_SIZE
)
10037 return unsignedp
? sat_unsigned_short_fract_type_node
10038 : sat_short_fract_type_node
;
10039 if (size
== FRACT_TYPE_SIZE
)
10040 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10041 if (size
== LONG_FRACT_TYPE_SIZE
)
10042 return unsignedp
? sat_unsigned_long_fract_type_node
10043 : sat_long_fract_type_node
;
10044 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10045 return unsignedp
? sat_unsigned_long_long_fract_type_node
10046 : sat_long_long_fract_type_node
;
10050 if (size
== SHORT_FRACT_TYPE_SIZE
)
10051 return unsignedp
? unsigned_short_fract_type_node
10052 : short_fract_type_node
;
10053 if (size
== FRACT_TYPE_SIZE
)
10054 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10055 if (size
== LONG_FRACT_TYPE_SIZE
)
10056 return unsignedp
? unsigned_long_fract_type_node
10057 : long_fract_type_node
;
10058 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10059 return unsignedp
? unsigned_long_long_fract_type_node
10060 : long_long_fract_type_node
;
10063 return make_fract_type (size
, unsignedp
, satp
);
10066 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10069 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10073 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10074 return unsignedp
? sat_unsigned_short_accum_type_node
10075 : sat_short_accum_type_node
;
10076 if (size
== ACCUM_TYPE_SIZE
)
10077 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10078 if (size
== LONG_ACCUM_TYPE_SIZE
)
10079 return unsignedp
? sat_unsigned_long_accum_type_node
10080 : sat_long_accum_type_node
;
10081 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10082 return unsignedp
? sat_unsigned_long_long_accum_type_node
10083 : sat_long_long_accum_type_node
;
10087 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10088 return unsignedp
? unsigned_short_accum_type_node
10089 : short_accum_type_node
;
10090 if (size
== ACCUM_TYPE_SIZE
)
10091 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10092 if (size
== LONG_ACCUM_TYPE_SIZE
)
10093 return unsignedp
? unsigned_long_accum_type_node
10094 : long_accum_type_node
;
10095 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10096 return unsignedp
? unsigned_long_long_accum_type_node
10097 : long_long_accum_type_node
;
10100 return make_accum_type (size
, unsignedp
, satp
);
10104 /* Create an atomic variant node for TYPE. This routine is called
10105 during initialization of data types to create the 5 basic atomic
10106 types. The generic build_variant_type function requires these to
10107 already be set up in order to function properly, so cannot be
10108 called from there. If ALIGN is non-zero, then ensure alignment is
10109 overridden to this value. */
10112 build_atomic_base (tree type
, unsigned int align
)
10116 /* Make sure its not already registered. */
10117 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10120 t
= build_variant_type_copy (type
);
10121 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10124 SET_TYPE_ALIGN (t
, align
);
10129 /* Information about the _FloatN and _FloatNx types. This must be in
10130 the same order as the corresponding TI_* enum values. */
10131 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10143 /* Create nodes for all integer types (and error_mark_node) using the sizes
10144 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10147 build_common_tree_nodes (bool signed_char
)
10151 error_mark_node
= make_node (ERROR_MARK
);
10152 TREE_TYPE (error_mark_node
) = error_mark_node
;
10154 initialize_sizetypes ();
10156 /* Define both `signed char' and `unsigned char'. */
10157 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10158 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10159 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10160 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10162 /* Define `char', which is like either `signed char' or `unsigned char'
10163 but not the same as either. */
10166 ? make_signed_type (CHAR_TYPE_SIZE
)
10167 : make_unsigned_type (CHAR_TYPE_SIZE
));
10168 TYPE_STRING_FLAG (char_type_node
) = 1;
10170 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10171 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10172 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10173 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10174 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10175 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10176 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10177 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10179 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10181 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10182 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10184 if (int_n_enabled_p
[i
])
10186 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10187 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10191 /* Define a boolean type. This type only represents boolean values but
10192 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10193 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10194 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10195 TYPE_PRECISION (boolean_type_node
) = 1;
10196 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10198 /* Define what type to use for size_t. */
10199 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10200 size_type_node
= unsigned_type_node
;
10201 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10202 size_type_node
= long_unsigned_type_node
;
10203 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10204 size_type_node
= long_long_unsigned_type_node
;
10205 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10206 size_type_node
= short_unsigned_type_node
;
10211 size_type_node
= NULL_TREE
;
10212 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10213 if (int_n_enabled_p
[i
])
10215 char name
[50], altname
[50];
10216 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10217 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10219 if (strcmp (name
, SIZE_TYPE
) == 0
10220 || strcmp (altname
, SIZE_TYPE
) == 0)
10222 size_type_node
= int_n_trees
[i
].unsigned_type
;
10225 if (size_type_node
== NULL_TREE
)
10226 gcc_unreachable ();
10229 /* Define what type to use for ptrdiff_t. */
10230 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10231 ptrdiff_type_node
= integer_type_node
;
10232 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10233 ptrdiff_type_node
= long_integer_type_node
;
10234 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10235 ptrdiff_type_node
= long_long_integer_type_node
;
10236 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10237 ptrdiff_type_node
= short_integer_type_node
;
10240 ptrdiff_type_node
= NULL_TREE
;
10241 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10242 if (int_n_enabled_p
[i
])
10244 char name
[50], altname
[50];
10245 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10246 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10248 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10249 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10250 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10252 if (ptrdiff_type_node
== NULL_TREE
)
10253 gcc_unreachable ();
10256 /* Fill in the rest of the sized types. Reuse existing type nodes
10258 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10259 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10260 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10261 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10262 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10264 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10265 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10266 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10267 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10268 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10270 /* Don't call build_qualified type for atomics. That routine does
10271 special processing for atomics, and until they are initialized
10272 it's better not to make that call.
10274 Check to see if there is a target override for atomic types. */
10276 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10277 targetm
.atomic_align_for_mode (QImode
));
10278 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10279 targetm
.atomic_align_for_mode (HImode
));
10280 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10281 targetm
.atomic_align_for_mode (SImode
));
10282 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10283 targetm
.atomic_align_for_mode (DImode
));
10284 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10285 targetm
.atomic_align_for_mode (TImode
));
10287 access_public_node
= get_identifier ("public");
10288 access_protected_node
= get_identifier ("protected");
10289 access_private_node
= get_identifier ("private");
10291 /* Define these next since types below may used them. */
10292 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10293 integer_one_node
= build_int_cst (integer_type_node
, 1);
10294 integer_three_node
= build_int_cst (integer_type_node
, 3);
10295 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10297 size_zero_node
= size_int (0);
10298 size_one_node
= size_int (1);
10299 bitsize_zero_node
= bitsize_int (0);
10300 bitsize_one_node
= bitsize_int (1);
10301 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10303 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10304 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10306 void_type_node
= make_node (VOID_TYPE
);
10307 layout_type (void_type_node
);
10309 /* We are not going to have real types in C with less than byte alignment,
10310 so we might as well not have any types that claim to have it. */
10311 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10312 TYPE_USER_ALIGN (void_type_node
) = 0;
10314 void_node
= make_node (VOID_CST
);
10315 TREE_TYPE (void_node
) = void_type_node
;
10317 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10318 layout_type (TREE_TYPE (null_pointer_node
));
10320 ptr_type_node
= build_pointer_type (void_type_node
);
10321 const_ptr_type_node
10322 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10323 for (unsigned i
= 0;
10324 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10326 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10328 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10330 float_type_node
= make_node (REAL_TYPE
);
10331 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10332 layout_type (float_type_node
);
10334 double_type_node
= make_node (REAL_TYPE
);
10335 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10336 layout_type (double_type_node
);
10338 long_double_type_node
= make_node (REAL_TYPE
);
10339 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10340 layout_type (long_double_type_node
);
10342 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10344 int n
= floatn_nx_types
[i
].n
;
10345 bool extended
= floatn_nx_types
[i
].extended
;
10346 scalar_float_mode mode
;
10347 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10349 int precision
= GET_MODE_PRECISION (mode
);
10350 /* Work around the rs6000 KFmode having precision 113 not
10352 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10353 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10354 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10356 gcc_assert (min_precision
== n
);
10357 if (precision
< min_precision
)
10358 precision
= min_precision
;
10359 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10360 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10361 layout_type (FLOATN_NX_TYPE_NODE (i
));
10362 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10365 float_ptr_type_node
= build_pointer_type (float_type_node
);
10366 double_ptr_type_node
= build_pointer_type (double_type_node
);
10367 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10368 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10370 /* Fixed size integer types. */
10371 uint16_type_node
= make_or_reuse_type (16, 1);
10372 uint32_type_node
= make_or_reuse_type (32, 1);
10373 uint64_type_node
= make_or_reuse_type (64, 1);
10375 /* Decimal float types. */
10376 if (targetm
.decimal_float_supported_p ())
10378 dfloat32_type_node
= make_node (REAL_TYPE
);
10379 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10380 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10381 layout_type (dfloat32_type_node
);
10383 dfloat64_type_node
= make_node (REAL_TYPE
);
10384 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10385 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10386 layout_type (dfloat64_type_node
);
10388 dfloat128_type_node
= make_node (REAL_TYPE
);
10389 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10390 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10391 layout_type (dfloat128_type_node
);
10394 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10395 complex_float_type_node
= build_complex_type (float_type_node
, true);
10396 complex_double_type_node
= build_complex_type (double_type_node
, true);
10397 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10400 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10402 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10403 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10404 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10407 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10408 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10409 sat_ ## KIND ## _type_node = \
10410 make_sat_signed_ ## KIND ## _type (SIZE); \
10411 sat_unsigned_ ## KIND ## _type_node = \
10412 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10413 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10414 unsigned_ ## KIND ## _type_node = \
10415 make_unsigned_ ## KIND ## _type (SIZE);
10417 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10418 sat_ ## WIDTH ## KIND ## _type_node = \
10419 make_sat_signed_ ## KIND ## _type (SIZE); \
10420 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10421 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10422 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10423 unsigned_ ## WIDTH ## KIND ## _type_node = \
10424 make_unsigned_ ## KIND ## _type (SIZE);
10426 /* Make fixed-point type nodes based on four different widths. */
10427 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10428 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10429 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10430 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10431 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10433 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10434 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10435 NAME ## _type_node = \
10436 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10437 u ## NAME ## _type_node = \
10438 make_or_reuse_unsigned_ ## KIND ## _type \
10439 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10440 sat_ ## NAME ## _type_node = \
10441 make_or_reuse_sat_signed_ ## KIND ## _type \
10442 (GET_MODE_BITSIZE (MODE ## mode)); \
10443 sat_u ## NAME ## _type_node = \
10444 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10445 (GET_MODE_BITSIZE (U ## MODE ## mode));
10447 /* Fixed-point type and mode nodes. */
10448 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10449 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10450 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10451 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10452 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10453 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10454 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10455 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10456 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10457 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10458 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10461 tree t
= targetm
.build_builtin_va_list ();
10463 /* Many back-ends define record types without setting TYPE_NAME.
10464 If we copied the record type here, we'd keep the original
10465 record type without a name. This breaks name mangling. So,
10466 don't copy record types and let c_common_nodes_and_builtins()
10467 declare the type to be __builtin_va_list. */
10468 if (TREE_CODE (t
) != RECORD_TYPE
)
10469 t
= build_variant_type_copy (t
);
10471 va_list_type_node
= t
;
10474 /* SCEV analyzer global shared trees. */
10475 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10476 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10477 chrec_known
= make_node (SCEV_KNOWN
);
10478 TREE_TYPE (chrec_known
) = void_type_node
;
10481 /* Modify DECL for given flags.
10482 TM_PURE attribute is set only on types, so the function will modify
10483 DECL's type when ECF_TM_PURE is used. */
10486 set_call_expr_flags (tree decl
, int flags
)
10488 if (flags
& ECF_NOTHROW
)
10489 TREE_NOTHROW (decl
) = 1;
10490 if (flags
& ECF_CONST
)
10491 TREE_READONLY (decl
) = 1;
10492 if (flags
& ECF_PURE
)
10493 DECL_PURE_P (decl
) = 1;
10494 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10495 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10496 if (flags
& ECF_NOVOPS
)
10497 DECL_IS_NOVOPS (decl
) = 1;
10498 if (flags
& ECF_NORETURN
)
10499 TREE_THIS_VOLATILE (decl
) = 1;
10500 if (flags
& ECF_MALLOC
)
10501 DECL_IS_MALLOC (decl
) = 1;
10502 if (flags
& ECF_RETURNS_TWICE
)
10503 DECL_IS_RETURNS_TWICE (decl
) = 1;
10504 if (flags
& ECF_LEAF
)
10505 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10506 NULL
, DECL_ATTRIBUTES (decl
));
10507 if (flags
& ECF_COLD
)
10508 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10509 NULL
, DECL_ATTRIBUTES (decl
));
10510 if (flags
& ECF_RET1
)
10511 DECL_ATTRIBUTES (decl
)
10512 = tree_cons (get_identifier ("fn spec"),
10513 build_tree_list (NULL_TREE
, build_string (1, "1")),
10514 DECL_ATTRIBUTES (decl
));
10515 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10516 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10517 /* Looping const or pure is implied by noreturn.
10518 There is currently no way to declare looping const or looping pure alone. */
10519 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10520 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10524 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10527 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10528 const char *library_name
, int ecf_flags
)
10532 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10533 library_name
, NULL_TREE
);
10534 set_call_expr_flags (decl
, ecf_flags
);
10536 set_builtin_decl (code
, decl
, true);
10539 /* Call this function after instantiating all builtins that the language
10540 front end cares about. This will build the rest of the builtins
10541 and internal functions that are relied upon by the tree optimizers and
10545 build_common_builtin_nodes (void)
10550 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10551 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10553 ftype
= build_function_type (void_type_node
, void_list_node
);
10554 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10555 local_define_builtin ("__builtin_unreachable", ftype
,
10556 BUILT_IN_UNREACHABLE
,
10557 "__builtin_unreachable",
10558 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10559 | ECF_CONST
| ECF_COLD
);
10560 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10561 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10563 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10566 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10567 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10569 ftype
= build_function_type_list (ptr_type_node
,
10570 ptr_type_node
, const_ptr_type_node
,
10571 size_type_node
, NULL_TREE
);
10573 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10574 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10575 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10576 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10577 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10578 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10581 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10583 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10584 const_ptr_type_node
, size_type_node
,
10586 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10587 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10590 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10592 ftype
= build_function_type_list (ptr_type_node
,
10593 ptr_type_node
, integer_type_node
,
10594 size_type_node
, NULL_TREE
);
10595 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10596 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10599 /* If we're checking the stack, `alloca' can throw. */
10600 const int alloca_flags
10601 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10603 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10605 ftype
= build_function_type_list (ptr_type_node
,
10606 size_type_node
, NULL_TREE
);
10607 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10608 "alloca", alloca_flags
);
10611 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10612 size_type_node
, NULL_TREE
);
10613 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10614 BUILT_IN_ALLOCA_WITH_ALIGN
,
10615 "__builtin_alloca_with_align",
10618 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10619 size_type_node
, size_type_node
, NULL_TREE
);
10620 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10621 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10622 "__builtin_alloca_with_align_and_max",
10625 ftype
= build_function_type_list (void_type_node
,
10626 ptr_type_node
, ptr_type_node
,
10627 ptr_type_node
, NULL_TREE
);
10628 local_define_builtin ("__builtin_init_trampoline", ftype
,
10629 BUILT_IN_INIT_TRAMPOLINE
,
10630 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10631 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10632 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10633 "__builtin_init_heap_trampoline",
10634 ECF_NOTHROW
| ECF_LEAF
);
10635 local_define_builtin ("__builtin_init_descriptor", ftype
,
10636 BUILT_IN_INIT_DESCRIPTOR
,
10637 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10639 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10640 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10641 BUILT_IN_ADJUST_TRAMPOLINE
,
10642 "__builtin_adjust_trampoline",
10643 ECF_CONST
| ECF_NOTHROW
);
10644 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10645 BUILT_IN_ADJUST_DESCRIPTOR
,
10646 "__builtin_adjust_descriptor",
10647 ECF_CONST
| ECF_NOTHROW
);
10649 ftype
= build_function_type_list (void_type_node
,
10650 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10651 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10652 BUILT_IN_NONLOCAL_GOTO
,
10653 "__builtin_nonlocal_goto",
10654 ECF_NORETURN
| ECF_NOTHROW
);
10656 ftype
= build_function_type_list (void_type_node
,
10657 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10658 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10659 BUILT_IN_SETJMP_SETUP
,
10660 "__builtin_setjmp_setup", ECF_NOTHROW
);
10662 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10663 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10664 BUILT_IN_SETJMP_RECEIVER
,
10665 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10667 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10668 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10669 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10671 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10672 local_define_builtin ("__builtin_stack_restore", ftype
,
10673 BUILT_IN_STACK_RESTORE
,
10674 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10676 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10677 const_ptr_type_node
, size_type_node
,
10679 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10680 "__builtin_memcmp_eq",
10681 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10683 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10684 "__builtin_strncmp_eq",
10685 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10687 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10688 "__builtin_strcmp_eq",
10689 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10691 /* If there's a possibility that we might use the ARM EABI, build the
10692 alternate __cxa_end_cleanup node used to resume from C++. */
10693 if (targetm
.arm_eabi_unwinder
)
10695 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10696 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10697 BUILT_IN_CXA_END_CLEANUP
,
10698 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10701 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10702 local_define_builtin ("__builtin_unwind_resume", ftype
,
10703 BUILT_IN_UNWIND_RESUME
,
10704 ((targetm_common
.except_unwind_info (&global_options
)
10706 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10709 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10711 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10713 local_define_builtin ("__builtin_return_address", ftype
,
10714 BUILT_IN_RETURN_ADDRESS
,
10715 "__builtin_return_address",
10719 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10720 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10722 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10723 ptr_type_node
, NULL_TREE
);
10724 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10725 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10726 BUILT_IN_PROFILE_FUNC_ENTER
,
10727 "__cyg_profile_func_enter", 0);
10728 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10729 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10730 BUILT_IN_PROFILE_FUNC_EXIT
,
10731 "__cyg_profile_func_exit", 0);
10734 /* The exception object and filter values from the runtime. The argument
10735 must be zero before exception lowering, i.e. from the front end. After
10736 exception lowering, it will be the region number for the exception
10737 landing pad. These functions are PURE instead of CONST to prevent
10738 them from being hoisted past the exception edge that will initialize
10739 its value in the landing pad. */
10740 ftype
= build_function_type_list (ptr_type_node
,
10741 integer_type_node
, NULL_TREE
);
10742 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10743 /* Only use TM_PURE if we have TM language support. */
10744 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10745 ecf_flags
|= ECF_TM_PURE
;
10746 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10747 "__builtin_eh_pointer", ecf_flags
);
10749 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10750 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10751 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10752 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10754 ftype
= build_function_type_list (void_type_node
,
10755 integer_type_node
, integer_type_node
,
10757 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10758 BUILT_IN_EH_COPY_VALUES
,
10759 "__builtin_eh_copy_values", ECF_NOTHROW
);
10761 /* Complex multiplication and division. These are handled as builtins
10762 rather than optabs because emit_library_call_value doesn't support
10763 complex. Further, we can do slightly better with folding these
10764 beasties if the real and complex parts of the arguments are separate. */
10768 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10770 char mode_name_buf
[4], *q
;
10772 enum built_in_function mcode
, dcode
;
10773 tree type
, inner_type
;
10774 const char *prefix
= "__";
10776 if (targetm
.libfunc_gnu_prefix
)
10779 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10782 inner_type
= TREE_TYPE (type
);
10784 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10785 inner_type
, inner_type
, NULL_TREE
);
10787 mcode
= ((enum built_in_function
)
10788 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10789 dcode
= ((enum built_in_function
)
10790 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10792 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10796 /* For -ftrapping-math these should throw from a former
10797 -fnon-call-exception stmt. */
10798 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10800 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10801 built_in_names
[mcode
],
10802 ECF_CONST
| ECF_LEAF
);
10804 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10806 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10807 built_in_names
[dcode
],
10808 ECF_CONST
| ECF_LEAF
);
10812 init_internal_fns ();
10815 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10818 If we requested a pointer to a vector, build up the pointers that
10819 we stripped off while looking for the inner type. Similarly for
10820 return values from functions.
10822 The argument TYPE is the top of the chain, and BOTTOM is the
10823 new type which we will point to. */
10826 reconstruct_complex_type (tree type
, tree bottom
)
10830 if (TREE_CODE (type
) == POINTER_TYPE
)
10832 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10833 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10834 TYPE_REF_CAN_ALIAS_ALL (type
));
10836 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10838 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10839 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10840 TYPE_REF_CAN_ALIAS_ALL (type
));
10842 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10844 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10845 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10847 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10849 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10850 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10852 else if (TREE_CODE (type
) == METHOD_TYPE
)
10854 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10855 /* The build_method_type_directly() routine prepends 'this' to argument list,
10856 so we must compensate by getting rid of it. */
10858 = build_method_type_directly
10859 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10861 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10863 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10865 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10866 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10871 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10872 TYPE_QUALS (type
));
10875 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10878 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10881 unsigned int bitsize
;
10883 switch (GET_MODE_CLASS (mode
))
10885 case MODE_VECTOR_BOOL
:
10886 case MODE_VECTOR_INT
:
10887 case MODE_VECTOR_FLOAT
:
10888 case MODE_VECTOR_FRACT
:
10889 case MODE_VECTOR_UFRACT
:
10890 case MODE_VECTOR_ACCUM
:
10891 case MODE_VECTOR_UACCUM
:
10892 nunits
= GET_MODE_NUNITS (mode
);
10896 /* Check that there are no leftover bits. */
10897 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10898 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10899 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10903 gcc_unreachable ();
10906 return make_vector_type (innertype
, nunits
, mode
);
10909 /* Similarly, but takes the inner type and number of units, which must be
10913 build_vector_type (tree innertype
, poly_int64 nunits
)
10915 return make_vector_type (innertype
, nunits
, VOIDmode
);
10918 /* Build a truth vector with NUNITS units, giving it mode MASK_MODE. */
10921 build_truth_vector_type_for_mode (poly_uint64 nunits
, machine_mode mask_mode
)
10923 gcc_assert (mask_mode
!= BLKmode
);
10925 poly_uint64 vsize
= GET_MODE_BITSIZE (mask_mode
);
10926 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10927 tree bool_type
= build_nonstandard_boolean_type (esize
);
10929 return make_vector_type (bool_type
, nunits
, mask_mode
);
10932 /* Build a vector type that holds one boolean result for each element of
10933 vector type VECTYPE. The public interface for this operation is
10937 build_truth_vector_type_for (tree vectype
)
10939 machine_mode vector_mode
= TYPE_MODE (vectype
);
10940 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
10942 machine_mode mask_mode
;
10943 if (VECTOR_MODE_P (vector_mode
)
10944 && targetm
.vectorize
.get_mask_mode (vector_mode
).exists (&mask_mode
))
10945 return build_truth_vector_type_for_mode (nunits
, mask_mode
);
10947 poly_uint64 vsize
= tree_to_poly_uint64 (TYPE_SIZE (vectype
));
10948 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10949 tree bool_type
= build_nonstandard_boolean_type (esize
);
10951 return make_vector_type (bool_type
, nunits
, BLKmode
);
10954 /* Like build_vector_type, but builds a variant type with TYPE_VECTOR_OPAQUE
10958 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10960 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10962 /* We always build the non-opaque variant before the opaque one,
10963 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10964 cand
= TYPE_NEXT_VARIANT (t
);
10966 && TYPE_VECTOR_OPAQUE (cand
)
10967 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10969 /* Othewise build a variant type and make sure to queue it after
10970 the non-opaque type. */
10971 cand
= build_distinct_type_copy (t
);
10972 TYPE_VECTOR_OPAQUE (cand
) = true;
10973 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10974 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10975 TYPE_NEXT_VARIANT (t
) = cand
;
10976 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10980 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10983 vector_cst_int_elt (const_tree t
, unsigned int i
)
10985 /* First handle elements that are directly encoded. */
10986 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10987 if (i
< encoded_nelts
)
10988 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10990 /* Identify the pattern that contains element I and work out the index of
10991 the last encoded element for that pattern. */
10992 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10993 unsigned int pattern
= i
% npatterns
;
10994 unsigned int count
= i
/ npatterns
;
10995 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10997 /* If there are no steps, the final encoded value is the right one. */
10998 if (!VECTOR_CST_STEPPED_P (t
))
10999 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
11001 /* Otherwise work out the value from the last two encoded elements. */
11002 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
11003 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
11004 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
11005 return wi::to_wide (v2
) + (count
- 2) * diff
;
11008 /* Return the value of element I of VECTOR_CST T. */
11011 vector_cst_elt (const_tree t
, unsigned int i
)
11013 /* First handle elements that are directly encoded. */
11014 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11015 if (i
< encoded_nelts
)
11016 return VECTOR_CST_ENCODED_ELT (t
, i
);
11018 /* If there are no steps, the final encoded value is the right one. */
11019 if (!VECTOR_CST_STEPPED_P (t
))
11021 /* Identify the pattern that contains element I and work out the index of
11022 the last encoded element for that pattern. */
11023 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11024 unsigned int pattern
= i
% npatterns
;
11025 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11026 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11029 /* Otherwise work out the value from the last two encoded elements. */
11030 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11031 vector_cst_int_elt (t
, i
));
11034 /* Given an initializer INIT, return TRUE if INIT is zero or some
11035 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11036 null, set *NONZERO if and only if INIT is known not to be all
11037 zeros. The combination of return value of false and *NONZERO
11038 false implies that INIT may but need not be all zeros. Other
11039 combinations indicate definitive answers. */
11042 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11048 /* Conservatively clear NONZERO and set it only if INIT is definitely
11054 unsigned HOST_WIDE_INT off
= 0;
11056 switch (TREE_CODE (init
))
11059 if (integer_zerop (init
))
11066 /* ??? Note that this is not correct for C4X float formats. There,
11067 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11068 negative exponent. */
11069 if (real_zerop (init
)
11070 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11077 if (fixed_zerop (init
))
11084 if (integer_zerop (init
)
11085 || (real_zerop (init
)
11086 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11087 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11094 if (VECTOR_CST_NPATTERNS (init
) == 1
11095 && VECTOR_CST_DUPLICATE_P (init
)
11096 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11104 if (TREE_CLOBBER_P (init
))
11107 unsigned HOST_WIDE_INT idx
;
11110 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11111 if (!initializer_zerop (elt
, nonzero
))
11119 tree arg
= TREE_OPERAND (init
, 0);
11120 if (TREE_CODE (arg
) != ADDR_EXPR
)
11122 tree offset
= TREE_OPERAND (init
, 1);
11123 if (TREE_CODE (offset
) != INTEGER_CST
11124 || !tree_fits_uhwi_p (offset
))
11126 off
= tree_to_uhwi (offset
);
11129 arg
= TREE_OPERAND (arg
, 0);
11130 if (TREE_CODE (arg
) != STRING_CST
)
11134 /* Fall through. */
11138 gcc_assert (off
<= INT_MAX
);
11141 int n
= TREE_STRING_LENGTH (init
);
11145 /* We need to loop through all elements to handle cases like
11146 "\0" and "\0foobar". */
11147 for (i
= 0; i
< n
; ++i
)
11148 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11162 /* Return true if EXPR is an initializer expression in which every element
11163 is a constant that is numerically equal to 0 or 1. The elements do not
11164 need to be equal to each other. */
11167 initializer_each_zero_or_onep (const_tree expr
)
11169 STRIP_ANY_LOCATION_WRAPPER (expr
);
11171 switch (TREE_CODE (expr
))
11174 return integer_zerop (expr
) || integer_onep (expr
);
11177 return real_zerop (expr
) || real_onep (expr
);
11181 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11182 if (VECTOR_CST_STEPPED_P (expr
)
11183 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11186 for (unsigned int i
= 0; i
< nelts
; ++i
)
11188 tree elt
= vector_cst_elt (expr
, i
);
11189 if (!initializer_each_zero_or_onep (elt
))
11201 /* Check if vector VEC consists of all the equal elements and
11202 that the number of elements corresponds to the type of VEC.
11203 The function returns first element of the vector
11204 or NULL_TREE if the vector is not uniform. */
11206 uniform_vector_p (const_tree vec
)
11209 unsigned HOST_WIDE_INT i
, nelts
;
11211 if (vec
== NULL_TREE
)
11214 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11216 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11217 return TREE_OPERAND (vec
, 0);
11219 else if (TREE_CODE (vec
) == VECTOR_CST
)
11221 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11222 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11226 else if (TREE_CODE (vec
) == CONSTRUCTOR
11227 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11229 first
= error_mark_node
;
11231 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11238 if (!operand_equal_p (first
, t
, 0))
11250 /* If the argument is INTEGER_CST, return it. If the argument is vector
11251 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11253 Look through location wrappers. */
11256 uniform_integer_cst_p (tree t
)
11258 STRIP_ANY_LOCATION_WRAPPER (t
);
11260 if (TREE_CODE (t
) == INTEGER_CST
)
11263 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11265 t
= uniform_vector_p (t
);
11266 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11273 /* If VECTOR_CST T has a single nonzero element, return the index of that
11274 element, otherwise return -1. */
11277 single_nonzero_element (const_tree t
)
11279 unsigned HOST_WIDE_INT nelts
;
11280 unsigned int repeat_nelts
;
11281 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11282 repeat_nelts
= nelts
;
11283 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11285 nelts
= vector_cst_encoded_nelts (t
);
11286 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11292 for (unsigned int i
= 0; i
< nelts
; ++i
)
11294 tree elt
= vector_cst_elt (t
, i
);
11295 if (!integer_zerop (elt
) && !real_zerop (elt
))
11297 if (res
>= 0 || i
>= repeat_nelts
)
11305 /* Build an empty statement at location LOC. */
11308 build_empty_stmt (location_t loc
)
11310 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11311 SET_EXPR_LOCATION (t
, loc
);
11316 /* Build an OpenMP clause with code CODE. LOC is the location of the
11320 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11325 length
= omp_clause_num_ops
[code
];
11326 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11328 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11330 t
= (tree
) ggc_internal_alloc (size
);
11331 memset (t
, 0, size
);
11332 TREE_SET_CODE (t
, OMP_CLAUSE
);
11333 OMP_CLAUSE_SET_CODE (t
, code
);
11334 OMP_CLAUSE_LOCATION (t
) = loc
;
11339 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11340 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11341 Except for the CODE and operand count field, other storage for the
11342 object is initialized to zeros. */
11345 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11348 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11350 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11351 gcc_assert (len
>= 1);
11353 record_node_allocation_statistics (code
, length
);
11355 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11357 TREE_SET_CODE (t
, code
);
11359 /* Can't use TREE_OPERAND to store the length because if checking is
11360 enabled, it will try to check the length before we store it. :-P */
11361 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11366 /* Helper function for build_call_* functions; build a CALL_EXPR with
11367 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11368 the argument slots. */
11371 build_call_1 (tree return_type
, tree fn
, int nargs
)
11375 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11376 TREE_TYPE (t
) = return_type
;
11377 CALL_EXPR_FN (t
) = fn
;
11378 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11383 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11384 FN and a null static chain slot. NARGS is the number of call arguments
11385 which are specified as "..." arguments. */
11388 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11392 va_start (args
, nargs
);
11393 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11398 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11399 FN and a null static chain slot. NARGS is the number of call arguments
11400 which are specified as a va_list ARGS. */
11403 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11408 t
= build_call_1 (return_type
, fn
, nargs
);
11409 for (i
= 0; i
< nargs
; i
++)
11410 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11411 process_call_operands (t
);
11415 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11416 FN and a null static chain slot. NARGS is the number of call arguments
11417 which are specified as a tree array ARGS. */
11420 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11421 int nargs
, const tree
*args
)
11426 t
= build_call_1 (return_type
, fn
, nargs
);
11427 for (i
= 0; i
< nargs
; i
++)
11428 CALL_EXPR_ARG (t
, i
) = args
[i
];
11429 process_call_operands (t
);
11430 SET_EXPR_LOCATION (t
, loc
);
11434 /* Like build_call_array, but takes a vec. */
11437 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11442 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11443 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11444 CALL_EXPR_ARG (ret
, ix
) = t
;
11445 process_call_operands (ret
);
11449 /* Conveniently construct a function call expression. FNDECL names the
11450 function to be called and N arguments are passed in the array
11454 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11456 tree fntype
= TREE_TYPE (fndecl
);
11457 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11459 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11462 /* Conveniently construct a function call expression. FNDECL names the
11463 function to be called and the arguments are passed in the vector
11467 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11469 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11470 vec_safe_address (vec
));
11474 /* Conveniently construct a function call expression. FNDECL names the
11475 function to be called, N is the number of arguments, and the "..."
11476 parameters are the argument expressions. */
11479 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11482 tree
*argarray
= XALLOCAVEC (tree
, n
);
11486 for (i
= 0; i
< n
; i
++)
11487 argarray
[i
] = va_arg (ap
, tree
);
11489 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11492 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11493 varargs macros aren't supported by all bootstrap compilers. */
11496 build_call_expr (tree fndecl
, int n
, ...)
11499 tree
*argarray
= XALLOCAVEC (tree
, n
);
11503 for (i
= 0; i
< n
; i
++)
11504 argarray
[i
] = va_arg (ap
, tree
);
11506 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11509 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11510 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11511 It will get gimplified later into an ordinary internal function. */
11514 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11515 tree type
, int n
, const tree
*args
)
11517 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11518 for (int i
= 0; i
< n
; ++i
)
11519 CALL_EXPR_ARG (t
, i
) = args
[i
];
11520 SET_EXPR_LOCATION (t
, loc
);
11521 CALL_EXPR_IFN (t
) = ifn
;
11525 /* Build internal call expression. This is just like CALL_EXPR, except
11526 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11527 internal function. */
11530 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11531 tree type
, int n
, ...)
11534 tree
*argarray
= XALLOCAVEC (tree
, n
);
11538 for (i
= 0; i
< n
; i
++)
11539 argarray
[i
] = va_arg (ap
, tree
);
11541 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11544 /* Return a function call to FN, if the target is guaranteed to support it,
11547 N is the number of arguments, passed in the "...", and TYPE is the
11548 type of the return value. */
11551 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11555 tree
*argarray
= XALLOCAVEC (tree
, n
);
11559 for (i
= 0; i
< n
; i
++)
11560 argarray
[i
] = va_arg (ap
, tree
);
11562 if (internal_fn_p (fn
))
11564 internal_fn ifn
= as_internal_fn (fn
);
11565 if (direct_internal_fn_p (ifn
))
11567 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11568 if (!direct_internal_fn_supported_p (ifn
, types
,
11569 OPTIMIZE_FOR_BOTH
))
11572 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11576 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11579 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11583 /* Return a function call to the appropriate builtin alloca variant.
11585 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11586 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11587 bound for SIZE in case it is not a fixed value. */
11590 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11594 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11596 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11598 else if (align
> 0)
11600 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11601 return build_call_expr (t
, 2, size
, size_int (align
));
11605 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11606 return build_call_expr (t
, 1, size
);
11610 /* Create a new constant string literal of type ELTYPE[SIZE] (or LEN
11611 if SIZE == -1) and return a tree node representing char* pointer to
11612 it as an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value
11613 is the LEN bytes at STR (the representation of the string, which may
11617 build_string_literal (int len
, const char *str
,
11618 tree eltype
/* = char_type_node */,
11619 unsigned HOST_WIDE_INT size
/* = -1 */)
11621 tree t
= build_string (len
, str
);
11622 /* Set the maximum valid index based on the string length or SIZE. */
11623 unsigned HOST_WIDE_INT maxidx
11624 = (size
== HOST_WIDE_INT_M1U
? len
: size
) - 1;
11626 tree index
= build_index_type (size_int (maxidx
));
11627 eltype
= build_type_variant (eltype
, 1, 0);
11628 tree type
= build_array_type (eltype
, index
);
11629 TREE_TYPE (t
) = type
;
11630 TREE_CONSTANT (t
) = 1;
11631 TREE_READONLY (t
) = 1;
11632 TREE_STATIC (t
) = 1;
11634 type
= build_pointer_type (eltype
);
11635 t
= build1 (ADDR_EXPR
, type
,
11636 build4 (ARRAY_REF
, eltype
,
11637 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11643 /* Return true if T (assumed to be a DECL) must be assigned a memory
11647 needs_to_live_in_memory (const_tree t
)
11649 return (TREE_ADDRESSABLE (t
)
11650 || is_global_var (t
)
11651 || (TREE_CODE (t
) == RESULT_DECL
11652 && !DECL_BY_REFERENCE (t
)
11653 && aggregate_value_p (t
, current_function_decl
)));
11656 /* Return value of a constant X and sign-extend it. */
11659 int_cst_value (const_tree x
)
11661 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11662 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11664 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11665 gcc_assert (cst_and_fits_in_hwi (x
));
11667 if (bits
< HOST_BITS_PER_WIDE_INT
)
11669 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11671 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11673 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11679 /* If TYPE is an integral or pointer type, return an integer type with
11680 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11681 if TYPE is already an integer type of signedness UNSIGNEDP.
11682 If TYPE is a floating-point type, return an integer type with the same
11683 bitsize and with the signedness given by UNSIGNEDP; this is useful
11684 when doing bit-level operations on a floating-point value. */
11687 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11689 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11692 if (TREE_CODE (type
) == VECTOR_TYPE
)
11694 tree inner
= TREE_TYPE (type
);
11695 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11698 if (inner
== inner2
)
11700 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11703 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11705 tree inner
= TREE_TYPE (type
);
11706 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11709 if (inner
== inner2
)
11711 return build_complex_type (inner2
);
11715 if (INTEGRAL_TYPE_P (type
)
11716 || POINTER_TYPE_P (type
)
11717 || TREE_CODE (type
) == OFFSET_TYPE
)
11718 bits
= TYPE_PRECISION (type
);
11719 else if (TREE_CODE (type
) == REAL_TYPE
)
11720 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11724 return build_nonstandard_integer_type (bits
, unsignedp
);
11727 /* If TYPE is an integral or pointer type, return an integer type with
11728 the same precision which is unsigned, or itself if TYPE is already an
11729 unsigned integer type. If TYPE is a floating-point type, return an
11730 unsigned integer type with the same bitsize as TYPE. */
11733 unsigned_type_for (tree type
)
11735 return signed_or_unsigned_type_for (1, type
);
11738 /* If TYPE is an integral or pointer type, return an integer type with
11739 the same precision which is signed, or itself if TYPE is already a
11740 signed integer type. If TYPE is a floating-point type, return a
11741 signed integer type with the same bitsize as TYPE. */
11744 signed_type_for (tree type
)
11746 return signed_or_unsigned_type_for (0, type
);
11749 /* If TYPE is a vector type, return a signed integer vector type with the
11750 same width and number of subparts. Otherwise return boolean_type_node. */
11753 truth_type_for (tree type
)
11755 if (TREE_CODE (type
) == VECTOR_TYPE
)
11757 if (VECTOR_BOOLEAN_TYPE_P (type
))
11759 return build_truth_vector_type_for (type
);
11762 return boolean_type_node
;
11765 /* Returns the largest value obtainable by casting something in INNER type to
11769 upper_bound_in_type (tree outer
, tree inner
)
11771 unsigned int det
= 0;
11772 unsigned oprec
= TYPE_PRECISION (outer
);
11773 unsigned iprec
= TYPE_PRECISION (inner
);
11776 /* Compute a unique number for every combination. */
11777 det
|= (oprec
> iprec
) ? 4 : 0;
11778 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11779 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11781 /* Determine the exponent to use. */
11786 /* oprec <= iprec, outer: signed, inner: don't care. */
11791 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11795 /* oprec > iprec, outer: signed, inner: signed. */
11799 /* oprec > iprec, outer: signed, inner: unsigned. */
11803 /* oprec > iprec, outer: unsigned, inner: signed. */
11807 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11811 gcc_unreachable ();
11814 return wide_int_to_tree (outer
,
11815 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11818 /* Returns the smallest value obtainable by casting something in INNER type to
11822 lower_bound_in_type (tree outer
, tree inner
)
11824 unsigned oprec
= TYPE_PRECISION (outer
);
11825 unsigned iprec
= TYPE_PRECISION (inner
);
11827 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11829 if (TYPE_UNSIGNED (outer
)
11830 /* If we are widening something of an unsigned type, OUTER type
11831 contains all values of INNER type. In particular, both INNER
11832 and OUTER types have zero in common. */
11833 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11834 return build_int_cst (outer
, 0);
11837 /* If we are widening a signed type to another signed type, we
11838 want to obtain -2^^(iprec-1). If we are keeping the
11839 precision or narrowing to a signed type, we want to obtain
11841 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11842 return wide_int_to_tree (outer
,
11843 wi::mask (prec
- 1, true,
11844 TYPE_PRECISION (outer
)));
11848 /* Return nonzero if two operands that are suitable for PHI nodes are
11849 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11850 SSA_NAME or invariant. Note that this is strictly an optimization.
11851 That is, callers of this function can directly call operand_equal_p
11852 and get the same result, only slower. */
11855 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11859 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11861 return operand_equal_p (arg0
, arg1
, 0);
11864 /* Returns number of zeros at the end of binary representation of X. */
11867 num_ending_zeros (const_tree x
)
11869 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11873 #define WALK_SUBTREE(NODE) \
11876 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11882 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11883 be walked whenever a type is seen in the tree. Rest of operands and return
11884 value are as for walk_tree. */
11887 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11888 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11890 tree result
= NULL_TREE
;
11892 switch (TREE_CODE (type
))
11895 case REFERENCE_TYPE
:
11897 /* We have to worry about mutually recursive pointers. These can't
11898 be written in C. They can in Ada. It's pathological, but
11899 there's an ACATS test (c38102a) that checks it. Deal with this
11900 by checking if we're pointing to another pointer, that one
11901 points to another pointer, that one does too, and we have no htab.
11902 If so, get a hash table. We check three levels deep to avoid
11903 the cost of the hash table if we don't need one. */
11904 if (POINTER_TYPE_P (TREE_TYPE (type
))
11905 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11906 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11909 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11920 WALK_SUBTREE (TREE_TYPE (type
));
11924 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11926 /* Fall through. */
11928 case FUNCTION_TYPE
:
11929 WALK_SUBTREE (TREE_TYPE (type
));
11933 /* We never want to walk into default arguments. */
11934 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11935 WALK_SUBTREE (TREE_VALUE (arg
));
11940 /* Don't follow this nodes's type if a pointer for fear that
11941 we'll have infinite recursion. If we have a PSET, then we
11944 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11945 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11946 WALK_SUBTREE (TREE_TYPE (type
));
11947 WALK_SUBTREE (TYPE_DOMAIN (type
));
11951 WALK_SUBTREE (TREE_TYPE (type
));
11952 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11962 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11963 called with the DATA and the address of each sub-tree. If FUNC returns a
11964 non-NULL value, the traversal is stopped, and the value returned by FUNC
11965 is returned. If PSET is non-NULL it is used to record the nodes visited,
11966 and to avoid visiting a node more than once. */
11969 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11970 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11972 enum tree_code code
;
11976 #define WALK_SUBTREE_TAIL(NODE) \
11980 goto tail_recurse; \
11985 /* Skip empty subtrees. */
11989 /* Don't walk the same tree twice, if the user has requested
11990 that we avoid doing so. */
11991 if (pset
&& pset
->add (*tp
))
11994 /* Call the function. */
11996 result
= (*func
) (tp
, &walk_subtrees
, data
);
11998 /* If we found something, return it. */
12002 code
= TREE_CODE (*tp
);
12004 /* Even if we didn't, FUNC may have decided that there was nothing
12005 interesting below this point in the tree. */
12006 if (!walk_subtrees
)
12008 /* But we still need to check our siblings. */
12009 if (code
== TREE_LIST
)
12010 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12011 else if (code
== OMP_CLAUSE
)
12012 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12019 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12020 if (result
|| !walk_subtrees
)
12027 case IDENTIFIER_NODE
:
12034 case PLACEHOLDER_EXPR
:
12038 /* None of these have subtrees other than those already walked
12043 WALK_SUBTREE (TREE_VALUE (*tp
));
12044 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12049 int len
= TREE_VEC_LENGTH (*tp
);
12054 /* Walk all elements but the first. */
12056 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12058 /* Now walk the first one as a tail call. */
12059 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12063 WALK_SUBTREE (TREE_REALPART (*tp
));
12064 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12068 unsigned HOST_WIDE_INT idx
;
12069 constructor_elt
*ce
;
12071 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12073 WALK_SUBTREE (ce
->value
);
12078 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12083 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12085 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12086 into declarations that are just mentioned, rather than
12087 declared; they don't really belong to this part of the tree.
12088 And, we can see cycles: the initializer for a declaration
12089 can refer to the declaration itself. */
12090 WALK_SUBTREE (DECL_INITIAL (decl
));
12091 WALK_SUBTREE (DECL_SIZE (decl
));
12092 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12094 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12097 case STATEMENT_LIST
:
12099 tree_stmt_iterator i
;
12100 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12101 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12106 switch (OMP_CLAUSE_CODE (*tp
))
12108 case OMP_CLAUSE_GANG
:
12109 case OMP_CLAUSE__GRIDDIM_
:
12110 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12113 case OMP_CLAUSE_ASYNC
:
12114 case OMP_CLAUSE_WAIT
:
12115 case OMP_CLAUSE_WORKER
:
12116 case OMP_CLAUSE_VECTOR
:
12117 case OMP_CLAUSE_NUM_GANGS
:
12118 case OMP_CLAUSE_NUM_WORKERS
:
12119 case OMP_CLAUSE_VECTOR_LENGTH
:
12120 case OMP_CLAUSE_PRIVATE
:
12121 case OMP_CLAUSE_SHARED
:
12122 case OMP_CLAUSE_FIRSTPRIVATE
:
12123 case OMP_CLAUSE_COPYIN
:
12124 case OMP_CLAUSE_COPYPRIVATE
:
12125 case OMP_CLAUSE_FINAL
:
12126 case OMP_CLAUSE_IF
:
12127 case OMP_CLAUSE_NUM_THREADS
:
12128 case OMP_CLAUSE_SCHEDULE
:
12129 case OMP_CLAUSE_UNIFORM
:
12130 case OMP_CLAUSE_DEPEND
:
12131 case OMP_CLAUSE_NONTEMPORAL
:
12132 case OMP_CLAUSE_NUM_TEAMS
:
12133 case OMP_CLAUSE_THREAD_LIMIT
:
12134 case OMP_CLAUSE_DEVICE
:
12135 case OMP_CLAUSE_DIST_SCHEDULE
:
12136 case OMP_CLAUSE_SAFELEN
:
12137 case OMP_CLAUSE_SIMDLEN
:
12138 case OMP_CLAUSE_ORDERED
:
12139 case OMP_CLAUSE_PRIORITY
:
12140 case OMP_CLAUSE_GRAINSIZE
:
12141 case OMP_CLAUSE_NUM_TASKS
:
12142 case OMP_CLAUSE_HINT
:
12143 case OMP_CLAUSE_TO_DECLARE
:
12144 case OMP_CLAUSE_LINK
:
12145 case OMP_CLAUSE_USE_DEVICE_PTR
:
12146 case OMP_CLAUSE_USE_DEVICE_ADDR
:
12147 case OMP_CLAUSE_IS_DEVICE_PTR
:
12148 case OMP_CLAUSE_INCLUSIVE
:
12149 case OMP_CLAUSE_EXCLUSIVE
:
12150 case OMP_CLAUSE__LOOPTEMP_
:
12151 case OMP_CLAUSE__REDUCTEMP_
:
12152 case OMP_CLAUSE__CONDTEMP_
:
12153 case OMP_CLAUSE__SCANTEMP_
:
12154 case OMP_CLAUSE__SIMDUID_
:
12155 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12158 case OMP_CLAUSE_INDEPENDENT
:
12159 case OMP_CLAUSE_NOWAIT
:
12160 case OMP_CLAUSE_DEFAULT
:
12161 case OMP_CLAUSE_UNTIED
:
12162 case OMP_CLAUSE_MERGEABLE
:
12163 case OMP_CLAUSE_PROC_BIND
:
12164 case OMP_CLAUSE_DEVICE_TYPE
:
12165 case OMP_CLAUSE_INBRANCH
:
12166 case OMP_CLAUSE_NOTINBRANCH
:
12167 case OMP_CLAUSE_FOR
:
12168 case OMP_CLAUSE_PARALLEL
:
12169 case OMP_CLAUSE_SECTIONS
:
12170 case OMP_CLAUSE_TASKGROUP
:
12171 case OMP_CLAUSE_NOGROUP
:
12172 case OMP_CLAUSE_THREADS
:
12173 case OMP_CLAUSE_SIMD
:
12174 case OMP_CLAUSE_DEFAULTMAP
:
12175 case OMP_CLAUSE_ORDER
:
12176 case OMP_CLAUSE_BIND
:
12177 case OMP_CLAUSE_AUTO
:
12178 case OMP_CLAUSE_SEQ
:
12179 case OMP_CLAUSE_TILE
:
12180 case OMP_CLAUSE__SIMT_
:
12181 case OMP_CLAUSE_IF_PRESENT
:
12182 case OMP_CLAUSE_FINALIZE
:
12183 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12185 case OMP_CLAUSE_LASTPRIVATE
:
12186 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12187 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12188 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12190 case OMP_CLAUSE_COLLAPSE
:
12193 for (i
= 0; i
< 3; i
++)
12194 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12195 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12198 case OMP_CLAUSE_LINEAR
:
12199 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12200 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12201 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12202 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12204 case OMP_CLAUSE_ALIGNED
:
12205 case OMP_CLAUSE_FROM
:
12206 case OMP_CLAUSE_TO
:
12207 case OMP_CLAUSE_MAP
:
12208 case OMP_CLAUSE__CACHE_
:
12209 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12210 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12211 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12213 case OMP_CLAUSE_REDUCTION
:
12214 case OMP_CLAUSE_TASK_REDUCTION
:
12215 case OMP_CLAUSE_IN_REDUCTION
:
12218 for (i
= 0; i
< 5; i
++)
12219 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12220 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12224 gcc_unreachable ();
12232 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12233 But, we only want to walk once. */
12234 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12235 for (i
= 0; i
< len
; ++i
)
12236 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12237 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12241 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12242 defining. We only want to walk into these fields of a type in this
12243 case and not in the general case of a mere reference to the type.
12245 The criterion is as follows: if the field can be an expression, it
12246 must be walked only here. This should be in keeping with the fields
12247 that are directly gimplified in gimplify_type_sizes in order for the
12248 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12249 variable-sized types.
12251 Note that DECLs get walked as part of processing the BIND_EXPR. */
12252 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12254 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12255 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12258 /* Call the function for the type. See if it returns anything or
12259 doesn't want us to continue. If we are to continue, walk both
12260 the normal fields and those for the declaration case. */
12261 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12262 if (result
|| !walk_subtrees
)
12265 /* But do not walk a pointed-to type since it may itself need to
12266 be walked in the declaration case if it isn't anonymous. */
12267 if (!POINTER_TYPE_P (*type_p
))
12269 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12274 /* If this is a record type, also walk the fields. */
12275 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12279 for (field
= TYPE_FIELDS (*type_p
); field
;
12280 field
= DECL_CHAIN (field
))
12282 /* We'd like to look at the type of the field, but we can
12283 easily get infinite recursion. So assume it's pointed
12284 to elsewhere in the tree. Also, ignore things that
12286 if (TREE_CODE (field
) != FIELD_DECL
)
12289 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12290 WALK_SUBTREE (DECL_SIZE (field
));
12291 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12292 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12293 WALK_SUBTREE (DECL_QUALIFIER (field
));
12297 /* Same for scalar types. */
12298 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12299 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12300 || TREE_CODE (*type_p
) == INTEGER_TYPE
12301 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12302 || TREE_CODE (*type_p
) == REAL_TYPE
)
12304 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12305 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12308 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12309 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12314 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12318 /* Walk over all the sub-trees of this operand. */
12319 len
= TREE_OPERAND_LENGTH (*tp
);
12321 /* Go through the subtrees. We need to do this in forward order so
12322 that the scope of a FOR_EXPR is handled properly. */
12325 for (i
= 0; i
< len
- 1; ++i
)
12326 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12327 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12330 /* If this is a type, walk the needed fields in the type. */
12331 else if (TYPE_P (*tp
))
12332 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12336 /* We didn't find what we were looking for. */
12339 #undef WALK_SUBTREE_TAIL
12341 #undef WALK_SUBTREE
12343 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12346 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12351 hash_set
<tree
> pset
;
12352 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12358 tree_block (tree t
)
12360 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12362 if (IS_EXPR_CODE_CLASS (c
))
12363 return LOCATION_BLOCK (t
->exp
.locus
);
12364 gcc_unreachable ();
12369 tree_set_block (tree t
, tree b
)
12371 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12373 if (IS_EXPR_CODE_CLASS (c
))
12375 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12378 gcc_unreachable ();
12381 /* Create a nameless artificial label and put it in the current
12382 function context. The label has a location of LOC. Returns the
12383 newly created label. */
12386 create_artificial_label (location_t loc
)
12388 tree lab
= build_decl (loc
,
12389 LABEL_DECL
, NULL_TREE
, void_type_node
);
12391 DECL_ARTIFICIAL (lab
) = 1;
12392 DECL_IGNORED_P (lab
) = 1;
12393 DECL_CONTEXT (lab
) = current_function_decl
;
12397 /* Given a tree, try to return a useful variable name that we can use
12398 to prefix a temporary that is being assigned the value of the tree.
12399 I.E. given <temp> = &A, return A. */
12404 tree stripped_decl
;
12407 STRIP_NOPS (stripped_decl
);
12408 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12409 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12410 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12412 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12415 return IDENTIFIER_POINTER (name
);
12419 switch (TREE_CODE (stripped_decl
))
12422 return get_name (TREE_OPERAND (stripped_decl
, 0));
12429 /* Return true if TYPE has a variable argument list. */
12432 stdarg_p (const_tree fntype
)
12434 function_args_iterator args_iter
;
12435 tree n
= NULL_TREE
, t
;
12440 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12445 return n
!= NULL_TREE
&& n
!= void_type_node
;
12448 /* Return true if TYPE has a prototype. */
12451 prototype_p (const_tree fntype
)
12455 gcc_assert (fntype
!= NULL_TREE
);
12457 t
= TYPE_ARG_TYPES (fntype
);
12458 return (t
!= NULL_TREE
);
12461 /* If BLOCK is inlined from an __attribute__((__artificial__))
12462 routine, return pointer to location from where it has been
12465 block_nonartificial_location (tree block
)
12467 location_t
*ret
= NULL
;
12469 while (block
&& TREE_CODE (block
) == BLOCK
12470 && BLOCK_ABSTRACT_ORIGIN (block
))
12472 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12473 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12475 /* If AO is an artificial inline, point RET to the
12476 call site locus at which it has been inlined and continue
12477 the loop, in case AO's caller is also an artificial
12479 if (DECL_DECLARED_INLINE_P (ao
)
12480 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12481 ret
= &BLOCK_SOURCE_LOCATION (block
);
12485 else if (TREE_CODE (ao
) != BLOCK
)
12488 block
= BLOCK_SUPERCONTEXT (block
);
12494 /* If EXP is inlined from an __attribute__((__artificial__))
12495 function, return the location of the original call expression. */
12498 tree_nonartificial_location (tree exp
)
12500 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12505 return EXPR_LOCATION (exp
);
12509 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12512 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12515 cl_option_hasher::hash (tree x
)
12517 const_tree
const t
= x
;
12521 hashval_t hash
= 0;
12523 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12525 p
= (const char *)TREE_OPTIMIZATION (t
);
12526 len
= sizeof (struct cl_optimization
);
12529 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12530 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12533 gcc_unreachable ();
12535 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12537 for (i
= 0; i
< len
; i
++)
12539 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12544 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12545 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12549 cl_option_hasher::equal (tree x
, tree y
)
12551 const_tree
const xt
= x
;
12552 const_tree
const yt
= y
;
12554 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12557 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12558 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12559 TREE_OPTIMIZATION (yt
));
12560 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12561 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12562 TREE_TARGET_OPTION (yt
));
12564 gcc_unreachable ();
12567 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12570 build_optimization_node (struct gcc_options
*opts
)
12574 /* Use the cache of optimization nodes. */
12576 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12579 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12583 /* Insert this one into the hash table. */
12584 t
= cl_optimization_node
;
12587 /* Make a new node for next time round. */
12588 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12594 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12597 build_target_option_node (struct gcc_options
*opts
)
12601 /* Use the cache of optimization nodes. */
12603 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12606 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12610 /* Insert this one into the hash table. */
12611 t
= cl_target_option_node
;
12614 /* Make a new node for next time round. */
12615 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12621 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12622 so that they aren't saved during PCH writing. */
12625 prepare_target_option_nodes_for_pch (void)
12627 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12628 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12629 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12630 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12633 /* Determine the "ultimate origin" of a block. */
12636 block_ultimate_origin (const_tree block
)
12638 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12640 if (origin
== NULL_TREE
)
12644 gcc_checking_assert ((DECL_P (origin
)
12645 && DECL_ORIGIN (origin
) == origin
)
12646 || BLOCK_ORIGIN (origin
) == origin
);
12651 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12655 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12657 /* Do not strip casts into or out of differing address spaces. */
12658 if (POINTER_TYPE_P (outer_type
)
12659 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12661 if (!POINTER_TYPE_P (inner_type
)
12662 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12663 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12666 else if (POINTER_TYPE_P (inner_type
)
12667 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12669 /* We already know that outer_type is not a pointer with
12670 a non-generic address space. */
12674 /* Use precision rather then machine mode when we can, which gives
12675 the correct answer even for submode (bit-field) types. */
12676 if ((INTEGRAL_TYPE_P (outer_type
)
12677 || POINTER_TYPE_P (outer_type
)
12678 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12679 && (INTEGRAL_TYPE_P (inner_type
)
12680 || POINTER_TYPE_P (inner_type
)
12681 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12682 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12684 /* Otherwise fall back on comparing machine modes (e.g. for
12685 aggregate types, floats). */
12686 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12689 /* Return true iff conversion in EXP generates no instruction. Mark
12690 it inline so that we fully inline into the stripping functions even
12691 though we have two uses of this function. */
12694 tree_nop_conversion (const_tree exp
)
12696 tree outer_type
, inner_type
;
12698 if (location_wrapper_p (exp
))
12700 if (!CONVERT_EXPR_P (exp
)
12701 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12704 outer_type
= TREE_TYPE (exp
);
12705 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12706 if (!inner_type
|| inner_type
== error_mark_node
)
12709 return tree_nop_conversion_p (outer_type
, inner_type
);
12712 /* Return true iff conversion in EXP generates no instruction. Don't
12713 consider conversions changing the signedness. */
12716 tree_sign_nop_conversion (const_tree exp
)
12718 tree outer_type
, inner_type
;
12720 if (!tree_nop_conversion (exp
))
12723 outer_type
= TREE_TYPE (exp
);
12724 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12726 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12727 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12730 /* Strip conversions from EXP according to tree_nop_conversion and
12731 return the resulting expression. */
12734 tree_strip_nop_conversions (tree exp
)
12736 while (tree_nop_conversion (exp
))
12737 exp
= TREE_OPERAND (exp
, 0);
12741 /* Strip conversions from EXP according to tree_sign_nop_conversion
12742 and return the resulting expression. */
12745 tree_strip_sign_nop_conversions (tree exp
)
12747 while (tree_sign_nop_conversion (exp
))
12748 exp
= TREE_OPERAND (exp
, 0);
12752 /* Avoid any floating point extensions from EXP. */
12754 strip_float_extensions (tree exp
)
12756 tree sub
, expt
, subt
;
12758 /* For floating point constant look up the narrowest type that can hold
12759 it properly and handle it like (type)(narrowest_type)constant.
12760 This way we can optimize for instance a=a*2.0 where "a" is float
12761 but 2.0 is double constant. */
12762 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12764 REAL_VALUE_TYPE orig
;
12767 orig
= TREE_REAL_CST (exp
);
12768 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12769 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12770 type
= float_type_node
;
12771 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12772 > TYPE_PRECISION (double_type_node
)
12773 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12774 type
= double_type_node
;
12776 return build_real_truncate (type
, orig
);
12779 if (!CONVERT_EXPR_P (exp
))
12782 sub
= TREE_OPERAND (exp
, 0);
12783 subt
= TREE_TYPE (sub
);
12784 expt
= TREE_TYPE (exp
);
12786 if (!FLOAT_TYPE_P (subt
))
12789 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12792 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12795 return strip_float_extensions (sub
);
12798 /* Strip out all handled components that produce invariant
12802 strip_invariant_refs (const_tree op
)
12804 while (handled_component_p (op
))
12806 switch (TREE_CODE (op
))
12809 case ARRAY_RANGE_REF
:
12810 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12811 || TREE_OPERAND (op
, 2) != NULL_TREE
12812 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12816 case COMPONENT_REF
:
12817 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12823 op
= TREE_OPERAND (op
, 0);
12829 static GTY(()) tree gcc_eh_personality_decl
;
12831 /* Return the GCC personality function decl. */
12834 lhd_gcc_personality (void)
12836 if (!gcc_eh_personality_decl
)
12837 gcc_eh_personality_decl
= build_personality_function ("gcc");
12838 return gcc_eh_personality_decl
;
12841 /* TARGET is a call target of GIMPLE call statement
12842 (obtained by gimple_call_fn). Return true if it is
12843 OBJ_TYPE_REF representing an virtual call of C++ method.
12844 (As opposed to OBJ_TYPE_REF representing objc calls
12845 through a cast where middle-end devirtualization machinery
12849 virtual_method_call_p (const_tree target
)
12851 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12853 tree t
= TREE_TYPE (target
);
12854 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12856 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12858 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12859 /* If we do not have BINFO associated, it means that type was built
12860 without devirtualization enabled. Do not consider this a virtual
12862 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12867 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12870 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12873 tree base_binfo
, b
;
12875 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12876 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12877 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12879 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12884 /* Try to find a base info of BINFO that would have its field decl at offset
12885 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12886 found, return, otherwise return NULL_TREE. */
12889 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12891 tree type
= BINFO_TYPE (binfo
);
12895 HOST_WIDE_INT pos
, size
;
12899 if (types_same_for_odr (type
, expected_type
))
12901 if (maybe_lt (offset
, 0))
12904 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12906 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12909 pos
= int_bit_position (fld
);
12910 size
= tree_to_uhwi (DECL_SIZE (fld
));
12911 if (known_in_range_p (offset
, pos
, size
))
12914 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12917 /* Offset 0 indicates the primary base, whose vtable contents are
12918 represented in the binfo for the derived class. */
12919 else if (maybe_ne (offset
, 0))
12921 tree found_binfo
= NULL
, base_binfo
;
12922 /* Offsets in BINFO are in bytes relative to the whole structure
12923 while POS is in bits relative to the containing field. */
12924 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12927 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12928 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12929 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12931 found_binfo
= base_binfo
;
12935 binfo
= found_binfo
;
12937 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12941 type
= TREE_TYPE (fld
);
12946 /* Returns true if X is a typedef decl. */
12949 is_typedef_decl (const_tree x
)
12951 return (x
&& TREE_CODE (x
) == TYPE_DECL
12952 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12955 /* Returns true iff TYPE is a type variant created for a typedef. */
12958 typedef_variant_p (const_tree type
)
12960 return is_typedef_decl (TYPE_NAME (type
));
12963 /* PR 84195: Replace control characters in "unescaped" with their
12964 escaped equivalents. Allow newlines if -fmessage-length has
12965 been set to a non-zero value. This is done here, rather than
12966 where the attribute is recorded as the message length can
12967 change between these two locations. */
12970 escaped_string::escape (const char *unescaped
)
12973 size_t i
, new_i
, len
;
12978 m_str
= const_cast<char *> (unescaped
);
12981 if (unescaped
== NULL
|| *unescaped
== 0)
12984 len
= strlen (unescaped
);
12988 for (i
= 0; i
< len
; i
++)
12990 char c
= unescaped
[i
];
12995 escaped
[new_i
++] = c
;
12999 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13001 if (escaped
== NULL
)
13003 /* We only allocate space for a new string if we
13004 actually encounter a control character that
13005 needs replacing. */
13006 escaped
= (char *) xmalloc (len
* 2 + 1);
13007 strncpy (escaped
, unescaped
, i
);
13011 escaped
[new_i
++] = '\\';
13015 case '\a': escaped
[new_i
++] = 'a'; break;
13016 case '\b': escaped
[new_i
++] = 'b'; break;
13017 case '\f': escaped
[new_i
++] = 'f'; break;
13018 case '\n': escaped
[new_i
++] = 'n'; break;
13019 case '\r': escaped
[new_i
++] = 'r'; break;
13020 case '\t': escaped
[new_i
++] = 't'; break;
13021 case '\v': escaped
[new_i
++] = 'v'; break;
13022 default: escaped
[new_i
++] = '?'; break;
13026 escaped
[new_i
++] = c
;
13031 escaped
[new_i
] = 0;
13037 /* Warn about a use of an identifier which was marked deprecated. Returns
13038 whether a warning was given. */
13041 warn_deprecated_use (tree node
, tree attr
)
13043 escaped_string msg
;
13045 if (node
== 0 || !warn_deprecated_decl
)
13051 attr
= DECL_ATTRIBUTES (node
);
13052 else if (TYPE_P (node
))
13054 tree decl
= TYPE_STUB_DECL (node
);
13056 attr
= lookup_attribute ("deprecated",
13057 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13062 attr
= lookup_attribute ("deprecated", attr
);
13065 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13070 auto_diagnostic_group d
;
13072 w
= warning (OPT_Wdeprecated_declarations
,
13073 "%qD is deprecated: %s", node
, (const char *) msg
);
13075 w
= warning (OPT_Wdeprecated_declarations
,
13076 "%qD is deprecated", node
);
13078 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13080 else if (TYPE_P (node
))
13082 tree what
= NULL_TREE
;
13083 tree decl
= TYPE_STUB_DECL (node
);
13085 if (TYPE_NAME (node
))
13087 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13088 what
= TYPE_NAME (node
);
13089 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13090 && DECL_NAME (TYPE_NAME (node
)))
13091 what
= DECL_NAME (TYPE_NAME (node
));
13094 auto_diagnostic_group d
;
13098 w
= warning (OPT_Wdeprecated_declarations
,
13099 "%qE is deprecated: %s", what
, (const char *) msg
);
13101 w
= warning (OPT_Wdeprecated_declarations
,
13102 "%qE is deprecated", what
);
13107 w
= warning (OPT_Wdeprecated_declarations
,
13108 "type is deprecated: %s", (const char *) msg
);
13110 w
= warning (OPT_Wdeprecated_declarations
,
13111 "type is deprecated");
13115 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13121 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13122 somewhere in it. */
13125 contains_bitfld_component_ref_p (const_tree ref
)
13127 while (handled_component_p (ref
))
13129 if (TREE_CODE (ref
) == COMPONENT_REF
13130 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13132 ref
= TREE_OPERAND (ref
, 0);
13138 /* Try to determine whether a TRY_CATCH expression can fall through.
13139 This is a subroutine of block_may_fallthru. */
13142 try_catch_may_fallthru (const_tree stmt
)
13144 tree_stmt_iterator i
;
13146 /* If the TRY block can fall through, the whole TRY_CATCH can
13148 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13151 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13152 switch (TREE_CODE (tsi_stmt (i
)))
13155 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13156 catch expression and a body. The whole TRY_CATCH may fall
13157 through iff any of the catch bodies falls through. */
13158 for (; !tsi_end_p (i
); tsi_next (&i
))
13160 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13165 case EH_FILTER_EXPR
:
13166 /* The exception filter expression only matters if there is an
13167 exception. If the exception does not match EH_FILTER_TYPES,
13168 we will execute EH_FILTER_FAILURE, and we will fall through
13169 if that falls through. If the exception does match
13170 EH_FILTER_TYPES, the stack unwinder will continue up the
13171 stack, so we will not fall through. We don't know whether we
13172 will throw an exception which matches EH_FILTER_TYPES or not,
13173 so we just ignore EH_FILTER_TYPES and assume that we might
13174 throw an exception which doesn't match. */
13175 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13178 /* This case represents statements to be executed when an
13179 exception occurs. Those statements are implicitly followed
13180 by a RESX statement to resume execution after the exception.
13181 So in this case the TRY_CATCH never falls through. */
13186 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13187 need not be 100% accurate; simply be conservative and return true if we
13188 don't know. This is used only to avoid stupidly generating extra code.
13189 If we're wrong, we'll just delete the extra code later. */
13192 block_may_fallthru (const_tree block
)
13194 /* This CONST_CAST is okay because expr_last returns its argument
13195 unmodified and we assign it to a const_tree. */
13196 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13198 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13202 /* Easy cases. If the last statement of the block implies
13203 control transfer, then we can't fall through. */
13207 /* If there is a default: label or case labels cover all possible
13208 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13209 to some case label in all cases and all we care is whether the
13210 SWITCH_BODY falls through. */
13211 if (SWITCH_ALL_CASES_P (stmt
))
13212 return block_may_fallthru (SWITCH_BODY (stmt
));
13216 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13218 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13221 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13223 case TRY_CATCH_EXPR
:
13224 return try_catch_may_fallthru (stmt
);
13226 case TRY_FINALLY_EXPR
:
13227 /* The finally clause is always executed after the try clause,
13228 so if it does not fall through, then the try-finally will not
13229 fall through. Otherwise, if the try clause does not fall
13230 through, then when the finally clause falls through it will
13231 resume execution wherever the try clause was going. So the
13232 whole try-finally will only fall through if both the try
13233 clause and the finally clause fall through. */
13234 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13235 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13238 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13241 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13242 stmt
= TREE_OPERAND (stmt
, 1);
13248 /* Functions that do not return do not fall through. */
13249 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13251 case CLEANUP_POINT_EXPR
:
13252 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13255 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13261 return lang_hooks
.block_may_fallthru (stmt
);
13265 /* True if we are using EH to handle cleanups. */
13266 static bool using_eh_for_cleanups_flag
= false;
13268 /* This routine is called from front ends to indicate eh should be used for
13271 using_eh_for_cleanups (void)
13273 using_eh_for_cleanups_flag
= true;
13276 /* Query whether EH is used for cleanups. */
13278 using_eh_for_cleanups_p (void)
13280 return using_eh_for_cleanups_flag
;
13283 /* Wrapper for tree_code_name to ensure that tree code is valid */
13285 get_tree_code_name (enum tree_code code
)
13287 const char *invalid
= "<invalid tree code>";
13289 if (code
>= MAX_TREE_CODES
)
13291 if (code
== 0xa5a5)
13292 return "ggc_freed";
13296 return tree_code_name
[code
];
13299 /* Drops the TREE_OVERFLOW flag from T. */
13302 drop_tree_overflow (tree t
)
13304 gcc_checking_assert (TREE_OVERFLOW (t
));
13306 /* For tree codes with a sharing machinery re-build the result. */
13307 if (poly_int_tree_p (t
))
13308 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13310 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13311 and canonicalize the result. */
13312 if (TREE_CODE (t
) == VECTOR_CST
)
13314 tree_vector_builder builder
;
13315 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13316 unsigned int count
= builder
.encoded_nelts ();
13317 for (unsigned int i
= 0; i
< count
; ++i
)
13319 tree elt
= VECTOR_CST_ELT (t
, i
);
13320 if (TREE_OVERFLOW (elt
))
13321 elt
= drop_tree_overflow (elt
);
13322 builder
.quick_push (elt
);
13324 return builder
.build ();
13327 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13328 and drop the flag. */
13330 TREE_OVERFLOW (t
) = 0;
13332 /* For constants that contain nested constants, drop the flag
13333 from those as well. */
13334 if (TREE_CODE (t
) == COMPLEX_CST
)
13336 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13337 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13338 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13339 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13345 /* Given a memory reference expression T, return its base address.
13346 The base address of a memory reference expression is the main
13347 object being referenced. For instance, the base address for
13348 'array[i].fld[j]' is 'array'. You can think of this as stripping
13349 away the offset part from a memory address.
13351 This function calls handled_component_p to strip away all the inner
13352 parts of the memory reference until it reaches the base object. */
13355 get_base_address (tree t
)
13357 while (handled_component_p (t
))
13358 t
= TREE_OPERAND (t
, 0);
13360 if ((TREE_CODE (t
) == MEM_REF
13361 || TREE_CODE (t
) == TARGET_MEM_REF
)
13362 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13363 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13365 /* ??? Either the alias oracle or all callers need to properly deal
13366 with WITH_SIZE_EXPRs before we can look through those. */
13367 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13373 /* Return a tree of sizetype representing the size, in bytes, of the element
13374 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13377 array_ref_element_size (tree exp
)
13379 tree aligned_size
= TREE_OPERAND (exp
, 3);
13380 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13381 location_t loc
= EXPR_LOCATION (exp
);
13383 /* If a size was specified in the ARRAY_REF, it's the size measured
13384 in alignment units of the element type. So multiply by that value. */
13387 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13388 sizetype from another type of the same width and signedness. */
13389 if (TREE_TYPE (aligned_size
) != sizetype
)
13390 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13391 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13392 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13395 /* Otherwise, take the size from that of the element type. Substitute
13396 any PLACEHOLDER_EXPR that we have. */
13398 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13401 /* Return a tree representing the lower bound of the array mentioned in
13402 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13405 array_ref_low_bound (tree exp
)
13407 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13409 /* If a lower bound is specified in EXP, use it. */
13410 if (TREE_OPERAND (exp
, 2))
13411 return TREE_OPERAND (exp
, 2);
13413 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13414 substituting for a PLACEHOLDER_EXPR as needed. */
13415 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13416 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13418 /* Otherwise, return a zero of the appropriate type. */
13419 tree idxtype
= TREE_TYPE (TREE_OPERAND (exp
, 1));
13420 return (idxtype
== error_mark_node
13421 ? integer_zero_node
: build_int_cst (idxtype
, 0));
13424 /* Return a tree representing the upper bound of the array mentioned in
13425 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13428 array_ref_up_bound (tree exp
)
13430 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13432 /* If there is a domain type and it has an upper bound, use it, substituting
13433 for a PLACEHOLDER_EXPR as needed. */
13434 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13435 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13437 /* Otherwise fail. */
13441 /* Returns true if REF is an array reference, component reference,
13442 or memory reference to an array at the end of a structure.
13443 If this is the case, the array may be allocated larger
13444 than its upper bound implies. */
13447 array_at_struct_end_p (tree ref
)
13451 if (TREE_CODE (ref
) == ARRAY_REF
13452 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13454 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13455 ref
= TREE_OPERAND (ref
, 0);
13457 else if (TREE_CODE (ref
) == COMPONENT_REF
13458 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13459 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13460 else if (TREE_CODE (ref
) == MEM_REF
)
13462 tree arg
= TREE_OPERAND (ref
, 0);
13463 if (TREE_CODE (arg
) == ADDR_EXPR
)
13464 arg
= TREE_OPERAND (arg
, 0);
13465 tree argtype
= TREE_TYPE (arg
);
13466 if (TREE_CODE (argtype
) == RECORD_TYPE
)
13468 if (tree fld
= last_field (argtype
))
13470 atype
= TREE_TYPE (fld
);
13471 if (TREE_CODE (atype
) != ARRAY_TYPE
)
13473 if (VAR_P (arg
) && DECL_SIZE (fld
))
13485 if (TREE_CODE (ref
) == STRING_CST
)
13488 tree ref_to_array
= ref
;
13489 while (handled_component_p (ref
))
13491 /* If the reference chain contains a component reference to a
13492 non-union type and there follows another field the reference
13493 is not at the end of a structure. */
13494 if (TREE_CODE (ref
) == COMPONENT_REF
)
13496 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13498 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13499 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13500 nextf
= DECL_CHAIN (nextf
);
13505 /* If we have a multi-dimensional array we do not consider
13506 a non-innermost dimension as flex array if the whole
13507 multi-dimensional array is at struct end.
13508 Same for an array of aggregates with a trailing array
13510 else if (TREE_CODE (ref
) == ARRAY_REF
)
13512 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13514 /* If we view an underlying object as sth else then what we
13515 gathered up to now is what we have to rely on. */
13516 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13519 gcc_unreachable ();
13521 ref
= TREE_OPERAND (ref
, 0);
13524 /* The array now is at struct end. Treat flexible arrays as
13525 always subject to extend, even into just padding constrained by
13526 an underlying decl. */
13527 if (! TYPE_SIZE (atype
)
13528 || ! TYPE_DOMAIN (atype
)
13529 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13532 if (TREE_CODE (ref
) == MEM_REF
13533 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13534 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13536 /* If the reference is based on a declared entity, the size of the array
13537 is constrained by its given domain. (Do not trust commons PR/69368). */
13539 && !(flag_unconstrained_commons
13540 && VAR_P (ref
) && DECL_COMMON (ref
))
13541 && DECL_SIZE_UNIT (ref
)
13542 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13544 /* Check whether the array domain covers all of the available
13547 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13548 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13549 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13551 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13554 /* If at least one extra element fits it is a flexarray. */
13555 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13556 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13558 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13559 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13568 /* Return a tree representing the offset, in bytes, of the field referenced
13569 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13572 component_ref_field_offset (tree exp
)
13574 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13575 tree field
= TREE_OPERAND (exp
, 1);
13576 location_t loc
= EXPR_LOCATION (exp
);
13578 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13579 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13581 if (aligned_offset
)
13583 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13584 sizetype from another type of the same width and signedness. */
13585 if (TREE_TYPE (aligned_offset
) != sizetype
)
13586 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13587 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13588 size_int (DECL_OFFSET_ALIGN (field
)
13592 /* Otherwise, take the offset from that of the field. Substitute
13593 any PLACEHOLDER_EXPR that we have. */
13595 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13598 /* Given the initializer INIT, return the initializer for the field
13599 DECL if it exists, otherwise null. Used to obtain the initializer
13600 for a flexible array member and determine its size. */
13603 get_initializer_for (tree init
, tree decl
)
13607 tree fld
, fld_init
;
13608 unsigned HOST_WIDE_INT i
;
13609 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init
), i
, fld
, fld_init
)
13614 if (TREE_CODE (fld
) == CONSTRUCTOR
)
13616 fld_init
= get_initializer_for (fld_init
, decl
);
13625 /* Determines the size of the member referenced by the COMPONENT_REF
13626 REF, using its initializer expression if necessary in order to
13627 determine the size of an initialized flexible array member.
13628 If non-null, *INTERIOR_ZERO_LENGTH is set when REF refers to
13629 an interior zero-length array.
13630 Returns the size as sizetype (which might be zero for an object
13631 with an uninitialized flexible array member) or null if the size
13632 cannot be determined. */
13635 component_ref_size (tree ref
, bool *interior_zero_length
/* = NULL */)
13637 gcc_assert (TREE_CODE (ref
) == COMPONENT_REF
);
13639 bool int_0_len
= false;
13640 if (!interior_zero_length
)
13641 interior_zero_length
= &int_0_len
;
13643 tree member
= TREE_OPERAND (ref
, 1);
13645 tree memsize
= DECL_SIZE_UNIT (member
);
13648 tree memtype
= TREE_TYPE (member
);
13649 if (TREE_CODE (memtype
) != ARRAY_TYPE
)
13652 bool trailing
= array_at_struct_end_p (ref
);
13653 bool zero_length
= integer_zerop (memsize
);
13654 if (!trailing
&& (!interior_zero_length
|| !zero_length
))
13655 /* MEMBER is either an interior array or is an array with
13656 more than one element. */
13659 *interior_zero_length
= zero_length
&& !trailing
;
13660 if (*interior_zero_length
)
13661 memsize
= NULL_TREE
;
13664 if (tree dom
= TYPE_DOMAIN (memtype
))
13665 if (tree min
= TYPE_MIN_VALUE (dom
))
13666 if (tree max
= TYPE_MAX_VALUE (dom
))
13667 if (TREE_CODE (min
) == INTEGER_CST
13668 && TREE_CODE (max
) == INTEGER_CST
)
13670 offset_int minidx
= wi::to_offset (min
);
13671 offset_int maxidx
= wi::to_offset (max
);
13672 if (maxidx
- minidx
> 0)
13673 /* MEMBER is an array with more than 1 element. */
13678 /* MEMBER is either a bona fide flexible array member, or a zero-length
13679 array member, or an array of length one treated as such. */
13681 /* If the reference is to a declared object and the member a true
13682 flexible array, try to determine its size from its initializer. */
13683 poly_int64 baseoff
= 0;
13684 tree base
= get_addr_base_and_unit_offset (ref
, &baseoff
);
13685 if (!base
|| !VAR_P (base
))
13687 if (!*interior_zero_length
)
13690 if (TREE_CODE (TREE_OPERAND (ref
, 0)) != COMPONENT_REF
)
13693 base
= TREE_OPERAND (ref
, 0);
13694 while (TREE_CODE (base
) == COMPONENT_REF
)
13695 base
= TREE_OPERAND (base
, 0);
13696 baseoff
= tree_to_poly_int64 (byte_position (TREE_OPERAND (ref
, 1)));
13699 /* BASE is the declared object of which MEMBER is either a member
13700 or that is cast to REFTYPE (e.g., a char buffer used to store
13701 a REFTYPE object). */
13702 tree reftype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13703 tree basetype
= TREE_TYPE (base
);
13705 /* Determine the base type of the referenced object. If it's
13706 the same as REFTYPE and MEMBER has a known size, return it. */
13707 tree bt
= basetype
;
13708 if (!*interior_zero_length
)
13709 while (TREE_CODE (bt
) == ARRAY_TYPE
)
13710 bt
= TREE_TYPE (bt
);
13711 bool typematch
= useless_type_conversion_p (reftype
, bt
);
13712 if (memsize
&& typematch
)
13715 memsize
= NULL_TREE
;
13718 /* MEMBER is a true flexible array member. Compute its size from
13719 the initializer of the BASE object if it has one. */
13720 if (tree init
= DECL_P (base
) ? DECL_INITIAL (base
) : NULL_TREE
)
13722 init
= get_initializer_for (init
, member
);
13725 memsize
= TYPE_SIZE_UNIT (TREE_TYPE (init
));
13726 if (tree refsize
= TYPE_SIZE_UNIT (reftype
))
13728 /* Use the larger of the initializer size and the tail
13729 padding in the enclosing struct. */
13730 poly_int64 rsz
= tree_to_poly_int64 (refsize
);
13732 if (known_lt (tree_to_poly_int64 (memsize
), rsz
))
13733 memsize
= wide_int_to_tree (TREE_TYPE (memsize
), rsz
);
13745 && DECL_EXTERNAL (base
)
13747 && !*interior_zero_length
)
13748 /* The size of a flexible array member of an extern struct
13749 with no initializer cannot be determined (it's defined
13750 in another translation unit and can have an initializer
13751 with an arbitrary number of elements). */
13754 /* Use the size of the base struct or, for interior zero-length
13755 arrays, the size of the enclosing type. */
13756 memsize
= TYPE_SIZE_UNIT (bt
);
13758 else if (DECL_P (base
))
13759 /* Use the size of the BASE object (possibly an array of some
13760 other type such as char used to store the struct). */
13761 memsize
= DECL_SIZE_UNIT (base
);
13766 /* If the flexible array member has a known size use the greater
13767 of it and the tail padding in the enclosing struct.
13768 Otherwise, when the size of the flexible array member is unknown
13769 and the referenced object is not a struct, use the size of its
13770 type when known. This detects sizes of array buffers when cast
13771 to struct types with flexible array members. */
13774 poly_int64 memsz64
= memsize
? tree_to_poly_int64 (memsize
) : 0;
13775 if (known_lt (baseoff
, memsz64
))
13777 memsz64
-= baseoff
;
13778 return wide_int_to_tree (TREE_TYPE (memsize
), memsz64
);
13780 return size_zero_node
;
13783 /* Return "don't know" for an external non-array object since its
13784 flexible array member can be initialized to have any number of
13785 elements. Otherwise, return zero because the flexible array
13786 member has no elements. */
13787 return (DECL_P (base
)
13788 && DECL_EXTERNAL (base
)
13790 || TREE_CODE (basetype
) != ARRAY_TYPE
)
13791 ? NULL_TREE
: size_zero_node
);
13794 /* Return the machine mode of T. For vectors, returns the mode of the
13795 inner type. The main use case is to feed the result to HONOR_NANS,
13796 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13799 element_mode (const_tree t
)
13803 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13805 return TYPE_MODE (t
);
13808 /* Vector types need to re-check the target flags each time we report
13809 the machine mode. We need to do this because attribute target can
13810 change the result of vector_mode_supported_p and have_regs_of_mode
13811 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13812 change on a per-function basis. */
13813 /* ??? Possibly a better solution is to run through all the types
13814 referenced by a function and re-compute the TYPE_MODE once, rather
13815 than make the TYPE_MODE macro call a function. */
13818 vector_type_mode (const_tree t
)
13822 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13824 mode
= t
->type_common
.mode
;
13825 if (VECTOR_MODE_P (mode
)
13826 && (!targetm
.vector_mode_supported_p (mode
)
13827 || !have_regs_of_mode
[mode
]))
13829 scalar_int_mode innermode
;
13831 /* For integers, try mapping it to a same-sized scalar mode. */
13832 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13834 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13835 * GET_MODE_BITSIZE (innermode
));
13836 scalar_int_mode mode
;
13837 if (int_mode_for_size (size
, 0).exists (&mode
)
13838 && have_regs_of_mode
[mode
])
13848 /* Verify that basic properties of T match TV and thus T can be a variant of
13849 TV. TV should be the more specified variant (i.e. the main variant). */
13852 verify_type_variant (const_tree t
, tree tv
)
13854 /* Type variant can differ by:
13856 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13857 ENCODE_QUAL_ADDR_SPACE.
13858 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13859 in this case some values may not be set in the variant types
13860 (see TYPE_COMPLETE_P checks).
13861 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13862 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13863 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13864 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13865 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13866 this is necessary to make it possible to merge types form different TUs
13867 - arrays, pointers and references may have TREE_TYPE that is a variant
13868 of TREE_TYPE of their main variants.
13869 - aggregates may have new TYPE_FIELDS list that list variants of
13870 the main variant TYPE_FIELDS.
13871 - vector types may differ by TYPE_VECTOR_OPAQUE
13874 /* Convenience macro for matching individual fields. */
13875 #define verify_variant_match(flag) \
13877 if (flag (tv) != flag (t)) \
13879 error ("type variant differs by %s", #flag); \
13885 /* tree_base checks. */
13887 verify_variant_match (TREE_CODE
);
13888 /* FIXME: Ada builds non-artificial variants of artificial types. */
13889 if (TYPE_ARTIFICIAL (tv
) && 0)
13890 verify_variant_match (TYPE_ARTIFICIAL
);
13891 if (POINTER_TYPE_P (tv
))
13892 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13893 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13894 verify_variant_match (TYPE_UNSIGNED
);
13895 verify_variant_match (TYPE_PACKED
);
13896 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13897 verify_variant_match (TYPE_REF_IS_RVALUE
);
13898 if (AGGREGATE_TYPE_P (t
))
13899 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13901 verify_variant_match (TYPE_SATURATING
);
13902 /* FIXME: This check trigger during libstdc++ build. */
13903 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13904 verify_variant_match (TYPE_FINAL_P
);
13906 /* tree_type_common checks. */
13908 if (COMPLETE_TYPE_P (t
))
13910 verify_variant_match (TYPE_MODE
);
13911 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13912 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13913 verify_variant_match (TYPE_SIZE
);
13914 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13915 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13916 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13918 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13919 TYPE_SIZE_UNIT (tv
), 0));
13920 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13922 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13923 debug_tree (TYPE_SIZE_UNIT (tv
));
13924 error ("type%'s %<TYPE_SIZE_UNIT%>");
13925 debug_tree (TYPE_SIZE_UNIT (t
));
13928 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13930 verify_variant_match (TYPE_PRECISION
);
13931 if (RECORD_OR_UNION_TYPE_P (t
))
13932 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13933 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13934 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13935 /* During LTO we merge variant lists from diferent translation units
13936 that may differ BY TYPE_CONTEXT that in turn may point
13937 to TRANSLATION_UNIT_DECL.
13938 Ada also builds variants of types with different TYPE_CONTEXT. */
13939 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13940 verify_variant_match (TYPE_CONTEXT
);
13941 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13942 verify_variant_match (TYPE_STRING_FLAG
);
13943 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13944 verify_variant_match (TYPE_CXX_ODR_P
);
13945 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13947 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13952 /* tree_type_non_common checks. */
13954 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13955 and dangle the pointer from time to time. */
13956 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13957 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13958 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13960 error ("type variant has different %<TYPE_VFIELD%>");
13964 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13965 || TREE_CODE (t
) == INTEGER_TYPE
13966 || TREE_CODE (t
) == BOOLEAN_TYPE
13967 || TREE_CODE (t
) == REAL_TYPE
13968 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13970 verify_variant_match (TYPE_MAX_VALUE
);
13971 verify_variant_match (TYPE_MIN_VALUE
);
13973 if (TREE_CODE (t
) == METHOD_TYPE
)
13974 verify_variant_match (TYPE_METHOD_BASETYPE
);
13975 if (TREE_CODE (t
) == OFFSET_TYPE
)
13976 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13977 if (TREE_CODE (t
) == ARRAY_TYPE
)
13978 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13979 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13980 or even type's main variant. This is needed to make bootstrap pass
13981 and the bug seems new in GCC 5.
13982 C++ FE should be updated to make this consistent and we should check
13983 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13984 is a match with main variant.
13986 Also disable the check for Java for now because of parser hack that builds
13987 first an dummy BINFO and then sometimes replace it by real BINFO in some
13989 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13990 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13991 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13992 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13993 at LTO time only. */
13994 && (in_lto_p
&& odr_type_p (t
)))
13996 error ("type variant has different %<TYPE_BINFO%>");
13998 error ("type variant%'s %<TYPE_BINFO%>");
13999 debug_tree (TYPE_BINFO (tv
));
14000 error ("type%'s %<TYPE_BINFO%>");
14001 debug_tree (TYPE_BINFO (t
));
14005 /* Check various uses of TYPE_VALUES_RAW. */
14006 if (TREE_CODE (t
) == ENUMERAL_TYPE
14007 && TYPE_VALUES (t
))
14008 verify_variant_match (TYPE_VALUES
);
14009 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14010 verify_variant_match (TYPE_DOMAIN
);
14011 /* Permit incomplete variants of complete type. While FEs may complete
14012 all variants, this does not happen for C++ templates in all cases. */
14013 else if (RECORD_OR_UNION_TYPE_P (t
)
14014 && COMPLETE_TYPE_P (t
)
14015 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
14019 /* Fortran builds qualified variants as new records with items of
14020 qualified type. Verify that they looks same. */
14021 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
14023 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14024 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
14025 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
14026 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
14027 /* FIXME: gfc_nonrestricted_type builds all types as variants
14028 with exception of pointer types. It deeply copies the type
14029 which means that we may end up with a variant type
14030 referring non-variant pointer. We may change it to
14031 produce types as variants, too, like
14032 objc_get_protocol_qualified_type does. */
14033 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
14034 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
14035 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14039 error ("type variant has different %<TYPE_FIELDS%>");
14041 error ("first mismatch is field");
14043 error ("and field");
14048 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14049 verify_variant_match (TYPE_ARG_TYPES
);
14050 /* For C++ the qualified variant of array type is really an array type
14051 of qualified TREE_TYPE.
14052 objc builds variants of pointer where pointer to type is a variant, too
14053 in objc_get_protocol_qualified_type. */
14054 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14055 && ((TREE_CODE (t
) != ARRAY_TYPE
14056 && !POINTER_TYPE_P (t
))
14057 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14058 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14060 error ("type variant has different %<TREE_TYPE%>");
14062 error ("type variant%'s %<TREE_TYPE%>");
14063 debug_tree (TREE_TYPE (tv
));
14064 error ("type%'s %<TREE_TYPE%>");
14065 debug_tree (TREE_TYPE (t
));
14068 if (type_with_alias_set_p (t
)
14069 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14071 error ("type is not compatible with its variant");
14073 error ("type variant%'s %<TREE_TYPE%>");
14074 debug_tree (TREE_TYPE (tv
));
14075 error ("type%'s %<TREE_TYPE%>");
14076 debug_tree (TREE_TYPE (t
));
14080 #undef verify_variant_match
14084 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14085 the middle-end types_compatible_p function. It needs to avoid
14086 claiming types are different for types that should be treated
14087 the same with respect to TBAA. Canonical types are also used
14088 for IL consistency checks via the useless_type_conversion_p
14089 predicate which does not handle all type kinds itself but falls
14090 back to pointer-comparison of TYPE_CANONICAL for aggregates
14093 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14094 type calculation because we need to allow inter-operability between signed
14095 and unsigned variants. */
14098 type_with_interoperable_signedness (const_tree type
)
14100 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14101 signed char and unsigned char. Similarly fortran FE builds
14102 C_SIZE_T as signed type, while C defines it unsigned. */
14104 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14106 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14107 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14110 /* Return true iff T1 and T2 are structurally identical for what
14112 This function is used both by lto.c canonical type merging and by the
14113 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14114 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14115 only for LTO because only in these cases TYPE_CANONICAL equivalence
14116 correspond to one defined by gimple_canonical_types_compatible_p. */
14119 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14120 bool trust_type_canonical
)
14122 /* Type variants should be same as the main variant. When not doing sanity
14123 checking to verify this fact, go to main variants and save some work. */
14124 if (trust_type_canonical
)
14126 t1
= TYPE_MAIN_VARIANT (t1
);
14127 t2
= TYPE_MAIN_VARIANT (t2
);
14130 /* Check first for the obvious case of pointer identity. */
14134 /* Check that we have two types to compare. */
14135 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14138 /* We consider complete types always compatible with incomplete type.
14139 This does not make sense for canonical type calculation and thus we
14140 need to ensure that we are never called on it.
14142 FIXME: For more correctness the function probably should have three modes
14143 1) mode assuming that types are complete mathcing their structure
14144 2) mode allowing incomplete types but producing equivalence classes
14145 and thus ignoring all info from complete types
14146 3) mode allowing incomplete types to match complete but checking
14147 compatibility between complete types.
14149 1 and 2 can be used for canonical type calculation. 3 is the real
14150 definition of type compatibility that can be used i.e. for warnings during
14151 declaration merging. */
14153 gcc_assert (!trust_type_canonical
14154 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14156 /* If the types have been previously registered and found equal
14159 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14160 && trust_type_canonical
)
14162 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14163 they are always NULL, but they are set to non-NULL for types
14164 constructed by build_pointer_type and variants. In this case the
14165 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14166 all pointers are considered equal. Be sure to not return false
14168 gcc_checking_assert (canonical_type_used_p (t1
)
14169 && canonical_type_used_p (t2
));
14170 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14173 /* For types where we do ODR based TBAA the canonical type is always
14174 set correctly, so we know that types are different if their
14175 canonical types does not match. */
14176 if (trust_type_canonical
14177 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14178 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14181 /* Can't be the same type if the types don't have the same code. */
14182 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14183 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14186 /* Qualifiers do not matter for canonical type comparison purposes. */
14188 /* Void types and nullptr types are always the same. */
14189 if (TREE_CODE (t1
) == VOID_TYPE
14190 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14193 /* Can't be the same type if they have different mode. */
14194 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14197 /* Non-aggregate types can be handled cheaply. */
14198 if (INTEGRAL_TYPE_P (t1
)
14199 || SCALAR_FLOAT_TYPE_P (t1
)
14200 || FIXED_POINT_TYPE_P (t1
)
14201 || TREE_CODE (t1
) == VECTOR_TYPE
14202 || TREE_CODE (t1
) == COMPLEX_TYPE
14203 || TREE_CODE (t1
) == OFFSET_TYPE
14204 || POINTER_TYPE_P (t1
))
14206 /* Can't be the same type if they have different recision. */
14207 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14210 /* In some cases the signed and unsigned types are required to be
14212 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14213 && !type_with_interoperable_signedness (t1
))
14216 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14217 interoperable with "signed char". Unless all frontends are revisited
14218 to agree on these types, we must ignore the flag completely. */
14220 /* Fortran standard define C_PTR type that is compatible with every
14221 C pointer. For this reason we need to glob all pointers into one.
14222 Still pointers in different address spaces are not compatible. */
14223 if (POINTER_TYPE_P (t1
))
14225 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14226 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14230 /* Tail-recurse to components. */
14231 if (TREE_CODE (t1
) == VECTOR_TYPE
14232 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14233 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14235 trust_type_canonical
);
14240 /* Do type-specific comparisons. */
14241 switch (TREE_CODE (t1
))
14244 /* Array types are the same if the element types are the same and
14245 the number of elements are the same. */
14246 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14247 trust_type_canonical
)
14248 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14249 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14250 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14254 tree i1
= TYPE_DOMAIN (t1
);
14255 tree i2
= TYPE_DOMAIN (t2
);
14257 /* For an incomplete external array, the type domain can be
14258 NULL_TREE. Check this condition also. */
14259 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14261 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14265 tree min1
= TYPE_MIN_VALUE (i1
);
14266 tree min2
= TYPE_MIN_VALUE (i2
);
14267 tree max1
= TYPE_MAX_VALUE (i1
);
14268 tree max2
= TYPE_MAX_VALUE (i2
);
14270 /* The minimum/maximum values have to be the same. */
14273 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14274 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14275 || operand_equal_p (min1
, min2
, 0))))
14278 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14279 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14280 || operand_equal_p (max1
, max2
, 0)))))
14288 case FUNCTION_TYPE
:
14289 /* Function types are the same if the return type and arguments types
14291 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14292 trust_type_canonical
))
14295 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14299 tree parms1
, parms2
;
14301 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14303 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14305 if (!gimple_canonical_types_compatible_p
14306 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14307 trust_type_canonical
))
14311 if (parms1
|| parms2
)
14319 case QUAL_UNION_TYPE
:
14323 /* Don't try to compare variants of an incomplete type, before
14324 TYPE_FIELDS has been copied around. */
14325 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14329 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14332 /* For aggregate types, all the fields must be the same. */
14333 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14335 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14337 /* Skip non-fields and zero-sized fields. */
14338 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14340 && integer_zerop (DECL_SIZE (f1
)))))
14341 f1
= TREE_CHAIN (f1
);
14342 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14344 && integer_zerop (DECL_SIZE (f2
)))))
14345 f2
= TREE_CHAIN (f2
);
14348 /* The fields must have the same name, offset and type. */
14349 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14350 || !gimple_compare_field_offset (f1
, f2
)
14351 || !gimple_canonical_types_compatible_p
14352 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14353 trust_type_canonical
))
14357 /* If one aggregate has more fields than the other, they
14358 are not the same. */
14366 /* Consider all types with language specific trees in them mutually
14367 compatible. This is executed only from verify_type and false
14368 positives can be tolerated. */
14369 gcc_assert (!in_lto_p
);
14374 /* Verify type T. */
14377 verify_type (const_tree t
)
14379 bool error_found
= false;
14380 tree mv
= TYPE_MAIN_VARIANT (t
);
14383 error ("main variant is not defined");
14384 error_found
= true;
14386 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14388 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14390 error_found
= true;
14392 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14393 error_found
= true;
14395 tree ct
= TYPE_CANONICAL (t
);
14398 else if (TYPE_CANONICAL (t
) != ct
)
14400 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14402 error_found
= true;
14404 /* Method and function types cannot be used to address memory and thus
14405 TYPE_CANONICAL really matters only for determining useless conversions.
14407 FIXME: C++ FE produce declarations of builtin functions that are not
14408 compatible with main variants. */
14409 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14412 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14413 with variably sized arrays because their sizes possibly
14414 gimplified to different variables. */
14415 && !variably_modified_type_p (ct
, NULL
)
14416 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14417 && COMPLETE_TYPE_P (t
))
14419 error ("%<TYPE_CANONICAL%> is not compatible");
14421 error_found
= true;
14424 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14425 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14427 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14429 error_found
= true;
14431 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14433 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14435 debug_tree (TYPE_MAIN_VARIANT (ct
));
14436 error_found
= true;
14440 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14441 if (RECORD_OR_UNION_TYPE_P (t
))
14443 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14444 and danagle the pointer from time to time. */
14445 if (TYPE_VFIELD (t
)
14446 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14447 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14449 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14450 debug_tree (TYPE_VFIELD (t
));
14451 error_found
= true;
14454 else if (TREE_CODE (t
) == POINTER_TYPE
)
14456 if (TYPE_NEXT_PTR_TO (t
)
14457 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14459 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14460 debug_tree (TYPE_NEXT_PTR_TO (t
));
14461 error_found
= true;
14464 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14466 if (TYPE_NEXT_REF_TO (t
)
14467 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14469 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14470 debug_tree (TYPE_NEXT_REF_TO (t
));
14471 error_found
= true;
14474 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14475 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14477 /* FIXME: The following check should pass:
14478 useless_type_conversion_p (const_cast <tree> (t),
14479 TREE_TYPE (TYPE_MIN_VALUE (t))
14480 but does not for C sizetypes in LTO. */
14483 /* Check various uses of TYPE_MAXVAL_RAW. */
14484 if (RECORD_OR_UNION_TYPE_P (t
))
14486 if (!TYPE_BINFO (t
))
14488 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14490 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14491 debug_tree (TYPE_BINFO (t
));
14492 error_found
= true;
14494 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14496 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14497 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14498 error_found
= true;
14501 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14503 if (TYPE_METHOD_BASETYPE (t
)
14504 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14505 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14507 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14508 debug_tree (TYPE_METHOD_BASETYPE (t
));
14509 error_found
= true;
14512 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14514 if (TYPE_OFFSET_BASETYPE (t
)
14515 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14516 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14518 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14519 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14520 error_found
= true;
14523 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14524 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14526 /* FIXME: The following check should pass:
14527 useless_type_conversion_p (const_cast <tree> (t),
14528 TREE_TYPE (TYPE_MAX_VALUE (t))
14529 but does not for C sizetypes in LTO. */
14531 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14533 if (TYPE_ARRAY_MAX_SIZE (t
)
14534 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14536 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14537 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14538 error_found
= true;
14541 else if (TYPE_MAX_VALUE_RAW (t
))
14543 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14544 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14545 error_found
= true;
14548 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14550 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14551 debug_tree (TYPE_LANG_SLOT_1 (t
));
14552 error_found
= true;
14555 /* Check various uses of TYPE_VALUES_RAW. */
14556 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14557 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14559 tree value
= TREE_VALUE (l
);
14560 tree name
= TREE_PURPOSE (l
);
14562 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14563 CONST_DECL of ENUMERAL TYPE. */
14564 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14566 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14567 debug_tree (value
);
14569 error_found
= true;
14571 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14572 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14574 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14576 debug_tree (value
);
14578 error_found
= true;
14580 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14582 error ("enum value name is not %<IDENTIFIER_NODE%>");
14583 debug_tree (value
);
14585 error_found
= true;
14588 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14590 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14592 error ("array %<TYPE_DOMAIN%> is not integer type");
14593 debug_tree (TYPE_DOMAIN (t
));
14594 error_found
= true;
14597 else if (RECORD_OR_UNION_TYPE_P (t
))
14599 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14601 error ("%<TYPE_FIELDS%> defined in incomplete type");
14602 error_found
= true;
14604 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14606 /* TODO: verify properties of decls. */
14607 if (TREE_CODE (fld
) == FIELD_DECL
)
14609 else if (TREE_CODE (fld
) == TYPE_DECL
)
14611 else if (TREE_CODE (fld
) == CONST_DECL
)
14613 else if (VAR_P (fld
))
14615 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14617 else if (TREE_CODE (fld
) == USING_DECL
)
14619 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14623 error ("wrong tree in %<TYPE_FIELDS%> list");
14625 error_found
= true;
14629 else if (TREE_CODE (t
) == INTEGER_TYPE
14630 || TREE_CODE (t
) == BOOLEAN_TYPE
14631 || TREE_CODE (t
) == OFFSET_TYPE
14632 || TREE_CODE (t
) == REFERENCE_TYPE
14633 || TREE_CODE (t
) == NULLPTR_TYPE
14634 || TREE_CODE (t
) == POINTER_TYPE
)
14636 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14638 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14640 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14641 error_found
= true;
14643 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14645 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14646 debug_tree (TYPE_CACHED_VALUES (t
));
14647 error_found
= true;
14649 /* Verify just enough of cache to ensure that no one copied it to new type.
14650 All copying should go by copy_node that should clear it. */
14651 else if (TYPE_CACHED_VALUES_P (t
))
14654 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14655 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14656 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14658 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14659 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14660 error_found
= true;
14665 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14666 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14668 /* C++ FE uses TREE_PURPOSE to store initial values. */
14669 if (TREE_PURPOSE (l
) && in_lto_p
)
14671 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14673 error_found
= true;
14675 if (!TYPE_P (TREE_VALUE (l
)))
14677 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14679 error_found
= true;
14682 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14684 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14685 debug_tree (TYPE_VALUES_RAW (t
));
14686 error_found
= true;
14688 if (TREE_CODE (t
) != INTEGER_TYPE
14689 && TREE_CODE (t
) != BOOLEAN_TYPE
14690 && TREE_CODE (t
) != OFFSET_TYPE
14691 && TREE_CODE (t
) != REFERENCE_TYPE
14692 && TREE_CODE (t
) != NULLPTR_TYPE
14693 && TREE_CODE (t
) != POINTER_TYPE
14694 && TYPE_CACHED_VALUES_P (t
))
14696 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14697 error_found
= true;
14700 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14701 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14703 if (TREE_CODE (t
) == METHOD_TYPE
14704 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14706 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14707 error_found
= true;
14712 debug_tree (const_cast <tree
> (t
));
14713 internal_error ("%qs failed", __func__
);
14718 /* Return 1 if ARG interpreted as signed in its precision is known to be
14719 always positive or 2 if ARG is known to be always negative, or 3 if
14720 ARG may be positive or negative. */
14723 get_range_pos_neg (tree arg
)
14725 if (arg
== error_mark_node
)
14728 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14730 if (TREE_CODE (arg
) == INTEGER_CST
)
14732 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14738 while (CONVERT_EXPR_P (arg
)
14739 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14740 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14742 arg
= TREE_OPERAND (arg
, 0);
14743 /* Narrower value zero extended into wider type
14744 will always result in positive values. */
14745 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14746 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14748 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14753 if (TREE_CODE (arg
) != SSA_NAME
)
14755 wide_int arg_min
, arg_max
;
14756 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14758 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14759 if (is_gimple_assign (g
)
14760 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14762 tree t
= gimple_assign_rhs1 (g
);
14763 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14764 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14766 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14767 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14769 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14778 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14780 /* For unsigned values, the "positive" range comes
14781 below the "negative" range. */
14782 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14784 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14789 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14791 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14800 /* Return true if ARG is marked with the nonnull attribute in the
14801 current function signature. */
14804 nonnull_arg_p (const_tree arg
)
14806 tree t
, attrs
, fntype
;
14807 unsigned HOST_WIDE_INT arg_num
;
14809 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14810 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14811 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14813 /* The static chain decl is always non null. */
14814 if (arg
== cfun
->static_chain_decl
)
14817 /* THIS argument of method is always non-NULL. */
14818 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14819 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14820 && flag_delete_null_pointer_checks
)
14823 /* Values passed by reference are always non-NULL. */
14824 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14825 && flag_delete_null_pointer_checks
)
14828 fntype
= TREE_TYPE (cfun
->decl
);
14829 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14831 attrs
= lookup_attribute ("nonnull", attrs
);
14833 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14834 if (attrs
== NULL_TREE
)
14837 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14838 if (TREE_VALUE (attrs
) == NULL_TREE
)
14841 /* Get the position number for ARG in the function signature. */
14842 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14844 t
= DECL_CHAIN (t
), arg_num
++)
14850 gcc_assert (t
== arg
);
14852 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14853 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14855 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14863 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14867 set_block (location_t loc
, tree block
)
14869 location_t pure_loc
= get_pure_location (loc
);
14870 source_range src_range
= get_range_from_loc (line_table
, loc
);
14871 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14875 set_source_range (tree expr
, location_t start
, location_t finish
)
14877 source_range src_range
;
14878 src_range
.m_start
= start
;
14879 src_range
.m_finish
= finish
;
14880 return set_source_range (expr
, src_range
);
14884 set_source_range (tree expr
, source_range src_range
)
14886 if (!EXPR_P (expr
))
14887 return UNKNOWN_LOCATION
;
14889 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14890 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14894 SET_EXPR_LOCATION (expr
, adhoc
);
14898 /* Return EXPR, potentially wrapped with a node expression LOC,
14899 if !CAN_HAVE_LOCATION_P (expr).
14901 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14902 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14904 Wrapper nodes can be identified using location_wrapper_p. */
14907 maybe_wrap_with_location (tree expr
, location_t loc
)
14911 if (loc
== UNKNOWN_LOCATION
)
14913 if (CAN_HAVE_LOCATION_P (expr
))
14915 /* We should only be adding wrappers for constants and for decls,
14916 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14917 gcc_assert (CONSTANT_CLASS_P (expr
)
14919 || EXCEPTIONAL_CLASS_P (expr
));
14921 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14922 any impact of the wrapper nodes. */
14923 if (EXCEPTIONAL_CLASS_P (expr
))
14926 /* If any auto_suppress_location_wrappers are active, don't create
14928 if (suppress_location_wrappers
> 0)
14932 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14933 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14934 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14935 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14936 /* Mark this node as being a wrapper. */
14937 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14941 int suppress_location_wrappers
;
14943 /* Return the name of combined function FN, for debugging purposes. */
14946 combined_fn_name (combined_fn fn
)
14948 if (builtin_fn_p (fn
))
14950 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14951 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14954 return internal_fn_name (as_internal_fn (fn
));
14957 /* Return a bitmap with a bit set corresponding to each argument in
14958 a function call type FNTYPE declared with attribute nonnull,
14959 or null if none of the function's argument are nonnull. The caller
14960 must free the bitmap. */
14963 get_nonnull_args (const_tree fntype
)
14965 if (fntype
== NULL_TREE
)
14968 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14972 bitmap argmap
= NULL
;
14974 /* A function declaration can specify multiple attribute nonnull,
14975 each with zero or more arguments. The loop below creates a bitmap
14976 representing a union of all the arguments. An empty (but non-null)
14977 bitmap means that all arguments have been declaraed nonnull. */
14978 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14980 attrs
= lookup_attribute ("nonnull", attrs
);
14985 argmap
= BITMAP_ALLOC (NULL
);
14987 if (!TREE_VALUE (attrs
))
14989 /* Clear the bitmap in case a previous attribute nonnull
14990 set it and this one overrides it for all arguments. */
14991 bitmap_clear (argmap
);
14995 /* Iterate over the indices of the format arguments declared nonnull
14996 and set a bit for each. */
14997 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14999 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
15000 bitmap_set_bit (argmap
, val
);
15007 /* Returns true if TYPE is a type where it and all of its subobjects
15008 (recursively) are of structure, union, or array type. */
15011 default_is_empty_type (tree type
)
15013 if (RECORD_OR_UNION_TYPE_P (type
))
15015 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
15016 if (TREE_CODE (field
) == FIELD_DECL
15017 && !DECL_PADDING_P (field
)
15018 && !default_is_empty_type (TREE_TYPE (field
)))
15022 else if (TREE_CODE (type
) == ARRAY_TYPE
)
15023 return (integer_minus_onep (array_type_nelts (type
))
15024 || TYPE_DOMAIN (type
) == NULL_TREE
15025 || default_is_empty_type (TREE_TYPE (type
)));
15029 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
15030 that shouldn't be passed via stack. */
15033 default_is_empty_record (const_tree type
)
15035 if (!abi_version_at_least (12))
15038 if (type
== error_mark_node
)
15041 if (TREE_ADDRESSABLE (type
))
15044 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
15047 /* Determine whether TYPE is a structure with a flexible array member,
15048 or a union containing such a structure (possibly recursively). */
15051 flexible_array_type_p (const_tree type
)
15054 switch (TREE_CODE (type
))
15058 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15059 if (TREE_CODE (x
) == FIELD_DECL
)
15061 if (last
== NULL_TREE
)
15063 if (TREE_CODE (TREE_TYPE (last
)) == ARRAY_TYPE
15064 && TYPE_SIZE (TREE_TYPE (last
)) == NULL_TREE
15065 && TYPE_DOMAIN (TREE_TYPE (last
)) != NULL_TREE
15066 && TYPE_MAX_VALUE (TYPE_DOMAIN (TREE_TYPE (last
))) == NULL_TREE
)
15070 for (x
= TYPE_FIELDS (type
); x
!= NULL_TREE
; x
= DECL_CHAIN (x
))
15072 if (TREE_CODE (x
) == FIELD_DECL
15073 && flexible_array_type_p (TREE_TYPE (x
)))
15082 /* Like int_size_in_bytes, but handle empty records specially. */
15085 arg_int_size_in_bytes (const_tree type
)
15087 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15090 /* Like size_in_bytes, but handle empty records specially. */
15093 arg_size_in_bytes (const_tree type
)
15095 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15098 /* Return true if an expression with CODE has to have the same result type as
15099 its first operand. */
15102 expr_type_first_operand_type_p (tree_code code
)
15115 case TRUNC_DIV_EXPR
:
15116 case CEIL_DIV_EXPR
:
15117 case FLOOR_DIV_EXPR
:
15118 case ROUND_DIV_EXPR
:
15119 case TRUNC_MOD_EXPR
:
15120 case CEIL_MOD_EXPR
:
15121 case FLOOR_MOD_EXPR
:
15122 case ROUND_MOD_EXPR
:
15124 case EXACT_DIV_EXPR
:
15142 /* Return a typenode for the "standard" C type with a given name. */
15144 get_typenode_from_name (const char *name
)
15146 if (name
== NULL
|| *name
== '\0')
15149 if (strcmp (name
, "char") == 0)
15150 return char_type_node
;
15151 if (strcmp (name
, "unsigned char") == 0)
15152 return unsigned_char_type_node
;
15153 if (strcmp (name
, "signed char") == 0)
15154 return signed_char_type_node
;
15156 if (strcmp (name
, "short int") == 0)
15157 return short_integer_type_node
;
15158 if (strcmp (name
, "short unsigned int") == 0)
15159 return short_unsigned_type_node
;
15161 if (strcmp (name
, "int") == 0)
15162 return integer_type_node
;
15163 if (strcmp (name
, "unsigned int") == 0)
15164 return unsigned_type_node
;
15166 if (strcmp (name
, "long int") == 0)
15167 return long_integer_type_node
;
15168 if (strcmp (name
, "long unsigned int") == 0)
15169 return long_unsigned_type_node
;
15171 if (strcmp (name
, "long long int") == 0)
15172 return long_long_integer_type_node
;
15173 if (strcmp (name
, "long long unsigned int") == 0)
15174 return long_long_unsigned_type_node
;
15176 gcc_unreachable ();
15179 /* List of pointer types used to declare builtins before we have seen their
15182 Keep the size up to date in tree.h ! */
15183 const builtin_structptr_type builtin_structptr_types
[6] =
15185 { fileptr_type_node
, ptr_type_node
, "FILE" },
15186 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15187 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15188 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15189 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15190 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15193 /* Return the maximum object size. */
15196 max_object_size (void)
15198 /* To do: Make this a configurable parameter. */
15199 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15202 /* A wrapper around TARGET_VERIFY_TYPE_CONTEXT that makes the silent_p
15203 parameter default to false and that weeds out error_mark_node. */
15206 verify_type_context (location_t loc
, type_context_kind context
,
15207 const_tree type
, bool silent_p
)
15209 if (type
== error_mark_node
)
15212 gcc_assert (TYPE_P (type
));
15213 return (!targetm
.verify_type_context
15214 || targetm
.verify_type_context (loc
, context
, type
, silent_p
));
15219 namespace selftest
{
15221 /* Selftests for tree. */
15223 /* Verify that integer constants are sane. */
15226 test_integer_constants ()
15228 ASSERT_TRUE (integer_type_node
!= NULL
);
15229 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15231 tree type
= integer_type_node
;
15233 tree zero
= build_zero_cst (type
);
15234 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15235 ASSERT_EQ (type
, TREE_TYPE (zero
));
15237 tree one
= build_int_cst (type
, 1);
15238 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15239 ASSERT_EQ (type
, TREE_TYPE (zero
));
15242 /* Verify identifiers. */
15245 test_identifiers ()
15247 tree identifier
= get_identifier ("foo");
15248 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15249 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15252 /* Verify LABEL_DECL. */
15257 tree identifier
= get_identifier ("err");
15258 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15259 identifier
, void_type_node
);
15260 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15261 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15264 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15265 are given by VALS. */
15268 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15270 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15271 tree_vector_builder
builder (type
, vals
.length (), 1);
15272 builder
.splice (vals
);
15273 return builder
.build ();
15276 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15279 check_vector_cst (vec
<tree
> expected
, tree actual
)
15281 ASSERT_KNOWN_EQ (expected
.length (),
15282 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15283 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15284 ASSERT_EQ (wi::to_wide (expected
[i
]),
15285 wi::to_wide (vector_cst_elt (actual
, i
)));
15288 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15289 and that its elements match EXPECTED. */
15292 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15293 unsigned int npatterns
)
15295 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15296 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15297 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15298 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15299 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15300 check_vector_cst (expected
, actual
);
15303 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15304 and NPATTERNS background elements, and that its elements match
15308 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15309 unsigned int npatterns
)
15311 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15312 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15313 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15314 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15315 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15316 check_vector_cst (expected
, actual
);
15319 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15320 and that its elements match EXPECTED. */
15323 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15324 unsigned int npatterns
)
15326 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15327 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15328 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15329 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15330 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15331 check_vector_cst (expected
, actual
);
15334 /* Test the creation of VECTOR_CSTs. */
15337 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15339 auto_vec
<tree
, 8> elements (8);
15340 elements
.quick_grow (8);
15341 tree element_type
= build_nonstandard_integer_type (16, true);
15342 tree vector_type
= build_vector_type (element_type
, 8);
15344 /* Test a simple linear series with a base of 0 and a step of 1:
15345 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15346 for (unsigned int i
= 0; i
< 8; ++i
)
15347 elements
[i
] = build_int_cst (element_type
, i
);
15348 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15349 check_vector_cst_stepped (elements
, vector
, 1);
15351 /* Try the same with the first element replaced by 100:
15352 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15353 elements
[0] = build_int_cst (element_type
, 100);
15354 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15355 check_vector_cst_stepped (elements
, vector
, 1);
15357 /* Try a series that wraps around.
15358 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15359 for (unsigned int i
= 1; i
< 8; ++i
)
15360 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15361 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15362 check_vector_cst_stepped (elements
, vector
, 1);
15364 /* Try a downward series:
15365 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15366 for (unsigned int i
= 1; i
< 8; ++i
)
15367 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15368 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15369 check_vector_cst_stepped (elements
, vector
, 1);
15371 /* Try two interleaved series with different bases and steps:
15372 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15373 elements
[1] = build_int_cst (element_type
, 53);
15374 for (unsigned int i
= 2; i
< 8; i
+= 2)
15376 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15377 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15379 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15380 check_vector_cst_stepped (elements
, vector
, 2);
15382 /* Try a duplicated value:
15383 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15384 for (unsigned int i
= 1; i
< 8; ++i
)
15385 elements
[i
] = elements
[0];
15386 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15387 check_vector_cst_duplicate (elements
, vector
, 1);
15389 /* Try an interleaved duplicated value:
15390 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15391 elements
[1] = build_int_cst (element_type
, 55);
15392 for (unsigned int i
= 2; i
< 8; ++i
)
15393 elements
[i
] = elements
[i
- 2];
15394 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15395 check_vector_cst_duplicate (elements
, vector
, 2);
15397 /* Try a duplicated value with 2 exceptions
15398 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15399 elements
[0] = build_int_cst (element_type
, 41);
15400 elements
[1] = build_int_cst (element_type
, 97);
15401 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15402 check_vector_cst_fill (elements
, vector
, 2);
15404 /* Try with and without a step
15405 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15406 for (unsigned int i
= 3; i
< 8; i
+= 2)
15407 elements
[i
] = build_int_cst (element_type
, i
* 7);
15408 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15409 check_vector_cst_stepped (elements
, vector
, 2);
15411 /* Try a fully-general constant:
15412 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15413 elements
[5] = build_int_cst (element_type
, 9990);
15414 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15415 check_vector_cst_fill (elements
, vector
, 4);
15418 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15419 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15420 modifying its argument in-place. */
15423 check_strip_nops (tree node
, tree expected
)
15426 ASSERT_EQ (expected
, node
);
15429 /* Verify location wrappers. */
15432 test_location_wrappers ()
15434 location_t loc
= BUILTINS_LOCATION
;
15436 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15438 /* Wrapping a constant. */
15439 tree int_cst
= build_int_cst (integer_type_node
, 42);
15440 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15441 ASSERT_FALSE (location_wrapper_p (int_cst
));
15443 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15444 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15445 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15446 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15448 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15449 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15451 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15452 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15453 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15454 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15456 /* Wrapping a STRING_CST. */
15457 tree string_cst
= build_string (4, "foo");
15458 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15459 ASSERT_FALSE (location_wrapper_p (string_cst
));
15461 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15462 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15463 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15464 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15465 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15468 /* Wrapping a variable. */
15469 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15470 get_identifier ("some_int_var"),
15471 integer_type_node
);
15472 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15473 ASSERT_FALSE (location_wrapper_p (int_var
));
15475 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15476 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15477 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15478 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15480 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15482 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15483 ASSERT_FALSE (location_wrapper_p (r_cast
));
15484 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15486 /* Verify that STRIP_NOPS removes wrappers. */
15487 check_strip_nops (wrapped_int_cst
, int_cst
);
15488 check_strip_nops (wrapped_string_cst
, string_cst
);
15489 check_strip_nops (wrapped_int_var
, int_var
);
15492 /* Test various tree predicates. Verify that location wrappers don't
15493 affect the results. */
15498 /* Build various constants and wrappers around them. */
15500 location_t loc
= BUILTINS_LOCATION
;
15502 tree i_0
= build_int_cst (integer_type_node
, 0);
15503 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15505 tree i_1
= build_int_cst (integer_type_node
, 1);
15506 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15508 tree i_m1
= build_int_cst (integer_type_node
, -1);
15509 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15511 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15512 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15513 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15514 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15515 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15516 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15518 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15519 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15520 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15522 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15523 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15524 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15526 /* TODO: vector constants. */
15528 /* Test integer_onep. */
15529 ASSERT_FALSE (integer_onep (i_0
));
15530 ASSERT_FALSE (integer_onep (wr_i_0
));
15531 ASSERT_TRUE (integer_onep (i_1
));
15532 ASSERT_TRUE (integer_onep (wr_i_1
));
15533 ASSERT_FALSE (integer_onep (i_m1
));
15534 ASSERT_FALSE (integer_onep (wr_i_m1
));
15535 ASSERT_FALSE (integer_onep (f_0
));
15536 ASSERT_FALSE (integer_onep (wr_f_0
));
15537 ASSERT_FALSE (integer_onep (f_1
));
15538 ASSERT_FALSE (integer_onep (wr_f_1
));
15539 ASSERT_FALSE (integer_onep (f_m1
));
15540 ASSERT_FALSE (integer_onep (wr_f_m1
));
15541 ASSERT_FALSE (integer_onep (c_i_0
));
15542 ASSERT_TRUE (integer_onep (c_i_1
));
15543 ASSERT_FALSE (integer_onep (c_i_m1
));
15544 ASSERT_FALSE (integer_onep (c_f_0
));
15545 ASSERT_FALSE (integer_onep (c_f_1
));
15546 ASSERT_FALSE (integer_onep (c_f_m1
));
15548 /* Test integer_zerop. */
15549 ASSERT_TRUE (integer_zerop (i_0
));
15550 ASSERT_TRUE (integer_zerop (wr_i_0
));
15551 ASSERT_FALSE (integer_zerop (i_1
));
15552 ASSERT_FALSE (integer_zerop (wr_i_1
));
15553 ASSERT_FALSE (integer_zerop (i_m1
));
15554 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15555 ASSERT_FALSE (integer_zerop (f_0
));
15556 ASSERT_FALSE (integer_zerop (wr_f_0
));
15557 ASSERT_FALSE (integer_zerop (f_1
));
15558 ASSERT_FALSE (integer_zerop (wr_f_1
));
15559 ASSERT_FALSE (integer_zerop (f_m1
));
15560 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15561 ASSERT_TRUE (integer_zerop (c_i_0
));
15562 ASSERT_FALSE (integer_zerop (c_i_1
));
15563 ASSERT_FALSE (integer_zerop (c_i_m1
));
15564 ASSERT_FALSE (integer_zerop (c_f_0
));
15565 ASSERT_FALSE (integer_zerop (c_f_1
));
15566 ASSERT_FALSE (integer_zerop (c_f_m1
));
15568 /* Test integer_all_onesp. */
15569 ASSERT_FALSE (integer_all_onesp (i_0
));
15570 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15571 ASSERT_FALSE (integer_all_onesp (i_1
));
15572 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15573 ASSERT_TRUE (integer_all_onesp (i_m1
));
15574 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15575 ASSERT_FALSE (integer_all_onesp (f_0
));
15576 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15577 ASSERT_FALSE (integer_all_onesp (f_1
));
15578 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15579 ASSERT_FALSE (integer_all_onesp (f_m1
));
15580 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15581 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15582 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15583 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15584 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15585 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15586 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15588 /* Test integer_minus_onep. */
15589 ASSERT_FALSE (integer_minus_onep (i_0
));
15590 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15591 ASSERT_FALSE (integer_minus_onep (i_1
));
15592 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15593 ASSERT_TRUE (integer_minus_onep (i_m1
));
15594 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15595 ASSERT_FALSE (integer_minus_onep (f_0
));
15596 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15597 ASSERT_FALSE (integer_minus_onep (f_1
));
15598 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15599 ASSERT_FALSE (integer_minus_onep (f_m1
));
15600 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15601 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15602 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15603 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15604 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15605 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15606 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15608 /* Test integer_each_onep. */
15609 ASSERT_FALSE (integer_each_onep (i_0
));
15610 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15611 ASSERT_TRUE (integer_each_onep (i_1
));
15612 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15613 ASSERT_FALSE (integer_each_onep (i_m1
));
15614 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15615 ASSERT_FALSE (integer_each_onep (f_0
));
15616 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15617 ASSERT_FALSE (integer_each_onep (f_1
));
15618 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15619 ASSERT_FALSE (integer_each_onep (f_m1
));
15620 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15621 ASSERT_FALSE (integer_each_onep (c_i_0
));
15622 ASSERT_FALSE (integer_each_onep (c_i_1
));
15623 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15624 ASSERT_FALSE (integer_each_onep (c_f_0
));
15625 ASSERT_FALSE (integer_each_onep (c_f_1
));
15626 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15628 /* Test integer_truep. */
15629 ASSERT_FALSE (integer_truep (i_0
));
15630 ASSERT_FALSE (integer_truep (wr_i_0
));
15631 ASSERT_TRUE (integer_truep (i_1
));
15632 ASSERT_TRUE (integer_truep (wr_i_1
));
15633 ASSERT_FALSE (integer_truep (i_m1
));
15634 ASSERT_FALSE (integer_truep (wr_i_m1
));
15635 ASSERT_FALSE (integer_truep (f_0
));
15636 ASSERT_FALSE (integer_truep (wr_f_0
));
15637 ASSERT_FALSE (integer_truep (f_1
));
15638 ASSERT_FALSE (integer_truep (wr_f_1
));
15639 ASSERT_FALSE (integer_truep (f_m1
));
15640 ASSERT_FALSE (integer_truep (wr_f_m1
));
15641 ASSERT_FALSE (integer_truep (c_i_0
));
15642 ASSERT_TRUE (integer_truep (c_i_1
));
15643 ASSERT_FALSE (integer_truep (c_i_m1
));
15644 ASSERT_FALSE (integer_truep (c_f_0
));
15645 ASSERT_FALSE (integer_truep (c_f_1
));
15646 ASSERT_FALSE (integer_truep (c_f_m1
));
15648 /* Test integer_nonzerop. */
15649 ASSERT_FALSE (integer_nonzerop (i_0
));
15650 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15651 ASSERT_TRUE (integer_nonzerop (i_1
));
15652 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15653 ASSERT_TRUE (integer_nonzerop (i_m1
));
15654 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15655 ASSERT_FALSE (integer_nonzerop (f_0
));
15656 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15657 ASSERT_FALSE (integer_nonzerop (f_1
));
15658 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15659 ASSERT_FALSE (integer_nonzerop (f_m1
));
15660 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15661 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15662 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15663 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15664 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15665 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15666 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15668 /* Test real_zerop. */
15669 ASSERT_FALSE (real_zerop (i_0
));
15670 ASSERT_FALSE (real_zerop (wr_i_0
));
15671 ASSERT_FALSE (real_zerop (i_1
));
15672 ASSERT_FALSE (real_zerop (wr_i_1
));
15673 ASSERT_FALSE (real_zerop (i_m1
));
15674 ASSERT_FALSE (real_zerop (wr_i_m1
));
15675 ASSERT_TRUE (real_zerop (f_0
));
15676 ASSERT_TRUE (real_zerop (wr_f_0
));
15677 ASSERT_FALSE (real_zerop (f_1
));
15678 ASSERT_FALSE (real_zerop (wr_f_1
));
15679 ASSERT_FALSE (real_zerop (f_m1
));
15680 ASSERT_FALSE (real_zerop (wr_f_m1
));
15681 ASSERT_FALSE (real_zerop (c_i_0
));
15682 ASSERT_FALSE (real_zerop (c_i_1
));
15683 ASSERT_FALSE (real_zerop (c_i_m1
));
15684 ASSERT_TRUE (real_zerop (c_f_0
));
15685 ASSERT_FALSE (real_zerop (c_f_1
));
15686 ASSERT_FALSE (real_zerop (c_f_m1
));
15688 /* Test real_onep. */
15689 ASSERT_FALSE (real_onep (i_0
));
15690 ASSERT_FALSE (real_onep (wr_i_0
));
15691 ASSERT_FALSE (real_onep (i_1
));
15692 ASSERT_FALSE (real_onep (wr_i_1
));
15693 ASSERT_FALSE (real_onep (i_m1
));
15694 ASSERT_FALSE (real_onep (wr_i_m1
));
15695 ASSERT_FALSE (real_onep (f_0
));
15696 ASSERT_FALSE (real_onep (wr_f_0
));
15697 ASSERT_TRUE (real_onep (f_1
));
15698 ASSERT_TRUE (real_onep (wr_f_1
));
15699 ASSERT_FALSE (real_onep (f_m1
));
15700 ASSERT_FALSE (real_onep (wr_f_m1
));
15701 ASSERT_FALSE (real_onep (c_i_0
));
15702 ASSERT_FALSE (real_onep (c_i_1
));
15703 ASSERT_FALSE (real_onep (c_i_m1
));
15704 ASSERT_FALSE (real_onep (c_f_0
));
15705 ASSERT_TRUE (real_onep (c_f_1
));
15706 ASSERT_FALSE (real_onep (c_f_m1
));
15708 /* Test real_minus_onep. */
15709 ASSERT_FALSE (real_minus_onep (i_0
));
15710 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15711 ASSERT_FALSE (real_minus_onep (i_1
));
15712 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15713 ASSERT_FALSE (real_minus_onep (i_m1
));
15714 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15715 ASSERT_FALSE (real_minus_onep (f_0
));
15716 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15717 ASSERT_FALSE (real_minus_onep (f_1
));
15718 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15719 ASSERT_TRUE (real_minus_onep (f_m1
));
15720 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15721 ASSERT_FALSE (real_minus_onep (c_i_0
));
15722 ASSERT_FALSE (real_minus_onep (c_i_1
));
15723 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15724 ASSERT_FALSE (real_minus_onep (c_f_0
));
15725 ASSERT_FALSE (real_minus_onep (c_f_1
));
15726 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15729 ASSERT_TRUE (zerop (i_0
));
15730 ASSERT_TRUE (zerop (wr_i_0
));
15731 ASSERT_FALSE (zerop (i_1
));
15732 ASSERT_FALSE (zerop (wr_i_1
));
15733 ASSERT_FALSE (zerop (i_m1
));
15734 ASSERT_FALSE (zerop (wr_i_m1
));
15735 ASSERT_TRUE (zerop (f_0
));
15736 ASSERT_TRUE (zerop (wr_f_0
));
15737 ASSERT_FALSE (zerop (f_1
));
15738 ASSERT_FALSE (zerop (wr_f_1
));
15739 ASSERT_FALSE (zerop (f_m1
));
15740 ASSERT_FALSE (zerop (wr_f_m1
));
15741 ASSERT_TRUE (zerop (c_i_0
));
15742 ASSERT_FALSE (zerop (c_i_1
));
15743 ASSERT_FALSE (zerop (c_i_m1
));
15744 ASSERT_TRUE (zerop (c_f_0
));
15745 ASSERT_FALSE (zerop (c_f_1
));
15746 ASSERT_FALSE (zerop (c_f_m1
));
15748 /* Test tree_expr_nonnegative_p. */
15749 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15750 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15751 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15752 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15753 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15754 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15755 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15756 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15757 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15758 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15759 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15760 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15761 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15762 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15763 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15764 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15765 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15766 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15768 /* Test tree_expr_nonzero_p. */
15769 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15770 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15771 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15772 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15773 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15774 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15776 /* Test integer_valued_real_p. */
15777 ASSERT_FALSE (integer_valued_real_p (i_0
));
15778 ASSERT_TRUE (integer_valued_real_p (f_0
));
15779 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15780 ASSERT_TRUE (integer_valued_real_p (f_1
));
15781 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15783 /* Test integer_pow2p. */
15784 ASSERT_FALSE (integer_pow2p (i_0
));
15785 ASSERT_TRUE (integer_pow2p (i_1
));
15786 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15788 /* Test uniform_integer_cst_p. */
15789 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15790 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15791 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15792 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15793 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15794 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15795 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15796 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15797 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15798 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15799 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15800 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15801 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15802 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15803 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15804 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15805 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15806 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15809 /* Check that string escaping works correctly. */
15812 test_escaped_strings (void)
15815 escaped_string msg
;
15818 /* ASSERT_STREQ does not accept NULL as a valid test
15819 result, so we have to use ASSERT_EQ instead. */
15820 ASSERT_EQ (NULL
, (const char *) msg
);
15823 ASSERT_STREQ ("", (const char *) msg
);
15825 msg
.escape ("foobar");
15826 ASSERT_STREQ ("foobar", (const char *) msg
);
15828 /* Ensure that we have -fmessage-length set to 0. */
15829 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15830 pp_line_cutoff (global_dc
->printer
) = 0;
15832 msg
.escape ("foo\nbar");
15833 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15835 msg
.escape ("\a\b\f\n\r\t\v");
15836 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15838 /* Now repeat the tests with -fmessage-length set to 5. */
15839 pp_line_cutoff (global_dc
->printer
) = 5;
15841 /* Note that the newline is not translated into an escape. */
15842 msg
.escape ("foo\nbar");
15843 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15845 msg
.escape ("\a\b\f\n\r\t\v");
15846 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15848 /* Restore the original message length setting. */
15849 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15852 /* Run all of the selftests within this file. */
15857 test_integer_constants ();
15858 test_identifiers ();
15860 test_vector_cst_patterns ();
15861 test_location_wrappers ();
15862 test_predicates ();
15863 test_escaped_strings ();
15866 } // namespace selftest
15868 #endif /* CHECKING_P */
15870 #include "gt-tree.h"