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 2, /* OMP_CLAUSE__CACHE_ */
304 2, /* OMP_CLAUSE_GANG */
305 1, /* OMP_CLAUSE_ASYNC */
306 1, /* OMP_CLAUSE_WAIT */
307 0, /* OMP_CLAUSE_AUTO */
308 0, /* OMP_CLAUSE_SEQ */
309 1, /* OMP_CLAUSE__LOOPTEMP_ */
310 1, /* OMP_CLAUSE__REDUCTEMP_ */
311 1, /* OMP_CLAUSE_IF */
312 1, /* OMP_CLAUSE_NUM_THREADS */
313 1, /* OMP_CLAUSE_SCHEDULE */
314 0, /* OMP_CLAUSE_NOWAIT */
315 1, /* OMP_CLAUSE_ORDERED */
316 0, /* OMP_CLAUSE_DEFAULT */
317 3, /* OMP_CLAUSE_COLLAPSE */
318 0, /* OMP_CLAUSE_UNTIED */
319 1, /* OMP_CLAUSE_FINAL */
320 0, /* OMP_CLAUSE_MERGEABLE */
321 1, /* OMP_CLAUSE_DEVICE */
322 1, /* OMP_CLAUSE_DIST_SCHEDULE */
323 0, /* OMP_CLAUSE_INBRANCH */
324 0, /* OMP_CLAUSE_NOTINBRANCH */
325 1, /* OMP_CLAUSE_NUM_TEAMS */
326 1, /* OMP_CLAUSE_THREAD_LIMIT */
327 0, /* OMP_CLAUSE_PROC_BIND */
328 1, /* OMP_CLAUSE_SAFELEN */
329 1, /* OMP_CLAUSE_SIMDLEN */
330 0, /* OMP_CLAUSE_FOR */
331 0, /* OMP_CLAUSE_PARALLEL */
332 0, /* OMP_CLAUSE_SECTIONS */
333 0, /* OMP_CLAUSE_TASKGROUP */
334 1, /* OMP_CLAUSE_PRIORITY */
335 1, /* OMP_CLAUSE_GRAINSIZE */
336 1, /* OMP_CLAUSE_NUM_TASKS */
337 0, /* OMP_CLAUSE_NOGROUP */
338 0, /* OMP_CLAUSE_THREADS */
339 0, /* OMP_CLAUSE_SIMD */
340 1, /* OMP_CLAUSE_HINT */
341 0, /* OMP_CLAUSE_DEFALTMAP */
342 1, /* OMP_CLAUSE__SIMDUID_ */
343 0, /* OMP_CLAUSE__SIMT_ */
344 0, /* OMP_CLAUSE_INDEPENDENT */
345 1, /* OMP_CLAUSE_WORKER */
346 1, /* OMP_CLAUSE_VECTOR */
347 1, /* OMP_CLAUSE_NUM_GANGS */
348 1, /* OMP_CLAUSE_NUM_WORKERS */
349 1, /* OMP_CLAUSE_VECTOR_LENGTH */
350 3, /* OMP_CLAUSE_TILE */
351 2, /* OMP_CLAUSE__GRIDDIM_ */
352 0, /* OMP_CLAUSE_IF_PRESENT */
353 0, /* OMP_CLAUSE_FINALIZE */
356 const char * const omp_clause_code_name
[] =
434 /* Return the tree node structure used by tree code CODE. */
436 static inline enum tree_node_structure_enum
437 tree_node_structure_for_code (enum tree_code code
)
439 switch (TREE_CODE_CLASS (code
))
441 case tcc_declaration
:
446 return TS_FIELD_DECL
;
452 return TS_LABEL_DECL
;
454 return TS_RESULT_DECL
;
455 case DEBUG_EXPR_DECL
:
458 return TS_CONST_DECL
;
462 return TS_FUNCTION_DECL
;
463 case TRANSLATION_UNIT_DECL
:
464 return TS_TRANSLATION_UNIT_DECL
;
466 return TS_DECL_NON_COMMON
;
470 return TS_TYPE_NON_COMMON
;
479 default: /* tcc_constant and tcc_exceptional */
484 /* tcc_constant cases. */
485 case VOID_CST
: return TS_TYPED
;
486 case INTEGER_CST
: return TS_INT_CST
;
487 case POLY_INT_CST
: return TS_POLY_INT_CST
;
488 case REAL_CST
: return TS_REAL_CST
;
489 case FIXED_CST
: return TS_FIXED_CST
;
490 case COMPLEX_CST
: return TS_COMPLEX
;
491 case VECTOR_CST
: return TS_VECTOR
;
492 case STRING_CST
: return TS_STRING
;
493 /* tcc_exceptional cases. */
494 case ERROR_MARK
: return TS_COMMON
;
495 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
496 case TREE_LIST
: return TS_LIST
;
497 case TREE_VEC
: return TS_VEC
;
498 case SSA_NAME
: return TS_SSA_NAME
;
499 case PLACEHOLDER_EXPR
: return TS_COMMON
;
500 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
501 case BLOCK
: return TS_BLOCK
;
502 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
503 case TREE_BINFO
: return TS_BINFO
;
504 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
505 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
506 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
514 /* Initialize tree_contains_struct to describe the hierarchy of tree
518 initialize_tree_contains_struct (void)
522 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
525 enum tree_node_structure_enum ts_code
;
527 code
= (enum tree_code
) i
;
528 ts_code
= tree_node_structure_for_code (code
);
530 /* Mark the TS structure itself. */
531 tree_contains_struct
[code
][ts_code
] = 1;
533 /* Mark all the structures that TS is derived from. */
538 case TS_OPTIMIZATION
:
539 case TS_TARGET_OPTION
:
545 case TS_POLY_INT_CST
:
554 case TS_STATEMENT_LIST
:
555 MARK_TS_TYPED (code
);
559 case TS_DECL_MINIMAL
:
565 MARK_TS_COMMON (code
);
568 case TS_TYPE_WITH_LANG_SPECIFIC
:
569 MARK_TS_TYPE_COMMON (code
);
572 case TS_TYPE_NON_COMMON
:
573 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
577 MARK_TS_DECL_MINIMAL (code
);
582 MARK_TS_DECL_COMMON (code
);
585 case TS_DECL_NON_COMMON
:
586 MARK_TS_DECL_WITH_VIS (code
);
589 case TS_DECL_WITH_VIS
:
593 MARK_TS_DECL_WRTL (code
);
597 MARK_TS_DECL_COMMON (code
);
601 MARK_TS_DECL_WITH_VIS (code
);
605 case TS_FUNCTION_DECL
:
606 MARK_TS_DECL_NON_COMMON (code
);
609 case TS_TRANSLATION_UNIT_DECL
:
610 MARK_TS_DECL_COMMON (code
);
618 /* Basic consistency checks for attributes used in fold. */
619 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
620 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
621 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
622 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
623 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
624 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
625 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
626 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
629 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
631 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
632 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
633 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
634 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
635 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
636 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
637 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
638 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
639 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
640 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
643 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
644 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
645 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
646 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
647 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
648 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
649 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
650 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
651 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
652 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
653 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
654 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
655 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
656 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
657 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
658 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
667 /* Initialize the hash table of types. */
669 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
672 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
675 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
677 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
679 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
681 int_cst_node
= make_int_cst (1, 1);
683 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
685 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
686 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
688 /* Initialize the tree_contains_struct array. */
689 initialize_tree_contains_struct ();
690 lang_hooks
.init_ts ();
694 /* The name of the object as the assembler will see it (but before any
695 translations made by ASM_OUTPUT_LABELREF). Often this is the same
696 as DECL_NAME. It is an IDENTIFIER_NODE. */
698 decl_assembler_name (tree decl
)
700 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
701 lang_hooks
.set_decl_assembler_name (decl
);
702 return DECL_ASSEMBLER_NAME_RAW (decl
);
705 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
706 (either of which may be NULL). Inform the FE, if this changes the
710 overwrite_decl_assembler_name (tree decl
, tree name
)
712 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
713 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
716 /* When the target supports COMDAT groups, this indicates which group the
717 DECL is associated with. This can be either an IDENTIFIER_NODE or a
718 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
720 decl_comdat_group (const_tree node
)
722 struct symtab_node
*snode
= symtab_node::get (node
);
725 return snode
->get_comdat_group ();
728 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
730 decl_comdat_group_id (const_tree node
)
732 struct symtab_node
*snode
= symtab_node::get (node
);
735 return snode
->get_comdat_group_id ();
738 /* When the target supports named section, return its name as IDENTIFIER_NODE
739 or NULL if it is in no section. */
741 decl_section_name (const_tree node
)
743 struct symtab_node
*snode
= symtab_node::get (node
);
746 return snode
->get_section ();
749 /* Set section name of NODE to VALUE (that is expected to be
752 set_decl_section_name (tree node
, const char *value
)
754 struct symtab_node
*snode
;
758 snode
= symtab_node::get (node
);
762 else if (VAR_P (node
))
763 snode
= varpool_node::get_create (node
);
765 snode
= cgraph_node::get_create (node
);
766 snode
->set_section (value
);
769 /* Return TLS model of a variable NODE. */
771 decl_tls_model (const_tree node
)
773 struct varpool_node
*snode
= varpool_node::get (node
);
775 return TLS_MODEL_NONE
;
776 return snode
->tls_model
;
779 /* Set TLS model of variable NODE to MODEL. */
781 set_decl_tls_model (tree node
, enum tls_model model
)
783 struct varpool_node
*vnode
;
785 if (model
== TLS_MODEL_NONE
)
787 vnode
= varpool_node::get (node
);
792 vnode
= varpool_node::get_create (node
);
793 vnode
->tls_model
= model
;
796 /* Compute the number of bytes occupied by a tree with code CODE.
797 This function cannot be used for nodes that have variable sizes,
798 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
800 tree_code_size (enum tree_code code
)
802 switch (TREE_CODE_CLASS (code
))
804 case tcc_declaration
: /* A decl node */
807 case FIELD_DECL
: return sizeof (tree_field_decl
);
808 case PARM_DECL
: return sizeof (tree_parm_decl
);
809 case VAR_DECL
: return sizeof (tree_var_decl
);
810 case LABEL_DECL
: return sizeof (tree_label_decl
);
811 case RESULT_DECL
: return sizeof (tree_result_decl
);
812 case CONST_DECL
: return sizeof (tree_const_decl
);
813 case TYPE_DECL
: return sizeof (tree_type_decl
);
814 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
815 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
816 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
819 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
821 gcc_checking_assert (code
>= NUM_TREE_CODES
);
822 return lang_hooks
.tree_size (code
);
825 case tcc_type
: /* a type node */
836 case FIXED_POINT_TYPE
:
842 case QUAL_UNION_TYPE
:
846 case LANG_TYPE
: return sizeof (tree_type_non_common
);
848 gcc_checking_assert (code
>= NUM_TREE_CODES
);
849 return lang_hooks
.tree_size (code
);
852 case tcc_reference
: /* a reference */
853 case tcc_expression
: /* an expression */
854 case tcc_statement
: /* an expression with side effects */
855 case tcc_comparison
: /* a comparison expression */
856 case tcc_unary
: /* a unary arithmetic expression */
857 case tcc_binary
: /* a binary arithmetic expression */
858 return (sizeof (struct tree_exp
)
859 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
861 case tcc_constant
: /* a constant */
864 case VOID_CST
: return sizeof (tree_typed
);
865 case INTEGER_CST
: gcc_unreachable ();
866 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
867 case REAL_CST
: return sizeof (tree_real_cst
);
868 case FIXED_CST
: return sizeof (tree_fixed_cst
);
869 case COMPLEX_CST
: return sizeof (tree_complex
);
870 case VECTOR_CST
: gcc_unreachable ();
871 case STRING_CST
: gcc_unreachable ();
873 gcc_checking_assert (code
>= NUM_TREE_CODES
);
874 return lang_hooks
.tree_size (code
);
877 case tcc_exceptional
: /* something random, like an identifier. */
880 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
881 case TREE_LIST
: return sizeof (tree_list
);
884 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
886 case TREE_VEC
: gcc_unreachable ();
887 case OMP_CLAUSE
: gcc_unreachable ();
889 case SSA_NAME
: return sizeof (tree_ssa_name
);
891 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
892 case BLOCK
: return sizeof (struct tree_block
);
893 case CONSTRUCTOR
: return sizeof (tree_constructor
);
894 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
895 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
898 gcc_checking_assert (code
>= NUM_TREE_CODES
);
899 return lang_hooks
.tree_size (code
);
907 /* Compute the number of bytes occupied by NODE. This routine only
908 looks at TREE_CODE, except for those nodes that have variable sizes. */
910 tree_size (const_tree node
)
912 const enum tree_code code
= TREE_CODE (node
);
916 return (sizeof (struct tree_int_cst
)
917 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
920 return (offsetof (struct tree_binfo
, base_binfos
)
922 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
925 return (sizeof (struct tree_vec
)
926 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
929 return (sizeof (struct tree_vector
)
930 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
933 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
936 return (sizeof (struct tree_omp_clause
)
937 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
941 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
942 return (sizeof (struct tree_exp
)
943 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
945 return tree_code_size (code
);
949 /* Return tree node kind based on tree CODE. */
951 static tree_node_kind
952 get_stats_node_kind (enum tree_code code
)
954 enum tree_code_class type
= TREE_CODE_CLASS (code
);
958 case tcc_declaration
: /* A decl node */
960 case tcc_type
: /* a type node */
962 case tcc_statement
: /* an expression with side effects */
964 case tcc_reference
: /* a reference */
966 case tcc_expression
: /* an expression */
967 case tcc_comparison
: /* a comparison expression */
968 case tcc_unary
: /* a unary arithmetic expression */
969 case tcc_binary
: /* a binary arithmetic expression */
971 case tcc_constant
: /* a constant */
973 case tcc_exceptional
: /* something random, like an identifier. */
976 case IDENTIFIER_NODE
:
983 return ssa_name_kind
;
989 return omp_clause_kind
;
1001 /* Record interesting allocation statistics for a tree node with CODE
1005 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1007 if (!GATHER_STATISTICS
)
1010 tree_node_kind kind
= get_stats_node_kind (code
);
1012 tree_code_counts
[(int) code
]++;
1013 tree_node_counts
[(int) kind
]++;
1014 tree_node_sizes
[(int) kind
] += length
;
1017 /* Allocate and return a new UID from the DECL_UID namespace. */
1020 allocate_decl_uid (void)
1022 return next_decl_uid
++;
1025 /* Return a newly allocated node of code CODE. For decl and type
1026 nodes, some other fields are initialized. The rest of the node is
1027 initialized to zero. This function cannot be used for TREE_VEC,
1028 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1031 Achoo! I got a code in the node. */
1034 make_node (enum tree_code code MEM_STAT_DECL
)
1037 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1038 size_t length
= tree_code_size (code
);
1040 record_node_allocation_statistics (code
, length
);
1042 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1043 TREE_SET_CODE (t
, code
);
1048 if (code
!= DEBUG_BEGIN_STMT
)
1049 TREE_SIDE_EFFECTS (t
) = 1;
1052 case tcc_declaration
:
1053 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1055 if (code
== FUNCTION_DECL
)
1057 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1058 SET_DECL_MODE (t
, FUNCTION_MODE
);
1061 SET_DECL_ALIGN (t
, 1);
1063 DECL_SOURCE_LOCATION (t
) = input_location
;
1064 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1065 DECL_UID (t
) = --next_debug_decl_uid
;
1068 DECL_UID (t
) = allocate_decl_uid ();
1069 SET_DECL_PT_UID (t
, -1);
1071 if (TREE_CODE (t
) == LABEL_DECL
)
1072 LABEL_DECL_UID (t
) = -1;
1077 TYPE_UID (t
) = next_type_uid
++;
1078 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1079 TYPE_USER_ALIGN (t
) = 0;
1080 TYPE_MAIN_VARIANT (t
) = t
;
1081 TYPE_CANONICAL (t
) = t
;
1083 /* Default to no attributes for type, but let target change that. */
1084 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1085 targetm
.set_default_type_attributes (t
);
1087 /* We have not yet computed the alias set for this type. */
1088 TYPE_ALIAS_SET (t
) = -1;
1092 TREE_CONSTANT (t
) = 1;
1095 case tcc_expression
:
1101 case PREDECREMENT_EXPR
:
1102 case PREINCREMENT_EXPR
:
1103 case POSTDECREMENT_EXPR
:
1104 case POSTINCREMENT_EXPR
:
1105 /* All of these have side-effects, no matter what their
1107 TREE_SIDE_EFFECTS (t
) = 1;
1115 case tcc_exceptional
:
1118 case TARGET_OPTION_NODE
:
1119 TREE_TARGET_OPTION(t
)
1120 = ggc_cleared_alloc
<struct cl_target_option
> ();
1123 case OPTIMIZATION_NODE
:
1124 TREE_OPTIMIZATION (t
)
1125 = ggc_cleared_alloc
<struct cl_optimization
> ();
1134 /* Other classes need no special treatment. */
1141 /* Free tree node. */
1144 free_node (tree node
)
1146 enum tree_code code
= TREE_CODE (node
);
1147 if (GATHER_STATISTICS
)
1149 enum tree_node_kind kind
= get_stats_node_kind (code
);
1151 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1152 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1153 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1155 tree_code_counts
[(int) TREE_CODE (node
)]--;
1156 tree_node_counts
[(int) kind
]--;
1157 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1159 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1160 vec_free (CONSTRUCTOR_ELTS (node
));
1161 else if (code
== BLOCK
)
1162 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1163 else if (code
== TREE_BINFO
)
1164 vec_free (BINFO_BASE_ACCESSES (node
));
1168 /* Return a new node with the same contents as NODE except that its
1169 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1172 copy_node (tree node MEM_STAT_DECL
)
1175 enum tree_code code
= TREE_CODE (node
);
1178 gcc_assert (code
!= STATEMENT_LIST
);
1180 length
= tree_size (node
);
1181 record_node_allocation_statistics (code
, length
);
1182 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1183 memcpy (t
, node
, length
);
1185 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1187 TREE_ASM_WRITTEN (t
) = 0;
1188 TREE_VISITED (t
) = 0;
1190 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1192 if (code
== DEBUG_EXPR_DECL
)
1193 DECL_UID (t
) = --next_debug_decl_uid
;
1196 DECL_UID (t
) = allocate_decl_uid ();
1197 if (DECL_PT_UID_SET_P (node
))
1198 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1200 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1201 && DECL_HAS_VALUE_EXPR_P (node
))
1203 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1204 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1206 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1209 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1210 t
->decl_with_vis
.symtab_node
= NULL
;
1212 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1214 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1215 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1217 if (TREE_CODE (node
) == FUNCTION_DECL
)
1219 DECL_STRUCT_FUNCTION (t
) = NULL
;
1220 t
->decl_with_vis
.symtab_node
= NULL
;
1223 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1225 TYPE_UID (t
) = next_type_uid
++;
1226 /* The following is so that the debug code for
1227 the copy is different from the original type.
1228 The two statements usually duplicate each other
1229 (because they clear fields of the same union),
1230 but the optimizer should catch that. */
1231 TYPE_SYMTAB_ADDRESS (t
) = 0;
1232 TYPE_SYMTAB_DIE (t
) = 0;
1234 /* Do not copy the values cache. */
1235 if (TYPE_CACHED_VALUES_P (t
))
1237 TYPE_CACHED_VALUES_P (t
) = 0;
1238 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1241 else if (code
== TARGET_OPTION_NODE
)
1243 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1244 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1245 sizeof (struct cl_target_option
));
1247 else if (code
== OPTIMIZATION_NODE
)
1249 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1250 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1251 sizeof (struct cl_optimization
));
1257 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1258 For example, this can copy a list made of TREE_LIST nodes. */
1261 copy_list (tree list
)
1269 head
= prev
= copy_node (list
);
1270 next
= TREE_CHAIN (list
);
1273 TREE_CHAIN (prev
) = copy_node (next
);
1274 prev
= TREE_CHAIN (prev
);
1275 next
= TREE_CHAIN (next
);
1281 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1282 INTEGER_CST with value CST and type TYPE. */
1285 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1287 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1288 /* We need extra HWIs if CST is an unsigned integer with its
1290 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1291 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1292 return cst
.get_len ();
1295 /* Return a new INTEGER_CST with value CST and type TYPE. */
1298 build_new_int_cst (tree type
, const wide_int
&cst
)
1300 unsigned int len
= cst
.get_len ();
1301 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1302 tree nt
= make_int_cst (len
, ext_len
);
1307 TREE_INT_CST_ELT (nt
, ext_len
)
1308 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1309 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1310 TREE_INT_CST_ELT (nt
, i
) = -1;
1312 else if (TYPE_UNSIGNED (type
)
1313 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1316 TREE_INT_CST_ELT (nt
, len
)
1317 = zext_hwi (cst
.elt (len
),
1318 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1321 for (unsigned int i
= 0; i
< len
; i
++)
1322 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1323 TREE_TYPE (nt
) = type
;
1327 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1330 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1333 size_t length
= sizeof (struct tree_poly_int_cst
);
1334 record_node_allocation_statistics (POLY_INT_CST
, length
);
1336 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1338 TREE_SET_CODE (t
, POLY_INT_CST
);
1339 TREE_CONSTANT (t
) = 1;
1340 TREE_TYPE (t
) = type
;
1341 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1342 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1346 /* Create a constant tree that contains CST sign-extended to TYPE. */
1349 build_int_cst (tree type
, poly_int64 cst
)
1351 /* Support legacy code. */
1353 type
= integer_type_node
;
1355 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1358 /* Create a constant tree that contains CST zero-extended to TYPE. */
1361 build_int_cstu (tree type
, poly_uint64 cst
)
1363 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1366 /* Create a constant tree that contains CST sign-extended to TYPE. */
1369 build_int_cst_type (tree type
, poly_int64 cst
)
1372 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1375 /* Constructs tree in type TYPE from with value given by CST. Signedness
1376 of CST is assumed to be the same as the signedness of TYPE. */
1379 double_int_to_tree (tree type
, double_int cst
)
1381 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1384 /* We force the wide_int CST to the range of the type TYPE by sign or
1385 zero extending it. OVERFLOWABLE indicates if we are interested in
1386 overflow of the value, when >0 we are only interested in signed
1387 overflow, for <0 we are interested in any overflow. OVERFLOWED
1388 indicates whether overflow has already occurred. CONST_OVERFLOWED
1389 indicates whether constant overflow has already occurred. We force
1390 T's value to be within range of T's type (by setting to 0 or 1 all
1391 the bits outside the type's range). We set TREE_OVERFLOWED if,
1392 OVERFLOWED is nonzero,
1393 or OVERFLOWABLE is >0 and signed overflow occurs
1394 or OVERFLOWABLE is <0 and any overflow occurs
1395 We return a new tree node for the extended wide_int. The node
1396 is shared if no overflow flags are set. */
1400 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1401 int overflowable
, bool overflowed
)
1403 signop sign
= TYPE_SIGN (type
);
1405 /* If we need to set overflow flags, return a new unshared node. */
1406 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1410 || (overflowable
> 0 && sign
== SIGNED
))
1412 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1415 if (tmp
.is_constant ())
1416 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1419 tree coeffs
[NUM_POLY_INT_COEFFS
];
1420 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1422 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1423 TREE_OVERFLOW (coeffs
[i
]) = 1;
1425 t
= build_new_poly_int_cst (type
, coeffs
);
1427 TREE_OVERFLOW (t
) = 1;
1432 /* Else build a shared node. */
1433 return wide_int_to_tree (type
, cst
);
1436 /* These are the hash table functions for the hash table of INTEGER_CST
1437 nodes of a sizetype. */
1439 /* Return the hash code X, an INTEGER_CST. */
1442 int_cst_hasher::hash (tree x
)
1444 const_tree
const t
= x
;
1445 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1448 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1449 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1454 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1455 is the same as that given by *Y, which is the same. */
1458 int_cst_hasher::equal (tree x
, tree y
)
1460 const_tree
const xt
= x
;
1461 const_tree
const yt
= y
;
1463 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1464 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1465 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1468 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1469 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1475 /* Create an INT_CST node of TYPE and value CST.
1476 The returned node is always shared. For small integers we use a
1477 per-type vector cache, for larger ones we use a single hash table.
1478 The value is extended from its precision according to the sign of
1479 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1480 the upper bits and ensures that hashing and value equality based
1481 upon the underlying HOST_WIDE_INTs works without masking. */
1484 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1491 unsigned int prec
= TYPE_PRECISION (type
);
1492 signop sgn
= TYPE_SIGN (type
);
1494 /* Verify that everything is canonical. */
1495 int l
= pcst
.get_len ();
1498 if (pcst
.elt (l
- 1) == 0)
1499 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1500 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1501 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1504 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1505 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1509 /* We just need to store a single HOST_WIDE_INT. */
1511 if (TYPE_UNSIGNED (type
))
1512 hwi
= cst
.to_uhwi ();
1514 hwi
= cst
.to_shwi ();
1516 switch (TREE_CODE (type
))
1519 gcc_assert (hwi
== 0);
1523 case REFERENCE_TYPE
:
1524 /* Cache NULL pointer and zero bounds. */
1533 /* Cache false or true. */
1535 if (IN_RANGE (hwi
, 0, 1))
1541 if (TYPE_SIGN (type
) == UNSIGNED
)
1544 limit
= INTEGER_SHARE_LIMIT
;
1545 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1550 /* Cache [-1, N). */
1551 limit
= INTEGER_SHARE_LIMIT
+ 1;
1552 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1566 /* Look for it in the type's vector of small shared ints. */
1567 if (!TYPE_CACHED_VALUES_P (type
))
1569 TYPE_CACHED_VALUES_P (type
) = 1;
1570 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1573 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1575 /* Make sure no one is clobbering the shared constant. */
1576 gcc_checking_assert (TREE_TYPE (t
) == type
1577 && TREE_INT_CST_NUNITS (t
) == 1
1578 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1579 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1580 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1583 /* Create a new shared int. */
1584 t
= build_new_int_cst (type
, cst
);
1585 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1590 /* Use the cache of larger shared ints, using int_cst_node as
1593 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1594 TREE_TYPE (int_cst_node
) = type
;
1596 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1600 /* Insert this one into the hash table. */
1603 /* Make a new node for next time round. */
1604 int_cst_node
= make_int_cst (1, 1);
1610 /* The value either hashes properly or we drop it on the floor
1611 for the gc to take care of. There will not be enough of them
1614 tree nt
= build_new_int_cst (type
, cst
);
1615 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1619 /* Insert this one into the hash table. */
1631 poly_int_cst_hasher::hash (tree t
)
1633 inchash::hash hstate
;
1635 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1636 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1637 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1639 return hstate
.end ();
1643 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1645 if (TREE_TYPE (x
) != y
.first
)
1647 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1648 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1653 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1654 The elements must also have type TYPE. */
1657 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1659 unsigned int prec
= TYPE_PRECISION (type
);
1660 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1661 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1664 h
.add_int (TYPE_UID (type
));
1665 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1666 h
.add_wide_int (c
.coeffs
[i
]);
1667 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1668 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1670 if (*slot
== NULL_TREE
)
1672 tree coeffs
[NUM_POLY_INT_COEFFS
];
1673 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1674 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1675 *slot
= build_new_poly_int_cst (type
, coeffs
);
1680 /* Create a constant tree with value VALUE in type TYPE. */
1683 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1685 if (value
.is_constant ())
1686 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1687 return build_poly_int_cst (type
, value
);
1691 cache_integer_cst (tree t
)
1693 tree type
= TREE_TYPE (t
);
1696 int prec
= TYPE_PRECISION (type
);
1698 gcc_assert (!TREE_OVERFLOW (t
));
1700 switch (TREE_CODE (type
))
1703 gcc_assert (integer_zerop (t
));
1707 case REFERENCE_TYPE
:
1708 /* Cache NULL pointer. */
1709 if (integer_zerop (t
))
1717 /* Cache false or true. */
1719 if (wi::ltu_p (wi::to_wide (t
), 2))
1720 ix
= TREE_INT_CST_ELT (t
, 0);
1725 if (TYPE_UNSIGNED (type
))
1728 limit
= INTEGER_SHARE_LIMIT
;
1730 /* This is a little hokie, but if the prec is smaller than
1731 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1732 obvious test will not get the correct answer. */
1733 if (prec
< HOST_BITS_PER_WIDE_INT
)
1735 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1736 ix
= tree_to_uhwi (t
);
1738 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1739 ix
= tree_to_uhwi (t
);
1744 limit
= INTEGER_SHARE_LIMIT
+ 1;
1746 if (integer_minus_onep (t
))
1748 else if (!wi::neg_p (wi::to_wide (t
)))
1750 if (prec
< HOST_BITS_PER_WIDE_INT
)
1752 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1753 ix
= tree_to_shwi (t
) + 1;
1755 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1756 ix
= tree_to_shwi (t
) + 1;
1770 /* Look for it in the type's vector of small shared ints. */
1771 if (!TYPE_CACHED_VALUES_P (type
))
1773 TYPE_CACHED_VALUES_P (type
) = 1;
1774 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1777 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1778 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1782 /* Use the cache of larger shared ints. */
1783 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1784 /* If there is already an entry for the number verify it's the
1787 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1789 /* Otherwise insert this one into the hash table. */
1795 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1796 and the rest are zeros. */
1799 build_low_bits_mask (tree type
, unsigned bits
)
1801 gcc_assert (bits
<= TYPE_PRECISION (type
));
1803 return wide_int_to_tree (type
, wi::mask (bits
, false,
1804 TYPE_PRECISION (type
)));
1807 /* Checks that X is integer constant that can be expressed in (unsigned)
1808 HOST_WIDE_INT without loss of precision. */
1811 cst_and_fits_in_hwi (const_tree x
)
1813 return (TREE_CODE (x
) == INTEGER_CST
1814 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1817 /* Build a newly constructed VECTOR_CST with the given values of
1818 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1821 make_vector (unsigned log2_npatterns
,
1822 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1824 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1826 unsigned npatterns
= 1 << log2_npatterns
;
1827 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1828 unsigned length
= (sizeof (struct tree_vector
)
1829 + (encoded_nelts
- 1) * sizeof (tree
));
1831 record_node_allocation_statistics (VECTOR_CST
, length
);
1833 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1835 TREE_SET_CODE (t
, VECTOR_CST
);
1836 TREE_CONSTANT (t
) = 1;
1837 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1838 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1843 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1844 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1847 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1849 unsigned HOST_WIDE_INT idx
, nelts
;
1852 /* We can't construct a VECTOR_CST for a variable number of elements. */
1853 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1854 tree_vector_builder
vec (type
, nelts
, 1);
1855 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1857 if (TREE_CODE (value
) == VECTOR_CST
)
1859 /* If NELTS is constant then this must be too. */
1860 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1861 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1862 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1865 vec
.quick_push (value
);
1867 while (vec
.length () < nelts
)
1868 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1870 return vec
.build ();
1873 /* Build a vector of type VECTYPE where all the elements are SCs. */
1875 build_vector_from_val (tree vectype
, tree sc
)
1877 unsigned HOST_WIDE_INT i
, nunits
;
1879 if (sc
== error_mark_node
)
1882 /* Verify that the vector type is suitable for SC. Note that there
1883 is some inconsistency in the type-system with respect to restrict
1884 qualifications of pointers. Vector types always have a main-variant
1885 element type and the qualification is applied to the vector-type.
1886 So TREE_TYPE (vector-type) does not return a properly qualified
1887 vector element-type. */
1888 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1889 TREE_TYPE (vectype
)));
1891 if (CONSTANT_CLASS_P (sc
))
1893 tree_vector_builder
v (vectype
, 1, 1);
1897 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1898 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1901 vec
<constructor_elt
, va_gc
> *v
;
1902 vec_alloc (v
, nunits
);
1903 for (i
= 0; i
< nunits
; ++i
)
1904 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1905 return build_constructor (vectype
, v
);
1909 /* If TYPE is not a vector type, just return SC, otherwise return
1910 build_vector_from_val (TYPE, SC). */
1913 build_uniform_cst (tree type
, tree sc
)
1915 if (!VECTOR_TYPE_P (type
))
1918 return build_vector_from_val (type
, sc
);
1921 /* Build a vector series of type TYPE in which element I has the value
1922 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1923 and a VEC_SERIES_EXPR otherwise. */
1926 build_vec_series (tree type
, tree base
, tree step
)
1928 if (integer_zerop (step
))
1929 return build_vector_from_val (type
, base
);
1930 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1932 tree_vector_builder
builder (type
, 1, 3);
1933 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1934 wi::to_wide (base
) + wi::to_wide (step
));
1935 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1936 wi::to_wide (elt1
) + wi::to_wide (step
));
1937 builder
.quick_push (base
);
1938 builder
.quick_push (elt1
);
1939 builder
.quick_push (elt2
);
1940 return builder
.build ();
1942 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1945 /* Return a vector with the same number of units and number of bits
1946 as VEC_TYPE, but in which the elements are a linear series of unsigned
1947 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1950 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1952 tree index_vec_type
= vec_type
;
1953 tree index_elt_type
= TREE_TYPE (vec_type
);
1954 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1955 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1957 index_elt_type
= build_nonstandard_integer_type
1958 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1959 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1962 tree_vector_builder
v (index_vec_type
, 1, 3);
1963 for (unsigned int i
= 0; i
< 3; ++i
)
1964 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1968 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1969 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1972 recompute_constructor_flags (tree c
)
1976 bool constant_p
= true;
1977 bool side_effects_p
= false;
1978 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1980 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1982 /* Mostly ctors will have elts that don't have side-effects, so
1983 the usual case is to scan all the elements. Hence a single
1984 loop for both const and side effects, rather than one loop
1985 each (with early outs). */
1986 if (!TREE_CONSTANT (val
))
1988 if (TREE_SIDE_EFFECTS (val
))
1989 side_effects_p
= true;
1992 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1993 TREE_CONSTANT (c
) = constant_p
;
1996 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
2000 verify_constructor_flags (tree c
)
2004 bool constant_p
= TREE_CONSTANT (c
);
2005 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
2006 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
2008 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
2010 if (constant_p
&& !TREE_CONSTANT (val
))
2011 internal_error ("non-constant element in constant CONSTRUCTOR");
2012 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
2013 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2017 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2018 are in the vec pointed to by VALS. */
2020 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
2022 tree c
= make_node (CONSTRUCTOR
);
2024 TREE_TYPE (c
) = type
;
2025 CONSTRUCTOR_ELTS (c
) = vals
;
2027 recompute_constructor_flags (c
);
2032 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2035 build_constructor_single (tree type
, tree index
, tree value
)
2037 vec
<constructor_elt
, va_gc
> *v
;
2038 constructor_elt elt
= {index
, value
};
2041 v
->quick_push (elt
);
2043 return build_constructor (type
, v
);
2047 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2048 are in a list pointed to by VALS. */
2050 build_constructor_from_list (tree type
, tree vals
)
2053 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2057 vec_alloc (v
, list_length (vals
));
2058 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2059 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2062 return build_constructor (type
, v
);
2065 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2066 of elements, provided as index/value pairs. */
2069 build_constructor_va (tree type
, int nelts
, ...)
2071 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2074 va_start (p
, nelts
);
2075 vec_alloc (v
, nelts
);
2078 tree index
= va_arg (p
, tree
);
2079 tree value
= va_arg (p
, tree
);
2080 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2083 return build_constructor (type
, v
);
2086 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2089 build_clobber (tree type
)
2091 tree clobber
= build_constructor (type
, NULL
);
2092 TREE_THIS_VOLATILE (clobber
) = true;
2096 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2099 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2102 FIXED_VALUE_TYPE
*fp
;
2104 v
= make_node (FIXED_CST
);
2105 fp
= ggc_alloc
<fixed_value
> ();
2106 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2108 TREE_TYPE (v
) = type
;
2109 TREE_FIXED_CST_PTR (v
) = fp
;
2113 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2116 build_real (tree type
, REAL_VALUE_TYPE d
)
2119 REAL_VALUE_TYPE
*dp
;
2122 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2123 Consider doing it via real_convert now. */
2125 v
= make_node (REAL_CST
);
2126 dp
= ggc_alloc
<real_value
> ();
2127 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2129 TREE_TYPE (v
) = type
;
2130 TREE_REAL_CST_PTR (v
) = dp
;
2131 TREE_OVERFLOW (v
) = overflow
;
2135 /* Like build_real, but first truncate D to the type. */
2138 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2140 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2143 /* Return a new REAL_CST node whose type is TYPE
2144 and whose value is the integer value of the INTEGER_CST node I. */
2147 real_value_from_int_cst (const_tree type
, const_tree i
)
2151 /* Clear all bits of the real value type so that we can later do
2152 bitwise comparisons to see if two values are the same. */
2153 memset (&d
, 0, sizeof d
);
2155 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2156 TYPE_SIGN (TREE_TYPE (i
)));
2160 /* Given a tree representing an integer constant I, return a tree
2161 representing the same value as a floating-point constant of type TYPE. */
2164 build_real_from_int_cst (tree type
, const_tree i
)
2167 int overflow
= TREE_OVERFLOW (i
);
2169 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2171 TREE_OVERFLOW (v
) |= overflow
;
2175 /* Return a newly constructed STRING_CST node whose value is
2176 the LEN characters at STR.
2177 Note that for a C string literal, LEN should include the trailing NUL.
2178 The TREE_TYPE is not initialized. */
2181 build_string (int len
, const char *str
)
2186 /* Do not waste bytes provided by padding of struct tree_string. */
2187 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2189 record_node_allocation_statistics (STRING_CST
, length
);
2191 s
= (tree
) ggc_internal_alloc (length
);
2193 memset (s
, 0, sizeof (struct tree_typed
));
2194 TREE_SET_CODE (s
, STRING_CST
);
2195 TREE_CONSTANT (s
) = 1;
2196 TREE_STRING_LENGTH (s
) = len
;
2197 memcpy (s
->string
.str
, str
, len
);
2198 s
->string
.str
[len
] = '\0';
2203 /* Return a newly constructed COMPLEX_CST node whose value is
2204 specified by the real and imaginary parts REAL and IMAG.
2205 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2206 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2209 build_complex (tree type
, tree real
, tree imag
)
2211 gcc_assert (CONSTANT_CLASS_P (real
));
2212 gcc_assert (CONSTANT_CLASS_P (imag
));
2214 tree t
= make_node (COMPLEX_CST
);
2216 TREE_REALPART (t
) = real
;
2217 TREE_IMAGPART (t
) = imag
;
2218 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2219 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2223 /* Build a complex (inf +- 0i), such as for the result of cproj.
2224 TYPE is the complex tree type of the result. If NEG is true, the
2225 imaginary zero is negative. */
2228 build_complex_inf (tree type
, bool neg
)
2230 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2234 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2235 build_real (TREE_TYPE (type
), rzero
));
2238 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2239 element is set to 1. In particular, this is 1 + i for complex types. */
2242 build_each_one_cst (tree type
)
2244 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2246 tree scalar
= build_one_cst (TREE_TYPE (type
));
2247 return build_complex (type
, scalar
, scalar
);
2250 return build_one_cst (type
);
2253 /* Return a constant of arithmetic type TYPE which is the
2254 multiplicative identity of the set TYPE. */
2257 build_one_cst (tree type
)
2259 switch (TREE_CODE (type
))
2261 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2262 case POINTER_TYPE
: case REFERENCE_TYPE
:
2264 return build_int_cst (type
, 1);
2267 return build_real (type
, dconst1
);
2269 case FIXED_POINT_TYPE
:
2270 /* We can only generate 1 for accum types. */
2271 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2272 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2276 tree scalar
= build_one_cst (TREE_TYPE (type
));
2278 return build_vector_from_val (type
, scalar
);
2282 return build_complex (type
,
2283 build_one_cst (TREE_TYPE (type
)),
2284 build_zero_cst (TREE_TYPE (type
)));
2291 /* Return an integer of type TYPE containing all 1's in as much precision as
2292 it contains, or a complex or vector whose subparts are such integers. */
2295 build_all_ones_cst (tree type
)
2297 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2299 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2300 return build_complex (type
, scalar
, scalar
);
2303 return build_minus_one_cst (type
);
2306 /* Return a constant of arithmetic type TYPE which is the
2307 opposite of the multiplicative identity of the set TYPE. */
2310 build_minus_one_cst (tree type
)
2312 switch (TREE_CODE (type
))
2314 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2315 case POINTER_TYPE
: case REFERENCE_TYPE
:
2317 return build_int_cst (type
, -1);
2320 return build_real (type
, dconstm1
);
2322 case FIXED_POINT_TYPE
:
2323 /* We can only generate 1 for accum types. */
2324 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2325 return build_fixed (type
,
2326 fixed_from_double_int (double_int_minus_one
,
2327 SCALAR_TYPE_MODE (type
)));
2331 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2333 return build_vector_from_val (type
, scalar
);
2337 return build_complex (type
,
2338 build_minus_one_cst (TREE_TYPE (type
)),
2339 build_zero_cst (TREE_TYPE (type
)));
2346 /* Build 0 constant of type TYPE. This is used by constructor folding
2347 and thus the constant should be represented in memory by
2351 build_zero_cst (tree type
)
2353 switch (TREE_CODE (type
))
2355 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2356 case POINTER_TYPE
: case REFERENCE_TYPE
:
2357 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2358 return build_int_cst (type
, 0);
2361 return build_real (type
, dconst0
);
2363 case FIXED_POINT_TYPE
:
2364 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2368 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2370 return build_vector_from_val (type
, scalar
);
2375 tree zero
= build_zero_cst (TREE_TYPE (type
));
2377 return build_complex (type
, zero
, zero
);
2381 if (!AGGREGATE_TYPE_P (type
))
2382 return fold_convert (type
, integer_zero_node
);
2383 return build_constructor (type
, NULL
);
2388 /* Build a BINFO with LEN language slots. */
2391 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2394 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2395 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2397 record_node_allocation_statistics (TREE_BINFO
, length
);
2399 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2401 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2403 TREE_SET_CODE (t
, TREE_BINFO
);
2405 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2410 /* Create a CASE_LABEL_EXPR tree node and return it. */
2413 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2415 tree t
= make_node (CASE_LABEL_EXPR
);
2417 TREE_TYPE (t
) = void_type_node
;
2418 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2420 CASE_LOW (t
) = low_value
;
2421 CASE_HIGH (t
) = high_value
;
2422 CASE_LABEL (t
) = label_decl
;
2423 CASE_CHAIN (t
) = NULL_TREE
;
2428 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2429 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2430 The latter determines the length of the HOST_WIDE_INT vector. */
2433 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2436 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2437 + sizeof (struct tree_int_cst
));
2440 record_node_allocation_statistics (INTEGER_CST
, length
);
2442 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2444 TREE_SET_CODE (t
, INTEGER_CST
);
2445 TREE_INT_CST_NUNITS (t
) = len
;
2446 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2447 /* to_offset can only be applied to trees that are offset_int-sized
2448 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2449 must be exactly the precision of offset_int and so LEN is correct. */
2450 if (ext_len
<= OFFSET_INT_ELTS
)
2451 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2453 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2455 TREE_CONSTANT (t
) = 1;
2460 /* Build a newly constructed TREE_VEC node of length LEN. */
2463 make_tree_vec (int len MEM_STAT_DECL
)
2466 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2468 record_node_allocation_statistics (TREE_VEC
, length
);
2470 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2472 TREE_SET_CODE (t
, TREE_VEC
);
2473 TREE_VEC_LENGTH (t
) = len
;
2478 /* Grow a TREE_VEC node to new length LEN. */
2481 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2483 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2485 int oldlen
= TREE_VEC_LENGTH (v
);
2486 gcc_assert (len
> oldlen
);
2488 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2489 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2491 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2493 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2495 TREE_VEC_LENGTH (v
) = len
;
2500 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2501 fixed, and scalar, complex or vector. */
2504 zerop (const_tree expr
)
2506 return (integer_zerop (expr
)
2507 || real_zerop (expr
)
2508 || fixed_zerop (expr
));
2511 /* Return 1 if EXPR is the integer constant zero or a complex constant
2512 of zero, or a location wrapper for such a constant. */
2515 integer_zerop (const_tree expr
)
2517 STRIP_ANY_LOCATION_WRAPPER (expr
);
2519 switch (TREE_CODE (expr
))
2522 return wi::to_wide (expr
) == 0;
2524 return (integer_zerop (TREE_REALPART (expr
))
2525 && integer_zerop (TREE_IMAGPART (expr
)));
2527 return (VECTOR_CST_NPATTERNS (expr
) == 1
2528 && VECTOR_CST_DUPLICATE_P (expr
)
2529 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2535 /* Return 1 if EXPR is the integer constant one or the corresponding
2536 complex constant, or a location wrapper for such a constant. */
2539 integer_onep (const_tree expr
)
2541 STRIP_ANY_LOCATION_WRAPPER (expr
);
2543 switch (TREE_CODE (expr
))
2546 return wi::eq_p (wi::to_widest (expr
), 1);
2548 return (integer_onep (TREE_REALPART (expr
))
2549 && integer_zerop (TREE_IMAGPART (expr
)));
2551 return (VECTOR_CST_NPATTERNS (expr
) == 1
2552 && VECTOR_CST_DUPLICATE_P (expr
)
2553 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2559 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2560 return 1 if every piece is the integer constant one.
2561 Also return 1 for location wrappers for such a constant. */
2564 integer_each_onep (const_tree expr
)
2566 STRIP_ANY_LOCATION_WRAPPER (expr
);
2568 if (TREE_CODE (expr
) == COMPLEX_CST
)
2569 return (integer_onep (TREE_REALPART (expr
))
2570 && integer_onep (TREE_IMAGPART (expr
)));
2572 return integer_onep (expr
);
2575 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2576 it contains, or a complex or vector whose subparts are such integers,
2577 or a location wrapper for such a constant. */
2580 integer_all_onesp (const_tree expr
)
2582 STRIP_ANY_LOCATION_WRAPPER (expr
);
2584 if (TREE_CODE (expr
) == COMPLEX_CST
2585 && integer_all_onesp (TREE_REALPART (expr
))
2586 && integer_all_onesp (TREE_IMAGPART (expr
)))
2589 else if (TREE_CODE (expr
) == VECTOR_CST
)
2590 return (VECTOR_CST_NPATTERNS (expr
) == 1
2591 && VECTOR_CST_DUPLICATE_P (expr
)
2592 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2594 else if (TREE_CODE (expr
) != INTEGER_CST
)
2597 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2598 == wi::to_wide (expr
));
2601 /* Return 1 if EXPR is the integer constant minus one, or a location wrapper
2602 for such a constant. */
2605 integer_minus_onep (const_tree expr
)
2607 STRIP_ANY_LOCATION_WRAPPER (expr
);
2609 if (TREE_CODE (expr
) == COMPLEX_CST
)
2610 return (integer_all_onesp (TREE_REALPART (expr
))
2611 && integer_zerop (TREE_IMAGPART (expr
)));
2613 return integer_all_onesp (expr
);
2616 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2617 one bit on), or a location wrapper for such a constant. */
2620 integer_pow2p (const_tree expr
)
2622 STRIP_ANY_LOCATION_WRAPPER (expr
);
2624 if (TREE_CODE (expr
) == COMPLEX_CST
2625 && integer_pow2p (TREE_REALPART (expr
))
2626 && integer_zerop (TREE_IMAGPART (expr
)))
2629 if (TREE_CODE (expr
) != INTEGER_CST
)
2632 return wi::popcount (wi::to_wide (expr
)) == 1;
2635 /* Return 1 if EXPR is an integer constant other than zero or a
2636 complex constant other than zero, or a location wrapper for such a
2640 integer_nonzerop (const_tree expr
)
2642 STRIP_ANY_LOCATION_WRAPPER (expr
);
2644 return ((TREE_CODE (expr
) == INTEGER_CST
2645 && wi::to_wide (expr
) != 0)
2646 || (TREE_CODE (expr
) == COMPLEX_CST
2647 && (integer_nonzerop (TREE_REALPART (expr
))
2648 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2651 /* Return 1 if EXPR is the integer constant one. For vector,
2652 return 1 if every piece is the integer constant minus one
2653 (representing the value TRUE).
2654 Also return 1 for location wrappers for such a constant. */
2657 integer_truep (const_tree expr
)
2659 STRIP_ANY_LOCATION_WRAPPER (expr
);
2661 if (TREE_CODE (expr
) == VECTOR_CST
)
2662 return integer_all_onesp (expr
);
2663 return integer_onep (expr
);
2666 /* Return 1 if EXPR is the fixed-point constant zero, or a location wrapper
2667 for such a constant. */
2670 fixed_zerop (const_tree expr
)
2672 STRIP_ANY_LOCATION_WRAPPER (expr
);
2674 return (TREE_CODE (expr
) == FIXED_CST
2675 && TREE_FIXED_CST (expr
).data
.is_zero ());
2678 /* Return the power of two represented by a tree node known to be a
2682 tree_log2 (const_tree expr
)
2684 if (TREE_CODE (expr
) == COMPLEX_CST
)
2685 return tree_log2 (TREE_REALPART (expr
));
2687 return wi::exact_log2 (wi::to_wide (expr
));
2690 /* Similar, but return the largest integer Y such that 2 ** Y is less
2691 than or equal to EXPR. */
2694 tree_floor_log2 (const_tree expr
)
2696 if (TREE_CODE (expr
) == COMPLEX_CST
)
2697 return tree_log2 (TREE_REALPART (expr
));
2699 return wi::floor_log2 (wi::to_wide (expr
));
2702 /* Return number of known trailing zero bits in EXPR, or, if the value of
2703 EXPR is known to be zero, the precision of it's type. */
2706 tree_ctz (const_tree expr
)
2708 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2709 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2712 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2713 switch (TREE_CODE (expr
))
2716 ret1
= wi::ctz (wi::to_wide (expr
));
2717 return MIN (ret1
, prec
);
2719 ret1
= wi::ctz (get_nonzero_bits (expr
));
2720 return MIN (ret1
, prec
);
2727 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2730 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2731 return MIN (ret1
, ret2
);
2732 case POINTER_PLUS_EXPR
:
2733 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2734 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2735 /* Second operand is sizetype, which could be in theory
2736 wider than pointer's precision. Make sure we never
2737 return more than prec. */
2738 ret2
= MIN (ret2
, prec
);
2739 return MIN (ret1
, ret2
);
2741 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2742 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2743 return MAX (ret1
, ret2
);
2745 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2746 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2747 return MIN (ret1
+ ret2
, prec
);
2749 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2750 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2751 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2753 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2754 return MIN (ret1
+ ret2
, prec
);
2758 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2759 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2761 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2762 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2767 case TRUNC_DIV_EXPR
:
2769 case FLOOR_DIV_EXPR
:
2770 case ROUND_DIV_EXPR
:
2771 case EXACT_DIV_EXPR
:
2772 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2773 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2775 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2778 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2786 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2787 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2789 return MIN (ret1
, prec
);
2791 return tree_ctz (TREE_OPERAND (expr
, 0));
2793 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2796 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2797 return MIN (ret1
, ret2
);
2799 return tree_ctz (TREE_OPERAND (expr
, 1));
2801 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2802 if (ret1
> BITS_PER_UNIT
)
2804 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2805 return MIN (ret1
, prec
);
2813 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2814 decimal float constants, so don't return 1 for them.
2815 Also return 1 for location wrappers around such a constant. */
2818 real_zerop (const_tree expr
)
2820 STRIP_ANY_LOCATION_WRAPPER (expr
);
2822 switch (TREE_CODE (expr
))
2825 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2826 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2828 return real_zerop (TREE_REALPART (expr
))
2829 && real_zerop (TREE_IMAGPART (expr
));
2832 /* Don't simply check for a duplicate because the predicate
2833 accepts both +0.0 and -0.0. */
2834 unsigned count
= vector_cst_encoded_nelts (expr
);
2835 for (unsigned int i
= 0; i
< count
; ++i
)
2836 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2845 /* Return 1 if EXPR is the real constant one in real or complex form.
2846 Trailing zeroes matter for decimal float constants, so don't return
2848 Also return 1 for location wrappers around such a constant. */
2851 real_onep (const_tree expr
)
2853 STRIP_ANY_LOCATION_WRAPPER (expr
);
2855 switch (TREE_CODE (expr
))
2858 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2859 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2861 return real_onep (TREE_REALPART (expr
))
2862 && real_zerop (TREE_IMAGPART (expr
));
2864 return (VECTOR_CST_NPATTERNS (expr
) == 1
2865 && VECTOR_CST_DUPLICATE_P (expr
)
2866 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2872 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2873 matter for decimal float constants, so don't return 1 for them.
2874 Also return 1 for location wrappers around such a constant. */
2877 real_minus_onep (const_tree expr
)
2879 STRIP_ANY_LOCATION_WRAPPER (expr
);
2881 switch (TREE_CODE (expr
))
2884 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2885 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2887 return real_minus_onep (TREE_REALPART (expr
))
2888 && real_zerop (TREE_IMAGPART (expr
));
2890 return (VECTOR_CST_NPATTERNS (expr
) == 1
2891 && VECTOR_CST_DUPLICATE_P (expr
)
2892 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2898 /* Nonzero if EXP is a constant or a cast of a constant. */
2901 really_constant_p (const_tree exp
)
2903 /* This is not quite the same as STRIP_NOPS. It does more. */
2904 while (CONVERT_EXPR_P (exp
)
2905 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2906 exp
= TREE_OPERAND (exp
, 0);
2907 return TREE_CONSTANT (exp
);
2910 /* Return true if T holds a polynomial pointer difference, storing it in
2911 *VALUE if so. A true return means that T's precision is no greater
2912 than 64 bits, which is the largest address space we support, so *VALUE
2913 never loses precision. However, the signedness of the result does
2914 not necessarily match the signedness of T: sometimes an unsigned type
2915 like sizetype is used to encode a value that is actually negative. */
2918 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2922 if (TREE_CODE (t
) == INTEGER_CST
)
2924 if (!cst_and_fits_in_hwi (t
))
2926 *value
= int_cst_value (t
);
2929 if (POLY_INT_CST_P (t
))
2931 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2932 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2934 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2935 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2942 tree_to_poly_int64 (const_tree t
)
2944 gcc_assert (tree_fits_poly_int64_p (t
));
2945 if (POLY_INT_CST_P (t
))
2946 return poly_int_cst_value (t
).force_shwi ();
2947 return TREE_INT_CST_LOW (t
);
2951 tree_to_poly_uint64 (const_tree t
)
2953 gcc_assert (tree_fits_poly_uint64_p (t
));
2954 if (POLY_INT_CST_P (t
))
2955 return poly_int_cst_value (t
).force_uhwi ();
2956 return TREE_INT_CST_LOW (t
);
2959 /* Return first list element whose TREE_VALUE is ELEM.
2960 Return 0 if ELEM is not in LIST. */
2963 value_member (tree elem
, tree list
)
2967 if (elem
== TREE_VALUE (list
))
2969 list
= TREE_CHAIN (list
);
2974 /* Return first list element whose TREE_PURPOSE is ELEM.
2975 Return 0 if ELEM is not in LIST. */
2978 purpose_member (const_tree elem
, tree list
)
2982 if (elem
== TREE_PURPOSE (list
))
2984 list
= TREE_CHAIN (list
);
2989 /* Return true if ELEM is in V. */
2992 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2996 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
3002 /* Returns element number IDX (zero-origin) of chain CHAIN, or
3006 chain_index (int idx
, tree chain
)
3008 for (; chain
&& idx
> 0; --idx
)
3009 chain
= TREE_CHAIN (chain
);
3013 /* Return nonzero if ELEM is part of the chain CHAIN. */
3016 chain_member (const_tree elem
, const_tree chain
)
3022 chain
= DECL_CHAIN (chain
);
3028 /* Return the length of a chain of nodes chained through TREE_CHAIN.
3029 We expect a null pointer to mark the end of the chain.
3030 This is the Lisp primitive `length'. */
3033 list_length (const_tree t
)
3036 #ifdef ENABLE_TREE_CHECKING
3044 #ifdef ENABLE_TREE_CHECKING
3047 gcc_assert (p
!= q
);
3055 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3056 UNION_TYPE TYPE, or NULL_TREE if none. */
3059 first_field (const_tree type
)
3061 tree t
= TYPE_FIELDS (type
);
3062 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3067 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3068 by modifying the last node in chain 1 to point to chain 2.
3069 This is the Lisp primitive `nconc'. */
3072 chainon (tree op1
, tree op2
)
3081 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3083 TREE_CHAIN (t1
) = op2
;
3085 #ifdef ENABLE_TREE_CHECKING
3088 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3089 gcc_assert (t2
!= t1
);
3096 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3099 tree_last (tree chain
)
3103 while ((next
= TREE_CHAIN (chain
)))
3108 /* Reverse the order of elements in the chain T,
3109 and return the new head of the chain (old last element). */
3114 tree prev
= 0, decl
, next
;
3115 for (decl
= t
; decl
; decl
= next
)
3117 /* We shouldn't be using this function to reverse BLOCK chains; we
3118 have blocks_nreverse for that. */
3119 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3120 next
= TREE_CHAIN (decl
);
3121 TREE_CHAIN (decl
) = prev
;
3127 /* Return a newly created TREE_LIST node whose
3128 purpose and value fields are PARM and VALUE. */
3131 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3133 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3134 TREE_PURPOSE (t
) = parm
;
3135 TREE_VALUE (t
) = value
;
3139 /* Build a chain of TREE_LIST nodes from a vector. */
3142 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3144 tree ret
= NULL_TREE
;
3148 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3150 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3151 pp
= &TREE_CHAIN (*pp
);
3156 /* Return a newly created TREE_LIST node whose
3157 purpose and value fields are PURPOSE and VALUE
3158 and whose TREE_CHAIN is CHAIN. */
3161 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3165 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3166 memset (node
, 0, sizeof (struct tree_common
));
3168 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3170 TREE_SET_CODE (node
, TREE_LIST
);
3171 TREE_CHAIN (node
) = chain
;
3172 TREE_PURPOSE (node
) = purpose
;
3173 TREE_VALUE (node
) = value
;
3177 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3181 ctor_to_vec (tree ctor
)
3183 vec
<tree
, va_gc
> *vec
;
3184 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3188 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3189 vec
->quick_push (val
);
3194 /* Return the size nominally occupied by an object of type TYPE
3195 when it resides in memory. The value is measured in units of bytes,
3196 and its data type is that normally used for type sizes
3197 (which is the first type created by make_signed_type or
3198 make_unsigned_type). */
3201 size_in_bytes_loc (location_t loc
, const_tree type
)
3205 if (type
== error_mark_node
)
3206 return integer_zero_node
;
3208 type
= TYPE_MAIN_VARIANT (type
);
3209 t
= TYPE_SIZE_UNIT (type
);
3213 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3214 return size_zero_node
;
3220 /* Return the size of TYPE (in bytes) as a wide integer
3221 or return -1 if the size can vary or is larger than an integer. */
3224 int_size_in_bytes (const_tree type
)
3228 if (type
== error_mark_node
)
3231 type
= TYPE_MAIN_VARIANT (type
);
3232 t
= TYPE_SIZE_UNIT (type
);
3234 if (t
&& tree_fits_uhwi_p (t
))
3235 return TREE_INT_CST_LOW (t
);
3240 /* Return the maximum size of TYPE (in bytes) as a wide integer
3241 or return -1 if the size can vary or is larger than an integer. */
3244 max_int_size_in_bytes (const_tree type
)
3246 HOST_WIDE_INT size
= -1;
3249 /* If this is an array type, check for a possible MAX_SIZE attached. */
3251 if (TREE_CODE (type
) == ARRAY_TYPE
)
3253 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3255 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3256 size
= tree_to_uhwi (size_tree
);
3259 /* If we still haven't been able to get a size, see if the language
3260 can compute a maximum size. */
3264 size_tree
= lang_hooks
.types
.max_size (type
);
3266 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3267 size
= tree_to_uhwi (size_tree
);
3273 /* Return the bit position of FIELD, in bits from the start of the record.
3274 This is a tree of type bitsizetype. */
3277 bit_position (const_tree field
)
3279 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3280 DECL_FIELD_BIT_OFFSET (field
));
3283 /* Return the byte position of FIELD, in bytes from the start of the record.
3284 This is a tree of type sizetype. */
3287 byte_position (const_tree field
)
3289 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3290 DECL_FIELD_BIT_OFFSET (field
));
3293 /* Likewise, but return as an integer. It must be representable in
3294 that way (since it could be a signed value, we don't have the
3295 option of returning -1 like int_size_in_byte can. */
3298 int_byte_position (const_tree field
)
3300 return tree_to_shwi (byte_position (field
));
3303 /* Return the strictest alignment, in bits, that T is known to have. */
3306 expr_align (const_tree t
)
3308 unsigned int align0
, align1
;
3310 switch (TREE_CODE (t
))
3312 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3313 /* If we have conversions, we know that the alignment of the
3314 object must meet each of the alignments of the types. */
3315 align0
= expr_align (TREE_OPERAND (t
, 0));
3316 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3317 return MAX (align0
, align1
);
3319 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3320 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3321 case CLEANUP_POINT_EXPR
:
3322 /* These don't change the alignment of an object. */
3323 return expr_align (TREE_OPERAND (t
, 0));
3326 /* The best we can do is say that the alignment is the least aligned
3328 align0
= expr_align (TREE_OPERAND (t
, 1));
3329 align1
= expr_align (TREE_OPERAND (t
, 2));
3330 return MIN (align0
, align1
);
3332 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3333 meaningfully, it's always 1. */
3334 case LABEL_DECL
: case CONST_DECL
:
3335 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3337 gcc_assert (DECL_ALIGN (t
) != 0);
3338 return DECL_ALIGN (t
);
3344 /* Otherwise take the alignment from that of the type. */
3345 return TYPE_ALIGN (TREE_TYPE (t
));
3348 /* Return, as a tree node, the number of elements for TYPE (which is an
3349 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3352 array_type_nelts (const_tree type
)
3354 tree index_type
, min
, max
;
3356 /* If they did it with unspecified bounds, then we should have already
3357 given an error about it before we got here. */
3358 if (! TYPE_DOMAIN (type
))
3359 return error_mark_node
;
3361 index_type
= TYPE_DOMAIN (type
);
3362 min
= TYPE_MIN_VALUE (index_type
);
3363 max
= TYPE_MAX_VALUE (index_type
);
3365 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3367 return error_mark_node
;
3369 return (integer_zerop (min
)
3371 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3374 /* If arg is static -- a reference to an object in static storage -- then
3375 return the object. This is not the same as the C meaning of `static'.
3376 If arg isn't static, return NULL. */
3381 switch (TREE_CODE (arg
))
3384 /* Nested functions are static, even though taking their address will
3385 involve a trampoline as we unnest the nested function and create
3386 the trampoline on the tree level. */
3390 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3391 && ! DECL_THREAD_LOCAL_P (arg
)
3392 && ! DECL_DLLIMPORT_P (arg
)
3396 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3400 return TREE_STATIC (arg
) ? arg
: NULL
;
3407 /* If the thing being referenced is not a field, then it is
3408 something language specific. */
3409 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3411 /* If we are referencing a bitfield, we can't evaluate an
3412 ADDR_EXPR at compile time and so it isn't a constant. */
3413 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3416 return staticp (TREE_OPERAND (arg
, 0));
3422 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3425 case ARRAY_RANGE_REF
:
3426 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3427 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3428 return staticp (TREE_OPERAND (arg
, 0));
3432 case COMPOUND_LITERAL_EXPR
:
3433 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3443 /* Return whether OP is a DECL whose address is function-invariant. */
3446 decl_address_invariant_p (const_tree op
)
3448 /* The conditions below are slightly less strict than the one in
3451 switch (TREE_CODE (op
))
3460 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3461 || DECL_THREAD_LOCAL_P (op
)
3462 || DECL_CONTEXT (op
) == current_function_decl
3463 || decl_function_context (op
) == current_function_decl
)
3468 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3469 || decl_function_context (op
) == current_function_decl
)
3480 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3483 decl_address_ip_invariant_p (const_tree op
)
3485 /* The conditions below are slightly less strict than the one in
3488 switch (TREE_CODE (op
))
3496 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3497 && !DECL_DLLIMPORT_P (op
))
3498 || DECL_THREAD_LOCAL_P (op
))
3503 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3515 /* Return true if T is function-invariant (internal function, does
3516 not handle arithmetic; that's handled in skip_simple_arithmetic and
3517 tree_invariant_p). */
3520 tree_invariant_p_1 (tree t
)
3524 if (TREE_CONSTANT (t
)
3525 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3528 switch (TREE_CODE (t
))
3534 op
= TREE_OPERAND (t
, 0);
3535 while (handled_component_p (op
))
3537 switch (TREE_CODE (op
))
3540 case ARRAY_RANGE_REF
:
3541 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3542 || TREE_OPERAND (op
, 2) != NULL_TREE
3543 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3548 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3554 op
= TREE_OPERAND (op
, 0);
3557 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3566 /* Return true if T is function-invariant. */
3569 tree_invariant_p (tree t
)
3571 tree inner
= skip_simple_arithmetic (t
);
3572 return tree_invariant_p_1 (inner
);
3575 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3576 Do this to any expression which may be used in more than one place,
3577 but must be evaluated only once.
3579 Normally, expand_expr would reevaluate the expression each time.
3580 Calling save_expr produces something that is evaluated and recorded
3581 the first time expand_expr is called on it. Subsequent calls to
3582 expand_expr just reuse the recorded value.
3584 The call to expand_expr that generates code that actually computes
3585 the value is the first call *at compile time*. Subsequent calls
3586 *at compile time* generate code to use the saved value.
3587 This produces correct result provided that *at run time* control
3588 always flows through the insns made by the first expand_expr
3589 before reaching the other places where the save_expr was evaluated.
3590 You, the caller of save_expr, must make sure this is so.
3592 Constants, and certain read-only nodes, are returned with no
3593 SAVE_EXPR because that is safe. Expressions containing placeholders
3594 are not touched; see tree.def for an explanation of what these
3598 save_expr (tree expr
)
3602 /* If the tree evaluates to a constant, then we don't want to hide that
3603 fact (i.e. this allows further folding, and direct checks for constants).
3604 However, a read-only object that has side effects cannot be bypassed.
3605 Since it is no problem to reevaluate literals, we just return the
3607 inner
= skip_simple_arithmetic (expr
);
3608 if (TREE_CODE (inner
) == ERROR_MARK
)
3611 if (tree_invariant_p_1 (inner
))
3614 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3615 it means that the size or offset of some field of an object depends on
3616 the value within another field.
3618 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3619 and some variable since it would then need to be both evaluated once and
3620 evaluated more than once. Front-ends must assure this case cannot
3621 happen by surrounding any such subexpressions in their own SAVE_EXPR
3622 and forcing evaluation at the proper time. */
3623 if (contains_placeholder_p (inner
))
3626 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3628 /* This expression might be placed ahead of a jump to ensure that the
3629 value was computed on both sides of the jump. So make sure it isn't
3630 eliminated as dead. */
3631 TREE_SIDE_EFFECTS (expr
) = 1;
3635 /* Look inside EXPR into any simple arithmetic operations. Return the
3636 outermost non-arithmetic or non-invariant node. */
3639 skip_simple_arithmetic (tree expr
)
3641 /* We don't care about whether this can be used as an lvalue in this
3643 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3644 expr
= TREE_OPERAND (expr
, 0);
3646 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3647 a constant, it will be more efficient to not make another SAVE_EXPR since
3648 it will allow better simplification and GCSE will be able to merge the
3649 computations if they actually occur. */
3652 if (UNARY_CLASS_P (expr
))
3653 expr
= TREE_OPERAND (expr
, 0);
3654 else if (BINARY_CLASS_P (expr
))
3656 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3657 expr
= TREE_OPERAND (expr
, 0);
3658 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3659 expr
= TREE_OPERAND (expr
, 1);
3670 /* Look inside EXPR into simple arithmetic operations involving constants.
3671 Return the outermost non-arithmetic or non-constant node. */
3674 skip_simple_constant_arithmetic (tree expr
)
3676 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3677 expr
= TREE_OPERAND (expr
, 0);
3681 if (UNARY_CLASS_P (expr
))
3682 expr
= TREE_OPERAND (expr
, 0);
3683 else if (BINARY_CLASS_P (expr
))
3685 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3686 expr
= TREE_OPERAND (expr
, 0);
3687 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3688 expr
= TREE_OPERAND (expr
, 1);
3699 /* Return which tree structure is used by T. */
3701 enum tree_node_structure_enum
3702 tree_node_structure (const_tree t
)
3704 const enum tree_code code
= TREE_CODE (t
);
3705 return tree_node_structure_for_code (code
);
3708 /* Set various status flags when building a CALL_EXPR object T. */
3711 process_call_operands (tree t
)
3713 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3714 bool read_only
= false;
3715 int i
= call_expr_flags (t
);
3717 /* Calls have side-effects, except those to const or pure functions. */
3718 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3719 side_effects
= true;
3720 /* Propagate TREE_READONLY of arguments for const functions. */
3724 if (!side_effects
|| read_only
)
3725 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3727 tree op
= TREE_OPERAND (t
, i
);
3728 if (op
&& TREE_SIDE_EFFECTS (op
))
3729 side_effects
= true;
3730 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3734 TREE_SIDE_EFFECTS (t
) = side_effects
;
3735 TREE_READONLY (t
) = read_only
;
3738 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3739 size or offset that depends on a field within a record. */
3742 contains_placeholder_p (const_tree exp
)
3744 enum tree_code code
;
3749 code
= TREE_CODE (exp
);
3750 if (code
== PLACEHOLDER_EXPR
)
3753 switch (TREE_CODE_CLASS (code
))
3756 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3757 position computations since they will be converted into a
3758 WITH_RECORD_EXPR involving the reference, which will assume
3759 here will be valid. */
3760 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3762 case tcc_exceptional
:
3763 if (code
== TREE_LIST
)
3764 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3765 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3770 case tcc_comparison
:
3771 case tcc_expression
:
3775 /* Ignoring the first operand isn't quite right, but works best. */
3776 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3779 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3780 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3781 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3784 /* The save_expr function never wraps anything containing
3785 a PLACEHOLDER_EXPR. */
3792 switch (TREE_CODE_LENGTH (code
))
3795 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3797 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3798 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3809 const_call_expr_arg_iterator iter
;
3810 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3811 if (CONTAINS_PLACEHOLDER_P (arg
))
3825 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3826 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3830 type_contains_placeholder_1 (const_tree type
)
3832 /* If the size contains a placeholder or the parent type (component type in
3833 the case of arrays) type involves a placeholder, this type does. */
3834 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3835 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3836 || (!POINTER_TYPE_P (type
)
3838 && type_contains_placeholder_p (TREE_TYPE (type
))))
3841 /* Now do type-specific checks. Note that the last part of the check above
3842 greatly limits what we have to do below. */
3843 switch (TREE_CODE (type
))
3851 case REFERENCE_TYPE
:
3860 case FIXED_POINT_TYPE
:
3861 /* Here we just check the bounds. */
3862 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3863 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3866 /* We have already checked the component type above, so just check
3867 the domain type. Flexible array members have a null domain. */
3868 return TYPE_DOMAIN (type
) ?
3869 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3873 case QUAL_UNION_TYPE
:
3877 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3878 if (TREE_CODE (field
) == FIELD_DECL
3879 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3880 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3881 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3882 || type_contains_placeholder_p (TREE_TYPE (field
))))
3893 /* Wrapper around above function used to cache its result. */
3896 type_contains_placeholder_p (tree type
)
3900 /* If the contains_placeholder_bits field has been initialized,
3901 then we know the answer. */
3902 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3903 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3905 /* Indicate that we've seen this type node, and the answer is false.
3906 This is what we want to return if we run into recursion via fields. */
3907 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3909 /* Compute the real value. */
3910 result
= type_contains_placeholder_1 (type
);
3912 /* Store the real value. */
3913 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3918 /* Push tree EXP onto vector QUEUE if it is not already present. */
3921 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3926 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3927 if (simple_cst_equal (iter
, exp
) == 1)
3931 queue
->safe_push (exp
);
3934 /* Given a tree EXP, find all occurrences of references to fields
3935 in a PLACEHOLDER_EXPR and place them in vector REFS without
3936 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3937 we assume here that EXP contains only arithmetic expressions
3938 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3942 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3944 enum tree_code code
= TREE_CODE (exp
);
3948 /* We handle TREE_LIST and COMPONENT_REF separately. */
3949 if (code
== TREE_LIST
)
3951 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3952 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3954 else if (code
== COMPONENT_REF
)
3956 for (inner
= TREE_OPERAND (exp
, 0);
3957 REFERENCE_CLASS_P (inner
);
3958 inner
= TREE_OPERAND (inner
, 0))
3961 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3962 push_without_duplicates (exp
, refs
);
3964 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3967 switch (TREE_CODE_CLASS (code
))
3972 case tcc_declaration
:
3973 /* Variables allocated to static storage can stay. */
3974 if (!TREE_STATIC (exp
))
3975 push_without_duplicates (exp
, refs
);
3978 case tcc_expression
:
3979 /* This is the pattern built in ada/make_aligning_type. */
3980 if (code
== ADDR_EXPR
3981 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3983 push_without_duplicates (exp
, refs
);
3989 case tcc_exceptional
:
3992 case tcc_comparison
:
3994 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3995 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3999 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4000 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
4008 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
4009 return a tree with all occurrences of references to F in a
4010 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
4011 CONST_DECLs. Note that we assume here that EXP contains only
4012 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
4013 occurring only in their argument list. */
4016 substitute_in_expr (tree exp
, tree f
, tree r
)
4018 enum tree_code code
= TREE_CODE (exp
);
4019 tree op0
, op1
, op2
, op3
;
4022 /* We handle TREE_LIST and COMPONENT_REF separately. */
4023 if (code
== TREE_LIST
)
4025 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
4026 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
4027 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4030 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4032 else if (code
== COMPONENT_REF
)
4036 /* If this expression is getting a value from a PLACEHOLDER_EXPR
4037 and it is the right field, replace it with R. */
4038 for (inner
= TREE_OPERAND (exp
, 0);
4039 REFERENCE_CLASS_P (inner
);
4040 inner
= TREE_OPERAND (inner
, 0))
4044 op1
= TREE_OPERAND (exp
, 1);
4046 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
4049 /* If this expression hasn't been completed let, leave it alone. */
4050 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4053 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4054 if (op0
== TREE_OPERAND (exp
, 0))
4058 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4061 switch (TREE_CODE_CLASS (code
))
4066 case tcc_declaration
:
4072 case tcc_expression
:
4078 case tcc_exceptional
:
4081 case tcc_comparison
:
4083 switch (TREE_CODE_LENGTH (code
))
4089 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4090 if (op0
== TREE_OPERAND (exp
, 0))
4093 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4097 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4098 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4100 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4103 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4107 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4108 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4109 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4111 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4112 && op2
== TREE_OPERAND (exp
, 2))
4115 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4119 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4120 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4121 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4122 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4124 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4125 && op2
== TREE_OPERAND (exp
, 2)
4126 && op3
== TREE_OPERAND (exp
, 3))
4130 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4142 new_tree
= NULL_TREE
;
4144 /* If we are trying to replace F with a constant or with another
4145 instance of one of the arguments of the call, inline back
4146 functions which do nothing else than computing a value from
4147 the arguments they are passed. This makes it possible to
4148 fold partially or entirely the replacement expression. */
4149 if (code
== CALL_EXPR
)
4151 bool maybe_inline
= false;
4152 if (CONSTANT_CLASS_P (r
))
4153 maybe_inline
= true;
4155 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4156 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4158 maybe_inline
= true;
4163 tree t
= maybe_inline_call_in_expr (exp
);
4165 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4169 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4171 tree op
= TREE_OPERAND (exp
, i
);
4172 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4176 new_tree
= copy_node (exp
);
4177 TREE_OPERAND (new_tree
, i
) = new_op
;
4183 new_tree
= fold (new_tree
);
4184 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4185 process_call_operands (new_tree
);
4196 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4198 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4199 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4204 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4205 for it within OBJ, a tree that is an object or a chain of references. */
4208 substitute_placeholder_in_expr (tree exp
, tree obj
)
4210 enum tree_code code
= TREE_CODE (exp
);
4211 tree op0
, op1
, op2
, op3
;
4214 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4215 in the chain of OBJ. */
4216 if (code
== PLACEHOLDER_EXPR
)
4218 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4221 for (elt
= obj
; elt
!= 0;
4222 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4223 || TREE_CODE (elt
) == COND_EXPR
)
4224 ? TREE_OPERAND (elt
, 1)
4225 : (REFERENCE_CLASS_P (elt
)
4226 || UNARY_CLASS_P (elt
)
4227 || BINARY_CLASS_P (elt
)
4228 || VL_EXP_CLASS_P (elt
)
4229 || EXPRESSION_CLASS_P (elt
))
4230 ? TREE_OPERAND (elt
, 0) : 0))
4231 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4234 for (elt
= obj
; elt
!= 0;
4235 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4236 || TREE_CODE (elt
) == COND_EXPR
)
4237 ? TREE_OPERAND (elt
, 1)
4238 : (REFERENCE_CLASS_P (elt
)
4239 || UNARY_CLASS_P (elt
)
4240 || BINARY_CLASS_P (elt
)
4241 || VL_EXP_CLASS_P (elt
)
4242 || EXPRESSION_CLASS_P (elt
))
4243 ? TREE_OPERAND (elt
, 0) : 0))
4244 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4245 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4247 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4249 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4250 survives until RTL generation, there will be an error. */
4254 /* TREE_LIST is special because we need to look at TREE_VALUE
4255 and TREE_CHAIN, not TREE_OPERANDS. */
4256 else if (code
== TREE_LIST
)
4258 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4259 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4260 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4263 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4266 switch (TREE_CODE_CLASS (code
))
4269 case tcc_declaration
:
4272 case tcc_exceptional
:
4275 case tcc_comparison
:
4276 case tcc_expression
:
4279 switch (TREE_CODE_LENGTH (code
))
4285 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4286 if (op0
== TREE_OPERAND (exp
, 0))
4289 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4293 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4294 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4296 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4299 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4303 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4304 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4305 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4307 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4308 && op2
== TREE_OPERAND (exp
, 2))
4311 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4315 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4316 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4317 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4318 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4320 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4321 && op2
== TREE_OPERAND (exp
, 2)
4322 && op3
== TREE_OPERAND (exp
, 3))
4326 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4338 new_tree
= NULL_TREE
;
4340 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4342 tree op
= TREE_OPERAND (exp
, i
);
4343 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4347 new_tree
= copy_node (exp
);
4348 TREE_OPERAND (new_tree
, i
) = new_op
;
4354 new_tree
= fold (new_tree
);
4355 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4356 process_call_operands (new_tree
);
4367 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4369 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4370 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4376 /* Subroutine of stabilize_reference; this is called for subtrees of
4377 references. Any expression with side-effects must be put in a SAVE_EXPR
4378 to ensure that it is only evaluated once.
4380 We don't put SAVE_EXPR nodes around everything, because assigning very
4381 simple expressions to temporaries causes us to miss good opportunities
4382 for optimizations. Among other things, the opportunity to fold in the
4383 addition of a constant into an addressing mode often gets lost, e.g.
4384 "y[i+1] += x;". In general, we take the approach that we should not make
4385 an assignment unless we are forced into it - i.e., that any non-side effect
4386 operator should be allowed, and that cse should take care of coalescing
4387 multiple utterances of the same expression should that prove fruitful. */
4390 stabilize_reference_1 (tree e
)
4393 enum tree_code code
= TREE_CODE (e
);
4395 /* We cannot ignore const expressions because it might be a reference
4396 to a const array but whose index contains side-effects. But we can
4397 ignore things that are actual constant or that already have been
4398 handled by this function. */
4400 if (tree_invariant_p (e
))
4403 switch (TREE_CODE_CLASS (code
))
4405 case tcc_exceptional
:
4406 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4407 have side-effects. */
4408 if (code
== STATEMENT_LIST
)
4409 return save_expr (e
);
4412 case tcc_declaration
:
4413 case tcc_comparison
:
4415 case tcc_expression
:
4418 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4419 so that it will only be evaluated once. */
4420 /* The reference (r) and comparison (<) classes could be handled as
4421 below, but it is generally faster to only evaluate them once. */
4422 if (TREE_SIDE_EFFECTS (e
))
4423 return save_expr (e
);
4427 /* Constants need no processing. In fact, we should never reach
4432 /* Division is slow and tends to be compiled with jumps,
4433 especially the division by powers of 2 that is often
4434 found inside of an array reference. So do it just once. */
4435 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4436 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4437 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4438 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4439 return save_expr (e
);
4440 /* Recursively stabilize each operand. */
4441 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4442 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4446 /* Recursively stabilize each operand. */
4447 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4454 TREE_TYPE (result
) = TREE_TYPE (e
);
4455 TREE_READONLY (result
) = TREE_READONLY (e
);
4456 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4457 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4462 /* Stabilize a reference so that we can use it any number of times
4463 without causing its operands to be evaluated more than once.
4464 Returns the stabilized reference. This works by means of save_expr,
4465 so see the caveats in the comments about save_expr.
4467 Also allows conversion expressions whose operands are references.
4468 Any other kind of expression is returned unchanged. */
4471 stabilize_reference (tree ref
)
4474 enum tree_code code
= TREE_CODE (ref
);
4481 /* No action is needed in this case. */
4486 case FIX_TRUNC_EXPR
:
4487 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4491 result
= build_nt (INDIRECT_REF
,
4492 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4496 result
= build_nt (COMPONENT_REF
,
4497 stabilize_reference (TREE_OPERAND (ref
, 0)),
4498 TREE_OPERAND (ref
, 1), NULL_TREE
);
4502 result
= build_nt (BIT_FIELD_REF
,
4503 stabilize_reference (TREE_OPERAND (ref
, 0)),
4504 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4505 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4509 result
= build_nt (ARRAY_REF
,
4510 stabilize_reference (TREE_OPERAND (ref
, 0)),
4511 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4512 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4515 case ARRAY_RANGE_REF
:
4516 result
= build_nt (ARRAY_RANGE_REF
,
4517 stabilize_reference (TREE_OPERAND (ref
, 0)),
4518 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4519 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4523 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4524 it wouldn't be ignored. This matters when dealing with
4526 return stabilize_reference_1 (ref
);
4528 /* If arg isn't a kind of lvalue we recognize, make no change.
4529 Caller should recognize the error for an invalid lvalue. */
4534 return error_mark_node
;
4537 TREE_TYPE (result
) = TREE_TYPE (ref
);
4538 TREE_READONLY (result
) = TREE_READONLY (ref
);
4539 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4540 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4545 /* Low-level constructors for expressions. */
4547 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4548 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4551 recompute_tree_invariant_for_addr_expr (tree t
)
4554 bool tc
= true, se
= false;
4556 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4558 /* We started out assuming this address is both invariant and constant, but
4559 does not have side effects. Now go down any handled components and see if
4560 any of them involve offsets that are either non-constant or non-invariant.
4561 Also check for side-effects.
4563 ??? Note that this code makes no attempt to deal with the case where
4564 taking the address of something causes a copy due to misalignment. */
4566 #define UPDATE_FLAGS(NODE) \
4567 do { tree _node = (NODE); \
4568 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4569 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4571 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4572 node
= TREE_OPERAND (node
, 0))
4574 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4575 array reference (probably made temporarily by the G++ front end),
4576 so ignore all the operands. */
4577 if ((TREE_CODE (node
) == ARRAY_REF
4578 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4579 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4581 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4582 if (TREE_OPERAND (node
, 2))
4583 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4584 if (TREE_OPERAND (node
, 3))
4585 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4587 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4588 FIELD_DECL, apparently. The G++ front end can put something else
4589 there, at least temporarily. */
4590 else if (TREE_CODE (node
) == COMPONENT_REF
4591 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4593 if (TREE_OPERAND (node
, 2))
4594 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4598 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4600 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4601 the address, since &(*a)->b is a form of addition. If it's a constant, the
4602 address is constant too. If it's a decl, its address is constant if the
4603 decl is static. Everything else is not constant and, furthermore,
4604 taking the address of a volatile variable is not volatile. */
4605 if (TREE_CODE (node
) == INDIRECT_REF
4606 || TREE_CODE (node
) == MEM_REF
)
4607 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4608 else if (CONSTANT_CLASS_P (node
))
4610 else if (DECL_P (node
))
4611 tc
&= (staticp (node
) != NULL_TREE
);
4615 se
|= TREE_SIDE_EFFECTS (node
);
4619 TREE_CONSTANT (t
) = tc
;
4620 TREE_SIDE_EFFECTS (t
) = se
;
4624 /* Build an expression of code CODE, data type TYPE, and operands as
4625 specified. Expressions and reference nodes can be created this way.
4626 Constants, decls, types and misc nodes cannot be.
4628 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4629 enough for all extant tree codes. */
4632 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4636 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4638 t
= make_node (code PASS_MEM_STAT
);
4645 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4647 int length
= sizeof (struct tree_exp
);
4650 record_node_allocation_statistics (code
, length
);
4652 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4654 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4656 memset (t
, 0, sizeof (struct tree_common
));
4658 TREE_SET_CODE (t
, code
);
4660 TREE_TYPE (t
) = type
;
4661 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4662 TREE_OPERAND (t
, 0) = node
;
4663 if (node
&& !TYPE_P (node
))
4665 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4666 TREE_READONLY (t
) = TREE_READONLY (node
);
4669 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4671 if (code
!= DEBUG_BEGIN_STMT
)
4672 TREE_SIDE_EFFECTS (t
) = 1;
4677 /* All of these have side-effects, no matter what their
4679 TREE_SIDE_EFFECTS (t
) = 1;
4680 TREE_READONLY (t
) = 0;
4684 /* Whether a dereference is readonly has nothing to do with whether
4685 its operand is readonly. */
4686 TREE_READONLY (t
) = 0;
4691 recompute_tree_invariant_for_addr_expr (t
);
4695 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4696 && node
&& !TYPE_P (node
)
4697 && TREE_CONSTANT (node
))
4698 TREE_CONSTANT (t
) = 1;
4699 if (TREE_CODE_CLASS (code
) == tcc_reference
4700 && node
&& TREE_THIS_VOLATILE (node
))
4701 TREE_THIS_VOLATILE (t
) = 1;
4708 #define PROCESS_ARG(N) \
4710 TREE_OPERAND (t, N) = arg##N; \
4711 if (arg##N &&!TYPE_P (arg##N)) \
4713 if (TREE_SIDE_EFFECTS (arg##N)) \
4715 if (!TREE_READONLY (arg##N) \
4716 && !CONSTANT_CLASS_P (arg##N)) \
4717 (void) (read_only = 0); \
4718 if (!TREE_CONSTANT (arg##N)) \
4719 (void) (constant = 0); \
4724 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4726 bool constant
, read_only
, side_effects
, div_by_zero
;
4729 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4731 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4732 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4733 /* When sizetype precision doesn't match that of pointers
4734 we need to be able to build explicit extensions or truncations
4735 of the offset argument. */
4736 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4737 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4738 && TREE_CODE (arg1
) == INTEGER_CST
);
4740 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4741 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4742 && ptrofftype_p (TREE_TYPE (arg1
)));
4744 t
= make_node (code PASS_MEM_STAT
);
4747 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4748 result based on those same flags for the arguments. But if the
4749 arguments aren't really even `tree' expressions, we shouldn't be trying
4752 /* Expressions without side effects may be constant if their
4753 arguments are as well. */
4754 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4755 || TREE_CODE_CLASS (code
) == tcc_binary
);
4757 side_effects
= TREE_SIDE_EFFECTS (t
);
4761 case TRUNC_DIV_EXPR
:
4763 case FLOOR_DIV_EXPR
:
4764 case ROUND_DIV_EXPR
:
4765 case EXACT_DIV_EXPR
:
4767 case FLOOR_MOD_EXPR
:
4768 case ROUND_MOD_EXPR
:
4769 case TRUNC_MOD_EXPR
:
4770 div_by_zero
= integer_zerop (arg1
);
4773 div_by_zero
= false;
4779 TREE_SIDE_EFFECTS (t
) = side_effects
;
4780 if (code
== MEM_REF
)
4782 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4784 tree o
= TREE_OPERAND (arg0
, 0);
4785 TREE_READONLY (t
) = TREE_READONLY (o
);
4786 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4791 TREE_READONLY (t
) = read_only
;
4792 /* Don't mark X / 0 as constant. */
4793 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4794 TREE_THIS_VOLATILE (t
)
4795 = (TREE_CODE_CLASS (code
) == tcc_reference
4796 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4804 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4805 tree arg2 MEM_STAT_DECL
)
4807 bool constant
, read_only
, side_effects
;
4810 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4811 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4813 t
= make_node (code PASS_MEM_STAT
);
4818 /* As a special exception, if COND_EXPR has NULL branches, we
4819 assume that it is a gimple statement and always consider
4820 it to have side effects. */
4821 if (code
== COND_EXPR
4822 && tt
== void_type_node
4823 && arg1
== NULL_TREE
4824 && arg2
== NULL_TREE
)
4825 side_effects
= true;
4827 side_effects
= TREE_SIDE_EFFECTS (t
);
4833 if (code
== COND_EXPR
)
4834 TREE_READONLY (t
) = read_only
;
4836 TREE_SIDE_EFFECTS (t
) = side_effects
;
4837 TREE_THIS_VOLATILE (t
)
4838 = (TREE_CODE_CLASS (code
) == tcc_reference
4839 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4845 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4846 tree arg2
, tree arg3 MEM_STAT_DECL
)
4848 bool constant
, read_only
, side_effects
;
4851 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4853 t
= make_node (code PASS_MEM_STAT
);
4856 side_effects
= TREE_SIDE_EFFECTS (t
);
4863 TREE_SIDE_EFFECTS (t
) = side_effects
;
4864 TREE_THIS_VOLATILE (t
)
4865 = (TREE_CODE_CLASS (code
) == tcc_reference
4866 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4872 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4873 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4875 bool constant
, read_only
, side_effects
;
4878 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4880 t
= make_node (code PASS_MEM_STAT
);
4883 side_effects
= TREE_SIDE_EFFECTS (t
);
4891 TREE_SIDE_EFFECTS (t
) = side_effects
;
4892 if (code
== TARGET_MEM_REF
)
4894 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4896 tree o
= TREE_OPERAND (arg0
, 0);
4897 TREE_READONLY (t
) = TREE_READONLY (o
);
4898 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4902 TREE_THIS_VOLATILE (t
)
4903 = (TREE_CODE_CLASS (code
) == tcc_reference
4904 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4909 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4910 on the pointer PTR. */
4913 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4915 poly_int64 offset
= 0;
4916 tree ptype
= TREE_TYPE (ptr
);
4918 /* For convenience allow addresses that collapse to a simple base
4920 if (TREE_CODE (ptr
) == ADDR_EXPR
4921 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4922 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4924 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4926 if (TREE_CODE (ptr
) == MEM_REF
)
4928 offset
+= mem_ref_offset (ptr
).force_shwi ();
4929 ptr
= TREE_OPERAND (ptr
, 0);
4932 ptr
= build_fold_addr_expr (ptr
);
4933 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4935 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4936 ptr
, build_int_cst (ptype
, offset
));
4937 SET_EXPR_LOCATION (tem
, loc
);
4941 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4944 mem_ref_offset (const_tree t
)
4946 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4950 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4951 offsetted by OFFSET units. */
4954 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4956 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4957 build_fold_addr_expr (base
),
4958 build_int_cst (ptr_type_node
, offset
));
4959 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4960 recompute_tree_invariant_for_addr_expr (addr
);
4964 /* Similar except don't specify the TREE_TYPE
4965 and leave the TREE_SIDE_EFFECTS as 0.
4966 It is permissible for arguments to be null,
4967 or even garbage if their values do not matter. */
4970 build_nt (enum tree_code code
, ...)
4977 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4981 t
= make_node (code
);
4982 length
= TREE_CODE_LENGTH (code
);
4984 for (i
= 0; i
< length
; i
++)
4985 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4991 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4995 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
5000 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
5001 CALL_EXPR_FN (ret
) = fn
;
5002 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
5003 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
5004 CALL_EXPR_ARG (ret
, ix
) = t
;
5008 /* Create a DECL_... node of code CODE, name NAME (if non-null)
5010 We do NOT enter this node in any sort of symbol table.
5012 LOC is the location of the decl.
5014 layout_decl is used to set up the decl's storage layout.
5015 Other slots are initialized to 0 or null pointers. */
5018 build_decl (location_t loc
, enum tree_code code
, tree name
,
5019 tree type MEM_STAT_DECL
)
5023 t
= make_node (code PASS_MEM_STAT
);
5024 DECL_SOURCE_LOCATION (t
) = loc
;
5026 /* if (type == error_mark_node)
5027 type = integer_type_node; */
5028 /* That is not done, deliberately, so that having error_mark_node
5029 as the type can suppress useless errors in the use of this variable. */
5031 DECL_NAME (t
) = name
;
5032 TREE_TYPE (t
) = type
;
5034 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
5040 /* Builds and returns function declaration with NAME and TYPE. */
5043 build_fn_decl (const char *name
, tree type
)
5045 tree id
= get_identifier (name
);
5046 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
5048 DECL_EXTERNAL (decl
) = 1;
5049 TREE_PUBLIC (decl
) = 1;
5050 DECL_ARTIFICIAL (decl
) = 1;
5051 TREE_NOTHROW (decl
) = 1;
5056 vec
<tree
, va_gc
> *all_translation_units
;
5058 /* Builds a new translation-unit decl with name NAME, queues it in the
5059 global list of translation-unit decls and returns it. */
5062 build_translation_unit_decl (tree name
)
5064 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5066 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5067 vec_safe_push (all_translation_units
, tu
);
5072 /* BLOCK nodes are used to represent the structure of binding contours
5073 and declarations, once those contours have been exited and their contents
5074 compiled. This information is used for outputting debugging info. */
5077 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5079 tree block
= make_node (BLOCK
);
5081 BLOCK_VARS (block
) = vars
;
5082 BLOCK_SUBBLOCKS (block
) = subblocks
;
5083 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5084 BLOCK_CHAIN (block
) = chain
;
5089 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5091 LOC is the location to use in tree T. */
5094 protected_set_expr_location (tree t
, location_t loc
)
5096 if (CAN_HAVE_LOCATION_P (t
))
5097 SET_EXPR_LOCATION (t
, loc
);
5100 /* Data used when collecting DECLs and TYPEs for language data removal. */
5102 struct free_lang_data_d
5104 free_lang_data_d () : decls (100), types (100) {}
5106 /* Worklist to avoid excessive recursion. */
5107 auto_vec
<tree
> worklist
;
5109 /* Set of traversed objects. Used to avoid duplicate visits. */
5110 hash_set
<tree
> pset
;
5112 /* Array of symbols to process with free_lang_data_in_decl. */
5113 auto_vec
<tree
> decls
;
5115 /* Array of types to process with free_lang_data_in_type. */
5116 auto_vec
<tree
> types
;
5120 /* Add type or decl T to one of the list of tree nodes that need their
5121 language data removed. The lists are held inside FLD. */
5124 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5127 fld
->decls
.safe_push (t
);
5128 else if (TYPE_P (t
))
5129 fld
->types
.safe_push (t
);
5134 /* Push tree node T into FLD->WORKLIST. */
5137 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5139 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5140 fld
->worklist
.safe_push ((t
));
5145 /* Return simplified TYPE_NAME of TYPE. */
5148 fld_simplified_type_name (tree type
)
5150 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5151 return TYPE_NAME (type
);
5152 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5153 TYPE_DECL if the type doesn't have linkage.
5154 this must match fld_ */
5155 if (type
!= TYPE_MAIN_VARIANT (type
) || ! type_with_linkage_p (type
))
5156 return DECL_NAME (TYPE_NAME (type
));
5157 return TYPE_NAME (type
);
5160 /* Do same comparsion as check_qualified_type skipping lang part of type
5161 and be more permissive about type names: we only care that names are
5162 same (for diagnostics) and that ODR names are the same.
5163 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5166 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5168 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5169 /* We want to match incomplete variants with complete types.
5170 In this case we need to ignore alignment. */
5171 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5172 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5173 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5174 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5175 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5176 TYPE_ATTRIBUTES (v
))
5177 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5183 /* Find variant of FIRST that match T and create new one if necessary.
5184 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5187 fld_type_variant (tree first
, tree t
, struct free_lang_data_d
*fld
,
5188 tree inner_type
= NULL
)
5190 if (first
== TYPE_MAIN_VARIANT (t
))
5192 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5193 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5195 tree v
= build_variant_type_copy (first
);
5196 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5197 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5198 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5199 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5200 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5201 TYPE_NAME (v
) = TYPE_NAME (t
);
5202 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5203 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5204 /* Variants of incomplete types should have alignment
5205 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5206 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5208 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5209 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5212 TREE_TYPE (v
) = inner_type
;
5213 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5214 add_tree_to_fld_list (v
, fld
);
5218 /* Map complete types to incomplete types. */
5220 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5222 /* Map types to simplified types. */
5224 static hash_map
<tree
, tree
> *fld_simplified_types
;
5226 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5227 use MAP to prevent duplicates. */
5230 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5231 struct free_lang_data_d
*fld
)
5233 if (TREE_TYPE (t
) == t2
)
5236 if (TYPE_MAIN_VARIANT (t
) != t
)
5238 return fld_type_variant
5239 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5240 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5246 = map
->get_or_insert (t
, &existed
);
5249 array
= build_array_type_1 (t2
, TYPE_DOMAIN (t
),
5250 TYPE_TYPELESS_STORAGE (t
), false);
5251 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5252 add_tree_to_fld_list (array
, fld
);
5257 /* Return CTX after removal of contexts that are not relevant */
5260 fld_decl_context (tree ctx
)
5262 /* Variably modified types are needed for tree_is_indexable to decide
5263 whether the type needs to go to local or global section.
5264 This code is semi-broken but for now it is easiest to keep contexts
5266 if (ctx
&& TYPE_P (ctx
)
5267 && !variably_modified_type_p (ctx
, NULL_TREE
))
5269 while (ctx
&& TYPE_P (ctx
))
5270 ctx
= TYPE_CONTEXT (ctx
);
5275 /* For T being aggregate type try to turn it into a incomplete variant.
5276 Return T if no simplification is possible. */
5279 fld_incomplete_type_of (tree t
, struct free_lang_data_d
*fld
)
5283 if (POINTER_TYPE_P (t
))
5285 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5286 if (t2
!= TREE_TYPE (t
))
5289 if (TREE_CODE (t
) == POINTER_TYPE
)
5290 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5291 TYPE_REF_CAN_ALIAS_ALL (t
));
5293 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5294 TYPE_REF_CAN_ALIAS_ALL (t
));
5295 gcc_assert (TYPE_CANONICAL (t2
) != t2
5296 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5297 add_tree_to_fld_list (first
, fld
);
5298 return fld_type_variant (first
, t
, fld
);
5302 if (TREE_CODE (t
) == ARRAY_TYPE
)
5303 return fld_process_array_type (t
,
5304 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5305 fld_incomplete_types
, fld
);
5306 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5307 || !COMPLETE_TYPE_P (t
))
5309 if (TYPE_MAIN_VARIANT (t
) == t
)
5313 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5317 copy
= build_distinct_type_copy (t
);
5319 /* It is possible that type was not seen by free_lang_data yet. */
5320 add_tree_to_fld_list (copy
, fld
);
5321 TYPE_SIZE (copy
) = NULL
;
5322 TYPE_USER_ALIGN (copy
) = 0;
5323 TYPE_SIZE_UNIT (copy
) = NULL
;
5324 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5325 TREE_ADDRESSABLE (copy
) = 0;
5326 if (AGGREGATE_TYPE_P (t
))
5328 SET_TYPE_MODE (copy
, VOIDmode
);
5329 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5330 TYPE_TYPELESS_STORAGE (copy
) = 0;
5331 TYPE_FIELDS (copy
) = NULL
;
5332 TYPE_BINFO (copy
) = NULL
;
5335 TYPE_VALUES (copy
) = NULL
;
5337 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5338 This is needed for ODR violation warnings to come out right (we
5339 want duplicate TYPE_DECLs whenever the type is duplicated because
5340 of ODR violation. Because lang data in the TYPE_DECL may not
5341 have been freed yet, rebuild it from scratch and copy relevant
5343 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5344 tree name
= TYPE_NAME (copy
);
5346 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5348 gcc_checking_assert (TREE_TYPE (name
) == t
);
5349 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5350 DECL_NAME (name
), copy
);
5351 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5352 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5353 SET_DECL_ALIGN (name2
, 0);
5354 DECL_CONTEXT (name2
) = fld_decl_context
5355 (DECL_CONTEXT (name
));
5356 TYPE_NAME (copy
) = name2
;
5361 return (fld_type_variant
5362 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5365 /* Simplify type T for scenarios where we do not need complete pointer
5369 fld_simplified_type (tree t
, struct free_lang_data_d
*fld
)
5373 if (POINTER_TYPE_P (t
))
5374 return fld_incomplete_type_of (t
, fld
);
5375 /* FIXME: This triggers verification error, see PR88140. */
5376 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5377 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5378 fld_simplified_types
, fld
);
5382 /* Reset the expression *EXPR_P, a size or position.
5384 ??? We could reset all non-constant sizes or positions. But it's cheap
5385 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5387 We need to reset self-referential sizes or positions because they cannot
5388 be gimplified and thus can contain a CALL_EXPR after the gimplification
5389 is finished, which will run afoul of LTO streaming. And they need to be
5390 reset to something essentially dummy but not constant, so as to preserve
5391 the properties of the object they are attached to. */
5394 free_lang_data_in_one_sizepos (tree
*expr_p
)
5396 tree expr
= *expr_p
;
5397 if (CONTAINS_PLACEHOLDER_P (expr
))
5398 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5402 /* Reset all the fields in a binfo node BINFO. We only keep
5403 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5406 free_lang_data_in_binfo (tree binfo
)
5411 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5413 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5414 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5415 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5416 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5417 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5419 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5420 free_lang_data_in_binfo (t
);
5424 /* Reset all language specific information still present in TYPE. */
5427 free_lang_data_in_type (tree type
, struct free_lang_data_d
*fld
)
5429 gcc_assert (TYPE_P (type
));
5431 /* Give the FE a chance to remove its own data first. */
5432 lang_hooks
.free_lang_data (type
);
5434 TREE_LANG_FLAG_0 (type
) = 0;
5435 TREE_LANG_FLAG_1 (type
) = 0;
5436 TREE_LANG_FLAG_2 (type
) = 0;
5437 TREE_LANG_FLAG_3 (type
) = 0;
5438 TREE_LANG_FLAG_4 (type
) = 0;
5439 TREE_LANG_FLAG_5 (type
) = 0;
5440 TREE_LANG_FLAG_6 (type
) = 0;
5442 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5444 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5446 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5447 /* Remove the const and volatile qualifiers from arguments. The
5448 C++ front end removes them, but the C front end does not,
5449 leading to false ODR violation errors when merging two
5450 instances of the same function signature compiled by
5451 different front ends. */
5452 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5454 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5455 tree arg_type
= TREE_VALUE (p
);
5457 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5459 int quals
= TYPE_QUALS (arg_type
)
5461 & ~TYPE_QUAL_VOLATILE
;
5462 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5463 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5465 /* C++ FE uses TREE_PURPOSE to store initial values. */
5466 TREE_PURPOSE (p
) = NULL
;
5469 else if (TREE_CODE (type
) == METHOD_TYPE
)
5471 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5472 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5474 /* C++ FE uses TREE_PURPOSE to store initial values. */
5475 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5476 TREE_PURPOSE (p
) = NULL
;
5479 else if (RECORD_OR_UNION_TYPE_P (type
))
5481 /* Remove members that are not FIELD_DECLs from the field list
5482 of an aggregate. These occur in C++. */
5483 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5484 if (TREE_CODE (member
) == FIELD_DECL
)
5485 prev
= &DECL_CHAIN (member
);
5487 *prev
= DECL_CHAIN (member
);
5489 TYPE_VFIELD (type
) = NULL_TREE
;
5491 if (TYPE_BINFO (type
))
5493 free_lang_data_in_binfo (TYPE_BINFO (type
));
5494 /* We need to preserve link to bases and virtual table for all
5495 polymorphic types to make devirtualization machinery working. */
5496 if (!BINFO_VTABLE (TYPE_BINFO (type
))
5497 || !flag_devirtualize
)
5498 TYPE_BINFO (type
) = NULL
;
5501 else if (INTEGRAL_TYPE_P (type
)
5502 || SCALAR_FLOAT_TYPE_P (type
)
5503 || FIXED_POINT_TYPE_P (type
))
5505 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5507 /* Type values are used only for C++ ODR checking. Drop them
5508 for all type variants and non-ODR types.
5509 For ODR types the data is freed in free_odr_warning_data. */
5510 if (TYPE_MAIN_VARIANT (type
) != type
5511 || !type_with_linkage_p (type
))
5512 TYPE_VALUES (type
) = NULL
;
5514 /* Simplify representation by recording only values rather
5515 than const decls. */
5516 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5517 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5518 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5520 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5521 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5524 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5526 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5527 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5529 if (TYPE_CONTEXT (type
)
5530 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5532 tree ctx
= TYPE_CONTEXT (type
);
5535 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5537 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5538 TYPE_CONTEXT (type
) = ctx
;
5541 TYPE_STUB_DECL (type
) = NULL
;
5542 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5546 /* Return true if DECL may need an assembler name to be set. */
5549 need_assembler_name_p (tree decl
)
5551 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5552 Rule merging. This makes type_odr_p to return true on those types during
5553 LTO and by comparing the mangled name, we can say what types are intended
5554 to be equivalent across compilation unit.
5556 We do not store names of type_in_anonymous_namespace_p.
5558 Record, union and enumeration type have linkage that allows use
5559 to check type_in_anonymous_namespace_p. We do not mangle compound types
5560 that always can be compared structurally.
5562 Similarly for builtin types, we compare properties of their main variant.
5563 A special case are integer types where mangling do make differences
5564 between char/signed char/unsigned char etc. Storing name for these makes
5565 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5566 See cp/mangle.c:write_builtin_type for details. */
5568 if (TREE_CODE (decl
) == TYPE_DECL
)
5570 if (flag_lto_odr_type_mering
5572 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5573 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5574 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5575 && (type_with_linkage_p (TREE_TYPE (decl
))
5576 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5577 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5578 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5581 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5582 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5585 /* If DECL already has its assembler name set, it does not need a
5587 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5588 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5591 /* Abstract decls do not need an assembler name. */
5592 if (DECL_ABSTRACT_P (decl
))
5595 /* For VAR_DECLs, only static, public and external symbols need an
5598 && !TREE_STATIC (decl
)
5599 && !TREE_PUBLIC (decl
)
5600 && !DECL_EXTERNAL (decl
))
5603 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5605 /* Do not set assembler name on builtins. Allow RTL expansion to
5606 decide whether to expand inline or via a regular call. */
5607 if (fndecl_built_in_p (decl
)
5608 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5611 /* Functions represented in the callgraph need an assembler name. */
5612 if (cgraph_node::get (decl
) != NULL
)
5615 /* Unused and not public functions don't need an assembler name. */
5616 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5624 /* Reset all language specific information still present in symbol
5628 free_lang_data_in_decl (tree decl
, struct free_lang_data_d
*fld
)
5630 gcc_assert (DECL_P (decl
));
5632 /* Give the FE a chance to remove its own data first. */
5633 lang_hooks
.free_lang_data (decl
);
5635 TREE_LANG_FLAG_0 (decl
) = 0;
5636 TREE_LANG_FLAG_1 (decl
) = 0;
5637 TREE_LANG_FLAG_2 (decl
) = 0;
5638 TREE_LANG_FLAG_3 (decl
) = 0;
5639 TREE_LANG_FLAG_4 (decl
) = 0;
5640 TREE_LANG_FLAG_5 (decl
) = 0;
5641 TREE_LANG_FLAG_6 (decl
) = 0;
5643 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5644 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5645 if (TREE_CODE (decl
) == FIELD_DECL
)
5647 DECL_FCONTEXT (decl
) = NULL
;
5648 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5649 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5650 DECL_QUALIFIER (decl
) = NULL_TREE
;
5653 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5655 struct cgraph_node
*node
;
5656 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5657 the address may be taken in other unit, so this flag has no practical
5660 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5661 for public objects that indeed can not be adressed, but it is not
5662 the case. Set the flag to true so we do not get merge failures for
5663 i.e. virtual tables between units that take address of it and
5664 units that don't. */
5665 if (TREE_PUBLIC (decl
))
5666 TREE_ADDRESSABLE (decl
) = true;
5667 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5668 if (!(node
= cgraph_node::get (decl
))
5669 || (!node
->definition
&& !node
->clones
))
5672 node
->release_body ();
5675 release_function_body (decl
);
5676 DECL_ARGUMENTS (decl
) = NULL
;
5677 DECL_RESULT (decl
) = NULL
;
5678 DECL_INITIAL (decl
) = error_mark_node
;
5681 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5685 /* If DECL has a gimple body, then the context for its
5686 arguments must be DECL. Otherwise, it doesn't really
5687 matter, as we will not be emitting any code for DECL. In
5688 general, there may be other instances of DECL created by
5689 the front end and since PARM_DECLs are generally shared,
5690 their DECL_CONTEXT changes as the replicas of DECL are
5691 created. The only time where DECL_CONTEXT is important
5692 is for the FUNCTION_DECLs that have a gimple body (since
5693 the PARM_DECL will be used in the function's body). */
5694 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5695 DECL_CONTEXT (t
) = decl
;
5696 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5697 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5698 = target_option_default_node
;
5699 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5700 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5701 = optimization_default_node
;
5704 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5705 At this point, it is not needed anymore. */
5706 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5708 /* Clear the abstract origin if it refers to a method.
5709 Otherwise dwarf2out.c will ICE as we splice functions out of
5710 TYPE_FIELDS and thus the origin will not be output
5712 if (DECL_ABSTRACT_ORIGIN (decl
)
5713 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5714 && RECORD_OR_UNION_TYPE_P
5715 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5716 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5718 DECL_VINDEX (decl
) = NULL_TREE
;
5720 else if (VAR_P (decl
))
5722 /* See comment above why we set the flag for functoins. */
5723 if (TREE_PUBLIC (decl
))
5724 TREE_ADDRESSABLE (decl
) = true;
5725 if ((DECL_EXTERNAL (decl
)
5726 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5727 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5728 DECL_INITIAL (decl
) = NULL_TREE
;
5730 else if (TREE_CODE (decl
) == TYPE_DECL
)
5732 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5733 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5734 TREE_PUBLIC (decl
) = 0;
5735 TREE_PRIVATE (decl
) = 0;
5736 DECL_ARTIFICIAL (decl
) = 0;
5737 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5738 DECL_INITIAL (decl
) = NULL_TREE
;
5739 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5740 DECL_MODE (decl
) = VOIDmode
;
5741 SET_DECL_ALIGN (decl
, 0);
5742 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5744 else if (TREE_CODE (decl
) == FIELD_DECL
)
5746 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5747 DECL_INITIAL (decl
) = NULL_TREE
;
5749 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5750 && DECL_INITIAL (decl
)
5751 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5753 /* Strip builtins from the translation-unit BLOCK. We still have targets
5754 without builtin_decl_explicit support and also builtins are shared
5755 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5756 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5760 if (fndecl_built_in_p (var
))
5761 *nextp
= TREE_CHAIN (var
);
5763 nextp
= &TREE_CHAIN (var
);
5766 /* We need to keep field decls associated with their trees. Otherwise tree
5767 merging may merge some fileds and keep others disjoint wich in turn will
5768 not do well with TREE_CHAIN pointers linking them.
5770 Also do not drop containing types for virtual methods and tables because
5771 these are needed by devirtualization. */
5772 if (TREE_CODE (decl
) != FIELD_DECL
5773 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5774 || !DECL_VIRTUAL_P (decl
)))
5775 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5779 /* Operand callback helper for free_lang_data_in_node. *TP is the
5780 subtree operand being considered. */
5783 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5786 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5788 if (TREE_CODE (t
) == TREE_LIST
)
5791 /* Language specific nodes will be removed, so there is no need
5792 to gather anything under them. */
5793 if (is_lang_specific (t
))
5801 /* Note that walk_tree does not traverse every possible field in
5802 decls, so we have to do our own traversals here. */
5803 add_tree_to_fld_list (t
, fld
);
5805 fld_worklist_push (DECL_NAME (t
), fld
);
5806 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5807 fld_worklist_push (DECL_SIZE (t
), fld
);
5808 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5810 /* We are going to remove everything under DECL_INITIAL for
5811 TYPE_DECLs. No point walking them. */
5812 if (TREE_CODE (t
) != TYPE_DECL
)
5813 fld_worklist_push (DECL_INITIAL (t
), fld
);
5815 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5816 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5818 if (TREE_CODE (t
) == FUNCTION_DECL
)
5820 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5821 fld_worklist_push (DECL_RESULT (t
), fld
);
5823 else if (TREE_CODE (t
) == FIELD_DECL
)
5825 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5826 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5827 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5828 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5831 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5832 && DECL_HAS_VALUE_EXPR_P (t
))
5833 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5835 if (TREE_CODE (t
) != FIELD_DECL
5836 && TREE_CODE (t
) != TYPE_DECL
)
5837 fld_worklist_push (TREE_CHAIN (t
), fld
);
5840 else if (TYPE_P (t
))
5842 /* Note that walk_tree does not traverse every possible field in
5843 types, so we have to do our own traversals here. */
5844 add_tree_to_fld_list (t
, fld
);
5846 if (!RECORD_OR_UNION_TYPE_P (t
))
5847 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5848 fld_worklist_push (TYPE_SIZE (t
), fld
);
5849 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5850 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5851 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5852 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5853 fld_worklist_push (TYPE_NAME (t
), fld
);
5854 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5855 lists, we may look types up in these lists and use them while
5856 optimizing the function body. Thus we need to free lang data
5858 if (TREE_CODE (t
) == POINTER_TYPE
)
5859 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5860 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5861 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5862 if (!POINTER_TYPE_P (t
))
5863 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5864 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5865 if (!RECORD_OR_UNION_TYPE_P (t
))
5866 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5867 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5868 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5869 do not and want not to reach unused variants this way. */
5870 if (TYPE_CONTEXT (t
))
5872 tree ctx
= TYPE_CONTEXT (t
);
5873 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5874 So push that instead. */
5875 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5876 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5877 fld_worklist_push (ctx
, fld
);
5879 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5880 and want not to reach unused types this way. */
5882 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5886 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5887 fld_worklist_push (TREE_TYPE (tem
), fld
);
5888 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5889 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5891 if (RECORD_OR_UNION_TYPE_P (t
))
5894 /* Push all TYPE_FIELDS - there can be interleaving interesting
5895 and non-interesting things. */
5896 tem
= TYPE_FIELDS (t
);
5899 if (TREE_CODE (tem
) == FIELD_DECL
)
5900 fld_worklist_push (tem
, fld
);
5901 tem
= TREE_CHAIN (tem
);
5904 if (FUNC_OR_METHOD_TYPE_P (t
))
5905 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5907 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5910 else if (TREE_CODE (t
) == BLOCK
)
5912 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5914 if (TREE_CODE (*tem
) != VAR_DECL
5915 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
)))
5917 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5918 && TREE_CODE (*tem
) != PARM_DECL
);
5919 *tem
= TREE_CHAIN (*tem
);
5923 fld_worklist_push (*tem
, fld
);
5924 tem
= &TREE_CHAIN (*tem
);
5927 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5928 fld_worklist_push (tem
, fld
);
5929 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5932 if (TREE_CODE (t
) != IDENTIFIER_NODE
5933 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5934 fld_worklist_push (TREE_TYPE (t
), fld
);
5940 /* Find decls and types in T. */
5943 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5947 if (!fld
->pset
.contains (t
))
5948 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5949 if (fld
->worklist
.is_empty ())
5951 t
= fld
->worklist
.pop ();
5955 /* Translate all the types in LIST with the corresponding runtime
5959 get_eh_types_for_runtime (tree list
)
5963 if (list
== NULL_TREE
)
5966 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5968 list
= TREE_CHAIN (list
);
5971 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5972 TREE_CHAIN (prev
) = n
;
5973 prev
= TREE_CHAIN (prev
);
5974 list
= TREE_CHAIN (list
);
5981 /* Find decls and types referenced in EH region R and store them in
5982 FLD->DECLS and FLD->TYPES. */
5985 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5996 /* The types referenced in each catch must first be changed to the
5997 EH types used at runtime. This removes references to FE types
5999 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6001 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6002 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6007 case ERT_ALLOWED_EXCEPTIONS
:
6008 r
->u
.allowed
.type_list
6009 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6010 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6013 case ERT_MUST_NOT_THROW
:
6014 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6015 find_decls_types_r
, fld
, &fld
->pset
);
6021 /* Find decls and types referenced in cgraph node N and store them in
6022 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6023 look for *every* kind of DECL and TYPE node reachable from N,
6024 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6025 NAMESPACE_DECLs, etc). */
6028 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
6031 struct function
*fn
;
6035 find_decls_types (n
->decl
, fld
);
6037 if (!gimple_has_body_p (n
->decl
))
6040 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6042 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6044 /* Traverse locals. */
6045 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6046 find_decls_types (t
, fld
);
6048 /* Traverse EH regions in FN. */
6051 FOR_ALL_EH_REGION_FN (r
, fn
)
6052 find_decls_types_in_eh_region (r
, fld
);
6055 /* Traverse every statement in FN. */
6056 FOR_EACH_BB_FN (bb
, fn
)
6059 gimple_stmt_iterator si
;
6062 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6064 gphi
*phi
= psi
.phi ();
6066 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6068 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6069 find_decls_types (*arg_p
, fld
);
6073 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6075 gimple
*stmt
= gsi_stmt (si
);
6077 if (is_gimple_call (stmt
))
6078 find_decls_types (gimple_call_fntype (stmt
), fld
);
6080 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6082 tree arg
= gimple_op (stmt
, i
);
6083 find_decls_types (arg
, fld
);
6090 /* Find decls and types referenced in varpool node N and store them in
6091 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6092 look for *every* kind of DECL and TYPE node reachable from N,
6093 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6094 NAMESPACE_DECLs, etc). */
6097 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
6099 find_decls_types (v
->decl
, fld
);
6102 /* If T needs an assembler name, have one created for it. */
6105 assign_assembler_name_if_needed (tree t
)
6107 if (need_assembler_name_p (t
))
6109 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6110 diagnostics that use input_location to show locus
6111 information. The problem here is that, at this point,
6112 input_location is generally anchored to the end of the file
6113 (since the parser is long gone), so we don't have a good
6114 position to pin it to.
6116 To alleviate this problem, this uses the location of T's
6117 declaration. Examples of this are
6118 testsuite/g++.dg/template/cond2.C and
6119 testsuite/g++.dg/template/pr35240.C. */
6120 location_t saved_location
= input_location
;
6121 input_location
= DECL_SOURCE_LOCATION (t
);
6123 decl_assembler_name (t
);
6125 input_location
= saved_location
;
6130 /* Free language specific information for every operand and expression
6131 in every node of the call graph. This process operates in three stages:
6133 1- Every callgraph node and varpool node is traversed looking for
6134 decls and types embedded in them. This is a more exhaustive
6135 search than that done by find_referenced_vars, because it will
6136 also collect individual fields, decls embedded in types, etc.
6138 2- All the decls found are sent to free_lang_data_in_decl.
6140 3- All the types found are sent to free_lang_data_in_type.
6142 The ordering between decls and types is important because
6143 free_lang_data_in_decl sets assembler names, which includes
6144 mangling. So types cannot be freed up until assembler names have
6148 free_lang_data_in_cgraph (struct free_lang_data_d
*fld
)
6150 struct cgraph_node
*n
;
6156 /* Find decls and types in the body of every function in the callgraph. */
6157 FOR_EACH_FUNCTION (n
)
6158 find_decls_types_in_node (n
, fld
);
6160 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6161 find_decls_types (p
->decl
, fld
);
6163 /* Find decls and types in every varpool symbol. */
6164 FOR_EACH_VARIABLE (v
)
6165 find_decls_types_in_var (v
, fld
);
6167 /* Set the assembler name on every decl found. We need to do this
6168 now because free_lang_data_in_decl will invalidate data needed
6169 for mangling. This breaks mangling on interdependent decls. */
6170 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6171 assign_assembler_name_if_needed (t
);
6173 /* Traverse every decl found freeing its language data. */
6174 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6175 free_lang_data_in_decl (t
, fld
);
6177 /* Traverse every type found freeing its language data. */
6178 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6179 free_lang_data_in_type (t
, fld
);
6183 /* Free resources that are used by FE but are not needed once they are done. */
6186 free_lang_data (void)
6189 struct free_lang_data_d fld
;
6191 /* If we are the LTO frontend we have freed lang-specific data already. */
6193 || (!flag_generate_lto
&& !flag_generate_offload
))
6195 /* Rebuild type inheritance graph even when not doing LTO to get
6196 consistent profile data. */
6197 rebuild_type_inheritance_graph ();
6201 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6202 fld_simplified_types
= new hash_map
<tree
, tree
>;
6204 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6205 if (vec_safe_is_empty (all_translation_units
))
6206 build_translation_unit_decl (NULL_TREE
);
6208 /* Allocate and assign alias sets to the standard integer types
6209 while the slots are still in the way the frontends generated them. */
6210 for (i
= 0; i
< itk_none
; ++i
)
6211 if (integer_types
[i
])
6212 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6214 /* Traverse the IL resetting language specific information for
6215 operands, expressions, etc. */
6216 free_lang_data_in_cgraph (&fld
);
6218 /* Create gimple variants for common types. */
6219 for (unsigned i
= 0;
6220 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6222 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6224 /* Reset some langhooks. Do not reset types_compatible_p, it may
6225 still be used indirectly via the get_alias_set langhook. */
6226 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6227 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6228 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6229 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6230 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6231 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6232 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6233 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6235 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6242 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6246 /* We do not want the default decl_assembler_name implementation,
6247 rather if we have fixed everything we want a wrapper around it
6248 asserting that all non-local symbols already got their assembler
6249 name and only produce assembler names for local symbols. Or rather
6250 make sure we never call decl_assembler_name on local symbols and
6251 devise a separate, middle-end private scheme for it. */
6253 /* Reset diagnostic machinery. */
6254 tree_diagnostics_defaults (global_dc
);
6256 rebuild_type_inheritance_graph ();
6258 delete fld_incomplete_types
;
6259 delete fld_simplified_types
;
6267 const pass_data pass_data_ipa_free_lang_data
=
6269 SIMPLE_IPA_PASS
, /* type */
6270 "*free_lang_data", /* name */
6271 OPTGROUP_NONE
, /* optinfo_flags */
6272 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6273 0, /* properties_required */
6274 0, /* properties_provided */
6275 0, /* properties_destroyed */
6276 0, /* todo_flags_start */
6277 0, /* todo_flags_finish */
6280 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6283 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6284 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6287 /* opt_pass methods: */
6288 virtual unsigned int execute (function
*) { return free_lang_data (); }
6290 }; // class pass_ipa_free_lang_data
6294 simple_ipa_opt_pass
*
6295 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6297 return new pass_ipa_free_lang_data (ctxt
);
6300 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6301 of the various TYPE_QUAL values. */
6304 set_type_quals (tree type
, int type_quals
)
6306 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6307 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6308 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6309 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6310 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6313 /* Returns true iff CAND and BASE have equivalent language-specific
6317 check_lang_type (const_tree cand
, const_tree base
)
6319 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6321 /* type_hash_eq currently only applies to these types. */
6322 if (TREE_CODE (cand
) != FUNCTION_TYPE
6323 && TREE_CODE (cand
) != METHOD_TYPE
)
6325 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6328 /* Returns true iff unqualified CAND and BASE are equivalent. */
6331 check_base_type (const_tree cand
, const_tree base
)
6333 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6334 /* Apparently this is needed for Objective-C. */
6335 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6336 /* Check alignment. */
6337 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6338 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6339 TYPE_ATTRIBUTES (base
)));
6342 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6345 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6347 return (TYPE_QUALS (cand
) == type_quals
6348 && check_base_type (cand
, base
)
6349 && check_lang_type (cand
, base
));
6352 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6355 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6357 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6358 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6359 /* Apparently this is needed for Objective-C. */
6360 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6361 /* Check alignment. */
6362 && TYPE_ALIGN (cand
) == align
6363 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6364 TYPE_ATTRIBUTES (base
))
6365 && check_lang_type (cand
, base
));
6368 /* This function checks to see if TYPE matches the size one of the built-in
6369 atomic types, and returns that core atomic type. */
6372 find_atomic_core_type (tree type
)
6374 tree base_atomic_type
;
6376 /* Only handle complete types. */
6377 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6380 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6383 base_atomic_type
= atomicQI_type_node
;
6387 base_atomic_type
= atomicHI_type_node
;
6391 base_atomic_type
= atomicSI_type_node
;
6395 base_atomic_type
= atomicDI_type_node
;
6399 base_atomic_type
= atomicTI_type_node
;
6403 base_atomic_type
= NULL_TREE
;
6406 return base_atomic_type
;
6409 /* Return a version of the TYPE, qualified as indicated by the
6410 TYPE_QUALS, if one exists. If no qualified version exists yet,
6411 return NULL_TREE. */
6414 get_qualified_type (tree type
, int type_quals
)
6418 if (TYPE_QUALS (type
) == type_quals
)
6421 /* Search the chain of variants to see if there is already one there just
6422 like the one we need to have. If so, use that existing one. We must
6423 preserve the TYPE_NAME, since there is code that depends on this. */
6424 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6425 if (check_qualified_type (t
, type
, type_quals
))
6431 /* Like get_qualified_type, but creates the type if it does not
6432 exist. This function never returns NULL_TREE. */
6435 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6439 /* See if we already have the appropriate qualified variant. */
6440 t
= get_qualified_type (type
, type_quals
);
6442 /* If not, build it. */
6445 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6446 set_type_quals (t
, type_quals
);
6448 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6450 /* See if this object can map to a basic atomic type. */
6451 tree atomic_type
= find_atomic_core_type (type
);
6454 /* Ensure the alignment of this type is compatible with
6455 the required alignment of the atomic type. */
6456 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6457 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6461 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6462 /* Propagate structural equality. */
6463 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6464 else if (TYPE_CANONICAL (type
) != type
)
6465 /* Build the underlying canonical type, since it is different
6468 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6469 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6472 /* T is its own canonical type. */
6473 TYPE_CANONICAL (t
) = t
;
6480 /* Create a variant of type T with alignment ALIGN. */
6483 build_aligned_type (tree type
, unsigned int align
)
6487 if (TYPE_PACKED (type
)
6488 || TYPE_ALIGN (type
) == align
)
6491 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6492 if (check_aligned_type (t
, type
, align
))
6495 t
= build_variant_type_copy (type
);
6496 SET_TYPE_ALIGN (t
, align
);
6497 TYPE_USER_ALIGN (t
) = 1;
6502 /* Create a new distinct copy of TYPE. The new type is made its own
6503 MAIN_VARIANT. If TYPE requires structural equality checks, the
6504 resulting type requires structural equality checks; otherwise, its
6505 TYPE_CANONICAL points to itself. */
6508 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6510 tree t
= copy_node (type PASS_MEM_STAT
);
6512 TYPE_POINTER_TO (t
) = 0;
6513 TYPE_REFERENCE_TO (t
) = 0;
6515 /* Set the canonical type either to a new equivalence class, or
6516 propagate the need for structural equality checks. */
6517 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6518 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6520 TYPE_CANONICAL (t
) = t
;
6522 /* Make it its own variant. */
6523 TYPE_MAIN_VARIANT (t
) = t
;
6524 TYPE_NEXT_VARIANT (t
) = 0;
6526 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6527 whose TREE_TYPE is not t. This can also happen in the Ada
6528 frontend when using subtypes. */
6533 /* Create a new variant of TYPE, equivalent but distinct. This is so
6534 the caller can modify it. TYPE_CANONICAL for the return type will
6535 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6536 are considered equal by the language itself (or that both types
6537 require structural equality checks). */
6540 build_variant_type_copy (tree type MEM_STAT_DECL
)
6542 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6544 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6546 /* Since we're building a variant, assume that it is a non-semantic
6547 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6548 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6549 /* Type variants have no alias set defined. */
6550 TYPE_ALIAS_SET (t
) = -1;
6552 /* Add the new type to the chain of variants of TYPE. */
6553 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6554 TYPE_NEXT_VARIANT (m
) = t
;
6555 TYPE_MAIN_VARIANT (t
) = m
;
6560 /* Return true if the from tree in both tree maps are equal. */
6563 tree_map_base_eq (const void *va
, const void *vb
)
6565 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6566 *const b
= (const struct tree_map_base
*) vb
;
6567 return (a
->from
== b
->from
);
6570 /* Hash a from tree in a tree_base_map. */
6573 tree_map_base_hash (const void *item
)
6575 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6578 /* Return true if this tree map structure is marked for garbage collection
6579 purposes. We simply return true if the from tree is marked, so that this
6580 structure goes away when the from tree goes away. */
6583 tree_map_base_marked_p (const void *p
)
6585 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6588 /* Hash a from tree in a tree_map. */
6591 tree_map_hash (const void *item
)
6593 return (((const struct tree_map
*) item
)->hash
);
6596 /* Hash a from tree in a tree_decl_map. */
6599 tree_decl_map_hash (const void *item
)
6601 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6604 /* Return the initialization priority for DECL. */
6607 decl_init_priority_lookup (tree decl
)
6609 symtab_node
*snode
= symtab_node::get (decl
);
6612 return DEFAULT_INIT_PRIORITY
;
6614 snode
->get_init_priority ();
6617 /* Return the finalization priority for DECL. */
6620 decl_fini_priority_lookup (tree decl
)
6622 cgraph_node
*node
= cgraph_node::get (decl
);
6625 return DEFAULT_INIT_PRIORITY
;
6627 node
->get_fini_priority ();
6630 /* Set the initialization priority for DECL to PRIORITY. */
6633 decl_init_priority_insert (tree decl
, priority_type priority
)
6635 struct symtab_node
*snode
;
6637 if (priority
== DEFAULT_INIT_PRIORITY
)
6639 snode
= symtab_node::get (decl
);
6643 else if (VAR_P (decl
))
6644 snode
= varpool_node::get_create (decl
);
6646 snode
= cgraph_node::get_create (decl
);
6647 snode
->set_init_priority (priority
);
6650 /* Set the finalization priority for DECL to PRIORITY. */
6653 decl_fini_priority_insert (tree decl
, priority_type priority
)
6655 struct cgraph_node
*node
;
6657 if (priority
== DEFAULT_INIT_PRIORITY
)
6659 node
= cgraph_node::get (decl
);
6664 node
= cgraph_node::get_create (decl
);
6665 node
->set_fini_priority (priority
);
6668 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6671 print_debug_expr_statistics (void)
6673 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6674 (long) debug_expr_for_decl
->size (),
6675 (long) debug_expr_for_decl
->elements (),
6676 debug_expr_for_decl
->collisions ());
6679 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6682 print_value_expr_statistics (void)
6684 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6685 (long) value_expr_for_decl
->size (),
6686 (long) value_expr_for_decl
->elements (),
6687 value_expr_for_decl
->collisions ());
6690 /* Lookup a debug expression for FROM, and return it if we find one. */
6693 decl_debug_expr_lookup (tree from
)
6695 struct tree_decl_map
*h
, in
;
6696 in
.base
.from
= from
;
6698 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6704 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6707 decl_debug_expr_insert (tree from
, tree to
)
6709 struct tree_decl_map
*h
;
6711 h
= ggc_alloc
<tree_decl_map
> ();
6712 h
->base
.from
= from
;
6714 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6717 /* Lookup a value expression for FROM, and return it if we find one. */
6720 decl_value_expr_lookup (tree from
)
6722 struct tree_decl_map
*h
, in
;
6723 in
.base
.from
= from
;
6725 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6731 /* Insert a mapping FROM->TO in the value expression hashtable. */
6734 decl_value_expr_insert (tree from
, tree to
)
6736 struct tree_decl_map
*h
;
6738 h
= ggc_alloc
<tree_decl_map
> ();
6739 h
->base
.from
= from
;
6741 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6744 /* Lookup a vector of debug arguments for FROM, and return it if we
6748 decl_debug_args_lookup (tree from
)
6750 struct tree_vec_map
*h
, in
;
6752 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6754 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6755 in
.base
.from
= from
;
6756 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6762 /* Insert a mapping FROM->empty vector of debug arguments in the value
6763 expression hashtable. */
6766 decl_debug_args_insert (tree from
)
6768 struct tree_vec_map
*h
;
6771 if (DECL_HAS_DEBUG_ARGS_P (from
))
6772 return decl_debug_args_lookup (from
);
6773 if (debug_args_for_decl
== NULL
)
6774 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6775 h
= ggc_alloc
<tree_vec_map
> ();
6776 h
->base
.from
= from
;
6778 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6780 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6784 /* Hashing of types so that we don't make duplicates.
6785 The entry point is `type_hash_canon'. */
6787 /* Generate the default hash code for TYPE. This is designed for
6788 speed, rather than maximum entropy. */
6791 type_hash_canon_hash (tree type
)
6793 inchash::hash hstate
;
6795 hstate
.add_int (TREE_CODE (type
));
6797 if (TREE_TYPE (type
))
6798 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6800 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6801 /* Just the identifier is adequate to distinguish. */
6802 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6804 switch (TREE_CODE (type
))
6807 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6810 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6811 if (TREE_VALUE (t
) != error_mark_node
)
6812 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6816 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6821 if (TYPE_DOMAIN (type
))
6822 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6823 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6825 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6826 hstate
.add_object (typeless
);
6833 tree t
= TYPE_MAX_VALUE (type
);
6835 t
= TYPE_MIN_VALUE (type
);
6836 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6837 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6842 case FIXED_POINT_TYPE
:
6844 unsigned prec
= TYPE_PRECISION (type
);
6845 hstate
.add_object (prec
);
6850 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6857 return hstate
.end ();
6860 /* These are the Hashtable callback functions. */
6862 /* Returns true iff the types are equivalent. */
6865 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6867 /* First test the things that are the same for all types. */
6868 if (a
->hash
!= b
->hash
6869 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6870 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6871 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6872 TYPE_ATTRIBUTES (b
->type
))
6873 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6874 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6877 /* Be careful about comparing arrays before and after the element type
6878 has been completed; don't compare TYPE_ALIGN unless both types are
6880 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6881 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6882 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6885 switch (TREE_CODE (a
->type
))
6890 case REFERENCE_TYPE
:
6895 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6896 TYPE_VECTOR_SUBPARTS (b
->type
));
6899 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6900 && !(TYPE_VALUES (a
->type
)
6901 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6902 && TYPE_VALUES (b
->type
)
6903 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6904 && type_list_equal (TYPE_VALUES (a
->type
),
6905 TYPE_VALUES (b
->type
))))
6913 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6915 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6916 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6917 TYPE_MAX_VALUE (b
->type
)))
6918 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6919 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6920 TYPE_MIN_VALUE (b
->type
))));
6922 case FIXED_POINT_TYPE
:
6923 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6926 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6929 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6930 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6931 || (TYPE_ARG_TYPES (a
->type
)
6932 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6933 && TYPE_ARG_TYPES (b
->type
)
6934 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6935 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6936 TYPE_ARG_TYPES (b
->type
)))))
6940 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6941 where the flag should be inherited from the element type
6942 and can change after ARRAY_TYPEs are created; on non-aggregates
6943 compare it and hash it, scalars will never have that flag set
6944 and we need to differentiate between arrays created by different
6945 front-ends or middle-end created arrays. */
6946 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6947 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6948 || (TYPE_TYPELESS_STORAGE (a
->type
)
6949 == TYPE_TYPELESS_STORAGE (b
->type
))));
6953 case QUAL_UNION_TYPE
:
6954 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6955 || (TYPE_FIELDS (a
->type
)
6956 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6957 && TYPE_FIELDS (b
->type
)
6958 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6959 && type_list_equal (TYPE_FIELDS (a
->type
),
6960 TYPE_FIELDS (b
->type
))));
6963 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6964 || (TYPE_ARG_TYPES (a
->type
)
6965 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6966 && TYPE_ARG_TYPES (b
->type
)
6967 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6968 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6969 TYPE_ARG_TYPES (b
->type
))))
6977 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6978 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6983 /* Given TYPE, and HASHCODE its hash code, return the canonical
6984 object for an identical type if one already exists.
6985 Otherwise, return TYPE, and record it as the canonical object.
6987 To use this function, first create a type of the sort you want.
6988 Then compute its hash code from the fields of the type that
6989 make it different from other similar types.
6990 Then call this function and use the value. */
6993 type_hash_canon (unsigned int hashcode
, tree type
)
6998 /* The hash table only contains main variants, so ensure that's what we're
7000 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7002 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7003 must call that routine before comparing TYPE_ALIGNs. */
7009 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7012 tree t1
= ((type_hash
*) *loc
)->type
;
7013 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7015 if (TYPE_UID (type
) + 1 == next_type_uid
)
7017 /* Free also min/max values and the cache for integer
7018 types. This can't be done in free_node, as LTO frees
7019 those on its own. */
7020 if (TREE_CODE (type
) == INTEGER_TYPE
)
7022 if (TYPE_MIN_VALUE (type
)
7023 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7025 /* Zero is always in TYPE_CACHED_VALUES. */
7026 if (! TYPE_UNSIGNED (type
))
7027 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7028 ggc_free (TYPE_MIN_VALUE (type
));
7030 if (TYPE_MAX_VALUE (type
)
7031 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7033 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7034 ggc_free (TYPE_MAX_VALUE (type
));
7036 if (TYPE_CACHED_VALUES_P (type
))
7037 ggc_free (TYPE_CACHED_VALUES (type
));
7044 struct type_hash
*h
;
7046 h
= ggc_alloc
<type_hash
> ();
7056 print_type_hash_statistics (void)
7058 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7059 (long) type_hash_table
->size (),
7060 (long) type_hash_table
->elements (),
7061 type_hash_table
->collisions ());
7064 /* Given two lists of types
7065 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7066 return 1 if the lists contain the same types in the same order.
7067 Also, the TREE_PURPOSEs must match. */
7070 type_list_equal (const_tree l1
, const_tree l2
)
7074 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7075 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7076 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7077 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7078 && (TREE_TYPE (TREE_PURPOSE (t1
))
7079 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7085 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7086 given by TYPE. If the argument list accepts variable arguments,
7087 then this function counts only the ordinary arguments. */
7090 type_num_arguments (const_tree fntype
)
7094 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7095 /* If the function does not take a variable number of arguments,
7096 the last element in the list will have type `void'. */
7097 if (VOID_TYPE_P (TREE_VALUE (t
)))
7105 /* Return the type of the function TYPE's argument ARGNO if known.
7106 For vararg function's where ARGNO refers to one of the variadic
7107 arguments return null. Otherwise, return a void_type_node for
7108 out-of-bounds ARGNO. */
7111 type_argument_type (const_tree fntype
, unsigned argno
)
7113 /* Treat zero the same as an out-of-bounds argument number. */
7115 return void_type_node
;
7117 function_args_iterator iter
;
7121 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7123 /* A vararg function's argument list ends in a null. Otherwise,
7124 an ordinary function's argument list ends with void. Return
7125 null if ARGNO refers to a vararg argument, void_type_node if
7126 it's out of bounds, and the formal argument type otherwise. */
7130 if (i
== argno
|| VOID_TYPE_P (argtype
))
7139 /* Nonzero if integer constants T1 and T2
7140 represent the same constant value. */
7143 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7148 if (t1
== 0 || t2
== 0)
7151 STRIP_ANY_LOCATION_WRAPPER (t1
);
7152 STRIP_ANY_LOCATION_WRAPPER (t2
);
7154 if (TREE_CODE (t1
) == INTEGER_CST
7155 && TREE_CODE (t2
) == INTEGER_CST
7156 && wi::to_widest (t1
) == wi::to_widest (t2
))
7162 /* Return true if T is an INTEGER_CST whose numerical value (extended
7163 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7166 tree_fits_shwi_p (const_tree t
)
7168 return (t
!= NULL_TREE
7169 && TREE_CODE (t
) == INTEGER_CST
7170 && wi::fits_shwi_p (wi::to_widest (t
)));
7173 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7174 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7177 tree_fits_poly_int64_p (const_tree t
)
7181 if (POLY_INT_CST_P (t
))
7183 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7184 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7188 return (TREE_CODE (t
) == INTEGER_CST
7189 && wi::fits_shwi_p (wi::to_widest (t
)));
7192 /* Return true if T is an INTEGER_CST whose numerical value (extended
7193 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7196 tree_fits_uhwi_p (const_tree t
)
7198 return (t
!= NULL_TREE
7199 && TREE_CODE (t
) == INTEGER_CST
7200 && wi::fits_uhwi_p (wi::to_widest (t
)));
7203 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7204 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7207 tree_fits_poly_uint64_p (const_tree t
)
7211 if (POLY_INT_CST_P (t
))
7213 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7214 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7218 return (TREE_CODE (t
) == INTEGER_CST
7219 && wi::fits_uhwi_p (wi::to_widest (t
)));
7222 /* T is an INTEGER_CST whose numerical value (extended according to
7223 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7227 tree_to_shwi (const_tree t
)
7229 gcc_assert (tree_fits_shwi_p (t
));
7230 return TREE_INT_CST_LOW (t
);
7233 /* T is an INTEGER_CST whose numerical value (extended according to
7234 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7237 unsigned HOST_WIDE_INT
7238 tree_to_uhwi (const_tree t
)
7240 gcc_assert (tree_fits_uhwi_p (t
));
7241 return TREE_INT_CST_LOW (t
);
7244 /* Return the most significant (sign) bit of T. */
7247 tree_int_cst_sign_bit (const_tree t
)
7249 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7251 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7254 /* Return an indication of the sign of the integer constant T.
7255 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7256 Note that -1 will never be returned if T's type is unsigned. */
7259 tree_int_cst_sgn (const_tree t
)
7261 if (wi::to_wide (t
) == 0)
7263 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7265 else if (wi::neg_p (wi::to_wide (t
)))
7271 /* Return the minimum number of bits needed to represent VALUE in a
7272 signed or unsigned type, UNSIGNEDP says which. */
7275 tree_int_cst_min_precision (tree value
, signop sgn
)
7277 /* If the value is negative, compute its negative minus 1. The latter
7278 adjustment is because the absolute value of the largest negative value
7279 is one larger than the largest positive value. This is equivalent to
7280 a bit-wise negation, so use that operation instead. */
7282 if (tree_int_cst_sgn (value
) < 0)
7283 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7285 /* Return the number of bits needed, taking into account the fact
7286 that we need one more bit for a signed than unsigned type.
7287 If value is 0 or -1, the minimum precision is 1 no matter
7288 whether unsignedp is true or false. */
7290 if (integer_zerop (value
))
7293 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7296 /* Return truthvalue of whether T1 is the same tree structure as T2.
7297 Return 1 if they are the same.
7298 Return 0 if they are understandably different.
7299 Return -1 if either contains tree structure not understood by
7303 simple_cst_equal (const_tree t1
, const_tree t2
)
7305 enum tree_code code1
, code2
;
7311 if (t1
== 0 || t2
== 0)
7314 /* For location wrappers to be the same, they must be at the same
7315 source location (and wrap the same thing). */
7316 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7318 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7320 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7323 code1
= TREE_CODE (t1
);
7324 code2
= TREE_CODE (t2
);
7326 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7328 if (CONVERT_EXPR_CODE_P (code2
)
7329 || code2
== NON_LVALUE_EXPR
)
7330 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7332 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7335 else if (CONVERT_EXPR_CODE_P (code2
)
7336 || code2
== NON_LVALUE_EXPR
)
7337 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7345 return wi::to_widest (t1
) == wi::to_widest (t2
);
7348 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7351 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7354 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7355 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7356 TREE_STRING_LENGTH (t1
)));
7360 unsigned HOST_WIDE_INT idx
;
7361 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7362 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7364 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7367 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7368 /* ??? Should we handle also fields here? */
7369 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7375 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7378 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7381 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7384 const_tree arg1
, arg2
;
7385 const_call_expr_arg_iterator iter1
, iter2
;
7386 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7387 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7389 arg1
= next_const_call_expr_arg (&iter1
),
7390 arg2
= next_const_call_expr_arg (&iter2
))
7392 cmp
= simple_cst_equal (arg1
, arg2
);
7396 return arg1
== arg2
;
7400 /* Special case: if either target is an unallocated VAR_DECL,
7401 it means that it's going to be unified with whatever the
7402 TARGET_EXPR is really supposed to initialize, so treat it
7403 as being equivalent to anything. */
7404 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7405 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7406 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7407 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7408 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7409 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7412 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7417 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7419 case WITH_CLEANUP_EXPR
:
7420 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7424 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7427 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7428 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7439 if (POLY_INT_CST_P (t1
))
7440 /* A false return means maybe_ne rather than known_ne. */
7441 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7442 TYPE_SIGN (TREE_TYPE (t1
))),
7443 poly_widest_int::from (poly_int_cst_value (t2
),
7444 TYPE_SIGN (TREE_TYPE (t2
))));
7448 /* This general rule works for most tree codes. All exceptions should be
7449 handled above. If this is a language-specific tree code, we can't
7450 trust what might be in the operand, so say we don't know
7452 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7455 switch (TREE_CODE_CLASS (code1
))
7459 case tcc_comparison
:
7460 case tcc_expression
:
7464 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7466 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7478 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7479 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7480 than U, respectively. */
7483 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7485 if (tree_int_cst_sgn (t
) < 0)
7487 else if (!tree_fits_uhwi_p (t
))
7489 else if (TREE_INT_CST_LOW (t
) == u
)
7491 else if (TREE_INT_CST_LOW (t
) < u
)
7497 /* Return true if SIZE represents a constant size that is in bounds of
7498 what the middle-end and the backend accepts (covering not more than
7499 half of the address-space). */
7502 valid_constant_size_p (const_tree size
)
7504 if (POLY_INT_CST_P (size
))
7506 if (TREE_OVERFLOW (size
))
7508 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7509 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7513 if (! tree_fits_uhwi_p (size
)
7514 || TREE_OVERFLOW (size
)
7515 || tree_int_cst_sign_bit (size
) != 0)
7520 /* Return the precision of the type, or for a complex or vector type the
7521 precision of the type of its elements. */
7524 element_precision (const_tree type
)
7527 type
= TREE_TYPE (type
);
7528 enum tree_code code
= TREE_CODE (type
);
7529 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7530 type
= TREE_TYPE (type
);
7532 return TYPE_PRECISION (type
);
7535 /* Return true if CODE represents an associative tree code. Otherwise
7538 associative_tree_code (enum tree_code code
)
7557 /* Return true if CODE represents a commutative tree code. Otherwise
7560 commutative_tree_code (enum tree_code code
)
7566 case MULT_HIGHPART_EXPR
:
7574 case UNORDERED_EXPR
:
7578 case TRUTH_AND_EXPR
:
7579 case TRUTH_XOR_EXPR
:
7581 case WIDEN_MULT_EXPR
:
7582 case VEC_WIDEN_MULT_HI_EXPR
:
7583 case VEC_WIDEN_MULT_LO_EXPR
:
7584 case VEC_WIDEN_MULT_EVEN_EXPR
:
7585 case VEC_WIDEN_MULT_ODD_EXPR
:
7594 /* Return true if CODE represents a ternary tree code for which the
7595 first two operands are commutative. Otherwise return false. */
7597 commutative_ternary_tree_code (enum tree_code code
)
7601 case WIDEN_MULT_PLUS_EXPR
:
7602 case WIDEN_MULT_MINUS_EXPR
:
7612 /* Returns true if CODE can overflow. */
7615 operation_can_overflow (enum tree_code code
)
7623 /* Can overflow in various ways. */
7625 case TRUNC_DIV_EXPR
:
7626 case EXACT_DIV_EXPR
:
7627 case FLOOR_DIV_EXPR
:
7629 /* For INT_MIN / -1. */
7636 /* These operators cannot overflow. */
7641 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7642 ftrapv doesn't generate trapping insns for CODE. */
7645 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7647 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7649 /* We don't generate instructions that trap on overflow for complex or vector
7651 if (!INTEGRAL_TYPE_P (type
))
7654 if (!TYPE_OVERFLOW_TRAPS (type
))
7664 /* These operators can overflow, and -ftrapv generates trapping code for
7667 case TRUNC_DIV_EXPR
:
7668 case EXACT_DIV_EXPR
:
7669 case FLOOR_DIV_EXPR
:
7672 /* These operators can overflow, but -ftrapv does not generate trapping
7676 /* These operators cannot overflow. */
7684 /* Generate a hash value for an expression. This can be used iteratively
7685 by passing a previous result as the HSTATE argument.
7687 This function is intended to produce the same hash for expressions which
7688 would compare equal using operand_equal_p. */
7690 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7693 enum tree_code code
;
7694 enum tree_code_class tclass
;
7696 if (t
== NULL_TREE
|| t
== error_mark_node
)
7698 hstate
.merge_hash (0);
7702 if (!(flags
& OEP_ADDRESS_OF
))
7705 code
= TREE_CODE (t
);
7709 /* Alas, constants aren't shared, so we can't rely on pointer
7712 hstate
.merge_hash (0);
7715 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7716 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7717 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7722 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7725 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7726 hstate
.merge_hash (val2
);
7731 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7732 hstate
.merge_hash (val2
);
7736 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7737 TREE_STRING_LENGTH (t
));
7740 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7741 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7745 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7746 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7747 unsigned int count
= vector_cst_encoded_nelts (t
);
7748 for (unsigned int i
= 0; i
< count
; ++i
)
7749 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7753 /* We can just compare by pointer. */
7754 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7756 case PLACEHOLDER_EXPR
:
7757 /* The node itself doesn't matter. */
7764 /* A list of expressions, for a CALL_EXPR or as the elements of a
7766 for (; t
; t
= TREE_CHAIN (t
))
7767 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7771 unsigned HOST_WIDE_INT idx
;
7773 flags
&= ~OEP_ADDRESS_OF
;
7774 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7776 inchash::add_expr (field
, hstate
, flags
);
7777 inchash::add_expr (value
, hstate
, flags
);
7781 case STATEMENT_LIST
:
7783 tree_stmt_iterator i
;
7784 for (i
= tsi_start (CONST_CAST_TREE (t
));
7785 !tsi_end_p (i
); tsi_next (&i
))
7786 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7790 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7791 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7793 case IDENTIFIER_NODE
:
7794 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
7797 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7798 Otherwise nodes that compare equal according to operand_equal_p might
7799 get different hash codes. However, don't do this for machine specific
7800 or front end builtins, since the function code is overloaded in those
7802 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7803 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7805 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7806 code
= TREE_CODE (t
);
7810 if (POLY_INT_CST_P (t
))
7812 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7813 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7816 tclass
= TREE_CODE_CLASS (code
);
7818 if (tclass
== tcc_declaration
)
7820 /* DECL's have a unique ID */
7821 hstate
.add_hwi (DECL_UID (t
));
7823 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7825 /* For comparisons that can be swapped, use the lower
7827 enum tree_code ccode
= swap_tree_comparison (code
);
7830 hstate
.add_object (ccode
);
7831 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7832 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7834 else if (CONVERT_EXPR_CODE_P (code
))
7836 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7838 enum tree_code ccode
= NOP_EXPR
;
7839 hstate
.add_object (ccode
);
7841 /* Don't hash the type, that can lead to having nodes which
7842 compare equal according to operand_equal_p, but which
7843 have different hash codes. Make sure to include signedness
7844 in the hash computation. */
7845 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7846 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7848 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7849 else if (code
== MEM_REF
7850 && (flags
& OEP_ADDRESS_OF
) != 0
7851 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7852 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7853 && integer_zerop (TREE_OPERAND (t
, 1)))
7854 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7856 /* Don't ICE on FE specific trees, or their arguments etc.
7857 during operand_equal_p hash verification. */
7858 else if (!IS_EXPR_CODE_CLASS (tclass
))
7859 gcc_assert (flags
& OEP_HASH_CHECK
);
7862 unsigned int sflags
= flags
;
7864 hstate
.add_object (code
);
7869 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7870 flags
|= OEP_ADDRESS_OF
;
7876 case TARGET_MEM_REF
:
7877 flags
&= ~OEP_ADDRESS_OF
;
7882 case ARRAY_RANGE_REF
:
7885 sflags
&= ~OEP_ADDRESS_OF
;
7889 flags
&= ~OEP_ADDRESS_OF
;
7892 case WIDEN_MULT_PLUS_EXPR
:
7893 case WIDEN_MULT_MINUS_EXPR
:
7895 /* The multiplication operands are commutative. */
7896 inchash::hash one
, two
;
7897 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7898 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7899 hstate
.add_commutative (one
, two
);
7900 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7905 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7906 hstate
.add_int (CALL_EXPR_IFN (t
));
7910 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7911 Usually different TARGET_EXPRs just should use
7912 different temporaries in their slots. */
7913 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7920 /* Don't hash the type, that can lead to having nodes which
7921 compare equal according to operand_equal_p, but which
7922 have different hash codes. */
7923 if (code
== NON_LVALUE_EXPR
)
7925 /* Make sure to include signness in the hash computation. */
7926 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7927 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7930 else if (commutative_tree_code (code
))
7932 /* It's a commutative expression. We want to hash it the same
7933 however it appears. We do this by first hashing both operands
7934 and then rehashing based on the order of their independent
7936 inchash::hash one
, two
;
7937 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7938 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7939 hstate
.add_commutative (one
, two
);
7942 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7943 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7944 i
== 0 ? flags
: sflags
);
7952 /* Constructors for pointer, array and function types.
7953 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7954 constructed by language-dependent code, not here.) */
7956 /* Construct, lay out and return the type of pointers to TO_TYPE with
7957 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7958 reference all of memory. If such a type has already been
7959 constructed, reuse it. */
7962 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7966 bool could_alias
= can_alias_all
;
7968 if (to_type
== error_mark_node
)
7969 return error_mark_node
;
7971 /* If the pointed-to type has the may_alias attribute set, force
7972 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7973 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7974 can_alias_all
= true;
7976 /* In some cases, languages will have things that aren't a POINTER_TYPE
7977 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7978 In that case, return that type without regard to the rest of our
7981 ??? This is a kludge, but consistent with the way this function has
7982 always operated and there doesn't seem to be a good way to avoid this
7984 if (TYPE_POINTER_TO (to_type
) != 0
7985 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7986 return TYPE_POINTER_TO (to_type
);
7988 /* First, if we already have a type for pointers to TO_TYPE and it's
7989 the proper mode, use it. */
7990 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7991 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7994 t
= make_node (POINTER_TYPE
);
7996 TREE_TYPE (t
) = to_type
;
7997 SET_TYPE_MODE (t
, mode
);
7998 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7999 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8000 TYPE_POINTER_TO (to_type
) = t
;
8002 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8003 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8004 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8005 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8007 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8010 /* Lay out the type. This function has many callers that are concerned
8011 with expression-construction, and this simplifies them all. */
8017 /* By default build pointers in ptr_mode. */
8020 build_pointer_type (tree to_type
)
8022 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8023 : TYPE_ADDR_SPACE (to_type
);
8024 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8025 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8028 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8031 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8035 bool could_alias
= can_alias_all
;
8037 if (to_type
== error_mark_node
)
8038 return error_mark_node
;
8040 /* If the pointed-to type has the may_alias attribute set, force
8041 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8042 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8043 can_alias_all
= true;
8045 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8046 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8047 In that case, return that type without regard to the rest of our
8050 ??? This is a kludge, but consistent with the way this function has
8051 always operated and there doesn't seem to be a good way to avoid this
8053 if (TYPE_REFERENCE_TO (to_type
) != 0
8054 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8055 return TYPE_REFERENCE_TO (to_type
);
8057 /* First, if we already have a type for pointers to TO_TYPE and it's
8058 the proper mode, use it. */
8059 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8060 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8063 t
= make_node (REFERENCE_TYPE
);
8065 TREE_TYPE (t
) = to_type
;
8066 SET_TYPE_MODE (t
, mode
);
8067 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8068 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8069 TYPE_REFERENCE_TO (to_type
) = t
;
8071 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8072 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8073 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8074 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8076 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8085 /* Build the node for the type of references-to-TO_TYPE by default
8089 build_reference_type (tree to_type
)
8091 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8092 : TYPE_ADDR_SPACE (to_type
);
8093 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8094 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8097 #define MAX_INT_CACHED_PREC \
8098 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8099 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8101 /* Builds a signed or unsigned integer type of precision PRECISION.
8102 Used for C bitfields whose precision does not match that of
8103 built-in target types. */
8105 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8111 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8113 if (precision
<= MAX_INT_CACHED_PREC
)
8115 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8120 itype
= make_node (INTEGER_TYPE
);
8121 TYPE_PRECISION (itype
) = precision
;
8124 fixup_unsigned_type (itype
);
8126 fixup_signed_type (itype
);
8130 inchash::hash hstate
;
8131 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8132 ret
= type_hash_canon (hstate
.end (), itype
);
8133 if (precision
<= MAX_INT_CACHED_PREC
)
8134 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8139 #define MAX_BOOL_CACHED_PREC \
8140 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8141 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8143 /* Builds a boolean type of precision PRECISION.
8144 Used for boolean vectors to choose proper vector element size. */
8146 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8150 if (precision
<= MAX_BOOL_CACHED_PREC
)
8152 type
= nonstandard_boolean_type_cache
[precision
];
8157 type
= make_node (BOOLEAN_TYPE
);
8158 TYPE_PRECISION (type
) = precision
;
8159 fixup_signed_type (type
);
8161 if (precision
<= MAX_INT_CACHED_PREC
)
8162 nonstandard_boolean_type_cache
[precision
] = type
;
8167 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8168 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8169 is true, reuse such a type that has already been constructed. */
8172 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8174 tree itype
= make_node (INTEGER_TYPE
);
8176 TREE_TYPE (itype
) = type
;
8178 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8179 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8181 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8182 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8183 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8184 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8185 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8186 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8187 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8192 if ((TYPE_MIN_VALUE (itype
)
8193 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8194 || (TYPE_MAX_VALUE (itype
)
8195 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8197 /* Since we cannot reliably merge this type, we need to compare it using
8198 structural equality checks. */
8199 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8203 hashval_t hash
= type_hash_canon_hash (itype
);
8204 itype
= type_hash_canon (hash
, itype
);
8209 /* Wrapper around build_range_type_1 with SHARED set to true. */
8212 build_range_type (tree type
, tree lowval
, tree highval
)
8214 return build_range_type_1 (type
, lowval
, highval
, true);
8217 /* Wrapper around build_range_type_1 with SHARED set to false. */
8220 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8222 return build_range_type_1 (type
, lowval
, highval
, false);
8225 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8226 MAXVAL should be the maximum value in the domain
8227 (one less than the length of the array).
8229 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8230 We don't enforce this limit, that is up to caller (e.g. language front end).
8231 The limit exists because the result is a signed type and we don't handle
8232 sizes that use more than one HOST_WIDE_INT. */
8235 build_index_type (tree maxval
)
8237 return build_range_type (sizetype
, size_zero_node
, maxval
);
8240 /* Return true if the debug information for TYPE, a subtype, should be emitted
8241 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8242 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8243 debug info and doesn't reflect the source code. */
8246 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8248 tree base_type
= TREE_TYPE (type
), low
, high
;
8250 /* Subrange types have a base type which is an integral type. */
8251 if (!INTEGRAL_TYPE_P (base_type
))
8254 /* Get the real bounds of the subtype. */
8255 if (lang_hooks
.types
.get_subrange_bounds
)
8256 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8259 low
= TYPE_MIN_VALUE (type
);
8260 high
= TYPE_MAX_VALUE (type
);
8263 /* If the type and its base type have the same representation and the same
8264 name, then the type is not a subrange but a copy of the base type. */
8265 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8266 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8267 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8268 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8269 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8270 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8280 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8281 and number of elements specified by the range of values of INDEX_TYPE.
8282 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8283 If SHARED is true, reuse such a type that has already been constructed. */
8286 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8291 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8293 error ("arrays of functions are not meaningful");
8294 elt_type
= integer_type_node
;
8297 t
= make_node (ARRAY_TYPE
);
8298 TREE_TYPE (t
) = elt_type
;
8299 TYPE_DOMAIN (t
) = index_type
;
8300 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8301 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8304 /* If the element type is incomplete at this point we get marked for
8305 structural equality. Do not record these types in the canonical
8307 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8312 hashval_t hash
= type_hash_canon_hash (t
);
8313 t
= type_hash_canon (hash
, t
);
8316 if (TYPE_CANONICAL (t
) == t
)
8318 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8319 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8321 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8322 else if (TYPE_CANONICAL (elt_type
) != elt_type
8323 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8325 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8327 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8328 typeless_storage
, shared
);
8334 /* Wrapper around build_array_type_1 with SHARED set to true. */
8337 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8339 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8342 /* Wrapper around build_array_type_1 with SHARED set to false. */
8345 build_nonshared_array_type (tree elt_type
, tree index_type
)
8347 return build_array_type_1 (elt_type
, index_type
, false, false);
8350 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8354 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8356 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8359 /* Recursively examines the array elements of TYPE, until a non-array
8360 element type is found. */
8363 strip_array_types (tree type
)
8365 while (TREE_CODE (type
) == ARRAY_TYPE
)
8366 type
= TREE_TYPE (type
);
8371 /* Computes the canonical argument types from the argument type list
8374 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8375 on entry to this function, or if any of the ARGTYPES are
8378 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8379 true on entry to this function, or if any of the ARGTYPES are
8382 Returns a canonical argument list, which may be ARGTYPES when the
8383 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8384 true) or would not differ from ARGTYPES. */
8387 maybe_canonicalize_argtypes (tree argtypes
,
8388 bool *any_structural_p
,
8389 bool *any_noncanonical_p
)
8392 bool any_noncanonical_argtypes_p
= false;
8394 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8396 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8397 /* Fail gracefully by stating that the type is structural. */
8398 *any_structural_p
= true;
8399 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8400 *any_structural_p
= true;
8401 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8402 || TREE_PURPOSE (arg
))
8403 /* If the argument has a default argument, we consider it
8404 non-canonical even though the type itself is canonical.
8405 That way, different variants of function and method types
8406 with default arguments will all point to the variant with
8407 no defaults as their canonical type. */
8408 any_noncanonical_argtypes_p
= true;
8411 if (*any_structural_p
)
8414 if (any_noncanonical_argtypes_p
)
8416 /* Build the canonical list of argument types. */
8417 tree canon_argtypes
= NULL_TREE
;
8418 bool is_void
= false;
8420 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8422 if (arg
== void_list_node
)
8425 canon_argtypes
= tree_cons (NULL_TREE
,
8426 TYPE_CANONICAL (TREE_VALUE (arg
)),
8430 canon_argtypes
= nreverse (canon_argtypes
);
8432 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8434 /* There is a non-canonical type. */
8435 *any_noncanonical_p
= true;
8436 return canon_argtypes
;
8439 /* The canonical argument types are the same as ARGTYPES. */
8443 /* Construct, lay out and return
8444 the type of functions returning type VALUE_TYPE
8445 given arguments of types ARG_TYPES.
8446 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8447 are data type nodes for the arguments of the function.
8448 If such a type has already been constructed, reuse it. */
8451 build_function_type (tree value_type
, tree arg_types
)
8454 inchash::hash hstate
;
8455 bool any_structural_p
, any_noncanonical_p
;
8456 tree canon_argtypes
;
8458 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8460 error ("function return type cannot be function");
8461 value_type
= integer_type_node
;
8464 /* Make a node of the sort we want. */
8465 t
= make_node (FUNCTION_TYPE
);
8466 TREE_TYPE (t
) = value_type
;
8467 TYPE_ARG_TYPES (t
) = arg_types
;
8469 /* If we already have such a type, use the old one. */
8470 hashval_t hash
= type_hash_canon_hash (t
);
8471 t
= type_hash_canon (hash
, t
);
8473 /* Set up the canonical type. */
8474 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8475 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8476 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8478 &any_noncanonical_p
);
8479 if (any_structural_p
)
8480 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8481 else if (any_noncanonical_p
)
8482 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8485 if (!COMPLETE_TYPE_P (t
))
8490 /* Build a function type. The RETURN_TYPE is the type returned by the
8491 function. If VAARGS is set, no void_type_node is appended to the
8492 list. ARGP must be always be terminated be a NULL_TREE. */
8495 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8499 t
= va_arg (argp
, tree
);
8500 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8501 args
= tree_cons (NULL_TREE
, t
, args
);
8506 if (args
!= NULL_TREE
)
8507 args
= nreverse (args
);
8508 gcc_assert (last
!= void_list_node
);
8510 else if (args
== NULL_TREE
)
8511 args
= void_list_node
;
8515 args
= nreverse (args
);
8516 TREE_CHAIN (last
) = void_list_node
;
8518 args
= build_function_type (return_type
, args
);
8523 /* Build a function type. The RETURN_TYPE is the type returned by the
8524 function. If additional arguments are provided, they are
8525 additional argument types. The list of argument types must always
8526 be terminated by NULL_TREE. */
8529 build_function_type_list (tree return_type
, ...)
8534 va_start (p
, return_type
);
8535 args
= build_function_type_list_1 (false, return_type
, p
);
8540 /* Build a variable argument function type. The RETURN_TYPE is the
8541 type returned by the function. If additional arguments are provided,
8542 they are additional argument types. The list of argument types must
8543 always be terminated by NULL_TREE. */
8546 build_varargs_function_type_list (tree return_type
, ...)
8551 va_start (p
, return_type
);
8552 args
= build_function_type_list_1 (true, return_type
, p
);
8558 /* Build a function type. RETURN_TYPE is the type returned by the
8559 function; VAARGS indicates whether the function takes varargs. The
8560 function takes N named arguments, the types of which are provided in
8564 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8568 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8570 for (i
= n
- 1; i
>= 0; i
--)
8571 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8573 return build_function_type (return_type
, t
);
8576 /* Build a function type. RETURN_TYPE is the type returned by the
8577 function. The function takes N named arguments, the types of which
8578 are provided in ARG_TYPES. */
8581 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8583 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8586 /* Build a variable argument function type. RETURN_TYPE is the type
8587 returned by the function. The function takes N named arguments, the
8588 types of which are provided in ARG_TYPES. */
8591 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8593 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8596 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8597 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8598 for the method. An implicit additional parameter (of type
8599 pointer-to-BASETYPE) is added to the ARGTYPES. */
8602 build_method_type_directly (tree basetype
,
8608 bool any_structural_p
, any_noncanonical_p
;
8609 tree canon_argtypes
;
8611 /* Make a node of the sort we want. */
8612 t
= make_node (METHOD_TYPE
);
8614 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8615 TREE_TYPE (t
) = rettype
;
8616 ptype
= build_pointer_type (basetype
);
8618 /* The actual arglist for this function includes a "hidden" argument
8619 which is "this". Put it into the list of argument types. */
8620 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8621 TYPE_ARG_TYPES (t
) = argtypes
;
8623 /* If we already have such a type, use the old one. */
8624 hashval_t hash
= type_hash_canon_hash (t
);
8625 t
= type_hash_canon (hash
, t
);
8627 /* Set up the canonical type. */
8629 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8630 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8632 = (TYPE_CANONICAL (basetype
) != basetype
8633 || TYPE_CANONICAL (rettype
) != rettype
);
8634 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8636 &any_noncanonical_p
);
8637 if (any_structural_p
)
8638 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8639 else if (any_noncanonical_p
)
8641 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8642 TYPE_CANONICAL (rettype
),
8644 if (!COMPLETE_TYPE_P (t
))
8650 /* Construct, lay out and return the type of methods belonging to class
8651 BASETYPE and whose arguments and values are described by TYPE.
8652 If that type exists already, reuse it.
8653 TYPE must be a FUNCTION_TYPE node. */
8656 build_method_type (tree basetype
, tree type
)
8658 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8660 return build_method_type_directly (basetype
,
8662 TYPE_ARG_TYPES (type
));
8665 /* Construct, lay out and return the type of offsets to a value
8666 of type TYPE, within an object of type BASETYPE.
8667 If a suitable offset type exists already, reuse it. */
8670 build_offset_type (tree basetype
, tree type
)
8674 /* Make a node of the sort we want. */
8675 t
= make_node (OFFSET_TYPE
);
8677 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8678 TREE_TYPE (t
) = type
;
8680 /* If we already have such a type, use the old one. */
8681 hashval_t hash
= type_hash_canon_hash (t
);
8682 t
= type_hash_canon (hash
, t
);
8684 if (!COMPLETE_TYPE_P (t
))
8687 if (TYPE_CANONICAL (t
) == t
)
8689 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8690 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8691 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8692 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8693 || TYPE_CANONICAL (type
) != type
)
8695 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8696 TYPE_CANONICAL (type
));
8702 /* Create a complex type whose components are COMPONENT_TYPE.
8704 If NAMED is true, the type is given a TYPE_NAME. We do not always
8705 do so because this creates a DECL node and thus make the DECL_UIDs
8706 dependent on the type canonicalization hashtable, which is GC-ed,
8707 so the DECL_UIDs would not be stable wrt garbage collection. */
8710 build_complex_type (tree component_type
, bool named
)
8712 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8713 || SCALAR_FLOAT_TYPE_P (component_type
)
8714 || FIXED_POINT_TYPE_P (component_type
));
8716 /* Make a node of the sort we want. */
8717 tree probe
= make_node (COMPLEX_TYPE
);
8719 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8721 /* If we already have such a type, use the old one. */
8722 hashval_t hash
= type_hash_canon_hash (probe
);
8723 tree t
= type_hash_canon (hash
, probe
);
8727 /* We created a new type. The hash insertion will have laid
8728 out the type. We need to check the canonicalization and
8729 maybe set the name. */
8730 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8732 && TYPE_CANONICAL (t
) == t
);
8734 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8735 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8736 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8738 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8740 /* We need to create a name, since complex is a fundamental type. */
8743 const char *name
= NULL
;
8745 if (TREE_TYPE (t
) == char_type_node
)
8746 name
= "complex char";
8747 else if (TREE_TYPE (t
) == signed_char_type_node
)
8748 name
= "complex signed char";
8749 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8750 name
= "complex unsigned char";
8751 else if (TREE_TYPE (t
) == short_integer_type_node
)
8752 name
= "complex short int";
8753 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8754 name
= "complex short unsigned int";
8755 else if (TREE_TYPE (t
) == integer_type_node
)
8756 name
= "complex int";
8757 else if (TREE_TYPE (t
) == unsigned_type_node
)
8758 name
= "complex unsigned int";
8759 else if (TREE_TYPE (t
) == long_integer_type_node
)
8760 name
= "complex long int";
8761 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8762 name
= "complex long unsigned int";
8763 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8764 name
= "complex long long int";
8765 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8766 name
= "complex long long unsigned int";
8769 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8770 get_identifier (name
), t
);
8774 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8777 /* If TYPE is a real or complex floating-point type and the target
8778 does not directly support arithmetic on TYPE then return the wider
8779 type to be used for arithmetic on TYPE. Otherwise, return
8783 excess_precision_type (tree type
)
8785 /* The target can give two different responses to the question of
8786 which excess precision mode it would like depending on whether we
8787 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8789 enum excess_precision_type requested_type
8790 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8791 ? EXCESS_PRECISION_TYPE_FAST
8792 : EXCESS_PRECISION_TYPE_STANDARD
);
8794 enum flt_eval_method target_flt_eval_method
8795 = targetm
.c
.excess_precision (requested_type
);
8797 /* The target should not ask for unpredictable float evaluation (though
8798 it might advertise that implicitly the evaluation is unpredictable,
8799 but we don't care about that here, it will have been reported
8800 elsewhere). If it does ask for unpredictable evaluation, we have
8801 nothing to do here. */
8802 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8804 /* Nothing to do. The target has asked for all types we know about
8805 to be computed with their native precision and range. */
8806 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8809 /* The target will promote this type in a target-dependent way, so excess
8810 precision ought to leave it alone. */
8811 if (targetm
.promoted_type (type
) != NULL_TREE
)
8814 machine_mode float16_type_mode
= (float16_type_node
8815 ? TYPE_MODE (float16_type_node
)
8817 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8818 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8820 switch (TREE_CODE (type
))
8824 machine_mode type_mode
= TYPE_MODE (type
);
8825 switch (target_flt_eval_method
)
8827 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8828 if (type_mode
== float16_type_mode
)
8829 return float_type_node
;
8831 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8832 if (type_mode
== float16_type_mode
8833 || type_mode
== float_type_mode
)
8834 return double_type_node
;
8836 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8837 if (type_mode
== float16_type_mode
8838 || type_mode
== float_type_mode
8839 || type_mode
== double_type_mode
)
8840 return long_double_type_node
;
8849 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8851 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8852 switch (target_flt_eval_method
)
8854 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8855 if (type_mode
== float16_type_mode
)
8856 return complex_float_type_node
;
8858 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8859 if (type_mode
== float16_type_mode
8860 || type_mode
== float_type_mode
)
8861 return complex_double_type_node
;
8863 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8864 if (type_mode
== float16_type_mode
8865 || type_mode
== float_type_mode
8866 || type_mode
== double_type_mode
)
8867 return complex_long_double_type_node
;
8881 /* Return OP, stripped of any conversions to wider types as much as is safe.
8882 Converting the value back to OP's type makes a value equivalent to OP.
8884 If FOR_TYPE is nonzero, we return a value which, if converted to
8885 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8887 OP must have integer, real or enumeral type. Pointers are not allowed!
8889 There are some cases where the obvious value we could return
8890 would regenerate to OP if converted to OP's type,
8891 but would not extend like OP to wider types.
8892 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8893 For example, if OP is (unsigned short)(signed char)-1,
8894 we avoid returning (signed char)-1 if FOR_TYPE is int,
8895 even though extending that to an unsigned short would regenerate OP,
8896 since the result of extending (signed char)-1 to (int)
8897 is different from (int) OP. */
8900 get_unwidened (tree op
, tree for_type
)
8902 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8903 tree type
= TREE_TYPE (op
);
8905 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8907 = (for_type
!= 0 && for_type
!= type
8908 && final_prec
> TYPE_PRECISION (type
)
8909 && TYPE_UNSIGNED (type
));
8912 while (CONVERT_EXPR_P (op
))
8916 /* TYPE_PRECISION on vector types has different meaning
8917 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8918 so avoid them here. */
8919 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8922 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8923 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8925 /* Truncations are many-one so cannot be removed.
8926 Unless we are later going to truncate down even farther. */
8928 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8931 /* See what's inside this conversion. If we decide to strip it,
8933 op
= TREE_OPERAND (op
, 0);
8935 /* If we have not stripped any zero-extensions (uns is 0),
8936 we can strip any kind of extension.
8937 If we have previously stripped a zero-extension,
8938 only zero-extensions can safely be stripped.
8939 Any extension can be stripped if the bits it would produce
8940 are all going to be discarded later by truncating to FOR_TYPE. */
8944 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8946 /* TYPE_UNSIGNED says whether this is a zero-extension.
8947 Let's avoid computing it if it does not affect WIN
8948 and if UNS will not be needed again. */
8950 || CONVERT_EXPR_P (op
))
8951 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8959 /* If we finally reach a constant see if it fits in sth smaller and
8960 in that case convert it. */
8961 if (TREE_CODE (win
) == INTEGER_CST
)
8963 tree wtype
= TREE_TYPE (win
);
8964 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8966 prec
= MAX (prec
, final_prec
);
8967 if (prec
< TYPE_PRECISION (wtype
))
8969 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8970 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8971 win
= fold_convert (t
, win
);
8978 /* Return OP or a simpler expression for a narrower value
8979 which can be sign-extended or zero-extended to give back OP.
8980 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8981 or 0 if the value should be sign-extended. */
8984 get_narrower (tree op
, int *unsignedp_ptr
)
8989 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8991 while (TREE_CODE (op
) == NOP_EXPR
)
8994 = (TYPE_PRECISION (TREE_TYPE (op
))
8995 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8997 /* Truncations are many-one so cannot be removed. */
9001 /* See what's inside this conversion. If we decide to strip it,
9006 op
= TREE_OPERAND (op
, 0);
9007 /* An extension: the outermost one can be stripped,
9008 but remember whether it is zero or sign extension. */
9010 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9011 /* Otherwise, if a sign extension has been stripped,
9012 only sign extensions can now be stripped;
9013 if a zero extension has been stripped, only zero-extensions. */
9014 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9018 else /* bitschange == 0 */
9020 /* A change in nominal type can always be stripped, but we must
9021 preserve the unsignedness. */
9023 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9025 op
= TREE_OPERAND (op
, 0);
9026 /* Keep trying to narrow, but don't assign op to win if it
9027 would turn an integral type into something else. */
9028 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9035 if (TREE_CODE (op
) == COMPONENT_REF
9036 /* Since type_for_size always gives an integer type. */
9037 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9038 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9039 /* Ensure field is laid out already. */
9040 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9041 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9043 unsigned HOST_WIDE_INT innerprec
9044 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9045 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9046 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9047 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9049 /* We can get this structure field in a narrower type that fits it,
9050 but the resulting extension to its nominal type (a fullword type)
9051 must satisfy the same conditions as for other extensions.
9053 Do this only for fields that are aligned (not bit-fields),
9054 because when bit-field insns will be used there is no
9055 advantage in doing this. */
9057 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9058 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9059 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9063 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9064 win
= fold_convert (type
, op
);
9068 *unsignedp_ptr
= uns
;
9072 /* Return true if integer constant C has a value that is permissible
9073 for TYPE, an integral type. */
9076 int_fits_type_p (const_tree c
, const_tree type
)
9078 tree type_low_bound
, type_high_bound
;
9079 bool ok_for_low_bound
, ok_for_high_bound
;
9080 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9082 /* Non-standard boolean types can have arbitrary precision but various
9083 transformations assume that they can only take values 0 and +/-1. */
9084 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9085 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
9088 type_low_bound
= TYPE_MIN_VALUE (type
);
9089 type_high_bound
= TYPE_MAX_VALUE (type
);
9091 /* If at least one bound of the type is a constant integer, we can check
9092 ourselves and maybe make a decision. If no such decision is possible, but
9093 this type is a subtype, try checking against that. Otherwise, use
9094 fits_to_tree_p, which checks against the precision.
9096 Compute the status for each possibly constant bound, and return if we see
9097 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9098 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9099 for "constant known to fit". */
9101 /* Check if c >= type_low_bound. */
9102 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9104 if (tree_int_cst_lt (c
, type_low_bound
))
9106 ok_for_low_bound
= true;
9109 ok_for_low_bound
= false;
9111 /* Check if c <= type_high_bound. */
9112 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9114 if (tree_int_cst_lt (type_high_bound
, c
))
9116 ok_for_high_bound
= true;
9119 ok_for_high_bound
= false;
9121 /* If the constant fits both bounds, the result is known. */
9122 if (ok_for_low_bound
&& ok_for_high_bound
)
9125 /* Perform some generic filtering which may allow making a decision
9126 even if the bounds are not constant. First, negative integers
9127 never fit in unsigned types, */
9128 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9131 /* Second, narrower types always fit in wider ones. */
9132 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9135 /* Third, unsigned integers with top bit set never fit signed types. */
9136 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9138 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9139 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9141 /* When a tree_cst is converted to a wide-int, the precision
9142 is taken from the type. However, if the precision of the
9143 mode underneath the type is smaller than that, it is
9144 possible that the value will not fit. The test below
9145 fails if any bit is set between the sign bit of the
9146 underlying mode and the top bit of the type. */
9147 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9150 else if (wi::neg_p (wi::to_wide (c
)))
9154 /* If we haven't been able to decide at this point, there nothing more we
9155 can check ourselves here. Look at the base type if we have one and it
9156 has the same precision. */
9157 if (TREE_CODE (type
) == INTEGER_TYPE
9158 && TREE_TYPE (type
) != 0
9159 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9161 type
= TREE_TYPE (type
);
9165 /* Or to fits_to_tree_p, if nothing else. */
9166 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9169 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9170 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9171 represented (assuming two's-complement arithmetic) within the bit
9172 precision of the type are returned instead. */
9175 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9177 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9178 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9179 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9182 if (TYPE_UNSIGNED (type
))
9183 mpz_set_ui (min
, 0);
9186 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9187 wi::to_mpz (mn
, min
, SIGNED
);
9191 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9192 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9193 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9196 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9197 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9201 /* Return true if VAR is an automatic variable defined in function FN. */
9204 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9206 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9207 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9208 || TREE_CODE (var
) == PARM_DECL
)
9209 && ! TREE_STATIC (var
))
9210 || TREE_CODE (var
) == LABEL_DECL
9211 || TREE_CODE (var
) == RESULT_DECL
));
9214 /* Subprogram of following function. Called by walk_tree.
9216 Return *TP if it is an automatic variable or parameter of the
9217 function passed in as DATA. */
9220 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9222 tree fn
= (tree
) data
;
9227 else if (DECL_P (*tp
)
9228 && auto_var_in_fn_p (*tp
, fn
))
9234 /* Returns true if T is, contains, or refers to a type with variable
9235 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9236 arguments, but not the return type. If FN is nonzero, only return
9237 true if a modifier of the type or position of FN is a variable or
9238 parameter inside FN.
9240 This concept is more general than that of C99 'variably modified types':
9241 in C99, a struct type is never variably modified because a VLA may not
9242 appear as a structure member. However, in GNU C code like:
9244 struct S { int i[f()]; };
9246 is valid, and other languages may define similar constructs. */
9249 variably_modified_type_p (tree type
, tree fn
)
9253 /* Test if T is either variable (if FN is zero) or an expression containing
9254 a variable in FN. If TYPE isn't gimplified, return true also if
9255 gimplify_one_sizepos would gimplify the expression into a local
9257 #define RETURN_TRUE_IF_VAR(T) \
9258 do { tree _t = (T); \
9259 if (_t != NULL_TREE \
9260 && _t != error_mark_node \
9261 && !CONSTANT_CLASS_P (_t) \
9262 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9264 || (!TYPE_SIZES_GIMPLIFIED (type) \
9265 && (TREE_CODE (_t) != VAR_DECL \
9266 && !CONTAINS_PLACEHOLDER_P (_t))) \
9267 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9268 return true; } while (0)
9270 if (type
== error_mark_node
)
9273 /* If TYPE itself has variable size, it is variably modified. */
9274 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9275 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9277 switch (TREE_CODE (type
))
9280 case REFERENCE_TYPE
:
9282 /* Ada can have pointer types refering to themselves indirectly. */
9283 if (TREE_VISITED (type
))
9285 TREE_VISITED (type
) = true;
9286 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9288 TREE_VISITED (type
) = false;
9291 TREE_VISITED (type
) = false;
9296 /* If TYPE is a function type, it is variably modified if the
9297 return type is variably modified. */
9298 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9304 case FIXED_POINT_TYPE
:
9307 /* Scalar types are variably modified if their end points
9309 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9310 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9315 case QUAL_UNION_TYPE
:
9316 /* We can't see if any of the fields are variably-modified by the
9317 definition we normally use, since that would produce infinite
9318 recursion via pointers. */
9319 /* This is variably modified if some field's type is. */
9320 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9321 if (TREE_CODE (t
) == FIELD_DECL
)
9323 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9324 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9325 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9327 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9328 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9333 /* Do not call ourselves to avoid infinite recursion. This is
9334 variably modified if the element type is. */
9335 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9336 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9343 /* The current language may have other cases to check, but in general,
9344 all other types are not variably modified. */
9345 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9347 #undef RETURN_TRUE_IF_VAR
9350 /* Given a DECL or TYPE, return the scope in which it was declared, or
9351 NULL_TREE if there is no containing scope. */
9354 get_containing_scope (const_tree t
)
9356 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9359 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9362 get_ultimate_context (const_tree decl
)
9364 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9366 if (TREE_CODE (decl
) == BLOCK
)
9367 decl
= BLOCK_SUPERCONTEXT (decl
);
9369 decl
= get_containing_scope (decl
);
9374 /* Return the innermost context enclosing DECL that is
9375 a FUNCTION_DECL, or zero if none. */
9378 decl_function_context (const_tree decl
)
9382 if (TREE_CODE (decl
) == ERROR_MARK
)
9385 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9386 where we look up the function at runtime. Such functions always take
9387 a first argument of type 'pointer to real context'.
9389 C++ should really be fixed to use DECL_CONTEXT for the real context,
9390 and use something else for the "virtual context". */
9391 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9394 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9396 context
= DECL_CONTEXT (decl
);
9398 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9400 if (TREE_CODE (context
) == BLOCK
)
9401 context
= BLOCK_SUPERCONTEXT (context
);
9403 context
= get_containing_scope (context
);
9409 /* Return the innermost context enclosing DECL that is
9410 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9411 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9414 decl_type_context (const_tree decl
)
9416 tree context
= DECL_CONTEXT (decl
);
9419 switch (TREE_CODE (context
))
9421 case NAMESPACE_DECL
:
9422 case TRANSLATION_UNIT_DECL
:
9427 case QUAL_UNION_TYPE
:
9432 context
= DECL_CONTEXT (context
);
9436 context
= BLOCK_SUPERCONTEXT (context
);
9446 /* CALL is a CALL_EXPR. Return the declaration for the function
9447 called, or NULL_TREE if the called function cannot be
9451 get_callee_fndecl (const_tree call
)
9455 if (call
== error_mark_node
)
9456 return error_mark_node
;
9458 /* It's invalid to call this function with anything but a
9460 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9462 /* The first operand to the CALL is the address of the function
9464 addr
= CALL_EXPR_FN (call
);
9466 /* If there is no function, return early. */
9467 if (addr
== NULL_TREE
)
9472 /* If this is a readonly function pointer, extract its initial value. */
9473 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9474 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9475 && DECL_INITIAL (addr
))
9476 addr
= DECL_INITIAL (addr
);
9478 /* If the address is just `&f' for some function `f', then we know
9479 that `f' is being called. */
9480 if (TREE_CODE (addr
) == ADDR_EXPR
9481 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9482 return TREE_OPERAND (addr
, 0);
9484 /* We couldn't figure out what was being called. */
9488 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9489 return the associated function code, otherwise return CFN_LAST. */
9492 get_call_combined_fn (const_tree call
)
9494 /* It's invalid to call this function with anything but a CALL_EXPR. */
9495 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9497 if (!CALL_EXPR_FN (call
))
9498 return as_combined_fn (CALL_EXPR_IFN (call
));
9500 tree fndecl
= get_callee_fndecl (call
);
9501 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9502 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9507 /* Comparator of indices based on tree_node_counts. */
9510 tree_nodes_cmp (const void *p1
, const void *p2
)
9512 const unsigned *n1
= (const unsigned *)p1
;
9513 const unsigned *n2
= (const unsigned *)p2
;
9515 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9518 /* Comparator of indices based on tree_code_counts. */
9521 tree_codes_cmp (const void *p1
, const void *p2
)
9523 const unsigned *n1
= (const unsigned *)p1
;
9524 const unsigned *n2
= (const unsigned *)p2
;
9526 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9529 #define TREE_MEM_USAGE_SPACES 40
9531 /* Print debugging information about tree nodes generated during the compile,
9532 and any language-specific information. */
9535 dump_tree_statistics (void)
9537 if (GATHER_STATISTICS
)
9539 uint64_t total_nodes
, total_bytes
;
9540 fprintf (stderr
, "\nKind Nodes Bytes\n");
9541 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9542 total_nodes
= total_bytes
= 0;
9545 auto_vec
<unsigned> indices (all_kinds
);
9546 for (unsigned i
= 0; i
< all_kinds
; i
++)
9547 indices
.quick_push (i
);
9548 indices
.qsort (tree_nodes_cmp
);
9550 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9552 unsigned j
= indices
[i
];
9553 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9554 tree_node_kind_names
[i
], SIZE_AMOUNT (tree_node_counts
[j
]),
9555 SIZE_AMOUNT (tree_node_sizes
[j
]));
9556 total_nodes
+= tree_node_counts
[j
];
9557 total_bytes
+= tree_node_sizes
[j
];
9559 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9560 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9561 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9562 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9566 fprintf (stderr
, "Code Nodes\n");
9567 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9569 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9570 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9571 indices
.quick_push (i
);
9572 indices
.qsort (tree_codes_cmp
);
9574 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9576 unsigned j
= indices
[i
];
9577 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9578 get_tree_code_name ((enum tree_code
) j
),
9579 SIZE_AMOUNT (tree_code_counts
[j
]));
9581 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9582 fprintf (stderr
, "\n");
9583 ssanames_print_statistics ();
9584 fprintf (stderr
, "\n");
9585 phinodes_print_statistics ();
9586 fprintf (stderr
, "\n");
9590 fprintf (stderr
, "(No per-node statistics)\n");
9592 print_type_hash_statistics ();
9593 print_debug_expr_statistics ();
9594 print_value_expr_statistics ();
9595 lang_hooks
.print_statistics ();
9598 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9600 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9603 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9605 /* This relies on the raw feedback's top 4 bits being zero. */
9606 #define FEEDBACK(X) ((X) * 0x04c11db7)
9607 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9608 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9609 static const unsigned syndromes
[16] =
9611 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9612 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9613 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9614 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9619 value
<<= (32 - bytes
* 8);
9620 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9622 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9624 chksum
= (chksum
<< 4) ^ feedback
;
9630 /* Generate a crc32 of a string. */
9633 crc32_string (unsigned chksum
, const char *string
)
9636 chksum
= crc32_byte (chksum
, *string
);
9641 /* P is a string that will be used in a symbol. Mask out any characters
9642 that are not valid in that context. */
9645 clean_symbol_name (char *p
)
9649 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9652 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9659 /* For anonymous aggregate types, we need some sort of name to
9660 hold on to. In practice, this should not appear, but it should
9661 not be harmful if it does. */
9663 anon_aggrname_p(const_tree id_node
)
9665 #ifndef NO_DOT_IN_LABEL
9666 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9667 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9668 #else /* NO_DOT_IN_LABEL */
9669 #ifndef NO_DOLLAR_IN_LABEL
9670 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9671 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9672 #else /* NO_DOLLAR_IN_LABEL */
9673 #define ANON_AGGRNAME_PREFIX "__anon_"
9674 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9675 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9676 #endif /* NO_DOLLAR_IN_LABEL */
9677 #endif /* NO_DOT_IN_LABEL */
9680 /* Return a format for an anonymous aggregate name. */
9682 anon_aggrname_format()
9684 #ifndef NO_DOT_IN_LABEL
9686 #else /* NO_DOT_IN_LABEL */
9687 #ifndef NO_DOLLAR_IN_LABEL
9689 #else /* NO_DOLLAR_IN_LABEL */
9691 #endif /* NO_DOLLAR_IN_LABEL */
9692 #endif /* NO_DOT_IN_LABEL */
9695 /* Generate a name for a special-purpose function.
9696 The generated name may need to be unique across the whole link.
9697 Changes to this function may also require corresponding changes to
9698 xstrdup_mask_random.
9699 TYPE is some string to identify the purpose of this function to the
9700 linker or collect2; it must start with an uppercase letter,
9702 I - for constructors
9704 N - for C++ anonymous namespaces
9705 F - for DWARF unwind frame information. */
9708 get_file_function_name (const char *type
)
9714 /* If we already have a name we know to be unique, just use that. */
9715 if (first_global_object_name
)
9716 p
= q
= ASTRDUP (first_global_object_name
);
9717 /* If the target is handling the constructors/destructors, they
9718 will be local to this file and the name is only necessary for
9720 We also assign sub_I and sub_D sufixes to constructors called from
9721 the global static constructors. These are always local. */
9722 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9723 || (strncmp (type
, "sub_", 4) == 0
9724 && (type
[4] == 'I' || type
[4] == 'D')))
9726 const char *file
= main_input_filename
;
9728 file
= LOCATION_FILE (input_location
);
9729 /* Just use the file's basename, because the full pathname
9730 might be quite long. */
9731 p
= q
= ASTRDUP (lbasename (file
));
9735 /* Otherwise, the name must be unique across the entire link.
9736 We don't have anything that we know to be unique to this translation
9737 unit, so use what we do have and throw in some randomness. */
9739 const char *name
= weak_global_object_name
;
9740 const char *file
= main_input_filename
;
9745 file
= LOCATION_FILE (input_location
);
9747 len
= strlen (file
);
9748 q
= (char *) alloca (9 + 19 + len
+ 1);
9749 memcpy (q
, file
, len
+ 1);
9751 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9752 crc32_string (0, name
), get_random_seed (false));
9757 clean_symbol_name (q
);
9758 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9761 /* Set up the name of the file-level functions we may need.
9762 Use a global object (which is already required to be unique over
9763 the program) rather than the file name (which imposes extra
9765 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9767 return get_identifier (buf
);
9770 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9772 /* Complain that the tree code of NODE does not match the expected 0
9773 terminated list of trailing codes. The trailing code list can be
9774 empty, for a more vague error message. FILE, LINE, and FUNCTION
9775 are of the caller. */
9778 tree_check_failed (const_tree node
, const char *file
,
9779 int line
, const char *function
, ...)
9783 unsigned length
= 0;
9784 enum tree_code code
;
9786 va_start (args
, function
);
9787 while ((code
= (enum tree_code
) va_arg (args
, int)))
9788 length
+= 4 + strlen (get_tree_code_name (code
));
9793 va_start (args
, function
);
9794 length
+= strlen ("expected ");
9795 buffer
= tmp
= (char *) alloca (length
);
9797 while ((code
= (enum tree_code
) va_arg (args
, int)))
9799 const char *prefix
= length
? " or " : "expected ";
9801 strcpy (tmp
+ length
, prefix
);
9802 length
+= strlen (prefix
);
9803 strcpy (tmp
+ length
, get_tree_code_name (code
));
9804 length
+= strlen (get_tree_code_name (code
));
9809 buffer
= "unexpected node";
9811 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9812 buffer
, get_tree_code_name (TREE_CODE (node
)),
9813 function
, trim_filename (file
), line
);
9816 /* Complain that the tree code of NODE does match the expected 0
9817 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9821 tree_not_check_failed (const_tree node
, const char *file
,
9822 int line
, const char *function
, ...)
9826 unsigned length
= 0;
9827 enum tree_code code
;
9829 va_start (args
, function
);
9830 while ((code
= (enum tree_code
) va_arg (args
, int)))
9831 length
+= 4 + strlen (get_tree_code_name (code
));
9833 va_start (args
, function
);
9834 buffer
= (char *) alloca (length
);
9836 while ((code
= (enum tree_code
) va_arg (args
, int)))
9840 strcpy (buffer
+ length
, " or ");
9843 strcpy (buffer
+ length
, get_tree_code_name (code
));
9844 length
+= strlen (get_tree_code_name (code
));
9848 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9849 buffer
, get_tree_code_name (TREE_CODE (node
)),
9850 function
, trim_filename (file
), line
);
9853 /* Similar to tree_check_failed, except that we check for a class of tree
9854 code, given in CL. */
9857 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9858 const char *file
, int line
, const char *function
)
9861 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9862 TREE_CODE_CLASS_STRING (cl
),
9863 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9864 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9867 /* Similar to tree_check_failed, except that instead of specifying a
9868 dozen codes, use the knowledge that they're all sequential. */
9871 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9872 const char *function
, enum tree_code c1
,
9876 unsigned length
= 0;
9879 for (c
= c1
; c
<= c2
; ++c
)
9880 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9882 length
+= strlen ("expected ");
9883 buffer
= (char *) alloca (length
);
9886 for (c
= c1
; c
<= c2
; ++c
)
9888 const char *prefix
= length
? " or " : "expected ";
9890 strcpy (buffer
+ length
, prefix
);
9891 length
+= strlen (prefix
);
9892 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9893 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9896 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9897 buffer
, get_tree_code_name (TREE_CODE (node
)),
9898 function
, trim_filename (file
), line
);
9902 /* Similar to tree_check_failed, except that we check that a tree does
9903 not have the specified code, given in CL. */
9906 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9907 const char *file
, int line
, const char *function
)
9910 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9911 TREE_CODE_CLASS_STRING (cl
),
9912 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9913 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9917 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9920 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9921 const char *function
, enum omp_clause_code code
)
9923 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9924 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9925 function
, trim_filename (file
), line
);
9929 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9932 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9933 const char *function
, enum omp_clause_code c1
,
9934 enum omp_clause_code c2
)
9937 unsigned length
= 0;
9940 for (c
= c1
; c
<= c2
; ++c
)
9941 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9943 length
+= strlen ("expected ");
9944 buffer
= (char *) alloca (length
);
9947 for (c
= c1
; c
<= c2
; ++c
)
9949 const char *prefix
= length
? " or " : "expected ";
9951 strcpy (buffer
+ length
, prefix
);
9952 length
+= strlen (prefix
);
9953 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9954 length
+= strlen (omp_clause_code_name
[c
]);
9957 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9958 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9959 function
, trim_filename (file
), line
);
9963 #undef DEFTREESTRUCT
9964 #define DEFTREESTRUCT(VAL, NAME) NAME,
9966 static const char *ts_enum_names
[] = {
9967 #include "treestruct.def"
9969 #undef DEFTREESTRUCT
9971 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9973 /* Similar to tree_class_check_failed, except that we check for
9974 whether CODE contains the tree structure identified by EN. */
9977 tree_contains_struct_check_failed (const_tree node
,
9978 const enum tree_node_structure_enum en
,
9979 const char *file
, int line
,
9980 const char *function
)
9983 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9985 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9989 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9990 (dynamically sized) vector. */
9993 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9994 const char *function
)
9997 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9998 idx
+ 1, len
, function
, trim_filename (file
), line
);
10001 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10002 (dynamically sized) vector. */
10005 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10006 const char *function
)
10009 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
10010 idx
+ 1, len
, function
, trim_filename (file
), line
);
10013 /* Similar to above, except that the check is for the bounds of the operand
10014 vector of an expression node EXP. */
10017 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10018 int line
, const char *function
)
10020 enum tree_code code
= TREE_CODE (exp
);
10022 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10023 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10024 function
, trim_filename (file
), line
);
10027 /* Similar to above, except that the check is for the number of
10028 operands of an OMP_CLAUSE node. */
10031 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10032 int line
, const char *function
)
10035 ("tree check: accessed operand %d of omp_clause %s with %d operands "
10036 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10037 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10038 trim_filename (file
), line
);
10040 #endif /* ENABLE_TREE_CHECKING */
10042 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10043 and mapped to the machine mode MODE. Initialize its fields and build
10044 the information necessary for debugging output. */
10047 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
10050 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10052 t
= make_node (VECTOR_TYPE
);
10053 TREE_TYPE (t
) = mv_innertype
;
10054 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10055 SET_TYPE_MODE (t
, mode
);
10057 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10058 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10059 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10060 || mode
!= VOIDmode
)
10061 && !VECTOR_BOOLEAN_TYPE_P (t
))
10063 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10067 hashval_t hash
= type_hash_canon_hash (t
);
10068 t
= type_hash_canon (hash
, t
);
10070 /* We have built a main variant, based on the main variant of the
10071 inner type. Use it to build the variant we return. */
10072 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10073 && TREE_TYPE (t
) != innertype
)
10074 return build_type_attribute_qual_variant (t
,
10075 TYPE_ATTRIBUTES (innertype
),
10076 TYPE_QUALS (innertype
));
10082 make_or_reuse_type (unsigned size
, int unsignedp
)
10086 if (size
== INT_TYPE_SIZE
)
10087 return unsignedp
? unsigned_type_node
: integer_type_node
;
10088 if (size
== CHAR_TYPE_SIZE
)
10089 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10090 if (size
== SHORT_TYPE_SIZE
)
10091 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10092 if (size
== LONG_TYPE_SIZE
)
10093 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10094 if (size
== LONG_LONG_TYPE_SIZE
)
10095 return (unsignedp
? long_long_unsigned_type_node
10096 : long_long_integer_type_node
);
10098 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10099 if (size
== int_n_data
[i
].bitsize
10100 && int_n_enabled_p
[i
])
10101 return (unsignedp
? int_n_trees
[i
].unsigned_type
10102 : int_n_trees
[i
].signed_type
);
10105 return make_unsigned_type (size
);
10107 return make_signed_type (size
);
10110 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10113 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10117 if (size
== SHORT_FRACT_TYPE_SIZE
)
10118 return unsignedp
? sat_unsigned_short_fract_type_node
10119 : sat_short_fract_type_node
;
10120 if (size
== FRACT_TYPE_SIZE
)
10121 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10122 if (size
== LONG_FRACT_TYPE_SIZE
)
10123 return unsignedp
? sat_unsigned_long_fract_type_node
10124 : sat_long_fract_type_node
;
10125 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10126 return unsignedp
? sat_unsigned_long_long_fract_type_node
10127 : sat_long_long_fract_type_node
;
10131 if (size
== SHORT_FRACT_TYPE_SIZE
)
10132 return unsignedp
? unsigned_short_fract_type_node
10133 : short_fract_type_node
;
10134 if (size
== FRACT_TYPE_SIZE
)
10135 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10136 if (size
== LONG_FRACT_TYPE_SIZE
)
10137 return unsignedp
? unsigned_long_fract_type_node
10138 : long_fract_type_node
;
10139 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10140 return unsignedp
? unsigned_long_long_fract_type_node
10141 : long_long_fract_type_node
;
10144 return make_fract_type (size
, unsignedp
, satp
);
10147 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10150 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10154 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10155 return unsignedp
? sat_unsigned_short_accum_type_node
10156 : sat_short_accum_type_node
;
10157 if (size
== ACCUM_TYPE_SIZE
)
10158 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10159 if (size
== LONG_ACCUM_TYPE_SIZE
)
10160 return unsignedp
? sat_unsigned_long_accum_type_node
10161 : sat_long_accum_type_node
;
10162 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10163 return unsignedp
? sat_unsigned_long_long_accum_type_node
10164 : sat_long_long_accum_type_node
;
10168 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10169 return unsignedp
? unsigned_short_accum_type_node
10170 : short_accum_type_node
;
10171 if (size
== ACCUM_TYPE_SIZE
)
10172 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10173 if (size
== LONG_ACCUM_TYPE_SIZE
)
10174 return unsignedp
? unsigned_long_accum_type_node
10175 : long_accum_type_node
;
10176 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10177 return unsignedp
? unsigned_long_long_accum_type_node
10178 : long_long_accum_type_node
;
10181 return make_accum_type (size
, unsignedp
, satp
);
10185 /* Create an atomic variant node for TYPE. This routine is called
10186 during initialization of data types to create the 5 basic atomic
10187 types. The generic build_variant_type function requires these to
10188 already be set up in order to function properly, so cannot be
10189 called from there. If ALIGN is non-zero, then ensure alignment is
10190 overridden to this value. */
10193 build_atomic_base (tree type
, unsigned int align
)
10197 /* Make sure its not already registered. */
10198 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10201 t
= build_variant_type_copy (type
);
10202 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10205 SET_TYPE_ALIGN (t
, align
);
10210 /* Information about the _FloatN and _FloatNx types. This must be in
10211 the same order as the corresponding TI_* enum values. */
10212 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10224 /* Create nodes for all integer types (and error_mark_node) using the sizes
10225 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10228 build_common_tree_nodes (bool signed_char
)
10232 error_mark_node
= make_node (ERROR_MARK
);
10233 TREE_TYPE (error_mark_node
) = error_mark_node
;
10235 initialize_sizetypes ();
10237 /* Define both `signed char' and `unsigned char'. */
10238 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10239 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10240 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10241 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10243 /* Define `char', which is like either `signed char' or `unsigned char'
10244 but not the same as either. */
10247 ? make_signed_type (CHAR_TYPE_SIZE
)
10248 : make_unsigned_type (CHAR_TYPE_SIZE
));
10249 TYPE_STRING_FLAG (char_type_node
) = 1;
10251 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10252 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10253 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10254 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10255 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10256 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10257 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10258 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10260 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10262 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10263 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10265 if (int_n_enabled_p
[i
])
10267 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10268 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10272 /* Define a boolean type. This type only represents boolean values but
10273 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10274 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10275 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10276 TYPE_PRECISION (boolean_type_node
) = 1;
10277 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10279 /* Define what type to use for size_t. */
10280 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10281 size_type_node
= unsigned_type_node
;
10282 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10283 size_type_node
= long_unsigned_type_node
;
10284 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10285 size_type_node
= long_long_unsigned_type_node
;
10286 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10287 size_type_node
= short_unsigned_type_node
;
10292 size_type_node
= NULL_TREE
;
10293 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10294 if (int_n_enabled_p
[i
])
10297 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10299 if (strcmp (name
, SIZE_TYPE
) == 0)
10301 size_type_node
= int_n_trees
[i
].unsigned_type
;
10304 if (size_type_node
== NULL_TREE
)
10305 gcc_unreachable ();
10308 /* Define what type to use for ptrdiff_t. */
10309 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10310 ptrdiff_type_node
= integer_type_node
;
10311 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10312 ptrdiff_type_node
= long_integer_type_node
;
10313 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10314 ptrdiff_type_node
= long_long_integer_type_node
;
10315 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10316 ptrdiff_type_node
= short_integer_type_node
;
10319 ptrdiff_type_node
= NULL_TREE
;
10320 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10321 if (int_n_enabled_p
[i
])
10324 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10325 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
10326 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10328 if (ptrdiff_type_node
== NULL_TREE
)
10329 gcc_unreachable ();
10332 /* Fill in the rest of the sized types. Reuse existing type nodes
10334 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10335 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10336 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10337 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10338 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10340 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10341 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10342 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10343 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10344 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10346 /* Don't call build_qualified type for atomics. That routine does
10347 special processing for atomics, and until they are initialized
10348 it's better not to make that call.
10350 Check to see if there is a target override for atomic types. */
10352 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10353 targetm
.atomic_align_for_mode (QImode
));
10354 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10355 targetm
.atomic_align_for_mode (HImode
));
10356 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10357 targetm
.atomic_align_for_mode (SImode
));
10358 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10359 targetm
.atomic_align_for_mode (DImode
));
10360 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10361 targetm
.atomic_align_for_mode (TImode
));
10363 access_public_node
= get_identifier ("public");
10364 access_protected_node
= get_identifier ("protected");
10365 access_private_node
= get_identifier ("private");
10367 /* Define these next since types below may used them. */
10368 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10369 integer_one_node
= build_int_cst (integer_type_node
, 1);
10370 integer_three_node
= build_int_cst (integer_type_node
, 3);
10371 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10373 size_zero_node
= size_int (0);
10374 size_one_node
= size_int (1);
10375 bitsize_zero_node
= bitsize_int (0);
10376 bitsize_one_node
= bitsize_int (1);
10377 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10379 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10380 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10382 void_type_node
= make_node (VOID_TYPE
);
10383 layout_type (void_type_node
);
10385 /* We are not going to have real types in C with less than byte alignment,
10386 so we might as well not have any types that claim to have it. */
10387 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10388 TYPE_USER_ALIGN (void_type_node
) = 0;
10390 void_node
= make_node (VOID_CST
);
10391 TREE_TYPE (void_node
) = void_type_node
;
10393 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10394 layout_type (TREE_TYPE (null_pointer_node
));
10396 ptr_type_node
= build_pointer_type (void_type_node
);
10397 const_ptr_type_node
10398 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10399 for (unsigned i
= 0;
10400 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10402 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10404 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10406 float_type_node
= make_node (REAL_TYPE
);
10407 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10408 layout_type (float_type_node
);
10410 double_type_node
= make_node (REAL_TYPE
);
10411 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10412 layout_type (double_type_node
);
10414 long_double_type_node
= make_node (REAL_TYPE
);
10415 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10416 layout_type (long_double_type_node
);
10418 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10420 int n
= floatn_nx_types
[i
].n
;
10421 bool extended
= floatn_nx_types
[i
].extended
;
10422 scalar_float_mode mode
;
10423 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10425 int precision
= GET_MODE_PRECISION (mode
);
10426 /* Work around the rs6000 KFmode having precision 113 not
10428 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10429 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10430 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10432 gcc_assert (min_precision
== n
);
10433 if (precision
< min_precision
)
10434 precision
= min_precision
;
10435 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10436 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10437 layout_type (FLOATN_NX_TYPE_NODE (i
));
10438 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10441 float_ptr_type_node
= build_pointer_type (float_type_node
);
10442 double_ptr_type_node
= build_pointer_type (double_type_node
);
10443 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10444 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10446 /* Fixed size integer types. */
10447 uint16_type_node
= make_or_reuse_type (16, 1);
10448 uint32_type_node
= make_or_reuse_type (32, 1);
10449 uint64_type_node
= make_or_reuse_type (64, 1);
10451 /* Decimal float types. */
10452 dfloat32_type_node
= make_node (REAL_TYPE
);
10453 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10454 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10455 layout_type (dfloat32_type_node
);
10456 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10458 dfloat64_type_node
= make_node (REAL_TYPE
);
10459 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10460 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10461 layout_type (dfloat64_type_node
);
10462 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10464 dfloat128_type_node
= make_node (REAL_TYPE
);
10465 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10466 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10467 layout_type (dfloat128_type_node
);
10468 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10470 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10471 complex_float_type_node
= build_complex_type (float_type_node
, true);
10472 complex_double_type_node
= build_complex_type (double_type_node
, true);
10473 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10476 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10478 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10479 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10480 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10483 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10484 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10485 sat_ ## KIND ## _type_node = \
10486 make_sat_signed_ ## KIND ## _type (SIZE); \
10487 sat_unsigned_ ## KIND ## _type_node = \
10488 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10489 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10490 unsigned_ ## KIND ## _type_node = \
10491 make_unsigned_ ## KIND ## _type (SIZE);
10493 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10494 sat_ ## WIDTH ## KIND ## _type_node = \
10495 make_sat_signed_ ## KIND ## _type (SIZE); \
10496 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10497 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10498 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10499 unsigned_ ## WIDTH ## KIND ## _type_node = \
10500 make_unsigned_ ## KIND ## _type (SIZE);
10502 /* Make fixed-point type nodes based on four different widths. */
10503 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10504 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10505 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10506 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10507 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10509 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10510 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10511 NAME ## _type_node = \
10512 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10513 u ## NAME ## _type_node = \
10514 make_or_reuse_unsigned_ ## KIND ## _type \
10515 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10516 sat_ ## NAME ## _type_node = \
10517 make_or_reuse_sat_signed_ ## KIND ## _type \
10518 (GET_MODE_BITSIZE (MODE ## mode)); \
10519 sat_u ## NAME ## _type_node = \
10520 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10521 (GET_MODE_BITSIZE (U ## MODE ## mode));
10523 /* Fixed-point type and mode nodes. */
10524 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10525 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10526 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10527 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10528 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10529 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10530 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10531 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10532 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10533 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10534 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10537 tree t
= targetm
.build_builtin_va_list ();
10539 /* Many back-ends define record types without setting TYPE_NAME.
10540 If we copied the record type here, we'd keep the original
10541 record type without a name. This breaks name mangling. So,
10542 don't copy record types and let c_common_nodes_and_builtins()
10543 declare the type to be __builtin_va_list. */
10544 if (TREE_CODE (t
) != RECORD_TYPE
)
10545 t
= build_variant_type_copy (t
);
10547 va_list_type_node
= t
;
10551 /* Modify DECL for given flags.
10552 TM_PURE attribute is set only on types, so the function will modify
10553 DECL's type when ECF_TM_PURE is used. */
10556 set_call_expr_flags (tree decl
, int flags
)
10558 if (flags
& ECF_NOTHROW
)
10559 TREE_NOTHROW (decl
) = 1;
10560 if (flags
& ECF_CONST
)
10561 TREE_READONLY (decl
) = 1;
10562 if (flags
& ECF_PURE
)
10563 DECL_PURE_P (decl
) = 1;
10564 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10565 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10566 if (flags
& ECF_NOVOPS
)
10567 DECL_IS_NOVOPS (decl
) = 1;
10568 if (flags
& ECF_NORETURN
)
10569 TREE_THIS_VOLATILE (decl
) = 1;
10570 if (flags
& ECF_MALLOC
)
10571 DECL_IS_MALLOC (decl
) = 1;
10572 if (flags
& ECF_RETURNS_TWICE
)
10573 DECL_IS_RETURNS_TWICE (decl
) = 1;
10574 if (flags
& ECF_LEAF
)
10575 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10576 NULL
, DECL_ATTRIBUTES (decl
));
10577 if (flags
& ECF_COLD
)
10578 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10579 NULL
, DECL_ATTRIBUTES (decl
));
10580 if (flags
& ECF_RET1
)
10581 DECL_ATTRIBUTES (decl
)
10582 = tree_cons (get_identifier ("fn spec"),
10583 build_tree_list (NULL_TREE
, build_string (1, "1")),
10584 DECL_ATTRIBUTES (decl
));
10585 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10586 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10587 /* Looping const or pure is implied by noreturn.
10588 There is currently no way to declare looping const or looping pure alone. */
10589 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10590 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10594 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10597 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10598 const char *library_name
, int ecf_flags
)
10602 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10603 library_name
, NULL_TREE
);
10604 set_call_expr_flags (decl
, ecf_flags
);
10606 set_builtin_decl (code
, decl
, true);
10609 /* Call this function after instantiating all builtins that the language
10610 front end cares about. This will build the rest of the builtins
10611 and internal functions that are relied upon by the tree optimizers and
10615 build_common_builtin_nodes (void)
10620 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10621 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10623 ftype
= build_function_type (void_type_node
, void_list_node
);
10624 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10625 local_define_builtin ("__builtin_unreachable", ftype
,
10626 BUILT_IN_UNREACHABLE
,
10627 "__builtin_unreachable",
10628 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10629 | ECF_CONST
| ECF_COLD
);
10630 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10631 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10633 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10636 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10637 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10639 ftype
= build_function_type_list (ptr_type_node
,
10640 ptr_type_node
, const_ptr_type_node
,
10641 size_type_node
, NULL_TREE
);
10643 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10644 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10645 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10646 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10647 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10648 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10651 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10653 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10654 const_ptr_type_node
, size_type_node
,
10656 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10657 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10660 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10662 ftype
= build_function_type_list (ptr_type_node
,
10663 ptr_type_node
, integer_type_node
,
10664 size_type_node
, NULL_TREE
);
10665 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10666 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10669 /* If we're checking the stack, `alloca' can throw. */
10670 const int alloca_flags
10671 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10673 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10675 ftype
= build_function_type_list (ptr_type_node
,
10676 size_type_node
, NULL_TREE
);
10677 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10678 "alloca", alloca_flags
);
10681 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10682 size_type_node
, NULL_TREE
);
10683 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10684 BUILT_IN_ALLOCA_WITH_ALIGN
,
10685 "__builtin_alloca_with_align",
10688 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10689 size_type_node
, size_type_node
, NULL_TREE
);
10690 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10691 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10692 "__builtin_alloca_with_align_and_max",
10695 ftype
= build_function_type_list (void_type_node
,
10696 ptr_type_node
, ptr_type_node
,
10697 ptr_type_node
, NULL_TREE
);
10698 local_define_builtin ("__builtin_init_trampoline", ftype
,
10699 BUILT_IN_INIT_TRAMPOLINE
,
10700 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10701 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10702 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10703 "__builtin_init_heap_trampoline",
10704 ECF_NOTHROW
| ECF_LEAF
);
10705 local_define_builtin ("__builtin_init_descriptor", ftype
,
10706 BUILT_IN_INIT_DESCRIPTOR
,
10707 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10709 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10710 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10711 BUILT_IN_ADJUST_TRAMPOLINE
,
10712 "__builtin_adjust_trampoline",
10713 ECF_CONST
| ECF_NOTHROW
);
10714 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10715 BUILT_IN_ADJUST_DESCRIPTOR
,
10716 "__builtin_adjust_descriptor",
10717 ECF_CONST
| ECF_NOTHROW
);
10719 ftype
= build_function_type_list (void_type_node
,
10720 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10721 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10722 BUILT_IN_NONLOCAL_GOTO
,
10723 "__builtin_nonlocal_goto",
10724 ECF_NORETURN
| ECF_NOTHROW
);
10726 ftype
= build_function_type_list (void_type_node
,
10727 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10728 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10729 BUILT_IN_SETJMP_SETUP
,
10730 "__builtin_setjmp_setup", ECF_NOTHROW
);
10732 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10733 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10734 BUILT_IN_SETJMP_RECEIVER
,
10735 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10737 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10738 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10739 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10741 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10742 local_define_builtin ("__builtin_stack_restore", ftype
,
10743 BUILT_IN_STACK_RESTORE
,
10744 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10746 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10747 const_ptr_type_node
, size_type_node
,
10749 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10750 "__builtin_memcmp_eq",
10751 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10753 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10754 "__builtin_strncmp_eq",
10755 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10757 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10758 "__builtin_strcmp_eq",
10759 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10761 /* If there's a possibility that we might use the ARM EABI, build the
10762 alternate __cxa_end_cleanup node used to resume from C++. */
10763 if (targetm
.arm_eabi_unwinder
)
10765 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10766 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10767 BUILT_IN_CXA_END_CLEANUP
,
10768 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10771 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10772 local_define_builtin ("__builtin_unwind_resume", ftype
,
10773 BUILT_IN_UNWIND_RESUME
,
10774 ((targetm_common
.except_unwind_info (&global_options
)
10776 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10779 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10781 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10783 local_define_builtin ("__builtin_return_address", ftype
,
10784 BUILT_IN_RETURN_ADDRESS
,
10785 "__builtin_return_address",
10789 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10790 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10792 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10793 ptr_type_node
, NULL_TREE
);
10794 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10795 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10796 BUILT_IN_PROFILE_FUNC_ENTER
,
10797 "__cyg_profile_func_enter", 0);
10798 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10799 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10800 BUILT_IN_PROFILE_FUNC_EXIT
,
10801 "__cyg_profile_func_exit", 0);
10804 /* The exception object and filter values from the runtime. The argument
10805 must be zero before exception lowering, i.e. from the front end. After
10806 exception lowering, it will be the region number for the exception
10807 landing pad. These functions are PURE instead of CONST to prevent
10808 them from being hoisted past the exception edge that will initialize
10809 its value in the landing pad. */
10810 ftype
= build_function_type_list (ptr_type_node
,
10811 integer_type_node
, NULL_TREE
);
10812 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10813 /* Only use TM_PURE if we have TM language support. */
10814 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10815 ecf_flags
|= ECF_TM_PURE
;
10816 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10817 "__builtin_eh_pointer", ecf_flags
);
10819 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10820 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10821 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10822 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10824 ftype
= build_function_type_list (void_type_node
,
10825 integer_type_node
, integer_type_node
,
10827 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10828 BUILT_IN_EH_COPY_VALUES
,
10829 "__builtin_eh_copy_values", ECF_NOTHROW
);
10831 /* Complex multiplication and division. These are handled as builtins
10832 rather than optabs because emit_library_call_value doesn't support
10833 complex. Further, we can do slightly better with folding these
10834 beasties if the real and complex parts of the arguments are separate. */
10838 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10840 char mode_name_buf
[4], *q
;
10842 enum built_in_function mcode
, dcode
;
10843 tree type
, inner_type
;
10844 const char *prefix
= "__";
10846 if (targetm
.libfunc_gnu_prefix
)
10849 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10852 inner_type
= TREE_TYPE (type
);
10854 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10855 inner_type
, inner_type
, NULL_TREE
);
10857 mcode
= ((enum built_in_function
)
10858 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10859 dcode
= ((enum built_in_function
)
10860 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10862 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10866 /* For -ftrapping-math these should throw from a former
10867 -fnon-call-exception stmt. */
10868 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10870 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10871 built_in_names
[mcode
],
10872 ECF_CONST
| ECF_LEAF
);
10874 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10876 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10877 built_in_names
[dcode
],
10878 ECF_CONST
| ECF_LEAF
);
10882 init_internal_fns ();
10885 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10888 If we requested a pointer to a vector, build up the pointers that
10889 we stripped off while looking for the inner type. Similarly for
10890 return values from functions.
10892 The argument TYPE is the top of the chain, and BOTTOM is the
10893 new type which we will point to. */
10896 reconstruct_complex_type (tree type
, tree bottom
)
10900 if (TREE_CODE (type
) == POINTER_TYPE
)
10902 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10903 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10904 TYPE_REF_CAN_ALIAS_ALL (type
));
10906 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10908 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10909 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10910 TYPE_REF_CAN_ALIAS_ALL (type
));
10912 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10914 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10915 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10917 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10919 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10920 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10922 else if (TREE_CODE (type
) == METHOD_TYPE
)
10924 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10925 /* The build_method_type_directly() routine prepends 'this' to argument list,
10926 so we must compensate by getting rid of it. */
10928 = build_method_type_directly
10929 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10931 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10933 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10935 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10936 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10941 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10942 TYPE_QUALS (type
));
10945 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10948 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10951 unsigned int bitsize
;
10953 switch (GET_MODE_CLASS (mode
))
10955 case MODE_VECTOR_BOOL
:
10956 case MODE_VECTOR_INT
:
10957 case MODE_VECTOR_FLOAT
:
10958 case MODE_VECTOR_FRACT
:
10959 case MODE_VECTOR_UFRACT
:
10960 case MODE_VECTOR_ACCUM
:
10961 case MODE_VECTOR_UACCUM
:
10962 nunits
= GET_MODE_NUNITS (mode
);
10966 /* Check that there are no leftover bits. */
10967 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10968 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10969 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10973 gcc_unreachable ();
10976 return make_vector_type (innertype
, nunits
, mode
);
10979 /* Similarly, but takes the inner type and number of units, which must be
10983 build_vector_type (tree innertype
, poly_int64 nunits
)
10985 return make_vector_type (innertype
, nunits
, VOIDmode
);
10988 /* Build truth vector with specified length and number of units. */
10991 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
10993 machine_mode mask_mode
10994 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10997 if (mask_mode
== BLKmode
)
10998 vsize
= vector_size
* BITS_PER_UNIT
;
11000 vsize
= GET_MODE_BITSIZE (mask_mode
);
11002 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
11004 tree bool_type
= build_nonstandard_boolean_type (esize
);
11006 return make_vector_type (bool_type
, nunits
, mask_mode
);
11009 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11012 build_same_sized_truth_vector_type (tree vectype
)
11014 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
11017 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
11019 if (known_eq (size
, 0U))
11020 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
11022 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
11025 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11028 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
11030 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11032 /* We always build the non-opaque variant before the opaque one,
11033 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11034 cand
= TYPE_NEXT_VARIANT (t
);
11036 && TYPE_VECTOR_OPAQUE (cand
)
11037 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11039 /* Othewise build a variant type and make sure to queue it after
11040 the non-opaque type. */
11041 cand
= build_distinct_type_copy (t
);
11042 TYPE_VECTOR_OPAQUE (cand
) = true;
11043 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11044 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11045 TYPE_NEXT_VARIANT (t
) = cand
;
11046 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11050 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11053 vector_cst_int_elt (const_tree t
, unsigned int i
)
11055 /* First handle elements that are directly encoded. */
11056 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11057 if (i
< encoded_nelts
)
11058 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
11060 /* Identify the pattern that contains element I and work out the index of
11061 the last encoded element for that pattern. */
11062 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11063 unsigned int pattern
= i
% npatterns
;
11064 unsigned int count
= i
/ npatterns
;
11065 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11067 /* If there are no steps, the final encoded value is the right one. */
11068 if (!VECTOR_CST_STEPPED_P (t
))
11069 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
11071 /* Otherwise work out the value from the last two encoded elements. */
11072 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
11073 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
11074 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
11075 return wi::to_wide (v2
) + (count
- 2) * diff
;
11078 /* Return the value of element I of VECTOR_CST T. */
11081 vector_cst_elt (const_tree t
, unsigned int i
)
11083 /* First handle elements that are directly encoded. */
11084 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11085 if (i
< encoded_nelts
)
11086 return VECTOR_CST_ENCODED_ELT (t
, i
);
11088 /* If there are no steps, the final encoded value is the right one. */
11089 if (!VECTOR_CST_STEPPED_P (t
))
11091 /* Identify the pattern that contains element I and work out the index of
11092 the last encoded element for that pattern. */
11093 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11094 unsigned int pattern
= i
% npatterns
;
11095 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11096 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11099 /* Otherwise work out the value from the last two encoded elements. */
11100 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11101 vector_cst_int_elt (t
, i
));
11104 /* Given an initializer INIT, return TRUE if INIT is zero or some
11105 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11106 null, set *NONZERO if and only if INIT is known not to be all
11107 zeros. The combination of return value of false and *NONZERO
11108 false implies that INIT may but need not be all zeros. Other
11109 combinations indicate definitive answers. */
11112 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11118 /* Conservatively clear NONZERO and set it only if INIT is definitely
11124 unsigned HOST_WIDE_INT off
= 0;
11126 switch (TREE_CODE (init
))
11129 if (integer_zerop (init
))
11136 /* ??? Note that this is not correct for C4X float formats. There,
11137 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11138 negative exponent. */
11139 if (real_zerop (init
)
11140 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11147 if (fixed_zerop (init
))
11154 if (integer_zerop (init
)
11155 || (real_zerop (init
)
11156 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11157 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11164 if (VECTOR_CST_NPATTERNS (init
) == 1
11165 && VECTOR_CST_DUPLICATE_P (init
)
11166 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11174 if (TREE_CLOBBER_P (init
))
11177 unsigned HOST_WIDE_INT idx
;
11180 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11181 if (!initializer_zerop (elt
, nonzero
))
11189 tree arg
= TREE_OPERAND (init
, 0);
11190 if (TREE_CODE (arg
) != ADDR_EXPR
)
11192 tree offset
= TREE_OPERAND (init
, 1);
11193 if (TREE_CODE (offset
) != INTEGER_CST
11194 || !tree_fits_uhwi_p (offset
))
11196 off
= tree_to_uhwi (offset
);
11199 arg
= TREE_OPERAND (arg
, 0);
11200 if (TREE_CODE (arg
) != STRING_CST
)
11204 /* Fall through. */
11208 gcc_assert (off
<= INT_MAX
);
11211 int n
= TREE_STRING_LENGTH (init
);
11215 /* We need to loop through all elements to handle cases like
11216 "\0" and "\0foobar". */
11217 for (i
= 0; i
< n
; ++i
)
11218 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11232 /* Return true if EXPR is an initializer expression in which every element
11233 is a constant that is numerically equal to 0 or 1. The elements do not
11234 need to be equal to each other. */
11237 initializer_each_zero_or_onep (const_tree expr
)
11239 STRIP_ANY_LOCATION_WRAPPER (expr
);
11241 switch (TREE_CODE (expr
))
11244 return integer_zerop (expr
) || integer_onep (expr
);
11247 return real_zerop (expr
) || real_onep (expr
);
11251 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11252 if (VECTOR_CST_STEPPED_P (expr
)
11253 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11256 for (unsigned int i
= 0; i
< nelts
; ++i
)
11258 tree elt
= VECTOR_CST_ENCODED_ELT (expr
, i
);
11259 if (!initializer_each_zero_or_onep (elt
))
11271 /* Check if vector VEC consists of all the equal elements and
11272 that the number of elements corresponds to the type of VEC.
11273 The function returns first element of the vector
11274 or NULL_TREE if the vector is not uniform. */
11276 uniform_vector_p (const_tree vec
)
11279 unsigned HOST_WIDE_INT i
, nelts
;
11281 if (vec
== NULL_TREE
)
11284 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11286 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11287 return TREE_OPERAND (vec
, 0);
11289 else if (TREE_CODE (vec
) == VECTOR_CST
)
11291 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11292 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11296 else if (TREE_CODE (vec
) == CONSTRUCTOR
11297 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11299 first
= error_mark_node
;
11301 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11308 if (!operand_equal_p (first
, t
, 0))
11320 /* If the argument is INTEGER_CST, return it. If the argument is vector
11321 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11323 Look through location wrappers. */
11326 uniform_integer_cst_p (tree t
)
11328 STRIP_ANY_LOCATION_WRAPPER (t
);
11330 if (TREE_CODE (t
) == INTEGER_CST
)
11333 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11335 t
= uniform_vector_p (t
);
11336 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11343 /* Build an empty statement at location LOC. */
11346 build_empty_stmt (location_t loc
)
11348 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11349 SET_EXPR_LOCATION (t
, loc
);
11354 /* Build an OpenMP clause with code CODE. LOC is the location of the
11358 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11363 length
= omp_clause_num_ops
[code
];
11364 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11366 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11368 t
= (tree
) ggc_internal_alloc (size
);
11369 memset (t
, 0, size
);
11370 TREE_SET_CODE (t
, OMP_CLAUSE
);
11371 OMP_CLAUSE_SET_CODE (t
, code
);
11372 OMP_CLAUSE_LOCATION (t
) = loc
;
11377 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11378 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11379 Except for the CODE and operand count field, other storage for the
11380 object is initialized to zeros. */
11383 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11386 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11388 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11389 gcc_assert (len
>= 1);
11391 record_node_allocation_statistics (code
, length
);
11393 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11395 TREE_SET_CODE (t
, code
);
11397 /* Can't use TREE_OPERAND to store the length because if checking is
11398 enabled, it will try to check the length before we store it. :-P */
11399 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11404 /* Helper function for build_call_* functions; build a CALL_EXPR with
11405 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11406 the argument slots. */
11409 build_call_1 (tree return_type
, tree fn
, int nargs
)
11413 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11414 TREE_TYPE (t
) = return_type
;
11415 CALL_EXPR_FN (t
) = fn
;
11416 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11421 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11422 FN and a null static chain slot. NARGS is the number of call arguments
11423 which are specified as "..." arguments. */
11426 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11430 va_start (args
, nargs
);
11431 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11436 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11437 FN and a null static chain slot. NARGS is the number of call arguments
11438 which are specified as a va_list ARGS. */
11441 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11446 t
= build_call_1 (return_type
, fn
, nargs
);
11447 for (i
= 0; i
< nargs
; i
++)
11448 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11449 process_call_operands (t
);
11453 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11454 FN and a null static chain slot. NARGS is the number of call arguments
11455 which are specified as a tree array ARGS. */
11458 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11459 int nargs
, const tree
*args
)
11464 t
= build_call_1 (return_type
, fn
, nargs
);
11465 for (i
= 0; i
< nargs
; i
++)
11466 CALL_EXPR_ARG (t
, i
) = args
[i
];
11467 process_call_operands (t
);
11468 SET_EXPR_LOCATION (t
, loc
);
11472 /* Like build_call_array, but takes a vec. */
11475 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11480 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11481 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11482 CALL_EXPR_ARG (ret
, ix
) = t
;
11483 process_call_operands (ret
);
11487 /* Conveniently construct a function call expression. FNDECL names the
11488 function to be called and N arguments are passed in the array
11492 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11494 tree fntype
= TREE_TYPE (fndecl
);
11495 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11497 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11500 /* Conveniently construct a function call expression. FNDECL names the
11501 function to be called and the arguments are passed in the vector
11505 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11507 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11508 vec_safe_address (vec
));
11512 /* Conveniently construct a function call expression. FNDECL names the
11513 function to be called, N is the number of arguments, and the "..."
11514 parameters are the argument expressions. */
11517 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11520 tree
*argarray
= XALLOCAVEC (tree
, n
);
11524 for (i
= 0; i
< n
; i
++)
11525 argarray
[i
] = va_arg (ap
, tree
);
11527 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11530 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11531 varargs macros aren't supported by all bootstrap compilers. */
11534 build_call_expr (tree fndecl
, int n
, ...)
11537 tree
*argarray
= XALLOCAVEC (tree
, n
);
11541 for (i
= 0; i
< n
; i
++)
11542 argarray
[i
] = va_arg (ap
, tree
);
11544 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11547 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11548 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11549 It will get gimplified later into an ordinary internal function. */
11552 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11553 tree type
, int n
, const tree
*args
)
11555 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11556 for (int i
= 0; i
< n
; ++i
)
11557 CALL_EXPR_ARG (t
, i
) = args
[i
];
11558 SET_EXPR_LOCATION (t
, loc
);
11559 CALL_EXPR_IFN (t
) = ifn
;
11563 /* Build internal call expression. This is just like CALL_EXPR, except
11564 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11565 internal function. */
11568 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11569 tree type
, int n
, ...)
11572 tree
*argarray
= XALLOCAVEC (tree
, n
);
11576 for (i
= 0; i
< n
; i
++)
11577 argarray
[i
] = va_arg (ap
, tree
);
11579 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11582 /* Return a function call to FN, if the target is guaranteed to support it,
11585 N is the number of arguments, passed in the "...", and TYPE is the
11586 type of the return value. */
11589 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11593 tree
*argarray
= XALLOCAVEC (tree
, n
);
11597 for (i
= 0; i
< n
; i
++)
11598 argarray
[i
] = va_arg (ap
, tree
);
11600 if (internal_fn_p (fn
))
11602 internal_fn ifn
= as_internal_fn (fn
);
11603 if (direct_internal_fn_p (ifn
))
11605 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11606 if (!direct_internal_fn_supported_p (ifn
, types
,
11607 OPTIMIZE_FOR_BOTH
))
11610 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11614 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11617 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11621 /* Return a function call to the appropriate builtin alloca variant.
11623 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11624 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11625 bound for SIZE in case it is not a fixed value. */
11628 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11632 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11634 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11636 else if (align
> 0)
11638 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11639 return build_call_expr (t
, 2, size
, size_int (align
));
11643 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11644 return build_call_expr (t
, 1, size
);
11648 /* Create a new constant string literal consisting of elements of type
11649 ELTYPE and return a tree node representing char* pointer to it as
11650 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11651 the LEN bytes at STR (the representation of the string, which may
11655 build_string_literal (int len
, const char *str
,
11656 tree eltype
/* = char_type_node */)
11658 tree t
= build_string (len
, str
);
11659 tree index
= build_index_type (size_int (len
- 1));
11660 eltype
= build_type_variant (eltype
, 1, 0);
11661 tree type
= build_array_type (eltype
, index
);
11662 TREE_TYPE (t
) = type
;
11663 TREE_CONSTANT (t
) = 1;
11664 TREE_READONLY (t
) = 1;
11665 TREE_STATIC (t
) = 1;
11667 type
= build_pointer_type (eltype
);
11668 t
= build1 (ADDR_EXPR
, type
,
11669 build4 (ARRAY_REF
, eltype
,
11670 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11676 /* Return true if T (assumed to be a DECL) must be assigned a memory
11680 needs_to_live_in_memory (const_tree t
)
11682 return (TREE_ADDRESSABLE (t
)
11683 || is_global_var (t
)
11684 || (TREE_CODE (t
) == RESULT_DECL
11685 && !DECL_BY_REFERENCE (t
)
11686 && aggregate_value_p (t
, current_function_decl
)));
11689 /* Return value of a constant X and sign-extend it. */
11692 int_cst_value (const_tree x
)
11694 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11695 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11697 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11698 gcc_assert (cst_and_fits_in_hwi (x
));
11700 if (bits
< HOST_BITS_PER_WIDE_INT
)
11702 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11704 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11706 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11712 /* If TYPE is an integral or pointer type, return an integer type with
11713 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11714 if TYPE is already an integer type of signedness UNSIGNEDP.
11715 If TYPE is a floating-point type, return an integer type with the same
11716 bitsize and with the signedness given by UNSIGNEDP; this is useful
11717 when doing bit-level operations on a floating-point value. */
11720 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11722 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11725 if (TREE_CODE (type
) == VECTOR_TYPE
)
11727 tree inner
= TREE_TYPE (type
);
11728 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11731 if (inner
== inner2
)
11733 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11736 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11738 tree inner
= TREE_TYPE (type
);
11739 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11742 if (inner
== inner2
)
11744 return build_complex_type (inner2
);
11748 if (INTEGRAL_TYPE_P (type
)
11749 || POINTER_TYPE_P (type
)
11750 || TREE_CODE (type
) == OFFSET_TYPE
)
11751 bits
= TYPE_PRECISION (type
);
11752 else if (TREE_CODE (type
) == REAL_TYPE
)
11753 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11757 return build_nonstandard_integer_type (bits
, unsignedp
);
11760 /* If TYPE is an integral or pointer type, return an integer type with
11761 the same precision which is unsigned, or itself if TYPE is already an
11762 unsigned integer type. If TYPE is a floating-point type, return an
11763 unsigned integer type with the same bitsize as TYPE. */
11766 unsigned_type_for (tree type
)
11768 return signed_or_unsigned_type_for (1, type
);
11771 /* If TYPE is an integral or pointer type, return an integer type with
11772 the same precision which is signed, or itself if TYPE is already a
11773 signed integer type. If TYPE is a floating-point type, return a
11774 signed integer type with the same bitsize as TYPE. */
11777 signed_type_for (tree type
)
11779 return signed_or_unsigned_type_for (0, type
);
11782 /* If TYPE is a vector type, return a signed integer vector type with the
11783 same width and number of subparts. Otherwise return boolean_type_node. */
11786 truth_type_for (tree type
)
11788 if (TREE_CODE (type
) == VECTOR_TYPE
)
11790 if (VECTOR_BOOLEAN_TYPE_P (type
))
11792 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11793 GET_MODE_SIZE (TYPE_MODE (type
)));
11796 return boolean_type_node
;
11799 /* Returns the largest value obtainable by casting something in INNER type to
11803 upper_bound_in_type (tree outer
, tree inner
)
11805 unsigned int det
= 0;
11806 unsigned oprec
= TYPE_PRECISION (outer
);
11807 unsigned iprec
= TYPE_PRECISION (inner
);
11810 /* Compute a unique number for every combination. */
11811 det
|= (oprec
> iprec
) ? 4 : 0;
11812 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11813 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11815 /* Determine the exponent to use. */
11820 /* oprec <= iprec, outer: signed, inner: don't care. */
11825 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11829 /* oprec > iprec, outer: signed, inner: signed. */
11833 /* oprec > iprec, outer: signed, inner: unsigned. */
11837 /* oprec > iprec, outer: unsigned, inner: signed. */
11841 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11845 gcc_unreachable ();
11848 return wide_int_to_tree (outer
,
11849 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11852 /* Returns the smallest value obtainable by casting something in INNER type to
11856 lower_bound_in_type (tree outer
, tree inner
)
11858 unsigned oprec
= TYPE_PRECISION (outer
);
11859 unsigned iprec
= TYPE_PRECISION (inner
);
11861 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11863 if (TYPE_UNSIGNED (outer
)
11864 /* If we are widening something of an unsigned type, OUTER type
11865 contains all values of INNER type. In particular, both INNER
11866 and OUTER types have zero in common. */
11867 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11868 return build_int_cst (outer
, 0);
11871 /* If we are widening a signed type to another signed type, we
11872 want to obtain -2^^(iprec-1). If we are keeping the
11873 precision or narrowing to a signed type, we want to obtain
11875 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11876 return wide_int_to_tree (outer
,
11877 wi::mask (prec
- 1, true,
11878 TYPE_PRECISION (outer
)));
11882 /* Return nonzero if two operands that are suitable for PHI nodes are
11883 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11884 SSA_NAME or invariant. Note that this is strictly an optimization.
11885 That is, callers of this function can directly call operand_equal_p
11886 and get the same result, only slower. */
11889 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11893 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11895 return operand_equal_p (arg0
, arg1
, 0);
11898 /* Returns number of zeros at the end of binary representation of X. */
11901 num_ending_zeros (const_tree x
)
11903 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11907 #define WALK_SUBTREE(NODE) \
11910 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11916 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11917 be walked whenever a type is seen in the tree. Rest of operands and return
11918 value are as for walk_tree. */
11921 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11922 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11924 tree result
= NULL_TREE
;
11926 switch (TREE_CODE (type
))
11929 case REFERENCE_TYPE
:
11931 /* We have to worry about mutually recursive pointers. These can't
11932 be written in C. They can in Ada. It's pathological, but
11933 there's an ACATS test (c38102a) that checks it. Deal with this
11934 by checking if we're pointing to another pointer, that one
11935 points to another pointer, that one does too, and we have no htab.
11936 If so, get a hash table. We check three levels deep to avoid
11937 the cost of the hash table if we don't need one. */
11938 if (POINTER_TYPE_P (TREE_TYPE (type
))
11939 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11940 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11943 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11954 WALK_SUBTREE (TREE_TYPE (type
));
11958 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11960 /* Fall through. */
11962 case FUNCTION_TYPE
:
11963 WALK_SUBTREE (TREE_TYPE (type
));
11967 /* We never want to walk into default arguments. */
11968 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11969 WALK_SUBTREE (TREE_VALUE (arg
));
11974 /* Don't follow this nodes's type if a pointer for fear that
11975 we'll have infinite recursion. If we have a PSET, then we
11978 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11979 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11980 WALK_SUBTREE (TREE_TYPE (type
));
11981 WALK_SUBTREE (TYPE_DOMAIN (type
));
11985 WALK_SUBTREE (TREE_TYPE (type
));
11986 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11996 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11997 called with the DATA and the address of each sub-tree. If FUNC returns a
11998 non-NULL value, the traversal is stopped, and the value returned by FUNC
11999 is returned. If PSET is non-NULL it is used to record the nodes visited,
12000 and to avoid visiting a node more than once. */
12003 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12004 hash_set
<tree
> *pset
, walk_tree_lh lh
)
12006 enum tree_code code
;
12010 #define WALK_SUBTREE_TAIL(NODE) \
12014 goto tail_recurse; \
12019 /* Skip empty subtrees. */
12023 /* Don't walk the same tree twice, if the user has requested
12024 that we avoid doing so. */
12025 if (pset
&& pset
->add (*tp
))
12028 /* Call the function. */
12030 result
= (*func
) (tp
, &walk_subtrees
, data
);
12032 /* If we found something, return it. */
12036 code
= TREE_CODE (*tp
);
12038 /* Even if we didn't, FUNC may have decided that there was nothing
12039 interesting below this point in the tree. */
12040 if (!walk_subtrees
)
12042 /* But we still need to check our siblings. */
12043 if (code
== TREE_LIST
)
12044 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12045 else if (code
== OMP_CLAUSE
)
12046 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12053 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12054 if (result
|| !walk_subtrees
)
12061 case IDENTIFIER_NODE
:
12068 case PLACEHOLDER_EXPR
:
12072 /* None of these have subtrees other than those already walked
12077 WALK_SUBTREE (TREE_VALUE (*tp
));
12078 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12083 int len
= TREE_VEC_LENGTH (*tp
);
12088 /* Walk all elements but the first. */
12090 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12092 /* Now walk the first one as a tail call. */
12093 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12097 WALK_SUBTREE (TREE_REALPART (*tp
));
12098 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12102 unsigned HOST_WIDE_INT idx
;
12103 constructor_elt
*ce
;
12105 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12107 WALK_SUBTREE (ce
->value
);
12112 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12117 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12119 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12120 into declarations that are just mentioned, rather than
12121 declared; they don't really belong to this part of the tree.
12122 And, we can see cycles: the initializer for a declaration
12123 can refer to the declaration itself. */
12124 WALK_SUBTREE (DECL_INITIAL (decl
));
12125 WALK_SUBTREE (DECL_SIZE (decl
));
12126 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12128 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12131 case STATEMENT_LIST
:
12133 tree_stmt_iterator i
;
12134 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12135 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12140 switch (OMP_CLAUSE_CODE (*tp
))
12142 case OMP_CLAUSE_GANG
:
12143 case OMP_CLAUSE__GRIDDIM_
:
12144 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12147 case OMP_CLAUSE_ASYNC
:
12148 case OMP_CLAUSE_WAIT
:
12149 case OMP_CLAUSE_WORKER
:
12150 case OMP_CLAUSE_VECTOR
:
12151 case OMP_CLAUSE_NUM_GANGS
:
12152 case OMP_CLAUSE_NUM_WORKERS
:
12153 case OMP_CLAUSE_VECTOR_LENGTH
:
12154 case OMP_CLAUSE_PRIVATE
:
12155 case OMP_CLAUSE_SHARED
:
12156 case OMP_CLAUSE_FIRSTPRIVATE
:
12157 case OMP_CLAUSE_COPYIN
:
12158 case OMP_CLAUSE_COPYPRIVATE
:
12159 case OMP_CLAUSE_FINAL
:
12160 case OMP_CLAUSE_IF
:
12161 case OMP_CLAUSE_NUM_THREADS
:
12162 case OMP_CLAUSE_SCHEDULE
:
12163 case OMP_CLAUSE_UNIFORM
:
12164 case OMP_CLAUSE_DEPEND
:
12165 case OMP_CLAUSE_NONTEMPORAL
:
12166 case OMP_CLAUSE_NUM_TEAMS
:
12167 case OMP_CLAUSE_THREAD_LIMIT
:
12168 case OMP_CLAUSE_DEVICE
:
12169 case OMP_CLAUSE_DIST_SCHEDULE
:
12170 case OMP_CLAUSE_SAFELEN
:
12171 case OMP_CLAUSE_SIMDLEN
:
12172 case OMP_CLAUSE_ORDERED
:
12173 case OMP_CLAUSE_PRIORITY
:
12174 case OMP_CLAUSE_GRAINSIZE
:
12175 case OMP_CLAUSE_NUM_TASKS
:
12176 case OMP_CLAUSE_HINT
:
12177 case OMP_CLAUSE_TO_DECLARE
:
12178 case OMP_CLAUSE_LINK
:
12179 case OMP_CLAUSE_USE_DEVICE_PTR
:
12180 case OMP_CLAUSE_IS_DEVICE_PTR
:
12181 case OMP_CLAUSE__LOOPTEMP_
:
12182 case OMP_CLAUSE__REDUCTEMP_
:
12183 case OMP_CLAUSE__SIMDUID_
:
12184 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12187 case OMP_CLAUSE_INDEPENDENT
:
12188 case OMP_CLAUSE_NOWAIT
:
12189 case OMP_CLAUSE_DEFAULT
:
12190 case OMP_CLAUSE_UNTIED
:
12191 case OMP_CLAUSE_MERGEABLE
:
12192 case OMP_CLAUSE_PROC_BIND
:
12193 case OMP_CLAUSE_INBRANCH
:
12194 case OMP_CLAUSE_NOTINBRANCH
:
12195 case OMP_CLAUSE_FOR
:
12196 case OMP_CLAUSE_PARALLEL
:
12197 case OMP_CLAUSE_SECTIONS
:
12198 case OMP_CLAUSE_TASKGROUP
:
12199 case OMP_CLAUSE_NOGROUP
:
12200 case OMP_CLAUSE_THREADS
:
12201 case OMP_CLAUSE_SIMD
:
12202 case OMP_CLAUSE_DEFAULTMAP
:
12203 case OMP_CLAUSE_AUTO
:
12204 case OMP_CLAUSE_SEQ
:
12205 case OMP_CLAUSE_TILE
:
12206 case OMP_CLAUSE__SIMT_
:
12207 case OMP_CLAUSE_IF_PRESENT
:
12208 case OMP_CLAUSE_FINALIZE
:
12209 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12211 case OMP_CLAUSE_LASTPRIVATE
:
12212 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12213 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12214 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12216 case OMP_CLAUSE_COLLAPSE
:
12219 for (i
= 0; i
< 3; i
++)
12220 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12221 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12224 case OMP_CLAUSE_LINEAR
:
12225 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12226 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12227 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12228 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12230 case OMP_CLAUSE_ALIGNED
:
12231 case OMP_CLAUSE_FROM
:
12232 case OMP_CLAUSE_TO
:
12233 case OMP_CLAUSE_MAP
:
12234 case OMP_CLAUSE__CACHE_
:
12235 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12236 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12237 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12239 case OMP_CLAUSE_REDUCTION
:
12240 case OMP_CLAUSE_TASK_REDUCTION
:
12241 case OMP_CLAUSE_IN_REDUCTION
:
12244 for (i
= 0; i
< 5; i
++)
12245 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12246 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12250 gcc_unreachable ();
12258 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12259 But, we only want to walk once. */
12260 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12261 for (i
= 0; i
< len
; ++i
)
12262 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12263 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12267 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12268 defining. We only want to walk into these fields of a type in this
12269 case and not in the general case of a mere reference to the type.
12271 The criterion is as follows: if the field can be an expression, it
12272 must be walked only here. This should be in keeping with the fields
12273 that are directly gimplified in gimplify_type_sizes in order for the
12274 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12275 variable-sized types.
12277 Note that DECLs get walked as part of processing the BIND_EXPR. */
12278 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12280 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12281 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12284 /* Call the function for the type. See if it returns anything or
12285 doesn't want us to continue. If we are to continue, walk both
12286 the normal fields and those for the declaration case. */
12287 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12288 if (result
|| !walk_subtrees
)
12291 /* But do not walk a pointed-to type since it may itself need to
12292 be walked in the declaration case if it isn't anonymous. */
12293 if (!POINTER_TYPE_P (*type_p
))
12295 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12300 /* If this is a record type, also walk the fields. */
12301 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12305 for (field
= TYPE_FIELDS (*type_p
); field
;
12306 field
= DECL_CHAIN (field
))
12308 /* We'd like to look at the type of the field, but we can
12309 easily get infinite recursion. So assume it's pointed
12310 to elsewhere in the tree. Also, ignore things that
12312 if (TREE_CODE (field
) != FIELD_DECL
)
12315 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12316 WALK_SUBTREE (DECL_SIZE (field
));
12317 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12318 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12319 WALK_SUBTREE (DECL_QUALIFIER (field
));
12323 /* Same for scalar types. */
12324 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12325 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12326 || TREE_CODE (*type_p
) == INTEGER_TYPE
12327 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12328 || TREE_CODE (*type_p
) == REAL_TYPE
)
12330 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12331 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12334 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12335 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12340 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12344 /* Walk over all the sub-trees of this operand. */
12345 len
= TREE_OPERAND_LENGTH (*tp
);
12347 /* Go through the subtrees. We need to do this in forward order so
12348 that the scope of a FOR_EXPR is handled properly. */
12351 for (i
= 0; i
< len
- 1; ++i
)
12352 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12353 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12356 /* If this is a type, walk the needed fields in the type. */
12357 else if (TYPE_P (*tp
))
12358 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12362 /* We didn't find what we were looking for. */
12365 #undef WALK_SUBTREE_TAIL
12367 #undef WALK_SUBTREE
12369 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12372 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12377 hash_set
<tree
> pset
;
12378 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12384 tree_block (tree t
)
12386 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12388 if (IS_EXPR_CODE_CLASS (c
))
12389 return LOCATION_BLOCK (t
->exp
.locus
);
12390 gcc_unreachable ();
12395 tree_set_block (tree t
, tree b
)
12397 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12399 if (IS_EXPR_CODE_CLASS (c
))
12401 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12404 gcc_unreachable ();
12407 /* Create a nameless artificial label and put it in the current
12408 function context. The label has a location of LOC. Returns the
12409 newly created label. */
12412 create_artificial_label (location_t loc
)
12414 tree lab
= build_decl (loc
,
12415 LABEL_DECL
, NULL_TREE
, void_type_node
);
12417 DECL_ARTIFICIAL (lab
) = 1;
12418 DECL_IGNORED_P (lab
) = 1;
12419 DECL_CONTEXT (lab
) = current_function_decl
;
12423 /* Given a tree, try to return a useful variable name that we can use
12424 to prefix a temporary that is being assigned the value of the tree.
12425 I.E. given <temp> = &A, return A. */
12430 tree stripped_decl
;
12433 STRIP_NOPS (stripped_decl
);
12434 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12435 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12436 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12438 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12441 return IDENTIFIER_POINTER (name
);
12445 switch (TREE_CODE (stripped_decl
))
12448 return get_name (TREE_OPERAND (stripped_decl
, 0));
12455 /* Return true if TYPE has a variable argument list. */
12458 stdarg_p (const_tree fntype
)
12460 function_args_iterator args_iter
;
12461 tree n
= NULL_TREE
, t
;
12466 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12471 return n
!= NULL_TREE
&& n
!= void_type_node
;
12474 /* Return true if TYPE has a prototype. */
12477 prototype_p (const_tree fntype
)
12481 gcc_assert (fntype
!= NULL_TREE
);
12483 t
= TYPE_ARG_TYPES (fntype
);
12484 return (t
!= NULL_TREE
);
12487 /* If BLOCK is inlined from an __attribute__((__artificial__))
12488 routine, return pointer to location from where it has been
12491 block_nonartificial_location (tree block
)
12493 location_t
*ret
= NULL
;
12495 while (block
&& TREE_CODE (block
) == BLOCK
12496 && BLOCK_ABSTRACT_ORIGIN (block
))
12498 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12499 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12501 /* If AO is an artificial inline, point RET to the
12502 call site locus at which it has been inlined and continue
12503 the loop, in case AO's caller is also an artificial
12505 if (DECL_DECLARED_INLINE_P (ao
)
12506 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12507 ret
= &BLOCK_SOURCE_LOCATION (block
);
12511 else if (TREE_CODE (ao
) != BLOCK
)
12514 block
= BLOCK_SUPERCONTEXT (block
);
12520 /* If EXP is inlined from an __attribute__((__artificial__))
12521 function, return the location of the original call expression. */
12524 tree_nonartificial_location (tree exp
)
12526 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12531 return EXPR_LOCATION (exp
);
12535 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12538 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12541 cl_option_hasher::hash (tree x
)
12543 const_tree
const t
= x
;
12547 hashval_t hash
= 0;
12549 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12551 p
= (const char *)TREE_OPTIMIZATION (t
);
12552 len
= sizeof (struct cl_optimization
);
12555 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12556 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12559 gcc_unreachable ();
12561 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12563 for (i
= 0; i
< len
; i
++)
12565 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12570 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12571 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12575 cl_option_hasher::equal (tree x
, tree y
)
12577 const_tree
const xt
= x
;
12578 const_tree
const yt
= y
;
12580 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12583 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12584 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12585 TREE_OPTIMIZATION (yt
));
12586 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12587 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12588 TREE_TARGET_OPTION (yt
));
12590 gcc_unreachable ();
12593 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12596 build_optimization_node (struct gcc_options
*opts
)
12600 /* Use the cache of optimization nodes. */
12602 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12605 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12609 /* Insert this one into the hash table. */
12610 t
= cl_optimization_node
;
12613 /* Make a new node for next time round. */
12614 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12620 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12623 build_target_option_node (struct gcc_options
*opts
)
12627 /* Use the cache of optimization nodes. */
12629 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12632 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12636 /* Insert this one into the hash table. */
12637 t
= cl_target_option_node
;
12640 /* Make a new node for next time round. */
12641 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12647 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12648 so that they aren't saved during PCH writing. */
12651 prepare_target_option_nodes_for_pch (void)
12653 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12654 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12655 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12656 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12659 /* Determine the "ultimate origin" of a block. */
12662 block_ultimate_origin (const_tree block
)
12664 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12666 if (origin
== NULL_TREE
)
12670 gcc_checking_assert ((DECL_P (origin
)
12671 && DECL_ORIGIN (origin
) == origin
)
12672 || BLOCK_ORIGIN (origin
) == origin
);
12677 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12681 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12683 /* Do not strip casts into or out of differing address spaces. */
12684 if (POINTER_TYPE_P (outer_type
)
12685 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12687 if (!POINTER_TYPE_P (inner_type
)
12688 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12689 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12692 else if (POINTER_TYPE_P (inner_type
)
12693 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12695 /* We already know that outer_type is not a pointer with
12696 a non-generic address space. */
12700 /* Use precision rather then machine mode when we can, which gives
12701 the correct answer even for submode (bit-field) types. */
12702 if ((INTEGRAL_TYPE_P (outer_type
)
12703 || POINTER_TYPE_P (outer_type
)
12704 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12705 && (INTEGRAL_TYPE_P (inner_type
)
12706 || POINTER_TYPE_P (inner_type
)
12707 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12708 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12710 /* Otherwise fall back on comparing machine modes (e.g. for
12711 aggregate types, floats). */
12712 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12715 /* Return true iff conversion in EXP generates no instruction. Mark
12716 it inline so that we fully inline into the stripping functions even
12717 though we have two uses of this function. */
12720 tree_nop_conversion (const_tree exp
)
12722 tree outer_type
, inner_type
;
12724 if (location_wrapper_p (exp
))
12726 if (!CONVERT_EXPR_P (exp
)
12727 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12729 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12732 outer_type
= TREE_TYPE (exp
);
12733 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12738 return tree_nop_conversion_p (outer_type
, inner_type
);
12741 /* Return true iff conversion in EXP generates no instruction. Don't
12742 consider conversions changing the signedness. */
12745 tree_sign_nop_conversion (const_tree exp
)
12747 tree outer_type
, inner_type
;
12749 if (!tree_nop_conversion (exp
))
12752 outer_type
= TREE_TYPE (exp
);
12753 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12755 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12756 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12759 /* Strip conversions from EXP according to tree_nop_conversion and
12760 return the resulting expression. */
12763 tree_strip_nop_conversions (tree exp
)
12765 while (tree_nop_conversion (exp
))
12766 exp
= TREE_OPERAND (exp
, 0);
12770 /* Strip conversions from EXP according to tree_sign_nop_conversion
12771 and return the resulting expression. */
12774 tree_strip_sign_nop_conversions (tree exp
)
12776 while (tree_sign_nop_conversion (exp
))
12777 exp
= TREE_OPERAND (exp
, 0);
12781 /* Avoid any floating point extensions from EXP. */
12783 strip_float_extensions (tree exp
)
12785 tree sub
, expt
, subt
;
12787 /* For floating point constant look up the narrowest type that can hold
12788 it properly and handle it like (type)(narrowest_type)constant.
12789 This way we can optimize for instance a=a*2.0 where "a" is float
12790 but 2.0 is double constant. */
12791 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12793 REAL_VALUE_TYPE orig
;
12796 orig
= TREE_REAL_CST (exp
);
12797 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12798 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12799 type
= float_type_node
;
12800 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12801 > TYPE_PRECISION (double_type_node
)
12802 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12803 type
= double_type_node
;
12805 return build_real_truncate (type
, orig
);
12808 if (!CONVERT_EXPR_P (exp
))
12811 sub
= TREE_OPERAND (exp
, 0);
12812 subt
= TREE_TYPE (sub
);
12813 expt
= TREE_TYPE (exp
);
12815 if (!FLOAT_TYPE_P (subt
))
12818 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12821 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12824 return strip_float_extensions (sub
);
12827 /* Strip out all handled components that produce invariant
12831 strip_invariant_refs (const_tree op
)
12833 while (handled_component_p (op
))
12835 switch (TREE_CODE (op
))
12838 case ARRAY_RANGE_REF
:
12839 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12840 || TREE_OPERAND (op
, 2) != NULL_TREE
12841 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12845 case COMPONENT_REF
:
12846 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12852 op
= TREE_OPERAND (op
, 0);
12858 static GTY(()) tree gcc_eh_personality_decl
;
12860 /* Return the GCC personality function decl. */
12863 lhd_gcc_personality (void)
12865 if (!gcc_eh_personality_decl
)
12866 gcc_eh_personality_decl
= build_personality_function ("gcc");
12867 return gcc_eh_personality_decl
;
12870 /* TARGET is a call target of GIMPLE call statement
12871 (obtained by gimple_call_fn). Return true if it is
12872 OBJ_TYPE_REF representing an virtual call of C++ method.
12873 (As opposed to OBJ_TYPE_REF representing objc calls
12874 through a cast where middle-end devirtualization machinery
12878 virtual_method_call_p (const_tree target
)
12880 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12882 tree t
= TREE_TYPE (target
);
12883 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12885 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12887 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12888 /* If we do not have BINFO associated, it means that type was built
12889 without devirtualization enabled. Do not consider this a virtual
12891 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12896 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12899 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12902 tree base_binfo
, b
;
12904 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12905 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12906 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12908 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12913 /* Try to find a base info of BINFO that would have its field decl at offset
12914 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12915 found, return, otherwise return NULL_TREE. */
12918 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12920 tree type
= BINFO_TYPE (binfo
);
12924 HOST_WIDE_INT pos
, size
;
12928 if (types_same_for_odr (type
, expected_type
))
12930 if (maybe_lt (offset
, 0))
12933 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12935 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12938 pos
= int_bit_position (fld
);
12939 size
= tree_to_uhwi (DECL_SIZE (fld
));
12940 if (known_in_range_p (offset
, pos
, size
))
12943 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12946 /* Offset 0 indicates the primary base, whose vtable contents are
12947 represented in the binfo for the derived class. */
12948 else if (maybe_ne (offset
, 0))
12950 tree found_binfo
= NULL
, base_binfo
;
12951 /* Offsets in BINFO are in bytes relative to the whole structure
12952 while POS is in bits relative to the containing field. */
12953 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12956 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12957 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12958 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12960 found_binfo
= base_binfo
;
12964 binfo
= found_binfo
;
12966 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12970 type
= TREE_TYPE (fld
);
12975 /* Returns true if X is a typedef decl. */
12978 is_typedef_decl (const_tree x
)
12980 return (x
&& TREE_CODE (x
) == TYPE_DECL
12981 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12984 /* Returns true iff TYPE is a type variant created for a typedef. */
12987 typedef_variant_p (const_tree type
)
12989 return is_typedef_decl (TYPE_NAME (type
));
12992 /* A class to handle converting a string that might contain
12993 control characters, (eg newline, form-feed, etc), into one
12994 in which contains escape sequences instead. */
12996 class escaped_string
12999 escaped_string () { m_owned
= false; m_str
= NULL
; };
13000 ~escaped_string () { if (m_owned
) free (m_str
); }
13001 operator const char *() const { return (const char *) m_str
; }
13002 void escape (const char *);
13008 /* PR 84195: Replace control characters in "unescaped" with their
13009 escaped equivalents. Allow newlines if -fmessage-length has
13010 been set to a non-zero value. This is done here, rather than
13011 where the attribute is recorded as the message length can
13012 change between these two locations. */
13015 escaped_string::escape (const char *unescaped
)
13018 size_t i
, new_i
, len
;
13023 m_str
= const_cast<char *> (unescaped
);
13026 if (unescaped
== NULL
|| *unescaped
== 0)
13029 len
= strlen (unescaped
);
13033 for (i
= 0; i
< len
; i
++)
13035 char c
= unescaped
[i
];
13040 escaped
[new_i
++] = c
;
13044 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13046 if (escaped
== NULL
)
13048 /* We only allocate space for a new string if we
13049 actually encounter a control character that
13050 needs replacing. */
13051 escaped
= (char *) xmalloc (len
* 2 + 1);
13052 strncpy (escaped
, unescaped
, i
);
13056 escaped
[new_i
++] = '\\';
13060 case '\a': escaped
[new_i
++] = 'a'; break;
13061 case '\b': escaped
[new_i
++] = 'b'; break;
13062 case '\f': escaped
[new_i
++] = 'f'; break;
13063 case '\n': escaped
[new_i
++] = 'n'; break;
13064 case '\r': escaped
[new_i
++] = 'r'; break;
13065 case '\t': escaped
[new_i
++] = 't'; break;
13066 case '\v': escaped
[new_i
++] = 'v'; break;
13067 default: escaped
[new_i
++] = '?'; break;
13071 escaped
[new_i
++] = c
;
13076 escaped
[new_i
] = 0;
13082 /* Warn about a use of an identifier which was marked deprecated. Returns
13083 whether a warning was given. */
13086 warn_deprecated_use (tree node
, tree attr
)
13088 escaped_string msg
;
13090 if (node
== 0 || !warn_deprecated_decl
)
13096 attr
= DECL_ATTRIBUTES (node
);
13097 else if (TYPE_P (node
))
13099 tree decl
= TYPE_STUB_DECL (node
);
13101 attr
= lookup_attribute ("deprecated",
13102 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13107 attr
= lookup_attribute ("deprecated", attr
);
13110 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13115 auto_diagnostic_group d
;
13117 w
= warning (OPT_Wdeprecated_declarations
,
13118 "%qD is deprecated: %s", node
, (const char *) msg
);
13120 w
= warning (OPT_Wdeprecated_declarations
,
13121 "%qD is deprecated", node
);
13123 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13125 else if (TYPE_P (node
))
13127 tree what
= NULL_TREE
;
13128 tree decl
= TYPE_STUB_DECL (node
);
13130 if (TYPE_NAME (node
))
13132 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13133 what
= TYPE_NAME (node
);
13134 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13135 && DECL_NAME (TYPE_NAME (node
)))
13136 what
= DECL_NAME (TYPE_NAME (node
));
13139 auto_diagnostic_group d
;
13143 w
= warning (OPT_Wdeprecated_declarations
,
13144 "%qE is deprecated: %s", what
, (const char *) msg
);
13146 w
= warning (OPT_Wdeprecated_declarations
,
13147 "%qE is deprecated", what
);
13152 w
= warning (OPT_Wdeprecated_declarations
,
13153 "type is deprecated: %s", (const char *) msg
);
13155 w
= warning (OPT_Wdeprecated_declarations
,
13156 "type is deprecated");
13160 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13166 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13167 somewhere in it. */
13170 contains_bitfld_component_ref_p (const_tree ref
)
13172 while (handled_component_p (ref
))
13174 if (TREE_CODE (ref
) == COMPONENT_REF
13175 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13177 ref
= TREE_OPERAND (ref
, 0);
13183 /* Try to determine whether a TRY_CATCH expression can fall through.
13184 This is a subroutine of block_may_fallthru. */
13187 try_catch_may_fallthru (const_tree stmt
)
13189 tree_stmt_iterator i
;
13191 /* If the TRY block can fall through, the whole TRY_CATCH can
13193 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13196 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13197 switch (TREE_CODE (tsi_stmt (i
)))
13200 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13201 catch expression and a body. The whole TRY_CATCH may fall
13202 through iff any of the catch bodies falls through. */
13203 for (; !tsi_end_p (i
); tsi_next (&i
))
13205 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13210 case EH_FILTER_EXPR
:
13211 /* The exception filter expression only matters if there is an
13212 exception. If the exception does not match EH_FILTER_TYPES,
13213 we will execute EH_FILTER_FAILURE, and we will fall through
13214 if that falls through. If the exception does match
13215 EH_FILTER_TYPES, the stack unwinder will continue up the
13216 stack, so we will not fall through. We don't know whether we
13217 will throw an exception which matches EH_FILTER_TYPES or not,
13218 so we just ignore EH_FILTER_TYPES and assume that we might
13219 throw an exception which doesn't match. */
13220 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13223 /* This case represents statements to be executed when an
13224 exception occurs. Those statements are implicitly followed
13225 by a RESX statement to resume execution after the exception.
13226 So in this case the TRY_CATCH never falls through. */
13231 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13232 need not be 100% accurate; simply be conservative and return true if we
13233 don't know. This is used only to avoid stupidly generating extra code.
13234 If we're wrong, we'll just delete the extra code later. */
13237 block_may_fallthru (const_tree block
)
13239 /* This CONST_CAST is okay because expr_last returns its argument
13240 unmodified and we assign it to a const_tree. */
13241 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13243 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13247 /* Easy cases. If the last statement of the block implies
13248 control transfer, then we can't fall through. */
13252 /* If there is a default: label or case labels cover all possible
13253 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13254 to some case label in all cases and all we care is whether the
13255 SWITCH_BODY falls through. */
13256 if (SWITCH_ALL_CASES_P (stmt
))
13257 return block_may_fallthru (SWITCH_BODY (stmt
));
13261 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13263 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13266 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13268 case TRY_CATCH_EXPR
:
13269 return try_catch_may_fallthru (stmt
);
13271 case TRY_FINALLY_EXPR
:
13272 /* The finally clause is always executed after the try clause,
13273 so if it does not fall through, then the try-finally will not
13274 fall through. Otherwise, if the try clause does not fall
13275 through, then when the finally clause falls through it will
13276 resume execution wherever the try clause was going. So the
13277 whole try-finally will only fall through if both the try
13278 clause and the finally clause fall through. */
13279 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13280 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13283 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13284 stmt
= TREE_OPERAND (stmt
, 1);
13290 /* Functions that do not return do not fall through. */
13291 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13293 case CLEANUP_POINT_EXPR
:
13294 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13297 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13303 return lang_hooks
.block_may_fallthru (stmt
);
13307 /* True if we are using EH to handle cleanups. */
13308 static bool using_eh_for_cleanups_flag
= false;
13310 /* This routine is called from front ends to indicate eh should be used for
13313 using_eh_for_cleanups (void)
13315 using_eh_for_cleanups_flag
= true;
13318 /* Query whether EH is used for cleanups. */
13320 using_eh_for_cleanups_p (void)
13322 return using_eh_for_cleanups_flag
;
13325 /* Wrapper for tree_code_name to ensure that tree code is valid */
13327 get_tree_code_name (enum tree_code code
)
13329 const char *invalid
= "<invalid tree code>";
13331 if (code
>= MAX_TREE_CODES
)
13334 return tree_code_name
[code
];
13337 /* Drops the TREE_OVERFLOW flag from T. */
13340 drop_tree_overflow (tree t
)
13342 gcc_checking_assert (TREE_OVERFLOW (t
));
13344 /* For tree codes with a sharing machinery re-build the result. */
13345 if (poly_int_tree_p (t
))
13346 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13348 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13349 and canonicalize the result. */
13350 if (TREE_CODE (t
) == VECTOR_CST
)
13352 tree_vector_builder builder
;
13353 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13354 unsigned int count
= builder
.encoded_nelts ();
13355 for (unsigned int i
= 0; i
< count
; ++i
)
13357 tree elt
= VECTOR_CST_ELT (t
, i
);
13358 if (TREE_OVERFLOW (elt
))
13359 elt
= drop_tree_overflow (elt
);
13360 builder
.quick_push (elt
);
13362 return builder
.build ();
13365 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13366 and drop the flag. */
13368 TREE_OVERFLOW (t
) = 0;
13370 /* For constants that contain nested constants, drop the flag
13371 from those as well. */
13372 if (TREE_CODE (t
) == COMPLEX_CST
)
13374 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13375 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13376 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13377 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13383 /* Given a memory reference expression T, return its base address.
13384 The base address of a memory reference expression is the main
13385 object being referenced. For instance, the base address for
13386 'array[i].fld[j]' is 'array'. You can think of this as stripping
13387 away the offset part from a memory address.
13389 This function calls handled_component_p to strip away all the inner
13390 parts of the memory reference until it reaches the base object. */
13393 get_base_address (tree t
)
13395 while (handled_component_p (t
))
13396 t
= TREE_OPERAND (t
, 0);
13398 if ((TREE_CODE (t
) == MEM_REF
13399 || TREE_CODE (t
) == TARGET_MEM_REF
)
13400 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13401 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13403 /* ??? Either the alias oracle or all callers need to properly deal
13404 with WITH_SIZE_EXPRs before we can look through those. */
13405 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13411 /* Return a tree of sizetype representing the size, in bytes, of the element
13412 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13415 array_ref_element_size (tree exp
)
13417 tree aligned_size
= TREE_OPERAND (exp
, 3);
13418 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13419 location_t loc
= EXPR_LOCATION (exp
);
13421 /* If a size was specified in the ARRAY_REF, it's the size measured
13422 in alignment units of the element type. So multiply by that value. */
13425 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13426 sizetype from another type of the same width and signedness. */
13427 if (TREE_TYPE (aligned_size
) != sizetype
)
13428 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13429 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13430 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13433 /* Otherwise, take the size from that of the element type. Substitute
13434 any PLACEHOLDER_EXPR that we have. */
13436 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13439 /* Return a tree representing the lower bound of the array mentioned in
13440 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13443 array_ref_low_bound (tree exp
)
13445 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13447 /* If a lower bound is specified in EXP, use it. */
13448 if (TREE_OPERAND (exp
, 2))
13449 return TREE_OPERAND (exp
, 2);
13451 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13452 substituting for a PLACEHOLDER_EXPR as needed. */
13453 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13454 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13456 /* Otherwise, return a zero of the appropriate type. */
13457 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13460 /* Return a tree representing the upper bound of the array mentioned in
13461 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13464 array_ref_up_bound (tree exp
)
13466 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13468 /* If there is a domain type and it has an upper bound, use it, substituting
13469 for a PLACEHOLDER_EXPR as needed. */
13470 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13471 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13473 /* Otherwise fail. */
13477 /* Returns true if REF is an array reference or a component reference
13478 to an array at the end of a structure.
13479 If this is the case, the array may be allocated larger
13480 than its upper bound implies. */
13483 array_at_struct_end_p (tree ref
)
13487 if (TREE_CODE (ref
) == ARRAY_REF
13488 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13490 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13491 ref
= TREE_OPERAND (ref
, 0);
13493 else if (TREE_CODE (ref
) == COMPONENT_REF
13494 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13495 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13499 if (TREE_CODE (ref
) == STRING_CST
)
13502 tree ref_to_array
= ref
;
13503 while (handled_component_p (ref
))
13505 /* If the reference chain contains a component reference to a
13506 non-union type and there follows another field the reference
13507 is not at the end of a structure. */
13508 if (TREE_CODE (ref
) == COMPONENT_REF
)
13510 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13512 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13513 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13514 nextf
= DECL_CHAIN (nextf
);
13519 /* If we have a multi-dimensional array we do not consider
13520 a non-innermost dimension as flex array if the whole
13521 multi-dimensional array is at struct end.
13522 Same for an array of aggregates with a trailing array
13524 else if (TREE_CODE (ref
) == ARRAY_REF
)
13526 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13528 /* If we view an underlying object as sth else then what we
13529 gathered up to now is what we have to rely on. */
13530 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13533 gcc_unreachable ();
13535 ref
= TREE_OPERAND (ref
, 0);
13538 /* The array now is at struct end. Treat flexible arrays as
13539 always subject to extend, even into just padding constrained by
13540 an underlying decl. */
13541 if (! TYPE_SIZE (atype
)
13542 || ! TYPE_DOMAIN (atype
)
13543 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13546 if (TREE_CODE (ref
) == MEM_REF
13547 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13548 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13550 /* If the reference is based on a declared entity, the size of the array
13551 is constrained by its given domain. (Do not trust commons PR/69368). */
13553 && !(flag_unconstrained_commons
13554 && VAR_P (ref
) && DECL_COMMON (ref
))
13555 && DECL_SIZE_UNIT (ref
)
13556 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13558 /* Check whether the array domain covers all of the available
13561 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13562 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13563 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13565 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13568 /* If at least one extra element fits it is a flexarray. */
13569 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13570 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13572 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13573 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13582 /* Return a tree representing the offset, in bytes, of the field referenced
13583 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13586 component_ref_field_offset (tree exp
)
13588 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13589 tree field
= TREE_OPERAND (exp
, 1);
13590 location_t loc
= EXPR_LOCATION (exp
);
13592 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13593 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13595 if (aligned_offset
)
13597 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13598 sizetype from another type of the same width and signedness. */
13599 if (TREE_TYPE (aligned_offset
) != sizetype
)
13600 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13601 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13602 size_int (DECL_OFFSET_ALIGN (field
)
13606 /* Otherwise, take the offset from that of the field. Substitute
13607 any PLACEHOLDER_EXPR that we have. */
13609 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13612 /* Return the machine mode of T. For vectors, returns the mode of the
13613 inner type. The main use case is to feed the result to HONOR_NANS,
13614 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13617 element_mode (const_tree t
)
13621 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13623 return TYPE_MODE (t
);
13626 /* Vector types need to re-check the target flags each time we report
13627 the machine mode. We need to do this because attribute target can
13628 change the result of vector_mode_supported_p and have_regs_of_mode
13629 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13630 change on a per-function basis. */
13631 /* ??? Possibly a better solution is to run through all the types
13632 referenced by a function and re-compute the TYPE_MODE once, rather
13633 than make the TYPE_MODE macro call a function. */
13636 vector_type_mode (const_tree t
)
13640 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13642 mode
= t
->type_common
.mode
;
13643 if (VECTOR_MODE_P (mode
)
13644 && (!targetm
.vector_mode_supported_p (mode
)
13645 || !have_regs_of_mode
[mode
]))
13647 scalar_int_mode innermode
;
13649 /* For integers, try mapping it to a same-sized scalar mode. */
13650 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13652 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13653 * GET_MODE_BITSIZE (innermode
));
13654 scalar_int_mode mode
;
13655 if (int_mode_for_size (size
, 0).exists (&mode
)
13656 && have_regs_of_mode
[mode
])
13666 /* Verify that basic properties of T match TV and thus T can be a variant of
13667 TV. TV should be the more specified variant (i.e. the main variant). */
13670 verify_type_variant (const_tree t
, tree tv
)
13672 /* Type variant can differ by:
13674 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13675 ENCODE_QUAL_ADDR_SPACE.
13676 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13677 in this case some values may not be set in the variant types
13678 (see TYPE_COMPLETE_P checks).
13679 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13680 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13681 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13682 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13683 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13684 this is necessary to make it possible to merge types form different TUs
13685 - arrays, pointers and references may have TREE_TYPE that is a variant
13686 of TREE_TYPE of their main variants.
13687 - aggregates may have new TYPE_FIELDS list that list variants of
13688 the main variant TYPE_FIELDS.
13689 - vector types may differ by TYPE_VECTOR_OPAQUE
13692 /* Convenience macro for matching individual fields. */
13693 #define verify_variant_match(flag) \
13695 if (flag (tv) != flag (t)) \
13697 error ("type variant differs by %s", #flag); \
13703 /* tree_base checks. */
13705 verify_variant_match (TREE_CODE
);
13706 /* FIXME: Ada builds non-artificial variants of artificial types. */
13707 if (TYPE_ARTIFICIAL (tv
) && 0)
13708 verify_variant_match (TYPE_ARTIFICIAL
);
13709 if (POINTER_TYPE_P (tv
))
13710 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13711 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13712 verify_variant_match (TYPE_UNSIGNED
);
13713 verify_variant_match (TYPE_PACKED
);
13714 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13715 verify_variant_match (TYPE_REF_IS_RVALUE
);
13716 if (AGGREGATE_TYPE_P (t
))
13717 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13719 verify_variant_match (TYPE_SATURATING
);
13720 /* FIXME: This check trigger during libstdc++ build. */
13721 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13722 verify_variant_match (TYPE_FINAL_P
);
13724 /* tree_type_common checks. */
13726 if (COMPLETE_TYPE_P (t
))
13728 verify_variant_match (TYPE_MODE
);
13729 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13730 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13731 verify_variant_match (TYPE_SIZE
);
13732 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13733 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13734 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13736 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13737 TYPE_SIZE_UNIT (tv
), 0));
13738 error ("type variant has different TYPE_SIZE_UNIT");
13740 error ("type variant's TYPE_SIZE_UNIT");
13741 debug_tree (TYPE_SIZE_UNIT (tv
));
13742 error ("type's TYPE_SIZE_UNIT");
13743 debug_tree (TYPE_SIZE_UNIT (t
));
13747 verify_variant_match (TYPE_PRECISION
);
13748 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13749 if (RECORD_OR_UNION_TYPE_P (t
))
13750 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13751 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13752 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13753 /* During LTO we merge variant lists from diferent translation units
13754 that may differ BY TYPE_CONTEXT that in turn may point
13755 to TRANSLATION_UNIT_DECL.
13756 Ada also builds variants of types with different TYPE_CONTEXT. */
13757 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13758 verify_variant_match (TYPE_CONTEXT
);
13759 verify_variant_match (TYPE_STRING_FLAG
);
13760 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13762 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13767 /* tree_type_non_common checks. */
13769 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13770 and dangle the pointer from time to time. */
13771 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13772 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13773 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13775 error ("type variant has different TYPE_VFIELD");
13779 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13780 || TREE_CODE (t
) == INTEGER_TYPE
13781 || TREE_CODE (t
) == BOOLEAN_TYPE
13782 || TREE_CODE (t
) == REAL_TYPE
13783 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13785 verify_variant_match (TYPE_MAX_VALUE
);
13786 verify_variant_match (TYPE_MIN_VALUE
);
13788 if (TREE_CODE (t
) == METHOD_TYPE
)
13789 verify_variant_match (TYPE_METHOD_BASETYPE
);
13790 if (TREE_CODE (t
) == OFFSET_TYPE
)
13791 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13792 if (TREE_CODE (t
) == ARRAY_TYPE
)
13793 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13794 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13795 or even type's main variant. This is needed to make bootstrap pass
13796 and the bug seems new in GCC 5.
13797 C++ FE should be updated to make this consistent and we should check
13798 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13799 is a match with main variant.
13801 Also disable the check for Java for now because of parser hack that builds
13802 first an dummy BINFO and then sometimes replace it by real BINFO in some
13804 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13805 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13806 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13807 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13808 at LTO time only. */
13809 && (in_lto_p
&& odr_type_p (t
)))
13811 error ("type variant has different TYPE_BINFO");
13813 error ("type variant's TYPE_BINFO");
13814 debug_tree (TYPE_BINFO (tv
));
13815 error ("type's TYPE_BINFO");
13816 debug_tree (TYPE_BINFO (t
));
13820 /* Check various uses of TYPE_VALUES_RAW. */
13821 if (TREE_CODE (t
) == ENUMERAL_TYPE
13822 && TYPE_VALUES (t
))
13823 verify_variant_match (TYPE_VALUES
);
13824 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13825 verify_variant_match (TYPE_DOMAIN
);
13826 /* Permit incomplete variants of complete type. While FEs may complete
13827 all variants, this does not happen for C++ templates in all cases. */
13828 else if (RECORD_OR_UNION_TYPE_P (t
)
13829 && COMPLETE_TYPE_P (t
)
13830 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13834 /* Fortran builds qualified variants as new records with items of
13835 qualified type. Verify that they looks same. */
13836 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13838 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13839 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13840 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13841 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13842 /* FIXME: gfc_nonrestricted_type builds all types as variants
13843 with exception of pointer types. It deeply copies the type
13844 which means that we may end up with a variant type
13845 referring non-variant pointer. We may change it to
13846 produce types as variants, too, like
13847 objc_get_protocol_qualified_type does. */
13848 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13849 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13850 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13854 error ("type variant has different TYPE_FIELDS");
13856 error ("first mismatch is field");
13858 error ("and field");
13863 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13864 verify_variant_match (TYPE_ARG_TYPES
);
13865 /* For C++ the qualified variant of array type is really an array type
13866 of qualified TREE_TYPE.
13867 objc builds variants of pointer where pointer to type is a variant, too
13868 in objc_get_protocol_qualified_type. */
13869 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13870 && ((TREE_CODE (t
) != ARRAY_TYPE
13871 && !POINTER_TYPE_P (t
))
13872 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13873 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13875 error ("type variant has different TREE_TYPE");
13877 error ("type variant's TREE_TYPE");
13878 debug_tree (TREE_TYPE (tv
));
13879 error ("type's TREE_TYPE");
13880 debug_tree (TREE_TYPE (t
));
13883 if (type_with_alias_set_p (t
)
13884 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13886 error ("type is not compatible with its variant");
13888 error ("type variant's TREE_TYPE");
13889 debug_tree (TREE_TYPE (tv
));
13890 error ("type's TREE_TYPE");
13891 debug_tree (TREE_TYPE (t
));
13895 #undef verify_variant_match
13899 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13900 the middle-end types_compatible_p function. It needs to avoid
13901 claiming types are different for types that should be treated
13902 the same with respect to TBAA. Canonical types are also used
13903 for IL consistency checks via the useless_type_conversion_p
13904 predicate which does not handle all type kinds itself but falls
13905 back to pointer-comparison of TYPE_CANONICAL for aggregates
13908 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13909 type calculation because we need to allow inter-operability between signed
13910 and unsigned variants. */
13913 type_with_interoperable_signedness (const_tree type
)
13915 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13916 signed char and unsigned char. Similarly fortran FE builds
13917 C_SIZE_T as signed type, while C defines it unsigned. */
13919 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13921 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13922 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13925 /* Return true iff T1 and T2 are structurally identical for what
13927 This function is used both by lto.c canonical type merging and by the
13928 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13929 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13930 only for LTO because only in these cases TYPE_CANONICAL equivalence
13931 correspond to one defined by gimple_canonical_types_compatible_p. */
13934 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13935 bool trust_type_canonical
)
13937 /* Type variants should be same as the main variant. When not doing sanity
13938 checking to verify this fact, go to main variants and save some work. */
13939 if (trust_type_canonical
)
13941 t1
= TYPE_MAIN_VARIANT (t1
);
13942 t2
= TYPE_MAIN_VARIANT (t2
);
13945 /* Check first for the obvious case of pointer identity. */
13949 /* Check that we have two types to compare. */
13950 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13953 /* We consider complete types always compatible with incomplete type.
13954 This does not make sense for canonical type calculation and thus we
13955 need to ensure that we are never called on it.
13957 FIXME: For more correctness the function probably should have three modes
13958 1) mode assuming that types are complete mathcing their structure
13959 2) mode allowing incomplete types but producing equivalence classes
13960 and thus ignoring all info from complete types
13961 3) mode allowing incomplete types to match complete but checking
13962 compatibility between complete types.
13964 1 and 2 can be used for canonical type calculation. 3 is the real
13965 definition of type compatibility that can be used i.e. for warnings during
13966 declaration merging. */
13968 gcc_assert (!trust_type_canonical
13969 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13970 /* If the types have been previously registered and found equal
13973 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13974 && trust_type_canonical
)
13976 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13977 they are always NULL, but they are set to non-NULL for types
13978 constructed by build_pointer_type and variants. In this case the
13979 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13980 all pointers are considered equal. Be sure to not return false
13982 gcc_checking_assert (canonical_type_used_p (t1
)
13983 && canonical_type_used_p (t2
));
13984 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13987 /* Can't be the same type if the types don't have the same code. */
13988 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13989 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13992 /* Qualifiers do not matter for canonical type comparison purposes. */
13994 /* Void types and nullptr types are always the same. */
13995 if (TREE_CODE (t1
) == VOID_TYPE
13996 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13999 /* Can't be the same type if they have different mode. */
14000 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14003 /* Non-aggregate types can be handled cheaply. */
14004 if (INTEGRAL_TYPE_P (t1
)
14005 || SCALAR_FLOAT_TYPE_P (t1
)
14006 || FIXED_POINT_TYPE_P (t1
)
14007 || TREE_CODE (t1
) == VECTOR_TYPE
14008 || TREE_CODE (t1
) == COMPLEX_TYPE
14009 || TREE_CODE (t1
) == OFFSET_TYPE
14010 || POINTER_TYPE_P (t1
))
14012 /* Can't be the same type if they have different recision. */
14013 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14016 /* In some cases the signed and unsigned types are required to be
14018 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14019 && !type_with_interoperable_signedness (t1
))
14022 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14023 interoperable with "signed char". Unless all frontends are revisited
14024 to agree on these types, we must ignore the flag completely. */
14026 /* Fortran standard define C_PTR type that is compatible with every
14027 C pointer. For this reason we need to glob all pointers into one.
14028 Still pointers in different address spaces are not compatible. */
14029 if (POINTER_TYPE_P (t1
))
14031 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14032 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14036 /* Tail-recurse to components. */
14037 if (TREE_CODE (t1
) == VECTOR_TYPE
14038 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14039 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14041 trust_type_canonical
);
14046 /* Do type-specific comparisons. */
14047 switch (TREE_CODE (t1
))
14050 /* Array types are the same if the element types are the same and
14051 the number of elements are the same. */
14052 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14053 trust_type_canonical
)
14054 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14055 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14056 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14060 tree i1
= TYPE_DOMAIN (t1
);
14061 tree i2
= TYPE_DOMAIN (t2
);
14063 /* For an incomplete external array, the type domain can be
14064 NULL_TREE. Check this condition also. */
14065 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14067 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14071 tree min1
= TYPE_MIN_VALUE (i1
);
14072 tree min2
= TYPE_MIN_VALUE (i2
);
14073 tree max1
= TYPE_MAX_VALUE (i1
);
14074 tree max2
= TYPE_MAX_VALUE (i2
);
14076 /* The minimum/maximum values have to be the same. */
14079 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14080 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14081 || operand_equal_p (min1
, min2
, 0))))
14084 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14085 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14086 || operand_equal_p (max1
, max2
, 0)))))
14094 case FUNCTION_TYPE
:
14095 /* Function types are the same if the return type and arguments types
14097 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14098 trust_type_canonical
))
14101 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14105 tree parms1
, parms2
;
14107 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14109 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14111 if (!gimple_canonical_types_compatible_p
14112 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14113 trust_type_canonical
))
14117 if (parms1
|| parms2
)
14125 case QUAL_UNION_TYPE
:
14129 /* Don't try to compare variants of an incomplete type, before
14130 TYPE_FIELDS has been copied around. */
14131 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14135 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14138 /* For aggregate types, all the fields must be the same. */
14139 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14141 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14143 /* Skip non-fields and zero-sized fields. */
14144 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14146 && integer_zerop (DECL_SIZE (f1
)))))
14147 f1
= TREE_CHAIN (f1
);
14148 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14150 && integer_zerop (DECL_SIZE (f2
)))))
14151 f2
= TREE_CHAIN (f2
);
14154 /* The fields must have the same name, offset and type. */
14155 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14156 || !gimple_compare_field_offset (f1
, f2
)
14157 || !gimple_canonical_types_compatible_p
14158 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14159 trust_type_canonical
))
14163 /* If one aggregate has more fields than the other, they
14164 are not the same. */
14172 /* Consider all types with language specific trees in them mutually
14173 compatible. This is executed only from verify_type and false
14174 positives can be tolerated. */
14175 gcc_assert (!in_lto_p
);
14180 /* Verify type T. */
14183 verify_type (const_tree t
)
14185 bool error_found
= false;
14186 tree mv
= TYPE_MAIN_VARIANT (t
);
14189 error ("Main variant is not defined");
14190 error_found
= true;
14192 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14194 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
14196 error_found
= true;
14198 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14199 error_found
= true;
14201 tree ct
= TYPE_CANONICAL (t
);
14204 else if (TYPE_CANONICAL (t
) != ct
)
14206 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
14208 error_found
= true;
14210 /* Method and function types can not be used to address memory and thus
14211 TYPE_CANONICAL really matters only for determining useless conversions.
14213 FIXME: C++ FE produce declarations of builtin functions that are not
14214 compatible with main variants. */
14215 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14218 /* FIXME: gimple_canonical_types_compatible_p can not compare types
14219 with variably sized arrays because their sizes possibly
14220 gimplified to different variables. */
14221 && !variably_modified_type_p (ct
, NULL
)
14222 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14223 && COMPLETE_TYPE_P (t
))
14225 error ("TYPE_CANONICAL is not compatible");
14227 error_found
= true;
14230 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14231 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14233 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
14235 error_found
= true;
14237 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14239 error ("TYPE_CANONICAL of main variant is not main variant");
14241 debug_tree (TYPE_MAIN_VARIANT (ct
));
14242 error_found
= true;
14246 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14247 if (RECORD_OR_UNION_TYPE_P (t
))
14249 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14250 and danagle the pointer from time to time. */
14251 if (TYPE_VFIELD (t
)
14252 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14253 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14255 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
14256 debug_tree (TYPE_VFIELD (t
));
14257 error_found
= true;
14260 else if (TREE_CODE (t
) == POINTER_TYPE
)
14262 if (TYPE_NEXT_PTR_TO (t
)
14263 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14265 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
14266 debug_tree (TYPE_NEXT_PTR_TO (t
));
14267 error_found
= true;
14270 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14272 if (TYPE_NEXT_REF_TO (t
)
14273 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14275 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
14276 debug_tree (TYPE_NEXT_REF_TO (t
));
14277 error_found
= true;
14280 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14281 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14283 /* FIXME: The following check should pass:
14284 useless_type_conversion_p (const_cast <tree> (t),
14285 TREE_TYPE (TYPE_MIN_VALUE (t))
14286 but does not for C sizetypes in LTO. */
14289 /* Check various uses of TYPE_MAXVAL_RAW. */
14290 if (RECORD_OR_UNION_TYPE_P (t
))
14292 if (!TYPE_BINFO (t
))
14294 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14296 error ("TYPE_BINFO is not TREE_BINFO");
14297 debug_tree (TYPE_BINFO (t
));
14298 error_found
= true;
14300 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14302 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
14303 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14304 error_found
= true;
14307 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14309 if (TYPE_METHOD_BASETYPE (t
)
14310 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14311 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14313 error ("TYPE_METHOD_BASETYPE is not record nor union");
14314 debug_tree (TYPE_METHOD_BASETYPE (t
));
14315 error_found
= true;
14318 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14320 if (TYPE_OFFSET_BASETYPE (t
)
14321 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14322 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14324 error ("TYPE_OFFSET_BASETYPE is not record nor union");
14325 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14326 error_found
= true;
14329 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14330 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14332 /* FIXME: The following check should pass:
14333 useless_type_conversion_p (const_cast <tree> (t),
14334 TREE_TYPE (TYPE_MAX_VALUE (t))
14335 but does not for C sizetypes in LTO. */
14337 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14339 if (TYPE_ARRAY_MAX_SIZE (t
)
14340 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14342 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
14343 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14344 error_found
= true;
14347 else if (TYPE_MAX_VALUE_RAW (t
))
14349 error ("TYPE_MAX_VALUE_RAW non-NULL");
14350 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14351 error_found
= true;
14354 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14356 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
14357 debug_tree (TYPE_LANG_SLOT_1 (t
));
14358 error_found
= true;
14361 /* Check various uses of TYPE_VALUES_RAW. */
14362 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14363 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14365 tree value
= TREE_VALUE (l
);
14366 tree name
= TREE_PURPOSE (l
);
14368 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14369 CONST_DECL of ENUMERAL TYPE. */
14370 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14372 error ("Enum value is not CONST_DECL or INTEGER_CST");
14373 debug_tree (value
);
14375 error_found
= true;
14377 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14378 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14380 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
14381 debug_tree (value
);
14383 error_found
= true;
14385 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14387 error ("Enum value name is not IDENTIFIER_NODE");
14388 debug_tree (value
);
14390 error_found
= true;
14393 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14395 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14397 error ("Array TYPE_DOMAIN is not integer type");
14398 debug_tree (TYPE_DOMAIN (t
));
14399 error_found
= true;
14402 else if (RECORD_OR_UNION_TYPE_P (t
))
14404 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14406 error ("TYPE_FIELDS defined in incomplete type");
14407 error_found
= true;
14409 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14411 /* TODO: verify properties of decls. */
14412 if (TREE_CODE (fld
) == FIELD_DECL
)
14414 else if (TREE_CODE (fld
) == TYPE_DECL
)
14416 else if (TREE_CODE (fld
) == CONST_DECL
)
14418 else if (VAR_P (fld
))
14420 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14422 else if (TREE_CODE (fld
) == USING_DECL
)
14424 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14428 error ("Wrong tree in TYPE_FIELDS list");
14430 error_found
= true;
14434 else if (TREE_CODE (t
) == INTEGER_TYPE
14435 || TREE_CODE (t
) == BOOLEAN_TYPE
14436 || TREE_CODE (t
) == OFFSET_TYPE
14437 || TREE_CODE (t
) == REFERENCE_TYPE
14438 || TREE_CODE (t
) == NULLPTR_TYPE
14439 || TREE_CODE (t
) == POINTER_TYPE
)
14441 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14443 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14444 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14445 error_found
= true;
14447 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14449 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14450 debug_tree (TYPE_CACHED_VALUES (t
));
14451 error_found
= true;
14453 /* Verify just enough of cache to ensure that no one copied it to new type.
14454 All copying should go by copy_node that should clear it. */
14455 else if (TYPE_CACHED_VALUES_P (t
))
14458 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14459 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14460 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14462 error ("wrong TYPE_CACHED_VALUES entry");
14463 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14464 error_found
= true;
14469 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14470 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14472 /* C++ FE uses TREE_PURPOSE to store initial values. */
14473 if (TREE_PURPOSE (l
) && in_lto_p
)
14475 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14477 error_found
= true;
14479 if (!TYPE_P (TREE_VALUE (l
)))
14481 error ("Wrong entry in TYPE_ARG_TYPES list");
14483 error_found
= true;
14486 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14488 error ("TYPE_VALUES_RAW field is non-NULL");
14489 debug_tree (TYPE_VALUES_RAW (t
));
14490 error_found
= true;
14492 if (TREE_CODE (t
) != INTEGER_TYPE
14493 && TREE_CODE (t
) != BOOLEAN_TYPE
14494 && TREE_CODE (t
) != OFFSET_TYPE
14495 && TREE_CODE (t
) != REFERENCE_TYPE
14496 && TREE_CODE (t
) != NULLPTR_TYPE
14497 && TREE_CODE (t
) != POINTER_TYPE
14498 && TYPE_CACHED_VALUES_P (t
))
14500 error ("TYPE_CACHED_VALUES_P is set while it should not");
14501 error_found
= true;
14503 if (TYPE_STRING_FLAG (t
)
14504 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14506 error ("TYPE_STRING_FLAG is set on wrong type code");
14507 error_found
= true;
14510 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14511 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14513 if (TREE_CODE (t
) == METHOD_TYPE
14514 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14516 error ("TYPE_METHOD_BASETYPE is not main variant");
14517 error_found
= true;
14522 debug_tree (const_cast <tree
> (t
));
14523 internal_error ("verify_type failed");
14528 /* Return 1 if ARG interpreted as signed in its precision is known to be
14529 always positive or 2 if ARG is known to be always negative, or 3 if
14530 ARG may be positive or negative. */
14533 get_range_pos_neg (tree arg
)
14535 if (arg
== error_mark_node
)
14538 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14540 if (TREE_CODE (arg
) == INTEGER_CST
)
14542 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14548 while (CONVERT_EXPR_P (arg
)
14549 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14550 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14552 arg
= TREE_OPERAND (arg
, 0);
14553 /* Narrower value zero extended into wider type
14554 will always result in positive values. */
14555 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14556 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14558 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14563 if (TREE_CODE (arg
) != SSA_NAME
)
14565 wide_int arg_min
, arg_max
;
14566 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14568 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14569 if (is_gimple_assign (g
)
14570 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14572 tree t
= gimple_assign_rhs1 (g
);
14573 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14574 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14576 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14577 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14579 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14588 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14590 /* For unsigned values, the "positive" range comes
14591 below the "negative" range. */
14592 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14594 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14599 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14601 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14610 /* Return true if ARG is marked with the nonnull attribute in the
14611 current function signature. */
14614 nonnull_arg_p (const_tree arg
)
14616 tree t
, attrs
, fntype
;
14617 unsigned HOST_WIDE_INT arg_num
;
14619 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14620 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14621 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14623 /* The static chain decl is always non null. */
14624 if (arg
== cfun
->static_chain_decl
)
14627 /* THIS argument of method is always non-NULL. */
14628 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14629 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14630 && flag_delete_null_pointer_checks
)
14633 /* Values passed by reference are always non-NULL. */
14634 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14635 && flag_delete_null_pointer_checks
)
14638 fntype
= TREE_TYPE (cfun
->decl
);
14639 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14641 attrs
= lookup_attribute ("nonnull", attrs
);
14643 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14644 if (attrs
== NULL_TREE
)
14647 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14648 if (TREE_VALUE (attrs
) == NULL_TREE
)
14651 /* Get the position number for ARG in the function signature. */
14652 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14654 t
= DECL_CHAIN (t
), arg_num
++)
14660 gcc_assert (t
== arg
);
14662 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14663 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14665 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14673 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14677 set_block (location_t loc
, tree block
)
14679 location_t pure_loc
= get_pure_location (loc
);
14680 source_range src_range
= get_range_from_loc (line_table
, loc
);
14681 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14685 set_source_range (tree expr
, location_t start
, location_t finish
)
14687 source_range src_range
;
14688 src_range
.m_start
= start
;
14689 src_range
.m_finish
= finish
;
14690 return set_source_range (expr
, src_range
);
14694 set_source_range (tree expr
, source_range src_range
)
14696 if (!EXPR_P (expr
))
14697 return UNKNOWN_LOCATION
;
14699 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14700 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14704 SET_EXPR_LOCATION (expr
, adhoc
);
14708 /* Return EXPR, potentially wrapped with a node expression LOC,
14709 if !CAN_HAVE_LOCATION_P (expr).
14711 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14712 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14714 Wrapper nodes can be identified using location_wrapper_p. */
14717 maybe_wrap_with_location (tree expr
, location_t loc
)
14721 if (loc
== UNKNOWN_LOCATION
)
14723 if (CAN_HAVE_LOCATION_P (expr
))
14725 /* We should only be adding wrappers for constants and for decls,
14726 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14727 gcc_assert (CONSTANT_CLASS_P (expr
)
14729 || EXCEPTIONAL_CLASS_P (expr
));
14731 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14732 any impact of the wrapper nodes. */
14733 if (EXCEPTIONAL_CLASS_P (expr
))
14736 /* If any auto_suppress_location_wrappers are active, don't create
14738 if (suppress_location_wrappers
> 0)
14742 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14743 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14744 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14745 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14746 /* Mark this node as being a wrapper. */
14747 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14751 int suppress_location_wrappers
;
14753 /* Return the name of combined function FN, for debugging purposes. */
14756 combined_fn_name (combined_fn fn
)
14758 if (builtin_fn_p (fn
))
14760 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14761 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14764 return internal_fn_name (as_internal_fn (fn
));
14767 /* Return a bitmap with a bit set corresponding to each argument in
14768 a function call type FNTYPE declared with attribute nonnull,
14769 or null if none of the function's argument are nonnull. The caller
14770 must free the bitmap. */
14773 get_nonnull_args (const_tree fntype
)
14775 if (fntype
== NULL_TREE
)
14778 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14782 bitmap argmap
= NULL
;
14784 /* A function declaration can specify multiple attribute nonnull,
14785 each with zero or more arguments. The loop below creates a bitmap
14786 representing a union of all the arguments. An empty (but non-null)
14787 bitmap means that all arguments have been declaraed nonnull. */
14788 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14790 attrs
= lookup_attribute ("nonnull", attrs
);
14795 argmap
= BITMAP_ALLOC (NULL
);
14797 if (!TREE_VALUE (attrs
))
14799 /* Clear the bitmap in case a previous attribute nonnull
14800 set it and this one overrides it for all arguments. */
14801 bitmap_clear (argmap
);
14805 /* Iterate over the indices of the format arguments declared nonnull
14806 and set a bit for each. */
14807 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14809 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14810 bitmap_set_bit (argmap
, val
);
14817 /* Returns true if TYPE is a type where it and all of its subobjects
14818 (recursively) are of structure, union, or array type. */
14821 default_is_empty_type (tree type
)
14823 if (RECORD_OR_UNION_TYPE_P (type
))
14825 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14826 if (TREE_CODE (field
) == FIELD_DECL
14827 && !DECL_PADDING_P (field
)
14828 && !default_is_empty_type (TREE_TYPE (field
)))
14832 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14833 return (integer_minus_onep (array_type_nelts (type
))
14834 || TYPE_DOMAIN (type
) == NULL_TREE
14835 || default_is_empty_type (TREE_TYPE (type
)));
14839 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14840 that shouldn't be passed via stack. */
14843 default_is_empty_record (const_tree type
)
14845 if (!abi_version_at_least (12))
14848 if (type
== error_mark_node
)
14851 if (TREE_ADDRESSABLE (type
))
14854 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14857 /* Like int_size_in_bytes, but handle empty records specially. */
14860 arg_int_size_in_bytes (const_tree type
)
14862 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14865 /* Like size_in_bytes, but handle empty records specially. */
14868 arg_size_in_bytes (const_tree type
)
14870 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14873 /* Return true if an expression with CODE has to have the same result type as
14874 its first operand. */
14877 expr_type_first_operand_type_p (tree_code code
)
14890 case TRUNC_DIV_EXPR
:
14891 case CEIL_DIV_EXPR
:
14892 case FLOOR_DIV_EXPR
:
14893 case ROUND_DIV_EXPR
:
14894 case TRUNC_MOD_EXPR
:
14895 case CEIL_MOD_EXPR
:
14896 case FLOOR_MOD_EXPR
:
14897 case ROUND_MOD_EXPR
:
14899 case EXACT_DIV_EXPR
:
14917 /* Return a typenode for the "standard" C type with a given name. */
14919 get_typenode_from_name (const char *name
)
14921 if (name
== NULL
|| *name
== '\0')
14924 if (strcmp (name
, "char") == 0)
14925 return char_type_node
;
14926 if (strcmp (name
, "unsigned char") == 0)
14927 return unsigned_char_type_node
;
14928 if (strcmp (name
, "signed char") == 0)
14929 return signed_char_type_node
;
14931 if (strcmp (name
, "short int") == 0)
14932 return short_integer_type_node
;
14933 if (strcmp (name
, "short unsigned int") == 0)
14934 return short_unsigned_type_node
;
14936 if (strcmp (name
, "int") == 0)
14937 return integer_type_node
;
14938 if (strcmp (name
, "unsigned int") == 0)
14939 return unsigned_type_node
;
14941 if (strcmp (name
, "long int") == 0)
14942 return long_integer_type_node
;
14943 if (strcmp (name
, "long unsigned int") == 0)
14944 return long_unsigned_type_node
;
14946 if (strcmp (name
, "long long int") == 0)
14947 return long_long_integer_type_node
;
14948 if (strcmp (name
, "long long unsigned int") == 0)
14949 return long_long_unsigned_type_node
;
14951 gcc_unreachable ();
14954 /* List of pointer types used to declare builtins before we have seen their
14957 Keep the size up to date in tree.h ! */
14958 const builtin_structptr_type builtin_structptr_types
[6] =
14960 { fileptr_type_node
, ptr_type_node
, "FILE" },
14961 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14962 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14963 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14964 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14965 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14970 namespace selftest
{
14972 /* Selftests for tree. */
14974 /* Verify that integer constants are sane. */
14977 test_integer_constants ()
14979 ASSERT_TRUE (integer_type_node
!= NULL
);
14980 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14982 tree type
= integer_type_node
;
14984 tree zero
= build_zero_cst (type
);
14985 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14986 ASSERT_EQ (type
, TREE_TYPE (zero
));
14988 tree one
= build_int_cst (type
, 1);
14989 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14990 ASSERT_EQ (type
, TREE_TYPE (zero
));
14993 /* Verify identifiers. */
14996 test_identifiers ()
14998 tree identifier
= get_identifier ("foo");
14999 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15000 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15003 /* Verify LABEL_DECL. */
15008 tree identifier
= get_identifier ("err");
15009 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15010 identifier
, void_type_node
);
15011 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15012 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15015 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15016 are given by VALS. */
15019 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15021 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15022 tree_vector_builder
builder (type
, vals
.length (), 1);
15023 builder
.splice (vals
);
15024 return builder
.build ();
15027 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15030 check_vector_cst (vec
<tree
> expected
, tree actual
)
15032 ASSERT_KNOWN_EQ (expected
.length (),
15033 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15034 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15035 ASSERT_EQ (wi::to_wide (expected
[i
]),
15036 wi::to_wide (vector_cst_elt (actual
, i
)));
15039 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15040 and that its elements match EXPECTED. */
15043 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15044 unsigned int npatterns
)
15046 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15047 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15048 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15049 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15050 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15051 check_vector_cst (expected
, actual
);
15054 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15055 and NPATTERNS background elements, and that its elements match
15059 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15060 unsigned int npatterns
)
15062 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15063 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15064 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15065 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15066 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15067 check_vector_cst (expected
, actual
);
15070 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15071 and that its elements match EXPECTED. */
15074 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15075 unsigned int npatterns
)
15077 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15078 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15079 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15080 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15081 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15082 check_vector_cst (expected
, actual
);
15085 /* Test the creation of VECTOR_CSTs. */
15088 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15090 auto_vec
<tree
, 8> elements (8);
15091 elements
.quick_grow (8);
15092 tree element_type
= build_nonstandard_integer_type (16, true);
15093 tree vector_type
= build_vector_type (element_type
, 8);
15095 /* Test a simple linear series with a base of 0 and a step of 1:
15096 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15097 for (unsigned int i
= 0; i
< 8; ++i
)
15098 elements
[i
] = build_int_cst (element_type
, i
);
15099 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15100 check_vector_cst_stepped (elements
, vector
, 1);
15102 /* Try the same with the first element replaced by 100:
15103 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15104 elements
[0] = build_int_cst (element_type
, 100);
15105 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15106 check_vector_cst_stepped (elements
, vector
, 1);
15108 /* Try a series that wraps around.
15109 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15110 for (unsigned int i
= 1; i
< 8; ++i
)
15111 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15112 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15113 check_vector_cst_stepped (elements
, vector
, 1);
15115 /* Try a downward series:
15116 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15117 for (unsigned int i
= 1; i
< 8; ++i
)
15118 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15119 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15120 check_vector_cst_stepped (elements
, vector
, 1);
15122 /* Try two interleaved series with different bases and steps:
15123 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15124 elements
[1] = build_int_cst (element_type
, 53);
15125 for (unsigned int i
= 2; i
< 8; i
+= 2)
15127 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15128 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15130 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15131 check_vector_cst_stepped (elements
, vector
, 2);
15133 /* Try a duplicated value:
15134 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15135 for (unsigned int i
= 1; i
< 8; ++i
)
15136 elements
[i
] = elements
[0];
15137 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15138 check_vector_cst_duplicate (elements
, vector
, 1);
15140 /* Try an interleaved duplicated value:
15141 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15142 elements
[1] = build_int_cst (element_type
, 55);
15143 for (unsigned int i
= 2; i
< 8; ++i
)
15144 elements
[i
] = elements
[i
- 2];
15145 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15146 check_vector_cst_duplicate (elements
, vector
, 2);
15148 /* Try a duplicated value with 2 exceptions
15149 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15150 elements
[0] = build_int_cst (element_type
, 41);
15151 elements
[1] = build_int_cst (element_type
, 97);
15152 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15153 check_vector_cst_fill (elements
, vector
, 2);
15155 /* Try with and without a step
15156 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15157 for (unsigned int i
= 3; i
< 8; i
+= 2)
15158 elements
[i
] = build_int_cst (element_type
, i
* 7);
15159 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15160 check_vector_cst_stepped (elements
, vector
, 2);
15162 /* Try a fully-general constant:
15163 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15164 elements
[5] = build_int_cst (element_type
, 9990);
15165 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15166 check_vector_cst_fill (elements
, vector
, 4);
15169 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15170 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15171 modifying its argument in-place. */
15174 check_strip_nops (tree node
, tree expected
)
15177 ASSERT_EQ (expected
, node
);
15180 /* Verify location wrappers. */
15183 test_location_wrappers ()
15185 location_t loc
= BUILTINS_LOCATION
;
15187 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15189 /* Wrapping a constant. */
15190 tree int_cst
= build_int_cst (integer_type_node
, 42);
15191 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15192 ASSERT_FALSE (location_wrapper_p (int_cst
));
15194 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15195 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15196 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15197 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15199 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15200 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15202 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15203 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15204 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15205 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15207 /* Wrapping a STRING_CST. */
15208 tree string_cst
= build_string (4, "foo");
15209 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15210 ASSERT_FALSE (location_wrapper_p (string_cst
));
15212 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15213 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15214 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15215 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15216 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15219 /* Wrapping a variable. */
15220 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15221 get_identifier ("some_int_var"),
15222 integer_type_node
);
15223 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15224 ASSERT_FALSE (location_wrapper_p (int_var
));
15226 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15227 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15228 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15229 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15231 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15233 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15234 ASSERT_FALSE (location_wrapper_p (r_cast
));
15235 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15237 /* Verify that STRIP_NOPS removes wrappers. */
15238 check_strip_nops (wrapped_int_cst
, int_cst
);
15239 check_strip_nops (wrapped_string_cst
, string_cst
);
15240 check_strip_nops (wrapped_int_var
, int_var
);
15243 /* Test various tree predicates. Verify that location wrappers don't
15244 affect the results. */
15249 /* Build various constants and wrappers around them. */
15251 location_t loc
= BUILTINS_LOCATION
;
15253 tree i_0
= build_int_cst (integer_type_node
, 0);
15254 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15256 tree i_1
= build_int_cst (integer_type_node
, 1);
15257 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15259 tree i_m1
= build_int_cst (integer_type_node
, -1);
15260 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15262 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15263 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15264 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15265 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15266 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15267 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15269 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15270 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15271 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15273 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15274 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15275 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15277 /* TODO: vector constants. */
15279 /* Test integer_onep. */
15280 ASSERT_FALSE (integer_onep (i_0
));
15281 ASSERT_FALSE (integer_onep (wr_i_0
));
15282 ASSERT_TRUE (integer_onep (i_1
));
15283 ASSERT_TRUE (integer_onep (wr_i_1
));
15284 ASSERT_FALSE (integer_onep (i_m1
));
15285 ASSERT_FALSE (integer_onep (wr_i_m1
));
15286 ASSERT_FALSE (integer_onep (f_0
));
15287 ASSERT_FALSE (integer_onep (wr_f_0
));
15288 ASSERT_FALSE (integer_onep (f_1
));
15289 ASSERT_FALSE (integer_onep (wr_f_1
));
15290 ASSERT_FALSE (integer_onep (f_m1
));
15291 ASSERT_FALSE (integer_onep (wr_f_m1
));
15292 ASSERT_FALSE (integer_onep (c_i_0
));
15293 ASSERT_TRUE (integer_onep (c_i_1
));
15294 ASSERT_FALSE (integer_onep (c_i_m1
));
15295 ASSERT_FALSE (integer_onep (c_f_0
));
15296 ASSERT_FALSE (integer_onep (c_f_1
));
15297 ASSERT_FALSE (integer_onep (c_f_m1
));
15299 /* Test integer_zerop. */
15300 ASSERT_TRUE (integer_zerop (i_0
));
15301 ASSERT_TRUE (integer_zerop (wr_i_0
));
15302 ASSERT_FALSE (integer_zerop (i_1
));
15303 ASSERT_FALSE (integer_zerop (wr_i_1
));
15304 ASSERT_FALSE (integer_zerop (i_m1
));
15305 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15306 ASSERT_FALSE (integer_zerop (f_0
));
15307 ASSERT_FALSE (integer_zerop (wr_f_0
));
15308 ASSERT_FALSE (integer_zerop (f_1
));
15309 ASSERT_FALSE (integer_zerop (wr_f_1
));
15310 ASSERT_FALSE (integer_zerop (f_m1
));
15311 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15312 ASSERT_TRUE (integer_zerop (c_i_0
));
15313 ASSERT_FALSE (integer_zerop (c_i_1
));
15314 ASSERT_FALSE (integer_zerop (c_i_m1
));
15315 ASSERT_FALSE (integer_zerop (c_f_0
));
15316 ASSERT_FALSE (integer_zerop (c_f_1
));
15317 ASSERT_FALSE (integer_zerop (c_f_m1
));
15319 /* Test integer_all_onesp. */
15320 ASSERT_FALSE (integer_all_onesp (i_0
));
15321 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15322 ASSERT_FALSE (integer_all_onesp (i_1
));
15323 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15324 ASSERT_TRUE (integer_all_onesp (i_m1
));
15325 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15326 ASSERT_FALSE (integer_all_onesp (f_0
));
15327 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15328 ASSERT_FALSE (integer_all_onesp (f_1
));
15329 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15330 ASSERT_FALSE (integer_all_onesp (f_m1
));
15331 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15332 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15333 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15334 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15335 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15336 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15337 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15339 /* Test integer_minus_onep. */
15340 ASSERT_FALSE (integer_minus_onep (i_0
));
15341 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15342 ASSERT_FALSE (integer_minus_onep (i_1
));
15343 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15344 ASSERT_TRUE (integer_minus_onep (i_m1
));
15345 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15346 ASSERT_FALSE (integer_minus_onep (f_0
));
15347 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15348 ASSERT_FALSE (integer_minus_onep (f_1
));
15349 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15350 ASSERT_FALSE (integer_minus_onep (f_m1
));
15351 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15352 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15353 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15354 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15355 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15356 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15357 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15359 /* Test integer_each_onep. */
15360 ASSERT_FALSE (integer_each_onep (i_0
));
15361 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15362 ASSERT_TRUE (integer_each_onep (i_1
));
15363 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15364 ASSERT_FALSE (integer_each_onep (i_m1
));
15365 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15366 ASSERT_FALSE (integer_each_onep (f_0
));
15367 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15368 ASSERT_FALSE (integer_each_onep (f_1
));
15369 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15370 ASSERT_FALSE (integer_each_onep (f_m1
));
15371 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15372 ASSERT_FALSE (integer_each_onep (c_i_0
));
15373 ASSERT_FALSE (integer_each_onep (c_i_1
));
15374 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15375 ASSERT_FALSE (integer_each_onep (c_f_0
));
15376 ASSERT_FALSE (integer_each_onep (c_f_1
));
15377 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15379 /* Test integer_truep. */
15380 ASSERT_FALSE (integer_truep (i_0
));
15381 ASSERT_FALSE (integer_truep (wr_i_0
));
15382 ASSERT_TRUE (integer_truep (i_1
));
15383 ASSERT_TRUE (integer_truep (wr_i_1
));
15384 ASSERT_FALSE (integer_truep (i_m1
));
15385 ASSERT_FALSE (integer_truep (wr_i_m1
));
15386 ASSERT_FALSE (integer_truep (f_0
));
15387 ASSERT_FALSE (integer_truep (wr_f_0
));
15388 ASSERT_FALSE (integer_truep (f_1
));
15389 ASSERT_FALSE (integer_truep (wr_f_1
));
15390 ASSERT_FALSE (integer_truep (f_m1
));
15391 ASSERT_FALSE (integer_truep (wr_f_m1
));
15392 ASSERT_FALSE (integer_truep (c_i_0
));
15393 ASSERT_TRUE (integer_truep (c_i_1
));
15394 ASSERT_FALSE (integer_truep (c_i_m1
));
15395 ASSERT_FALSE (integer_truep (c_f_0
));
15396 ASSERT_FALSE (integer_truep (c_f_1
));
15397 ASSERT_FALSE (integer_truep (c_f_m1
));
15399 /* Test integer_nonzerop. */
15400 ASSERT_FALSE (integer_nonzerop (i_0
));
15401 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15402 ASSERT_TRUE (integer_nonzerop (i_1
));
15403 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15404 ASSERT_TRUE (integer_nonzerop (i_m1
));
15405 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15406 ASSERT_FALSE (integer_nonzerop (f_0
));
15407 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15408 ASSERT_FALSE (integer_nonzerop (f_1
));
15409 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15410 ASSERT_FALSE (integer_nonzerop (f_m1
));
15411 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15412 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15413 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15414 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15415 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15416 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15417 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15419 /* Test real_zerop. */
15420 ASSERT_FALSE (real_zerop (i_0
));
15421 ASSERT_FALSE (real_zerop (wr_i_0
));
15422 ASSERT_FALSE (real_zerop (i_1
));
15423 ASSERT_FALSE (real_zerop (wr_i_1
));
15424 ASSERT_FALSE (real_zerop (i_m1
));
15425 ASSERT_FALSE (real_zerop (wr_i_m1
));
15426 ASSERT_TRUE (real_zerop (f_0
));
15427 ASSERT_TRUE (real_zerop (wr_f_0
));
15428 ASSERT_FALSE (real_zerop (f_1
));
15429 ASSERT_FALSE (real_zerop (wr_f_1
));
15430 ASSERT_FALSE (real_zerop (f_m1
));
15431 ASSERT_FALSE (real_zerop (wr_f_m1
));
15432 ASSERT_FALSE (real_zerop (c_i_0
));
15433 ASSERT_FALSE (real_zerop (c_i_1
));
15434 ASSERT_FALSE (real_zerop (c_i_m1
));
15435 ASSERT_TRUE (real_zerop (c_f_0
));
15436 ASSERT_FALSE (real_zerop (c_f_1
));
15437 ASSERT_FALSE (real_zerop (c_f_m1
));
15439 /* Test real_onep. */
15440 ASSERT_FALSE (real_onep (i_0
));
15441 ASSERT_FALSE (real_onep (wr_i_0
));
15442 ASSERT_FALSE (real_onep (i_1
));
15443 ASSERT_FALSE (real_onep (wr_i_1
));
15444 ASSERT_FALSE (real_onep (i_m1
));
15445 ASSERT_FALSE (real_onep (wr_i_m1
));
15446 ASSERT_FALSE (real_onep (f_0
));
15447 ASSERT_FALSE (real_onep (wr_f_0
));
15448 ASSERT_TRUE (real_onep (f_1
));
15449 ASSERT_TRUE (real_onep (wr_f_1
));
15450 ASSERT_FALSE (real_onep (f_m1
));
15451 ASSERT_FALSE (real_onep (wr_f_m1
));
15452 ASSERT_FALSE (real_onep (c_i_0
));
15453 ASSERT_FALSE (real_onep (c_i_1
));
15454 ASSERT_FALSE (real_onep (c_i_m1
));
15455 ASSERT_FALSE (real_onep (c_f_0
));
15456 ASSERT_TRUE (real_onep (c_f_1
));
15457 ASSERT_FALSE (real_onep (c_f_m1
));
15459 /* Test real_minus_onep. */
15460 ASSERT_FALSE (real_minus_onep (i_0
));
15461 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15462 ASSERT_FALSE (real_minus_onep (i_1
));
15463 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15464 ASSERT_FALSE (real_minus_onep (i_m1
));
15465 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15466 ASSERT_FALSE (real_minus_onep (f_0
));
15467 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15468 ASSERT_FALSE (real_minus_onep (f_1
));
15469 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15470 ASSERT_TRUE (real_minus_onep (f_m1
));
15471 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15472 ASSERT_FALSE (real_minus_onep (c_i_0
));
15473 ASSERT_FALSE (real_minus_onep (c_i_1
));
15474 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15475 ASSERT_FALSE (real_minus_onep (c_f_0
));
15476 ASSERT_FALSE (real_minus_onep (c_f_1
));
15477 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15480 ASSERT_TRUE (zerop (i_0
));
15481 ASSERT_TRUE (zerop (wr_i_0
));
15482 ASSERT_FALSE (zerop (i_1
));
15483 ASSERT_FALSE (zerop (wr_i_1
));
15484 ASSERT_FALSE (zerop (i_m1
));
15485 ASSERT_FALSE (zerop (wr_i_m1
));
15486 ASSERT_TRUE (zerop (f_0
));
15487 ASSERT_TRUE (zerop (wr_f_0
));
15488 ASSERT_FALSE (zerop (f_1
));
15489 ASSERT_FALSE (zerop (wr_f_1
));
15490 ASSERT_FALSE (zerop (f_m1
));
15491 ASSERT_FALSE (zerop (wr_f_m1
));
15492 ASSERT_TRUE (zerop (c_i_0
));
15493 ASSERT_FALSE (zerop (c_i_1
));
15494 ASSERT_FALSE (zerop (c_i_m1
));
15495 ASSERT_TRUE (zerop (c_f_0
));
15496 ASSERT_FALSE (zerop (c_f_1
));
15497 ASSERT_FALSE (zerop (c_f_m1
));
15499 /* Test tree_expr_nonnegative_p. */
15500 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15501 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15502 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15503 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15504 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15505 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15506 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15507 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15508 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15509 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15510 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15511 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15512 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15513 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15514 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15515 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15516 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15517 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15519 /* Test tree_expr_nonzero_p. */
15520 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15521 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15522 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15523 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15524 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15525 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15527 /* Test integer_valued_real_p. */
15528 ASSERT_FALSE (integer_valued_real_p (i_0
));
15529 ASSERT_TRUE (integer_valued_real_p (f_0
));
15530 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15531 ASSERT_TRUE (integer_valued_real_p (f_1
));
15532 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15534 /* Test integer_pow2p. */
15535 ASSERT_FALSE (integer_pow2p (i_0
));
15536 ASSERT_TRUE (integer_pow2p (i_1
));
15537 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15539 /* Test uniform_integer_cst_p. */
15540 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15541 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15542 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15543 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15544 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15545 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15546 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15547 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15548 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15549 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15550 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15551 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15552 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15553 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15554 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15555 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15556 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15557 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15560 /* Check that string escaping works correctly. */
15563 test_escaped_strings (void)
15566 escaped_string msg
;
15569 /* ASSERT_STREQ does not accept NULL as a valid test
15570 result, so we have to use ASSERT_EQ instead. */
15571 ASSERT_EQ (NULL
, (const char *) msg
);
15574 ASSERT_STREQ ("", (const char *) msg
);
15576 msg
.escape ("foobar");
15577 ASSERT_STREQ ("foobar", (const char *) msg
);
15579 /* Ensure that we have -fmessage-length set to 0. */
15580 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15581 pp_line_cutoff (global_dc
->printer
) = 0;
15583 msg
.escape ("foo\nbar");
15584 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15586 msg
.escape ("\a\b\f\n\r\t\v");
15587 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15589 /* Now repeat the tests with -fmessage-length set to 5. */
15590 pp_line_cutoff (global_dc
->printer
) = 5;
15592 /* Note that the newline is not translated into an escape. */
15593 msg
.escape ("foo\nbar");
15594 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15596 msg
.escape ("\a\b\f\n\r\t\v");
15597 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15599 /* Restore the original message length setting. */
15600 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15603 /* Run all of the selftests within this file. */
15608 test_integer_constants ();
15609 test_identifiers ();
15611 test_vector_cst_patterns ();
15612 test_location_wrappers ();
15613 test_predicates ();
15614 test_escaped_strings ();
15617 } // namespace selftest
15619 #endif /* CHECKING_P */
15621 #include "gt-tree.h"