1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2019 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the low level primitives for operating on tree nodes,
21 including allocation, list operations, interning of identifiers,
22 construction of data type nodes and statement nodes,
23 and construction of type conversion nodes. It also contains
24 tables index by tree code that describe how to take apart
27 It is intended to be language-independent but can occasionally
28 calls language-dependent routines. */
32 #include "coretypes.h"
37 #include "tree-pass.h"
40 #include "diagnostic.h"
43 #include "fold-const.h"
44 #include "stor-layout.h"
47 #include "toplev.h" /* get_random_seed */
49 #include "common/common-target.h"
50 #include "langhooks.h"
51 #include "tree-inline.h"
52 #include "tree-iterator.h"
53 #include "internal-fn.h"
54 #include "gimple-iterator.h"
58 #include "langhooks-def.h"
59 #include "tree-diagnostic.h"
62 #include "print-tree.h"
63 #include "ipa-utils.h"
65 #include "stringpool.h"
69 #include "tree-vector-builder.h"
71 /* Tree code classes. */
73 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
74 #define END_OF_BASE_TREE_CODES tcc_exceptional,
76 const enum tree_code_class tree_code_type
[] = {
77 #include "all-tree.def"
81 #undef END_OF_BASE_TREE_CODES
83 /* Table indexed by tree code giving number of expression
84 operands beyond the fixed part of the node structure.
85 Not used for types or decls. */
87 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
88 #define END_OF_BASE_TREE_CODES 0,
90 const unsigned char tree_code_length
[] = {
91 #include "all-tree.def"
95 #undef END_OF_BASE_TREE_CODES
97 /* Names of tree components.
98 Used for printing out the tree and error messages. */
99 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
100 #define END_OF_BASE_TREE_CODES "@dummy",
102 static const char *const tree_code_name
[] = {
103 #include "all-tree.def"
107 #undef END_OF_BASE_TREE_CODES
109 /* Each tree code class has an associated string representation.
110 These must correspond to the tree_code_class entries. */
112 const char *const tree_code_class_strings
[] =
127 /* obstack.[ch] explicitly declined to prototype this. */
128 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
130 /* Statistics-gathering stuff. */
132 static uint64_t tree_code_counts
[MAX_TREE_CODES
];
133 uint64_t tree_node_counts
[(int) all_kinds
];
134 uint64_t tree_node_sizes
[(int) all_kinds
];
136 /* Keep in sync with tree.h:enum tree_node_kind. */
137 static const char * const tree_node_kind_names
[] = {
156 /* Unique id for next decl created. */
157 static GTY(()) int next_decl_uid
;
158 /* Unique id for next type created. */
159 static GTY(()) unsigned next_type_uid
= 1;
160 /* Unique id for next debug decl created. Use negative numbers,
161 to catch erroneous uses. */
162 static GTY(()) int next_debug_decl_uid
;
164 /* Since we cannot rehash a type after it is in the table, we have to
165 keep the hash code. */
167 struct GTY((for_user
)) type_hash
{
172 /* Initial size of the hash table (rounded to next prime). */
173 #define TYPE_HASH_INITIAL_SIZE 1000
175 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
177 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
178 static bool equal (type_hash
*a
, type_hash
*b
);
181 keep_cache_entry (type_hash
*&t
)
183 return ggc_marked_p (t
->type
);
187 /* Now here is the hash table. When recording a type, it is added to
188 the slot whose index is the hash code. Note that the hash table is
189 used for several kinds of types (function types, array types and
190 array index range types, for now). While all these live in the
191 same table, they are completely independent, and the hash code is
192 computed differently for each of these. */
194 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
196 /* Hash table and temporary node for larger integer const values. */
197 static GTY (()) tree int_cst_node
;
199 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
201 static hashval_t
hash (tree t
);
202 static bool equal (tree x
, tree y
);
205 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
207 /* Class and variable for making sure that there is a single POLY_INT_CST
208 for a given value. */
209 struct poly_int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
211 typedef std::pair
<tree
, const poly_wide_int
*> compare_type
;
212 static hashval_t
hash (tree t
);
213 static bool equal (tree x
, const compare_type
&y
);
216 static GTY ((cache
)) hash_table
<poly_int_cst_hasher
> *poly_int_cst_hash_table
;
218 /* Hash table for optimization flags and target option flags. Use the same
219 hash table for both sets of options. Nodes for building the current
220 optimization and target option nodes. The assumption is most of the time
221 the options created will already be in the hash table, so we avoid
222 allocating and freeing up a node repeatably. */
223 static GTY (()) tree cl_optimization_node
;
224 static GTY (()) tree cl_target_option_node
;
226 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
228 static hashval_t
hash (tree t
);
229 static bool equal (tree x
, tree y
);
232 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
234 /* General tree->tree mapping structure for use in hash tables. */
238 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
241 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
243 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
245 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
248 equal (tree_vec_map
*a
, tree_vec_map
*b
)
250 return a
->base
.from
== b
->base
.from
;
254 keep_cache_entry (tree_vec_map
*&m
)
256 return ggc_marked_p (m
->base
.from
);
261 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
263 static void set_type_quals (tree
, int);
264 static void print_type_hash_statistics (void);
265 static void print_debug_expr_statistics (void);
266 static void print_value_expr_statistics (void);
268 static tree
build_array_type_1 (tree
, tree
, bool, bool);
270 tree global_trees
[TI_MAX
];
271 tree integer_types
[itk_none
];
273 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
274 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
276 bool tree_contains_struct
[MAX_TREE_CODES
][64];
278 /* Number of operands for each OpenMP clause. */
279 unsigned const char omp_clause_num_ops
[] =
281 0, /* OMP_CLAUSE_ERROR */
282 1, /* OMP_CLAUSE_PRIVATE */
283 1, /* OMP_CLAUSE_SHARED */
284 1, /* OMP_CLAUSE_FIRSTPRIVATE */
285 2, /* OMP_CLAUSE_LASTPRIVATE */
286 5, /* OMP_CLAUSE_REDUCTION */
287 5, /* OMP_CLAUSE_TASK_REDUCTION */
288 5, /* OMP_CLAUSE_IN_REDUCTION */
289 1, /* OMP_CLAUSE_COPYIN */
290 1, /* OMP_CLAUSE_COPYPRIVATE */
291 3, /* OMP_CLAUSE_LINEAR */
292 2, /* OMP_CLAUSE_ALIGNED */
293 1, /* OMP_CLAUSE_DEPEND */
294 1, /* OMP_CLAUSE_NONTEMPORAL */
295 1, /* OMP_CLAUSE_UNIFORM */
296 1, /* OMP_CLAUSE_TO_DECLARE */
297 1, /* OMP_CLAUSE_LINK */
298 2, /* OMP_CLAUSE_FROM */
299 2, /* OMP_CLAUSE_TO */
300 2, /* OMP_CLAUSE_MAP */
301 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
302 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
303 1, /* OMP_CLAUSE_INCLUSIVE */
304 1, /* OMP_CLAUSE_EXCLUSIVE */
305 2, /* OMP_CLAUSE__CACHE_ */
306 2, /* OMP_CLAUSE_GANG */
307 1, /* OMP_CLAUSE_ASYNC */
308 1, /* OMP_CLAUSE_WAIT */
309 0, /* OMP_CLAUSE_AUTO */
310 0, /* OMP_CLAUSE_SEQ */
311 1, /* OMP_CLAUSE__LOOPTEMP_ */
312 1, /* OMP_CLAUSE__REDUCTEMP_ */
313 1, /* OMP_CLAUSE__CONDTEMP_ */
314 1, /* OMP_CLAUSE__SCANTEMP_ */
315 1, /* OMP_CLAUSE_IF */
316 1, /* OMP_CLAUSE_NUM_THREADS */
317 1, /* OMP_CLAUSE_SCHEDULE */
318 0, /* OMP_CLAUSE_NOWAIT */
319 1, /* OMP_CLAUSE_ORDERED */
320 0, /* OMP_CLAUSE_DEFAULT */
321 3, /* OMP_CLAUSE_COLLAPSE */
322 0, /* OMP_CLAUSE_UNTIED */
323 1, /* OMP_CLAUSE_FINAL */
324 0, /* OMP_CLAUSE_MERGEABLE */
325 1, /* OMP_CLAUSE_DEVICE */
326 1, /* OMP_CLAUSE_DIST_SCHEDULE */
327 0, /* OMP_CLAUSE_INBRANCH */
328 0, /* OMP_CLAUSE_NOTINBRANCH */
329 1, /* OMP_CLAUSE_NUM_TEAMS */
330 1, /* OMP_CLAUSE_THREAD_LIMIT */
331 0, /* OMP_CLAUSE_PROC_BIND */
332 1, /* OMP_CLAUSE_SAFELEN */
333 1, /* OMP_CLAUSE_SIMDLEN */
334 0, /* OMP_CLAUSE_FOR */
335 0, /* OMP_CLAUSE_PARALLEL */
336 0, /* OMP_CLAUSE_SECTIONS */
337 0, /* OMP_CLAUSE_TASKGROUP */
338 1, /* OMP_CLAUSE_PRIORITY */
339 1, /* OMP_CLAUSE_GRAINSIZE */
340 1, /* OMP_CLAUSE_NUM_TASKS */
341 0, /* OMP_CLAUSE_NOGROUP */
342 0, /* OMP_CLAUSE_THREADS */
343 0, /* OMP_CLAUSE_SIMD */
344 1, /* OMP_CLAUSE_HINT */
345 0, /* OMP_CLAUSE_DEFALTMAP */
346 1, /* OMP_CLAUSE__SIMDUID_ */
347 0, /* OMP_CLAUSE__SIMT_ */
348 0, /* OMP_CLAUSE_INDEPENDENT */
349 1, /* OMP_CLAUSE_WORKER */
350 1, /* OMP_CLAUSE_VECTOR */
351 1, /* OMP_CLAUSE_NUM_GANGS */
352 1, /* OMP_CLAUSE_NUM_WORKERS */
353 1, /* OMP_CLAUSE_VECTOR_LENGTH */
354 3, /* OMP_CLAUSE_TILE */
355 2, /* OMP_CLAUSE__GRIDDIM_ */
356 0, /* OMP_CLAUSE_IF_PRESENT */
357 0, /* OMP_CLAUSE_FINALIZE */
360 const char * const omp_clause_code_name
[] =
442 /* Return the tree node structure used by tree code CODE. */
444 static inline enum tree_node_structure_enum
445 tree_node_structure_for_code (enum tree_code code
)
447 switch (TREE_CODE_CLASS (code
))
449 case tcc_declaration
:
454 return TS_FIELD_DECL
;
460 return TS_LABEL_DECL
;
462 return TS_RESULT_DECL
;
463 case DEBUG_EXPR_DECL
:
466 return TS_CONST_DECL
;
470 return TS_FUNCTION_DECL
;
471 case TRANSLATION_UNIT_DECL
:
472 return TS_TRANSLATION_UNIT_DECL
;
474 return TS_DECL_NON_COMMON
;
478 return TS_TYPE_NON_COMMON
;
487 default: /* tcc_constant and tcc_exceptional */
492 /* tcc_constant cases. */
493 case VOID_CST
: return TS_TYPED
;
494 case INTEGER_CST
: return TS_INT_CST
;
495 case POLY_INT_CST
: return TS_POLY_INT_CST
;
496 case REAL_CST
: return TS_REAL_CST
;
497 case FIXED_CST
: return TS_FIXED_CST
;
498 case COMPLEX_CST
: return TS_COMPLEX
;
499 case VECTOR_CST
: return TS_VECTOR
;
500 case STRING_CST
: return TS_STRING
;
501 /* tcc_exceptional cases. */
502 case ERROR_MARK
: return TS_COMMON
;
503 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
504 case TREE_LIST
: return TS_LIST
;
505 case TREE_VEC
: return TS_VEC
;
506 case SSA_NAME
: return TS_SSA_NAME
;
507 case PLACEHOLDER_EXPR
: return TS_COMMON
;
508 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
509 case BLOCK
: return TS_BLOCK
;
510 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
511 case TREE_BINFO
: return TS_BINFO
;
512 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
513 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
514 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
522 /* Initialize tree_contains_struct to describe the hierarchy of tree
526 initialize_tree_contains_struct (void)
530 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
533 enum tree_node_structure_enum ts_code
;
535 code
= (enum tree_code
) i
;
536 ts_code
= tree_node_structure_for_code (code
);
538 /* Mark the TS structure itself. */
539 tree_contains_struct
[code
][ts_code
] = 1;
541 /* Mark all the structures that TS is derived from. */
546 case TS_OPTIMIZATION
:
547 case TS_TARGET_OPTION
:
553 case TS_POLY_INT_CST
:
562 case TS_STATEMENT_LIST
:
563 MARK_TS_TYPED (code
);
567 case TS_DECL_MINIMAL
:
573 MARK_TS_COMMON (code
);
576 case TS_TYPE_WITH_LANG_SPECIFIC
:
577 MARK_TS_TYPE_COMMON (code
);
580 case TS_TYPE_NON_COMMON
:
581 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
585 MARK_TS_DECL_MINIMAL (code
);
590 MARK_TS_DECL_COMMON (code
);
593 case TS_DECL_NON_COMMON
:
594 MARK_TS_DECL_WITH_VIS (code
);
597 case TS_DECL_WITH_VIS
:
601 MARK_TS_DECL_WRTL (code
);
605 MARK_TS_DECL_COMMON (code
);
609 MARK_TS_DECL_WITH_VIS (code
);
613 case TS_FUNCTION_DECL
:
614 MARK_TS_DECL_NON_COMMON (code
);
617 case TS_TRANSLATION_UNIT_DECL
:
618 MARK_TS_DECL_COMMON (code
);
626 /* Basic consistency checks for attributes used in fold. */
627 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
628 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
629 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
632 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
633 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
634 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
635 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
636 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
637 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
638 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
639 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
640 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
641 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
642 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
643 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
645 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
646 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
647 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
648 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
649 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
650 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
651 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
652 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
653 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
654 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
655 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
656 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
657 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
658 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
659 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
660 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
661 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
662 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
663 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
664 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
665 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
666 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
675 /* Initialize the hash table of types. */
677 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
680 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
683 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
685 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
687 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
689 int_cst_node
= make_int_cst (1, 1);
691 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
693 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
694 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
696 /* Initialize the tree_contains_struct array. */
697 initialize_tree_contains_struct ();
698 lang_hooks
.init_ts ();
702 /* The name of the object as the assembler will see it (but before any
703 translations made by ASM_OUTPUT_LABELREF). Often this is the same
704 as DECL_NAME. It is an IDENTIFIER_NODE. */
706 decl_assembler_name (tree decl
)
708 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
709 lang_hooks
.set_decl_assembler_name (decl
);
710 return DECL_ASSEMBLER_NAME_RAW (decl
);
713 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
714 (either of which may be NULL). Inform the FE, if this changes the
718 overwrite_decl_assembler_name (tree decl
, tree name
)
720 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
721 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
724 /* When the target supports COMDAT groups, this indicates which group the
725 DECL is associated with. This can be either an IDENTIFIER_NODE or a
726 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
728 decl_comdat_group (const_tree node
)
730 struct symtab_node
*snode
= symtab_node::get (node
);
733 return snode
->get_comdat_group ();
736 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
738 decl_comdat_group_id (const_tree node
)
740 struct symtab_node
*snode
= symtab_node::get (node
);
743 return snode
->get_comdat_group_id ();
746 /* When the target supports named section, return its name as IDENTIFIER_NODE
747 or NULL if it is in no section. */
749 decl_section_name (const_tree node
)
751 struct symtab_node
*snode
= symtab_node::get (node
);
754 return snode
->get_section ();
757 /* Set section name of NODE to VALUE (that is expected to be
760 set_decl_section_name (tree node
, const char *value
)
762 struct symtab_node
*snode
;
766 snode
= symtab_node::get (node
);
770 else if (VAR_P (node
))
771 snode
= varpool_node::get_create (node
);
773 snode
= cgraph_node::get_create (node
);
774 snode
->set_section (value
);
777 /* Return TLS model of a variable NODE. */
779 decl_tls_model (const_tree node
)
781 struct varpool_node
*snode
= varpool_node::get (node
);
783 return TLS_MODEL_NONE
;
784 return snode
->tls_model
;
787 /* Set TLS model of variable NODE to MODEL. */
789 set_decl_tls_model (tree node
, enum tls_model model
)
791 struct varpool_node
*vnode
;
793 if (model
== TLS_MODEL_NONE
)
795 vnode
= varpool_node::get (node
);
800 vnode
= varpool_node::get_create (node
);
801 vnode
->tls_model
= model
;
804 /* Compute the number of bytes occupied by a tree with code CODE.
805 This function cannot be used for nodes that have variable sizes,
806 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
808 tree_code_size (enum tree_code code
)
810 switch (TREE_CODE_CLASS (code
))
812 case tcc_declaration
: /* A decl node */
815 case FIELD_DECL
: return sizeof (tree_field_decl
);
816 case PARM_DECL
: return sizeof (tree_parm_decl
);
817 case VAR_DECL
: return sizeof (tree_var_decl
);
818 case LABEL_DECL
: return sizeof (tree_label_decl
);
819 case RESULT_DECL
: return sizeof (tree_result_decl
);
820 case CONST_DECL
: return sizeof (tree_const_decl
);
821 case TYPE_DECL
: return sizeof (tree_type_decl
);
822 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
823 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
824 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
827 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
829 gcc_checking_assert (code
>= NUM_TREE_CODES
);
830 return lang_hooks
.tree_size (code
);
833 case tcc_type
: /* a type node */
844 case FIXED_POINT_TYPE
:
850 case QUAL_UNION_TYPE
:
854 case LANG_TYPE
: return sizeof (tree_type_non_common
);
856 gcc_checking_assert (code
>= NUM_TREE_CODES
);
857 return lang_hooks
.tree_size (code
);
860 case tcc_reference
: /* a reference */
861 case tcc_expression
: /* an expression */
862 case tcc_statement
: /* an expression with side effects */
863 case tcc_comparison
: /* a comparison expression */
864 case tcc_unary
: /* a unary arithmetic expression */
865 case tcc_binary
: /* a binary arithmetic expression */
866 return (sizeof (struct tree_exp
)
867 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
869 case tcc_constant
: /* a constant */
872 case VOID_CST
: return sizeof (tree_typed
);
873 case INTEGER_CST
: gcc_unreachable ();
874 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
875 case REAL_CST
: return sizeof (tree_real_cst
);
876 case FIXED_CST
: return sizeof (tree_fixed_cst
);
877 case COMPLEX_CST
: return sizeof (tree_complex
);
878 case VECTOR_CST
: gcc_unreachable ();
879 case STRING_CST
: gcc_unreachable ();
881 gcc_checking_assert (code
>= NUM_TREE_CODES
);
882 return lang_hooks
.tree_size (code
);
885 case tcc_exceptional
: /* something random, like an identifier. */
888 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
889 case TREE_LIST
: return sizeof (tree_list
);
892 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
894 case TREE_VEC
: gcc_unreachable ();
895 case OMP_CLAUSE
: gcc_unreachable ();
897 case SSA_NAME
: return sizeof (tree_ssa_name
);
899 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
900 case BLOCK
: return sizeof (struct tree_block
);
901 case CONSTRUCTOR
: return sizeof (tree_constructor
);
902 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
903 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
906 gcc_checking_assert (code
>= NUM_TREE_CODES
);
907 return lang_hooks
.tree_size (code
);
915 /* Compute the number of bytes occupied by NODE. This routine only
916 looks at TREE_CODE, except for those nodes that have variable sizes. */
918 tree_size (const_tree node
)
920 const enum tree_code code
= TREE_CODE (node
);
924 return (sizeof (struct tree_int_cst
)
925 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
928 return (offsetof (struct tree_binfo
, base_binfos
)
930 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
933 return (sizeof (struct tree_vec
)
934 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
937 return (sizeof (struct tree_vector
)
938 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
941 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
944 return (sizeof (struct tree_omp_clause
)
945 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
949 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
950 return (sizeof (struct tree_exp
)
951 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
953 return tree_code_size (code
);
957 /* Return tree node kind based on tree CODE. */
959 static tree_node_kind
960 get_stats_node_kind (enum tree_code code
)
962 enum tree_code_class type
= TREE_CODE_CLASS (code
);
966 case tcc_declaration
: /* A decl node */
968 case tcc_type
: /* a type node */
970 case tcc_statement
: /* an expression with side effects */
972 case tcc_reference
: /* a reference */
974 case tcc_expression
: /* an expression */
975 case tcc_comparison
: /* a comparison expression */
976 case tcc_unary
: /* a unary arithmetic expression */
977 case tcc_binary
: /* a binary arithmetic expression */
979 case tcc_constant
: /* a constant */
981 case tcc_exceptional
: /* something random, like an identifier. */
984 case IDENTIFIER_NODE
:
991 return ssa_name_kind
;
997 return omp_clause_kind
;
1009 /* Record interesting allocation statistics for a tree node with CODE
1013 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1015 if (!GATHER_STATISTICS
)
1018 tree_node_kind kind
= get_stats_node_kind (code
);
1020 tree_code_counts
[(int) code
]++;
1021 tree_node_counts
[(int) kind
]++;
1022 tree_node_sizes
[(int) kind
] += length
;
1025 /* Allocate and return a new UID from the DECL_UID namespace. */
1028 allocate_decl_uid (void)
1030 return next_decl_uid
++;
1033 /* Return a newly allocated node of code CODE. For decl and type
1034 nodes, some other fields are initialized. The rest of the node is
1035 initialized to zero. This function cannot be used for TREE_VEC,
1036 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1039 Achoo! I got a code in the node. */
1042 make_node (enum tree_code code MEM_STAT_DECL
)
1045 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1046 size_t length
= tree_code_size (code
);
1048 record_node_allocation_statistics (code
, length
);
1050 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1051 TREE_SET_CODE (t
, code
);
1056 if (code
!= DEBUG_BEGIN_STMT
)
1057 TREE_SIDE_EFFECTS (t
) = 1;
1060 case tcc_declaration
:
1061 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1063 if (code
== FUNCTION_DECL
)
1065 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1066 SET_DECL_MODE (t
, FUNCTION_MODE
);
1069 SET_DECL_ALIGN (t
, 1);
1071 DECL_SOURCE_LOCATION (t
) = input_location
;
1072 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1073 DECL_UID (t
) = --next_debug_decl_uid
;
1076 DECL_UID (t
) = allocate_decl_uid ();
1077 SET_DECL_PT_UID (t
, -1);
1079 if (TREE_CODE (t
) == LABEL_DECL
)
1080 LABEL_DECL_UID (t
) = -1;
1085 TYPE_UID (t
) = next_type_uid
++;
1086 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1087 TYPE_USER_ALIGN (t
) = 0;
1088 TYPE_MAIN_VARIANT (t
) = t
;
1089 TYPE_CANONICAL (t
) = t
;
1091 /* Default to no attributes for type, but let target change that. */
1092 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1093 targetm
.set_default_type_attributes (t
);
1095 /* We have not yet computed the alias set for this type. */
1096 TYPE_ALIAS_SET (t
) = -1;
1100 TREE_CONSTANT (t
) = 1;
1103 case tcc_expression
:
1109 case PREDECREMENT_EXPR
:
1110 case PREINCREMENT_EXPR
:
1111 case POSTDECREMENT_EXPR
:
1112 case POSTINCREMENT_EXPR
:
1113 /* All of these have side-effects, no matter what their
1115 TREE_SIDE_EFFECTS (t
) = 1;
1123 case tcc_exceptional
:
1126 case TARGET_OPTION_NODE
:
1127 TREE_TARGET_OPTION(t
)
1128 = ggc_cleared_alloc
<struct cl_target_option
> ();
1131 case OPTIMIZATION_NODE
:
1132 TREE_OPTIMIZATION (t
)
1133 = ggc_cleared_alloc
<struct cl_optimization
> ();
1142 /* Other classes need no special treatment. */
1149 /* Free tree node. */
1152 free_node (tree node
)
1154 enum tree_code code
= TREE_CODE (node
);
1155 if (GATHER_STATISTICS
)
1157 enum tree_node_kind kind
= get_stats_node_kind (code
);
1159 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1160 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1161 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1163 tree_code_counts
[(int) TREE_CODE (node
)]--;
1164 tree_node_counts
[(int) kind
]--;
1165 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1167 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1168 vec_free (CONSTRUCTOR_ELTS (node
));
1169 else if (code
== BLOCK
)
1170 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1171 else if (code
== TREE_BINFO
)
1172 vec_free (BINFO_BASE_ACCESSES (node
));
1176 /* Return a new node with the same contents as NODE except that its
1177 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1180 copy_node (tree node MEM_STAT_DECL
)
1183 enum tree_code code
= TREE_CODE (node
);
1186 gcc_assert (code
!= STATEMENT_LIST
);
1188 length
= tree_size (node
);
1189 record_node_allocation_statistics (code
, length
);
1190 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1191 memcpy (t
, node
, length
);
1193 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1195 TREE_ASM_WRITTEN (t
) = 0;
1196 TREE_VISITED (t
) = 0;
1198 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1200 if (code
== DEBUG_EXPR_DECL
)
1201 DECL_UID (t
) = --next_debug_decl_uid
;
1204 DECL_UID (t
) = allocate_decl_uid ();
1205 if (DECL_PT_UID_SET_P (node
))
1206 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1208 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1209 && DECL_HAS_VALUE_EXPR_P (node
))
1211 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1212 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1214 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1217 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1218 t
->decl_with_vis
.symtab_node
= NULL
;
1220 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1222 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1223 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1225 if (TREE_CODE (node
) == FUNCTION_DECL
)
1227 DECL_STRUCT_FUNCTION (t
) = NULL
;
1228 t
->decl_with_vis
.symtab_node
= NULL
;
1231 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1233 TYPE_UID (t
) = next_type_uid
++;
1234 /* The following is so that the debug code for
1235 the copy is different from the original type.
1236 The two statements usually duplicate each other
1237 (because they clear fields of the same union),
1238 but the optimizer should catch that. */
1239 TYPE_SYMTAB_ADDRESS (t
) = 0;
1240 TYPE_SYMTAB_DIE (t
) = 0;
1242 /* Do not copy the values cache. */
1243 if (TYPE_CACHED_VALUES_P (t
))
1245 TYPE_CACHED_VALUES_P (t
) = 0;
1246 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1249 else if (code
== TARGET_OPTION_NODE
)
1251 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1252 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1253 sizeof (struct cl_target_option
));
1255 else if (code
== OPTIMIZATION_NODE
)
1257 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1258 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1259 sizeof (struct cl_optimization
));
1265 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1266 For example, this can copy a list made of TREE_LIST nodes. */
1269 copy_list (tree list
)
1277 head
= prev
= copy_node (list
);
1278 next
= TREE_CHAIN (list
);
1281 TREE_CHAIN (prev
) = copy_node (next
);
1282 prev
= TREE_CHAIN (prev
);
1283 next
= TREE_CHAIN (next
);
1289 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1290 INTEGER_CST with value CST and type TYPE. */
1293 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1295 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1296 /* We need extra HWIs if CST is an unsigned integer with its
1298 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1299 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1300 return cst
.get_len ();
1303 /* Return a new INTEGER_CST with value CST and type TYPE. */
1306 build_new_int_cst (tree type
, const wide_int
&cst
)
1308 unsigned int len
= cst
.get_len ();
1309 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1310 tree nt
= make_int_cst (len
, ext_len
);
1315 TREE_INT_CST_ELT (nt
, ext_len
)
1316 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1317 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1318 TREE_INT_CST_ELT (nt
, i
) = -1;
1320 else if (TYPE_UNSIGNED (type
)
1321 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1324 TREE_INT_CST_ELT (nt
, len
)
1325 = zext_hwi (cst
.elt (len
),
1326 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1329 for (unsigned int i
= 0; i
< len
; i
++)
1330 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1331 TREE_TYPE (nt
) = type
;
1335 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1338 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1341 size_t length
= sizeof (struct tree_poly_int_cst
);
1342 record_node_allocation_statistics (POLY_INT_CST
, length
);
1344 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1346 TREE_SET_CODE (t
, POLY_INT_CST
);
1347 TREE_CONSTANT (t
) = 1;
1348 TREE_TYPE (t
) = type
;
1349 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1350 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1354 /* Create a constant tree that contains CST sign-extended to TYPE. */
1357 build_int_cst (tree type
, poly_int64 cst
)
1359 /* Support legacy code. */
1361 type
= integer_type_node
;
1363 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1366 /* Create a constant tree that contains CST zero-extended to TYPE. */
1369 build_int_cstu (tree type
, poly_uint64 cst
)
1371 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1374 /* Create a constant tree that contains CST sign-extended to TYPE. */
1377 build_int_cst_type (tree type
, poly_int64 cst
)
1380 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1383 /* Constructs tree in type TYPE from with value given by CST. Signedness
1384 of CST is assumed to be the same as the signedness of TYPE. */
1387 double_int_to_tree (tree type
, double_int cst
)
1389 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1392 /* We force the wide_int CST to the range of the type TYPE by sign or
1393 zero extending it. OVERFLOWABLE indicates if we are interested in
1394 overflow of the value, when >0 we are only interested in signed
1395 overflow, for <0 we are interested in any overflow. OVERFLOWED
1396 indicates whether overflow has already occurred. CONST_OVERFLOWED
1397 indicates whether constant overflow has already occurred. We force
1398 T's value to be within range of T's type (by setting to 0 or 1 all
1399 the bits outside the type's range). We set TREE_OVERFLOWED if,
1400 OVERFLOWED is nonzero,
1401 or OVERFLOWABLE is >0 and signed overflow occurs
1402 or OVERFLOWABLE is <0 and any overflow occurs
1403 We return a new tree node for the extended wide_int. The node
1404 is shared if no overflow flags are set. */
1408 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1409 int overflowable
, bool overflowed
)
1411 signop sign
= TYPE_SIGN (type
);
1413 /* If we need to set overflow flags, return a new unshared node. */
1414 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1418 || (overflowable
> 0 && sign
== SIGNED
))
1420 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1423 if (tmp
.is_constant ())
1424 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1427 tree coeffs
[NUM_POLY_INT_COEFFS
];
1428 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1430 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1431 TREE_OVERFLOW (coeffs
[i
]) = 1;
1433 t
= build_new_poly_int_cst (type
, coeffs
);
1435 TREE_OVERFLOW (t
) = 1;
1440 /* Else build a shared node. */
1441 return wide_int_to_tree (type
, cst
);
1444 /* These are the hash table functions for the hash table of INTEGER_CST
1445 nodes of a sizetype. */
1447 /* Return the hash code X, an INTEGER_CST. */
1450 int_cst_hasher::hash (tree x
)
1452 const_tree
const t
= x
;
1453 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1456 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1457 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1462 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1463 is the same as that given by *Y, which is the same. */
1466 int_cst_hasher::equal (tree x
, tree y
)
1468 const_tree
const xt
= x
;
1469 const_tree
const yt
= y
;
1471 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1472 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1473 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1476 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1477 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1483 /* Create an INT_CST node of TYPE and value CST.
1484 The returned node is always shared. For small integers we use a
1485 per-type vector cache, for larger ones we use a single hash table.
1486 The value is extended from its precision according to the sign of
1487 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1488 the upper bits and ensures that hashing and value equality based
1489 upon the underlying HOST_WIDE_INTs works without masking. */
1492 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1499 unsigned int prec
= TYPE_PRECISION (type
);
1500 signop sgn
= TYPE_SIGN (type
);
1502 /* Verify that everything is canonical. */
1503 int l
= pcst
.get_len ();
1506 if (pcst
.elt (l
- 1) == 0)
1507 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1508 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1509 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1512 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1513 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1517 /* We just need to store a single HOST_WIDE_INT. */
1519 if (TYPE_UNSIGNED (type
))
1520 hwi
= cst
.to_uhwi ();
1522 hwi
= cst
.to_shwi ();
1524 switch (TREE_CODE (type
))
1527 gcc_assert (hwi
== 0);
1531 case REFERENCE_TYPE
:
1532 /* Cache NULL pointer and zero bounds. */
1541 /* Cache false or true. */
1543 if (IN_RANGE (hwi
, 0, 1))
1549 if (TYPE_SIGN (type
) == UNSIGNED
)
1552 limit
= INTEGER_SHARE_LIMIT
;
1553 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1558 /* Cache [-1, N). */
1559 limit
= INTEGER_SHARE_LIMIT
+ 1;
1560 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1574 /* Look for it in the type's vector of small shared ints. */
1575 if (!TYPE_CACHED_VALUES_P (type
))
1577 TYPE_CACHED_VALUES_P (type
) = 1;
1578 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1581 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1583 /* Make sure no one is clobbering the shared constant. */
1584 gcc_checking_assert (TREE_TYPE (t
) == type
1585 && TREE_INT_CST_NUNITS (t
) == 1
1586 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1587 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1588 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1591 /* Create a new shared int. */
1592 t
= build_new_int_cst (type
, cst
);
1593 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1598 /* Use the cache of larger shared ints, using int_cst_node as
1601 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1602 TREE_TYPE (int_cst_node
) = type
;
1604 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1608 /* Insert this one into the hash table. */
1611 /* Make a new node for next time round. */
1612 int_cst_node
= make_int_cst (1, 1);
1618 /* The value either hashes properly or we drop it on the floor
1619 for the gc to take care of. There will not be enough of them
1622 tree nt
= build_new_int_cst (type
, cst
);
1623 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1627 /* Insert this one into the hash table. */
1639 poly_int_cst_hasher::hash (tree t
)
1641 inchash::hash hstate
;
1643 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1644 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1645 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1647 return hstate
.end ();
1651 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1653 if (TREE_TYPE (x
) != y
.first
)
1655 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1656 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1661 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1662 The elements must also have type TYPE. */
1665 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1667 unsigned int prec
= TYPE_PRECISION (type
);
1668 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1669 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1672 h
.add_int (TYPE_UID (type
));
1673 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1674 h
.add_wide_int (c
.coeffs
[i
]);
1675 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1676 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1678 if (*slot
== NULL_TREE
)
1680 tree coeffs
[NUM_POLY_INT_COEFFS
];
1681 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1682 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1683 *slot
= build_new_poly_int_cst (type
, coeffs
);
1688 /* Create a constant tree with value VALUE in type TYPE. */
1691 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1693 if (value
.is_constant ())
1694 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1695 return build_poly_int_cst (type
, value
);
1699 cache_integer_cst (tree t
)
1701 tree type
= TREE_TYPE (t
);
1704 int prec
= TYPE_PRECISION (type
);
1706 gcc_assert (!TREE_OVERFLOW (t
));
1708 switch (TREE_CODE (type
))
1711 gcc_assert (integer_zerop (t
));
1715 case REFERENCE_TYPE
:
1716 /* Cache NULL pointer. */
1717 if (integer_zerop (t
))
1725 /* Cache false or true. */
1727 if (wi::ltu_p (wi::to_wide (t
), 2))
1728 ix
= TREE_INT_CST_ELT (t
, 0);
1733 if (TYPE_UNSIGNED (type
))
1736 limit
= INTEGER_SHARE_LIMIT
;
1738 /* This is a little hokie, but if the prec is smaller than
1739 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1740 obvious test will not get the correct answer. */
1741 if (prec
< HOST_BITS_PER_WIDE_INT
)
1743 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1744 ix
= tree_to_uhwi (t
);
1746 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1747 ix
= tree_to_uhwi (t
);
1752 limit
= INTEGER_SHARE_LIMIT
+ 1;
1754 if (integer_minus_onep (t
))
1756 else if (!wi::neg_p (wi::to_wide (t
)))
1758 if (prec
< HOST_BITS_PER_WIDE_INT
)
1760 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1761 ix
= tree_to_shwi (t
) + 1;
1763 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1764 ix
= tree_to_shwi (t
) + 1;
1778 /* Look for it in the type's vector of small shared ints. */
1779 if (!TYPE_CACHED_VALUES_P (type
))
1781 TYPE_CACHED_VALUES_P (type
) = 1;
1782 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1785 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1786 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1790 /* Use the cache of larger shared ints. */
1791 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1792 /* If there is already an entry for the number verify it's the
1795 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1797 /* Otherwise insert this one into the hash table. */
1803 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1804 and the rest are zeros. */
1807 build_low_bits_mask (tree type
, unsigned bits
)
1809 gcc_assert (bits
<= TYPE_PRECISION (type
));
1811 return wide_int_to_tree (type
, wi::mask (bits
, false,
1812 TYPE_PRECISION (type
)));
1815 /* Checks that X is integer constant that can be expressed in (unsigned)
1816 HOST_WIDE_INT without loss of precision. */
1819 cst_and_fits_in_hwi (const_tree x
)
1821 return (TREE_CODE (x
) == INTEGER_CST
1822 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1825 /* Build a newly constructed VECTOR_CST with the given values of
1826 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1829 make_vector (unsigned log2_npatterns
,
1830 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1832 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1834 unsigned npatterns
= 1 << log2_npatterns
;
1835 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1836 unsigned length
= (sizeof (struct tree_vector
)
1837 + (encoded_nelts
- 1) * sizeof (tree
));
1839 record_node_allocation_statistics (VECTOR_CST
, length
);
1841 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1843 TREE_SET_CODE (t
, VECTOR_CST
);
1844 TREE_CONSTANT (t
) = 1;
1845 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1846 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1851 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1852 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1855 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1857 unsigned HOST_WIDE_INT idx
, nelts
;
1860 /* We can't construct a VECTOR_CST for a variable number of elements. */
1861 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1862 tree_vector_builder
vec (type
, nelts
, 1);
1863 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1865 if (TREE_CODE (value
) == VECTOR_CST
)
1867 /* If NELTS is constant then this must be too. */
1868 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1869 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1870 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1873 vec
.quick_push (value
);
1875 while (vec
.length () < nelts
)
1876 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1878 return vec
.build ();
1881 /* Build a vector of type VECTYPE where all the elements are SCs. */
1883 build_vector_from_val (tree vectype
, tree sc
)
1885 unsigned HOST_WIDE_INT i
, nunits
;
1887 if (sc
== error_mark_node
)
1890 /* Verify that the vector type is suitable for SC. Note that there
1891 is some inconsistency in the type-system with respect to restrict
1892 qualifications of pointers. Vector types always have a main-variant
1893 element type and the qualification is applied to the vector-type.
1894 So TREE_TYPE (vector-type) does not return a properly qualified
1895 vector element-type. */
1896 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1897 TREE_TYPE (vectype
)));
1899 if (CONSTANT_CLASS_P (sc
))
1901 tree_vector_builder
v (vectype
, 1, 1);
1905 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1906 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1909 vec
<constructor_elt
, va_gc
> *v
;
1910 vec_alloc (v
, nunits
);
1911 for (i
= 0; i
< nunits
; ++i
)
1912 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1913 return build_constructor (vectype
, v
);
1917 /* If TYPE is not a vector type, just return SC, otherwise return
1918 build_vector_from_val (TYPE, SC). */
1921 build_uniform_cst (tree type
, tree sc
)
1923 if (!VECTOR_TYPE_P (type
))
1926 return build_vector_from_val (type
, sc
);
1929 /* Build a vector series of type TYPE in which element I has the value
1930 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1931 and a VEC_SERIES_EXPR otherwise. */
1934 build_vec_series (tree type
, tree base
, tree step
)
1936 if (integer_zerop (step
))
1937 return build_vector_from_val (type
, base
);
1938 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1940 tree_vector_builder
builder (type
, 1, 3);
1941 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1942 wi::to_wide (base
) + wi::to_wide (step
));
1943 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1944 wi::to_wide (elt1
) + wi::to_wide (step
));
1945 builder
.quick_push (base
);
1946 builder
.quick_push (elt1
);
1947 builder
.quick_push (elt2
);
1948 return builder
.build ();
1950 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1953 /* Return a vector with the same number of units and number of bits
1954 as VEC_TYPE, but in which the elements are a linear series of unsigned
1955 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1958 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1960 tree index_vec_type
= vec_type
;
1961 tree index_elt_type
= TREE_TYPE (vec_type
);
1962 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1963 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1965 index_elt_type
= build_nonstandard_integer_type
1966 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1967 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1970 tree_vector_builder
v (index_vec_type
, 1, 3);
1971 for (unsigned int i
= 0; i
< 3; ++i
)
1972 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1976 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1977 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1980 recompute_constructor_flags (tree c
)
1984 bool constant_p
= true;
1985 bool side_effects_p
= false;
1986 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1988 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1990 /* Mostly ctors will have elts that don't have side-effects, so
1991 the usual case is to scan all the elements. Hence a single
1992 loop for both const and side effects, rather than one loop
1993 each (with early outs). */
1994 if (!TREE_CONSTANT (val
))
1996 if (TREE_SIDE_EFFECTS (val
))
1997 side_effects_p
= true;
2000 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
2001 TREE_CONSTANT (c
) = constant_p
;
2004 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2008 verify_constructor_flags (tree c
)
2012 bool constant_p
= TREE_CONSTANT (c
);
2013 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2014 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2016 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2018 if (constant_p
&& !TREE_CONSTANT (val
))
2019 internal_error ("non-constant element in constant CONSTRUCTOR");
2020 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2021 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2025 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2026 are in the vec pointed to by VALS. */
2028 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals MEM_STAT_DECL
)
2030 tree c
= make_node (CONSTRUCTOR PASS_MEM_STAT
);
2032 TREE_TYPE (c
) = type
;
2033 CONSTRUCTOR_ELTS (c
) = vals
;
2035 recompute_constructor_flags (c
);
2040 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2043 build_constructor_single (tree type
, tree index
, tree value
)
2045 vec
<constructor_elt
, va_gc
> *v
;
2046 constructor_elt elt
= {index
, value
};
2049 v
->quick_push (elt
);
2051 return build_constructor (type
, v
);
2055 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2056 are in a list pointed to by VALS. */
2058 build_constructor_from_list (tree type
, tree vals
)
2061 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2065 vec_alloc (v
, list_length (vals
));
2066 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2067 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2070 return build_constructor (type
, v
);
2073 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2074 of elements, provided as index/value pairs. */
2077 build_constructor_va (tree type
, int nelts
, ...)
2079 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2082 va_start (p
, nelts
);
2083 vec_alloc (v
, nelts
);
2086 tree index
= va_arg (p
, tree
);
2087 tree value
= va_arg (p
, tree
);
2088 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2091 return build_constructor (type
, v
);
2094 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2097 build_clobber (tree type
)
2099 tree clobber
= build_constructor (type
, NULL
);
2100 TREE_THIS_VOLATILE (clobber
) = true;
2104 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2107 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2110 FIXED_VALUE_TYPE
*fp
;
2112 v
= make_node (FIXED_CST
);
2113 fp
= ggc_alloc
<fixed_value
> ();
2114 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2116 TREE_TYPE (v
) = type
;
2117 TREE_FIXED_CST_PTR (v
) = fp
;
2121 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2124 build_real (tree type
, REAL_VALUE_TYPE d
)
2127 REAL_VALUE_TYPE
*dp
;
2130 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2131 Consider doing it via real_convert now. */
2133 v
= make_node (REAL_CST
);
2134 dp
= ggc_alloc
<real_value
> ();
2135 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2137 TREE_TYPE (v
) = type
;
2138 TREE_REAL_CST_PTR (v
) = dp
;
2139 TREE_OVERFLOW (v
) = overflow
;
2143 /* Like build_real, but first truncate D to the type. */
2146 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2148 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2151 /* Return a new REAL_CST node whose type is TYPE
2152 and whose value is the integer value of the INTEGER_CST node I. */
2155 real_value_from_int_cst (const_tree type
, const_tree i
)
2159 /* Clear all bits of the real value type so that we can later do
2160 bitwise comparisons to see if two values are the same. */
2161 memset (&d
, 0, sizeof d
);
2163 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2164 TYPE_SIGN (TREE_TYPE (i
)));
2168 /* Given a tree representing an integer constant I, return a tree
2169 representing the same value as a floating-point constant of type TYPE. */
2172 build_real_from_int_cst (tree type
, const_tree i
)
2175 int overflow
= TREE_OVERFLOW (i
);
2177 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2179 TREE_OVERFLOW (v
) |= overflow
;
2183 /* Return a newly constructed STRING_CST node whose value is
2184 the LEN characters at STR.
2185 Note that for a C string literal, LEN should include the trailing NUL.
2186 The TREE_TYPE is not initialized. */
2189 build_string (int len
, const char *str
)
2194 /* Do not waste bytes provided by padding of struct tree_string. */
2195 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2197 record_node_allocation_statistics (STRING_CST
, length
);
2199 s
= (tree
) ggc_internal_alloc (length
);
2201 memset (s
, 0, sizeof (struct tree_typed
));
2202 TREE_SET_CODE (s
, STRING_CST
);
2203 TREE_CONSTANT (s
) = 1;
2204 TREE_STRING_LENGTH (s
) = len
;
2205 memcpy (s
->string
.str
, str
, len
);
2206 s
->string
.str
[len
] = '\0';
2211 /* Return a newly constructed COMPLEX_CST node whose value is
2212 specified by the real and imaginary parts REAL and IMAG.
2213 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2214 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2217 build_complex (tree type
, tree real
, tree imag
)
2219 gcc_assert (CONSTANT_CLASS_P (real
));
2220 gcc_assert (CONSTANT_CLASS_P (imag
));
2222 tree t
= make_node (COMPLEX_CST
);
2224 TREE_REALPART (t
) = real
;
2225 TREE_IMAGPART (t
) = imag
;
2226 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2227 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2231 /* Build a complex (inf +- 0i), such as for the result of cproj.
2232 TYPE is the complex tree type of the result. If NEG is true, the
2233 imaginary zero is negative. */
2236 build_complex_inf (tree type
, bool neg
)
2238 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2242 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2243 build_real (TREE_TYPE (type
), rzero
));
2246 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2247 element is set to 1. In particular, this is 1 + i for complex types. */
2250 build_each_one_cst (tree type
)
2252 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2254 tree scalar
= build_one_cst (TREE_TYPE (type
));
2255 return build_complex (type
, scalar
, scalar
);
2258 return build_one_cst (type
);
2261 /* Return a constant of arithmetic type TYPE which is the
2262 multiplicative identity of the set TYPE. */
2265 build_one_cst (tree type
)
2267 switch (TREE_CODE (type
))
2269 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2270 case POINTER_TYPE
: case REFERENCE_TYPE
:
2272 return build_int_cst (type
, 1);
2275 return build_real (type
, dconst1
);
2277 case FIXED_POINT_TYPE
:
2278 /* We can only generate 1 for accum types. */
2279 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2280 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2284 tree scalar
= build_one_cst (TREE_TYPE (type
));
2286 return build_vector_from_val (type
, scalar
);
2290 return build_complex (type
,
2291 build_one_cst (TREE_TYPE (type
)),
2292 build_zero_cst (TREE_TYPE (type
)));
2299 /* Return an integer of type TYPE containing all 1's in as much precision as
2300 it contains, or a complex or vector whose subparts are such integers. */
2303 build_all_ones_cst (tree type
)
2305 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2307 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2308 return build_complex (type
, scalar
, scalar
);
2311 return build_minus_one_cst (type
);
2314 /* Return a constant of arithmetic type TYPE which is the
2315 opposite of the multiplicative identity of the set TYPE. */
2318 build_minus_one_cst (tree type
)
2320 switch (TREE_CODE (type
))
2322 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2323 case POINTER_TYPE
: case REFERENCE_TYPE
:
2325 return build_int_cst (type
, -1);
2328 return build_real (type
, dconstm1
);
2330 case FIXED_POINT_TYPE
:
2331 /* We can only generate 1 for accum types. */
2332 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2333 return build_fixed (type
,
2334 fixed_from_double_int (double_int_minus_one
,
2335 SCALAR_TYPE_MODE (type
)));
2339 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2341 return build_vector_from_val (type
, scalar
);
2345 return build_complex (type
,
2346 build_minus_one_cst (TREE_TYPE (type
)),
2347 build_zero_cst (TREE_TYPE (type
)));
2354 /* Build 0 constant of type TYPE. This is used by constructor folding
2355 and thus the constant should be represented in memory by
2359 build_zero_cst (tree type
)
2361 switch (TREE_CODE (type
))
2363 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2364 case POINTER_TYPE
: case REFERENCE_TYPE
:
2365 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2366 return build_int_cst (type
, 0);
2369 return build_real (type
, dconst0
);
2371 case FIXED_POINT_TYPE
:
2372 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2376 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2378 return build_vector_from_val (type
, scalar
);
2383 tree zero
= build_zero_cst (TREE_TYPE (type
));
2385 return build_complex (type
, zero
, zero
);
2389 if (!AGGREGATE_TYPE_P (type
))
2390 return fold_convert (type
, integer_zero_node
);
2391 return build_constructor (type
, NULL
);
2396 /* Build a BINFO with LEN language slots. */
2399 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2402 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2403 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2405 record_node_allocation_statistics (TREE_BINFO
, length
);
2407 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2409 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2411 TREE_SET_CODE (t
, TREE_BINFO
);
2413 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2418 /* Create a CASE_LABEL_EXPR tree node and return it. */
2421 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2423 tree t
= make_node (CASE_LABEL_EXPR
);
2425 TREE_TYPE (t
) = void_type_node
;
2426 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2428 CASE_LOW (t
) = low_value
;
2429 CASE_HIGH (t
) = high_value
;
2430 CASE_LABEL (t
) = label_decl
;
2431 CASE_CHAIN (t
) = NULL_TREE
;
2436 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2437 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2438 The latter determines the length of the HOST_WIDE_INT vector. */
2441 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2444 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2445 + sizeof (struct tree_int_cst
));
2448 record_node_allocation_statistics (INTEGER_CST
, length
);
2450 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2452 TREE_SET_CODE (t
, INTEGER_CST
);
2453 TREE_INT_CST_NUNITS (t
) = len
;
2454 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2455 /* to_offset can only be applied to trees that are offset_int-sized
2456 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2457 must be exactly the precision of offset_int and so LEN is correct. */
2458 if (ext_len
<= OFFSET_INT_ELTS
)
2459 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2461 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2463 TREE_CONSTANT (t
) = 1;
2468 /* Build a newly constructed TREE_VEC node of length LEN. */
2471 make_tree_vec (int len MEM_STAT_DECL
)
2474 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2476 record_node_allocation_statistics (TREE_VEC
, length
);
2478 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2480 TREE_SET_CODE (t
, TREE_VEC
);
2481 TREE_VEC_LENGTH (t
) = len
;
2486 /* Grow a TREE_VEC node to new length LEN. */
2489 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2491 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2493 int oldlen
= TREE_VEC_LENGTH (v
);
2494 gcc_assert (len
> oldlen
);
2496 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2497 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2499 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2501 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2503 TREE_VEC_LENGTH (v
) = len
;
2508 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2509 fixed, and scalar, complex or vector. */
2512 zerop (const_tree expr
)
2514 return (integer_zerop (expr
)
2515 || real_zerop (expr
)
2516 || fixed_zerop (expr
));
2519 /* Return 1 if EXPR is the integer constant zero or a complex constant
2520 of zero, or a location wrapper for such a constant. */
2523 integer_zerop (const_tree expr
)
2525 STRIP_ANY_LOCATION_WRAPPER (expr
);
2527 switch (TREE_CODE (expr
))
2530 return wi::to_wide (expr
) == 0;
2532 return (integer_zerop (TREE_REALPART (expr
))
2533 && integer_zerop (TREE_IMAGPART (expr
)));
2535 return (VECTOR_CST_NPATTERNS (expr
) == 1
2536 && VECTOR_CST_DUPLICATE_P (expr
)
2537 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2543 /* Return 1 if EXPR is the integer constant one or the corresponding
2544 complex constant, or a location wrapper for such a constant. */
2547 integer_onep (const_tree expr
)
2549 STRIP_ANY_LOCATION_WRAPPER (expr
);
2551 switch (TREE_CODE (expr
))
2554 return wi::eq_p (wi::to_widest (expr
), 1);
2556 return (integer_onep (TREE_REALPART (expr
))
2557 && integer_zerop (TREE_IMAGPART (expr
)));
2559 return (VECTOR_CST_NPATTERNS (expr
) == 1
2560 && VECTOR_CST_DUPLICATE_P (expr
)
2561 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2567 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2568 return 1 if every piece is the integer constant one.
2569 Also return 1 for location wrappers for such a constant. */
2572 integer_each_onep (const_tree expr
)
2574 STRIP_ANY_LOCATION_WRAPPER (expr
);
2576 if (TREE_CODE (expr
) == COMPLEX_CST
)
2577 return (integer_onep (TREE_REALPART (expr
))
2578 && integer_onep (TREE_IMAGPART (expr
)));
2580 return integer_onep (expr
);
2583 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2584 it contains, or a complex or vector whose subparts are such integers,
2585 or a location wrapper for such a constant. */
2588 integer_all_onesp (const_tree expr
)
2590 STRIP_ANY_LOCATION_WRAPPER (expr
);
2592 if (TREE_CODE (expr
) == COMPLEX_CST
2593 && integer_all_onesp (TREE_REALPART (expr
))
2594 && integer_all_onesp (TREE_IMAGPART (expr
)))
2597 else if (TREE_CODE (expr
) == VECTOR_CST
)
2598 return (VECTOR_CST_NPATTERNS (expr
) == 1
2599 && VECTOR_CST_DUPLICATE_P (expr
)
2600 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2602 else if (TREE_CODE (expr
) != INTEGER_CST
)
2605 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2606 == wi::to_wide (expr
));
2609 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2610 for such a constant. */
2613 integer_minus_onep (const_tree expr
)
2615 STRIP_ANY_LOCATION_WRAPPER (expr
);
2617 if (TREE_CODE (expr
) == COMPLEX_CST
)
2618 return (integer_all_onesp (TREE_REALPART (expr
))
2619 && integer_zerop (TREE_IMAGPART (expr
)));
2621 return integer_all_onesp (expr
);
2624 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2625 one bit on), or a location wrapper for such a constant. */
2628 integer_pow2p (const_tree expr
)
2630 STRIP_ANY_LOCATION_WRAPPER (expr
);
2632 if (TREE_CODE (expr
) == COMPLEX_CST
2633 && integer_pow2p (TREE_REALPART (expr
))
2634 && integer_zerop (TREE_IMAGPART (expr
)))
2637 if (TREE_CODE (expr
) != INTEGER_CST
)
2640 return wi::popcount (wi::to_wide (expr
)) == 1;
2643 /* Return 1 if EXPR is an integer constant other than zero or a
2644 complex constant other than zero, or a location wrapper for such a
2648 integer_nonzerop (const_tree expr
)
2650 STRIP_ANY_LOCATION_WRAPPER (expr
);
2652 return ((TREE_CODE (expr
) == INTEGER_CST
2653 && wi::to_wide (expr
) != 0)
2654 || (TREE_CODE (expr
) == COMPLEX_CST
2655 && (integer_nonzerop (TREE_REALPART (expr
))
2656 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2659 /* Return 1 if EXPR is the integer constant one. For vector,
2660 return 1 if every piece is the integer constant minus one
2661 (representing the value TRUE).
2662 Also return 1 for location wrappers for such a constant. */
2665 integer_truep (const_tree expr
)
2667 STRIP_ANY_LOCATION_WRAPPER (expr
);
2669 if (TREE_CODE (expr
) == VECTOR_CST
)
2670 return integer_all_onesp (expr
);
2671 return integer_onep (expr
);
2674 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2675 for such a constant. */
2678 fixed_zerop (const_tree expr
)
2680 STRIP_ANY_LOCATION_WRAPPER (expr
);
2682 return (TREE_CODE (expr
) == FIXED_CST
2683 && TREE_FIXED_CST (expr
).data
.is_zero ());
2686 /* Return the power of two represented by a tree node known to be a
2690 tree_log2 (const_tree expr
)
2692 if (TREE_CODE (expr
) == COMPLEX_CST
)
2693 return tree_log2 (TREE_REALPART (expr
));
2695 return wi::exact_log2 (wi::to_wide (expr
));
2698 /* Similar, but return the largest integer Y such that 2 ** Y is less
2699 than or equal to EXPR. */
2702 tree_floor_log2 (const_tree expr
)
2704 if (TREE_CODE (expr
) == COMPLEX_CST
)
2705 return tree_log2 (TREE_REALPART (expr
));
2707 return wi::floor_log2 (wi::to_wide (expr
));
2710 /* Return number of known trailing zero bits in EXPR, or, if the value of
2711 EXPR is known to be zero, the precision of it's type. */
2714 tree_ctz (const_tree expr
)
2716 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2717 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2720 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2721 switch (TREE_CODE (expr
))
2724 ret1
= wi::ctz (wi::to_wide (expr
));
2725 return MIN (ret1
, prec
);
2727 ret1
= wi::ctz (get_nonzero_bits (expr
));
2728 return MIN (ret1
, prec
);
2735 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2738 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2739 return MIN (ret1
, ret2
);
2740 case POINTER_PLUS_EXPR
:
2741 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2742 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2743 /* Second operand is sizetype, which could be in theory
2744 wider than pointer's precision. Make sure we never
2745 return more than prec. */
2746 ret2
= MIN (ret2
, prec
);
2747 return MIN (ret1
, ret2
);
2749 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2750 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2751 return MAX (ret1
, ret2
);
2753 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2754 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2755 return MIN (ret1
+ ret2
, prec
);
2757 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2758 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2759 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2761 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2762 return MIN (ret1
+ ret2
, prec
);
2766 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2767 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2769 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2770 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2775 case TRUNC_DIV_EXPR
:
2777 case FLOOR_DIV_EXPR
:
2778 case ROUND_DIV_EXPR
:
2779 case EXACT_DIV_EXPR
:
2780 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2781 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2783 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2786 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2794 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2795 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2797 return MIN (ret1
, prec
);
2799 return tree_ctz (TREE_OPERAND (expr
, 0));
2801 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2804 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2805 return MIN (ret1
, ret2
);
2807 return tree_ctz (TREE_OPERAND (expr
, 1));
2809 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2810 if (ret1
> BITS_PER_UNIT
)
2812 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2813 return MIN (ret1
, prec
);
2821 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2822 decimal float constants, so don't return 1 for them.
2823 Also return 1 for location wrappers around such a constant. */
2826 real_zerop (const_tree expr
)
2828 STRIP_ANY_LOCATION_WRAPPER (expr
);
2830 switch (TREE_CODE (expr
))
2833 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2834 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2836 return real_zerop (TREE_REALPART (expr
))
2837 && real_zerop (TREE_IMAGPART (expr
));
2840 /* Don't simply check for a duplicate because the predicate
2841 accepts both +0.0 and -0.0. */
2842 unsigned count
= vector_cst_encoded_nelts (expr
);
2843 for (unsigned int i
= 0; i
< count
; ++i
)
2844 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2853 /* Return 1 if EXPR is the real constant one in real or complex form.
2854 Trailing zeroes matter for decimal float constants, so don't return
2856 Also return 1 for location wrappers around such a constant. */
2859 real_onep (const_tree expr
)
2861 STRIP_ANY_LOCATION_WRAPPER (expr
);
2863 switch (TREE_CODE (expr
))
2866 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2867 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2869 return real_onep (TREE_REALPART (expr
))
2870 && real_zerop (TREE_IMAGPART (expr
));
2872 return (VECTOR_CST_NPATTERNS (expr
) == 1
2873 && VECTOR_CST_DUPLICATE_P (expr
)
2874 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2880 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2881 matter for decimal float constants, so don't return 1 for them.
2882 Also return 1 for location wrappers around such a constant. */
2885 real_minus_onep (const_tree expr
)
2887 STRIP_ANY_LOCATION_WRAPPER (expr
);
2889 switch (TREE_CODE (expr
))
2892 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2893 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2895 return real_minus_onep (TREE_REALPART (expr
))
2896 && real_zerop (TREE_IMAGPART (expr
));
2898 return (VECTOR_CST_NPATTERNS (expr
) == 1
2899 && VECTOR_CST_DUPLICATE_P (expr
)
2900 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2906 /* Nonzero if EXP is a constant or a cast of a constant. */
2909 really_constant_p (const_tree exp
)
2911 /* This is not quite the same as STRIP_NOPS. It does more. */
2912 while (CONVERT_EXPR_P (exp
)
2913 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2914 exp
= TREE_OPERAND (exp
, 0);
2915 return TREE_CONSTANT (exp
);
2918 /* Return true if T holds a polynomial pointer difference, storing it in
2919 *VALUE if so. A true return means that T's precision is no greater
2920 than 64 bits, which is the largest address space we support, so *VALUE
2921 never loses precision. However, the signedness of the result does
2922 not necessarily match the signedness of T: sometimes an unsigned type
2923 like sizetype is used to encode a value that is actually negative. */
2926 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2930 if (TREE_CODE (t
) == INTEGER_CST
)
2932 if (!cst_and_fits_in_hwi (t
))
2934 *value
= int_cst_value (t
);
2937 if (POLY_INT_CST_P (t
))
2939 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2940 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2942 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2943 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2950 tree_to_poly_int64 (const_tree t
)
2952 gcc_assert (tree_fits_poly_int64_p (t
));
2953 if (POLY_INT_CST_P (t
))
2954 return poly_int_cst_value (t
).force_shwi ();
2955 return TREE_INT_CST_LOW (t
);
2959 tree_to_poly_uint64 (const_tree t
)
2961 gcc_assert (tree_fits_poly_uint64_p (t
));
2962 if (POLY_INT_CST_P (t
))
2963 return poly_int_cst_value (t
).force_uhwi ();
2964 return TREE_INT_CST_LOW (t
);
2967 /* Return first list element whose TREE_VALUE is ELEM.
2968 Return 0 if ELEM is not in LIST. */
2971 value_member (tree elem
, tree list
)
2975 if (elem
== TREE_VALUE (list
))
2977 list
= TREE_CHAIN (list
);
2982 /* Return first list element whose TREE_PURPOSE is ELEM.
2983 Return 0 if ELEM is not in LIST. */
2986 purpose_member (const_tree elem
, tree list
)
2990 if (elem
== TREE_PURPOSE (list
))
2992 list
= TREE_CHAIN (list
);
2997 /* Return true if ELEM is in V. */
3000 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
3004 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3010 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3014 chain_index (int idx
, tree chain
)
3016 for (; chain
&& idx
> 0; --idx
)
3017 chain
= TREE_CHAIN (chain
);
3021 /* Return nonzero if ELEM is part of the chain CHAIN. */
3024 chain_member (const_tree elem
, const_tree chain
)
3030 chain
= DECL_CHAIN (chain
);
3036 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3037 We expect a null pointer to mark the end of the chain.
3038 This is the Lisp primitive `length'. */
3041 list_length (const_tree t
)
3044 #ifdef ENABLE_TREE_CHECKING
3052 #ifdef ENABLE_TREE_CHECKING
3055 gcc_assert (p
!= q
);
3063 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3064 UNION_TYPE TYPE, or NULL_TREE if none. */
3067 first_field (const_tree type
)
3069 tree t
= TYPE_FIELDS (type
);
3070 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3075 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3076 by modifying the last node in chain 1 to point to chain 2.
3077 This is the Lisp primitive `nconc'. */
3080 chainon (tree op1
, tree op2
)
3089 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3091 TREE_CHAIN (t1
) = op2
;
3093 #ifdef ENABLE_TREE_CHECKING
3096 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3097 gcc_assert (t2
!= t1
);
3104 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3107 tree_last (tree chain
)
3111 while ((next
= TREE_CHAIN (chain
)))
3116 /* Reverse the order of elements in the chain T,
3117 and return the new head of the chain (old last element). */
3122 tree prev
= 0, decl
, next
;
3123 for (decl
= t
; decl
; decl
= next
)
3125 /* We shouldn't be using this function to reverse BLOCK chains; we
3126 have blocks_nreverse for that. */
3127 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3128 next
= TREE_CHAIN (decl
);
3129 TREE_CHAIN (decl
) = prev
;
3135 /* Return a newly created TREE_LIST node whose
3136 purpose and value fields are PARM and VALUE. */
3139 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3141 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3142 TREE_PURPOSE (t
) = parm
;
3143 TREE_VALUE (t
) = value
;
3147 /* Build a chain of TREE_LIST nodes from a vector. */
3150 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3152 tree ret
= NULL_TREE
;
3156 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3158 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3159 pp
= &TREE_CHAIN (*pp
);
3164 /* Return a newly created TREE_LIST node whose
3165 purpose and value fields are PURPOSE and VALUE
3166 and whose TREE_CHAIN is CHAIN. */
3169 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3173 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3174 memset (node
, 0, sizeof (struct tree_common
));
3176 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3178 TREE_SET_CODE (node
, TREE_LIST
);
3179 TREE_CHAIN (node
) = chain
;
3180 TREE_PURPOSE (node
) = purpose
;
3181 TREE_VALUE (node
) = value
;
3185 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3189 ctor_to_vec (tree ctor
)
3191 vec
<tree
, va_gc
> *vec
;
3192 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3196 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3197 vec
->quick_push (val
);
3202 /* Return the size nominally occupied by an object of type TYPE
3203 when it resides in memory. The value is measured in units of bytes,
3204 and its data type is that normally used for type sizes
3205 (which is the first type created by make_signed_type or
3206 make_unsigned_type). */
3209 size_in_bytes_loc (location_t loc
, const_tree type
)
3213 if (type
== error_mark_node
)
3214 return integer_zero_node
;
3216 type
= TYPE_MAIN_VARIANT (type
);
3217 t
= TYPE_SIZE_UNIT (type
);
3221 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3222 return size_zero_node
;
3228 /* Return the size of TYPE (in bytes) as a wide integer
3229 or return -1 if the size can vary or is larger than an integer. */
3232 int_size_in_bytes (const_tree type
)
3236 if (type
== error_mark_node
)
3239 type
= TYPE_MAIN_VARIANT (type
);
3240 t
= TYPE_SIZE_UNIT (type
);
3242 if (t
&& tree_fits_uhwi_p (t
))
3243 return TREE_INT_CST_LOW (t
);
3248 /* Return the maximum size of TYPE (in bytes) as a wide integer
3249 or return -1 if the size can vary or is larger than an integer. */
3252 max_int_size_in_bytes (const_tree type
)
3254 HOST_WIDE_INT size
= -1;
3257 /* If this is an array type, check for a possible MAX_SIZE attached. */
3259 if (TREE_CODE (type
) == ARRAY_TYPE
)
3261 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3263 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3264 size
= tree_to_uhwi (size_tree
);
3267 /* If we still haven't been able to get a size, see if the language
3268 can compute a maximum size. */
3272 size_tree
= lang_hooks
.types
.max_size (type
);
3274 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3275 size
= tree_to_uhwi (size_tree
);
3281 /* Return the bit position of FIELD, in bits from the start of the record.
3282 This is a tree of type bitsizetype. */
3285 bit_position (const_tree field
)
3287 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3288 DECL_FIELD_BIT_OFFSET (field
));
3291 /* Return the byte position of FIELD, in bytes from the start of the record.
3292 This is a tree of type sizetype. */
3295 byte_position (const_tree field
)
3297 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3298 DECL_FIELD_BIT_OFFSET (field
));
3301 /* Likewise, but return as an integer. It must be representable in
3302 that way (since it could be a signed value, we don't have the
3303 option of returning -1 like int_size_in_byte can. */
3306 int_byte_position (const_tree field
)
3308 return tree_to_shwi (byte_position (field
));
3311 /* Return the strictest alignment, in bits, that T is known to have. */
3314 expr_align (const_tree t
)
3316 unsigned int align0
, align1
;
3318 switch (TREE_CODE (t
))
3320 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3321 /* If we have conversions, we know that the alignment of the
3322 object must meet each of the alignments of the types. */
3323 align0
= expr_align (TREE_OPERAND (t
, 0));
3324 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3325 return MAX (align0
, align1
);
3327 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3328 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3329 case CLEANUP_POINT_EXPR
:
3330 /* These don't change the alignment of an object. */
3331 return expr_align (TREE_OPERAND (t
, 0));
3334 /* The best we can do is say that the alignment is the least aligned
3336 align0
= expr_align (TREE_OPERAND (t
, 1));
3337 align1
= expr_align (TREE_OPERAND (t
, 2));
3338 return MIN (align0
, align1
);
3340 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3341 meaningfully, it's always 1. */
3342 case LABEL_DECL
: case CONST_DECL
:
3343 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3345 gcc_assert (DECL_ALIGN (t
) != 0);
3346 return DECL_ALIGN (t
);
3352 /* Otherwise take the alignment from that of the type. */
3353 return TYPE_ALIGN (TREE_TYPE (t
));
3356 /* Return, as a tree node, the number of elements for TYPE (which is an
3357 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3360 array_type_nelts (const_tree type
)
3362 tree index_type
, min
, max
;
3364 /* If they did it with unspecified bounds, then we should have already
3365 given an error about it before we got here. */
3366 if (! TYPE_DOMAIN (type
))
3367 return error_mark_node
;
3369 index_type
= TYPE_DOMAIN (type
);
3370 min
= TYPE_MIN_VALUE (index_type
);
3371 max
= TYPE_MAX_VALUE (index_type
);
3373 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3375 return error_mark_node
;
3377 return (integer_zerop (min
)
3379 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3382 /* If arg is static -- a reference to an object in static storage -- then
3383 return the object. This is not the same as the C meaning of `static'.
3384 If arg isn't static, return NULL. */
3389 switch (TREE_CODE (arg
))
3392 /* Nested functions are static, even though taking their address will
3393 involve a trampoline as we unnest the nested function and create
3394 the trampoline on the tree level. */
3398 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3399 && ! DECL_THREAD_LOCAL_P (arg
)
3400 && ! DECL_DLLIMPORT_P (arg
)
3404 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3408 return TREE_STATIC (arg
) ? arg
: NULL
;
3415 /* If the thing being referenced is not a field, then it is
3416 something language specific. */
3417 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3419 /* If we are referencing a bitfield, we can't evaluate an
3420 ADDR_EXPR at compile time and so it isn't a constant. */
3421 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3424 return staticp (TREE_OPERAND (arg
, 0));
3430 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3433 case ARRAY_RANGE_REF
:
3434 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3435 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3436 return staticp (TREE_OPERAND (arg
, 0));
3440 case COMPOUND_LITERAL_EXPR
:
3441 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3451 /* Return whether OP is a DECL whose address is function-invariant. */
3454 decl_address_invariant_p (const_tree op
)
3456 /* The conditions below are slightly less strict than the one in
3459 switch (TREE_CODE (op
))
3468 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3469 || DECL_THREAD_LOCAL_P (op
)
3470 || DECL_CONTEXT (op
) == current_function_decl
3471 || decl_function_context (op
) == current_function_decl
)
3476 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3477 || decl_function_context (op
) == current_function_decl
)
3488 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3491 decl_address_ip_invariant_p (const_tree op
)
3493 /* The conditions below are slightly less strict than the one in
3496 switch (TREE_CODE (op
))
3504 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3505 && !DECL_DLLIMPORT_P (op
))
3506 || DECL_THREAD_LOCAL_P (op
))
3511 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3523 /* Return true if T is function-invariant (internal function, does
3524 not handle arithmetic; that's handled in skip_simple_arithmetic and
3525 tree_invariant_p). */
3528 tree_invariant_p_1 (tree t
)
3532 if (TREE_CONSTANT (t
)
3533 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3536 switch (TREE_CODE (t
))
3542 op
= TREE_OPERAND (t
, 0);
3543 while (handled_component_p (op
))
3545 switch (TREE_CODE (op
))
3548 case ARRAY_RANGE_REF
:
3549 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3550 || TREE_OPERAND (op
, 2) != NULL_TREE
3551 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3556 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3562 op
= TREE_OPERAND (op
, 0);
3565 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3574 /* Return true if T is function-invariant. */
3577 tree_invariant_p (tree t
)
3579 tree inner
= skip_simple_arithmetic (t
);
3580 return tree_invariant_p_1 (inner
);
3583 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3584 Do this to any expression which may be used in more than one place,
3585 but must be evaluated only once.
3587 Normally, expand_expr would reevaluate the expression each time.
3588 Calling save_expr produces something that is evaluated and recorded
3589 the first time expand_expr is called on it. Subsequent calls to
3590 expand_expr just reuse the recorded value.
3592 The call to expand_expr that generates code that actually computes
3593 the value is the first call *at compile time*. Subsequent calls
3594 *at compile time* generate code to use the saved value.
3595 This produces correct result provided that *at run time* control
3596 always flows through the insns made by the first expand_expr
3597 before reaching the other places where the save_expr was evaluated.
3598 You, the caller of save_expr, must make sure this is so.
3600 Constants, and certain read-only nodes, are returned with no
3601 SAVE_EXPR because that is safe. Expressions containing placeholders
3602 are not touched; see tree.def for an explanation of what these
3606 save_expr (tree expr
)
3610 /* If the tree evaluates to a constant, then we don't want to hide that
3611 fact (i.e. this allows further folding, and direct checks for constants).
3612 However, a read-only object that has side effects cannot be bypassed.
3613 Since it is no problem to reevaluate literals, we just return the
3615 inner
= skip_simple_arithmetic (expr
);
3616 if (TREE_CODE (inner
) == ERROR_MARK
)
3619 if (tree_invariant_p_1 (inner
))
3622 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3623 it means that the size or offset of some field of an object depends on
3624 the value within another field.
3626 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3627 and some variable since it would then need to be both evaluated once and
3628 evaluated more than once. Front-ends must assure this case cannot
3629 happen by surrounding any such subexpressions in their own SAVE_EXPR
3630 and forcing evaluation at the proper time. */
3631 if (contains_placeholder_p (inner
))
3634 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3636 /* This expression might be placed ahead of a jump to ensure that the
3637 value was computed on both sides of the jump. So make sure it isn't
3638 eliminated as dead. */
3639 TREE_SIDE_EFFECTS (expr
) = 1;
3643 /* Look inside EXPR into any simple arithmetic operations. Return the
3644 outermost non-arithmetic or non-invariant node. */
3647 skip_simple_arithmetic (tree expr
)
3649 /* We don't care about whether this can be used as an lvalue in this
3651 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3652 expr
= TREE_OPERAND (expr
, 0);
3654 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3655 a constant, it will be more efficient to not make another SAVE_EXPR since
3656 it will allow better simplification and GCSE will be able to merge the
3657 computations if they actually occur. */
3660 if (UNARY_CLASS_P (expr
))
3661 expr
= TREE_OPERAND (expr
, 0);
3662 else if (BINARY_CLASS_P (expr
))
3664 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3665 expr
= TREE_OPERAND (expr
, 0);
3666 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3667 expr
= TREE_OPERAND (expr
, 1);
3678 /* Look inside EXPR into simple arithmetic operations involving constants.
3679 Return the outermost non-arithmetic or non-constant node. */
3682 skip_simple_constant_arithmetic (tree expr
)
3684 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3685 expr
= TREE_OPERAND (expr
, 0);
3689 if (UNARY_CLASS_P (expr
))
3690 expr
= TREE_OPERAND (expr
, 0);
3691 else if (BINARY_CLASS_P (expr
))
3693 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3694 expr
= TREE_OPERAND (expr
, 0);
3695 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3696 expr
= TREE_OPERAND (expr
, 1);
3707 /* Return which tree structure is used by T. */
3709 enum tree_node_structure_enum
3710 tree_node_structure (const_tree t
)
3712 const enum tree_code code
= TREE_CODE (t
);
3713 return tree_node_structure_for_code (code
);
3716 /* Set various status flags when building a CALL_EXPR object T. */
3719 process_call_operands (tree t
)
3721 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3722 bool read_only
= false;
3723 int i
= call_expr_flags (t
);
3725 /* Calls have side-effects, except those to const or pure functions. */
3726 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3727 side_effects
= true;
3728 /* Propagate TREE_READONLY of arguments for const functions. */
3732 if (!side_effects
|| read_only
)
3733 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3735 tree op
= TREE_OPERAND (t
, i
);
3736 if (op
&& TREE_SIDE_EFFECTS (op
))
3737 side_effects
= true;
3738 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3742 TREE_SIDE_EFFECTS (t
) = side_effects
;
3743 TREE_READONLY (t
) = read_only
;
3746 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3747 size or offset that depends on a field within a record. */
3750 contains_placeholder_p (const_tree exp
)
3752 enum tree_code code
;
3757 code
= TREE_CODE (exp
);
3758 if (code
== PLACEHOLDER_EXPR
)
3761 switch (TREE_CODE_CLASS (code
))
3764 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3765 position computations since they will be converted into a
3766 WITH_RECORD_EXPR involving the reference, which will assume
3767 here will be valid. */
3768 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3770 case tcc_exceptional
:
3771 if (code
== TREE_LIST
)
3772 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3773 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3778 case tcc_comparison
:
3779 case tcc_expression
:
3783 /* Ignoring the first operand isn't quite right, but works best. */
3784 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3787 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3788 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3789 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3792 /* The save_expr function never wraps anything containing
3793 a PLACEHOLDER_EXPR. */
3800 switch (TREE_CODE_LENGTH (code
))
3803 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3805 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3806 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3817 const_call_expr_arg_iterator iter
;
3818 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3819 if (CONTAINS_PLACEHOLDER_P (arg
))
3833 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3834 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3838 type_contains_placeholder_1 (const_tree type
)
3840 /* If the size contains a placeholder or the parent type (component type in
3841 the case of arrays) type involves a placeholder, this type does. */
3842 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3843 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3844 || (!POINTER_TYPE_P (type
)
3846 && type_contains_placeholder_p (TREE_TYPE (type
))))
3849 /* Now do type-specific checks. Note that the last part of the check above
3850 greatly limits what we have to do below. */
3851 switch (TREE_CODE (type
))
3859 case REFERENCE_TYPE
:
3868 case FIXED_POINT_TYPE
:
3869 /* Here we just check the bounds. */
3870 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3871 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3874 /* We have already checked the component type above, so just check
3875 the domain type. Flexible array members have a null domain. */
3876 return TYPE_DOMAIN (type
) ?
3877 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3881 case QUAL_UNION_TYPE
:
3885 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3886 if (TREE_CODE (field
) == FIELD_DECL
3887 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3888 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3889 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3890 || type_contains_placeholder_p (TREE_TYPE (field
))))
3901 /* Wrapper around above function used to cache its result. */
3904 type_contains_placeholder_p (tree type
)
3908 /* If the contains_placeholder_bits field has been initialized,
3909 then we know the answer. */
3910 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3911 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3913 /* Indicate that we've seen this type node, and the answer is false.
3914 This is what we want to return if we run into recursion via fields. */
3915 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3917 /* Compute the real value. */
3918 result
= type_contains_placeholder_1 (type
);
3920 /* Store the real value. */
3921 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3926 /* Push tree EXP onto vector QUEUE if it is not already present. */
3929 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3934 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3935 if (simple_cst_equal (iter
, exp
) == 1)
3939 queue
->safe_push (exp
);
3942 /* Given a tree EXP, find all occurrences of references to fields
3943 in a PLACEHOLDER_EXPR and place them in vector REFS without
3944 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3945 we assume here that EXP contains only arithmetic expressions
3946 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3950 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3952 enum tree_code code
= TREE_CODE (exp
);
3956 /* We handle TREE_LIST and COMPONENT_REF separately. */
3957 if (code
== TREE_LIST
)
3959 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3960 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3962 else if (code
== COMPONENT_REF
)
3964 for (inner
= TREE_OPERAND (exp
, 0);
3965 REFERENCE_CLASS_P (inner
);
3966 inner
= TREE_OPERAND (inner
, 0))
3969 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3970 push_without_duplicates (exp
, refs
);
3972 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3975 switch (TREE_CODE_CLASS (code
))
3980 case tcc_declaration
:
3981 /* Variables allocated to static storage can stay. */
3982 if (!TREE_STATIC (exp
))
3983 push_without_duplicates (exp
, refs
);
3986 case tcc_expression
:
3987 /* This is the pattern built in ada/make_aligning_type. */
3988 if (code
== ADDR_EXPR
3989 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3991 push_without_duplicates (exp
, refs
);
3997 case tcc_exceptional
:
4000 case tcc_comparison
:
4002 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
4003 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4007 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4008 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4016 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4017 return a tree with all occurrences of references to F in a
4018 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4019 CONST_DECLs. Note that we assume here that EXP contains only
4020 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4021 occurring only in their argument list. */
4024 substitute_in_expr (tree exp
, tree f
, tree r
)
4026 enum tree_code code
= TREE_CODE (exp
);
4027 tree op0
, op1
, op2
, op3
;
4030 /* We handle TREE_LIST and COMPONENT_REF separately. */
4031 if (code
== TREE_LIST
)
4033 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4034 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4035 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4038 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4040 else if (code
== COMPONENT_REF
)
4044 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4045 and it is the right field, replace it with R. */
4046 for (inner
= TREE_OPERAND (exp
, 0);
4047 REFERENCE_CLASS_P (inner
);
4048 inner
= TREE_OPERAND (inner
, 0))
4052 op1
= TREE_OPERAND (exp
, 1);
4054 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4057 /* If this expression hasn't been completed let, leave it alone. */
4058 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4061 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4062 if (op0
== TREE_OPERAND (exp
, 0))
4066 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4069 switch (TREE_CODE_CLASS (code
))
4074 case tcc_declaration
:
4080 case tcc_expression
:
4086 case tcc_exceptional
:
4089 case tcc_comparison
:
4091 switch (TREE_CODE_LENGTH (code
))
4097 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4098 if (op0
== TREE_OPERAND (exp
, 0))
4101 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4105 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4106 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4108 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4111 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4115 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4116 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4117 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4119 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4120 && op2
== TREE_OPERAND (exp
, 2))
4123 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4127 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4128 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4129 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4130 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4132 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4133 && op2
== TREE_OPERAND (exp
, 2)
4134 && op3
== TREE_OPERAND (exp
, 3))
4138 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4150 new_tree
= NULL_TREE
;
4152 /* If we are trying to replace F with a constant or with another
4153 instance of one of the arguments of the call, inline back
4154 functions which do nothing else than computing a value from
4155 the arguments they are passed. This makes it possible to
4156 fold partially or entirely the replacement expression. */
4157 if (code
== CALL_EXPR
)
4159 bool maybe_inline
= false;
4160 if (CONSTANT_CLASS_P (r
))
4161 maybe_inline
= true;
4163 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4164 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4166 maybe_inline
= true;
4171 tree t
= maybe_inline_call_in_expr (exp
);
4173 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4177 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4179 tree op
= TREE_OPERAND (exp
, i
);
4180 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4184 new_tree
= copy_node (exp
);
4185 TREE_OPERAND (new_tree
, i
) = new_op
;
4191 new_tree
= fold (new_tree
);
4192 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4193 process_call_operands (new_tree
);
4204 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4206 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4207 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4212 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4213 for it within OBJ, a tree that is an object or a chain of references. */
4216 substitute_placeholder_in_expr (tree exp
, tree obj
)
4218 enum tree_code code
= TREE_CODE (exp
);
4219 tree op0
, op1
, op2
, op3
;
4222 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4223 in the chain of OBJ. */
4224 if (code
== PLACEHOLDER_EXPR
)
4226 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4229 for (elt
= obj
; elt
!= 0;
4230 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4231 || TREE_CODE (elt
) == COND_EXPR
)
4232 ? TREE_OPERAND (elt
, 1)
4233 : (REFERENCE_CLASS_P (elt
)
4234 || UNARY_CLASS_P (elt
)
4235 || BINARY_CLASS_P (elt
)
4236 || VL_EXP_CLASS_P (elt
)
4237 || EXPRESSION_CLASS_P (elt
))
4238 ? TREE_OPERAND (elt
, 0) : 0))
4239 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4242 for (elt
= obj
; elt
!= 0;
4243 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4244 || TREE_CODE (elt
) == COND_EXPR
)
4245 ? TREE_OPERAND (elt
, 1)
4246 : (REFERENCE_CLASS_P (elt
)
4247 || UNARY_CLASS_P (elt
)
4248 || BINARY_CLASS_P (elt
)
4249 || VL_EXP_CLASS_P (elt
)
4250 || EXPRESSION_CLASS_P (elt
))
4251 ? TREE_OPERAND (elt
, 0) : 0))
4252 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4253 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4255 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4257 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4258 survives until RTL generation, there will be an error. */
4262 /* TREE_LIST is special because we need to look at TREE_VALUE
4263 and TREE_CHAIN, not TREE_OPERANDS. */
4264 else if (code
== TREE_LIST
)
4266 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4267 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4268 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4271 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4274 switch (TREE_CODE_CLASS (code
))
4277 case tcc_declaration
:
4280 case tcc_exceptional
:
4283 case tcc_comparison
:
4284 case tcc_expression
:
4287 switch (TREE_CODE_LENGTH (code
))
4293 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4294 if (op0
== TREE_OPERAND (exp
, 0))
4297 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4301 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4302 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4304 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4307 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4311 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4312 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4313 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4315 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4316 && op2
== TREE_OPERAND (exp
, 2))
4319 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4323 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4324 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4325 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4326 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4328 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4329 && op2
== TREE_OPERAND (exp
, 2)
4330 && op3
== TREE_OPERAND (exp
, 3))
4334 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4346 new_tree
= NULL_TREE
;
4348 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4350 tree op
= TREE_OPERAND (exp
, i
);
4351 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4355 new_tree
= copy_node (exp
);
4356 TREE_OPERAND (new_tree
, i
) = new_op
;
4362 new_tree
= fold (new_tree
);
4363 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4364 process_call_operands (new_tree
);
4375 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4377 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4378 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4384 /* Subroutine of stabilize_reference; this is called for subtrees of
4385 references. Any expression with side-effects must be put in a SAVE_EXPR
4386 to ensure that it is only evaluated once.
4388 We don't put SAVE_EXPR nodes around everything, because assigning very
4389 simple expressions to temporaries causes us to miss good opportunities
4390 for optimizations. Among other things, the opportunity to fold in the
4391 addition of a constant into an addressing mode often gets lost, e.g.
4392 "y[i+1] += x;". In general, we take the approach that we should not make
4393 an assignment unless we are forced into it - i.e., that any non-side effect
4394 operator should be allowed, and that cse should take care of coalescing
4395 multiple utterances of the same expression should that prove fruitful. */
4398 stabilize_reference_1 (tree e
)
4401 enum tree_code code
= TREE_CODE (e
);
4403 /* We cannot ignore const expressions because it might be a reference
4404 to a const array but whose index contains side-effects. But we can
4405 ignore things that are actual constant or that already have been
4406 handled by this function. */
4408 if (tree_invariant_p (e
))
4411 switch (TREE_CODE_CLASS (code
))
4413 case tcc_exceptional
:
4414 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4415 have side-effects. */
4416 if (code
== STATEMENT_LIST
)
4417 return save_expr (e
);
4420 case tcc_declaration
:
4421 case tcc_comparison
:
4423 case tcc_expression
:
4426 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4427 so that it will only be evaluated once. */
4428 /* The reference (r) and comparison (<) classes could be handled as
4429 below, but it is generally faster to only evaluate them once. */
4430 if (TREE_SIDE_EFFECTS (e
))
4431 return save_expr (e
);
4435 /* Constants need no processing. In fact, we should never reach
4440 /* Division is slow and tends to be compiled with jumps,
4441 especially the division by powers of 2 that is often
4442 found inside of an array reference. So do it just once. */
4443 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4444 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4445 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4446 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4447 return save_expr (e
);
4448 /* Recursively stabilize each operand. */
4449 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4450 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4454 /* Recursively stabilize each operand. */
4455 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4462 TREE_TYPE (result
) = TREE_TYPE (e
);
4463 TREE_READONLY (result
) = TREE_READONLY (e
);
4464 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4465 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4470 /* Stabilize a reference so that we can use it any number of times
4471 without causing its operands to be evaluated more than once.
4472 Returns the stabilized reference. This works by means of save_expr,
4473 so see the caveats in the comments about save_expr.
4475 Also allows conversion expressions whose operands are references.
4476 Any other kind of expression is returned unchanged. */
4479 stabilize_reference (tree ref
)
4482 enum tree_code code
= TREE_CODE (ref
);
4489 /* No action is needed in this case. */
4494 case FIX_TRUNC_EXPR
:
4495 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4499 result
= build_nt (INDIRECT_REF
,
4500 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4504 result
= build_nt (COMPONENT_REF
,
4505 stabilize_reference (TREE_OPERAND (ref
, 0)),
4506 TREE_OPERAND (ref
, 1), NULL_TREE
);
4510 result
= build_nt (BIT_FIELD_REF
,
4511 stabilize_reference (TREE_OPERAND (ref
, 0)),
4512 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4513 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4517 result
= build_nt (ARRAY_REF
,
4518 stabilize_reference (TREE_OPERAND (ref
, 0)),
4519 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4520 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4523 case ARRAY_RANGE_REF
:
4524 result
= build_nt (ARRAY_RANGE_REF
,
4525 stabilize_reference (TREE_OPERAND (ref
, 0)),
4526 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4527 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4531 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4532 it wouldn't be ignored. This matters when dealing with
4534 return stabilize_reference_1 (ref
);
4536 /* If arg isn't a kind of lvalue we recognize, make no change.
4537 Caller should recognize the error for an invalid lvalue. */
4542 return error_mark_node
;
4545 TREE_TYPE (result
) = TREE_TYPE (ref
);
4546 TREE_READONLY (result
) = TREE_READONLY (ref
);
4547 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4548 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4553 /* Low-level constructors for expressions. */
4555 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4556 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4559 recompute_tree_invariant_for_addr_expr (tree t
)
4562 bool tc
= true, se
= false;
4564 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4566 /* We started out assuming this address is both invariant and constant, but
4567 does not have side effects. Now go down any handled components and see if
4568 any of them involve offsets that are either non-constant or non-invariant.
4569 Also check for side-effects.
4571 ??? Note that this code makes no attempt to deal with the case where
4572 taking the address of something causes a copy due to misalignment. */
4574 #define UPDATE_FLAGS(NODE) \
4575 do { tree _node = (NODE); \
4576 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4577 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4579 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4580 node
= TREE_OPERAND (node
, 0))
4582 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4583 array reference (probably made temporarily by the G++ front end),
4584 so ignore all the operands. */
4585 if ((TREE_CODE (node
) == ARRAY_REF
4586 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4587 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4589 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4590 if (TREE_OPERAND (node
, 2))
4591 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4592 if (TREE_OPERAND (node
, 3))
4593 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4595 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4596 FIELD_DECL, apparently. The G++ front end can put something else
4597 there, at least temporarily. */
4598 else if (TREE_CODE (node
) == COMPONENT_REF
4599 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4601 if (TREE_OPERAND (node
, 2))
4602 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4606 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4608 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4609 the address, since &(*a)->b is a form of addition. If it's a constant, the
4610 address is constant too. If it's a decl, its address is constant if the
4611 decl is static. Everything else is not constant and, furthermore,
4612 taking the address of a volatile variable is not volatile. */
4613 if (TREE_CODE (node
) == INDIRECT_REF
4614 || TREE_CODE (node
) == MEM_REF
)
4615 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4616 else if (CONSTANT_CLASS_P (node
))
4618 else if (DECL_P (node
))
4619 tc
&= (staticp (node
) != NULL_TREE
);
4623 se
|= TREE_SIDE_EFFECTS (node
);
4627 TREE_CONSTANT (t
) = tc
;
4628 TREE_SIDE_EFFECTS (t
) = se
;
4632 /* Build an expression of code CODE, data type TYPE, and operands as
4633 specified. Expressions and reference nodes can be created this way.
4634 Constants, decls, types and misc nodes cannot be.
4636 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4637 enough for all extant tree codes. */
4640 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4644 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4646 t
= make_node (code PASS_MEM_STAT
);
4653 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4655 int length
= sizeof (struct tree_exp
);
4658 record_node_allocation_statistics (code
, length
);
4660 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4662 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4664 memset (t
, 0, sizeof (struct tree_common
));
4666 TREE_SET_CODE (t
, code
);
4668 TREE_TYPE (t
) = type
;
4669 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4670 TREE_OPERAND (t
, 0) = node
;
4671 if (node
&& !TYPE_P (node
))
4673 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4674 TREE_READONLY (t
) = TREE_READONLY (node
);
4677 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4679 if (code
!= DEBUG_BEGIN_STMT
)
4680 TREE_SIDE_EFFECTS (t
) = 1;
4685 /* All of these have side-effects, no matter what their
4687 TREE_SIDE_EFFECTS (t
) = 1;
4688 TREE_READONLY (t
) = 0;
4692 /* Whether a dereference is readonly has nothing to do with whether
4693 its operand is readonly. */
4694 TREE_READONLY (t
) = 0;
4699 recompute_tree_invariant_for_addr_expr (t
);
4703 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4704 && node
&& !TYPE_P (node
)
4705 && TREE_CONSTANT (node
))
4706 TREE_CONSTANT (t
) = 1;
4707 if (TREE_CODE_CLASS (code
) == tcc_reference
4708 && node
&& TREE_THIS_VOLATILE (node
))
4709 TREE_THIS_VOLATILE (t
) = 1;
4716 #define PROCESS_ARG(N) \
4718 TREE_OPERAND (t, N) = arg##N; \
4719 if (arg##N &&!TYPE_P (arg##N)) \
4721 if (TREE_SIDE_EFFECTS (arg##N)) \
4723 if (!TREE_READONLY (arg##N) \
4724 && !CONSTANT_CLASS_P (arg##N)) \
4725 (void) (read_only = 0); \
4726 if (!TREE_CONSTANT (arg##N)) \
4727 (void) (constant = 0); \
4732 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4734 bool constant
, read_only
, side_effects
, div_by_zero
;
4737 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4739 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4740 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4741 /* When sizetype precision doesn't match that of pointers
4742 we need to be able to build explicit extensions or truncations
4743 of the offset argument. */
4744 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4745 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4746 && TREE_CODE (arg1
) == INTEGER_CST
);
4748 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4749 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4750 && ptrofftype_p (TREE_TYPE (arg1
)));
4752 t
= make_node (code PASS_MEM_STAT
);
4755 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4756 result based on those same flags for the arguments. But if the
4757 arguments aren't really even `tree' expressions, we shouldn't be trying
4760 /* Expressions without side effects may be constant if their
4761 arguments are as well. */
4762 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4763 || TREE_CODE_CLASS (code
) == tcc_binary
);
4765 side_effects
= TREE_SIDE_EFFECTS (t
);
4769 case TRUNC_DIV_EXPR
:
4771 case FLOOR_DIV_EXPR
:
4772 case ROUND_DIV_EXPR
:
4773 case EXACT_DIV_EXPR
:
4775 case FLOOR_MOD_EXPR
:
4776 case ROUND_MOD_EXPR
:
4777 case TRUNC_MOD_EXPR
:
4778 div_by_zero
= integer_zerop (arg1
);
4781 div_by_zero
= false;
4787 TREE_SIDE_EFFECTS (t
) = side_effects
;
4788 if (code
== MEM_REF
)
4790 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4792 tree o
= TREE_OPERAND (arg0
, 0);
4793 TREE_READONLY (t
) = TREE_READONLY (o
);
4794 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4799 TREE_READONLY (t
) = read_only
;
4800 /* Don't mark X / 0 as constant. */
4801 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4802 TREE_THIS_VOLATILE (t
)
4803 = (TREE_CODE_CLASS (code
) == tcc_reference
4804 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4812 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4813 tree arg2 MEM_STAT_DECL
)
4815 bool constant
, read_only
, side_effects
;
4818 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4819 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4821 t
= make_node (code PASS_MEM_STAT
);
4826 /* As a special exception, if COND_EXPR has NULL branches, we
4827 assume that it is a gimple statement and always consider
4828 it to have side effects. */
4829 if (code
== COND_EXPR
4830 && tt
== void_type_node
4831 && arg1
== NULL_TREE
4832 && arg2
== NULL_TREE
)
4833 side_effects
= true;
4835 side_effects
= TREE_SIDE_EFFECTS (t
);
4841 if (code
== COND_EXPR
)
4842 TREE_READONLY (t
) = read_only
;
4844 TREE_SIDE_EFFECTS (t
) = side_effects
;
4845 TREE_THIS_VOLATILE (t
)
4846 = (TREE_CODE_CLASS (code
) == tcc_reference
4847 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4853 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4854 tree arg2
, tree arg3 MEM_STAT_DECL
)
4856 bool constant
, read_only
, side_effects
;
4859 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4861 t
= make_node (code PASS_MEM_STAT
);
4864 side_effects
= TREE_SIDE_EFFECTS (t
);
4871 TREE_SIDE_EFFECTS (t
) = side_effects
;
4872 TREE_THIS_VOLATILE (t
)
4873 = (TREE_CODE_CLASS (code
) == tcc_reference
4874 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4880 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4881 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4883 bool constant
, read_only
, side_effects
;
4886 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4888 t
= make_node (code PASS_MEM_STAT
);
4891 side_effects
= TREE_SIDE_EFFECTS (t
);
4899 TREE_SIDE_EFFECTS (t
) = side_effects
;
4900 if (code
== TARGET_MEM_REF
)
4902 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4904 tree o
= TREE_OPERAND (arg0
, 0);
4905 TREE_READONLY (t
) = TREE_READONLY (o
);
4906 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4910 TREE_THIS_VOLATILE (t
)
4911 = (TREE_CODE_CLASS (code
) == tcc_reference
4912 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4917 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4918 on the pointer PTR. */
4921 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4923 poly_int64 offset
= 0;
4924 tree ptype
= TREE_TYPE (ptr
);
4926 /* For convenience allow addresses that collapse to a simple base
4928 if (TREE_CODE (ptr
) == ADDR_EXPR
4929 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4930 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4932 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4934 if (TREE_CODE (ptr
) == MEM_REF
)
4936 offset
+= mem_ref_offset (ptr
).force_shwi ();
4937 ptr
= TREE_OPERAND (ptr
, 0);
4940 ptr
= build_fold_addr_expr (ptr
);
4941 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4943 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4944 ptr
, build_int_cst (ptype
, offset
));
4945 SET_EXPR_LOCATION (tem
, loc
);
4949 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4952 mem_ref_offset (const_tree t
)
4954 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4958 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4959 offsetted by OFFSET units. */
4962 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4964 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4965 build_fold_addr_expr (base
),
4966 build_int_cst (ptr_type_node
, offset
));
4967 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4968 recompute_tree_invariant_for_addr_expr (addr
);
4972 /* Similar except don't specify the TREE_TYPE
4973 and leave the TREE_SIDE_EFFECTS as 0.
4974 It is permissible for arguments to be null,
4975 or even garbage if their values do not matter. */
4978 build_nt (enum tree_code code
, ...)
4985 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4989 t
= make_node (code
);
4990 length
= TREE_CODE_LENGTH (code
);
4992 for (i
= 0; i
< length
; i
++)
4993 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4999 /* Similar to build_nt, but for creating a CALL_EXPR object with a
5003 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5008 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5009 CALL_EXPR_FN (ret
) = fn
;
5010 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5011 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5012 CALL_EXPR_ARG (ret
, ix
) = t
;
5016 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5018 We do NOT enter this node in any sort of symbol table.
5020 LOC is the location of the decl.
5022 layout_decl is used to set up the decl's storage layout.
5023 Other slots are initialized to 0 or null pointers. */
5026 build_decl (location_t loc
, enum tree_code code
, tree name
,
5027 tree type MEM_STAT_DECL
)
5031 t
= make_node (code PASS_MEM_STAT
);
5032 DECL_SOURCE_LOCATION (t
) = loc
;
5034 /* if (type == error_mark_node)
5035 type = integer_type_node; */
5036 /* That is not done, deliberately, so that having error_mark_node
5037 as the type can suppress useless errors in the use of this variable. */
5039 DECL_NAME (t
) = name
;
5040 TREE_TYPE (t
) = type
;
5042 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5048 /* Builds and returns function declaration with NAME and TYPE. */
5051 build_fn_decl (const char *name
, tree type
)
5053 tree id
= get_identifier (name
);
5054 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5056 DECL_EXTERNAL (decl
) = 1;
5057 TREE_PUBLIC (decl
) = 1;
5058 DECL_ARTIFICIAL (decl
) = 1;
5059 TREE_NOTHROW (decl
) = 1;
5064 vec
<tree
, va_gc
> *all_translation_units
;
5066 /* Builds a new translation-unit decl with name NAME, queues it in the
5067 global list of translation-unit decls and returns it. */
5070 build_translation_unit_decl (tree name
)
5072 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5074 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5075 vec_safe_push (all_translation_units
, tu
);
5080 /* BLOCK nodes are used to represent the structure of binding contours
5081 and declarations, once those contours have been exited and their contents
5082 compiled. This information is used for outputting debugging info. */
5085 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5087 tree block
= make_node (BLOCK
);
5089 BLOCK_VARS (block
) = vars
;
5090 BLOCK_SUBBLOCKS (block
) = subblocks
;
5091 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5092 BLOCK_CHAIN (block
) = chain
;
5097 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5099 LOC is the location to use in tree T. */
5102 protected_set_expr_location (tree t
, location_t loc
)
5104 if (CAN_HAVE_LOCATION_P (t
))
5105 SET_EXPR_LOCATION (t
, loc
);
5108 /* Data used when collecting DECLs and TYPEs for language data removal. */
5110 class free_lang_data_d
5113 free_lang_data_d () : decls (100), types (100) {}
5115 /* Worklist to avoid excessive recursion. */
5116 auto_vec
<tree
> worklist
;
5118 /* Set of traversed objects. Used to avoid duplicate visits. */
5119 hash_set
<tree
> pset
;
5121 /* Array of symbols to process with free_lang_data_in_decl. */
5122 auto_vec
<tree
> decls
;
5124 /* Array of types to process with free_lang_data_in_type. */
5125 auto_vec
<tree
> types
;
5129 /* Add type or decl T to one of the list of tree nodes that need their
5130 language data removed. The lists are held inside FLD. */
5133 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5136 fld
->decls
.safe_push (t
);
5137 else if (TYPE_P (t
))
5138 fld
->types
.safe_push (t
);
5143 /* Push tree node T into FLD->WORKLIST. */
5146 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5148 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5149 fld
->worklist
.safe_push ((t
));
5154 /* Return simplified TYPE_NAME of TYPE. */
5157 fld_simplified_type_name (tree type
)
5159 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5160 return TYPE_NAME (type
);
5161 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5162 TYPE_DECL if the type doesn't have linkage.
5163 this must match fld_ */
5164 if (type
!= TYPE_MAIN_VARIANT (type
)
5165 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5166 && (TREE_CODE (type
) != RECORD_TYPE
5167 || !TYPE_BINFO (type
)
5168 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5169 return DECL_NAME (TYPE_NAME (type
));
5170 return TYPE_NAME (type
);
5173 /* Do same comparsion as check_qualified_type skipping lang part of type
5174 and be more permissive about type names: we only care that names are
5175 same (for diagnostics) and that ODR names are the same.
5176 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5179 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5181 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5182 /* We want to match incomplete variants with complete types.
5183 In this case we need to ignore alignment. */
5184 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5185 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5186 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5187 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5188 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5189 TYPE_ATTRIBUTES (v
))
5190 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5196 /* Find variant of FIRST that match T and create new one if necessary.
5197 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5200 fld_type_variant (tree first
, tree t
, struct free_lang_data_d
*fld
,
5201 tree inner_type
= NULL
)
5203 if (first
== TYPE_MAIN_VARIANT (t
))
5205 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5206 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5208 tree v
= build_variant_type_copy (first
);
5209 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5210 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5211 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5212 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5213 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5214 TYPE_NAME (v
) = TYPE_NAME (t
);
5215 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5216 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5217 /* Variants of incomplete types should have alignment
5218 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5219 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5221 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5222 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5225 TREE_TYPE (v
) = inner_type
;
5226 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5227 if (!fld
->pset
.add (v
))
5228 add_tree_to_fld_list (v
, fld
);
5232 /* Map complete types to incomplete types. */
5234 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5236 /* Map types to simplified types. */
5238 static hash_map
<tree
, tree
> *fld_simplified_types
;
5240 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5241 use MAP to prevent duplicates. */
5244 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5245 struct free_lang_data_d
*fld
)
5247 if (TREE_TYPE (t
) == t2
)
5250 if (TYPE_MAIN_VARIANT (t
) != t
)
5252 return fld_type_variant
5253 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5254 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5260 = map
->get_or_insert (t
, &existed
);
5263 array
= build_array_type_1 (t2
, TYPE_DOMAIN (t
),
5264 TYPE_TYPELESS_STORAGE (t
), false);
5265 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5266 if (!fld
->pset
.add (array
))
5267 add_tree_to_fld_list (array
, fld
);
5272 /* Return CTX after removal of contexts that are not relevant */
5275 fld_decl_context (tree ctx
)
5277 /* Variably modified types are needed for tree_is_indexable to decide
5278 whether the type needs to go to local or global section.
5279 This code is semi-broken but for now it is easiest to keep contexts
5281 if (ctx
&& TYPE_P (ctx
)
5282 && !variably_modified_type_p (ctx
, NULL_TREE
))
5284 while (ctx
&& TYPE_P (ctx
))
5285 ctx
= TYPE_CONTEXT (ctx
);
5290 /* For T being aggregate type try to turn it into a incomplete variant.
5291 Return T if no simplification is possible. */
5294 fld_incomplete_type_of (tree t
, struct free_lang_data_d
*fld
)
5298 if (POINTER_TYPE_P (t
))
5300 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5301 if (t2
!= TREE_TYPE (t
))
5304 if (TREE_CODE (t
) == POINTER_TYPE
)
5305 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5306 TYPE_REF_CAN_ALIAS_ALL (t
));
5308 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5309 TYPE_REF_CAN_ALIAS_ALL (t
));
5310 gcc_assert (TYPE_CANONICAL (t2
) != t2
5311 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5312 if (!fld
->pset
.add (first
))
5313 add_tree_to_fld_list (first
, fld
);
5314 return fld_type_variant (first
, t
, fld
);
5318 if (TREE_CODE (t
) == ARRAY_TYPE
)
5319 return fld_process_array_type (t
,
5320 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5321 fld_incomplete_types
, fld
);
5322 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5323 || !COMPLETE_TYPE_P (t
))
5325 if (TYPE_MAIN_VARIANT (t
) == t
)
5329 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5333 copy
= build_distinct_type_copy (t
);
5335 /* It is possible that type was not seen by free_lang_data yet. */
5336 if (!fld
->pset
.add (copy
))
5337 add_tree_to_fld_list (copy
, fld
);
5338 TYPE_SIZE (copy
) = NULL
;
5339 TYPE_USER_ALIGN (copy
) = 0;
5340 TYPE_SIZE_UNIT (copy
) = NULL
;
5341 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5342 TREE_ADDRESSABLE (copy
) = 0;
5343 if (AGGREGATE_TYPE_P (t
))
5345 SET_TYPE_MODE (copy
, VOIDmode
);
5346 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5347 TYPE_TYPELESS_STORAGE (copy
) = 0;
5348 TYPE_FIELDS (copy
) = NULL
;
5349 TYPE_BINFO (copy
) = NULL
;
5352 TYPE_VALUES (copy
) = NULL
;
5354 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5355 This is needed for ODR violation warnings to come out right (we
5356 want duplicate TYPE_DECLs whenever the type is duplicated because
5357 of ODR violation. Because lang data in the TYPE_DECL may not
5358 have been freed yet, rebuild it from scratch and copy relevant
5360 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5361 tree name
= TYPE_NAME (copy
);
5363 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5365 gcc_checking_assert (TREE_TYPE (name
) == t
);
5366 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5367 DECL_NAME (name
), copy
);
5368 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5369 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5370 SET_DECL_ALIGN (name2
, 0);
5371 DECL_CONTEXT (name2
) = fld_decl_context
5372 (DECL_CONTEXT (name
));
5373 TYPE_NAME (copy
) = name2
;
5378 return (fld_type_variant
5379 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5382 /* Simplify type T for scenarios where we do not need complete pointer
5386 fld_simplified_type (tree t
, struct free_lang_data_d
*fld
)
5390 if (POINTER_TYPE_P (t
))
5391 return fld_incomplete_type_of (t
, fld
);
5392 /* FIXME: This triggers verification error, see PR88140. */
5393 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5394 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5395 fld_simplified_types
, fld
);
5399 /* Reset the expression *EXPR_P, a size or position.
5401 ??? We could reset all non-constant sizes or positions. But it's cheap
5402 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5404 We need to reset self-referential sizes or positions because they cannot
5405 be gimplified and thus can contain a CALL_EXPR after the gimplification
5406 is finished, which will run afoul of LTO streaming. And they need to be
5407 reset to something essentially dummy but not constant, so as to preserve
5408 the properties of the object they are attached to. */
5411 free_lang_data_in_one_sizepos (tree
*expr_p
)
5413 tree expr
= *expr_p
;
5414 if (CONTAINS_PLACEHOLDER_P (expr
))
5415 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5419 /* Reset all the fields in a binfo node BINFO. We only keep
5420 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5423 free_lang_data_in_binfo (tree binfo
)
5428 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5430 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5431 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5432 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5433 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5434 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5436 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5437 free_lang_data_in_binfo (t
);
5441 /* Reset all language specific information still present in TYPE. */
5444 free_lang_data_in_type (tree type
, struct free_lang_data_d
*fld
)
5446 gcc_assert (TYPE_P (type
));
5448 /* Give the FE a chance to remove its own data first. */
5449 lang_hooks
.free_lang_data (type
);
5451 TREE_LANG_FLAG_0 (type
) = 0;
5452 TREE_LANG_FLAG_1 (type
) = 0;
5453 TREE_LANG_FLAG_2 (type
) = 0;
5454 TREE_LANG_FLAG_3 (type
) = 0;
5455 TREE_LANG_FLAG_4 (type
) = 0;
5456 TREE_LANG_FLAG_5 (type
) = 0;
5457 TREE_LANG_FLAG_6 (type
) = 0;
5459 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5461 /* Purge non-marked variants from the variants chain, so that they
5462 don't reappear in the IL after free_lang_data. */
5463 while (TYPE_NEXT_VARIANT (type
)
5464 && !fld
->pset
.contains (TYPE_NEXT_VARIANT (type
)))
5466 tree t
= TYPE_NEXT_VARIANT (type
);
5467 TYPE_NEXT_VARIANT (type
) = TYPE_NEXT_VARIANT (t
);
5468 /* Turn the removed types into distinct types. */
5469 TYPE_MAIN_VARIANT (t
) = t
;
5470 TYPE_NEXT_VARIANT (t
) = NULL_TREE
;
5473 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5475 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5476 /* Remove the const and volatile qualifiers from arguments. The
5477 C++ front end removes them, but the C front end does not,
5478 leading to false ODR violation errors when merging two
5479 instances of the same function signature compiled by
5480 different front ends. */
5481 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5483 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5484 tree arg_type
= TREE_VALUE (p
);
5486 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5488 int quals
= TYPE_QUALS (arg_type
)
5490 & ~TYPE_QUAL_VOLATILE
;
5491 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5492 if (!fld
->pset
.add (TREE_VALUE (p
)))
5493 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5495 /* C++ FE uses TREE_PURPOSE to store initial values. */
5496 TREE_PURPOSE (p
) = NULL
;
5499 else if (TREE_CODE (type
) == METHOD_TYPE
)
5501 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5502 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5504 /* C++ FE uses TREE_PURPOSE to store initial values. */
5505 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5506 TREE_PURPOSE (p
) = NULL
;
5509 else if (RECORD_OR_UNION_TYPE_P (type
))
5511 /* Remove members that are not FIELD_DECLs from the field list
5512 of an aggregate. These occur in C++. */
5513 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5514 if (TREE_CODE (member
) == FIELD_DECL
)
5515 prev
= &DECL_CHAIN (member
);
5517 *prev
= DECL_CHAIN (member
);
5519 TYPE_VFIELD (type
) = NULL_TREE
;
5521 if (TYPE_BINFO (type
))
5523 free_lang_data_in_binfo (TYPE_BINFO (type
));
5524 /* We need to preserve link to bases and virtual table for all
5525 polymorphic types to make devirtualization machinery working. */
5526 if (!BINFO_VTABLE (TYPE_BINFO (type
))
5527 || !flag_devirtualize
)
5528 TYPE_BINFO (type
) = NULL
;
5531 else if (INTEGRAL_TYPE_P (type
)
5532 || SCALAR_FLOAT_TYPE_P (type
)
5533 || FIXED_POINT_TYPE_P (type
))
5535 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5537 /* Type values are used only for C++ ODR checking. Drop them
5538 for all type variants and non-ODR types.
5539 For ODR types the data is freed in free_odr_warning_data. */
5540 if (TYPE_MAIN_VARIANT (type
) != type
5541 || !type_with_linkage_p (type
))
5542 TYPE_VALUES (type
) = NULL
;
5544 /* Simplify representation by recording only values rather
5545 than const decls. */
5546 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5547 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5548 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5550 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5551 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5554 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5556 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5557 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5559 if (TYPE_CONTEXT (type
)
5560 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5562 tree ctx
= TYPE_CONTEXT (type
);
5565 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5567 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5568 TYPE_CONTEXT (type
) = ctx
;
5571 TYPE_STUB_DECL (type
) = NULL
;
5572 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5576 /* Return true if DECL may need an assembler name to be set. */
5579 need_assembler_name_p (tree decl
)
5581 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5582 Rule merging. This makes type_odr_p to return true on those types during
5583 LTO and by comparing the mangled name, we can say what types are intended
5584 to be equivalent across compilation unit.
5586 We do not store names of type_in_anonymous_namespace_p.
5588 Record, union and enumeration type have linkage that allows use
5589 to check type_in_anonymous_namespace_p. We do not mangle compound types
5590 that always can be compared structurally.
5592 Similarly for builtin types, we compare properties of their main variant.
5593 A special case are integer types where mangling do make differences
5594 between char/signed char/unsigned char etc. Storing name for these makes
5595 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5596 See cp/mangle.c:write_builtin_type for details. */
5598 if (TREE_CODE (decl
) == TYPE_DECL
)
5600 if (DECL_NAME (decl
)
5601 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5602 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5603 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5604 && ((TREE_CODE (TREE_TYPE (decl
)) != RECORD_TYPE
5605 && TREE_CODE (TREE_TYPE (decl
)) != UNION_TYPE
)
5606 || TYPE_CXX_ODR_P (TREE_TYPE (decl
)))
5607 && (type_with_linkage_p (TREE_TYPE (decl
))
5608 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5609 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5610 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5613 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5614 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5617 /* If DECL already has its assembler name set, it does not need a
5619 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5620 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5623 /* Abstract decls do not need an assembler name. */
5624 if (DECL_ABSTRACT_P (decl
))
5627 /* For VAR_DECLs, only static, public and external symbols need an
5630 && !TREE_STATIC (decl
)
5631 && !TREE_PUBLIC (decl
)
5632 && !DECL_EXTERNAL (decl
))
5635 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5637 /* Do not set assembler name on builtins. Allow RTL expansion to
5638 decide whether to expand inline or via a regular call. */
5639 if (fndecl_built_in_p (decl
)
5640 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5643 /* Functions represented in the callgraph need an assembler name. */
5644 if (cgraph_node::get (decl
) != NULL
)
5647 /* Unused and not public functions don't need an assembler name. */
5648 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5656 /* Reset all language specific information still present in symbol
5660 free_lang_data_in_decl (tree decl
, struct free_lang_data_d
*fld
)
5662 gcc_assert (DECL_P (decl
));
5664 /* Give the FE a chance to remove its own data first. */
5665 lang_hooks
.free_lang_data (decl
);
5667 TREE_LANG_FLAG_0 (decl
) = 0;
5668 TREE_LANG_FLAG_1 (decl
) = 0;
5669 TREE_LANG_FLAG_2 (decl
) = 0;
5670 TREE_LANG_FLAG_3 (decl
) = 0;
5671 TREE_LANG_FLAG_4 (decl
) = 0;
5672 TREE_LANG_FLAG_5 (decl
) = 0;
5673 TREE_LANG_FLAG_6 (decl
) = 0;
5675 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5676 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5677 if (TREE_CODE (decl
) == FIELD_DECL
)
5679 DECL_FCONTEXT (decl
) = NULL
;
5680 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5681 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5682 DECL_QUALIFIER (decl
) = NULL_TREE
;
5685 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5687 struct cgraph_node
*node
;
5688 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5689 the address may be taken in other unit, so this flag has no practical
5692 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5693 for public objects that indeed cannot be adressed, but it is not
5694 the case. Set the flag to true so we do not get merge failures for
5695 i.e. virtual tables between units that take address of it and
5696 units that don't. */
5697 if (TREE_PUBLIC (decl
))
5698 TREE_ADDRESSABLE (decl
) = true;
5699 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5700 if (!(node
= cgraph_node::get (decl
))
5701 || (!node
->definition
&& !node
->clones
))
5704 node
->release_body ();
5707 release_function_body (decl
);
5708 DECL_ARGUMENTS (decl
) = NULL
;
5709 DECL_RESULT (decl
) = NULL
;
5710 DECL_INITIAL (decl
) = error_mark_node
;
5713 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5717 /* If DECL has a gimple body, then the context for its
5718 arguments must be DECL. Otherwise, it doesn't really
5719 matter, as we will not be emitting any code for DECL. In
5720 general, there may be other instances of DECL created by
5721 the front end and since PARM_DECLs are generally shared,
5722 their DECL_CONTEXT changes as the replicas of DECL are
5723 created. The only time where DECL_CONTEXT is important
5724 is for the FUNCTION_DECLs that have a gimple body (since
5725 the PARM_DECL will be used in the function's body). */
5726 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5727 DECL_CONTEXT (t
) = decl
;
5728 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5729 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5730 = target_option_default_node
;
5731 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5732 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5733 = optimization_default_node
;
5736 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5737 At this point, it is not needed anymore. */
5738 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5740 /* Clear the abstract origin if it refers to a method.
5741 Otherwise dwarf2out.c will ICE as we splice functions out of
5742 TYPE_FIELDS and thus the origin will not be output
5744 if (DECL_ABSTRACT_ORIGIN (decl
)
5745 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5746 && RECORD_OR_UNION_TYPE_P
5747 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5748 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5750 DECL_VINDEX (decl
) = NULL_TREE
;
5752 else if (VAR_P (decl
))
5754 /* See comment above why we set the flag for functoins. */
5755 if (TREE_PUBLIC (decl
))
5756 TREE_ADDRESSABLE (decl
) = true;
5757 if ((DECL_EXTERNAL (decl
)
5758 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5759 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5760 DECL_INITIAL (decl
) = NULL_TREE
;
5762 else if (TREE_CODE (decl
) == TYPE_DECL
)
5764 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5765 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5766 TREE_PUBLIC (decl
) = 0;
5767 TREE_PRIVATE (decl
) = 0;
5768 DECL_ARTIFICIAL (decl
) = 0;
5769 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5770 DECL_INITIAL (decl
) = NULL_TREE
;
5771 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5772 DECL_MODE (decl
) = VOIDmode
;
5773 SET_DECL_ALIGN (decl
, 0);
5774 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5776 else if (TREE_CODE (decl
) == FIELD_DECL
)
5778 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5779 DECL_INITIAL (decl
) = NULL_TREE
;
5781 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5782 && DECL_INITIAL (decl
)
5783 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5785 /* Strip builtins from the translation-unit BLOCK. We still have targets
5786 without builtin_decl_explicit support and also builtins are shared
5787 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5788 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5792 if (fndecl_built_in_p (var
))
5793 *nextp
= TREE_CHAIN (var
);
5795 nextp
= &TREE_CHAIN (var
);
5798 /* We need to keep field decls associated with their trees. Otherwise tree
5799 merging may merge some fileds and keep others disjoint wich in turn will
5800 not do well with TREE_CHAIN pointers linking them.
5802 Also do not drop containing types for virtual methods and tables because
5803 these are needed by devirtualization.
5804 C++ destructors are special because C++ frontends sometimes produces
5805 virtual destructor as an alias of non-virtual destructor. In
5806 devirutalization code we always walk through aliases and we need
5807 context to be preserved too. See PR89335 */
5808 if (TREE_CODE (decl
) != FIELD_DECL
5809 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5810 || (!DECL_VIRTUAL_P (decl
)
5811 && (TREE_CODE (decl
) != FUNCTION_DECL
5812 || !DECL_CXX_DESTRUCTOR_P (decl
)))))
5813 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5817 /* Operand callback helper for free_lang_data_in_node. *TP is the
5818 subtree operand being considered. */
5821 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5824 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5826 if (TREE_CODE (t
) == TREE_LIST
)
5829 /* Language specific nodes will be removed, so there is no need
5830 to gather anything under them. */
5831 if (is_lang_specific (t
))
5839 /* Note that walk_tree does not traverse every possible field in
5840 decls, so we have to do our own traversals here. */
5841 add_tree_to_fld_list (t
, fld
);
5843 fld_worklist_push (DECL_NAME (t
), fld
);
5844 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5845 fld_worklist_push (DECL_SIZE (t
), fld
);
5846 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5848 /* We are going to remove everything under DECL_INITIAL for
5849 TYPE_DECLs. No point walking them. */
5850 if (TREE_CODE (t
) != TYPE_DECL
)
5851 fld_worklist_push (DECL_INITIAL (t
), fld
);
5853 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5854 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5856 if (TREE_CODE (t
) == FUNCTION_DECL
)
5858 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5859 fld_worklist_push (DECL_RESULT (t
), fld
);
5861 else if (TREE_CODE (t
) == FIELD_DECL
)
5863 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5864 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5865 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5866 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5869 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5870 && DECL_HAS_VALUE_EXPR_P (t
))
5871 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5873 if (TREE_CODE (t
) != FIELD_DECL
5874 && TREE_CODE (t
) != TYPE_DECL
)
5875 fld_worklist_push (TREE_CHAIN (t
), fld
);
5878 else if (TYPE_P (t
))
5880 /* Note that walk_tree does not traverse every possible field in
5881 types, so we have to do our own traversals here. */
5882 add_tree_to_fld_list (t
, fld
);
5884 if (!RECORD_OR_UNION_TYPE_P (t
))
5885 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5886 fld_worklist_push (TYPE_SIZE (t
), fld
);
5887 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5888 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5889 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5890 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5891 fld_worklist_push (TYPE_NAME (t
), fld
);
5892 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5893 lists, we may look types up in these lists and use them while
5894 optimizing the function body. Thus we need to free lang data
5896 if (TREE_CODE (t
) == POINTER_TYPE
)
5897 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5898 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5899 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5900 if (!POINTER_TYPE_P (t
))
5901 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5902 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5903 if (!RECORD_OR_UNION_TYPE_P (t
))
5904 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5905 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5906 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5907 do not and want not to reach unused variants this way. */
5908 if (TYPE_CONTEXT (t
))
5910 tree ctx
= TYPE_CONTEXT (t
);
5911 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5912 So push that instead. */
5913 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5914 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5915 fld_worklist_push (ctx
, fld
);
5917 fld_worklist_push (TYPE_CANONICAL (t
), fld
);
5919 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5923 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5924 fld_worklist_push (TREE_TYPE (tem
), fld
);
5925 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5926 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5928 if (RECORD_OR_UNION_TYPE_P (t
))
5931 /* Push all TYPE_FIELDS - there can be interleaving interesting
5932 and non-interesting things. */
5933 tem
= TYPE_FIELDS (t
);
5936 if (TREE_CODE (tem
) == FIELD_DECL
)
5937 fld_worklist_push (tem
, fld
);
5938 tem
= TREE_CHAIN (tem
);
5941 if (FUNC_OR_METHOD_TYPE_P (t
))
5942 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5944 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5947 else if (TREE_CODE (t
) == BLOCK
)
5949 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5951 if (TREE_CODE (*tem
) != VAR_DECL
5952 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
)))
5954 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5955 && TREE_CODE (*tem
) != PARM_DECL
);
5956 *tem
= TREE_CHAIN (*tem
);
5960 fld_worklist_push (*tem
, fld
);
5961 tem
= &TREE_CHAIN (*tem
);
5964 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5965 fld_worklist_push (tem
, fld
);
5966 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5969 if (TREE_CODE (t
) != IDENTIFIER_NODE
5970 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5971 fld_worklist_push (TREE_TYPE (t
), fld
);
5977 /* Find decls and types in T. */
5980 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5984 if (!fld
->pset
.contains (t
))
5985 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5986 if (fld
->worklist
.is_empty ())
5988 t
= fld
->worklist
.pop ();
5992 /* Translate all the types in LIST with the corresponding runtime
5996 get_eh_types_for_runtime (tree list
)
6000 if (list
== NULL_TREE
)
6003 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6005 list
= TREE_CHAIN (list
);
6008 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
6009 TREE_CHAIN (prev
) = n
;
6010 prev
= TREE_CHAIN (prev
);
6011 list
= TREE_CHAIN (list
);
6018 /* Find decls and types referenced in EH region R and store them in
6019 FLD->DECLS and FLD->TYPES. */
6022 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
6033 /* The types referenced in each catch must first be changed to the
6034 EH types used at runtime. This removes references to FE types
6036 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6038 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6039 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6044 case ERT_ALLOWED_EXCEPTIONS
:
6045 r
->u
.allowed
.type_list
6046 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6047 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6050 case ERT_MUST_NOT_THROW
:
6051 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6052 find_decls_types_r
, fld
, &fld
->pset
);
6058 /* Find decls and types referenced in cgraph node N and store them in
6059 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6060 look for *every* kind of DECL and TYPE node reachable from N,
6061 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6062 NAMESPACE_DECLs, etc). */
6065 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
6068 struct function
*fn
;
6072 find_decls_types (n
->decl
, fld
);
6074 if (!gimple_has_body_p (n
->decl
))
6077 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6079 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6081 /* Traverse locals. */
6082 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6083 find_decls_types (t
, fld
);
6085 /* Traverse EH regions in FN. */
6088 FOR_ALL_EH_REGION_FN (r
, fn
)
6089 find_decls_types_in_eh_region (r
, fld
);
6092 /* Traverse every statement in FN. */
6093 FOR_EACH_BB_FN (bb
, fn
)
6096 gimple_stmt_iterator si
;
6099 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6101 gphi
*phi
= psi
.phi ();
6103 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6105 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6106 find_decls_types (*arg_p
, fld
);
6110 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6112 gimple
*stmt
= gsi_stmt (si
);
6114 if (is_gimple_call (stmt
))
6115 find_decls_types (gimple_call_fntype (stmt
), fld
);
6117 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6119 tree arg
= gimple_op (stmt
, i
);
6120 find_decls_types (arg
, fld
);
6127 /* Find decls and types referenced in varpool node N and store them in
6128 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6129 look for *every* kind of DECL and TYPE node reachable from N,
6130 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6131 NAMESPACE_DECLs, etc). */
6134 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
6136 find_decls_types (v
->decl
, fld
);
6139 /* If T needs an assembler name, have one created for it. */
6142 assign_assembler_name_if_needed (tree t
)
6144 if (need_assembler_name_p (t
))
6146 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6147 diagnostics that use input_location to show locus
6148 information. The problem here is that, at this point,
6149 input_location is generally anchored to the end of the file
6150 (since the parser is long gone), so we don't have a good
6151 position to pin it to.
6153 To alleviate this problem, this uses the location of T's
6154 declaration. Examples of this are
6155 testsuite/g++.dg/template/cond2.C and
6156 testsuite/g++.dg/template/pr35240.C. */
6157 location_t saved_location
= input_location
;
6158 input_location
= DECL_SOURCE_LOCATION (t
);
6160 decl_assembler_name (t
);
6162 input_location
= saved_location
;
6167 /* Free language specific information for every operand and expression
6168 in every node of the call graph. This process operates in three stages:
6170 1- Every callgraph node and varpool node is traversed looking for
6171 decls and types embedded in them. This is a more exhaustive
6172 search than that done by find_referenced_vars, because it will
6173 also collect individual fields, decls embedded in types, etc.
6175 2- All the decls found are sent to free_lang_data_in_decl.
6177 3- All the types found are sent to free_lang_data_in_type.
6179 The ordering between decls and types is important because
6180 free_lang_data_in_decl sets assembler names, which includes
6181 mangling. So types cannot be freed up until assembler names have
6185 free_lang_data_in_cgraph (struct free_lang_data_d
*fld
)
6187 struct cgraph_node
*n
;
6193 /* Find decls and types in the body of every function in the callgraph. */
6194 FOR_EACH_FUNCTION (n
)
6195 find_decls_types_in_node (n
, fld
);
6197 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6198 find_decls_types (p
->decl
, fld
);
6200 /* Find decls and types in every varpool symbol. */
6201 FOR_EACH_VARIABLE (v
)
6202 find_decls_types_in_var (v
, fld
);
6204 /* Set the assembler name on every decl found. We need to do this
6205 now because free_lang_data_in_decl will invalidate data needed
6206 for mangling. This breaks mangling on interdependent decls. */
6207 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6208 assign_assembler_name_if_needed (t
);
6210 /* Traverse every decl found freeing its language data. */
6211 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6212 free_lang_data_in_decl (t
, fld
);
6214 /* Traverse every type found freeing its language data. */
6215 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6216 free_lang_data_in_type (t
, fld
);
6220 /* Free resources that are used by FE but are not needed once they are done. */
6223 free_lang_data (void)
6226 struct free_lang_data_d fld
;
6228 /* If we are the LTO frontend we have freed lang-specific data already. */
6230 || (!flag_generate_lto
&& !flag_generate_offload
))
6232 /* Rebuild type inheritance graph even when not doing LTO to get
6233 consistent profile data. */
6234 rebuild_type_inheritance_graph ();
6238 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6239 fld_simplified_types
= new hash_map
<tree
, tree
>;
6241 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6242 if (vec_safe_is_empty (all_translation_units
))
6243 build_translation_unit_decl (NULL_TREE
);
6245 /* Allocate and assign alias sets to the standard integer types
6246 while the slots are still in the way the frontends generated them. */
6247 for (i
= 0; i
< itk_none
; ++i
)
6248 if (integer_types
[i
])
6249 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6251 /* Traverse the IL resetting language specific information for
6252 operands, expressions, etc. */
6253 free_lang_data_in_cgraph (&fld
);
6255 /* Create gimple variants for common types. */
6256 for (unsigned i
= 0;
6257 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6259 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6261 /* Reset some langhooks. Do not reset types_compatible_p, it may
6262 still be used indirectly via the get_alias_set langhook. */
6263 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6264 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6265 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6266 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6267 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6268 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6269 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6270 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6272 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6279 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6283 /* We do not want the default decl_assembler_name implementation,
6284 rather if we have fixed everything we want a wrapper around it
6285 asserting that all non-local symbols already got their assembler
6286 name and only produce assembler names for local symbols. Or rather
6287 make sure we never call decl_assembler_name on local symbols and
6288 devise a separate, middle-end private scheme for it. */
6290 /* Reset diagnostic machinery. */
6291 tree_diagnostics_defaults (global_dc
);
6293 rebuild_type_inheritance_graph ();
6295 delete fld_incomplete_types
;
6296 delete fld_simplified_types
;
6304 const pass_data pass_data_ipa_free_lang_data
=
6306 SIMPLE_IPA_PASS
, /* type */
6307 "*free_lang_data", /* name */
6308 OPTGROUP_NONE
, /* optinfo_flags */
6309 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6310 0, /* properties_required */
6311 0, /* properties_provided */
6312 0, /* properties_destroyed */
6313 0, /* todo_flags_start */
6314 0, /* todo_flags_finish */
6317 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6320 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6321 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6324 /* opt_pass methods: */
6325 virtual unsigned int execute (function
*) { return free_lang_data (); }
6327 }; // class pass_ipa_free_lang_data
6331 simple_ipa_opt_pass
*
6332 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6334 return new pass_ipa_free_lang_data (ctxt
);
6337 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6338 of the various TYPE_QUAL values. */
6341 set_type_quals (tree type
, int type_quals
)
6343 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6344 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6345 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6346 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6347 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6350 /* Returns true iff CAND and BASE have equivalent language-specific
6354 check_lang_type (const_tree cand
, const_tree base
)
6356 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6358 /* type_hash_eq currently only applies to these types. */
6359 if (TREE_CODE (cand
) != FUNCTION_TYPE
6360 && TREE_CODE (cand
) != METHOD_TYPE
)
6362 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6365 /* This function checks to see if TYPE matches the size one of the built-in
6366 atomic types, and returns that core atomic type. */
6369 find_atomic_core_type (const_tree type
)
6371 tree base_atomic_type
;
6373 /* Only handle complete types. */
6374 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6377 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6380 base_atomic_type
= atomicQI_type_node
;
6384 base_atomic_type
= atomicHI_type_node
;
6388 base_atomic_type
= atomicSI_type_node
;
6392 base_atomic_type
= atomicDI_type_node
;
6396 base_atomic_type
= atomicTI_type_node
;
6400 base_atomic_type
= NULL_TREE
;
6403 return base_atomic_type
;
6406 /* Returns true iff unqualified CAND and BASE are equivalent. */
6409 check_base_type (const_tree cand
, const_tree base
)
6411 if (TYPE_NAME (cand
) != TYPE_NAME (base
)
6412 /* Apparently this is needed for Objective-C. */
6413 || TYPE_CONTEXT (cand
) != TYPE_CONTEXT (base
)
6414 || !attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6415 TYPE_ATTRIBUTES (base
)))
6417 /* Check alignment. */
6418 if (TYPE_ALIGN (cand
) == TYPE_ALIGN (base
))
6420 /* Atomic types increase minimal alignment. We must to do so as well
6421 or we get duplicated canonical types. See PR88686. */
6422 if ((TYPE_QUALS (cand
) & TYPE_QUAL_ATOMIC
))
6424 /* See if this object can map to a basic atomic type. */
6425 tree atomic_type
= find_atomic_core_type (cand
);
6426 if (atomic_type
&& TYPE_ALIGN (atomic_type
) == TYPE_ALIGN (cand
))
6432 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6435 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6437 return (TYPE_QUALS (cand
) == type_quals
6438 && check_base_type (cand
, base
)
6439 && check_lang_type (cand
, base
));
6442 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6445 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6447 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6448 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6449 /* Apparently this is needed for Objective-C. */
6450 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6451 /* Check alignment. */
6452 && TYPE_ALIGN (cand
) == align
6453 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6454 TYPE_ATTRIBUTES (base
))
6455 && check_lang_type (cand
, base
));
6458 /* Return a version of the TYPE, qualified as indicated by the
6459 TYPE_QUALS, if one exists. If no qualified version exists yet,
6460 return NULL_TREE. */
6463 get_qualified_type (tree type
, int type_quals
)
6465 if (TYPE_QUALS (type
) == type_quals
)
6468 tree mv
= TYPE_MAIN_VARIANT (type
);
6469 if (check_qualified_type (mv
, type
, type_quals
))
6472 /* Search the chain of variants to see if there is already one there just
6473 like the one we need to have. If so, use that existing one. We must
6474 preserve the TYPE_NAME, since there is code that depends on this. */
6475 for (tree
*tp
= &TYPE_NEXT_VARIANT (mv
); *tp
; tp
= &TYPE_NEXT_VARIANT (*tp
))
6476 if (check_qualified_type (*tp
, type
, type_quals
))
6478 /* Put the found variant at the head of the variant list so
6479 frequently searched variants get found faster. The C++ FE
6480 benefits greatly from this. */
6482 *tp
= TYPE_NEXT_VARIANT (t
);
6483 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (mv
);
6484 TYPE_NEXT_VARIANT (mv
) = t
;
6491 /* Like get_qualified_type, but creates the type if it does not
6492 exist. This function never returns NULL_TREE. */
6495 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6499 /* See if we already have the appropriate qualified variant. */
6500 t
= get_qualified_type (type
, type_quals
);
6502 /* If not, build it. */
6505 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6506 set_type_quals (t
, type_quals
);
6508 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6510 /* See if this object can map to a basic atomic type. */
6511 tree atomic_type
= find_atomic_core_type (type
);
6514 /* Ensure the alignment of this type is compatible with
6515 the required alignment of the atomic type. */
6516 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6517 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6521 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6522 /* Propagate structural equality. */
6523 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6524 else if (TYPE_CANONICAL (type
) != type
)
6525 /* Build the underlying canonical type, since it is different
6528 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6529 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6532 /* T is its own canonical type. */
6533 TYPE_CANONICAL (t
) = t
;
6540 /* Create a variant of type T with alignment ALIGN. */
6543 build_aligned_type (tree type
, unsigned int align
)
6547 if (TYPE_PACKED (type
)
6548 || TYPE_ALIGN (type
) == align
)
6551 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6552 if (check_aligned_type (t
, type
, align
))
6555 t
= build_variant_type_copy (type
);
6556 SET_TYPE_ALIGN (t
, align
);
6557 TYPE_USER_ALIGN (t
) = 1;
6562 /* Create a new distinct copy of TYPE. The new type is made its own
6563 MAIN_VARIANT. If TYPE requires structural equality checks, the
6564 resulting type requires structural equality checks; otherwise, its
6565 TYPE_CANONICAL points to itself. */
6568 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6570 tree t
= copy_node (type PASS_MEM_STAT
);
6572 TYPE_POINTER_TO (t
) = 0;
6573 TYPE_REFERENCE_TO (t
) = 0;
6575 /* Set the canonical type either to a new equivalence class, or
6576 propagate the need for structural equality checks. */
6577 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6578 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6580 TYPE_CANONICAL (t
) = t
;
6582 /* Make it its own variant. */
6583 TYPE_MAIN_VARIANT (t
) = t
;
6584 TYPE_NEXT_VARIANT (t
) = 0;
6586 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6587 whose TREE_TYPE is not t. This can also happen in the Ada
6588 frontend when using subtypes. */
6593 /* Create a new variant of TYPE, equivalent but distinct. This is so
6594 the caller can modify it. TYPE_CANONICAL for the return type will
6595 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6596 are considered equal by the language itself (or that both types
6597 require structural equality checks). */
6600 build_variant_type_copy (tree type MEM_STAT_DECL
)
6602 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6604 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6606 /* Since we're building a variant, assume that it is a non-semantic
6607 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6608 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6609 /* Type variants have no alias set defined. */
6610 TYPE_ALIAS_SET (t
) = -1;
6612 /* Add the new type to the chain of variants of TYPE. */
6613 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6614 TYPE_NEXT_VARIANT (m
) = t
;
6615 TYPE_MAIN_VARIANT (t
) = m
;
6620 /* Return true if the from tree in both tree maps are equal. */
6623 tree_map_base_eq (const void *va
, const void *vb
)
6625 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6626 *const b
= (const struct tree_map_base
*) vb
;
6627 return (a
->from
== b
->from
);
6630 /* Hash a from tree in a tree_base_map. */
6633 tree_map_base_hash (const void *item
)
6635 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6638 /* Return true if this tree map structure is marked for garbage collection
6639 purposes. We simply return true if the from tree is marked, so that this
6640 structure goes away when the from tree goes away. */
6643 tree_map_base_marked_p (const void *p
)
6645 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6648 /* Hash a from tree in a tree_map. */
6651 tree_map_hash (const void *item
)
6653 return (((const struct tree_map
*) item
)->hash
);
6656 /* Hash a from tree in a tree_decl_map. */
6659 tree_decl_map_hash (const void *item
)
6661 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6664 /* Return the initialization priority for DECL. */
6667 decl_init_priority_lookup (tree decl
)
6669 symtab_node
*snode
= symtab_node::get (decl
);
6672 return DEFAULT_INIT_PRIORITY
;
6674 snode
->get_init_priority ();
6677 /* Return the finalization priority for DECL. */
6680 decl_fini_priority_lookup (tree decl
)
6682 cgraph_node
*node
= cgraph_node::get (decl
);
6685 return DEFAULT_INIT_PRIORITY
;
6687 node
->get_fini_priority ();
6690 /* Set the initialization priority for DECL to PRIORITY. */
6693 decl_init_priority_insert (tree decl
, priority_type priority
)
6695 struct symtab_node
*snode
;
6697 if (priority
== DEFAULT_INIT_PRIORITY
)
6699 snode
= symtab_node::get (decl
);
6703 else if (VAR_P (decl
))
6704 snode
= varpool_node::get_create (decl
);
6706 snode
= cgraph_node::get_create (decl
);
6707 snode
->set_init_priority (priority
);
6710 /* Set the finalization priority for DECL to PRIORITY. */
6713 decl_fini_priority_insert (tree decl
, priority_type priority
)
6715 struct cgraph_node
*node
;
6717 if (priority
== DEFAULT_INIT_PRIORITY
)
6719 node
= cgraph_node::get (decl
);
6724 node
= cgraph_node::get_create (decl
);
6725 node
->set_fini_priority (priority
);
6728 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6731 print_debug_expr_statistics (void)
6733 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6734 (long) debug_expr_for_decl
->size (),
6735 (long) debug_expr_for_decl
->elements (),
6736 debug_expr_for_decl
->collisions ());
6739 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6742 print_value_expr_statistics (void)
6744 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6745 (long) value_expr_for_decl
->size (),
6746 (long) value_expr_for_decl
->elements (),
6747 value_expr_for_decl
->collisions ());
6750 /* Lookup a debug expression for FROM, and return it if we find one. */
6753 decl_debug_expr_lookup (tree from
)
6755 struct tree_decl_map
*h
, in
;
6756 in
.base
.from
= from
;
6758 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6764 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6767 decl_debug_expr_insert (tree from
, tree to
)
6769 struct tree_decl_map
*h
;
6771 h
= ggc_alloc
<tree_decl_map
> ();
6772 h
->base
.from
= from
;
6774 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6777 /* Lookup a value expression for FROM, and return it if we find one. */
6780 decl_value_expr_lookup (tree from
)
6782 struct tree_decl_map
*h
, in
;
6783 in
.base
.from
= from
;
6785 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6791 /* Insert a mapping FROM->TO in the value expression hashtable. */
6794 decl_value_expr_insert (tree from
, tree to
)
6796 struct tree_decl_map
*h
;
6798 h
= ggc_alloc
<tree_decl_map
> ();
6799 h
->base
.from
= from
;
6801 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6804 /* Lookup a vector of debug arguments for FROM, and return it if we
6808 decl_debug_args_lookup (tree from
)
6810 struct tree_vec_map
*h
, in
;
6812 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6814 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6815 in
.base
.from
= from
;
6816 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6822 /* Insert a mapping FROM->empty vector of debug arguments in the value
6823 expression hashtable. */
6826 decl_debug_args_insert (tree from
)
6828 struct tree_vec_map
*h
;
6831 if (DECL_HAS_DEBUG_ARGS_P (from
))
6832 return decl_debug_args_lookup (from
);
6833 if (debug_args_for_decl
== NULL
)
6834 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6835 h
= ggc_alloc
<tree_vec_map
> ();
6836 h
->base
.from
= from
;
6838 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6840 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6844 /* Hashing of types so that we don't make duplicates.
6845 The entry point is `type_hash_canon'. */
6847 /* Generate the default hash code for TYPE. This is designed for
6848 speed, rather than maximum entropy. */
6851 type_hash_canon_hash (tree type
)
6853 inchash::hash hstate
;
6855 hstate
.add_int (TREE_CODE (type
));
6857 if (TREE_TYPE (type
))
6858 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6860 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6861 /* Just the identifier is adequate to distinguish. */
6862 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6864 switch (TREE_CODE (type
))
6867 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6870 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6871 if (TREE_VALUE (t
) != error_mark_node
)
6872 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6876 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6881 if (TYPE_DOMAIN (type
))
6882 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6883 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6885 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6886 hstate
.add_object (typeless
);
6893 tree t
= TYPE_MAX_VALUE (type
);
6895 t
= TYPE_MIN_VALUE (type
);
6896 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6897 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6902 case FIXED_POINT_TYPE
:
6904 unsigned prec
= TYPE_PRECISION (type
);
6905 hstate
.add_object (prec
);
6910 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6917 return hstate
.end ();
6920 /* These are the Hashtable callback functions. */
6922 /* Returns true iff the types are equivalent. */
6925 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6927 /* First test the things that are the same for all types. */
6928 if (a
->hash
!= b
->hash
6929 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6930 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6931 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6932 TYPE_ATTRIBUTES (b
->type
))
6933 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6934 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6937 /* Be careful about comparing arrays before and after the element type
6938 has been completed; don't compare TYPE_ALIGN unless both types are
6940 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6941 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6942 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6945 switch (TREE_CODE (a
->type
))
6950 case REFERENCE_TYPE
:
6955 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6956 TYPE_VECTOR_SUBPARTS (b
->type
));
6959 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6960 && !(TYPE_VALUES (a
->type
)
6961 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6962 && TYPE_VALUES (b
->type
)
6963 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6964 && type_list_equal (TYPE_VALUES (a
->type
),
6965 TYPE_VALUES (b
->type
))))
6973 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6975 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6976 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6977 TYPE_MAX_VALUE (b
->type
)))
6978 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6979 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6980 TYPE_MIN_VALUE (b
->type
))));
6982 case FIXED_POINT_TYPE
:
6983 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6986 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6989 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6990 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6991 || (TYPE_ARG_TYPES (a
->type
)
6992 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6993 && TYPE_ARG_TYPES (b
->type
)
6994 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6995 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6996 TYPE_ARG_TYPES (b
->type
)))))
7000 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
7001 where the flag should be inherited from the element type
7002 and can change after ARRAY_TYPEs are created; on non-aggregates
7003 compare it and hash it, scalars will never have that flag set
7004 and we need to differentiate between arrays created by different
7005 front-ends or middle-end created arrays. */
7006 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
7007 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
7008 || (TYPE_TYPELESS_STORAGE (a
->type
)
7009 == TYPE_TYPELESS_STORAGE (b
->type
))));
7013 case QUAL_UNION_TYPE
:
7014 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7015 || (TYPE_FIELDS (a
->type
)
7016 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7017 && TYPE_FIELDS (b
->type
)
7018 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7019 && type_list_equal (TYPE_FIELDS (a
->type
),
7020 TYPE_FIELDS (b
->type
))));
7023 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7024 || (TYPE_ARG_TYPES (a
->type
)
7025 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7026 && TYPE_ARG_TYPES (b
->type
)
7027 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7028 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7029 TYPE_ARG_TYPES (b
->type
))))
7037 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7038 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7043 /* Given TYPE, and HASHCODE its hash code, return the canonical
7044 object for an identical type if one already exists.
7045 Otherwise, return TYPE, and record it as the canonical object.
7047 To use this function, first create a type of the sort you want.
7048 Then compute its hash code from the fields of the type that
7049 make it different from other similar types.
7050 Then call this function and use the value. */
7053 type_hash_canon (unsigned int hashcode
, tree type
)
7058 /* The hash table only contains main variants, so ensure that's what we're
7060 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7062 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7063 must call that routine before comparing TYPE_ALIGNs. */
7069 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7072 tree t1
= ((type_hash
*) *loc
)->type
;
7073 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7075 if (TYPE_UID (type
) + 1 == next_type_uid
)
7077 /* Free also min/max values and the cache for integer
7078 types. This can't be done in free_node, as LTO frees
7079 those on its own. */
7080 if (TREE_CODE (type
) == INTEGER_TYPE
)
7082 if (TYPE_MIN_VALUE (type
)
7083 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7085 /* Zero is always in TYPE_CACHED_VALUES. */
7086 if (! TYPE_UNSIGNED (type
))
7087 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7088 ggc_free (TYPE_MIN_VALUE (type
));
7090 if (TYPE_MAX_VALUE (type
)
7091 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7093 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7094 ggc_free (TYPE_MAX_VALUE (type
));
7096 if (TYPE_CACHED_VALUES_P (type
))
7097 ggc_free (TYPE_CACHED_VALUES (type
));
7104 struct type_hash
*h
;
7106 h
= ggc_alloc
<type_hash
> ();
7116 print_type_hash_statistics (void)
7118 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7119 (long) type_hash_table
->size (),
7120 (long) type_hash_table
->elements (),
7121 type_hash_table
->collisions ());
7124 /* Given two lists of types
7125 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7126 return 1 if the lists contain the same types in the same order.
7127 Also, the TREE_PURPOSEs must match. */
7130 type_list_equal (const_tree l1
, const_tree l2
)
7134 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7135 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7136 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7137 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7138 && (TREE_TYPE (TREE_PURPOSE (t1
))
7139 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7145 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7146 given by TYPE. If the argument list accepts variable arguments,
7147 then this function counts only the ordinary arguments. */
7150 type_num_arguments (const_tree fntype
)
7154 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7155 /* If the function does not take a variable number of arguments,
7156 the last element in the list will have type `void'. */
7157 if (VOID_TYPE_P (TREE_VALUE (t
)))
7165 /* Return the type of the function TYPE's argument ARGNO if known.
7166 For vararg function's where ARGNO refers to one of the variadic
7167 arguments return null. Otherwise, return a void_type_node for
7168 out-of-bounds ARGNO. */
7171 type_argument_type (const_tree fntype
, unsigned argno
)
7173 /* Treat zero the same as an out-of-bounds argument number. */
7175 return void_type_node
;
7177 function_args_iterator iter
;
7181 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7183 /* A vararg function's argument list ends in a null. Otherwise,
7184 an ordinary function's argument list ends with void. Return
7185 null if ARGNO refers to a vararg argument, void_type_node if
7186 it's out of bounds, and the formal argument type otherwise. */
7190 if (i
== argno
|| VOID_TYPE_P (argtype
))
7199 /* Nonzero if integer constants T1 and T2
7200 represent the same constant value. */
7203 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7208 if (t1
== 0 || t2
== 0)
7211 STRIP_ANY_LOCATION_WRAPPER (t1
);
7212 STRIP_ANY_LOCATION_WRAPPER (t2
);
7214 if (TREE_CODE (t1
) == INTEGER_CST
7215 && TREE_CODE (t2
) == INTEGER_CST
7216 && wi::to_widest (t1
) == wi::to_widest (t2
))
7222 /* Return true if T is an INTEGER_CST whose numerical value (extended
7223 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7226 tree_fits_shwi_p (const_tree t
)
7228 return (t
!= NULL_TREE
7229 && TREE_CODE (t
) == INTEGER_CST
7230 && wi::fits_shwi_p (wi::to_widest (t
)));
7233 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7234 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7237 tree_fits_poly_int64_p (const_tree t
)
7241 if (POLY_INT_CST_P (t
))
7243 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7244 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7248 return (TREE_CODE (t
) == INTEGER_CST
7249 && wi::fits_shwi_p (wi::to_widest (t
)));
7252 /* Return true if T is an INTEGER_CST whose numerical value (extended
7253 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7256 tree_fits_uhwi_p (const_tree t
)
7258 return (t
!= NULL_TREE
7259 && TREE_CODE (t
) == INTEGER_CST
7260 && wi::fits_uhwi_p (wi::to_widest (t
)));
7263 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7264 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7267 tree_fits_poly_uint64_p (const_tree t
)
7271 if (POLY_INT_CST_P (t
))
7273 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7274 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7278 return (TREE_CODE (t
) == INTEGER_CST
7279 && wi::fits_uhwi_p (wi::to_widest (t
)));
7282 /* T is an INTEGER_CST whose numerical value (extended according to
7283 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7287 tree_to_shwi (const_tree t
)
7289 gcc_assert (tree_fits_shwi_p (t
));
7290 return TREE_INT_CST_LOW (t
);
7293 /* T is an INTEGER_CST whose numerical value (extended according to
7294 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7297 unsigned HOST_WIDE_INT
7298 tree_to_uhwi (const_tree t
)
7300 gcc_assert (tree_fits_uhwi_p (t
));
7301 return TREE_INT_CST_LOW (t
);
7304 /* Return the most significant (sign) bit of T. */
7307 tree_int_cst_sign_bit (const_tree t
)
7309 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7311 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7314 /* Return an indication of the sign of the integer constant T.
7315 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7316 Note that -1 will never be returned if T's type is unsigned. */
7319 tree_int_cst_sgn (const_tree t
)
7321 if (wi::to_wide (t
) == 0)
7323 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7325 else if (wi::neg_p (wi::to_wide (t
)))
7331 /* Return the minimum number of bits needed to represent VALUE in a
7332 signed or unsigned type, UNSIGNEDP says which. */
7335 tree_int_cst_min_precision (tree value
, signop sgn
)
7337 /* If the value is negative, compute its negative minus 1. The latter
7338 adjustment is because the absolute value of the largest negative value
7339 is one larger than the largest positive value. This is equivalent to
7340 a bit-wise negation, so use that operation instead. */
7342 if (tree_int_cst_sgn (value
) < 0)
7343 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7345 /* Return the number of bits needed, taking into account the fact
7346 that we need one more bit for a signed than unsigned type.
7347 If value is 0 or -1, the minimum precision is 1 no matter
7348 whether unsignedp is true or false. */
7350 if (integer_zerop (value
))
7353 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7356 /* Return truthvalue of whether T1 is the same tree structure as T2.
7357 Return 1 if they are the same.
7358 Return 0 if they are understandably different.
7359 Return -1 if either contains tree structure not understood by
7363 simple_cst_equal (const_tree t1
, const_tree t2
)
7365 enum tree_code code1
, code2
;
7371 if (t1
== 0 || t2
== 0)
7374 /* For location wrappers to be the same, they must be at the same
7375 source location (and wrap the same thing). */
7376 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7378 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7380 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7383 code1
= TREE_CODE (t1
);
7384 code2
= TREE_CODE (t2
);
7386 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7388 if (CONVERT_EXPR_CODE_P (code2
)
7389 || code2
== NON_LVALUE_EXPR
)
7390 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7392 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7395 else if (CONVERT_EXPR_CODE_P (code2
)
7396 || code2
== NON_LVALUE_EXPR
)
7397 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7405 return wi::to_widest (t1
) == wi::to_widest (t2
);
7408 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7411 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7414 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7415 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7416 TREE_STRING_LENGTH (t1
)));
7420 unsigned HOST_WIDE_INT idx
;
7421 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7422 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7424 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7427 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7428 /* ??? Should we handle also fields here? */
7429 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7435 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7438 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7441 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7444 const_tree arg1
, arg2
;
7445 const_call_expr_arg_iterator iter1
, iter2
;
7446 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7447 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7449 arg1
= next_const_call_expr_arg (&iter1
),
7450 arg2
= next_const_call_expr_arg (&iter2
))
7452 cmp
= simple_cst_equal (arg1
, arg2
);
7456 return arg1
== arg2
;
7460 /* Special case: if either target is an unallocated VAR_DECL,
7461 it means that it's going to be unified with whatever the
7462 TARGET_EXPR is really supposed to initialize, so treat it
7463 as being equivalent to anything. */
7464 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7465 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7466 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7467 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7468 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7469 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7472 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7477 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7479 case WITH_CLEANUP_EXPR
:
7480 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7484 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7487 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7488 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7499 if (POLY_INT_CST_P (t1
))
7500 /* A false return means maybe_ne rather than known_ne. */
7501 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7502 TYPE_SIGN (TREE_TYPE (t1
))),
7503 poly_widest_int::from (poly_int_cst_value (t2
),
7504 TYPE_SIGN (TREE_TYPE (t2
))));
7508 /* This general rule works for most tree codes. All exceptions should be
7509 handled above. If this is a language-specific tree code, we can't
7510 trust what might be in the operand, so say we don't know
7512 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7515 switch (TREE_CODE_CLASS (code1
))
7519 case tcc_comparison
:
7520 case tcc_expression
:
7524 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7526 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7538 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7539 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7540 than U, respectively. */
7543 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7545 if (tree_int_cst_sgn (t
) < 0)
7547 else if (!tree_fits_uhwi_p (t
))
7549 else if (TREE_INT_CST_LOW (t
) == u
)
7551 else if (TREE_INT_CST_LOW (t
) < u
)
7557 /* Return true if SIZE represents a constant size that is in bounds of
7558 what the middle-end and the backend accepts (covering not more than
7559 half of the address-space).
7560 When PERR is non-null, set *PERR on failure to the description of
7561 why SIZE is not valid. */
7564 valid_constant_size_p (const_tree size
, cst_size_error
*perr
/* = NULL */)
7566 if (POLY_INT_CST_P (size
))
7568 if (TREE_OVERFLOW (size
))
7570 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7571 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7576 cst_size_error error
;
7580 if (TREE_CODE (size
) != INTEGER_CST
)
7582 *perr
= cst_size_not_constant
;
7586 if (TREE_OVERFLOW_P (size
))
7588 *perr
= cst_size_overflow
;
7592 if (tree_int_cst_sgn (size
) < 0)
7594 *perr
= cst_size_negative
;
7597 if (!tree_fits_uhwi_p (size
)
7598 || (wi::to_widest (TYPE_MAX_VALUE (sizetype
))
7599 < wi::to_widest (size
) * 2))
7601 *perr
= cst_size_too_big
;
7608 /* Return the precision of the type, or for a complex or vector type the
7609 precision of the type of its elements. */
7612 element_precision (const_tree type
)
7615 type
= TREE_TYPE (type
);
7616 enum tree_code code
= TREE_CODE (type
);
7617 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7618 type
= TREE_TYPE (type
);
7620 return TYPE_PRECISION (type
);
7623 /* Return true if CODE represents an associative tree code. Otherwise
7626 associative_tree_code (enum tree_code code
)
7645 /* Return true if CODE represents a commutative tree code. Otherwise
7648 commutative_tree_code (enum tree_code code
)
7654 case MULT_HIGHPART_EXPR
:
7662 case UNORDERED_EXPR
:
7666 case TRUTH_AND_EXPR
:
7667 case TRUTH_XOR_EXPR
:
7669 case WIDEN_MULT_EXPR
:
7670 case VEC_WIDEN_MULT_HI_EXPR
:
7671 case VEC_WIDEN_MULT_LO_EXPR
:
7672 case VEC_WIDEN_MULT_EVEN_EXPR
:
7673 case VEC_WIDEN_MULT_ODD_EXPR
:
7682 /* Return true if CODE represents a ternary tree code for which the
7683 first two operands are commutative. Otherwise return false. */
7685 commutative_ternary_tree_code (enum tree_code code
)
7689 case WIDEN_MULT_PLUS_EXPR
:
7690 case WIDEN_MULT_MINUS_EXPR
:
7700 /* Returns true if CODE can overflow. */
7703 operation_can_overflow (enum tree_code code
)
7711 /* Can overflow in various ways. */
7713 case TRUNC_DIV_EXPR
:
7714 case EXACT_DIV_EXPR
:
7715 case FLOOR_DIV_EXPR
:
7717 /* For INT_MIN / -1. */
7724 /* These operators cannot overflow. */
7729 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7730 ftrapv doesn't generate trapping insns for CODE. */
7733 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7735 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7737 /* We don't generate instructions that trap on overflow for complex or vector
7739 if (!INTEGRAL_TYPE_P (type
))
7742 if (!TYPE_OVERFLOW_TRAPS (type
))
7752 /* These operators can overflow, and -ftrapv generates trapping code for
7755 case TRUNC_DIV_EXPR
:
7756 case EXACT_DIV_EXPR
:
7757 case FLOOR_DIV_EXPR
:
7760 /* These operators can overflow, but -ftrapv does not generate trapping
7764 /* These operators cannot overflow. */
7772 /* Generate a hash value for an expression. This can be used iteratively
7773 by passing a previous result as the HSTATE argument.
7775 This function is intended to produce the same hash for expressions which
7776 would compare equal using operand_equal_p. */
7778 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7781 enum tree_code code
;
7782 enum tree_code_class tclass
;
7784 if (t
== NULL_TREE
|| t
== error_mark_node
)
7786 hstate
.merge_hash (0);
7790 STRIP_ANY_LOCATION_WRAPPER (t
);
7792 if (!(flags
& OEP_ADDRESS_OF
))
7795 code
= TREE_CODE (t
);
7799 /* Alas, constants aren't shared, so we can't rely on pointer
7802 hstate
.merge_hash (0);
7805 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7806 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7807 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7812 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7815 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7816 hstate
.merge_hash (val2
);
7821 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7822 hstate
.merge_hash (val2
);
7826 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7827 TREE_STRING_LENGTH (t
));
7830 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7831 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7835 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7836 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7837 unsigned int count
= vector_cst_encoded_nelts (t
);
7838 for (unsigned int i
= 0; i
< count
; ++i
)
7839 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7843 /* We can just compare by pointer. */
7844 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7846 case PLACEHOLDER_EXPR
:
7847 /* The node itself doesn't matter. */
7854 /* A list of expressions, for a CALL_EXPR or as the elements of a
7856 for (; t
; t
= TREE_CHAIN (t
))
7857 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7861 unsigned HOST_WIDE_INT idx
;
7863 flags
&= ~OEP_ADDRESS_OF
;
7864 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7866 inchash::add_expr (field
, hstate
, flags
);
7867 inchash::add_expr (value
, hstate
, flags
);
7871 case STATEMENT_LIST
:
7873 tree_stmt_iterator i
;
7874 for (i
= tsi_start (CONST_CAST_TREE (t
));
7875 !tsi_end_p (i
); tsi_next (&i
))
7876 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7880 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7881 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7883 case IDENTIFIER_NODE
:
7884 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
7887 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7888 Otherwise nodes that compare equal according to operand_equal_p might
7889 get different hash codes. However, don't do this for machine specific
7890 or front end builtins, since the function code is overloaded in those
7892 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7893 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7895 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7896 code
= TREE_CODE (t
);
7900 if (POLY_INT_CST_P (t
))
7902 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7903 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7906 tclass
= TREE_CODE_CLASS (code
);
7908 if (tclass
== tcc_declaration
)
7910 /* DECL's have a unique ID */
7911 hstate
.add_hwi (DECL_UID (t
));
7913 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7915 /* For comparisons that can be swapped, use the lower
7917 enum tree_code ccode
= swap_tree_comparison (code
);
7920 hstate
.add_object (ccode
);
7921 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7922 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7924 else if (CONVERT_EXPR_CODE_P (code
))
7926 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7928 enum tree_code ccode
= NOP_EXPR
;
7929 hstate
.add_object (ccode
);
7931 /* Don't hash the type, that can lead to having nodes which
7932 compare equal according to operand_equal_p, but which
7933 have different hash codes. Make sure to include signedness
7934 in the hash computation. */
7935 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7936 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7938 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7939 else if (code
== MEM_REF
7940 && (flags
& OEP_ADDRESS_OF
) != 0
7941 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7942 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7943 && integer_zerop (TREE_OPERAND (t
, 1)))
7944 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7946 /* Don't ICE on FE specific trees, or their arguments etc.
7947 during operand_equal_p hash verification. */
7948 else if (!IS_EXPR_CODE_CLASS (tclass
))
7949 gcc_assert (flags
& OEP_HASH_CHECK
);
7952 unsigned int sflags
= flags
;
7954 hstate
.add_object (code
);
7959 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7960 flags
|= OEP_ADDRESS_OF
;
7966 case TARGET_MEM_REF
:
7967 flags
&= ~OEP_ADDRESS_OF
;
7972 case ARRAY_RANGE_REF
:
7975 sflags
&= ~OEP_ADDRESS_OF
;
7979 flags
&= ~OEP_ADDRESS_OF
;
7982 case WIDEN_MULT_PLUS_EXPR
:
7983 case WIDEN_MULT_MINUS_EXPR
:
7985 /* The multiplication operands are commutative. */
7986 inchash::hash one
, two
;
7987 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7988 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7989 hstate
.add_commutative (one
, two
);
7990 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7995 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7996 hstate
.add_int (CALL_EXPR_IFN (t
));
8000 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
8001 Usually different TARGET_EXPRs just should use
8002 different temporaries in their slots. */
8003 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
8010 /* Don't hash the type, that can lead to having nodes which
8011 compare equal according to operand_equal_p, but which
8012 have different hash codes. */
8013 if (code
== NON_LVALUE_EXPR
)
8015 /* Make sure to include signness in the hash computation. */
8016 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
8017 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
8020 else if (commutative_tree_code (code
))
8022 /* It's a commutative expression. We want to hash it the same
8023 however it appears. We do this by first hashing both operands
8024 and then rehashing based on the order of their independent
8026 inchash::hash one
, two
;
8027 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
8028 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
8029 hstate
.add_commutative (one
, two
);
8032 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
8033 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
8034 i
== 0 ? flags
: sflags
);
8042 /* Constructors for pointer, array and function types.
8043 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8044 constructed by language-dependent code, not here.) */
8046 /* Construct, lay out and return the type of pointers to TO_TYPE with
8047 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8048 reference all of memory. If such a type has already been
8049 constructed, reuse it. */
8052 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8056 bool could_alias
= can_alias_all
;
8058 if (to_type
== error_mark_node
)
8059 return error_mark_node
;
8061 /* If the pointed-to type has the may_alias attribute set, force
8062 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8063 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8064 can_alias_all
= true;
8066 /* In some cases, languages will have things that aren't a POINTER_TYPE
8067 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8068 In that case, return that type without regard to the rest of our
8071 ??? This is a kludge, but consistent with the way this function has
8072 always operated and there doesn't seem to be a good way to avoid this
8074 if (TYPE_POINTER_TO (to_type
) != 0
8075 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8076 return TYPE_POINTER_TO (to_type
);
8078 /* First, if we already have a type for pointers to TO_TYPE and it's
8079 the proper mode, use it. */
8080 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8081 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8084 t
= make_node (POINTER_TYPE
);
8086 TREE_TYPE (t
) = to_type
;
8087 SET_TYPE_MODE (t
, mode
);
8088 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8089 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8090 TYPE_POINTER_TO (to_type
) = t
;
8092 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8093 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8094 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8095 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8097 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8100 /* Lay out the type. This function has many callers that are concerned
8101 with expression-construction, and this simplifies them all. */
8107 /* By default build pointers in ptr_mode. */
8110 build_pointer_type (tree to_type
)
8112 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8113 : TYPE_ADDR_SPACE (to_type
);
8114 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8115 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8118 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8121 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8125 bool could_alias
= can_alias_all
;
8127 if (to_type
== error_mark_node
)
8128 return error_mark_node
;
8130 /* If the pointed-to type has the may_alias attribute set, force
8131 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8132 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8133 can_alias_all
= true;
8135 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8136 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8137 In that case, return that type without regard to the rest of our
8140 ??? This is a kludge, but consistent with the way this function has
8141 always operated and there doesn't seem to be a good way to avoid this
8143 if (TYPE_REFERENCE_TO (to_type
) != 0
8144 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8145 return TYPE_REFERENCE_TO (to_type
);
8147 /* First, if we already have a type for pointers to TO_TYPE and it's
8148 the proper mode, use it. */
8149 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8150 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8153 t
= make_node (REFERENCE_TYPE
);
8155 TREE_TYPE (t
) = to_type
;
8156 SET_TYPE_MODE (t
, mode
);
8157 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8158 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8159 TYPE_REFERENCE_TO (to_type
) = t
;
8161 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8162 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8163 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8164 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8166 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8175 /* Build the node for the type of references-to-TO_TYPE by default
8179 build_reference_type (tree to_type
)
8181 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8182 : TYPE_ADDR_SPACE (to_type
);
8183 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8184 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8187 #define MAX_INT_CACHED_PREC \
8188 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8189 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8191 /* Builds a signed or unsigned integer type of precision PRECISION.
8192 Used for C bitfields whose precision does not match that of
8193 built-in target types. */
8195 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8201 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8203 if (precision
<= MAX_INT_CACHED_PREC
)
8205 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8210 itype
= make_node (INTEGER_TYPE
);
8211 TYPE_PRECISION (itype
) = precision
;
8214 fixup_unsigned_type (itype
);
8216 fixup_signed_type (itype
);
8218 inchash::hash hstate
;
8219 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8220 ret
= type_hash_canon (hstate
.end (), itype
);
8221 if (precision
<= MAX_INT_CACHED_PREC
)
8222 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8227 #define MAX_BOOL_CACHED_PREC \
8228 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8229 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8231 /* Builds a boolean type of precision PRECISION.
8232 Used for boolean vectors to choose proper vector element size. */
8234 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8238 if (precision
<= MAX_BOOL_CACHED_PREC
)
8240 type
= nonstandard_boolean_type_cache
[precision
];
8245 type
= make_node (BOOLEAN_TYPE
);
8246 TYPE_PRECISION (type
) = precision
;
8247 fixup_signed_type (type
);
8249 if (precision
<= MAX_INT_CACHED_PREC
)
8250 nonstandard_boolean_type_cache
[precision
] = type
;
8255 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8256 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8257 is true, reuse such a type that has already been constructed. */
8260 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8262 tree itype
= make_node (INTEGER_TYPE
);
8264 TREE_TYPE (itype
) = type
;
8266 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8267 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8269 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8270 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8271 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8272 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8273 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8274 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8275 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8280 if ((TYPE_MIN_VALUE (itype
)
8281 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8282 || (TYPE_MAX_VALUE (itype
)
8283 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8285 /* Since we cannot reliably merge this type, we need to compare it using
8286 structural equality checks. */
8287 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8291 hashval_t hash
= type_hash_canon_hash (itype
);
8292 itype
= type_hash_canon (hash
, itype
);
8297 /* Wrapper around build_range_type_1 with SHARED set to true. */
8300 build_range_type (tree type
, tree lowval
, tree highval
)
8302 return build_range_type_1 (type
, lowval
, highval
, true);
8305 /* Wrapper around build_range_type_1 with SHARED set to false. */
8308 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8310 return build_range_type_1 (type
, lowval
, highval
, false);
8313 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8314 MAXVAL should be the maximum value in the domain
8315 (one less than the length of the array).
8317 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8318 We don't enforce this limit, that is up to caller (e.g. language front end).
8319 The limit exists because the result is a signed type and we don't handle
8320 sizes that use more than one HOST_WIDE_INT. */
8323 build_index_type (tree maxval
)
8325 return build_range_type (sizetype
, size_zero_node
, maxval
);
8328 /* Return true if the debug information for TYPE, a subtype, should be emitted
8329 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8330 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8331 debug info and doesn't reflect the source code. */
8334 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8336 tree base_type
= TREE_TYPE (type
), low
, high
;
8338 /* Subrange types have a base type which is an integral type. */
8339 if (!INTEGRAL_TYPE_P (base_type
))
8342 /* Get the real bounds of the subtype. */
8343 if (lang_hooks
.types
.get_subrange_bounds
)
8344 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8347 low
= TYPE_MIN_VALUE (type
);
8348 high
= TYPE_MAX_VALUE (type
);
8351 /* If the type and its base type have the same representation and the same
8352 name, then the type is not a subrange but a copy of the base type. */
8353 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8354 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8355 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8356 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8357 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8358 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8368 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8369 and number of elements specified by the range of values of INDEX_TYPE.
8370 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8371 If SHARED is true, reuse such a type that has already been constructed. */
8374 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8379 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8381 error ("arrays of functions are not meaningful");
8382 elt_type
= integer_type_node
;
8385 t
= make_node (ARRAY_TYPE
);
8386 TREE_TYPE (t
) = elt_type
;
8387 TYPE_DOMAIN (t
) = index_type
;
8388 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8389 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8392 /* If the element type is incomplete at this point we get marked for
8393 structural equality. Do not record these types in the canonical
8395 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8400 hashval_t hash
= type_hash_canon_hash (t
);
8401 t
= type_hash_canon (hash
, t
);
8404 if (TYPE_CANONICAL (t
) == t
)
8406 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8407 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8409 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8410 else if (TYPE_CANONICAL (elt_type
) != elt_type
8411 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8413 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8415 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8416 typeless_storage
, shared
);
8422 /* Wrapper around build_array_type_1 with SHARED set to true. */
8425 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8427 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8430 /* Wrapper around build_array_type_1 with SHARED set to false. */
8433 build_nonshared_array_type (tree elt_type
, tree index_type
)
8435 return build_array_type_1 (elt_type
, index_type
, false, false);
8438 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8442 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8444 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8447 /* Recursively examines the array elements of TYPE, until a non-array
8448 element type is found. */
8451 strip_array_types (tree type
)
8453 while (TREE_CODE (type
) == ARRAY_TYPE
)
8454 type
= TREE_TYPE (type
);
8459 /* Computes the canonical argument types from the argument type list
8462 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8463 on entry to this function, or if any of the ARGTYPES are
8466 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8467 true on entry to this function, or if any of the ARGTYPES are
8470 Returns a canonical argument list, which may be ARGTYPES when the
8471 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8472 true) or would not differ from ARGTYPES. */
8475 maybe_canonicalize_argtypes (tree argtypes
,
8476 bool *any_structural_p
,
8477 bool *any_noncanonical_p
)
8480 bool any_noncanonical_argtypes_p
= false;
8482 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8484 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8485 /* Fail gracefully by stating that the type is structural. */
8486 *any_structural_p
= true;
8487 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8488 *any_structural_p
= true;
8489 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8490 || TREE_PURPOSE (arg
))
8491 /* If the argument has a default argument, we consider it
8492 non-canonical even though the type itself is canonical.
8493 That way, different variants of function and method types
8494 with default arguments will all point to the variant with
8495 no defaults as their canonical type. */
8496 any_noncanonical_argtypes_p
= true;
8499 if (*any_structural_p
)
8502 if (any_noncanonical_argtypes_p
)
8504 /* Build the canonical list of argument types. */
8505 tree canon_argtypes
= NULL_TREE
;
8506 bool is_void
= false;
8508 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8510 if (arg
== void_list_node
)
8513 canon_argtypes
= tree_cons (NULL_TREE
,
8514 TYPE_CANONICAL (TREE_VALUE (arg
)),
8518 canon_argtypes
= nreverse (canon_argtypes
);
8520 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8522 /* There is a non-canonical type. */
8523 *any_noncanonical_p
= true;
8524 return canon_argtypes
;
8527 /* The canonical argument types are the same as ARGTYPES. */
8531 /* Construct, lay out and return
8532 the type of functions returning type VALUE_TYPE
8533 given arguments of types ARG_TYPES.
8534 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8535 are data type nodes for the arguments of the function.
8536 If such a type has already been constructed, reuse it. */
8539 build_function_type (tree value_type
, tree arg_types
)
8542 inchash::hash hstate
;
8543 bool any_structural_p
, any_noncanonical_p
;
8544 tree canon_argtypes
;
8546 gcc_assert (arg_types
!= error_mark_node
);
8548 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8550 error ("function return type cannot be function");
8551 value_type
= integer_type_node
;
8554 /* Make a node of the sort we want. */
8555 t
= make_node (FUNCTION_TYPE
);
8556 TREE_TYPE (t
) = value_type
;
8557 TYPE_ARG_TYPES (t
) = arg_types
;
8559 /* If we already have such a type, use the old one. */
8560 hashval_t hash
= type_hash_canon_hash (t
);
8561 t
= type_hash_canon (hash
, t
);
8563 /* Set up the canonical type. */
8564 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8565 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8566 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8568 &any_noncanonical_p
);
8569 if (any_structural_p
)
8570 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8571 else if (any_noncanonical_p
)
8572 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8575 if (!COMPLETE_TYPE_P (t
))
8580 /* Build a function type. The RETURN_TYPE is the type returned by the
8581 function. If VAARGS is set, no void_type_node is appended to the
8582 list. ARGP must be always be terminated be a NULL_TREE. */
8585 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8589 t
= va_arg (argp
, tree
);
8590 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8591 args
= tree_cons (NULL_TREE
, t
, args
);
8596 if (args
!= NULL_TREE
)
8597 args
= nreverse (args
);
8598 gcc_assert (last
!= void_list_node
);
8600 else if (args
== NULL_TREE
)
8601 args
= void_list_node
;
8605 args
= nreverse (args
);
8606 TREE_CHAIN (last
) = void_list_node
;
8608 args
= build_function_type (return_type
, args
);
8613 /* Build a function type. The RETURN_TYPE is the type returned by the
8614 function. If additional arguments are provided, they are
8615 additional argument types. The list of argument types must always
8616 be terminated by NULL_TREE. */
8619 build_function_type_list (tree return_type
, ...)
8624 va_start (p
, return_type
);
8625 args
= build_function_type_list_1 (false, return_type
, p
);
8630 /* Build a variable argument function type. The RETURN_TYPE is the
8631 type returned by the function. If additional arguments are provided,
8632 they are additional argument types. The list of argument types must
8633 always be terminated by NULL_TREE. */
8636 build_varargs_function_type_list (tree return_type
, ...)
8641 va_start (p
, return_type
);
8642 args
= build_function_type_list_1 (true, return_type
, p
);
8648 /* Build a function type. RETURN_TYPE is the type returned by the
8649 function; VAARGS indicates whether the function takes varargs. The
8650 function takes N named arguments, the types of which are provided in
8654 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8658 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8660 for (i
= n
- 1; i
>= 0; i
--)
8661 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8663 return build_function_type (return_type
, t
);
8666 /* Build a function type. RETURN_TYPE is the type returned by the
8667 function. The function takes N named arguments, the types of which
8668 are provided in ARG_TYPES. */
8671 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8673 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8676 /* Build a variable argument function type. RETURN_TYPE is the type
8677 returned by the function. The function takes N named arguments, the
8678 types of which are provided in ARG_TYPES. */
8681 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8683 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8686 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8687 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8688 for the method. An implicit additional parameter (of type
8689 pointer-to-BASETYPE) is added to the ARGTYPES. */
8692 build_method_type_directly (tree basetype
,
8698 bool any_structural_p
, any_noncanonical_p
;
8699 tree canon_argtypes
;
8701 /* Make a node of the sort we want. */
8702 t
= make_node (METHOD_TYPE
);
8704 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8705 TREE_TYPE (t
) = rettype
;
8706 ptype
= build_pointer_type (basetype
);
8708 /* The actual arglist for this function includes a "hidden" argument
8709 which is "this". Put it into the list of argument types. */
8710 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8711 TYPE_ARG_TYPES (t
) = argtypes
;
8713 /* If we already have such a type, use the old one. */
8714 hashval_t hash
= type_hash_canon_hash (t
);
8715 t
= type_hash_canon (hash
, t
);
8717 /* Set up the canonical type. */
8719 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8720 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8722 = (TYPE_CANONICAL (basetype
) != basetype
8723 || TYPE_CANONICAL (rettype
) != rettype
);
8724 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8726 &any_noncanonical_p
);
8727 if (any_structural_p
)
8728 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8729 else if (any_noncanonical_p
)
8731 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8732 TYPE_CANONICAL (rettype
),
8734 if (!COMPLETE_TYPE_P (t
))
8740 /* Construct, lay out and return the type of methods belonging to class
8741 BASETYPE and whose arguments and values are described by TYPE.
8742 If that type exists already, reuse it.
8743 TYPE must be a FUNCTION_TYPE node. */
8746 build_method_type (tree basetype
, tree type
)
8748 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8750 return build_method_type_directly (basetype
,
8752 TYPE_ARG_TYPES (type
));
8755 /* Construct, lay out and return the type of offsets to a value
8756 of type TYPE, within an object of type BASETYPE.
8757 If a suitable offset type exists already, reuse it. */
8760 build_offset_type (tree basetype
, tree type
)
8764 /* Make a node of the sort we want. */
8765 t
= make_node (OFFSET_TYPE
);
8767 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8768 TREE_TYPE (t
) = type
;
8770 /* If we already have such a type, use the old one. */
8771 hashval_t hash
= type_hash_canon_hash (t
);
8772 t
= type_hash_canon (hash
, t
);
8774 if (!COMPLETE_TYPE_P (t
))
8777 if (TYPE_CANONICAL (t
) == t
)
8779 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8780 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8781 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8782 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8783 || TYPE_CANONICAL (type
) != type
)
8785 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8786 TYPE_CANONICAL (type
));
8792 /* Create a complex type whose components are COMPONENT_TYPE.
8794 If NAMED is true, the type is given a TYPE_NAME. We do not always
8795 do so because this creates a DECL node and thus make the DECL_UIDs
8796 dependent on the type canonicalization hashtable, which is GC-ed,
8797 so the DECL_UIDs would not be stable wrt garbage collection. */
8800 build_complex_type (tree component_type
, bool named
)
8802 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8803 || SCALAR_FLOAT_TYPE_P (component_type
)
8804 || FIXED_POINT_TYPE_P (component_type
));
8806 /* Make a node of the sort we want. */
8807 tree probe
= make_node (COMPLEX_TYPE
);
8809 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8811 /* If we already have such a type, use the old one. */
8812 hashval_t hash
= type_hash_canon_hash (probe
);
8813 tree t
= type_hash_canon (hash
, probe
);
8817 /* We created a new type. The hash insertion will have laid
8818 out the type. We need to check the canonicalization and
8819 maybe set the name. */
8820 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8822 && TYPE_CANONICAL (t
) == t
);
8824 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8825 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8826 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8828 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8830 /* We need to create a name, since complex is a fundamental type. */
8833 const char *name
= NULL
;
8835 if (TREE_TYPE (t
) == char_type_node
)
8836 name
= "complex char";
8837 else if (TREE_TYPE (t
) == signed_char_type_node
)
8838 name
= "complex signed char";
8839 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8840 name
= "complex unsigned char";
8841 else if (TREE_TYPE (t
) == short_integer_type_node
)
8842 name
= "complex short int";
8843 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8844 name
= "complex short unsigned int";
8845 else if (TREE_TYPE (t
) == integer_type_node
)
8846 name
= "complex int";
8847 else if (TREE_TYPE (t
) == unsigned_type_node
)
8848 name
= "complex unsigned int";
8849 else if (TREE_TYPE (t
) == long_integer_type_node
)
8850 name
= "complex long int";
8851 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8852 name
= "complex long unsigned int";
8853 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8854 name
= "complex long long int";
8855 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8856 name
= "complex long long unsigned int";
8859 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8860 get_identifier (name
), t
);
8864 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8867 /* If TYPE is a real or complex floating-point type and the target
8868 does not directly support arithmetic on TYPE then return the wider
8869 type to be used for arithmetic on TYPE. Otherwise, return
8873 excess_precision_type (tree type
)
8875 /* The target can give two different responses to the question of
8876 which excess precision mode it would like depending on whether we
8877 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8879 enum excess_precision_type requested_type
8880 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8881 ? EXCESS_PRECISION_TYPE_FAST
8882 : EXCESS_PRECISION_TYPE_STANDARD
);
8884 enum flt_eval_method target_flt_eval_method
8885 = targetm
.c
.excess_precision (requested_type
);
8887 /* The target should not ask for unpredictable float evaluation (though
8888 it might advertise that implicitly the evaluation is unpredictable,
8889 but we don't care about that here, it will have been reported
8890 elsewhere). If it does ask for unpredictable evaluation, we have
8891 nothing to do here. */
8892 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8894 /* Nothing to do. The target has asked for all types we know about
8895 to be computed with their native precision and range. */
8896 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8899 /* The target will promote this type in a target-dependent way, so excess
8900 precision ought to leave it alone. */
8901 if (targetm
.promoted_type (type
) != NULL_TREE
)
8904 machine_mode float16_type_mode
= (float16_type_node
8905 ? TYPE_MODE (float16_type_node
)
8907 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8908 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8910 switch (TREE_CODE (type
))
8914 machine_mode type_mode
= TYPE_MODE (type
);
8915 switch (target_flt_eval_method
)
8917 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8918 if (type_mode
== float16_type_mode
)
8919 return float_type_node
;
8921 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8922 if (type_mode
== float16_type_mode
8923 || type_mode
== float_type_mode
)
8924 return double_type_node
;
8926 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8927 if (type_mode
== float16_type_mode
8928 || type_mode
== float_type_mode
8929 || type_mode
== double_type_mode
)
8930 return long_double_type_node
;
8939 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8941 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8942 switch (target_flt_eval_method
)
8944 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8945 if (type_mode
== float16_type_mode
)
8946 return complex_float_type_node
;
8948 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8949 if (type_mode
== float16_type_mode
8950 || type_mode
== float_type_mode
)
8951 return complex_double_type_node
;
8953 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8954 if (type_mode
== float16_type_mode
8955 || type_mode
== float_type_mode
8956 || type_mode
== double_type_mode
)
8957 return complex_long_double_type_node
;
8971 /* Return OP, stripped of any conversions to wider types as much as is safe.
8972 Converting the value back to OP's type makes a value equivalent to OP.
8974 If FOR_TYPE is nonzero, we return a value which, if converted to
8975 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8977 OP must have integer, real or enumeral type. Pointers are not allowed!
8979 There are some cases where the obvious value we could return
8980 would regenerate to OP if converted to OP's type,
8981 but would not extend like OP to wider types.
8982 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8983 For example, if OP is (unsigned short)(signed char)-1,
8984 we avoid returning (signed char)-1 if FOR_TYPE is int,
8985 even though extending that to an unsigned short would regenerate OP,
8986 since the result of extending (signed char)-1 to (int)
8987 is different from (int) OP. */
8990 get_unwidened (tree op
, tree for_type
)
8992 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8993 tree type
= TREE_TYPE (op
);
8995 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8997 = (for_type
!= 0 && for_type
!= type
8998 && final_prec
> TYPE_PRECISION (type
)
8999 && TYPE_UNSIGNED (type
));
9002 while (CONVERT_EXPR_P (op
))
9006 /* TYPE_PRECISION on vector types has different meaning
9007 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
9008 so avoid them here. */
9009 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
9012 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
9013 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
9015 /* Truncations are many-one so cannot be removed.
9016 Unless we are later going to truncate down even farther. */
9018 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
9021 /* See what's inside this conversion. If we decide to strip it,
9023 op
= TREE_OPERAND (op
, 0);
9025 /* If we have not stripped any zero-extensions (uns is 0),
9026 we can strip any kind of extension.
9027 If we have previously stripped a zero-extension,
9028 only zero-extensions can safely be stripped.
9029 Any extension can be stripped if the bits it would produce
9030 are all going to be discarded later by truncating to FOR_TYPE. */
9034 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
9036 /* TYPE_UNSIGNED says whether this is a zero-extension.
9037 Let's avoid computing it if it does not affect WIN
9038 and if UNS will not be needed again. */
9040 || CONVERT_EXPR_P (op
))
9041 && TYPE_UNSIGNED (TREE_TYPE (op
)))
9049 /* If we finally reach a constant see if it fits in sth smaller and
9050 in that case convert it. */
9051 if (TREE_CODE (win
) == INTEGER_CST
)
9053 tree wtype
= TREE_TYPE (win
);
9054 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
9056 prec
= MAX (prec
, final_prec
);
9057 if (prec
< TYPE_PRECISION (wtype
))
9059 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
9060 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
9061 win
= fold_convert (t
, win
);
9068 /* Return OP or a simpler expression for a narrower value
9069 which can be sign-extended or zero-extended to give back OP.
9070 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
9071 or 0 if the value should be sign-extended. */
9074 get_narrower (tree op
, int *unsignedp_ptr
)
9079 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
9081 while (TREE_CODE (op
) == NOP_EXPR
)
9084 = (TYPE_PRECISION (TREE_TYPE (op
))
9085 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9087 /* Truncations are many-one so cannot be removed. */
9091 /* See what's inside this conversion. If we decide to strip it,
9096 op
= TREE_OPERAND (op
, 0);
9097 /* An extension: the outermost one can be stripped,
9098 but remember whether it is zero or sign extension. */
9100 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9101 /* Otherwise, if a sign extension has been stripped,
9102 only sign extensions can now be stripped;
9103 if a zero extension has been stripped, only zero-extensions. */
9104 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9108 else /* bitschange == 0 */
9110 /* A change in nominal type can always be stripped, but we must
9111 preserve the unsignedness. */
9113 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9115 op
= TREE_OPERAND (op
, 0);
9116 /* Keep trying to narrow, but don't assign op to win if it
9117 would turn an integral type into something else. */
9118 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9125 if (TREE_CODE (op
) == COMPONENT_REF
9126 /* Since type_for_size always gives an integer type. */
9127 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9128 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9129 /* Ensure field is laid out already. */
9130 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9131 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9133 unsigned HOST_WIDE_INT innerprec
9134 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9135 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9136 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9137 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9139 /* We can get this structure field in a narrower type that fits it,
9140 but the resulting extension to its nominal type (a fullword type)
9141 must satisfy the same conditions as for other extensions.
9143 Do this only for fields that are aligned (not bit-fields),
9144 because when bit-field insns will be used there is no
9145 advantage in doing this. */
9147 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9148 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9149 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9153 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9154 win
= fold_convert (type
, op
);
9158 *unsignedp_ptr
= uns
;
9162 /* Return true if integer constant C has a value that is permissible
9163 for TYPE, an integral type. */
9166 int_fits_type_p (const_tree c
, const_tree type
)
9168 tree type_low_bound
, type_high_bound
;
9169 bool ok_for_low_bound
, ok_for_high_bound
;
9170 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9172 /* Non-standard boolean types can have arbitrary precision but various
9173 transformations assume that they can only take values 0 and +/-1. */
9174 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9175 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
9178 type_low_bound
= TYPE_MIN_VALUE (type
);
9179 type_high_bound
= TYPE_MAX_VALUE (type
);
9181 /* If at least one bound of the type is a constant integer, we can check
9182 ourselves and maybe make a decision. If no such decision is possible, but
9183 this type is a subtype, try checking against that. Otherwise, use
9184 fits_to_tree_p, which checks against the precision.
9186 Compute the status for each possibly constant bound, and return if we see
9187 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9188 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9189 for "constant known to fit". */
9191 /* Check if c >= type_low_bound. */
9192 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9194 if (tree_int_cst_lt (c
, type_low_bound
))
9196 ok_for_low_bound
= true;
9199 ok_for_low_bound
= false;
9201 /* Check if c <= type_high_bound. */
9202 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9204 if (tree_int_cst_lt (type_high_bound
, c
))
9206 ok_for_high_bound
= true;
9209 ok_for_high_bound
= false;
9211 /* If the constant fits both bounds, the result is known. */
9212 if (ok_for_low_bound
&& ok_for_high_bound
)
9215 /* Perform some generic filtering which may allow making a decision
9216 even if the bounds are not constant. First, negative integers
9217 never fit in unsigned types, */
9218 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9221 /* Second, narrower types always fit in wider ones. */
9222 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9225 /* Third, unsigned integers with top bit set never fit signed types. */
9226 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9228 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9229 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9231 /* When a tree_cst is converted to a wide-int, the precision
9232 is taken from the type. However, if the precision of the
9233 mode underneath the type is smaller than that, it is
9234 possible that the value will not fit. The test below
9235 fails if any bit is set between the sign bit of the
9236 underlying mode and the top bit of the type. */
9237 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9240 else if (wi::neg_p (wi::to_wide (c
)))
9244 /* If we haven't been able to decide at this point, there nothing more we
9245 can check ourselves here. Look at the base type if we have one and it
9246 has the same precision. */
9247 if (TREE_CODE (type
) == INTEGER_TYPE
9248 && TREE_TYPE (type
) != 0
9249 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9251 type
= TREE_TYPE (type
);
9255 /* Or to fits_to_tree_p, if nothing else. */
9256 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9259 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9260 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9261 represented (assuming two's-complement arithmetic) within the bit
9262 precision of the type are returned instead. */
9265 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9267 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9268 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9269 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9272 if (TYPE_UNSIGNED (type
))
9273 mpz_set_ui (min
, 0);
9276 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9277 wi::to_mpz (mn
, min
, SIGNED
);
9281 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9282 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9283 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9286 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9287 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9291 /* Return true if VAR is an automatic variable. */
9294 auto_var_p (const_tree var
)
9296 return ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9297 || TREE_CODE (var
) == PARM_DECL
)
9298 && ! TREE_STATIC (var
))
9299 || TREE_CODE (var
) == RESULT_DECL
);
9302 /* Return true if VAR is an automatic variable defined in function FN. */
9305 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9307 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9308 && (auto_var_p (var
)
9309 || TREE_CODE (var
) == LABEL_DECL
));
9312 /* Subprogram of following function. Called by walk_tree.
9314 Return *TP if it is an automatic variable or parameter of the
9315 function passed in as DATA. */
9318 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9320 tree fn
= (tree
) data
;
9325 else if (DECL_P (*tp
)
9326 && auto_var_in_fn_p (*tp
, fn
))
9332 /* Returns true if T is, contains, or refers to a type with variable
9333 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9334 arguments, but not the return type. If FN is nonzero, only return
9335 true if a modifier of the type or position of FN is a variable or
9336 parameter inside FN.
9338 This concept is more general than that of C99 'variably modified types':
9339 in C99, a struct type is never variably modified because a VLA may not
9340 appear as a structure member. However, in GNU C code like:
9342 struct S { int i[f()]; };
9344 is valid, and other languages may define similar constructs. */
9347 variably_modified_type_p (tree type
, tree fn
)
9351 /* Test if T is either variable (if FN is zero) or an expression containing
9352 a variable in FN. If TYPE isn't gimplified, return true also if
9353 gimplify_one_sizepos would gimplify the expression into a local
9355 #define RETURN_TRUE_IF_VAR(T) \
9356 do { tree _t = (T); \
9357 if (_t != NULL_TREE \
9358 && _t != error_mark_node \
9359 && !CONSTANT_CLASS_P (_t) \
9360 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9362 || (!TYPE_SIZES_GIMPLIFIED (type) \
9363 && (TREE_CODE (_t) != VAR_DECL \
9364 && !CONTAINS_PLACEHOLDER_P (_t))) \
9365 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9366 return true; } while (0)
9368 if (type
== error_mark_node
)
9371 /* If TYPE itself has variable size, it is variably modified. */
9372 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9373 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9375 switch (TREE_CODE (type
))
9378 case REFERENCE_TYPE
:
9380 /* Ada can have pointer types refering to themselves indirectly. */
9381 if (TREE_VISITED (type
))
9383 TREE_VISITED (type
) = true;
9384 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9386 TREE_VISITED (type
) = false;
9389 TREE_VISITED (type
) = false;
9394 /* If TYPE is a function type, it is variably modified if the
9395 return type is variably modified. */
9396 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9402 case FIXED_POINT_TYPE
:
9405 /* Scalar types are variably modified if their end points
9407 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9408 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9413 case QUAL_UNION_TYPE
:
9414 /* We can't see if any of the fields are variably-modified by the
9415 definition we normally use, since that would produce infinite
9416 recursion via pointers. */
9417 /* This is variably modified if some field's type is. */
9418 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9419 if (TREE_CODE (t
) == FIELD_DECL
)
9421 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9422 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9423 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9425 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9426 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9431 /* Do not call ourselves to avoid infinite recursion. This is
9432 variably modified if the element type is. */
9433 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9434 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9441 /* The current language may have other cases to check, but in general,
9442 all other types are not variably modified. */
9443 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9445 #undef RETURN_TRUE_IF_VAR
9448 /* Given a DECL or TYPE, return the scope in which it was declared, or
9449 NULL_TREE if there is no containing scope. */
9452 get_containing_scope (const_tree t
)
9454 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9457 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9460 get_ultimate_context (const_tree decl
)
9462 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9464 if (TREE_CODE (decl
) == BLOCK
)
9465 decl
= BLOCK_SUPERCONTEXT (decl
);
9467 decl
= get_containing_scope (decl
);
9472 /* Return the innermost context enclosing DECL that is
9473 a FUNCTION_DECL, or zero if none. */
9476 decl_function_context (const_tree decl
)
9480 if (TREE_CODE (decl
) == ERROR_MARK
)
9483 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9484 where we look up the function at runtime. Such functions always take
9485 a first argument of type 'pointer to real context'.
9487 C++ should really be fixed to use DECL_CONTEXT for the real context,
9488 and use something else for the "virtual context". */
9489 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9492 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9494 context
= DECL_CONTEXT (decl
);
9496 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9498 if (TREE_CODE (context
) == BLOCK
)
9499 context
= BLOCK_SUPERCONTEXT (context
);
9501 context
= get_containing_scope (context
);
9507 /* Return the innermost context enclosing DECL that is
9508 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9509 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9512 decl_type_context (const_tree decl
)
9514 tree context
= DECL_CONTEXT (decl
);
9517 switch (TREE_CODE (context
))
9519 case NAMESPACE_DECL
:
9520 case TRANSLATION_UNIT_DECL
:
9525 case QUAL_UNION_TYPE
:
9530 context
= DECL_CONTEXT (context
);
9534 context
= BLOCK_SUPERCONTEXT (context
);
9544 /* CALL is a CALL_EXPR. Return the declaration for the function
9545 called, or NULL_TREE if the called function cannot be
9549 get_callee_fndecl (const_tree call
)
9553 if (call
== error_mark_node
)
9554 return error_mark_node
;
9556 /* It's invalid to call this function with anything but a
9558 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9560 /* The first operand to the CALL is the address of the function
9562 addr
= CALL_EXPR_FN (call
);
9564 /* If there is no function, return early. */
9565 if (addr
== NULL_TREE
)
9570 /* If this is a readonly function pointer, extract its initial value. */
9571 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9572 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9573 && DECL_INITIAL (addr
))
9574 addr
= DECL_INITIAL (addr
);
9576 /* If the address is just `&f' for some function `f', then we know
9577 that `f' is being called. */
9578 if (TREE_CODE (addr
) == ADDR_EXPR
9579 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9580 return TREE_OPERAND (addr
, 0);
9582 /* We couldn't figure out what was being called. */
9586 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9587 return the associated function code, otherwise return CFN_LAST. */
9590 get_call_combined_fn (const_tree call
)
9592 /* It's invalid to call this function with anything but a CALL_EXPR. */
9593 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9595 if (!CALL_EXPR_FN (call
))
9596 return as_combined_fn (CALL_EXPR_IFN (call
));
9598 tree fndecl
= get_callee_fndecl (call
);
9599 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9600 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9605 /* Comparator of indices based on tree_node_counts. */
9608 tree_nodes_cmp (const void *p1
, const void *p2
)
9610 const unsigned *n1
= (const unsigned *)p1
;
9611 const unsigned *n2
= (const unsigned *)p2
;
9613 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9616 /* Comparator of indices based on tree_code_counts. */
9619 tree_codes_cmp (const void *p1
, const void *p2
)
9621 const unsigned *n1
= (const unsigned *)p1
;
9622 const unsigned *n2
= (const unsigned *)p2
;
9624 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9627 #define TREE_MEM_USAGE_SPACES 40
9629 /* Print debugging information about tree nodes generated during the compile,
9630 and any language-specific information. */
9633 dump_tree_statistics (void)
9635 if (GATHER_STATISTICS
)
9637 uint64_t total_nodes
, total_bytes
;
9638 fprintf (stderr
, "\nKind Nodes Bytes\n");
9639 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9640 total_nodes
= total_bytes
= 0;
9643 auto_vec
<unsigned> indices (all_kinds
);
9644 for (unsigned i
= 0; i
< all_kinds
; i
++)
9645 indices
.quick_push (i
);
9646 indices
.qsort (tree_nodes_cmp
);
9648 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9650 unsigned j
= indices
[i
];
9651 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9652 tree_node_kind_names
[i
], SIZE_AMOUNT (tree_node_counts
[j
]),
9653 SIZE_AMOUNT (tree_node_sizes
[j
]));
9654 total_nodes
+= tree_node_counts
[j
];
9655 total_bytes
+= tree_node_sizes
[j
];
9657 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9658 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9659 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9660 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9664 fprintf (stderr
, "Code Nodes\n");
9665 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9667 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9668 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9669 indices
.quick_push (i
);
9670 indices
.qsort (tree_codes_cmp
);
9672 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9674 unsigned j
= indices
[i
];
9675 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9676 get_tree_code_name ((enum tree_code
) j
),
9677 SIZE_AMOUNT (tree_code_counts
[j
]));
9679 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9680 fprintf (stderr
, "\n");
9681 ssanames_print_statistics ();
9682 fprintf (stderr
, "\n");
9683 phinodes_print_statistics ();
9684 fprintf (stderr
, "\n");
9688 fprintf (stderr
, "(No per-node statistics)\n");
9690 print_type_hash_statistics ();
9691 print_debug_expr_statistics ();
9692 print_value_expr_statistics ();
9693 lang_hooks
.print_statistics ();
9696 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9698 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9701 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9703 /* This relies on the raw feedback's top 4 bits being zero. */
9704 #define FEEDBACK(X) ((X) * 0x04c11db7)
9705 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9706 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9707 static const unsigned syndromes
[16] =
9709 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9710 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9711 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9712 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9717 value
<<= (32 - bytes
* 8);
9718 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9720 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9722 chksum
= (chksum
<< 4) ^ feedback
;
9728 /* Generate a crc32 of a string. */
9731 crc32_string (unsigned chksum
, const char *string
)
9734 chksum
= crc32_byte (chksum
, *string
);
9739 /* P is a string that will be used in a symbol. Mask out any characters
9740 that are not valid in that context. */
9743 clean_symbol_name (char *p
)
9747 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9750 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9757 static GTY(()) unsigned anon_cnt
= 0; /* Saved for PCH. */
9759 /* Create a unique anonymous identifier. The identifier is still a
9760 valid assembly label. */
9766 #if !defined (NO_DOT_IN_LABEL)
9768 #elif !defined (NO_DOLLAR_IN_LABEL)
9776 int len
= snprintf (buf
, sizeof (buf
), fmt
, anon_cnt
++);
9777 gcc_checking_assert (len
< int (sizeof (buf
)));
9779 tree id
= get_identifier_with_length (buf
, len
);
9780 IDENTIFIER_ANON_P (id
) = true;
9785 /* Generate a name for a special-purpose function.
9786 The generated name may need to be unique across the whole link.
9787 Changes to this function may also require corresponding changes to
9788 xstrdup_mask_random.
9789 TYPE is some string to identify the purpose of this function to the
9790 linker or collect2; it must start with an uppercase letter,
9792 I - for constructors
9794 N - for C++ anonymous namespaces
9795 F - for DWARF unwind frame information. */
9798 get_file_function_name (const char *type
)
9804 /* If we already have a name we know to be unique, just use that. */
9805 if (first_global_object_name
)
9806 p
= q
= ASTRDUP (first_global_object_name
);
9807 /* If the target is handling the constructors/destructors, they
9808 will be local to this file and the name is only necessary for
9810 We also assign sub_I and sub_D sufixes to constructors called from
9811 the global static constructors. These are always local. */
9812 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9813 || (strncmp (type
, "sub_", 4) == 0
9814 && (type
[4] == 'I' || type
[4] == 'D')))
9816 const char *file
= main_input_filename
;
9818 file
= LOCATION_FILE (input_location
);
9819 /* Just use the file's basename, because the full pathname
9820 might be quite long. */
9821 p
= q
= ASTRDUP (lbasename (file
));
9825 /* Otherwise, the name must be unique across the entire link.
9826 We don't have anything that we know to be unique to this translation
9827 unit, so use what we do have and throw in some randomness. */
9829 const char *name
= weak_global_object_name
;
9830 const char *file
= main_input_filename
;
9835 file
= LOCATION_FILE (input_location
);
9837 len
= strlen (file
);
9838 q
= (char *) alloca (9 + 19 + len
+ 1);
9839 memcpy (q
, file
, len
+ 1);
9841 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9842 crc32_string (0, name
), get_random_seed (false));
9847 clean_symbol_name (q
);
9848 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9851 /* Set up the name of the file-level functions we may need.
9852 Use a global object (which is already required to be unique over
9853 the program) rather than the file name (which imposes extra
9855 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9857 return get_identifier (buf
);
9860 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9862 /* Complain that the tree code of NODE does not match the expected 0
9863 terminated list of trailing codes. The trailing code list can be
9864 empty, for a more vague error message. FILE, LINE, and FUNCTION
9865 are of the caller. */
9868 tree_check_failed (const_tree node
, const char *file
,
9869 int line
, const char *function
, ...)
9873 unsigned length
= 0;
9874 enum tree_code code
;
9876 va_start (args
, function
);
9877 while ((code
= (enum tree_code
) va_arg (args
, int)))
9878 length
+= 4 + strlen (get_tree_code_name (code
));
9883 va_start (args
, function
);
9884 length
+= strlen ("expected ");
9885 buffer
= tmp
= (char *) alloca (length
);
9887 while ((code
= (enum tree_code
) va_arg (args
, int)))
9889 const char *prefix
= length
? " or " : "expected ";
9891 strcpy (tmp
+ length
, prefix
);
9892 length
+= strlen (prefix
);
9893 strcpy (tmp
+ length
, get_tree_code_name (code
));
9894 length
+= strlen (get_tree_code_name (code
));
9899 buffer
= "unexpected node";
9901 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9902 buffer
, get_tree_code_name (TREE_CODE (node
)),
9903 function
, trim_filename (file
), line
);
9906 /* Complain that the tree code of NODE does match the expected 0
9907 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9911 tree_not_check_failed (const_tree node
, const char *file
,
9912 int line
, const char *function
, ...)
9916 unsigned length
= 0;
9917 enum tree_code code
;
9919 va_start (args
, function
);
9920 while ((code
= (enum tree_code
) va_arg (args
, int)))
9921 length
+= 4 + strlen (get_tree_code_name (code
));
9923 va_start (args
, function
);
9924 buffer
= (char *) alloca (length
);
9926 while ((code
= (enum tree_code
) va_arg (args
, int)))
9930 strcpy (buffer
+ length
, " or ");
9933 strcpy (buffer
+ length
, get_tree_code_name (code
));
9934 length
+= strlen (get_tree_code_name (code
));
9938 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9939 buffer
, get_tree_code_name (TREE_CODE (node
)),
9940 function
, trim_filename (file
), line
);
9943 /* Similar to tree_check_failed, except that we check for a class of tree
9944 code, given in CL. */
9947 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9948 const char *file
, int line
, const char *function
)
9951 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9952 TREE_CODE_CLASS_STRING (cl
),
9953 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9954 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9957 /* Similar to tree_check_failed, except that instead of specifying a
9958 dozen codes, use the knowledge that they're all sequential. */
9961 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9962 const char *function
, enum tree_code c1
,
9966 unsigned length
= 0;
9969 for (c
= c1
; c
<= c2
; ++c
)
9970 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9972 length
+= strlen ("expected ");
9973 buffer
= (char *) alloca (length
);
9976 for (c
= c1
; c
<= c2
; ++c
)
9978 const char *prefix
= length
? " or " : "expected ";
9980 strcpy (buffer
+ length
, prefix
);
9981 length
+= strlen (prefix
);
9982 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9983 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9986 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9987 buffer
, get_tree_code_name (TREE_CODE (node
)),
9988 function
, trim_filename (file
), line
);
9992 /* Similar to tree_check_failed, except that we check that a tree does
9993 not have the specified code, given in CL. */
9996 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9997 const char *file
, int line
, const char *function
)
10000 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
10001 TREE_CODE_CLASS_STRING (cl
),
10002 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
10003 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
10007 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
10010 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
10011 const char *function
, enum omp_clause_code code
)
10013 internal_error ("tree check: expected %<omp_clause %s%>, have %qs "
10015 omp_clause_code_name
[code
],
10016 get_tree_code_name (TREE_CODE (node
)),
10017 function
, trim_filename (file
), line
);
10021 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
10024 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
10025 const char *function
, enum omp_clause_code c1
,
10026 enum omp_clause_code c2
)
10029 unsigned length
= 0;
10032 for (c
= c1
; c
<= c2
; ++c
)
10033 length
+= 4 + strlen (omp_clause_code_name
[c
]);
10035 length
+= strlen ("expected ");
10036 buffer
= (char *) alloca (length
);
10039 for (c
= c1
; c
<= c2
; ++c
)
10041 const char *prefix
= length
? " or " : "expected ";
10043 strcpy (buffer
+ length
, prefix
);
10044 length
+= strlen (prefix
);
10045 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
10046 length
+= strlen (omp_clause_code_name
[c
]);
10049 internal_error ("tree check: %s, have %s in %s, at %s:%d",
10050 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
10051 function
, trim_filename (file
), line
);
10055 #undef DEFTREESTRUCT
10056 #define DEFTREESTRUCT(VAL, NAME) NAME,
10058 static const char *ts_enum_names
[] = {
10059 #include "treestruct.def"
10061 #undef DEFTREESTRUCT
10063 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
10065 /* Similar to tree_class_check_failed, except that we check for
10066 whether CODE contains the tree structure identified by EN. */
10069 tree_contains_struct_check_failed (const_tree node
,
10070 const enum tree_node_structure_enum en
,
10071 const char *file
, int line
,
10072 const char *function
)
10075 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
10077 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
10081 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10082 (dynamically sized) vector. */
10085 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10086 const char *function
)
10089 ("tree check: accessed elt %d of %<tree_int_cst%> with %d elts in %s, "
10091 idx
+ 1, len
, function
, trim_filename (file
), line
);
10094 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10095 (dynamically sized) vector. */
10098 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10099 const char *function
)
10102 ("tree check: accessed elt %d of %<tree_vec%> with %d elts in %s, at %s:%d",
10103 idx
+ 1, len
, function
, trim_filename (file
), line
);
10106 /* Similar to above, except that the check is for the bounds of the operand
10107 vector of an expression node EXP. */
10110 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10111 int line
, const char *function
)
10113 enum tree_code code
= TREE_CODE (exp
);
10115 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10116 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10117 function
, trim_filename (file
), line
);
10120 /* Similar to above, except that the check is for the number of
10121 operands of an OMP_CLAUSE node. */
10124 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10125 int line
, const char *function
)
10128 ("tree check: accessed operand %d of %<omp_clause %s%> with %d operands "
10129 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10130 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10131 trim_filename (file
), line
);
10133 #endif /* ENABLE_TREE_CHECKING */
10135 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10136 and mapped to the machine mode MODE. Initialize its fields and build
10137 the information necessary for debugging output. */
10140 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
10143 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10145 t
= make_node (VECTOR_TYPE
);
10146 TREE_TYPE (t
) = mv_innertype
;
10147 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10148 SET_TYPE_MODE (t
, mode
);
10150 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10151 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10152 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10153 || mode
!= VOIDmode
)
10154 && !VECTOR_BOOLEAN_TYPE_P (t
))
10156 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10160 hashval_t hash
= type_hash_canon_hash (t
);
10161 t
= type_hash_canon (hash
, t
);
10163 /* We have built a main variant, based on the main variant of the
10164 inner type. Use it to build the variant we return. */
10165 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10166 && TREE_TYPE (t
) != innertype
)
10167 return build_type_attribute_qual_variant (t
,
10168 TYPE_ATTRIBUTES (innertype
),
10169 TYPE_QUALS (innertype
));
10175 make_or_reuse_type (unsigned size
, int unsignedp
)
10179 if (size
== INT_TYPE_SIZE
)
10180 return unsignedp
? unsigned_type_node
: integer_type_node
;
10181 if (size
== CHAR_TYPE_SIZE
)
10182 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10183 if (size
== SHORT_TYPE_SIZE
)
10184 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10185 if (size
== LONG_TYPE_SIZE
)
10186 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10187 if (size
== LONG_LONG_TYPE_SIZE
)
10188 return (unsignedp
? long_long_unsigned_type_node
10189 : long_long_integer_type_node
);
10191 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10192 if (size
== int_n_data
[i
].bitsize
10193 && int_n_enabled_p
[i
])
10194 return (unsignedp
? int_n_trees
[i
].unsigned_type
10195 : int_n_trees
[i
].signed_type
);
10198 return make_unsigned_type (size
);
10200 return make_signed_type (size
);
10203 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10206 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10210 if (size
== SHORT_FRACT_TYPE_SIZE
)
10211 return unsignedp
? sat_unsigned_short_fract_type_node
10212 : sat_short_fract_type_node
;
10213 if (size
== FRACT_TYPE_SIZE
)
10214 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10215 if (size
== LONG_FRACT_TYPE_SIZE
)
10216 return unsignedp
? sat_unsigned_long_fract_type_node
10217 : sat_long_fract_type_node
;
10218 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10219 return unsignedp
? sat_unsigned_long_long_fract_type_node
10220 : sat_long_long_fract_type_node
;
10224 if (size
== SHORT_FRACT_TYPE_SIZE
)
10225 return unsignedp
? unsigned_short_fract_type_node
10226 : short_fract_type_node
;
10227 if (size
== FRACT_TYPE_SIZE
)
10228 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10229 if (size
== LONG_FRACT_TYPE_SIZE
)
10230 return unsignedp
? unsigned_long_fract_type_node
10231 : long_fract_type_node
;
10232 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10233 return unsignedp
? unsigned_long_long_fract_type_node
10234 : long_long_fract_type_node
;
10237 return make_fract_type (size
, unsignedp
, satp
);
10240 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10243 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10247 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10248 return unsignedp
? sat_unsigned_short_accum_type_node
10249 : sat_short_accum_type_node
;
10250 if (size
== ACCUM_TYPE_SIZE
)
10251 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10252 if (size
== LONG_ACCUM_TYPE_SIZE
)
10253 return unsignedp
? sat_unsigned_long_accum_type_node
10254 : sat_long_accum_type_node
;
10255 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10256 return unsignedp
? sat_unsigned_long_long_accum_type_node
10257 : sat_long_long_accum_type_node
;
10261 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10262 return unsignedp
? unsigned_short_accum_type_node
10263 : short_accum_type_node
;
10264 if (size
== ACCUM_TYPE_SIZE
)
10265 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10266 if (size
== LONG_ACCUM_TYPE_SIZE
)
10267 return unsignedp
? unsigned_long_accum_type_node
10268 : long_accum_type_node
;
10269 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10270 return unsignedp
? unsigned_long_long_accum_type_node
10271 : long_long_accum_type_node
;
10274 return make_accum_type (size
, unsignedp
, satp
);
10278 /* Create an atomic variant node for TYPE. This routine is called
10279 during initialization of data types to create the 5 basic atomic
10280 types. The generic build_variant_type function requires these to
10281 already be set up in order to function properly, so cannot be
10282 called from there. If ALIGN is non-zero, then ensure alignment is
10283 overridden to this value. */
10286 build_atomic_base (tree type
, unsigned int align
)
10290 /* Make sure its not already registered. */
10291 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10294 t
= build_variant_type_copy (type
);
10295 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10298 SET_TYPE_ALIGN (t
, align
);
10303 /* Information about the _FloatN and _FloatNx types. This must be in
10304 the same order as the corresponding TI_* enum values. */
10305 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10317 /* Create nodes for all integer types (and error_mark_node) using the sizes
10318 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10321 build_common_tree_nodes (bool signed_char
)
10325 error_mark_node
= make_node (ERROR_MARK
);
10326 TREE_TYPE (error_mark_node
) = error_mark_node
;
10328 initialize_sizetypes ();
10330 /* Define both `signed char' and `unsigned char'. */
10331 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10332 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10333 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10334 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10336 /* Define `char', which is like either `signed char' or `unsigned char'
10337 but not the same as either. */
10340 ? make_signed_type (CHAR_TYPE_SIZE
)
10341 : make_unsigned_type (CHAR_TYPE_SIZE
));
10342 TYPE_STRING_FLAG (char_type_node
) = 1;
10344 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10345 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10346 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10347 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10348 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10349 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10350 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10351 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10353 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10355 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10356 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10358 if (int_n_enabled_p
[i
])
10360 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10361 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10365 /* Define a boolean type. This type only represents boolean values but
10366 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10367 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10368 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10369 TYPE_PRECISION (boolean_type_node
) = 1;
10370 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10372 /* Define what type to use for size_t. */
10373 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10374 size_type_node
= unsigned_type_node
;
10375 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10376 size_type_node
= long_unsigned_type_node
;
10377 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10378 size_type_node
= long_long_unsigned_type_node
;
10379 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10380 size_type_node
= short_unsigned_type_node
;
10385 size_type_node
= NULL_TREE
;
10386 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10387 if (int_n_enabled_p
[i
])
10389 char name
[50], altname
[50];
10390 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10391 sprintf (altname
, "__int%d__ unsigned", int_n_data
[i
].bitsize
);
10393 if (strcmp (name
, SIZE_TYPE
) == 0
10394 || strcmp (altname
, SIZE_TYPE
) == 0)
10396 size_type_node
= int_n_trees
[i
].unsigned_type
;
10399 if (size_type_node
== NULL_TREE
)
10400 gcc_unreachable ();
10403 /* Define what type to use for ptrdiff_t. */
10404 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10405 ptrdiff_type_node
= integer_type_node
;
10406 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10407 ptrdiff_type_node
= long_integer_type_node
;
10408 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10409 ptrdiff_type_node
= long_long_integer_type_node
;
10410 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10411 ptrdiff_type_node
= short_integer_type_node
;
10414 ptrdiff_type_node
= NULL_TREE
;
10415 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10416 if (int_n_enabled_p
[i
])
10418 char name
[50], altname
[50];
10419 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10420 sprintf (altname
, "__int%d__", int_n_data
[i
].bitsize
);
10422 if (strcmp (name
, PTRDIFF_TYPE
) == 0
10423 || strcmp (altname
, PTRDIFF_TYPE
) == 0)
10424 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10426 if (ptrdiff_type_node
== NULL_TREE
)
10427 gcc_unreachable ();
10430 /* Fill in the rest of the sized types. Reuse existing type nodes
10432 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10433 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10434 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10435 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10436 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10438 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10439 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10440 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10441 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10442 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10444 /* Don't call build_qualified type for atomics. That routine does
10445 special processing for atomics, and until they are initialized
10446 it's better not to make that call.
10448 Check to see if there is a target override for atomic types. */
10450 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10451 targetm
.atomic_align_for_mode (QImode
));
10452 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10453 targetm
.atomic_align_for_mode (HImode
));
10454 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10455 targetm
.atomic_align_for_mode (SImode
));
10456 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10457 targetm
.atomic_align_for_mode (DImode
));
10458 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10459 targetm
.atomic_align_for_mode (TImode
));
10461 access_public_node
= get_identifier ("public");
10462 access_protected_node
= get_identifier ("protected");
10463 access_private_node
= get_identifier ("private");
10465 /* Define these next since types below may used them. */
10466 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10467 integer_one_node
= build_int_cst (integer_type_node
, 1);
10468 integer_three_node
= build_int_cst (integer_type_node
, 3);
10469 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10471 size_zero_node
= size_int (0);
10472 size_one_node
= size_int (1);
10473 bitsize_zero_node
= bitsize_int (0);
10474 bitsize_one_node
= bitsize_int (1);
10475 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10477 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10478 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10480 void_type_node
= make_node (VOID_TYPE
);
10481 layout_type (void_type_node
);
10483 /* We are not going to have real types in C with less than byte alignment,
10484 so we might as well not have any types that claim to have it. */
10485 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10486 TYPE_USER_ALIGN (void_type_node
) = 0;
10488 void_node
= make_node (VOID_CST
);
10489 TREE_TYPE (void_node
) = void_type_node
;
10491 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10492 layout_type (TREE_TYPE (null_pointer_node
));
10494 ptr_type_node
= build_pointer_type (void_type_node
);
10495 const_ptr_type_node
10496 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10497 for (unsigned i
= 0;
10498 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10500 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10502 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10504 float_type_node
= make_node (REAL_TYPE
);
10505 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10506 layout_type (float_type_node
);
10508 double_type_node
= make_node (REAL_TYPE
);
10509 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10510 layout_type (double_type_node
);
10512 long_double_type_node
= make_node (REAL_TYPE
);
10513 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10514 layout_type (long_double_type_node
);
10516 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10518 int n
= floatn_nx_types
[i
].n
;
10519 bool extended
= floatn_nx_types
[i
].extended
;
10520 scalar_float_mode mode
;
10521 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10523 int precision
= GET_MODE_PRECISION (mode
);
10524 /* Work around the rs6000 KFmode having precision 113 not
10526 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10527 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10528 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10530 gcc_assert (min_precision
== n
);
10531 if (precision
< min_precision
)
10532 precision
= min_precision
;
10533 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10534 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10535 layout_type (FLOATN_NX_TYPE_NODE (i
));
10536 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10539 float_ptr_type_node
= build_pointer_type (float_type_node
);
10540 double_ptr_type_node
= build_pointer_type (double_type_node
);
10541 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10542 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10544 /* Fixed size integer types. */
10545 uint16_type_node
= make_or_reuse_type (16, 1);
10546 uint32_type_node
= make_or_reuse_type (32, 1);
10547 uint64_type_node
= make_or_reuse_type (64, 1);
10549 /* Decimal float types. */
10550 dfloat32_type_node
= make_node (REAL_TYPE
);
10551 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10552 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10553 layout_type (dfloat32_type_node
);
10554 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10556 dfloat64_type_node
= make_node (REAL_TYPE
);
10557 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10558 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10559 layout_type (dfloat64_type_node
);
10560 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10562 dfloat128_type_node
= make_node (REAL_TYPE
);
10563 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10564 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10565 layout_type (dfloat128_type_node
);
10566 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10568 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10569 complex_float_type_node
= build_complex_type (float_type_node
, true);
10570 complex_double_type_node
= build_complex_type (double_type_node
, true);
10571 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10574 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10576 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10577 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10578 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10581 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10582 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10583 sat_ ## KIND ## _type_node = \
10584 make_sat_signed_ ## KIND ## _type (SIZE); \
10585 sat_unsigned_ ## KIND ## _type_node = \
10586 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10587 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10588 unsigned_ ## KIND ## _type_node = \
10589 make_unsigned_ ## KIND ## _type (SIZE);
10591 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10592 sat_ ## WIDTH ## KIND ## _type_node = \
10593 make_sat_signed_ ## KIND ## _type (SIZE); \
10594 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10595 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10596 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10597 unsigned_ ## WIDTH ## KIND ## _type_node = \
10598 make_unsigned_ ## KIND ## _type (SIZE);
10600 /* Make fixed-point type nodes based on four different widths. */
10601 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10602 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10603 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10604 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10605 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10607 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10608 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10609 NAME ## _type_node = \
10610 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10611 u ## NAME ## _type_node = \
10612 make_or_reuse_unsigned_ ## KIND ## _type \
10613 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10614 sat_ ## NAME ## _type_node = \
10615 make_or_reuse_sat_signed_ ## KIND ## _type \
10616 (GET_MODE_BITSIZE (MODE ## mode)); \
10617 sat_u ## NAME ## _type_node = \
10618 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10619 (GET_MODE_BITSIZE (U ## MODE ## mode));
10621 /* Fixed-point type and mode nodes. */
10622 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10623 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10624 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10625 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10626 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10627 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10628 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10629 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10630 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10631 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10632 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10635 tree t
= targetm
.build_builtin_va_list ();
10637 /* Many back-ends define record types without setting TYPE_NAME.
10638 If we copied the record type here, we'd keep the original
10639 record type without a name. This breaks name mangling. So,
10640 don't copy record types and let c_common_nodes_and_builtins()
10641 declare the type to be __builtin_va_list. */
10642 if (TREE_CODE (t
) != RECORD_TYPE
)
10643 t
= build_variant_type_copy (t
);
10645 va_list_type_node
= t
;
10648 /* SCEV analyzer global shared trees. */
10649 chrec_dont_know
= make_node (SCEV_NOT_KNOWN
);
10650 TREE_TYPE (chrec_dont_know
) = void_type_node
;
10651 chrec_known
= make_node (SCEV_KNOWN
);
10652 TREE_TYPE (chrec_known
) = void_type_node
;
10655 /* Modify DECL for given flags.
10656 TM_PURE attribute is set only on types, so the function will modify
10657 DECL's type when ECF_TM_PURE is used. */
10660 set_call_expr_flags (tree decl
, int flags
)
10662 if (flags
& ECF_NOTHROW
)
10663 TREE_NOTHROW (decl
) = 1;
10664 if (flags
& ECF_CONST
)
10665 TREE_READONLY (decl
) = 1;
10666 if (flags
& ECF_PURE
)
10667 DECL_PURE_P (decl
) = 1;
10668 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10669 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10670 if (flags
& ECF_NOVOPS
)
10671 DECL_IS_NOVOPS (decl
) = 1;
10672 if (flags
& ECF_NORETURN
)
10673 TREE_THIS_VOLATILE (decl
) = 1;
10674 if (flags
& ECF_MALLOC
)
10675 DECL_IS_MALLOC (decl
) = 1;
10676 if (flags
& ECF_RETURNS_TWICE
)
10677 DECL_IS_RETURNS_TWICE (decl
) = 1;
10678 if (flags
& ECF_LEAF
)
10679 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10680 NULL
, DECL_ATTRIBUTES (decl
));
10681 if (flags
& ECF_COLD
)
10682 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10683 NULL
, DECL_ATTRIBUTES (decl
));
10684 if (flags
& ECF_RET1
)
10685 DECL_ATTRIBUTES (decl
)
10686 = tree_cons (get_identifier ("fn spec"),
10687 build_tree_list (NULL_TREE
, build_string (1, "1")),
10688 DECL_ATTRIBUTES (decl
));
10689 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10690 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10691 /* Looping const or pure is implied by noreturn.
10692 There is currently no way to declare looping const or looping pure alone. */
10693 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10694 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10698 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10701 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10702 const char *library_name
, int ecf_flags
)
10706 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10707 library_name
, NULL_TREE
);
10708 set_call_expr_flags (decl
, ecf_flags
);
10710 set_builtin_decl (code
, decl
, true);
10713 /* Call this function after instantiating all builtins that the language
10714 front end cares about. This will build the rest of the builtins
10715 and internal functions that are relied upon by the tree optimizers and
10719 build_common_builtin_nodes (void)
10724 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10725 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10727 ftype
= build_function_type (void_type_node
, void_list_node
);
10728 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10729 local_define_builtin ("__builtin_unreachable", ftype
,
10730 BUILT_IN_UNREACHABLE
,
10731 "__builtin_unreachable",
10732 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10733 | ECF_CONST
| ECF_COLD
);
10734 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10735 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10737 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10740 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10741 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10743 ftype
= build_function_type_list (ptr_type_node
,
10744 ptr_type_node
, const_ptr_type_node
,
10745 size_type_node
, NULL_TREE
);
10747 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10748 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10749 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10750 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10751 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10752 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10755 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10757 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10758 const_ptr_type_node
, size_type_node
,
10760 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10761 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10764 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10766 ftype
= build_function_type_list (ptr_type_node
,
10767 ptr_type_node
, integer_type_node
,
10768 size_type_node
, NULL_TREE
);
10769 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10770 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10773 /* If we're checking the stack, `alloca' can throw. */
10774 const int alloca_flags
10775 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10777 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10779 ftype
= build_function_type_list (ptr_type_node
,
10780 size_type_node
, NULL_TREE
);
10781 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10782 "alloca", alloca_flags
);
10785 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10786 size_type_node
, NULL_TREE
);
10787 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10788 BUILT_IN_ALLOCA_WITH_ALIGN
,
10789 "__builtin_alloca_with_align",
10792 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10793 size_type_node
, size_type_node
, NULL_TREE
);
10794 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10795 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10796 "__builtin_alloca_with_align_and_max",
10799 ftype
= build_function_type_list (void_type_node
,
10800 ptr_type_node
, ptr_type_node
,
10801 ptr_type_node
, NULL_TREE
);
10802 local_define_builtin ("__builtin_init_trampoline", ftype
,
10803 BUILT_IN_INIT_TRAMPOLINE
,
10804 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10805 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10806 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10807 "__builtin_init_heap_trampoline",
10808 ECF_NOTHROW
| ECF_LEAF
);
10809 local_define_builtin ("__builtin_init_descriptor", ftype
,
10810 BUILT_IN_INIT_DESCRIPTOR
,
10811 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10813 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10814 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10815 BUILT_IN_ADJUST_TRAMPOLINE
,
10816 "__builtin_adjust_trampoline",
10817 ECF_CONST
| ECF_NOTHROW
);
10818 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10819 BUILT_IN_ADJUST_DESCRIPTOR
,
10820 "__builtin_adjust_descriptor",
10821 ECF_CONST
| ECF_NOTHROW
);
10823 ftype
= build_function_type_list (void_type_node
,
10824 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10825 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10826 BUILT_IN_NONLOCAL_GOTO
,
10827 "__builtin_nonlocal_goto",
10828 ECF_NORETURN
| ECF_NOTHROW
);
10830 ftype
= build_function_type_list (void_type_node
,
10831 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10832 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10833 BUILT_IN_SETJMP_SETUP
,
10834 "__builtin_setjmp_setup", ECF_NOTHROW
);
10836 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10837 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10838 BUILT_IN_SETJMP_RECEIVER
,
10839 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10841 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10842 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10843 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10845 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10846 local_define_builtin ("__builtin_stack_restore", ftype
,
10847 BUILT_IN_STACK_RESTORE
,
10848 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10850 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10851 const_ptr_type_node
, size_type_node
,
10853 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10854 "__builtin_memcmp_eq",
10855 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10857 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10858 "__builtin_strncmp_eq",
10859 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10861 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10862 "__builtin_strcmp_eq",
10863 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10865 /* If there's a possibility that we might use the ARM EABI, build the
10866 alternate __cxa_end_cleanup node used to resume from C++. */
10867 if (targetm
.arm_eabi_unwinder
)
10869 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10870 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10871 BUILT_IN_CXA_END_CLEANUP
,
10872 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10875 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10876 local_define_builtin ("__builtin_unwind_resume", ftype
,
10877 BUILT_IN_UNWIND_RESUME
,
10878 ((targetm_common
.except_unwind_info (&global_options
)
10880 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10883 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10885 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10887 local_define_builtin ("__builtin_return_address", ftype
,
10888 BUILT_IN_RETURN_ADDRESS
,
10889 "__builtin_return_address",
10893 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10894 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10896 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10897 ptr_type_node
, NULL_TREE
);
10898 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10899 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10900 BUILT_IN_PROFILE_FUNC_ENTER
,
10901 "__cyg_profile_func_enter", 0);
10902 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10903 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10904 BUILT_IN_PROFILE_FUNC_EXIT
,
10905 "__cyg_profile_func_exit", 0);
10908 /* The exception object and filter values from the runtime. The argument
10909 must be zero before exception lowering, i.e. from the front end. After
10910 exception lowering, it will be the region number for the exception
10911 landing pad. These functions are PURE instead of CONST to prevent
10912 them from being hoisted past the exception edge that will initialize
10913 its value in the landing pad. */
10914 ftype
= build_function_type_list (ptr_type_node
,
10915 integer_type_node
, NULL_TREE
);
10916 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10917 /* Only use TM_PURE if we have TM language support. */
10918 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10919 ecf_flags
|= ECF_TM_PURE
;
10920 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10921 "__builtin_eh_pointer", ecf_flags
);
10923 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10924 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10925 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10926 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10928 ftype
= build_function_type_list (void_type_node
,
10929 integer_type_node
, integer_type_node
,
10931 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10932 BUILT_IN_EH_COPY_VALUES
,
10933 "__builtin_eh_copy_values", ECF_NOTHROW
);
10935 /* Complex multiplication and division. These are handled as builtins
10936 rather than optabs because emit_library_call_value doesn't support
10937 complex. Further, we can do slightly better with folding these
10938 beasties if the real and complex parts of the arguments are separate. */
10942 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10944 char mode_name_buf
[4], *q
;
10946 enum built_in_function mcode
, dcode
;
10947 tree type
, inner_type
;
10948 const char *prefix
= "__";
10950 if (targetm
.libfunc_gnu_prefix
)
10953 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10956 inner_type
= TREE_TYPE (type
);
10958 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10959 inner_type
, inner_type
, NULL_TREE
);
10961 mcode
= ((enum built_in_function
)
10962 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10963 dcode
= ((enum built_in_function
)
10964 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10966 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10970 /* For -ftrapping-math these should throw from a former
10971 -fnon-call-exception stmt. */
10972 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10974 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10975 built_in_names
[mcode
],
10976 ECF_CONST
| ECF_LEAF
);
10978 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10980 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10981 built_in_names
[dcode
],
10982 ECF_CONST
| ECF_LEAF
);
10986 init_internal_fns ();
10989 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10992 If we requested a pointer to a vector, build up the pointers that
10993 we stripped off while looking for the inner type. Similarly for
10994 return values from functions.
10996 The argument TYPE is the top of the chain, and BOTTOM is the
10997 new type which we will point to. */
11000 reconstruct_complex_type (tree type
, tree bottom
)
11004 if (TREE_CODE (type
) == POINTER_TYPE
)
11006 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11007 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
11008 TYPE_REF_CAN_ALIAS_ALL (type
));
11010 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
11012 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11013 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
11014 TYPE_REF_CAN_ALIAS_ALL (type
));
11016 else if (TREE_CODE (type
) == ARRAY_TYPE
)
11018 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11019 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
11021 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11023 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11024 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
11026 else if (TREE_CODE (type
) == METHOD_TYPE
)
11028 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11029 /* The build_method_type_directly() routine prepends 'this' to argument list,
11030 so we must compensate by getting rid of it. */
11032 = build_method_type_directly
11033 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
11035 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
11037 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11039 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
11040 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
11045 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
11046 TYPE_QUALS (type
));
11049 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
11052 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
11055 unsigned int bitsize
;
11057 switch (GET_MODE_CLASS (mode
))
11059 case MODE_VECTOR_BOOL
:
11060 case MODE_VECTOR_INT
:
11061 case MODE_VECTOR_FLOAT
:
11062 case MODE_VECTOR_FRACT
:
11063 case MODE_VECTOR_UFRACT
:
11064 case MODE_VECTOR_ACCUM
:
11065 case MODE_VECTOR_UACCUM
:
11066 nunits
= GET_MODE_NUNITS (mode
);
11070 /* Check that there are no leftover bits. */
11071 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
11072 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
11073 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
11077 gcc_unreachable ();
11080 return make_vector_type (innertype
, nunits
, mode
);
11083 /* Similarly, but takes the inner type and number of units, which must be
11087 build_vector_type (tree innertype
, poly_int64 nunits
)
11089 return make_vector_type (innertype
, nunits
, VOIDmode
);
11092 /* Build truth vector with specified length and number of units. */
11095 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
11097 machine_mode mask_mode
11098 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
11101 if (mask_mode
== BLKmode
)
11102 vsize
= vector_size
* BITS_PER_UNIT
;
11104 vsize
= GET_MODE_BITSIZE (mask_mode
);
11106 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
11108 tree bool_type
= build_nonstandard_boolean_type (esize
);
11110 return make_vector_type (bool_type
, nunits
, mask_mode
);
11113 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11116 build_same_sized_truth_vector_type (tree vectype
)
11118 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
11121 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
11123 if (known_eq (size
, 0U))
11124 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
11126 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
11129 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11132 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
11134 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11136 /* We always build the non-opaque variant before the opaque one,
11137 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11138 cand
= TYPE_NEXT_VARIANT (t
);
11140 && TYPE_VECTOR_OPAQUE (cand
)
11141 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11143 /* Othewise build a variant type and make sure to queue it after
11144 the non-opaque type. */
11145 cand
= build_distinct_type_copy (t
);
11146 TYPE_VECTOR_OPAQUE (cand
) = true;
11147 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11148 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11149 TYPE_NEXT_VARIANT (t
) = cand
;
11150 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11154 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11157 vector_cst_int_elt (const_tree t
, unsigned int i
)
11159 /* First handle elements that are directly encoded. */
11160 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11161 if (i
< encoded_nelts
)
11162 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
11164 /* Identify the pattern that contains element I and work out the index of
11165 the last encoded element for that pattern. */
11166 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11167 unsigned int pattern
= i
% npatterns
;
11168 unsigned int count
= i
/ npatterns
;
11169 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11171 /* If there are no steps, the final encoded value is the right one. */
11172 if (!VECTOR_CST_STEPPED_P (t
))
11173 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
11175 /* Otherwise work out the value from the last two encoded elements. */
11176 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
11177 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
11178 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
11179 return wi::to_wide (v2
) + (count
- 2) * diff
;
11182 /* Return the value of element I of VECTOR_CST T. */
11185 vector_cst_elt (const_tree t
, unsigned int i
)
11187 /* First handle elements that are directly encoded. */
11188 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11189 if (i
< encoded_nelts
)
11190 return VECTOR_CST_ENCODED_ELT (t
, i
);
11192 /* If there are no steps, the final encoded value is the right one. */
11193 if (!VECTOR_CST_STEPPED_P (t
))
11195 /* Identify the pattern that contains element I and work out the index of
11196 the last encoded element for that pattern. */
11197 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11198 unsigned int pattern
= i
% npatterns
;
11199 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11200 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11203 /* Otherwise work out the value from the last two encoded elements. */
11204 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11205 vector_cst_int_elt (t
, i
));
11208 /* Given an initializer INIT, return TRUE if INIT is zero or some
11209 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11210 null, set *NONZERO if and only if INIT is known not to be all
11211 zeros. The combination of return value of false and *NONZERO
11212 false implies that INIT may but need not be all zeros. Other
11213 combinations indicate definitive answers. */
11216 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11222 /* Conservatively clear NONZERO and set it only if INIT is definitely
11228 unsigned HOST_WIDE_INT off
= 0;
11230 switch (TREE_CODE (init
))
11233 if (integer_zerop (init
))
11240 /* ??? Note that this is not correct for C4X float formats. There,
11241 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11242 negative exponent. */
11243 if (real_zerop (init
)
11244 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11251 if (fixed_zerop (init
))
11258 if (integer_zerop (init
)
11259 || (real_zerop (init
)
11260 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11261 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11268 if (VECTOR_CST_NPATTERNS (init
) == 1
11269 && VECTOR_CST_DUPLICATE_P (init
)
11270 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11278 if (TREE_CLOBBER_P (init
))
11281 unsigned HOST_WIDE_INT idx
;
11284 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11285 if (!initializer_zerop (elt
, nonzero
))
11293 tree arg
= TREE_OPERAND (init
, 0);
11294 if (TREE_CODE (arg
) != ADDR_EXPR
)
11296 tree offset
= TREE_OPERAND (init
, 1);
11297 if (TREE_CODE (offset
) != INTEGER_CST
11298 || !tree_fits_uhwi_p (offset
))
11300 off
= tree_to_uhwi (offset
);
11303 arg
= TREE_OPERAND (arg
, 0);
11304 if (TREE_CODE (arg
) != STRING_CST
)
11308 /* Fall through. */
11312 gcc_assert (off
<= INT_MAX
);
11315 int n
= TREE_STRING_LENGTH (init
);
11319 /* We need to loop through all elements to handle cases like
11320 "\0" and "\0foobar". */
11321 for (i
= 0; i
< n
; ++i
)
11322 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11336 /* Return true if EXPR is an initializer expression in which every element
11337 is a constant that is numerically equal to 0 or 1. The elements do not
11338 need to be equal to each other. */
11341 initializer_each_zero_or_onep (const_tree expr
)
11343 STRIP_ANY_LOCATION_WRAPPER (expr
);
11345 switch (TREE_CODE (expr
))
11348 return integer_zerop (expr
) || integer_onep (expr
);
11351 return real_zerop (expr
) || real_onep (expr
);
11355 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11356 if (VECTOR_CST_STEPPED_P (expr
)
11357 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11360 for (unsigned int i
= 0; i
< nelts
; ++i
)
11362 tree elt
= vector_cst_elt (expr
, i
);
11363 if (!initializer_each_zero_or_onep (elt
))
11375 /* Check if vector VEC consists of all the equal elements and
11376 that the number of elements corresponds to the type of VEC.
11377 The function returns first element of the vector
11378 or NULL_TREE if the vector is not uniform. */
11380 uniform_vector_p (const_tree vec
)
11383 unsigned HOST_WIDE_INT i
, nelts
;
11385 if (vec
== NULL_TREE
)
11388 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11390 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11391 return TREE_OPERAND (vec
, 0);
11393 else if (TREE_CODE (vec
) == VECTOR_CST
)
11395 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11396 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11400 else if (TREE_CODE (vec
) == CONSTRUCTOR
11401 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11403 first
= error_mark_node
;
11405 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11412 if (!operand_equal_p (first
, t
, 0))
11424 /* If the argument is INTEGER_CST, return it. If the argument is vector
11425 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11427 Look through location wrappers. */
11430 uniform_integer_cst_p (tree t
)
11432 STRIP_ANY_LOCATION_WRAPPER (t
);
11434 if (TREE_CODE (t
) == INTEGER_CST
)
11437 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11439 t
= uniform_vector_p (t
);
11440 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11447 /* If VECTOR_CST T has a single nonzero element, return the index of that
11448 element, otherwise return -1. */
11451 single_nonzero_element (const_tree t
)
11453 unsigned HOST_WIDE_INT nelts
;
11454 unsigned int repeat_nelts
;
11455 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11456 repeat_nelts
= nelts
;
11457 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11459 nelts
= vector_cst_encoded_nelts (t
);
11460 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11466 for (unsigned int i
= 0; i
< nelts
; ++i
)
11468 tree elt
= vector_cst_elt (t
, i
);
11469 if (!integer_zerop (elt
) && !real_zerop (elt
))
11471 if (res
>= 0 || i
>= repeat_nelts
)
11479 /* Build an empty statement at location LOC. */
11482 build_empty_stmt (location_t loc
)
11484 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11485 SET_EXPR_LOCATION (t
, loc
);
11490 /* Build an OpenMP clause with code CODE. LOC is the location of the
11494 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11499 length
= omp_clause_num_ops
[code
];
11500 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11502 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11504 t
= (tree
) ggc_internal_alloc (size
);
11505 memset (t
, 0, size
);
11506 TREE_SET_CODE (t
, OMP_CLAUSE
);
11507 OMP_CLAUSE_SET_CODE (t
, code
);
11508 OMP_CLAUSE_LOCATION (t
) = loc
;
11513 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11514 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11515 Except for the CODE and operand count field, other storage for the
11516 object is initialized to zeros. */
11519 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11522 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11524 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11525 gcc_assert (len
>= 1);
11527 record_node_allocation_statistics (code
, length
);
11529 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11531 TREE_SET_CODE (t
, code
);
11533 /* Can't use TREE_OPERAND to store the length because if checking is
11534 enabled, it will try to check the length before we store it. :-P */
11535 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11540 /* Helper function for build_call_* functions; build a CALL_EXPR with
11541 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11542 the argument slots. */
11545 build_call_1 (tree return_type
, tree fn
, int nargs
)
11549 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11550 TREE_TYPE (t
) = return_type
;
11551 CALL_EXPR_FN (t
) = fn
;
11552 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11557 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11558 FN and a null static chain slot. NARGS is the number of call arguments
11559 which are specified as "..." arguments. */
11562 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11566 va_start (args
, nargs
);
11567 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11572 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11573 FN and a null static chain slot. NARGS is the number of call arguments
11574 which are specified as a va_list ARGS. */
11577 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11582 t
= build_call_1 (return_type
, fn
, nargs
);
11583 for (i
= 0; i
< nargs
; i
++)
11584 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11585 process_call_operands (t
);
11589 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11590 FN and a null static chain slot. NARGS is the number of call arguments
11591 which are specified as a tree array ARGS. */
11594 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11595 int nargs
, const tree
*args
)
11600 t
= build_call_1 (return_type
, fn
, nargs
);
11601 for (i
= 0; i
< nargs
; i
++)
11602 CALL_EXPR_ARG (t
, i
) = args
[i
];
11603 process_call_operands (t
);
11604 SET_EXPR_LOCATION (t
, loc
);
11608 /* Like build_call_array, but takes a vec. */
11611 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11616 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11617 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11618 CALL_EXPR_ARG (ret
, ix
) = t
;
11619 process_call_operands (ret
);
11623 /* Conveniently construct a function call expression. FNDECL names the
11624 function to be called and N arguments are passed in the array
11628 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11630 tree fntype
= TREE_TYPE (fndecl
);
11631 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11633 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11636 /* Conveniently construct a function call expression. FNDECL names the
11637 function to be called and the arguments are passed in the vector
11641 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11643 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11644 vec_safe_address (vec
));
11648 /* Conveniently construct a function call expression. FNDECL names the
11649 function to be called, N is the number of arguments, and the "..."
11650 parameters are the argument expressions. */
11653 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11656 tree
*argarray
= XALLOCAVEC (tree
, n
);
11660 for (i
= 0; i
< n
; i
++)
11661 argarray
[i
] = va_arg (ap
, tree
);
11663 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11666 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11667 varargs macros aren't supported by all bootstrap compilers. */
11670 build_call_expr (tree fndecl
, int n
, ...)
11673 tree
*argarray
= XALLOCAVEC (tree
, n
);
11677 for (i
= 0; i
< n
; i
++)
11678 argarray
[i
] = va_arg (ap
, tree
);
11680 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11683 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11684 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11685 It will get gimplified later into an ordinary internal function. */
11688 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11689 tree type
, int n
, const tree
*args
)
11691 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11692 for (int i
= 0; i
< n
; ++i
)
11693 CALL_EXPR_ARG (t
, i
) = args
[i
];
11694 SET_EXPR_LOCATION (t
, loc
);
11695 CALL_EXPR_IFN (t
) = ifn
;
11699 /* Build internal call expression. This is just like CALL_EXPR, except
11700 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11701 internal function. */
11704 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11705 tree type
, int n
, ...)
11708 tree
*argarray
= XALLOCAVEC (tree
, n
);
11712 for (i
= 0; i
< n
; i
++)
11713 argarray
[i
] = va_arg (ap
, tree
);
11715 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11718 /* Return a function call to FN, if the target is guaranteed to support it,
11721 N is the number of arguments, passed in the "...", and TYPE is the
11722 type of the return value. */
11725 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11729 tree
*argarray
= XALLOCAVEC (tree
, n
);
11733 for (i
= 0; i
< n
; i
++)
11734 argarray
[i
] = va_arg (ap
, tree
);
11736 if (internal_fn_p (fn
))
11738 internal_fn ifn
= as_internal_fn (fn
);
11739 if (direct_internal_fn_p (ifn
))
11741 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11742 if (!direct_internal_fn_supported_p (ifn
, types
,
11743 OPTIMIZE_FOR_BOTH
))
11746 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11750 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11753 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11757 /* Return a function call to the appropriate builtin alloca variant.
11759 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11760 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11761 bound for SIZE in case it is not a fixed value. */
11764 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11768 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11770 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11772 else if (align
> 0)
11774 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11775 return build_call_expr (t
, 2, size
, size_int (align
));
11779 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11780 return build_call_expr (t
, 1, size
);
11784 /* Create a new constant string literal consisting of elements of type
11785 ELTYPE and return a tree node representing char* pointer to it as
11786 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11787 the LEN bytes at STR (the representation of the string, which may
11791 build_string_literal (int len
, const char *str
,
11792 tree eltype
/* = char_type_node */)
11794 tree t
= build_string (len
, str
);
11795 tree index
= build_index_type (size_int (len
- 1));
11796 eltype
= build_type_variant (eltype
, 1, 0);
11797 tree type
= build_array_type (eltype
, index
);
11798 TREE_TYPE (t
) = type
;
11799 TREE_CONSTANT (t
) = 1;
11800 TREE_READONLY (t
) = 1;
11801 TREE_STATIC (t
) = 1;
11803 type
= build_pointer_type (eltype
);
11804 t
= build1 (ADDR_EXPR
, type
,
11805 build4 (ARRAY_REF
, eltype
,
11806 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11812 /* Return true if T (assumed to be a DECL) must be assigned a memory
11816 needs_to_live_in_memory (const_tree t
)
11818 return (TREE_ADDRESSABLE (t
)
11819 || is_global_var (t
)
11820 || (TREE_CODE (t
) == RESULT_DECL
11821 && !DECL_BY_REFERENCE (t
)
11822 && aggregate_value_p (t
, current_function_decl
)));
11825 /* Return value of a constant X and sign-extend it. */
11828 int_cst_value (const_tree x
)
11830 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11831 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11833 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11834 gcc_assert (cst_and_fits_in_hwi (x
));
11836 if (bits
< HOST_BITS_PER_WIDE_INT
)
11838 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11840 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11842 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11848 /* If TYPE is an integral or pointer type, return an integer type with
11849 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11850 if TYPE is already an integer type of signedness UNSIGNEDP.
11851 If TYPE is a floating-point type, return an integer type with the same
11852 bitsize and with the signedness given by UNSIGNEDP; this is useful
11853 when doing bit-level operations on a floating-point value. */
11856 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11858 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11861 if (TREE_CODE (type
) == VECTOR_TYPE
)
11863 tree inner
= TREE_TYPE (type
);
11864 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11867 if (inner
== inner2
)
11869 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11872 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11874 tree inner
= TREE_TYPE (type
);
11875 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11878 if (inner
== inner2
)
11880 return build_complex_type (inner2
);
11884 if (INTEGRAL_TYPE_P (type
)
11885 || POINTER_TYPE_P (type
)
11886 || TREE_CODE (type
) == OFFSET_TYPE
)
11887 bits
= TYPE_PRECISION (type
);
11888 else if (TREE_CODE (type
) == REAL_TYPE
)
11889 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11893 return build_nonstandard_integer_type (bits
, unsignedp
);
11896 /* If TYPE is an integral or pointer type, return an integer type with
11897 the same precision which is unsigned, or itself if TYPE is already an
11898 unsigned integer type. If TYPE is a floating-point type, return an
11899 unsigned integer type with the same bitsize as TYPE. */
11902 unsigned_type_for (tree type
)
11904 return signed_or_unsigned_type_for (1, type
);
11907 /* If TYPE is an integral or pointer type, return an integer type with
11908 the same precision which is signed, or itself if TYPE is already a
11909 signed integer type. If TYPE is a floating-point type, return a
11910 signed integer type with the same bitsize as TYPE. */
11913 signed_type_for (tree type
)
11915 return signed_or_unsigned_type_for (0, type
);
11918 /* If TYPE is a vector type, return a signed integer vector type with the
11919 same width and number of subparts. Otherwise return boolean_type_node. */
11922 truth_type_for (tree type
)
11924 if (TREE_CODE (type
) == VECTOR_TYPE
)
11926 if (VECTOR_BOOLEAN_TYPE_P (type
))
11928 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11929 GET_MODE_SIZE (TYPE_MODE (type
)));
11932 return boolean_type_node
;
11935 /* Returns the largest value obtainable by casting something in INNER type to
11939 upper_bound_in_type (tree outer
, tree inner
)
11941 unsigned int det
= 0;
11942 unsigned oprec
= TYPE_PRECISION (outer
);
11943 unsigned iprec
= TYPE_PRECISION (inner
);
11946 /* Compute a unique number for every combination. */
11947 det
|= (oprec
> iprec
) ? 4 : 0;
11948 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11949 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11951 /* Determine the exponent to use. */
11956 /* oprec <= iprec, outer: signed, inner: don't care. */
11961 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11965 /* oprec > iprec, outer: signed, inner: signed. */
11969 /* oprec > iprec, outer: signed, inner: unsigned. */
11973 /* oprec > iprec, outer: unsigned, inner: signed. */
11977 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11981 gcc_unreachable ();
11984 return wide_int_to_tree (outer
,
11985 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11988 /* Returns the smallest value obtainable by casting something in INNER type to
11992 lower_bound_in_type (tree outer
, tree inner
)
11994 unsigned oprec
= TYPE_PRECISION (outer
);
11995 unsigned iprec
= TYPE_PRECISION (inner
);
11997 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11999 if (TYPE_UNSIGNED (outer
)
12000 /* If we are widening something of an unsigned type, OUTER type
12001 contains all values of INNER type. In particular, both INNER
12002 and OUTER types have zero in common. */
12003 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
12004 return build_int_cst (outer
, 0);
12007 /* If we are widening a signed type to another signed type, we
12008 want to obtain -2^^(iprec-1). If we are keeping the
12009 precision or narrowing to a signed type, we want to obtain
12011 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
12012 return wide_int_to_tree (outer
,
12013 wi::mask (prec
- 1, true,
12014 TYPE_PRECISION (outer
)));
12018 /* Return nonzero if two operands that are suitable for PHI nodes are
12019 necessarily equal. Specifically, both ARG0 and ARG1 must be either
12020 SSA_NAME or invariant. Note that this is strictly an optimization.
12021 That is, callers of this function can directly call operand_equal_p
12022 and get the same result, only slower. */
12025 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
12029 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
12031 return operand_equal_p (arg0
, arg1
, 0);
12034 /* Returns number of zeros at the end of binary representation of X. */
12037 num_ending_zeros (const_tree x
)
12039 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
12043 #define WALK_SUBTREE(NODE) \
12046 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
12052 /* This is a subroutine of walk_tree that walks field of TYPE that are to
12053 be walked whenever a type is seen in the tree. Rest of operands and return
12054 value are as for walk_tree. */
12057 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
12058 hash_set
<tree
> *pset
, walk_tree_lh lh
)
12060 tree result
= NULL_TREE
;
12062 switch (TREE_CODE (type
))
12065 case REFERENCE_TYPE
:
12067 /* We have to worry about mutually recursive pointers. These can't
12068 be written in C. They can in Ada. It's pathological, but
12069 there's an ACATS test (c38102a) that checks it. Deal with this
12070 by checking if we're pointing to another pointer, that one
12071 points to another pointer, that one does too, and we have no htab.
12072 If so, get a hash table. We check three levels deep to avoid
12073 the cost of the hash table if we don't need one. */
12074 if (POINTER_TYPE_P (TREE_TYPE (type
))
12075 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
12076 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
12079 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
12090 WALK_SUBTREE (TREE_TYPE (type
));
12094 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
12096 /* Fall through. */
12098 case FUNCTION_TYPE
:
12099 WALK_SUBTREE (TREE_TYPE (type
));
12103 /* We never want to walk into default arguments. */
12104 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
12105 WALK_SUBTREE (TREE_VALUE (arg
));
12110 /* Don't follow this nodes's type if a pointer for fear that
12111 we'll have infinite recursion. If we have a PSET, then we
12114 || (!POINTER_TYPE_P (TREE_TYPE (type
))
12115 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
12116 WALK_SUBTREE (TREE_TYPE (type
));
12117 WALK_SUBTREE (TYPE_DOMAIN (type
));
12121 WALK_SUBTREE (TREE_TYPE (type
));
12122 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
12132 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12133 called with the DATA and the address of each sub-tree. If FUNC returns a
12134 non-NULL value, the traversal is stopped, and the value returned by FUNC
12135 is returned. If PSET is non-NULL it is used to record the nodes visited,
12136 and to avoid visiting a node more than once. */
12139 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12140 hash_set
<tree
> *pset
, walk_tree_lh lh
)
12142 enum tree_code code
;
12146 #define WALK_SUBTREE_TAIL(NODE) \
12150 goto tail_recurse; \
12155 /* Skip empty subtrees. */
12159 /* Don't walk the same tree twice, if the user has requested
12160 that we avoid doing so. */
12161 if (pset
&& pset
->add (*tp
))
12164 /* Call the function. */
12166 result
= (*func
) (tp
, &walk_subtrees
, data
);
12168 /* If we found something, return it. */
12172 code
= TREE_CODE (*tp
);
12174 /* Even if we didn't, FUNC may have decided that there was nothing
12175 interesting below this point in the tree. */
12176 if (!walk_subtrees
)
12178 /* But we still need to check our siblings. */
12179 if (code
== TREE_LIST
)
12180 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12181 else if (code
== OMP_CLAUSE
)
12182 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12189 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12190 if (result
|| !walk_subtrees
)
12197 case IDENTIFIER_NODE
:
12204 case PLACEHOLDER_EXPR
:
12208 /* None of these have subtrees other than those already walked
12213 WALK_SUBTREE (TREE_VALUE (*tp
));
12214 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12219 int len
= TREE_VEC_LENGTH (*tp
);
12224 /* Walk all elements but the first. */
12226 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12228 /* Now walk the first one as a tail call. */
12229 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12233 WALK_SUBTREE (TREE_REALPART (*tp
));
12234 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12238 unsigned HOST_WIDE_INT idx
;
12239 constructor_elt
*ce
;
12241 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12243 WALK_SUBTREE (ce
->value
);
12248 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12253 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12255 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12256 into declarations that are just mentioned, rather than
12257 declared; they don't really belong to this part of the tree.
12258 And, we can see cycles: the initializer for a declaration
12259 can refer to the declaration itself. */
12260 WALK_SUBTREE (DECL_INITIAL (decl
));
12261 WALK_SUBTREE (DECL_SIZE (decl
));
12262 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12264 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12267 case STATEMENT_LIST
:
12269 tree_stmt_iterator i
;
12270 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12271 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12276 switch (OMP_CLAUSE_CODE (*tp
))
12278 case OMP_CLAUSE_GANG
:
12279 case OMP_CLAUSE__GRIDDIM_
:
12280 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12283 case OMP_CLAUSE_ASYNC
:
12284 case OMP_CLAUSE_WAIT
:
12285 case OMP_CLAUSE_WORKER
:
12286 case OMP_CLAUSE_VECTOR
:
12287 case OMP_CLAUSE_NUM_GANGS
:
12288 case OMP_CLAUSE_NUM_WORKERS
:
12289 case OMP_CLAUSE_VECTOR_LENGTH
:
12290 case OMP_CLAUSE_PRIVATE
:
12291 case OMP_CLAUSE_SHARED
:
12292 case OMP_CLAUSE_FIRSTPRIVATE
:
12293 case OMP_CLAUSE_COPYIN
:
12294 case OMP_CLAUSE_COPYPRIVATE
:
12295 case OMP_CLAUSE_FINAL
:
12296 case OMP_CLAUSE_IF
:
12297 case OMP_CLAUSE_NUM_THREADS
:
12298 case OMP_CLAUSE_SCHEDULE
:
12299 case OMP_CLAUSE_UNIFORM
:
12300 case OMP_CLAUSE_DEPEND
:
12301 case OMP_CLAUSE_NONTEMPORAL
:
12302 case OMP_CLAUSE_NUM_TEAMS
:
12303 case OMP_CLAUSE_THREAD_LIMIT
:
12304 case OMP_CLAUSE_DEVICE
:
12305 case OMP_CLAUSE_DIST_SCHEDULE
:
12306 case OMP_CLAUSE_SAFELEN
:
12307 case OMP_CLAUSE_SIMDLEN
:
12308 case OMP_CLAUSE_ORDERED
:
12309 case OMP_CLAUSE_PRIORITY
:
12310 case OMP_CLAUSE_GRAINSIZE
:
12311 case OMP_CLAUSE_NUM_TASKS
:
12312 case OMP_CLAUSE_HINT
:
12313 case OMP_CLAUSE_TO_DECLARE
:
12314 case OMP_CLAUSE_LINK
:
12315 case OMP_CLAUSE_USE_DEVICE_PTR
:
12316 case OMP_CLAUSE_IS_DEVICE_PTR
:
12317 case OMP_CLAUSE_INCLUSIVE
:
12318 case OMP_CLAUSE_EXCLUSIVE
:
12319 case OMP_CLAUSE__LOOPTEMP_
:
12320 case OMP_CLAUSE__REDUCTEMP_
:
12321 case OMP_CLAUSE__CONDTEMP_
:
12322 case OMP_CLAUSE__SCANTEMP_
:
12323 case OMP_CLAUSE__SIMDUID_
:
12324 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12327 case OMP_CLAUSE_INDEPENDENT
:
12328 case OMP_CLAUSE_NOWAIT
:
12329 case OMP_CLAUSE_DEFAULT
:
12330 case OMP_CLAUSE_UNTIED
:
12331 case OMP_CLAUSE_MERGEABLE
:
12332 case OMP_CLAUSE_PROC_BIND
:
12333 case OMP_CLAUSE_INBRANCH
:
12334 case OMP_CLAUSE_NOTINBRANCH
:
12335 case OMP_CLAUSE_FOR
:
12336 case OMP_CLAUSE_PARALLEL
:
12337 case OMP_CLAUSE_SECTIONS
:
12338 case OMP_CLAUSE_TASKGROUP
:
12339 case OMP_CLAUSE_NOGROUP
:
12340 case OMP_CLAUSE_THREADS
:
12341 case OMP_CLAUSE_SIMD
:
12342 case OMP_CLAUSE_DEFAULTMAP
:
12343 case OMP_CLAUSE_AUTO
:
12344 case OMP_CLAUSE_SEQ
:
12345 case OMP_CLAUSE_TILE
:
12346 case OMP_CLAUSE__SIMT_
:
12347 case OMP_CLAUSE_IF_PRESENT
:
12348 case OMP_CLAUSE_FINALIZE
:
12349 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12351 case OMP_CLAUSE_LASTPRIVATE
:
12352 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12353 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12354 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12356 case OMP_CLAUSE_COLLAPSE
:
12359 for (i
= 0; i
< 3; i
++)
12360 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12361 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12364 case OMP_CLAUSE_LINEAR
:
12365 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12366 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12367 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12368 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12370 case OMP_CLAUSE_ALIGNED
:
12371 case OMP_CLAUSE_FROM
:
12372 case OMP_CLAUSE_TO
:
12373 case OMP_CLAUSE_MAP
:
12374 case OMP_CLAUSE__CACHE_
:
12375 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12376 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12377 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12379 case OMP_CLAUSE_REDUCTION
:
12380 case OMP_CLAUSE_TASK_REDUCTION
:
12381 case OMP_CLAUSE_IN_REDUCTION
:
12384 for (i
= 0; i
< 5; i
++)
12385 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12386 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12390 gcc_unreachable ();
12398 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12399 But, we only want to walk once. */
12400 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12401 for (i
= 0; i
< len
; ++i
)
12402 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12403 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12407 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12408 defining. We only want to walk into these fields of a type in this
12409 case and not in the general case of a mere reference to the type.
12411 The criterion is as follows: if the field can be an expression, it
12412 must be walked only here. This should be in keeping with the fields
12413 that are directly gimplified in gimplify_type_sizes in order for the
12414 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12415 variable-sized types.
12417 Note that DECLs get walked as part of processing the BIND_EXPR. */
12418 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12420 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12421 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12424 /* Call the function for the type. See if it returns anything or
12425 doesn't want us to continue. If we are to continue, walk both
12426 the normal fields and those for the declaration case. */
12427 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12428 if (result
|| !walk_subtrees
)
12431 /* But do not walk a pointed-to type since it may itself need to
12432 be walked in the declaration case if it isn't anonymous. */
12433 if (!POINTER_TYPE_P (*type_p
))
12435 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12440 /* If this is a record type, also walk the fields. */
12441 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12445 for (field
= TYPE_FIELDS (*type_p
); field
;
12446 field
= DECL_CHAIN (field
))
12448 /* We'd like to look at the type of the field, but we can
12449 easily get infinite recursion. So assume it's pointed
12450 to elsewhere in the tree. Also, ignore things that
12452 if (TREE_CODE (field
) != FIELD_DECL
)
12455 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12456 WALK_SUBTREE (DECL_SIZE (field
));
12457 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12458 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12459 WALK_SUBTREE (DECL_QUALIFIER (field
));
12463 /* Same for scalar types. */
12464 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12465 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12466 || TREE_CODE (*type_p
) == INTEGER_TYPE
12467 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12468 || TREE_CODE (*type_p
) == REAL_TYPE
)
12470 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12471 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12474 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12475 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12480 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12484 /* Walk over all the sub-trees of this operand. */
12485 len
= TREE_OPERAND_LENGTH (*tp
);
12487 /* Go through the subtrees. We need to do this in forward order so
12488 that the scope of a FOR_EXPR is handled properly. */
12491 for (i
= 0; i
< len
- 1; ++i
)
12492 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12493 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12496 /* If this is a type, walk the needed fields in the type. */
12497 else if (TYPE_P (*tp
))
12498 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12502 /* We didn't find what we were looking for. */
12505 #undef WALK_SUBTREE_TAIL
12507 #undef WALK_SUBTREE
12509 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12512 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12517 hash_set
<tree
> pset
;
12518 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12524 tree_block (tree t
)
12526 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12528 if (IS_EXPR_CODE_CLASS (c
))
12529 return LOCATION_BLOCK (t
->exp
.locus
);
12530 gcc_unreachable ();
12535 tree_set_block (tree t
, tree b
)
12537 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12539 if (IS_EXPR_CODE_CLASS (c
))
12541 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12544 gcc_unreachable ();
12547 /* Create a nameless artificial label and put it in the current
12548 function context. The label has a location of LOC. Returns the
12549 newly created label. */
12552 create_artificial_label (location_t loc
)
12554 tree lab
= build_decl (loc
,
12555 LABEL_DECL
, NULL_TREE
, void_type_node
);
12557 DECL_ARTIFICIAL (lab
) = 1;
12558 DECL_IGNORED_P (lab
) = 1;
12559 DECL_CONTEXT (lab
) = current_function_decl
;
12563 /* Given a tree, try to return a useful variable name that we can use
12564 to prefix a temporary that is being assigned the value of the tree.
12565 I.E. given <temp> = &A, return A. */
12570 tree stripped_decl
;
12573 STRIP_NOPS (stripped_decl
);
12574 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12575 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12576 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12578 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12581 return IDENTIFIER_POINTER (name
);
12585 switch (TREE_CODE (stripped_decl
))
12588 return get_name (TREE_OPERAND (stripped_decl
, 0));
12595 /* Return true if TYPE has a variable argument list. */
12598 stdarg_p (const_tree fntype
)
12600 function_args_iterator args_iter
;
12601 tree n
= NULL_TREE
, t
;
12606 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12611 return n
!= NULL_TREE
&& n
!= void_type_node
;
12614 /* Return true if TYPE has a prototype. */
12617 prototype_p (const_tree fntype
)
12621 gcc_assert (fntype
!= NULL_TREE
);
12623 t
= TYPE_ARG_TYPES (fntype
);
12624 return (t
!= NULL_TREE
);
12627 /* If BLOCK is inlined from an __attribute__((__artificial__))
12628 routine, return pointer to location from where it has been
12631 block_nonartificial_location (tree block
)
12633 location_t
*ret
= NULL
;
12635 while (block
&& TREE_CODE (block
) == BLOCK
12636 && BLOCK_ABSTRACT_ORIGIN (block
))
12638 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12639 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12641 /* If AO is an artificial inline, point RET to the
12642 call site locus at which it has been inlined and continue
12643 the loop, in case AO's caller is also an artificial
12645 if (DECL_DECLARED_INLINE_P (ao
)
12646 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12647 ret
= &BLOCK_SOURCE_LOCATION (block
);
12651 else if (TREE_CODE (ao
) != BLOCK
)
12654 block
= BLOCK_SUPERCONTEXT (block
);
12660 /* If EXP is inlined from an __attribute__((__artificial__))
12661 function, return the location of the original call expression. */
12664 tree_nonartificial_location (tree exp
)
12666 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12671 return EXPR_LOCATION (exp
);
12675 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12678 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12681 cl_option_hasher::hash (tree x
)
12683 const_tree
const t
= x
;
12687 hashval_t hash
= 0;
12689 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12691 p
= (const char *)TREE_OPTIMIZATION (t
);
12692 len
= sizeof (struct cl_optimization
);
12695 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12696 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12699 gcc_unreachable ();
12701 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12703 for (i
= 0; i
< len
; i
++)
12705 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12710 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12711 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12715 cl_option_hasher::equal (tree x
, tree y
)
12717 const_tree
const xt
= x
;
12718 const_tree
const yt
= y
;
12720 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12723 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12724 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12725 TREE_OPTIMIZATION (yt
));
12726 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12727 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12728 TREE_TARGET_OPTION (yt
));
12730 gcc_unreachable ();
12733 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12736 build_optimization_node (struct gcc_options
*opts
)
12740 /* Use the cache of optimization nodes. */
12742 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12745 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12749 /* Insert this one into the hash table. */
12750 t
= cl_optimization_node
;
12753 /* Make a new node for next time round. */
12754 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12760 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12763 build_target_option_node (struct gcc_options
*opts
)
12767 /* Use the cache of optimization nodes. */
12769 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12772 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12776 /* Insert this one into the hash table. */
12777 t
= cl_target_option_node
;
12780 /* Make a new node for next time round. */
12781 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12787 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12788 so that they aren't saved during PCH writing. */
12791 prepare_target_option_nodes_for_pch (void)
12793 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12794 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12795 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12796 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12799 /* Determine the "ultimate origin" of a block. */
12802 block_ultimate_origin (const_tree block
)
12804 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12806 if (origin
== NULL_TREE
)
12810 gcc_checking_assert ((DECL_P (origin
)
12811 && DECL_ORIGIN (origin
) == origin
)
12812 || BLOCK_ORIGIN (origin
) == origin
);
12817 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12821 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12823 /* Do not strip casts into or out of differing address spaces. */
12824 if (POINTER_TYPE_P (outer_type
)
12825 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12827 if (!POINTER_TYPE_P (inner_type
)
12828 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12829 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12832 else if (POINTER_TYPE_P (inner_type
)
12833 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12835 /* We already know that outer_type is not a pointer with
12836 a non-generic address space. */
12840 /* Use precision rather then machine mode when we can, which gives
12841 the correct answer even for submode (bit-field) types. */
12842 if ((INTEGRAL_TYPE_P (outer_type
)
12843 || POINTER_TYPE_P (outer_type
)
12844 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12845 && (INTEGRAL_TYPE_P (inner_type
)
12846 || POINTER_TYPE_P (inner_type
)
12847 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12848 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12850 /* Otherwise fall back on comparing machine modes (e.g. for
12851 aggregate types, floats). */
12852 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12855 /* Return true iff conversion in EXP generates no instruction. Mark
12856 it inline so that we fully inline into the stripping functions even
12857 though we have two uses of this function. */
12860 tree_nop_conversion (const_tree exp
)
12862 tree outer_type
, inner_type
;
12864 if (location_wrapper_p (exp
))
12866 if (!CONVERT_EXPR_P (exp
)
12867 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12870 outer_type
= TREE_TYPE (exp
);
12871 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12872 if (!inner_type
|| inner_type
== error_mark_node
)
12875 return tree_nop_conversion_p (outer_type
, inner_type
);
12878 /* Return true iff conversion in EXP generates no instruction. Don't
12879 consider conversions changing the signedness. */
12882 tree_sign_nop_conversion (const_tree exp
)
12884 tree outer_type
, inner_type
;
12886 if (!tree_nop_conversion (exp
))
12889 outer_type
= TREE_TYPE (exp
);
12890 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12892 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12893 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12896 /* Strip conversions from EXP according to tree_nop_conversion and
12897 return the resulting expression. */
12900 tree_strip_nop_conversions (tree exp
)
12902 while (tree_nop_conversion (exp
))
12903 exp
= TREE_OPERAND (exp
, 0);
12907 /* Strip conversions from EXP according to tree_sign_nop_conversion
12908 and return the resulting expression. */
12911 tree_strip_sign_nop_conversions (tree exp
)
12913 while (tree_sign_nop_conversion (exp
))
12914 exp
= TREE_OPERAND (exp
, 0);
12918 /* Avoid any floating point extensions from EXP. */
12920 strip_float_extensions (tree exp
)
12922 tree sub
, expt
, subt
;
12924 /* For floating point constant look up the narrowest type that can hold
12925 it properly and handle it like (type)(narrowest_type)constant.
12926 This way we can optimize for instance a=a*2.0 where "a" is float
12927 but 2.0 is double constant. */
12928 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12930 REAL_VALUE_TYPE orig
;
12933 orig
= TREE_REAL_CST (exp
);
12934 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12935 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12936 type
= float_type_node
;
12937 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12938 > TYPE_PRECISION (double_type_node
)
12939 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12940 type
= double_type_node
;
12942 return build_real_truncate (type
, orig
);
12945 if (!CONVERT_EXPR_P (exp
))
12948 sub
= TREE_OPERAND (exp
, 0);
12949 subt
= TREE_TYPE (sub
);
12950 expt
= TREE_TYPE (exp
);
12952 if (!FLOAT_TYPE_P (subt
))
12955 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12958 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12961 return strip_float_extensions (sub
);
12964 /* Strip out all handled components that produce invariant
12968 strip_invariant_refs (const_tree op
)
12970 while (handled_component_p (op
))
12972 switch (TREE_CODE (op
))
12975 case ARRAY_RANGE_REF
:
12976 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12977 || TREE_OPERAND (op
, 2) != NULL_TREE
12978 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12982 case COMPONENT_REF
:
12983 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12989 op
= TREE_OPERAND (op
, 0);
12995 static GTY(()) tree gcc_eh_personality_decl
;
12997 /* Return the GCC personality function decl. */
13000 lhd_gcc_personality (void)
13002 if (!gcc_eh_personality_decl
)
13003 gcc_eh_personality_decl
= build_personality_function ("gcc");
13004 return gcc_eh_personality_decl
;
13007 /* TARGET is a call target of GIMPLE call statement
13008 (obtained by gimple_call_fn). Return true if it is
13009 OBJ_TYPE_REF representing an virtual call of C++ method.
13010 (As opposed to OBJ_TYPE_REF representing objc calls
13011 through a cast where middle-end devirtualization machinery
13015 virtual_method_call_p (const_tree target
)
13017 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
13019 tree t
= TREE_TYPE (target
);
13020 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
13022 if (TREE_CODE (t
) == FUNCTION_TYPE
)
13024 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
13025 /* If we do not have BINFO associated, it means that type was built
13026 without devirtualization enabled. Do not consider this a virtual
13028 if (!TYPE_BINFO (obj_type_ref_class (target
)))
13033 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
13036 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
13039 tree base_binfo
, b
;
13041 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
13042 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
13043 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
13045 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
13050 /* Try to find a base info of BINFO that would have its field decl at offset
13051 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
13052 found, return, otherwise return NULL_TREE. */
13055 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
13057 tree type
= BINFO_TYPE (binfo
);
13061 HOST_WIDE_INT pos
, size
;
13065 if (types_same_for_odr (type
, expected_type
))
13067 if (maybe_lt (offset
, 0))
13070 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
13072 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
13075 pos
= int_bit_position (fld
);
13076 size
= tree_to_uhwi (DECL_SIZE (fld
));
13077 if (known_in_range_p (offset
, pos
, size
))
13080 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
13083 /* Offset 0 indicates the primary base, whose vtable contents are
13084 represented in the binfo for the derived class. */
13085 else if (maybe_ne (offset
, 0))
13087 tree found_binfo
= NULL
, base_binfo
;
13088 /* Offsets in BINFO are in bytes relative to the whole structure
13089 while POS is in bits relative to the containing field. */
13090 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
13093 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
13094 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
13095 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
13097 found_binfo
= base_binfo
;
13101 binfo
= found_binfo
;
13103 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
13107 type
= TREE_TYPE (fld
);
13112 /* Returns true if X is a typedef decl. */
13115 is_typedef_decl (const_tree x
)
13117 return (x
&& TREE_CODE (x
) == TYPE_DECL
13118 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
13121 /* Returns true iff TYPE is a type variant created for a typedef. */
13124 typedef_variant_p (const_tree type
)
13126 return is_typedef_decl (TYPE_NAME (type
));
13129 /* A class to handle converting a string that might contain
13130 control characters, (eg newline, form-feed, etc), into one
13131 in which contains escape sequences instead. */
13133 class escaped_string
13136 escaped_string () { m_owned
= false; m_str
= NULL
; };
13137 ~escaped_string () { if (m_owned
) free (m_str
); }
13138 operator const char *() const { return (const char *) m_str
; }
13139 void escape (const char *);
13145 /* PR 84195: Replace control characters in "unescaped" with their
13146 escaped equivalents. Allow newlines if -fmessage-length has
13147 been set to a non-zero value. This is done here, rather than
13148 where the attribute is recorded as the message length can
13149 change between these two locations. */
13152 escaped_string::escape (const char *unescaped
)
13155 size_t i
, new_i
, len
;
13160 m_str
= const_cast<char *> (unescaped
);
13163 if (unescaped
== NULL
|| *unescaped
== 0)
13166 len
= strlen (unescaped
);
13170 for (i
= 0; i
< len
; i
++)
13172 char c
= unescaped
[i
];
13177 escaped
[new_i
++] = c
;
13181 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13183 if (escaped
== NULL
)
13185 /* We only allocate space for a new string if we
13186 actually encounter a control character that
13187 needs replacing. */
13188 escaped
= (char *) xmalloc (len
* 2 + 1);
13189 strncpy (escaped
, unescaped
, i
);
13193 escaped
[new_i
++] = '\\';
13197 case '\a': escaped
[new_i
++] = 'a'; break;
13198 case '\b': escaped
[new_i
++] = 'b'; break;
13199 case '\f': escaped
[new_i
++] = 'f'; break;
13200 case '\n': escaped
[new_i
++] = 'n'; break;
13201 case '\r': escaped
[new_i
++] = 'r'; break;
13202 case '\t': escaped
[new_i
++] = 't'; break;
13203 case '\v': escaped
[new_i
++] = 'v'; break;
13204 default: escaped
[new_i
++] = '?'; break;
13208 escaped
[new_i
++] = c
;
13213 escaped
[new_i
] = 0;
13219 /* Warn about a use of an identifier which was marked deprecated. Returns
13220 whether a warning was given. */
13223 warn_deprecated_use (tree node
, tree attr
)
13225 escaped_string msg
;
13227 if (node
== 0 || !warn_deprecated_decl
)
13233 attr
= DECL_ATTRIBUTES (node
);
13234 else if (TYPE_P (node
))
13236 tree decl
= TYPE_STUB_DECL (node
);
13238 attr
= lookup_attribute ("deprecated",
13239 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13244 attr
= lookup_attribute ("deprecated", attr
);
13247 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13252 auto_diagnostic_group d
;
13254 w
= warning (OPT_Wdeprecated_declarations
,
13255 "%qD is deprecated: %s", node
, (const char *) msg
);
13257 w
= warning (OPT_Wdeprecated_declarations
,
13258 "%qD is deprecated", node
);
13260 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13262 else if (TYPE_P (node
))
13264 tree what
= NULL_TREE
;
13265 tree decl
= TYPE_STUB_DECL (node
);
13267 if (TYPE_NAME (node
))
13269 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13270 what
= TYPE_NAME (node
);
13271 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13272 && DECL_NAME (TYPE_NAME (node
)))
13273 what
= DECL_NAME (TYPE_NAME (node
));
13276 auto_diagnostic_group d
;
13280 w
= warning (OPT_Wdeprecated_declarations
,
13281 "%qE is deprecated: %s", what
, (const char *) msg
);
13283 w
= warning (OPT_Wdeprecated_declarations
,
13284 "%qE is deprecated", what
);
13289 w
= warning (OPT_Wdeprecated_declarations
,
13290 "type is deprecated: %s", (const char *) msg
);
13292 w
= warning (OPT_Wdeprecated_declarations
,
13293 "type is deprecated");
13297 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13303 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13304 somewhere in it. */
13307 contains_bitfld_component_ref_p (const_tree ref
)
13309 while (handled_component_p (ref
))
13311 if (TREE_CODE (ref
) == COMPONENT_REF
13312 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13314 ref
= TREE_OPERAND (ref
, 0);
13320 /* Try to determine whether a TRY_CATCH expression can fall through.
13321 This is a subroutine of block_may_fallthru. */
13324 try_catch_may_fallthru (const_tree stmt
)
13326 tree_stmt_iterator i
;
13328 /* If the TRY block can fall through, the whole TRY_CATCH can
13330 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13333 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13334 switch (TREE_CODE (tsi_stmt (i
)))
13337 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13338 catch expression and a body. The whole TRY_CATCH may fall
13339 through iff any of the catch bodies falls through. */
13340 for (; !tsi_end_p (i
); tsi_next (&i
))
13342 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13347 case EH_FILTER_EXPR
:
13348 /* The exception filter expression only matters if there is an
13349 exception. If the exception does not match EH_FILTER_TYPES,
13350 we will execute EH_FILTER_FAILURE, and we will fall through
13351 if that falls through. If the exception does match
13352 EH_FILTER_TYPES, the stack unwinder will continue up the
13353 stack, so we will not fall through. We don't know whether we
13354 will throw an exception which matches EH_FILTER_TYPES or not,
13355 so we just ignore EH_FILTER_TYPES and assume that we might
13356 throw an exception which doesn't match. */
13357 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13360 /* This case represents statements to be executed when an
13361 exception occurs. Those statements are implicitly followed
13362 by a RESX statement to resume execution after the exception.
13363 So in this case the TRY_CATCH never falls through. */
13368 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13369 need not be 100% accurate; simply be conservative and return true if we
13370 don't know. This is used only to avoid stupidly generating extra code.
13371 If we're wrong, we'll just delete the extra code later. */
13374 block_may_fallthru (const_tree block
)
13376 /* This CONST_CAST is okay because expr_last returns its argument
13377 unmodified and we assign it to a const_tree. */
13378 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13380 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13384 /* Easy cases. If the last statement of the block implies
13385 control transfer, then we can't fall through. */
13389 /* If there is a default: label or case labels cover all possible
13390 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13391 to some case label in all cases and all we care is whether the
13392 SWITCH_BODY falls through. */
13393 if (SWITCH_ALL_CASES_P (stmt
))
13394 return block_may_fallthru (SWITCH_BODY (stmt
));
13398 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13400 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13403 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13405 case TRY_CATCH_EXPR
:
13406 return try_catch_may_fallthru (stmt
);
13408 case TRY_FINALLY_EXPR
:
13409 /* The finally clause is always executed after the try clause,
13410 so if it does not fall through, then the try-finally will not
13411 fall through. Otherwise, if the try clause does not fall
13412 through, then when the finally clause falls through it will
13413 resume execution wherever the try clause was going. So the
13414 whole try-finally will only fall through if both the try
13415 clause and the finally clause fall through. */
13416 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13417 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13420 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13423 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13424 stmt
= TREE_OPERAND (stmt
, 1);
13430 /* Functions that do not return do not fall through. */
13431 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13433 case CLEANUP_POINT_EXPR
:
13434 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13437 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13443 return lang_hooks
.block_may_fallthru (stmt
);
13447 /* True if we are using EH to handle cleanups. */
13448 static bool using_eh_for_cleanups_flag
= false;
13450 /* This routine is called from front ends to indicate eh should be used for
13453 using_eh_for_cleanups (void)
13455 using_eh_for_cleanups_flag
= true;
13458 /* Query whether EH is used for cleanups. */
13460 using_eh_for_cleanups_p (void)
13462 return using_eh_for_cleanups_flag
;
13465 /* Wrapper for tree_code_name to ensure that tree code is valid */
13467 get_tree_code_name (enum tree_code code
)
13469 const char *invalid
= "<invalid tree code>";
13471 if (code
>= MAX_TREE_CODES
)
13473 if (code
== 0xa5a5)
13474 return "ggc_freed";
13478 return tree_code_name
[code
];
13481 /* Drops the TREE_OVERFLOW flag from T. */
13484 drop_tree_overflow (tree t
)
13486 gcc_checking_assert (TREE_OVERFLOW (t
));
13488 /* For tree codes with a sharing machinery re-build the result. */
13489 if (poly_int_tree_p (t
))
13490 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13492 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13493 and canonicalize the result. */
13494 if (TREE_CODE (t
) == VECTOR_CST
)
13496 tree_vector_builder builder
;
13497 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13498 unsigned int count
= builder
.encoded_nelts ();
13499 for (unsigned int i
= 0; i
< count
; ++i
)
13501 tree elt
= VECTOR_CST_ELT (t
, i
);
13502 if (TREE_OVERFLOW (elt
))
13503 elt
= drop_tree_overflow (elt
);
13504 builder
.quick_push (elt
);
13506 return builder
.build ();
13509 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13510 and drop the flag. */
13512 TREE_OVERFLOW (t
) = 0;
13514 /* For constants that contain nested constants, drop the flag
13515 from those as well. */
13516 if (TREE_CODE (t
) == COMPLEX_CST
)
13518 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13519 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13520 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13521 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13527 /* Given a memory reference expression T, return its base address.
13528 The base address of a memory reference expression is the main
13529 object being referenced. For instance, the base address for
13530 'array[i].fld[j]' is 'array'. You can think of this as stripping
13531 away the offset part from a memory address.
13533 This function calls handled_component_p to strip away all the inner
13534 parts of the memory reference until it reaches the base object. */
13537 get_base_address (tree t
)
13539 while (handled_component_p (t
))
13540 t
= TREE_OPERAND (t
, 0);
13542 if ((TREE_CODE (t
) == MEM_REF
13543 || TREE_CODE (t
) == TARGET_MEM_REF
)
13544 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13545 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13547 /* ??? Either the alias oracle or all callers need to properly deal
13548 with WITH_SIZE_EXPRs before we can look through those. */
13549 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13555 /* Return a tree of sizetype representing the size, in bytes, of the element
13556 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13559 array_ref_element_size (tree exp
)
13561 tree aligned_size
= TREE_OPERAND (exp
, 3);
13562 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13563 location_t loc
= EXPR_LOCATION (exp
);
13565 /* If a size was specified in the ARRAY_REF, it's the size measured
13566 in alignment units of the element type. So multiply by that value. */
13569 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13570 sizetype from another type of the same width and signedness. */
13571 if (TREE_TYPE (aligned_size
) != sizetype
)
13572 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13573 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13574 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13577 /* Otherwise, take the size from that of the element type. Substitute
13578 any PLACEHOLDER_EXPR that we have. */
13580 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13583 /* Return a tree representing the lower bound of the array mentioned in
13584 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13587 array_ref_low_bound (tree exp
)
13589 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13591 /* If a lower bound is specified in EXP, use it. */
13592 if (TREE_OPERAND (exp
, 2))
13593 return TREE_OPERAND (exp
, 2);
13595 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13596 substituting for a PLACEHOLDER_EXPR as needed. */
13597 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13598 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13600 /* Otherwise, return a zero of the appropriate type. */
13601 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13604 /* Return a tree representing the upper bound of the array mentioned in
13605 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13608 array_ref_up_bound (tree exp
)
13610 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13612 /* If there is a domain type and it has an upper bound, use it, substituting
13613 for a PLACEHOLDER_EXPR as needed. */
13614 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13615 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13617 /* Otherwise fail. */
13621 /* Returns true if REF is an array reference or a component reference
13622 to an array at the end of a structure.
13623 If this is the case, the array may be allocated larger
13624 than its upper bound implies. */
13627 array_at_struct_end_p (tree ref
)
13631 if (TREE_CODE (ref
) == ARRAY_REF
13632 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13634 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13635 ref
= TREE_OPERAND (ref
, 0);
13637 else if (TREE_CODE (ref
) == COMPONENT_REF
13638 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13639 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13643 if (TREE_CODE (ref
) == STRING_CST
)
13646 tree ref_to_array
= ref
;
13647 while (handled_component_p (ref
))
13649 /* If the reference chain contains a component reference to a
13650 non-union type and there follows another field the reference
13651 is not at the end of a structure. */
13652 if (TREE_CODE (ref
) == COMPONENT_REF
)
13654 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13656 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13657 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13658 nextf
= DECL_CHAIN (nextf
);
13663 /* If we have a multi-dimensional array we do not consider
13664 a non-innermost dimension as flex array if the whole
13665 multi-dimensional array is at struct end.
13666 Same for an array of aggregates with a trailing array
13668 else if (TREE_CODE (ref
) == ARRAY_REF
)
13670 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13672 /* If we view an underlying object as sth else then what we
13673 gathered up to now is what we have to rely on. */
13674 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13677 gcc_unreachable ();
13679 ref
= TREE_OPERAND (ref
, 0);
13682 /* The array now is at struct end. Treat flexible arrays as
13683 always subject to extend, even into just padding constrained by
13684 an underlying decl. */
13685 if (! TYPE_SIZE (atype
)
13686 || ! TYPE_DOMAIN (atype
)
13687 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13690 if (TREE_CODE (ref
) == MEM_REF
13691 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13692 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13694 /* If the reference is based on a declared entity, the size of the array
13695 is constrained by its given domain. (Do not trust commons PR/69368). */
13697 && !(flag_unconstrained_commons
13698 && VAR_P (ref
) && DECL_COMMON (ref
))
13699 && DECL_SIZE_UNIT (ref
)
13700 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13702 /* Check whether the array domain covers all of the available
13705 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13706 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13707 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13709 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13712 /* If at least one extra element fits it is a flexarray. */
13713 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13714 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13716 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13717 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13726 /* Return a tree representing the offset, in bytes, of the field referenced
13727 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13730 component_ref_field_offset (tree exp
)
13732 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13733 tree field
= TREE_OPERAND (exp
, 1);
13734 location_t loc
= EXPR_LOCATION (exp
);
13736 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13737 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13739 if (aligned_offset
)
13741 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13742 sizetype from another type of the same width and signedness. */
13743 if (TREE_TYPE (aligned_offset
) != sizetype
)
13744 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13745 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13746 size_int (DECL_OFFSET_ALIGN (field
)
13750 /* Otherwise, take the offset from that of the field. Substitute
13751 any PLACEHOLDER_EXPR that we have. */
13753 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13756 /* Return the machine mode of T. For vectors, returns the mode of the
13757 inner type. The main use case is to feed the result to HONOR_NANS,
13758 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13761 element_mode (const_tree t
)
13765 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13767 return TYPE_MODE (t
);
13770 /* Vector types need to re-check the target flags each time we report
13771 the machine mode. We need to do this because attribute target can
13772 change the result of vector_mode_supported_p and have_regs_of_mode
13773 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13774 change on a per-function basis. */
13775 /* ??? Possibly a better solution is to run through all the types
13776 referenced by a function and re-compute the TYPE_MODE once, rather
13777 than make the TYPE_MODE macro call a function. */
13780 vector_type_mode (const_tree t
)
13784 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13786 mode
= t
->type_common
.mode
;
13787 if (VECTOR_MODE_P (mode
)
13788 && (!targetm
.vector_mode_supported_p (mode
)
13789 || !have_regs_of_mode
[mode
]))
13791 scalar_int_mode innermode
;
13793 /* For integers, try mapping it to a same-sized scalar mode. */
13794 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13796 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13797 * GET_MODE_BITSIZE (innermode
));
13798 scalar_int_mode mode
;
13799 if (int_mode_for_size (size
, 0).exists (&mode
)
13800 && have_regs_of_mode
[mode
])
13810 /* Verify that basic properties of T match TV and thus T can be a variant of
13811 TV. TV should be the more specified variant (i.e. the main variant). */
13814 verify_type_variant (const_tree t
, tree tv
)
13816 /* Type variant can differ by:
13818 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13819 ENCODE_QUAL_ADDR_SPACE.
13820 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13821 in this case some values may not be set in the variant types
13822 (see TYPE_COMPLETE_P checks).
13823 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13824 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13825 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13826 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13827 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13828 this is necessary to make it possible to merge types form different TUs
13829 - arrays, pointers and references may have TREE_TYPE that is a variant
13830 of TREE_TYPE of their main variants.
13831 - aggregates may have new TYPE_FIELDS list that list variants of
13832 the main variant TYPE_FIELDS.
13833 - vector types may differ by TYPE_VECTOR_OPAQUE
13836 /* Convenience macro for matching individual fields. */
13837 #define verify_variant_match(flag) \
13839 if (flag (tv) != flag (t)) \
13841 error ("type variant differs by %s", #flag); \
13847 /* tree_base checks. */
13849 verify_variant_match (TREE_CODE
);
13850 /* FIXME: Ada builds non-artificial variants of artificial types. */
13851 if (TYPE_ARTIFICIAL (tv
) && 0)
13852 verify_variant_match (TYPE_ARTIFICIAL
);
13853 if (POINTER_TYPE_P (tv
))
13854 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13855 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13856 verify_variant_match (TYPE_UNSIGNED
);
13857 verify_variant_match (TYPE_PACKED
);
13858 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13859 verify_variant_match (TYPE_REF_IS_RVALUE
);
13860 if (AGGREGATE_TYPE_P (t
))
13861 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13863 verify_variant_match (TYPE_SATURATING
);
13864 /* FIXME: This check trigger during libstdc++ build. */
13865 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13866 verify_variant_match (TYPE_FINAL_P
);
13868 /* tree_type_common checks. */
13870 if (COMPLETE_TYPE_P (t
))
13872 verify_variant_match (TYPE_MODE
);
13873 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13874 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13875 verify_variant_match (TYPE_SIZE
);
13876 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13877 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13878 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13880 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13881 TYPE_SIZE_UNIT (tv
), 0));
13882 error ("type variant has different %<TYPE_SIZE_UNIT%>");
13884 error ("type variant%'s %<TYPE_SIZE_UNIT%>");
13885 debug_tree (TYPE_SIZE_UNIT (tv
));
13886 error ("type%'s %<TYPE_SIZE_UNIT%>");
13887 debug_tree (TYPE_SIZE_UNIT (t
));
13891 verify_variant_match (TYPE_PRECISION
);
13892 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13893 if (RECORD_OR_UNION_TYPE_P (t
))
13894 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13895 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13896 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13897 /* During LTO we merge variant lists from diferent translation units
13898 that may differ BY TYPE_CONTEXT that in turn may point
13899 to TRANSLATION_UNIT_DECL.
13900 Ada also builds variants of types with different TYPE_CONTEXT. */
13901 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13902 verify_variant_match (TYPE_CONTEXT
);
13903 if (TREE_CODE (t
) == ARRAY_TYPE
|| TREE_CODE (t
) == INTEGER_TYPE
)
13904 verify_variant_match (TYPE_STRING_FLAG
);
13905 if (TREE_CODE (t
) == RECORD_TYPE
|| TREE_CODE (t
) == UNION_TYPE
)
13906 verify_variant_match (TYPE_CXX_ODR_P
);
13907 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13909 error ("type variant with %<TYPE_ALIAS_SET_KNOWN_P%>");
13914 /* tree_type_non_common checks. */
13916 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13917 and dangle the pointer from time to time. */
13918 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13919 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13920 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13922 error ("type variant has different %<TYPE_VFIELD%>");
13926 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13927 || TREE_CODE (t
) == INTEGER_TYPE
13928 || TREE_CODE (t
) == BOOLEAN_TYPE
13929 || TREE_CODE (t
) == REAL_TYPE
13930 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13932 verify_variant_match (TYPE_MAX_VALUE
);
13933 verify_variant_match (TYPE_MIN_VALUE
);
13935 if (TREE_CODE (t
) == METHOD_TYPE
)
13936 verify_variant_match (TYPE_METHOD_BASETYPE
);
13937 if (TREE_CODE (t
) == OFFSET_TYPE
)
13938 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13939 if (TREE_CODE (t
) == ARRAY_TYPE
)
13940 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13941 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13942 or even type's main variant. This is needed to make bootstrap pass
13943 and the bug seems new in GCC 5.
13944 C++ FE should be updated to make this consistent and we should check
13945 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13946 is a match with main variant.
13948 Also disable the check for Java for now because of parser hack that builds
13949 first an dummy BINFO and then sometimes replace it by real BINFO in some
13951 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13952 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13953 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13954 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13955 at LTO time only. */
13956 && (in_lto_p
&& odr_type_p (t
)))
13958 error ("type variant has different %<TYPE_BINFO%>");
13960 error ("type variant%'s %<TYPE_BINFO%>");
13961 debug_tree (TYPE_BINFO (tv
));
13962 error ("type%'s %<TYPE_BINFO%>");
13963 debug_tree (TYPE_BINFO (t
));
13967 /* Check various uses of TYPE_VALUES_RAW. */
13968 if (TREE_CODE (t
) == ENUMERAL_TYPE
13969 && TYPE_VALUES (t
))
13970 verify_variant_match (TYPE_VALUES
);
13971 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13972 verify_variant_match (TYPE_DOMAIN
);
13973 /* Permit incomplete variants of complete type. While FEs may complete
13974 all variants, this does not happen for C++ templates in all cases. */
13975 else if (RECORD_OR_UNION_TYPE_P (t
)
13976 && COMPLETE_TYPE_P (t
)
13977 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13981 /* Fortran builds qualified variants as new records with items of
13982 qualified type. Verify that they looks same. */
13983 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13985 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13986 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13987 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13988 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13989 /* FIXME: gfc_nonrestricted_type builds all types as variants
13990 with exception of pointer types. It deeply copies the type
13991 which means that we may end up with a variant type
13992 referring non-variant pointer. We may change it to
13993 produce types as variants, too, like
13994 objc_get_protocol_qualified_type does. */
13995 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13996 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13997 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
14001 error ("type variant has different %<TYPE_FIELDS%>");
14003 error ("first mismatch is field");
14005 error ("and field");
14010 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
14011 verify_variant_match (TYPE_ARG_TYPES
);
14012 /* For C++ the qualified variant of array type is really an array type
14013 of qualified TREE_TYPE.
14014 objc builds variants of pointer where pointer to type is a variant, too
14015 in objc_get_protocol_qualified_type. */
14016 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
14017 && ((TREE_CODE (t
) != ARRAY_TYPE
14018 && !POINTER_TYPE_P (t
))
14019 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
14020 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
14022 error ("type variant has different %<TREE_TYPE%>");
14024 error ("type variant%'s %<TREE_TYPE%>");
14025 debug_tree (TREE_TYPE (tv
));
14026 error ("type%'s %<TREE_TYPE%>");
14027 debug_tree (TREE_TYPE (t
));
14030 if (type_with_alias_set_p (t
)
14031 && !gimple_canonical_types_compatible_p (t
, tv
, false))
14033 error ("type is not compatible with its variant");
14035 error ("type variant%'s %<TREE_TYPE%>");
14036 debug_tree (TREE_TYPE (tv
));
14037 error ("type%'s %<TREE_TYPE%>");
14038 debug_tree (TREE_TYPE (t
));
14042 #undef verify_variant_match
14046 /* The TYPE_CANONICAL merging machinery. It should closely resemble
14047 the middle-end types_compatible_p function. It needs to avoid
14048 claiming types are different for types that should be treated
14049 the same with respect to TBAA. Canonical types are also used
14050 for IL consistency checks via the useless_type_conversion_p
14051 predicate which does not handle all type kinds itself but falls
14052 back to pointer-comparison of TYPE_CANONICAL for aggregates
14055 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
14056 type calculation because we need to allow inter-operability between signed
14057 and unsigned variants. */
14060 type_with_interoperable_signedness (const_tree type
)
14062 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
14063 signed char and unsigned char. Similarly fortran FE builds
14064 C_SIZE_T as signed type, while C defines it unsigned. */
14066 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
14068 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
14069 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
14072 /* Return true iff T1 and T2 are structurally identical for what
14074 This function is used both by lto.c canonical type merging and by the
14075 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
14076 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
14077 only for LTO because only in these cases TYPE_CANONICAL equivalence
14078 correspond to one defined by gimple_canonical_types_compatible_p. */
14081 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
14082 bool trust_type_canonical
)
14084 /* Type variants should be same as the main variant. When not doing sanity
14085 checking to verify this fact, go to main variants and save some work. */
14086 if (trust_type_canonical
)
14088 t1
= TYPE_MAIN_VARIANT (t1
);
14089 t2
= TYPE_MAIN_VARIANT (t2
);
14092 /* Check first for the obvious case of pointer identity. */
14096 /* Check that we have two types to compare. */
14097 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
14100 /* We consider complete types always compatible with incomplete type.
14101 This does not make sense for canonical type calculation and thus we
14102 need to ensure that we are never called on it.
14104 FIXME: For more correctness the function probably should have three modes
14105 1) mode assuming that types are complete mathcing their structure
14106 2) mode allowing incomplete types but producing equivalence classes
14107 and thus ignoring all info from complete types
14108 3) mode allowing incomplete types to match complete but checking
14109 compatibility between complete types.
14111 1 and 2 can be used for canonical type calculation. 3 is the real
14112 definition of type compatibility that can be used i.e. for warnings during
14113 declaration merging. */
14115 gcc_assert (!trust_type_canonical
14116 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14118 /* If the types have been previously registered and found equal
14121 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14122 && trust_type_canonical
)
14124 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14125 they are always NULL, but they are set to non-NULL for types
14126 constructed by build_pointer_type and variants. In this case the
14127 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14128 all pointers are considered equal. Be sure to not return false
14130 gcc_checking_assert (canonical_type_used_p (t1
)
14131 && canonical_type_used_p (t2
));
14132 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14135 /* For types where we do ODR based TBAA the canonical type is always
14136 set correctly, so we know that types are different if their
14137 canonical types does not match. */
14138 if (trust_type_canonical
14139 && (odr_type_p (t1
) && odr_based_tbaa_p (t1
))
14140 != (odr_type_p (t2
) && odr_based_tbaa_p (t2
)))
14143 /* Can't be the same type if the types don't have the same code. */
14144 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14145 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14148 /* Qualifiers do not matter for canonical type comparison purposes. */
14150 /* Void types and nullptr types are always the same. */
14151 if (TREE_CODE (t1
) == VOID_TYPE
14152 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14155 /* Can't be the same type if they have different mode. */
14156 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14159 /* Non-aggregate types can be handled cheaply. */
14160 if (INTEGRAL_TYPE_P (t1
)
14161 || SCALAR_FLOAT_TYPE_P (t1
)
14162 || FIXED_POINT_TYPE_P (t1
)
14163 || TREE_CODE (t1
) == VECTOR_TYPE
14164 || TREE_CODE (t1
) == COMPLEX_TYPE
14165 || TREE_CODE (t1
) == OFFSET_TYPE
14166 || POINTER_TYPE_P (t1
))
14168 /* Can't be the same type if they have different recision. */
14169 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14172 /* In some cases the signed and unsigned types are required to be
14174 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14175 && !type_with_interoperable_signedness (t1
))
14178 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14179 interoperable with "signed char". Unless all frontends are revisited
14180 to agree on these types, we must ignore the flag completely. */
14182 /* Fortran standard define C_PTR type that is compatible with every
14183 C pointer. For this reason we need to glob all pointers into one.
14184 Still pointers in different address spaces are not compatible. */
14185 if (POINTER_TYPE_P (t1
))
14187 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14188 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14192 /* Tail-recurse to components. */
14193 if (TREE_CODE (t1
) == VECTOR_TYPE
14194 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14195 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14197 trust_type_canonical
);
14202 /* Do type-specific comparisons. */
14203 switch (TREE_CODE (t1
))
14206 /* Array types are the same if the element types are the same and
14207 the number of elements are the same. */
14208 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14209 trust_type_canonical
)
14210 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14211 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14212 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14216 tree i1
= TYPE_DOMAIN (t1
);
14217 tree i2
= TYPE_DOMAIN (t2
);
14219 /* For an incomplete external array, the type domain can be
14220 NULL_TREE. Check this condition also. */
14221 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14223 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14227 tree min1
= TYPE_MIN_VALUE (i1
);
14228 tree min2
= TYPE_MIN_VALUE (i2
);
14229 tree max1
= TYPE_MAX_VALUE (i1
);
14230 tree max2
= TYPE_MAX_VALUE (i2
);
14232 /* The minimum/maximum values have to be the same. */
14235 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14236 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14237 || operand_equal_p (min1
, min2
, 0))))
14240 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14241 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14242 || operand_equal_p (max1
, max2
, 0)))))
14250 case FUNCTION_TYPE
:
14251 /* Function types are the same if the return type and arguments types
14253 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14254 trust_type_canonical
))
14257 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14261 tree parms1
, parms2
;
14263 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14265 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14267 if (!gimple_canonical_types_compatible_p
14268 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14269 trust_type_canonical
))
14273 if (parms1
|| parms2
)
14281 case QUAL_UNION_TYPE
:
14285 /* Don't try to compare variants of an incomplete type, before
14286 TYPE_FIELDS has been copied around. */
14287 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14291 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14294 /* For aggregate types, all the fields must be the same. */
14295 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14297 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14299 /* Skip non-fields and zero-sized fields. */
14300 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14302 && integer_zerop (DECL_SIZE (f1
)))))
14303 f1
= TREE_CHAIN (f1
);
14304 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14306 && integer_zerop (DECL_SIZE (f2
)))))
14307 f2
= TREE_CHAIN (f2
);
14310 /* The fields must have the same name, offset and type. */
14311 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14312 || !gimple_compare_field_offset (f1
, f2
)
14313 || !gimple_canonical_types_compatible_p
14314 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14315 trust_type_canonical
))
14319 /* If one aggregate has more fields than the other, they
14320 are not the same. */
14328 /* Consider all types with language specific trees in them mutually
14329 compatible. This is executed only from verify_type and false
14330 positives can be tolerated. */
14331 gcc_assert (!in_lto_p
);
14336 /* Verify type T. */
14339 verify_type (const_tree t
)
14341 bool error_found
= false;
14342 tree mv
= TYPE_MAIN_VARIANT (t
);
14345 error ("main variant is not defined");
14346 error_found
= true;
14348 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14350 error ("%<TYPE_MAIN_VARIANT%> has different %<TYPE_MAIN_VARIANT%>");
14352 error_found
= true;
14354 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14355 error_found
= true;
14357 tree ct
= TYPE_CANONICAL (t
);
14360 else if (TYPE_CANONICAL (t
) != ct
)
14362 error ("%<TYPE_CANONICAL%> has different %<TYPE_CANONICAL%>");
14364 error_found
= true;
14366 /* Method and function types cannot be used to address memory and thus
14367 TYPE_CANONICAL really matters only for determining useless conversions.
14369 FIXME: C++ FE produce declarations of builtin functions that are not
14370 compatible with main variants. */
14371 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14374 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14375 with variably sized arrays because their sizes possibly
14376 gimplified to different variables. */
14377 && !variably_modified_type_p (ct
, NULL
)
14378 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14379 && COMPLETE_TYPE_P (t
))
14381 error ("%<TYPE_CANONICAL%> is not compatible");
14383 error_found
= true;
14386 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14387 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14389 error ("%<TYPE_MODE%> of %<TYPE_CANONICAL%> is not compatible");
14391 error_found
= true;
14393 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14395 error ("%<TYPE_CANONICAL%> of main variant is not main variant");
14397 debug_tree (TYPE_MAIN_VARIANT (ct
));
14398 error_found
= true;
14402 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14403 if (RECORD_OR_UNION_TYPE_P (t
))
14405 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14406 and danagle the pointer from time to time. */
14407 if (TYPE_VFIELD (t
)
14408 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14409 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14411 error ("%<TYPE_VFIELD%> is not %<FIELD_DECL%> nor %<TREE_LIST%>");
14412 debug_tree (TYPE_VFIELD (t
));
14413 error_found
= true;
14416 else if (TREE_CODE (t
) == POINTER_TYPE
)
14418 if (TYPE_NEXT_PTR_TO (t
)
14419 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14421 error ("%<TYPE_NEXT_PTR_TO%> is not %<POINTER_TYPE%>");
14422 debug_tree (TYPE_NEXT_PTR_TO (t
));
14423 error_found
= true;
14426 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14428 if (TYPE_NEXT_REF_TO (t
)
14429 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14431 error ("%<TYPE_NEXT_REF_TO%> is not %<REFERENCE_TYPE%>");
14432 debug_tree (TYPE_NEXT_REF_TO (t
));
14433 error_found
= true;
14436 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14437 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14439 /* FIXME: The following check should pass:
14440 useless_type_conversion_p (const_cast <tree> (t),
14441 TREE_TYPE (TYPE_MIN_VALUE (t))
14442 but does not for C sizetypes in LTO. */
14445 /* Check various uses of TYPE_MAXVAL_RAW. */
14446 if (RECORD_OR_UNION_TYPE_P (t
))
14448 if (!TYPE_BINFO (t
))
14450 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14452 error ("%<TYPE_BINFO%> is not %<TREE_BINFO%>");
14453 debug_tree (TYPE_BINFO (t
));
14454 error_found
= true;
14456 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14458 error ("%<TYPE_BINFO%> type is not %<TYPE_MAIN_VARIANT%>");
14459 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14460 error_found
= true;
14463 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14465 if (TYPE_METHOD_BASETYPE (t
)
14466 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14467 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14469 error ("%<TYPE_METHOD_BASETYPE%> is not record nor union");
14470 debug_tree (TYPE_METHOD_BASETYPE (t
));
14471 error_found
= true;
14474 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14476 if (TYPE_OFFSET_BASETYPE (t
)
14477 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14478 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14480 error ("%<TYPE_OFFSET_BASETYPE%> is not record nor union");
14481 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14482 error_found
= true;
14485 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14486 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14488 /* FIXME: The following check should pass:
14489 useless_type_conversion_p (const_cast <tree> (t),
14490 TREE_TYPE (TYPE_MAX_VALUE (t))
14491 but does not for C sizetypes in LTO. */
14493 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14495 if (TYPE_ARRAY_MAX_SIZE (t
)
14496 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14498 error ("%<TYPE_ARRAY_MAX_SIZE%> not %<INTEGER_CST%>");
14499 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14500 error_found
= true;
14503 else if (TYPE_MAX_VALUE_RAW (t
))
14505 error ("%<TYPE_MAX_VALUE_RAW%> non-NULL");
14506 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14507 error_found
= true;
14510 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14512 error ("%<TYPE_LANG_SLOT_1 (binfo)%> field is non-NULL");
14513 debug_tree (TYPE_LANG_SLOT_1 (t
));
14514 error_found
= true;
14517 /* Check various uses of TYPE_VALUES_RAW. */
14518 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14519 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14521 tree value
= TREE_VALUE (l
);
14522 tree name
= TREE_PURPOSE (l
);
14524 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14525 CONST_DECL of ENUMERAL TYPE. */
14526 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14528 error ("enum value is not %<CONST_DECL%> or %<INTEGER_CST%>");
14529 debug_tree (value
);
14531 error_found
= true;
14533 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14534 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14536 error ("enum value type is not %<INTEGER_TYPE%> nor convertible "
14538 debug_tree (value
);
14540 error_found
= true;
14542 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14544 error ("enum value name is not %<IDENTIFIER_NODE%>");
14545 debug_tree (value
);
14547 error_found
= true;
14550 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14552 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14554 error ("array %<TYPE_DOMAIN%> is not integer type");
14555 debug_tree (TYPE_DOMAIN (t
));
14556 error_found
= true;
14559 else if (RECORD_OR_UNION_TYPE_P (t
))
14561 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14563 error ("%<TYPE_FIELDS%> defined in incomplete type");
14564 error_found
= true;
14566 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14568 /* TODO: verify properties of decls. */
14569 if (TREE_CODE (fld
) == FIELD_DECL
)
14571 else if (TREE_CODE (fld
) == TYPE_DECL
)
14573 else if (TREE_CODE (fld
) == CONST_DECL
)
14575 else if (VAR_P (fld
))
14577 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14579 else if (TREE_CODE (fld
) == USING_DECL
)
14581 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14585 error ("wrong tree in %<TYPE_FIELDS%> list");
14587 error_found
= true;
14591 else if (TREE_CODE (t
) == INTEGER_TYPE
14592 || TREE_CODE (t
) == BOOLEAN_TYPE
14593 || TREE_CODE (t
) == OFFSET_TYPE
14594 || TREE_CODE (t
) == REFERENCE_TYPE
14595 || TREE_CODE (t
) == NULLPTR_TYPE
14596 || TREE_CODE (t
) == POINTER_TYPE
)
14598 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14600 error ("%<TYPE_CACHED_VALUES_P%> is %i while %<TYPE_CACHED_VALUES%> "
14602 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14603 error_found
= true;
14605 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14607 error ("%<TYPE_CACHED_VALUES%> is not %<TREE_VEC%>");
14608 debug_tree (TYPE_CACHED_VALUES (t
));
14609 error_found
= true;
14611 /* Verify just enough of cache to ensure that no one copied it to new type.
14612 All copying should go by copy_node that should clear it. */
14613 else if (TYPE_CACHED_VALUES_P (t
))
14616 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14617 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14618 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14620 error ("wrong %<TYPE_CACHED_VALUES%> entry");
14621 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14622 error_found
= true;
14627 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14628 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14630 /* C++ FE uses TREE_PURPOSE to store initial values. */
14631 if (TREE_PURPOSE (l
) && in_lto_p
)
14633 error ("%<TREE_PURPOSE%> is non-NULL in %<TYPE_ARG_TYPES%> list");
14635 error_found
= true;
14637 if (!TYPE_P (TREE_VALUE (l
)))
14639 error ("wrong entry in %<TYPE_ARG_TYPES%> list");
14641 error_found
= true;
14644 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14646 error ("%<TYPE_VALUES_RAW%> field is non-NULL");
14647 debug_tree (TYPE_VALUES_RAW (t
));
14648 error_found
= true;
14650 if (TREE_CODE (t
) != INTEGER_TYPE
14651 && TREE_CODE (t
) != BOOLEAN_TYPE
14652 && TREE_CODE (t
) != OFFSET_TYPE
14653 && TREE_CODE (t
) != REFERENCE_TYPE
14654 && TREE_CODE (t
) != NULLPTR_TYPE
14655 && TREE_CODE (t
) != POINTER_TYPE
14656 && TYPE_CACHED_VALUES_P (t
))
14658 error ("%<TYPE_CACHED_VALUES_P%> is set while it should not be");
14659 error_found
= true;
14662 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14663 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14665 if (TREE_CODE (t
) == METHOD_TYPE
14666 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14668 error ("%<TYPE_METHOD_BASETYPE%> is not main variant");
14669 error_found
= true;
14674 debug_tree (const_cast <tree
> (t
));
14675 internal_error ("%qs failed", __func__
);
14680 /* Return 1 if ARG interpreted as signed in its precision is known to be
14681 always positive or 2 if ARG is known to be always negative, or 3 if
14682 ARG may be positive or negative. */
14685 get_range_pos_neg (tree arg
)
14687 if (arg
== error_mark_node
)
14690 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14692 if (TREE_CODE (arg
) == INTEGER_CST
)
14694 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14700 while (CONVERT_EXPR_P (arg
)
14701 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14702 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14704 arg
= TREE_OPERAND (arg
, 0);
14705 /* Narrower value zero extended into wider type
14706 will always result in positive values. */
14707 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14708 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14710 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14715 if (TREE_CODE (arg
) != SSA_NAME
)
14717 wide_int arg_min
, arg_max
;
14718 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14720 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14721 if (is_gimple_assign (g
)
14722 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14724 tree t
= gimple_assign_rhs1 (g
);
14725 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14726 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14728 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14729 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14731 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14740 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14742 /* For unsigned values, the "positive" range comes
14743 below the "negative" range. */
14744 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14746 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14751 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14753 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14762 /* Return true if ARG is marked with the nonnull attribute in the
14763 current function signature. */
14766 nonnull_arg_p (const_tree arg
)
14768 tree t
, attrs
, fntype
;
14769 unsigned HOST_WIDE_INT arg_num
;
14771 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14772 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14773 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14775 /* The static chain decl is always non null. */
14776 if (arg
== cfun
->static_chain_decl
)
14779 /* THIS argument of method is always non-NULL. */
14780 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14781 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14782 && flag_delete_null_pointer_checks
)
14785 /* Values passed by reference are always non-NULL. */
14786 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14787 && flag_delete_null_pointer_checks
)
14790 fntype
= TREE_TYPE (cfun
->decl
);
14791 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14793 attrs
= lookup_attribute ("nonnull", attrs
);
14795 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14796 if (attrs
== NULL_TREE
)
14799 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14800 if (TREE_VALUE (attrs
) == NULL_TREE
)
14803 /* Get the position number for ARG in the function signature. */
14804 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14806 t
= DECL_CHAIN (t
), arg_num
++)
14812 gcc_assert (t
== arg
);
14814 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14815 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14817 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14825 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14829 set_block (location_t loc
, tree block
)
14831 location_t pure_loc
= get_pure_location (loc
);
14832 source_range src_range
= get_range_from_loc (line_table
, loc
);
14833 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14837 set_source_range (tree expr
, location_t start
, location_t finish
)
14839 source_range src_range
;
14840 src_range
.m_start
= start
;
14841 src_range
.m_finish
= finish
;
14842 return set_source_range (expr
, src_range
);
14846 set_source_range (tree expr
, source_range src_range
)
14848 if (!EXPR_P (expr
))
14849 return UNKNOWN_LOCATION
;
14851 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14852 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14856 SET_EXPR_LOCATION (expr
, adhoc
);
14860 /* Return EXPR, potentially wrapped with a node expression LOC,
14861 if !CAN_HAVE_LOCATION_P (expr).
14863 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14864 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14866 Wrapper nodes can be identified using location_wrapper_p. */
14869 maybe_wrap_with_location (tree expr
, location_t loc
)
14873 if (loc
== UNKNOWN_LOCATION
)
14875 if (CAN_HAVE_LOCATION_P (expr
))
14877 /* We should only be adding wrappers for constants and for decls,
14878 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14879 gcc_assert (CONSTANT_CLASS_P (expr
)
14881 || EXCEPTIONAL_CLASS_P (expr
));
14883 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14884 any impact of the wrapper nodes. */
14885 if (EXCEPTIONAL_CLASS_P (expr
))
14888 /* If any auto_suppress_location_wrappers are active, don't create
14890 if (suppress_location_wrappers
> 0)
14894 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14895 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14896 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14897 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14898 /* Mark this node as being a wrapper. */
14899 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14903 int suppress_location_wrappers
;
14905 /* Return the name of combined function FN, for debugging purposes. */
14908 combined_fn_name (combined_fn fn
)
14910 if (builtin_fn_p (fn
))
14912 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14913 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14916 return internal_fn_name (as_internal_fn (fn
));
14919 /* Return a bitmap with a bit set corresponding to each argument in
14920 a function call type FNTYPE declared with attribute nonnull,
14921 or null if none of the function's argument are nonnull. The caller
14922 must free the bitmap. */
14925 get_nonnull_args (const_tree fntype
)
14927 if (fntype
== NULL_TREE
)
14930 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14934 bitmap argmap
= NULL
;
14936 /* A function declaration can specify multiple attribute nonnull,
14937 each with zero or more arguments. The loop below creates a bitmap
14938 representing a union of all the arguments. An empty (but non-null)
14939 bitmap means that all arguments have been declaraed nonnull. */
14940 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14942 attrs
= lookup_attribute ("nonnull", attrs
);
14947 argmap
= BITMAP_ALLOC (NULL
);
14949 if (!TREE_VALUE (attrs
))
14951 /* Clear the bitmap in case a previous attribute nonnull
14952 set it and this one overrides it for all arguments. */
14953 bitmap_clear (argmap
);
14957 /* Iterate over the indices of the format arguments declared nonnull
14958 and set a bit for each. */
14959 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14961 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14962 bitmap_set_bit (argmap
, val
);
14969 /* Returns true if TYPE is a type where it and all of its subobjects
14970 (recursively) are of structure, union, or array type. */
14973 default_is_empty_type (tree type
)
14975 if (RECORD_OR_UNION_TYPE_P (type
))
14977 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14978 if (TREE_CODE (field
) == FIELD_DECL
14979 && !DECL_PADDING_P (field
)
14980 && !default_is_empty_type (TREE_TYPE (field
)))
14984 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14985 return (integer_minus_onep (array_type_nelts (type
))
14986 || TYPE_DOMAIN (type
) == NULL_TREE
14987 || default_is_empty_type (TREE_TYPE (type
)));
14991 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14992 that shouldn't be passed via stack. */
14995 default_is_empty_record (const_tree type
)
14997 if (!abi_version_at_least (12))
15000 if (type
== error_mark_node
)
15003 if (TREE_ADDRESSABLE (type
))
15006 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
15009 /* Like int_size_in_bytes, but handle empty records specially. */
15012 arg_int_size_in_bytes (const_tree type
)
15014 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
15017 /* Like size_in_bytes, but handle empty records specially. */
15020 arg_size_in_bytes (const_tree type
)
15022 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
15025 /* Return true if an expression with CODE has to have the same result type as
15026 its first operand. */
15029 expr_type_first_operand_type_p (tree_code code
)
15042 case TRUNC_DIV_EXPR
:
15043 case CEIL_DIV_EXPR
:
15044 case FLOOR_DIV_EXPR
:
15045 case ROUND_DIV_EXPR
:
15046 case TRUNC_MOD_EXPR
:
15047 case CEIL_MOD_EXPR
:
15048 case FLOOR_MOD_EXPR
:
15049 case ROUND_MOD_EXPR
:
15051 case EXACT_DIV_EXPR
:
15069 /* Return a typenode for the "standard" C type with a given name. */
15071 get_typenode_from_name (const char *name
)
15073 if (name
== NULL
|| *name
== '\0')
15076 if (strcmp (name
, "char") == 0)
15077 return char_type_node
;
15078 if (strcmp (name
, "unsigned char") == 0)
15079 return unsigned_char_type_node
;
15080 if (strcmp (name
, "signed char") == 0)
15081 return signed_char_type_node
;
15083 if (strcmp (name
, "short int") == 0)
15084 return short_integer_type_node
;
15085 if (strcmp (name
, "short unsigned int") == 0)
15086 return short_unsigned_type_node
;
15088 if (strcmp (name
, "int") == 0)
15089 return integer_type_node
;
15090 if (strcmp (name
, "unsigned int") == 0)
15091 return unsigned_type_node
;
15093 if (strcmp (name
, "long int") == 0)
15094 return long_integer_type_node
;
15095 if (strcmp (name
, "long unsigned int") == 0)
15096 return long_unsigned_type_node
;
15098 if (strcmp (name
, "long long int") == 0)
15099 return long_long_integer_type_node
;
15100 if (strcmp (name
, "long long unsigned int") == 0)
15101 return long_long_unsigned_type_node
;
15103 gcc_unreachable ();
15106 /* List of pointer types used to declare builtins before we have seen their
15109 Keep the size up to date in tree.h ! */
15110 const builtin_structptr_type builtin_structptr_types
[6] =
15112 { fileptr_type_node
, ptr_type_node
, "FILE" },
15113 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15114 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15115 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15116 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15117 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15120 /* Return the maximum object size. */
15123 max_object_size (void)
15125 /* To do: Make this a configurable parameter. */
15126 return TYPE_MAX_VALUE (ptrdiff_type_node
);
15131 namespace selftest
{
15133 /* Selftests for tree. */
15135 /* Verify that integer constants are sane. */
15138 test_integer_constants ()
15140 ASSERT_TRUE (integer_type_node
!= NULL
);
15141 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15143 tree type
= integer_type_node
;
15145 tree zero
= build_zero_cst (type
);
15146 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15147 ASSERT_EQ (type
, TREE_TYPE (zero
));
15149 tree one
= build_int_cst (type
, 1);
15150 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15151 ASSERT_EQ (type
, TREE_TYPE (zero
));
15154 /* Verify identifiers. */
15157 test_identifiers ()
15159 tree identifier
= get_identifier ("foo");
15160 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15161 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15164 /* Verify LABEL_DECL. */
15169 tree identifier
= get_identifier ("err");
15170 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15171 identifier
, void_type_node
);
15172 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15173 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15176 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15177 are given by VALS. */
15180 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15182 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15183 tree_vector_builder
builder (type
, vals
.length (), 1);
15184 builder
.splice (vals
);
15185 return builder
.build ();
15188 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15191 check_vector_cst (vec
<tree
> expected
, tree actual
)
15193 ASSERT_KNOWN_EQ (expected
.length (),
15194 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15195 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15196 ASSERT_EQ (wi::to_wide (expected
[i
]),
15197 wi::to_wide (vector_cst_elt (actual
, i
)));
15200 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15201 and that its elements match EXPECTED. */
15204 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15205 unsigned int npatterns
)
15207 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15208 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15209 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15210 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15211 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15212 check_vector_cst (expected
, actual
);
15215 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15216 and NPATTERNS background elements, and that its elements match
15220 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15221 unsigned int npatterns
)
15223 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15224 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15225 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15226 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15227 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15228 check_vector_cst (expected
, actual
);
15231 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15232 and that its elements match EXPECTED. */
15235 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15236 unsigned int npatterns
)
15238 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15239 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15240 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15241 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15242 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15243 check_vector_cst (expected
, actual
);
15246 /* Test the creation of VECTOR_CSTs. */
15249 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15251 auto_vec
<tree
, 8> elements (8);
15252 elements
.quick_grow (8);
15253 tree element_type
= build_nonstandard_integer_type (16, true);
15254 tree vector_type
= build_vector_type (element_type
, 8);
15256 /* Test a simple linear series with a base of 0 and a step of 1:
15257 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15258 for (unsigned int i
= 0; i
< 8; ++i
)
15259 elements
[i
] = build_int_cst (element_type
, i
);
15260 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15261 check_vector_cst_stepped (elements
, vector
, 1);
15263 /* Try the same with the first element replaced by 100:
15264 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15265 elements
[0] = build_int_cst (element_type
, 100);
15266 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15267 check_vector_cst_stepped (elements
, vector
, 1);
15269 /* Try a series that wraps around.
15270 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15271 for (unsigned int i
= 1; i
< 8; ++i
)
15272 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15273 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15274 check_vector_cst_stepped (elements
, vector
, 1);
15276 /* Try a downward series:
15277 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15278 for (unsigned int i
= 1; i
< 8; ++i
)
15279 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15280 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15281 check_vector_cst_stepped (elements
, vector
, 1);
15283 /* Try two interleaved series with different bases and steps:
15284 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15285 elements
[1] = build_int_cst (element_type
, 53);
15286 for (unsigned int i
= 2; i
< 8; i
+= 2)
15288 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15289 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15291 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15292 check_vector_cst_stepped (elements
, vector
, 2);
15294 /* Try a duplicated value:
15295 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15296 for (unsigned int i
= 1; i
< 8; ++i
)
15297 elements
[i
] = elements
[0];
15298 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15299 check_vector_cst_duplicate (elements
, vector
, 1);
15301 /* Try an interleaved duplicated value:
15302 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15303 elements
[1] = build_int_cst (element_type
, 55);
15304 for (unsigned int i
= 2; i
< 8; ++i
)
15305 elements
[i
] = elements
[i
- 2];
15306 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15307 check_vector_cst_duplicate (elements
, vector
, 2);
15309 /* Try a duplicated value with 2 exceptions
15310 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15311 elements
[0] = build_int_cst (element_type
, 41);
15312 elements
[1] = build_int_cst (element_type
, 97);
15313 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15314 check_vector_cst_fill (elements
, vector
, 2);
15316 /* Try with and without a step
15317 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15318 for (unsigned int i
= 3; i
< 8; i
+= 2)
15319 elements
[i
] = build_int_cst (element_type
, i
* 7);
15320 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15321 check_vector_cst_stepped (elements
, vector
, 2);
15323 /* Try a fully-general constant:
15324 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15325 elements
[5] = build_int_cst (element_type
, 9990);
15326 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15327 check_vector_cst_fill (elements
, vector
, 4);
15330 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15331 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15332 modifying its argument in-place. */
15335 check_strip_nops (tree node
, tree expected
)
15338 ASSERT_EQ (expected
, node
);
15341 /* Verify location wrappers. */
15344 test_location_wrappers ()
15346 location_t loc
= BUILTINS_LOCATION
;
15348 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15350 /* Wrapping a constant. */
15351 tree int_cst
= build_int_cst (integer_type_node
, 42);
15352 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15353 ASSERT_FALSE (location_wrapper_p (int_cst
));
15355 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15356 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15357 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15358 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15360 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15361 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15363 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15364 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15365 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15366 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15368 /* Wrapping a STRING_CST. */
15369 tree string_cst
= build_string (4, "foo");
15370 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15371 ASSERT_FALSE (location_wrapper_p (string_cst
));
15373 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15374 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15375 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15376 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15377 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15380 /* Wrapping a variable. */
15381 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15382 get_identifier ("some_int_var"),
15383 integer_type_node
);
15384 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15385 ASSERT_FALSE (location_wrapper_p (int_var
));
15387 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15388 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15389 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15390 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15392 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15394 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15395 ASSERT_FALSE (location_wrapper_p (r_cast
));
15396 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15398 /* Verify that STRIP_NOPS removes wrappers. */
15399 check_strip_nops (wrapped_int_cst
, int_cst
);
15400 check_strip_nops (wrapped_string_cst
, string_cst
);
15401 check_strip_nops (wrapped_int_var
, int_var
);
15404 /* Test various tree predicates. Verify that location wrappers don't
15405 affect the results. */
15410 /* Build various constants and wrappers around them. */
15412 location_t loc
= BUILTINS_LOCATION
;
15414 tree i_0
= build_int_cst (integer_type_node
, 0);
15415 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15417 tree i_1
= build_int_cst (integer_type_node
, 1);
15418 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15420 tree i_m1
= build_int_cst (integer_type_node
, -1);
15421 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15423 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15424 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15425 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15426 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15427 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15428 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15430 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15431 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15432 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15434 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15435 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15436 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15438 /* TODO: vector constants. */
15440 /* Test integer_onep. */
15441 ASSERT_FALSE (integer_onep (i_0
));
15442 ASSERT_FALSE (integer_onep (wr_i_0
));
15443 ASSERT_TRUE (integer_onep (i_1
));
15444 ASSERT_TRUE (integer_onep (wr_i_1
));
15445 ASSERT_FALSE (integer_onep (i_m1
));
15446 ASSERT_FALSE (integer_onep (wr_i_m1
));
15447 ASSERT_FALSE (integer_onep (f_0
));
15448 ASSERT_FALSE (integer_onep (wr_f_0
));
15449 ASSERT_FALSE (integer_onep (f_1
));
15450 ASSERT_FALSE (integer_onep (wr_f_1
));
15451 ASSERT_FALSE (integer_onep (f_m1
));
15452 ASSERT_FALSE (integer_onep (wr_f_m1
));
15453 ASSERT_FALSE (integer_onep (c_i_0
));
15454 ASSERT_TRUE (integer_onep (c_i_1
));
15455 ASSERT_FALSE (integer_onep (c_i_m1
));
15456 ASSERT_FALSE (integer_onep (c_f_0
));
15457 ASSERT_FALSE (integer_onep (c_f_1
));
15458 ASSERT_FALSE (integer_onep (c_f_m1
));
15460 /* Test integer_zerop. */
15461 ASSERT_TRUE (integer_zerop (i_0
));
15462 ASSERT_TRUE (integer_zerop (wr_i_0
));
15463 ASSERT_FALSE (integer_zerop (i_1
));
15464 ASSERT_FALSE (integer_zerop (wr_i_1
));
15465 ASSERT_FALSE (integer_zerop (i_m1
));
15466 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15467 ASSERT_FALSE (integer_zerop (f_0
));
15468 ASSERT_FALSE (integer_zerop (wr_f_0
));
15469 ASSERT_FALSE (integer_zerop (f_1
));
15470 ASSERT_FALSE (integer_zerop (wr_f_1
));
15471 ASSERT_FALSE (integer_zerop (f_m1
));
15472 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15473 ASSERT_TRUE (integer_zerop (c_i_0
));
15474 ASSERT_FALSE (integer_zerop (c_i_1
));
15475 ASSERT_FALSE (integer_zerop (c_i_m1
));
15476 ASSERT_FALSE (integer_zerop (c_f_0
));
15477 ASSERT_FALSE (integer_zerop (c_f_1
));
15478 ASSERT_FALSE (integer_zerop (c_f_m1
));
15480 /* Test integer_all_onesp. */
15481 ASSERT_FALSE (integer_all_onesp (i_0
));
15482 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15483 ASSERT_FALSE (integer_all_onesp (i_1
));
15484 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15485 ASSERT_TRUE (integer_all_onesp (i_m1
));
15486 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15487 ASSERT_FALSE (integer_all_onesp (f_0
));
15488 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15489 ASSERT_FALSE (integer_all_onesp (f_1
));
15490 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15491 ASSERT_FALSE (integer_all_onesp (f_m1
));
15492 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15493 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15494 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15495 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15496 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15497 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15498 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15500 /* Test integer_minus_onep. */
15501 ASSERT_FALSE (integer_minus_onep (i_0
));
15502 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15503 ASSERT_FALSE (integer_minus_onep (i_1
));
15504 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15505 ASSERT_TRUE (integer_minus_onep (i_m1
));
15506 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15507 ASSERT_FALSE (integer_minus_onep (f_0
));
15508 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15509 ASSERT_FALSE (integer_minus_onep (f_1
));
15510 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15511 ASSERT_FALSE (integer_minus_onep (f_m1
));
15512 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15513 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15514 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15515 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15516 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15517 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15518 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15520 /* Test integer_each_onep. */
15521 ASSERT_FALSE (integer_each_onep (i_0
));
15522 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15523 ASSERT_TRUE (integer_each_onep (i_1
));
15524 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15525 ASSERT_FALSE (integer_each_onep (i_m1
));
15526 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15527 ASSERT_FALSE (integer_each_onep (f_0
));
15528 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15529 ASSERT_FALSE (integer_each_onep (f_1
));
15530 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15531 ASSERT_FALSE (integer_each_onep (f_m1
));
15532 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15533 ASSERT_FALSE (integer_each_onep (c_i_0
));
15534 ASSERT_FALSE (integer_each_onep (c_i_1
));
15535 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15536 ASSERT_FALSE (integer_each_onep (c_f_0
));
15537 ASSERT_FALSE (integer_each_onep (c_f_1
));
15538 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15540 /* Test integer_truep. */
15541 ASSERT_FALSE (integer_truep (i_0
));
15542 ASSERT_FALSE (integer_truep (wr_i_0
));
15543 ASSERT_TRUE (integer_truep (i_1
));
15544 ASSERT_TRUE (integer_truep (wr_i_1
));
15545 ASSERT_FALSE (integer_truep (i_m1
));
15546 ASSERT_FALSE (integer_truep (wr_i_m1
));
15547 ASSERT_FALSE (integer_truep (f_0
));
15548 ASSERT_FALSE (integer_truep (wr_f_0
));
15549 ASSERT_FALSE (integer_truep (f_1
));
15550 ASSERT_FALSE (integer_truep (wr_f_1
));
15551 ASSERT_FALSE (integer_truep (f_m1
));
15552 ASSERT_FALSE (integer_truep (wr_f_m1
));
15553 ASSERT_FALSE (integer_truep (c_i_0
));
15554 ASSERT_TRUE (integer_truep (c_i_1
));
15555 ASSERT_FALSE (integer_truep (c_i_m1
));
15556 ASSERT_FALSE (integer_truep (c_f_0
));
15557 ASSERT_FALSE (integer_truep (c_f_1
));
15558 ASSERT_FALSE (integer_truep (c_f_m1
));
15560 /* Test integer_nonzerop. */
15561 ASSERT_FALSE (integer_nonzerop (i_0
));
15562 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15563 ASSERT_TRUE (integer_nonzerop (i_1
));
15564 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15565 ASSERT_TRUE (integer_nonzerop (i_m1
));
15566 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15567 ASSERT_FALSE (integer_nonzerop (f_0
));
15568 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15569 ASSERT_FALSE (integer_nonzerop (f_1
));
15570 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15571 ASSERT_FALSE (integer_nonzerop (f_m1
));
15572 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15573 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15574 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15575 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15576 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15577 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15578 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15580 /* Test real_zerop. */
15581 ASSERT_FALSE (real_zerop (i_0
));
15582 ASSERT_FALSE (real_zerop (wr_i_0
));
15583 ASSERT_FALSE (real_zerop (i_1
));
15584 ASSERT_FALSE (real_zerop (wr_i_1
));
15585 ASSERT_FALSE (real_zerop (i_m1
));
15586 ASSERT_FALSE (real_zerop (wr_i_m1
));
15587 ASSERT_TRUE (real_zerop (f_0
));
15588 ASSERT_TRUE (real_zerop (wr_f_0
));
15589 ASSERT_FALSE (real_zerop (f_1
));
15590 ASSERT_FALSE (real_zerop (wr_f_1
));
15591 ASSERT_FALSE (real_zerop (f_m1
));
15592 ASSERT_FALSE (real_zerop (wr_f_m1
));
15593 ASSERT_FALSE (real_zerop (c_i_0
));
15594 ASSERT_FALSE (real_zerop (c_i_1
));
15595 ASSERT_FALSE (real_zerop (c_i_m1
));
15596 ASSERT_TRUE (real_zerop (c_f_0
));
15597 ASSERT_FALSE (real_zerop (c_f_1
));
15598 ASSERT_FALSE (real_zerop (c_f_m1
));
15600 /* Test real_onep. */
15601 ASSERT_FALSE (real_onep (i_0
));
15602 ASSERT_FALSE (real_onep (wr_i_0
));
15603 ASSERT_FALSE (real_onep (i_1
));
15604 ASSERT_FALSE (real_onep (wr_i_1
));
15605 ASSERT_FALSE (real_onep (i_m1
));
15606 ASSERT_FALSE (real_onep (wr_i_m1
));
15607 ASSERT_FALSE (real_onep (f_0
));
15608 ASSERT_FALSE (real_onep (wr_f_0
));
15609 ASSERT_TRUE (real_onep (f_1
));
15610 ASSERT_TRUE (real_onep (wr_f_1
));
15611 ASSERT_FALSE (real_onep (f_m1
));
15612 ASSERT_FALSE (real_onep (wr_f_m1
));
15613 ASSERT_FALSE (real_onep (c_i_0
));
15614 ASSERT_FALSE (real_onep (c_i_1
));
15615 ASSERT_FALSE (real_onep (c_i_m1
));
15616 ASSERT_FALSE (real_onep (c_f_0
));
15617 ASSERT_TRUE (real_onep (c_f_1
));
15618 ASSERT_FALSE (real_onep (c_f_m1
));
15620 /* Test real_minus_onep. */
15621 ASSERT_FALSE (real_minus_onep (i_0
));
15622 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15623 ASSERT_FALSE (real_minus_onep (i_1
));
15624 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15625 ASSERT_FALSE (real_minus_onep (i_m1
));
15626 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15627 ASSERT_FALSE (real_minus_onep (f_0
));
15628 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15629 ASSERT_FALSE (real_minus_onep (f_1
));
15630 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15631 ASSERT_TRUE (real_minus_onep (f_m1
));
15632 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15633 ASSERT_FALSE (real_minus_onep (c_i_0
));
15634 ASSERT_FALSE (real_minus_onep (c_i_1
));
15635 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15636 ASSERT_FALSE (real_minus_onep (c_f_0
));
15637 ASSERT_FALSE (real_minus_onep (c_f_1
));
15638 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15641 ASSERT_TRUE (zerop (i_0
));
15642 ASSERT_TRUE (zerop (wr_i_0
));
15643 ASSERT_FALSE (zerop (i_1
));
15644 ASSERT_FALSE (zerop (wr_i_1
));
15645 ASSERT_FALSE (zerop (i_m1
));
15646 ASSERT_FALSE (zerop (wr_i_m1
));
15647 ASSERT_TRUE (zerop (f_0
));
15648 ASSERT_TRUE (zerop (wr_f_0
));
15649 ASSERT_FALSE (zerop (f_1
));
15650 ASSERT_FALSE (zerop (wr_f_1
));
15651 ASSERT_FALSE (zerop (f_m1
));
15652 ASSERT_FALSE (zerop (wr_f_m1
));
15653 ASSERT_TRUE (zerop (c_i_0
));
15654 ASSERT_FALSE (zerop (c_i_1
));
15655 ASSERT_FALSE (zerop (c_i_m1
));
15656 ASSERT_TRUE (zerop (c_f_0
));
15657 ASSERT_FALSE (zerop (c_f_1
));
15658 ASSERT_FALSE (zerop (c_f_m1
));
15660 /* Test tree_expr_nonnegative_p. */
15661 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15662 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15663 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15664 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15665 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15666 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15667 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15668 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15669 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15670 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15671 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15672 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15673 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15674 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15675 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15676 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15677 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15678 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15680 /* Test tree_expr_nonzero_p. */
15681 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15682 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15683 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15684 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15685 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15686 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15688 /* Test integer_valued_real_p. */
15689 ASSERT_FALSE (integer_valued_real_p (i_0
));
15690 ASSERT_TRUE (integer_valued_real_p (f_0
));
15691 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15692 ASSERT_TRUE (integer_valued_real_p (f_1
));
15693 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15695 /* Test integer_pow2p. */
15696 ASSERT_FALSE (integer_pow2p (i_0
));
15697 ASSERT_TRUE (integer_pow2p (i_1
));
15698 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15700 /* Test uniform_integer_cst_p. */
15701 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15702 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15703 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15704 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15705 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15706 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15707 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15708 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15709 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15710 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15711 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15712 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15713 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15714 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15715 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15716 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15717 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15718 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15721 /* Check that string escaping works correctly. */
15724 test_escaped_strings (void)
15727 escaped_string msg
;
15730 /* ASSERT_STREQ does not accept NULL as a valid test
15731 result, so we have to use ASSERT_EQ instead. */
15732 ASSERT_EQ (NULL
, (const char *) msg
);
15735 ASSERT_STREQ ("", (const char *) msg
);
15737 msg
.escape ("foobar");
15738 ASSERT_STREQ ("foobar", (const char *) msg
);
15740 /* Ensure that we have -fmessage-length set to 0. */
15741 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15742 pp_line_cutoff (global_dc
->printer
) = 0;
15744 msg
.escape ("foo\nbar");
15745 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15747 msg
.escape ("\a\b\f\n\r\t\v");
15748 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15750 /* Now repeat the tests with -fmessage-length set to 5. */
15751 pp_line_cutoff (global_dc
->printer
) = 5;
15753 /* Note that the newline is not translated into an escape. */
15754 msg
.escape ("foo\nbar");
15755 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15757 msg
.escape ("\a\b\f\n\r\t\v");
15758 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15760 /* Restore the original message length setting. */
15761 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15764 /* Run all of the selftests within this file. */
15769 test_integer_constants ();
15770 test_identifiers ();
15772 test_vector_cst_patterns ();
15773 test_location_wrappers ();
15774 test_predicates ();
15775 test_escaped_strings ();
15778 } // namespace selftest
15780 #endif /* CHECKING_P */
15782 #include "gt-tree.h"