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
)
5156 || (!DECL_ASSEMBLER_NAME_SET_P (TYPE_NAME (type
))
5157 && (TREE_CODE (type
) != RECORD_TYPE
5158 || !TYPE_BINFO (type
)
5159 || !BINFO_VTABLE (TYPE_BINFO (type
)))))
5160 return DECL_NAME (TYPE_NAME (type
));
5161 return TYPE_NAME (type
);
5164 /* Do same comparsion as check_qualified_type skipping lang part of type
5165 and be more permissive about type names: we only care that names are
5166 same (for diagnostics) and that ODR names are the same.
5167 If INNER_TYPE is non-NULL, be sure that TREE_TYPE match it. */
5170 fld_type_variant_equal_p (tree t
, tree v
, tree inner_type
)
5172 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5173 /* We want to match incomplete variants with complete types.
5174 In this case we need to ignore alignment. */
5175 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5176 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5177 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5178 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5179 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5180 TYPE_ATTRIBUTES (v
))
5181 || (inner_type
&& TREE_TYPE (v
) != inner_type
))
5187 /* Find variant of FIRST that match T and create new one if necessary.
5188 Set TREE_TYPE to INNER_TYPE if non-NULL. */
5191 fld_type_variant (tree first
, tree t
, struct free_lang_data_d
*fld
,
5192 tree inner_type
= NULL
)
5194 if (first
== TYPE_MAIN_VARIANT (t
))
5196 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5197 if (fld_type_variant_equal_p (t
, v
, inner_type
))
5199 tree v
= build_variant_type_copy (first
);
5200 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5201 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5202 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5203 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5204 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5205 TYPE_NAME (v
) = TYPE_NAME (t
);
5206 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5207 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5208 /* Variants of incomplete types should have alignment
5209 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5210 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5212 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5213 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5216 TREE_TYPE (v
) = inner_type
;
5217 gcc_checking_assert (fld_type_variant_equal_p (t
,v
, inner_type
));
5218 add_tree_to_fld_list (v
, fld
);
5222 /* Map complete types to incomplete types. */
5224 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5226 /* Map types to simplified types. */
5228 static hash_map
<tree
, tree
> *fld_simplified_types
;
5230 /* Produce variant of T whose TREE_TYPE is T2. If it is main variant,
5231 use MAP to prevent duplicates. */
5234 fld_process_array_type (tree t
, tree t2
, hash_map
<tree
, tree
> *map
,
5235 struct free_lang_data_d
*fld
)
5237 if (TREE_TYPE (t
) == t2
)
5240 if (TYPE_MAIN_VARIANT (t
) != t
)
5242 return fld_type_variant
5243 (fld_process_array_type (TYPE_MAIN_VARIANT (t
),
5244 TYPE_MAIN_VARIANT (t2
), map
, fld
),
5250 = map
->get_or_insert (t
, &existed
);
5253 array
= build_array_type_1 (t2
, TYPE_DOMAIN (t
),
5254 TYPE_TYPELESS_STORAGE (t
), false);
5255 TYPE_CANONICAL (array
) = TYPE_CANONICAL (t
);
5256 add_tree_to_fld_list (array
, fld
);
5261 /* Return CTX after removal of contexts that are not relevant */
5264 fld_decl_context (tree ctx
)
5266 /* Variably modified types are needed for tree_is_indexable to decide
5267 whether the type needs to go to local or global section.
5268 This code is semi-broken but for now it is easiest to keep contexts
5270 if (ctx
&& TYPE_P (ctx
)
5271 && !variably_modified_type_p (ctx
, NULL_TREE
))
5273 while (ctx
&& TYPE_P (ctx
))
5274 ctx
= TYPE_CONTEXT (ctx
);
5279 /* For T being aggregate type try to turn it into a incomplete variant.
5280 Return T if no simplification is possible. */
5283 fld_incomplete_type_of (tree t
, struct free_lang_data_d
*fld
)
5287 if (POINTER_TYPE_P (t
))
5289 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5290 if (t2
!= TREE_TYPE (t
))
5293 if (TREE_CODE (t
) == POINTER_TYPE
)
5294 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5295 TYPE_REF_CAN_ALIAS_ALL (t
));
5297 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5298 TYPE_REF_CAN_ALIAS_ALL (t
));
5299 gcc_assert (TYPE_CANONICAL (t2
) != t2
5300 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5301 add_tree_to_fld_list (first
, fld
);
5302 return fld_type_variant (first
, t
, fld
);
5306 if (TREE_CODE (t
) == ARRAY_TYPE
)
5307 return fld_process_array_type (t
,
5308 fld_incomplete_type_of (TREE_TYPE (t
), fld
),
5309 fld_incomplete_types
, fld
);
5310 if ((!RECORD_OR_UNION_TYPE_P (t
) && TREE_CODE (t
) != ENUMERAL_TYPE
)
5311 || !COMPLETE_TYPE_P (t
))
5313 if (TYPE_MAIN_VARIANT (t
) == t
)
5317 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5321 copy
= build_distinct_type_copy (t
);
5323 /* It is possible that type was not seen by free_lang_data yet. */
5324 add_tree_to_fld_list (copy
, fld
);
5325 TYPE_SIZE (copy
) = NULL
;
5326 TYPE_USER_ALIGN (copy
) = 0;
5327 TYPE_SIZE_UNIT (copy
) = NULL
;
5328 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5329 TREE_ADDRESSABLE (copy
) = 0;
5330 if (AGGREGATE_TYPE_P (t
))
5332 SET_TYPE_MODE (copy
, VOIDmode
);
5333 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5334 TYPE_TYPELESS_STORAGE (copy
) = 0;
5335 TYPE_FIELDS (copy
) = NULL
;
5336 TYPE_BINFO (copy
) = NULL
;
5339 TYPE_VALUES (copy
) = NULL
;
5341 /* Build copy of TYPE_DECL in TYPE_NAME if necessary.
5342 This is needed for ODR violation warnings to come out right (we
5343 want duplicate TYPE_DECLs whenever the type is duplicated because
5344 of ODR violation. Because lang data in the TYPE_DECL may not
5345 have been freed yet, rebuild it from scratch and copy relevant
5347 TYPE_NAME (copy
) = fld_simplified_type_name (copy
);
5348 tree name
= TYPE_NAME (copy
);
5350 if (name
&& TREE_CODE (name
) == TYPE_DECL
)
5352 gcc_checking_assert (TREE_TYPE (name
) == t
);
5353 tree name2
= build_decl (DECL_SOURCE_LOCATION (name
), TYPE_DECL
,
5354 DECL_NAME (name
), copy
);
5355 if (DECL_ASSEMBLER_NAME_SET_P (name
))
5356 SET_DECL_ASSEMBLER_NAME (name2
, DECL_ASSEMBLER_NAME (name
));
5357 SET_DECL_ALIGN (name2
, 0);
5358 DECL_CONTEXT (name2
) = fld_decl_context
5359 (DECL_CONTEXT (name
));
5360 TYPE_NAME (copy
) = name2
;
5365 return (fld_type_variant
5366 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5369 /* Simplify type T for scenarios where we do not need complete pointer
5373 fld_simplified_type (tree t
, struct free_lang_data_d
*fld
)
5377 if (POINTER_TYPE_P (t
))
5378 return fld_incomplete_type_of (t
, fld
);
5379 /* FIXME: This triggers verification error, see PR88140. */
5380 if (TREE_CODE (t
) == ARRAY_TYPE
&& 0)
5381 return fld_process_array_type (t
, fld_simplified_type (TREE_TYPE (t
), fld
),
5382 fld_simplified_types
, fld
);
5386 /* Reset the expression *EXPR_P, a size or position.
5388 ??? We could reset all non-constant sizes or positions. But it's cheap
5389 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5391 We need to reset self-referential sizes or positions because they cannot
5392 be gimplified and thus can contain a CALL_EXPR after the gimplification
5393 is finished, which will run afoul of LTO streaming. And they need to be
5394 reset to something essentially dummy but not constant, so as to preserve
5395 the properties of the object they are attached to. */
5398 free_lang_data_in_one_sizepos (tree
*expr_p
)
5400 tree expr
= *expr_p
;
5401 if (CONTAINS_PLACEHOLDER_P (expr
))
5402 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5406 /* Reset all the fields in a binfo node BINFO. We only keep
5407 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5410 free_lang_data_in_binfo (tree binfo
)
5415 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5417 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5418 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5419 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5420 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5421 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5423 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5424 free_lang_data_in_binfo (t
);
5428 /* Reset all language specific information still present in TYPE. */
5431 free_lang_data_in_type (tree type
, struct free_lang_data_d
*fld
)
5433 gcc_assert (TYPE_P (type
));
5435 /* Give the FE a chance to remove its own data first. */
5436 lang_hooks
.free_lang_data (type
);
5438 TREE_LANG_FLAG_0 (type
) = 0;
5439 TREE_LANG_FLAG_1 (type
) = 0;
5440 TREE_LANG_FLAG_2 (type
) = 0;
5441 TREE_LANG_FLAG_3 (type
) = 0;
5442 TREE_LANG_FLAG_4 (type
) = 0;
5443 TREE_LANG_FLAG_5 (type
) = 0;
5444 TREE_LANG_FLAG_6 (type
) = 0;
5446 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5448 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5450 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5451 /* Remove the const and volatile qualifiers from arguments. The
5452 C++ front end removes them, but the C front end does not,
5453 leading to false ODR violation errors when merging two
5454 instances of the same function signature compiled by
5455 different front ends. */
5456 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5458 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5459 tree arg_type
= TREE_VALUE (p
);
5461 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5463 int quals
= TYPE_QUALS (arg_type
)
5465 & ~TYPE_QUAL_VOLATILE
;
5466 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5467 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5469 /* C++ FE uses TREE_PURPOSE to store initial values. */
5470 TREE_PURPOSE (p
) = NULL
;
5473 else if (TREE_CODE (type
) == METHOD_TYPE
)
5475 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5476 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5478 /* C++ FE uses TREE_PURPOSE to store initial values. */
5479 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5480 TREE_PURPOSE (p
) = NULL
;
5483 else if (RECORD_OR_UNION_TYPE_P (type
))
5485 /* Remove members that are not FIELD_DECLs from the field list
5486 of an aggregate. These occur in C++. */
5487 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5488 if (TREE_CODE (member
) == FIELD_DECL
)
5489 prev
= &DECL_CHAIN (member
);
5491 *prev
= DECL_CHAIN (member
);
5493 TYPE_VFIELD (type
) = NULL_TREE
;
5495 if (TYPE_BINFO (type
))
5497 free_lang_data_in_binfo (TYPE_BINFO (type
));
5498 /* We need to preserve link to bases and virtual table for all
5499 polymorphic types to make devirtualization machinery working. */
5500 if (!BINFO_VTABLE (TYPE_BINFO (type
))
5501 || !flag_devirtualize
)
5502 TYPE_BINFO (type
) = NULL
;
5505 else if (INTEGRAL_TYPE_P (type
)
5506 || SCALAR_FLOAT_TYPE_P (type
)
5507 || FIXED_POINT_TYPE_P (type
))
5509 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5511 /* Type values are used only for C++ ODR checking. Drop them
5512 for all type variants and non-ODR types.
5513 For ODR types the data is freed in free_odr_warning_data. */
5514 if (TYPE_MAIN_VARIANT (type
) != type
5515 || !type_with_linkage_p (type
))
5516 TYPE_VALUES (type
) = NULL
;
5518 /* Simplify representation by recording only values rather
5519 than const decls. */
5520 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5521 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5522 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5524 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5525 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5528 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5530 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5531 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5533 if (TYPE_CONTEXT (type
)
5534 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5536 tree ctx
= TYPE_CONTEXT (type
);
5539 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5541 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5542 TYPE_CONTEXT (type
) = ctx
;
5545 TYPE_STUB_DECL (type
) = NULL
;
5546 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5550 /* Return true if DECL may need an assembler name to be set. */
5553 need_assembler_name_p (tree decl
)
5555 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5556 Rule merging. This makes type_odr_p to return true on those types during
5557 LTO and by comparing the mangled name, we can say what types are intended
5558 to be equivalent across compilation unit.
5560 We do not store names of type_in_anonymous_namespace_p.
5562 Record, union and enumeration type have linkage that allows use
5563 to check type_in_anonymous_namespace_p. We do not mangle compound types
5564 that always can be compared structurally.
5566 Similarly for builtin types, we compare properties of their main variant.
5567 A special case are integer types where mangling do make differences
5568 between char/signed char/unsigned char etc. Storing name for these makes
5569 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5570 See cp/mangle.c:write_builtin_type for details. */
5572 if (TREE_CODE (decl
) == TYPE_DECL
)
5574 if (flag_lto_odr_type_mering
5576 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5577 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5578 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5579 && (type_with_linkage_p (TREE_TYPE (decl
))
5580 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5581 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5582 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5585 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5586 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5589 /* If DECL already has its assembler name set, it does not need a
5591 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5592 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5595 /* Abstract decls do not need an assembler name. */
5596 if (DECL_ABSTRACT_P (decl
))
5599 /* For VAR_DECLs, only static, public and external symbols need an
5602 && !TREE_STATIC (decl
)
5603 && !TREE_PUBLIC (decl
)
5604 && !DECL_EXTERNAL (decl
))
5607 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5609 /* Do not set assembler name on builtins. Allow RTL expansion to
5610 decide whether to expand inline or via a regular call. */
5611 if (fndecl_built_in_p (decl
)
5612 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5615 /* Functions represented in the callgraph need an assembler name. */
5616 if (cgraph_node::get (decl
) != NULL
)
5619 /* Unused and not public functions don't need an assembler name. */
5620 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5628 /* Reset all language specific information still present in symbol
5632 free_lang_data_in_decl (tree decl
, struct free_lang_data_d
*fld
)
5634 gcc_assert (DECL_P (decl
));
5636 /* Give the FE a chance to remove its own data first. */
5637 lang_hooks
.free_lang_data (decl
);
5639 TREE_LANG_FLAG_0 (decl
) = 0;
5640 TREE_LANG_FLAG_1 (decl
) = 0;
5641 TREE_LANG_FLAG_2 (decl
) = 0;
5642 TREE_LANG_FLAG_3 (decl
) = 0;
5643 TREE_LANG_FLAG_4 (decl
) = 0;
5644 TREE_LANG_FLAG_5 (decl
) = 0;
5645 TREE_LANG_FLAG_6 (decl
) = 0;
5647 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5648 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5649 if (TREE_CODE (decl
) == FIELD_DECL
)
5651 DECL_FCONTEXT (decl
) = NULL
;
5652 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5653 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5654 DECL_QUALIFIER (decl
) = NULL_TREE
;
5657 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5659 struct cgraph_node
*node
;
5660 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5661 the address may be taken in other unit, so this flag has no practical
5664 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5665 for public objects that indeed cannot be adressed, but it is not
5666 the case. Set the flag to true so we do not get merge failures for
5667 i.e. virtual tables between units that take address of it and
5668 units that don't. */
5669 if (TREE_PUBLIC (decl
))
5670 TREE_ADDRESSABLE (decl
) = true;
5671 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5672 if (!(node
= cgraph_node::get (decl
))
5673 || (!node
->definition
&& !node
->clones
))
5676 node
->release_body ();
5679 release_function_body (decl
);
5680 DECL_ARGUMENTS (decl
) = NULL
;
5681 DECL_RESULT (decl
) = NULL
;
5682 DECL_INITIAL (decl
) = error_mark_node
;
5685 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5689 /* If DECL has a gimple body, then the context for its
5690 arguments must be DECL. Otherwise, it doesn't really
5691 matter, as we will not be emitting any code for DECL. In
5692 general, there may be other instances of DECL created by
5693 the front end and since PARM_DECLs are generally shared,
5694 their DECL_CONTEXT changes as the replicas of DECL are
5695 created. The only time where DECL_CONTEXT is important
5696 is for the FUNCTION_DECLs that have a gimple body (since
5697 the PARM_DECL will be used in the function's body). */
5698 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5699 DECL_CONTEXT (t
) = decl
;
5700 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5701 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5702 = target_option_default_node
;
5703 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5704 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5705 = optimization_default_node
;
5708 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5709 At this point, it is not needed anymore. */
5710 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5712 /* Clear the abstract origin if it refers to a method.
5713 Otherwise dwarf2out.c will ICE as we splice functions out of
5714 TYPE_FIELDS and thus the origin will not be output
5716 if (DECL_ABSTRACT_ORIGIN (decl
)
5717 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5718 && RECORD_OR_UNION_TYPE_P
5719 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5720 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5722 DECL_VINDEX (decl
) = NULL_TREE
;
5724 else if (VAR_P (decl
))
5726 /* See comment above why we set the flag for functoins. */
5727 if (TREE_PUBLIC (decl
))
5728 TREE_ADDRESSABLE (decl
) = true;
5729 if ((DECL_EXTERNAL (decl
)
5730 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5731 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5732 DECL_INITIAL (decl
) = NULL_TREE
;
5734 else if (TREE_CODE (decl
) == TYPE_DECL
)
5736 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5737 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5738 TREE_PUBLIC (decl
) = 0;
5739 TREE_PRIVATE (decl
) = 0;
5740 DECL_ARTIFICIAL (decl
) = 0;
5741 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5742 DECL_INITIAL (decl
) = NULL_TREE
;
5743 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5744 DECL_MODE (decl
) = VOIDmode
;
5745 SET_DECL_ALIGN (decl
, 0);
5746 /* TREE_TYPE is cleared at WPA time in free_odr_warning_data. */
5748 else if (TREE_CODE (decl
) == FIELD_DECL
)
5750 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5751 DECL_INITIAL (decl
) = NULL_TREE
;
5753 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5754 && DECL_INITIAL (decl
)
5755 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5757 /* Strip builtins from the translation-unit BLOCK. We still have targets
5758 without builtin_decl_explicit support and also builtins are shared
5759 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5760 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5764 if (fndecl_built_in_p (var
))
5765 *nextp
= TREE_CHAIN (var
);
5767 nextp
= &TREE_CHAIN (var
);
5770 /* We need to keep field decls associated with their trees. Otherwise tree
5771 merging may merge some fileds and keep others disjoint wich in turn will
5772 not do well with TREE_CHAIN pointers linking them.
5774 Also do not drop containing types for virtual methods and tables because
5775 these are needed by devirtualization. */
5776 if (TREE_CODE (decl
) != FIELD_DECL
5777 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5778 || !DECL_VIRTUAL_P (decl
)))
5779 DECL_CONTEXT (decl
) = fld_decl_context (DECL_CONTEXT (decl
));
5783 /* Operand callback helper for free_lang_data_in_node. *TP is the
5784 subtree operand being considered. */
5787 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5790 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5792 if (TREE_CODE (t
) == TREE_LIST
)
5795 /* Language specific nodes will be removed, so there is no need
5796 to gather anything under them. */
5797 if (is_lang_specific (t
))
5805 /* Note that walk_tree does not traverse every possible field in
5806 decls, so we have to do our own traversals here. */
5807 add_tree_to_fld_list (t
, fld
);
5809 fld_worklist_push (DECL_NAME (t
), fld
);
5810 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5811 fld_worklist_push (DECL_SIZE (t
), fld
);
5812 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5814 /* We are going to remove everything under DECL_INITIAL for
5815 TYPE_DECLs. No point walking them. */
5816 if (TREE_CODE (t
) != TYPE_DECL
)
5817 fld_worklist_push (DECL_INITIAL (t
), fld
);
5819 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5820 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5822 if (TREE_CODE (t
) == FUNCTION_DECL
)
5824 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5825 fld_worklist_push (DECL_RESULT (t
), fld
);
5827 else if (TREE_CODE (t
) == FIELD_DECL
)
5829 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5830 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5831 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5832 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5835 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5836 && DECL_HAS_VALUE_EXPR_P (t
))
5837 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5839 if (TREE_CODE (t
) != FIELD_DECL
5840 && TREE_CODE (t
) != TYPE_DECL
)
5841 fld_worklist_push (TREE_CHAIN (t
), fld
);
5844 else if (TYPE_P (t
))
5846 /* Note that walk_tree does not traverse every possible field in
5847 types, so we have to do our own traversals here. */
5848 add_tree_to_fld_list (t
, fld
);
5850 if (!RECORD_OR_UNION_TYPE_P (t
))
5851 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5852 fld_worklist_push (TYPE_SIZE (t
), fld
);
5853 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5854 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5855 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5856 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5857 fld_worklist_push (TYPE_NAME (t
), fld
);
5858 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5859 lists, we may look types up in these lists and use them while
5860 optimizing the function body. Thus we need to free lang data
5862 if (TREE_CODE (t
) == POINTER_TYPE
)
5863 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5864 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5865 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5866 if (!POINTER_TYPE_P (t
))
5867 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5868 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5869 if (!RECORD_OR_UNION_TYPE_P (t
))
5870 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5871 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5872 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5873 do not and want not to reach unused variants this way. */
5874 if (TYPE_CONTEXT (t
))
5876 tree ctx
= TYPE_CONTEXT (t
);
5877 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5878 So push that instead. */
5879 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5880 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5881 fld_worklist_push (ctx
, fld
);
5883 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5884 and want not to reach unused types this way. */
5886 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5890 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5891 fld_worklist_push (TREE_TYPE (tem
), fld
);
5892 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5893 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5895 if (RECORD_OR_UNION_TYPE_P (t
))
5898 /* Push all TYPE_FIELDS - there can be interleaving interesting
5899 and non-interesting things. */
5900 tem
= TYPE_FIELDS (t
);
5903 if (TREE_CODE (tem
) == FIELD_DECL
)
5904 fld_worklist_push (tem
, fld
);
5905 tem
= TREE_CHAIN (tem
);
5908 if (FUNC_OR_METHOD_TYPE_P (t
))
5909 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5911 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5914 else if (TREE_CODE (t
) == BLOCK
)
5916 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5918 if (TREE_CODE (*tem
) != VAR_DECL
5919 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
)))
5921 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5922 && TREE_CODE (*tem
) != PARM_DECL
);
5923 *tem
= TREE_CHAIN (*tem
);
5927 fld_worklist_push (*tem
, fld
);
5928 tem
= &TREE_CHAIN (*tem
);
5931 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5932 fld_worklist_push (tem
, fld
);
5933 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5936 if (TREE_CODE (t
) != IDENTIFIER_NODE
5937 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5938 fld_worklist_push (TREE_TYPE (t
), fld
);
5944 /* Find decls and types in T. */
5947 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5951 if (!fld
->pset
.contains (t
))
5952 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5953 if (fld
->worklist
.is_empty ())
5955 t
= fld
->worklist
.pop ();
5959 /* Translate all the types in LIST with the corresponding runtime
5963 get_eh_types_for_runtime (tree list
)
5967 if (list
== NULL_TREE
)
5970 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5972 list
= TREE_CHAIN (list
);
5975 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5976 TREE_CHAIN (prev
) = n
;
5977 prev
= TREE_CHAIN (prev
);
5978 list
= TREE_CHAIN (list
);
5985 /* Find decls and types referenced in EH region R and store them in
5986 FLD->DECLS and FLD->TYPES. */
5989 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
6000 /* The types referenced in each catch must first be changed to the
6001 EH types used at runtime. This removes references to FE types
6003 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
6005 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
6006 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6011 case ERT_ALLOWED_EXCEPTIONS
:
6012 r
->u
.allowed
.type_list
6013 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
6014 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
6017 case ERT_MUST_NOT_THROW
:
6018 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
6019 find_decls_types_r
, fld
, &fld
->pset
);
6025 /* Find decls and types referenced in cgraph node N and store them in
6026 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6027 look for *every* kind of DECL and TYPE node reachable from N,
6028 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6029 NAMESPACE_DECLs, etc). */
6032 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
6035 struct function
*fn
;
6039 find_decls_types (n
->decl
, fld
);
6041 if (!gimple_has_body_p (n
->decl
))
6044 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
6046 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
6048 /* Traverse locals. */
6049 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
6050 find_decls_types (t
, fld
);
6052 /* Traverse EH regions in FN. */
6055 FOR_ALL_EH_REGION_FN (r
, fn
)
6056 find_decls_types_in_eh_region (r
, fld
);
6059 /* Traverse every statement in FN. */
6060 FOR_EACH_BB_FN (bb
, fn
)
6063 gimple_stmt_iterator si
;
6066 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
6068 gphi
*phi
= psi
.phi ();
6070 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
6072 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
6073 find_decls_types (*arg_p
, fld
);
6077 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6079 gimple
*stmt
= gsi_stmt (si
);
6081 if (is_gimple_call (stmt
))
6082 find_decls_types (gimple_call_fntype (stmt
), fld
);
6084 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
6086 tree arg
= gimple_op (stmt
, i
);
6087 find_decls_types (arg
, fld
);
6094 /* Find decls and types referenced in varpool node N and store them in
6095 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
6096 look for *every* kind of DECL and TYPE node reachable from N,
6097 including those embedded inside types and decls (i.e,, TYPE_DECLs,
6098 NAMESPACE_DECLs, etc). */
6101 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
6103 find_decls_types (v
->decl
, fld
);
6106 /* If T needs an assembler name, have one created for it. */
6109 assign_assembler_name_if_needed (tree t
)
6111 if (need_assembler_name_p (t
))
6113 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
6114 diagnostics that use input_location to show locus
6115 information. The problem here is that, at this point,
6116 input_location is generally anchored to the end of the file
6117 (since the parser is long gone), so we don't have a good
6118 position to pin it to.
6120 To alleviate this problem, this uses the location of T's
6121 declaration. Examples of this are
6122 testsuite/g++.dg/template/cond2.C and
6123 testsuite/g++.dg/template/pr35240.C. */
6124 location_t saved_location
= input_location
;
6125 input_location
= DECL_SOURCE_LOCATION (t
);
6127 decl_assembler_name (t
);
6129 input_location
= saved_location
;
6134 /* Free language specific information for every operand and expression
6135 in every node of the call graph. This process operates in three stages:
6137 1- Every callgraph node and varpool node is traversed looking for
6138 decls and types embedded in them. This is a more exhaustive
6139 search than that done by find_referenced_vars, because it will
6140 also collect individual fields, decls embedded in types, etc.
6142 2- All the decls found are sent to free_lang_data_in_decl.
6144 3- All the types found are sent to free_lang_data_in_type.
6146 The ordering between decls and types is important because
6147 free_lang_data_in_decl sets assembler names, which includes
6148 mangling. So types cannot be freed up until assembler names have
6152 free_lang_data_in_cgraph (struct free_lang_data_d
*fld
)
6154 struct cgraph_node
*n
;
6160 /* Find decls and types in the body of every function in the callgraph. */
6161 FOR_EACH_FUNCTION (n
)
6162 find_decls_types_in_node (n
, fld
);
6164 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6165 find_decls_types (p
->decl
, fld
);
6167 /* Find decls and types in every varpool symbol. */
6168 FOR_EACH_VARIABLE (v
)
6169 find_decls_types_in_var (v
, fld
);
6171 /* Set the assembler name on every decl found. We need to do this
6172 now because free_lang_data_in_decl will invalidate data needed
6173 for mangling. This breaks mangling on interdependent decls. */
6174 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6175 assign_assembler_name_if_needed (t
);
6177 /* Traverse every decl found freeing its language data. */
6178 FOR_EACH_VEC_ELT (fld
->decls
, i
, t
)
6179 free_lang_data_in_decl (t
, fld
);
6181 /* Traverse every type found freeing its language data. */
6182 FOR_EACH_VEC_ELT (fld
->types
, i
, t
)
6183 free_lang_data_in_type (t
, fld
);
6187 /* Free resources that are used by FE but are not needed once they are done. */
6190 free_lang_data (void)
6193 struct free_lang_data_d fld
;
6195 /* If we are the LTO frontend we have freed lang-specific data already. */
6197 || (!flag_generate_lto
&& !flag_generate_offload
))
6199 /* Rebuild type inheritance graph even when not doing LTO to get
6200 consistent profile data. */
6201 rebuild_type_inheritance_graph ();
6205 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6206 fld_simplified_types
= new hash_map
<tree
, tree
>;
6208 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6209 if (vec_safe_is_empty (all_translation_units
))
6210 build_translation_unit_decl (NULL_TREE
);
6212 /* Allocate and assign alias sets to the standard integer types
6213 while the slots are still in the way the frontends generated them. */
6214 for (i
= 0; i
< itk_none
; ++i
)
6215 if (integer_types
[i
])
6216 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6218 /* Traverse the IL resetting language specific information for
6219 operands, expressions, etc. */
6220 free_lang_data_in_cgraph (&fld
);
6222 /* Create gimple variants for common types. */
6223 for (unsigned i
= 0;
6224 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6226 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6228 /* Reset some langhooks. Do not reset types_compatible_p, it may
6229 still be used indirectly via the get_alias_set langhook. */
6230 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6231 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6232 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6233 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6234 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6235 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6236 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6237 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6239 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6246 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6250 /* We do not want the default decl_assembler_name implementation,
6251 rather if we have fixed everything we want a wrapper around it
6252 asserting that all non-local symbols already got their assembler
6253 name and only produce assembler names for local symbols. Or rather
6254 make sure we never call decl_assembler_name on local symbols and
6255 devise a separate, middle-end private scheme for it. */
6257 /* Reset diagnostic machinery. */
6258 tree_diagnostics_defaults (global_dc
);
6260 rebuild_type_inheritance_graph ();
6262 delete fld_incomplete_types
;
6263 delete fld_simplified_types
;
6271 const pass_data pass_data_ipa_free_lang_data
=
6273 SIMPLE_IPA_PASS
, /* type */
6274 "*free_lang_data", /* name */
6275 OPTGROUP_NONE
, /* optinfo_flags */
6276 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6277 0, /* properties_required */
6278 0, /* properties_provided */
6279 0, /* properties_destroyed */
6280 0, /* todo_flags_start */
6281 0, /* todo_flags_finish */
6284 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6287 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6288 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6291 /* opt_pass methods: */
6292 virtual unsigned int execute (function
*) { return free_lang_data (); }
6294 }; // class pass_ipa_free_lang_data
6298 simple_ipa_opt_pass
*
6299 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6301 return new pass_ipa_free_lang_data (ctxt
);
6304 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6305 of the various TYPE_QUAL values. */
6308 set_type_quals (tree type
, int type_quals
)
6310 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6311 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6312 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6313 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6314 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6317 /* Returns true iff CAND and BASE have equivalent language-specific
6321 check_lang_type (const_tree cand
, const_tree base
)
6323 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6325 /* type_hash_eq currently only applies to these types. */
6326 if (TREE_CODE (cand
) != FUNCTION_TYPE
6327 && TREE_CODE (cand
) != METHOD_TYPE
)
6329 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6332 /* Returns true iff unqualified CAND and BASE are equivalent. */
6335 check_base_type (const_tree cand
, const_tree base
)
6337 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6338 /* Apparently this is needed for Objective-C. */
6339 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6340 /* Check alignment. */
6341 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6342 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6343 TYPE_ATTRIBUTES (base
)));
6346 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6349 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6351 return (TYPE_QUALS (cand
) == type_quals
6352 && check_base_type (cand
, base
)
6353 && check_lang_type (cand
, base
));
6356 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6359 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6361 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6362 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6363 /* Apparently this is needed for Objective-C. */
6364 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6365 /* Check alignment. */
6366 && TYPE_ALIGN (cand
) == align
6367 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6368 TYPE_ATTRIBUTES (base
))
6369 && check_lang_type (cand
, base
));
6372 /* This function checks to see if TYPE matches the size one of the built-in
6373 atomic types, and returns that core atomic type. */
6376 find_atomic_core_type (tree type
)
6378 tree base_atomic_type
;
6380 /* Only handle complete types. */
6381 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6384 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6387 base_atomic_type
= atomicQI_type_node
;
6391 base_atomic_type
= atomicHI_type_node
;
6395 base_atomic_type
= atomicSI_type_node
;
6399 base_atomic_type
= atomicDI_type_node
;
6403 base_atomic_type
= atomicTI_type_node
;
6407 base_atomic_type
= NULL_TREE
;
6410 return base_atomic_type
;
6413 /* Return a version of the TYPE, qualified as indicated by the
6414 TYPE_QUALS, if one exists. If no qualified version exists yet,
6415 return NULL_TREE. */
6418 get_qualified_type (tree type
, int type_quals
)
6422 if (TYPE_QUALS (type
) == type_quals
)
6425 /* Search the chain of variants to see if there is already one there just
6426 like the one we need to have. If so, use that existing one. We must
6427 preserve the TYPE_NAME, since there is code that depends on this. */
6428 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6429 if (check_qualified_type (t
, type
, type_quals
))
6435 /* Like get_qualified_type, but creates the type if it does not
6436 exist. This function never returns NULL_TREE. */
6439 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6443 /* See if we already have the appropriate qualified variant. */
6444 t
= get_qualified_type (type
, type_quals
);
6446 /* If not, build it. */
6449 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6450 set_type_quals (t
, type_quals
);
6452 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6454 /* See if this object can map to a basic atomic type. */
6455 tree atomic_type
= find_atomic_core_type (type
);
6458 /* Ensure the alignment of this type is compatible with
6459 the required alignment of the atomic type. */
6460 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6461 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6465 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6466 /* Propagate structural equality. */
6467 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6468 else if (TYPE_CANONICAL (type
) != type
)
6469 /* Build the underlying canonical type, since it is different
6472 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6473 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6476 /* T is its own canonical type. */
6477 TYPE_CANONICAL (t
) = t
;
6484 /* Create a variant of type T with alignment ALIGN. */
6487 build_aligned_type (tree type
, unsigned int align
)
6491 if (TYPE_PACKED (type
)
6492 || TYPE_ALIGN (type
) == align
)
6495 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6496 if (check_aligned_type (t
, type
, align
))
6499 t
= build_variant_type_copy (type
);
6500 SET_TYPE_ALIGN (t
, align
);
6501 TYPE_USER_ALIGN (t
) = 1;
6506 /* Create a new distinct copy of TYPE. The new type is made its own
6507 MAIN_VARIANT. If TYPE requires structural equality checks, the
6508 resulting type requires structural equality checks; otherwise, its
6509 TYPE_CANONICAL points to itself. */
6512 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6514 tree t
= copy_node (type PASS_MEM_STAT
);
6516 TYPE_POINTER_TO (t
) = 0;
6517 TYPE_REFERENCE_TO (t
) = 0;
6519 /* Set the canonical type either to a new equivalence class, or
6520 propagate the need for structural equality checks. */
6521 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6522 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6524 TYPE_CANONICAL (t
) = t
;
6526 /* Make it its own variant. */
6527 TYPE_MAIN_VARIANT (t
) = t
;
6528 TYPE_NEXT_VARIANT (t
) = 0;
6530 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6531 whose TREE_TYPE is not t. This can also happen in the Ada
6532 frontend when using subtypes. */
6537 /* Create a new variant of TYPE, equivalent but distinct. This is so
6538 the caller can modify it. TYPE_CANONICAL for the return type will
6539 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6540 are considered equal by the language itself (or that both types
6541 require structural equality checks). */
6544 build_variant_type_copy (tree type MEM_STAT_DECL
)
6546 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6548 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6550 /* Since we're building a variant, assume that it is a non-semantic
6551 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6552 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6553 /* Type variants have no alias set defined. */
6554 TYPE_ALIAS_SET (t
) = -1;
6556 /* Add the new type to the chain of variants of TYPE. */
6557 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6558 TYPE_NEXT_VARIANT (m
) = t
;
6559 TYPE_MAIN_VARIANT (t
) = m
;
6564 /* Return true if the from tree in both tree maps are equal. */
6567 tree_map_base_eq (const void *va
, const void *vb
)
6569 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6570 *const b
= (const struct tree_map_base
*) vb
;
6571 return (a
->from
== b
->from
);
6574 /* Hash a from tree in a tree_base_map. */
6577 tree_map_base_hash (const void *item
)
6579 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6582 /* Return true if this tree map structure is marked for garbage collection
6583 purposes. We simply return true if the from tree is marked, so that this
6584 structure goes away when the from tree goes away. */
6587 tree_map_base_marked_p (const void *p
)
6589 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6592 /* Hash a from tree in a tree_map. */
6595 tree_map_hash (const void *item
)
6597 return (((const struct tree_map
*) item
)->hash
);
6600 /* Hash a from tree in a tree_decl_map. */
6603 tree_decl_map_hash (const void *item
)
6605 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6608 /* Return the initialization priority for DECL. */
6611 decl_init_priority_lookup (tree decl
)
6613 symtab_node
*snode
= symtab_node::get (decl
);
6616 return DEFAULT_INIT_PRIORITY
;
6618 snode
->get_init_priority ();
6621 /* Return the finalization priority for DECL. */
6624 decl_fini_priority_lookup (tree decl
)
6626 cgraph_node
*node
= cgraph_node::get (decl
);
6629 return DEFAULT_INIT_PRIORITY
;
6631 node
->get_fini_priority ();
6634 /* Set the initialization priority for DECL to PRIORITY. */
6637 decl_init_priority_insert (tree decl
, priority_type priority
)
6639 struct symtab_node
*snode
;
6641 if (priority
== DEFAULT_INIT_PRIORITY
)
6643 snode
= symtab_node::get (decl
);
6647 else if (VAR_P (decl
))
6648 snode
= varpool_node::get_create (decl
);
6650 snode
= cgraph_node::get_create (decl
);
6651 snode
->set_init_priority (priority
);
6654 /* Set the finalization priority for DECL to PRIORITY. */
6657 decl_fini_priority_insert (tree decl
, priority_type priority
)
6659 struct cgraph_node
*node
;
6661 if (priority
== DEFAULT_INIT_PRIORITY
)
6663 node
= cgraph_node::get (decl
);
6668 node
= cgraph_node::get_create (decl
);
6669 node
->set_fini_priority (priority
);
6672 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6675 print_debug_expr_statistics (void)
6677 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6678 (long) debug_expr_for_decl
->size (),
6679 (long) debug_expr_for_decl
->elements (),
6680 debug_expr_for_decl
->collisions ());
6683 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6686 print_value_expr_statistics (void)
6688 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6689 (long) value_expr_for_decl
->size (),
6690 (long) value_expr_for_decl
->elements (),
6691 value_expr_for_decl
->collisions ());
6694 /* Lookup a debug expression for FROM, and return it if we find one. */
6697 decl_debug_expr_lookup (tree from
)
6699 struct tree_decl_map
*h
, in
;
6700 in
.base
.from
= from
;
6702 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6708 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6711 decl_debug_expr_insert (tree from
, tree to
)
6713 struct tree_decl_map
*h
;
6715 h
= ggc_alloc
<tree_decl_map
> ();
6716 h
->base
.from
= from
;
6718 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6721 /* Lookup a value expression for FROM, and return it if we find one. */
6724 decl_value_expr_lookup (tree from
)
6726 struct tree_decl_map
*h
, in
;
6727 in
.base
.from
= from
;
6729 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6735 /* Insert a mapping FROM->TO in the value expression hashtable. */
6738 decl_value_expr_insert (tree from
, tree to
)
6740 struct tree_decl_map
*h
;
6742 h
= ggc_alloc
<tree_decl_map
> ();
6743 h
->base
.from
= from
;
6745 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6748 /* Lookup a vector of debug arguments for FROM, and return it if we
6752 decl_debug_args_lookup (tree from
)
6754 struct tree_vec_map
*h
, in
;
6756 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6758 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6759 in
.base
.from
= from
;
6760 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6766 /* Insert a mapping FROM->empty vector of debug arguments in the value
6767 expression hashtable. */
6770 decl_debug_args_insert (tree from
)
6772 struct tree_vec_map
*h
;
6775 if (DECL_HAS_DEBUG_ARGS_P (from
))
6776 return decl_debug_args_lookup (from
);
6777 if (debug_args_for_decl
== NULL
)
6778 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6779 h
= ggc_alloc
<tree_vec_map
> ();
6780 h
->base
.from
= from
;
6782 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6784 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6788 /* Hashing of types so that we don't make duplicates.
6789 The entry point is `type_hash_canon'. */
6791 /* Generate the default hash code for TYPE. This is designed for
6792 speed, rather than maximum entropy. */
6795 type_hash_canon_hash (tree type
)
6797 inchash::hash hstate
;
6799 hstate
.add_int (TREE_CODE (type
));
6801 if (TREE_TYPE (type
))
6802 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6804 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6805 /* Just the identifier is adequate to distinguish. */
6806 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6808 switch (TREE_CODE (type
))
6811 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6814 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6815 if (TREE_VALUE (t
) != error_mark_node
)
6816 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6820 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6825 if (TYPE_DOMAIN (type
))
6826 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6827 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6829 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6830 hstate
.add_object (typeless
);
6837 tree t
= TYPE_MAX_VALUE (type
);
6839 t
= TYPE_MIN_VALUE (type
);
6840 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6841 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6846 case FIXED_POINT_TYPE
:
6848 unsigned prec
= TYPE_PRECISION (type
);
6849 hstate
.add_object (prec
);
6854 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6861 return hstate
.end ();
6864 /* These are the Hashtable callback functions. */
6866 /* Returns true iff the types are equivalent. */
6869 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6871 /* First test the things that are the same for all types. */
6872 if (a
->hash
!= b
->hash
6873 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6874 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6875 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6876 TYPE_ATTRIBUTES (b
->type
))
6877 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6878 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6881 /* Be careful about comparing arrays before and after the element type
6882 has been completed; don't compare TYPE_ALIGN unless both types are
6884 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6885 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6886 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6889 switch (TREE_CODE (a
->type
))
6894 case REFERENCE_TYPE
:
6899 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6900 TYPE_VECTOR_SUBPARTS (b
->type
));
6903 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6904 && !(TYPE_VALUES (a
->type
)
6905 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6906 && TYPE_VALUES (b
->type
)
6907 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6908 && type_list_equal (TYPE_VALUES (a
->type
),
6909 TYPE_VALUES (b
->type
))))
6917 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6919 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6920 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6921 TYPE_MAX_VALUE (b
->type
)))
6922 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6923 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6924 TYPE_MIN_VALUE (b
->type
))));
6926 case FIXED_POINT_TYPE
:
6927 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6930 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6933 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6934 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6935 || (TYPE_ARG_TYPES (a
->type
)
6936 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6937 && TYPE_ARG_TYPES (b
->type
)
6938 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6939 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6940 TYPE_ARG_TYPES (b
->type
)))))
6944 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6945 where the flag should be inherited from the element type
6946 and can change after ARRAY_TYPEs are created; on non-aggregates
6947 compare it and hash it, scalars will never have that flag set
6948 and we need to differentiate between arrays created by different
6949 front-ends or middle-end created arrays. */
6950 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6951 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6952 || (TYPE_TYPELESS_STORAGE (a
->type
)
6953 == TYPE_TYPELESS_STORAGE (b
->type
))));
6957 case QUAL_UNION_TYPE
:
6958 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6959 || (TYPE_FIELDS (a
->type
)
6960 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6961 && TYPE_FIELDS (b
->type
)
6962 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6963 && type_list_equal (TYPE_FIELDS (a
->type
),
6964 TYPE_FIELDS (b
->type
))));
6967 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6968 || (TYPE_ARG_TYPES (a
->type
)
6969 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6970 && TYPE_ARG_TYPES (b
->type
)
6971 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6972 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6973 TYPE_ARG_TYPES (b
->type
))))
6981 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6982 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6987 /* Given TYPE, and HASHCODE its hash code, return the canonical
6988 object for an identical type if one already exists.
6989 Otherwise, return TYPE, and record it as the canonical object.
6991 To use this function, first create a type of the sort you want.
6992 Then compute its hash code from the fields of the type that
6993 make it different from other similar types.
6994 Then call this function and use the value. */
6997 type_hash_canon (unsigned int hashcode
, tree type
)
7002 /* The hash table only contains main variants, so ensure that's what we're
7004 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7006 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7007 must call that routine before comparing TYPE_ALIGNs. */
7013 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7016 tree t1
= ((type_hash
*) *loc
)->type
;
7017 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
7019 if (TYPE_UID (type
) + 1 == next_type_uid
)
7021 /* Free also min/max values and the cache for integer
7022 types. This can't be done in free_node, as LTO frees
7023 those on its own. */
7024 if (TREE_CODE (type
) == INTEGER_TYPE
)
7026 if (TYPE_MIN_VALUE (type
)
7027 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
7029 /* Zero is always in TYPE_CACHED_VALUES. */
7030 if (! TYPE_UNSIGNED (type
))
7031 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
7032 ggc_free (TYPE_MIN_VALUE (type
));
7034 if (TYPE_MAX_VALUE (type
)
7035 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
7037 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
7038 ggc_free (TYPE_MAX_VALUE (type
));
7040 if (TYPE_CACHED_VALUES_P (type
))
7041 ggc_free (TYPE_CACHED_VALUES (type
));
7048 struct type_hash
*h
;
7050 h
= ggc_alloc
<type_hash
> ();
7060 print_type_hash_statistics (void)
7062 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7063 (long) type_hash_table
->size (),
7064 (long) type_hash_table
->elements (),
7065 type_hash_table
->collisions ());
7068 /* Given two lists of types
7069 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7070 return 1 if the lists contain the same types in the same order.
7071 Also, the TREE_PURPOSEs must match. */
7074 type_list_equal (const_tree l1
, const_tree l2
)
7078 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7079 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7080 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7081 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7082 && (TREE_TYPE (TREE_PURPOSE (t1
))
7083 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7089 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7090 given by TYPE. If the argument list accepts variable arguments,
7091 then this function counts only the ordinary arguments. */
7094 type_num_arguments (const_tree fntype
)
7098 for (tree t
= TYPE_ARG_TYPES (fntype
); t
; t
= TREE_CHAIN (t
))
7099 /* If the function does not take a variable number of arguments,
7100 the last element in the list will have type `void'. */
7101 if (VOID_TYPE_P (TREE_VALUE (t
)))
7109 /* Return the type of the function TYPE's argument ARGNO if known.
7110 For vararg function's where ARGNO refers to one of the variadic
7111 arguments return null. Otherwise, return a void_type_node for
7112 out-of-bounds ARGNO. */
7115 type_argument_type (const_tree fntype
, unsigned argno
)
7117 /* Treat zero the same as an out-of-bounds argument number. */
7119 return void_type_node
;
7121 function_args_iterator iter
;
7125 FOREACH_FUNCTION_ARGS (fntype
, argtype
, iter
)
7127 /* A vararg function's argument list ends in a null. Otherwise,
7128 an ordinary function's argument list ends with void. Return
7129 null if ARGNO refers to a vararg argument, void_type_node if
7130 it's out of bounds, and the formal argument type otherwise. */
7134 if (i
== argno
|| VOID_TYPE_P (argtype
))
7143 /* Nonzero if integer constants T1 and T2
7144 represent the same constant value. */
7147 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7152 if (t1
== 0 || t2
== 0)
7155 STRIP_ANY_LOCATION_WRAPPER (t1
);
7156 STRIP_ANY_LOCATION_WRAPPER (t2
);
7158 if (TREE_CODE (t1
) == INTEGER_CST
7159 && TREE_CODE (t2
) == INTEGER_CST
7160 && wi::to_widest (t1
) == wi::to_widest (t2
))
7166 /* Return true if T is an INTEGER_CST whose numerical value (extended
7167 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7170 tree_fits_shwi_p (const_tree t
)
7172 return (t
!= NULL_TREE
7173 && TREE_CODE (t
) == INTEGER_CST
7174 && wi::fits_shwi_p (wi::to_widest (t
)));
7177 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7178 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
7181 tree_fits_poly_int64_p (const_tree t
)
7185 if (POLY_INT_CST_P (t
))
7187 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7188 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7192 return (TREE_CODE (t
) == INTEGER_CST
7193 && wi::fits_shwi_p (wi::to_widest (t
)));
7196 /* Return true if T is an INTEGER_CST whose numerical value (extended
7197 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7200 tree_fits_uhwi_p (const_tree t
)
7202 return (t
!= NULL_TREE
7203 && TREE_CODE (t
) == INTEGER_CST
7204 && wi::fits_uhwi_p (wi::to_widest (t
)));
7207 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7208 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7211 tree_fits_poly_uint64_p (const_tree t
)
7215 if (POLY_INT_CST_P (t
))
7217 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7218 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7222 return (TREE_CODE (t
) == INTEGER_CST
7223 && wi::fits_uhwi_p (wi::to_widest (t
)));
7226 /* T is an INTEGER_CST whose numerical value (extended according to
7227 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7231 tree_to_shwi (const_tree t
)
7233 gcc_assert (tree_fits_shwi_p (t
));
7234 return TREE_INT_CST_LOW (t
);
7237 /* T is an INTEGER_CST whose numerical value (extended according to
7238 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7241 unsigned HOST_WIDE_INT
7242 tree_to_uhwi (const_tree t
)
7244 gcc_assert (tree_fits_uhwi_p (t
));
7245 return TREE_INT_CST_LOW (t
);
7248 /* Return the most significant (sign) bit of T. */
7251 tree_int_cst_sign_bit (const_tree t
)
7253 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7255 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7258 /* Return an indication of the sign of the integer constant T.
7259 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7260 Note that -1 will never be returned if T's type is unsigned. */
7263 tree_int_cst_sgn (const_tree t
)
7265 if (wi::to_wide (t
) == 0)
7267 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7269 else if (wi::neg_p (wi::to_wide (t
)))
7275 /* Return the minimum number of bits needed to represent VALUE in a
7276 signed or unsigned type, UNSIGNEDP says which. */
7279 tree_int_cst_min_precision (tree value
, signop sgn
)
7281 /* If the value is negative, compute its negative minus 1. The latter
7282 adjustment is because the absolute value of the largest negative value
7283 is one larger than the largest positive value. This is equivalent to
7284 a bit-wise negation, so use that operation instead. */
7286 if (tree_int_cst_sgn (value
) < 0)
7287 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7289 /* Return the number of bits needed, taking into account the fact
7290 that we need one more bit for a signed than unsigned type.
7291 If value is 0 or -1, the minimum precision is 1 no matter
7292 whether unsignedp is true or false. */
7294 if (integer_zerop (value
))
7297 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7300 /* Return truthvalue of whether T1 is the same tree structure as T2.
7301 Return 1 if they are the same.
7302 Return 0 if they are understandably different.
7303 Return -1 if either contains tree structure not understood by
7307 simple_cst_equal (const_tree t1
, const_tree t2
)
7309 enum tree_code code1
, code2
;
7315 if (t1
== 0 || t2
== 0)
7318 /* For location wrappers to be the same, they must be at the same
7319 source location (and wrap the same thing). */
7320 if (location_wrapper_p (t1
) && location_wrapper_p (t2
))
7322 if (EXPR_LOCATION (t1
) != EXPR_LOCATION (t2
))
7324 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7327 code1
= TREE_CODE (t1
);
7328 code2
= TREE_CODE (t2
);
7330 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7332 if (CONVERT_EXPR_CODE_P (code2
)
7333 || code2
== NON_LVALUE_EXPR
)
7334 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7336 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7339 else if (CONVERT_EXPR_CODE_P (code2
)
7340 || code2
== NON_LVALUE_EXPR
)
7341 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7349 return wi::to_widest (t1
) == wi::to_widest (t2
);
7352 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7355 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7358 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7359 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7360 TREE_STRING_LENGTH (t1
)));
7364 unsigned HOST_WIDE_INT idx
;
7365 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7366 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7368 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7371 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7372 /* ??? Should we handle also fields here? */
7373 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7379 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7382 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7385 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7388 const_tree arg1
, arg2
;
7389 const_call_expr_arg_iterator iter1
, iter2
;
7390 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7391 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7393 arg1
= next_const_call_expr_arg (&iter1
),
7394 arg2
= next_const_call_expr_arg (&iter2
))
7396 cmp
= simple_cst_equal (arg1
, arg2
);
7400 return arg1
== arg2
;
7404 /* Special case: if either target is an unallocated VAR_DECL,
7405 it means that it's going to be unified with whatever the
7406 TARGET_EXPR is really supposed to initialize, so treat it
7407 as being equivalent to anything. */
7408 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7409 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7410 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7411 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7412 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7413 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7416 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7421 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7423 case WITH_CLEANUP_EXPR
:
7424 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7428 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7431 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7432 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7443 if (POLY_INT_CST_P (t1
))
7444 /* A false return means maybe_ne rather than known_ne. */
7445 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7446 TYPE_SIGN (TREE_TYPE (t1
))),
7447 poly_widest_int::from (poly_int_cst_value (t2
),
7448 TYPE_SIGN (TREE_TYPE (t2
))));
7452 /* This general rule works for most tree codes. All exceptions should be
7453 handled above. If this is a language-specific tree code, we can't
7454 trust what might be in the operand, so say we don't know
7456 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7459 switch (TREE_CODE_CLASS (code1
))
7463 case tcc_comparison
:
7464 case tcc_expression
:
7468 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7470 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7482 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7483 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7484 than U, respectively. */
7487 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7489 if (tree_int_cst_sgn (t
) < 0)
7491 else if (!tree_fits_uhwi_p (t
))
7493 else if (TREE_INT_CST_LOW (t
) == u
)
7495 else if (TREE_INT_CST_LOW (t
) < u
)
7501 /* Return true if SIZE represents a constant size that is in bounds of
7502 what the middle-end and the backend accepts (covering not more than
7503 half of the address-space). */
7506 valid_constant_size_p (const_tree size
)
7508 if (POLY_INT_CST_P (size
))
7510 if (TREE_OVERFLOW (size
))
7512 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7513 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7517 if (! tree_fits_uhwi_p (size
)
7518 || TREE_OVERFLOW (size
)
7519 || tree_int_cst_sign_bit (size
) != 0)
7524 /* Return the precision of the type, or for a complex or vector type the
7525 precision of the type of its elements. */
7528 element_precision (const_tree type
)
7531 type
= TREE_TYPE (type
);
7532 enum tree_code code
= TREE_CODE (type
);
7533 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7534 type
= TREE_TYPE (type
);
7536 return TYPE_PRECISION (type
);
7539 /* Return true if CODE represents an associative tree code. Otherwise
7542 associative_tree_code (enum tree_code code
)
7561 /* Return true if CODE represents a commutative tree code. Otherwise
7564 commutative_tree_code (enum tree_code code
)
7570 case MULT_HIGHPART_EXPR
:
7578 case UNORDERED_EXPR
:
7582 case TRUTH_AND_EXPR
:
7583 case TRUTH_XOR_EXPR
:
7585 case WIDEN_MULT_EXPR
:
7586 case VEC_WIDEN_MULT_HI_EXPR
:
7587 case VEC_WIDEN_MULT_LO_EXPR
:
7588 case VEC_WIDEN_MULT_EVEN_EXPR
:
7589 case VEC_WIDEN_MULT_ODD_EXPR
:
7598 /* Return true if CODE represents a ternary tree code for which the
7599 first two operands are commutative. Otherwise return false. */
7601 commutative_ternary_tree_code (enum tree_code code
)
7605 case WIDEN_MULT_PLUS_EXPR
:
7606 case WIDEN_MULT_MINUS_EXPR
:
7616 /* Returns true if CODE can overflow. */
7619 operation_can_overflow (enum tree_code code
)
7627 /* Can overflow in various ways. */
7629 case TRUNC_DIV_EXPR
:
7630 case EXACT_DIV_EXPR
:
7631 case FLOOR_DIV_EXPR
:
7633 /* For INT_MIN / -1. */
7640 /* These operators cannot overflow. */
7645 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7646 ftrapv doesn't generate trapping insns for CODE. */
7649 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7651 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7653 /* We don't generate instructions that trap on overflow for complex or vector
7655 if (!INTEGRAL_TYPE_P (type
))
7658 if (!TYPE_OVERFLOW_TRAPS (type
))
7668 /* These operators can overflow, and -ftrapv generates trapping code for
7671 case TRUNC_DIV_EXPR
:
7672 case EXACT_DIV_EXPR
:
7673 case FLOOR_DIV_EXPR
:
7676 /* These operators can overflow, but -ftrapv does not generate trapping
7680 /* These operators cannot overflow. */
7688 /* Generate a hash value for an expression. This can be used iteratively
7689 by passing a previous result as the HSTATE argument.
7691 This function is intended to produce the same hash for expressions which
7692 would compare equal using operand_equal_p. */
7694 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7697 enum tree_code code
;
7698 enum tree_code_class tclass
;
7700 if (t
== NULL_TREE
|| t
== error_mark_node
)
7702 hstate
.merge_hash (0);
7706 if (!(flags
& OEP_ADDRESS_OF
))
7709 code
= TREE_CODE (t
);
7713 /* Alas, constants aren't shared, so we can't rely on pointer
7716 hstate
.merge_hash (0);
7719 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7720 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7721 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7726 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7729 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7730 hstate
.merge_hash (val2
);
7735 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7736 hstate
.merge_hash (val2
);
7740 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7741 TREE_STRING_LENGTH (t
));
7744 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7745 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7749 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7750 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7751 unsigned int count
= vector_cst_encoded_nelts (t
);
7752 for (unsigned int i
= 0; i
< count
; ++i
)
7753 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7757 /* We can just compare by pointer. */
7758 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7760 case PLACEHOLDER_EXPR
:
7761 /* The node itself doesn't matter. */
7768 /* A list of expressions, for a CALL_EXPR or as the elements of a
7770 for (; t
; t
= TREE_CHAIN (t
))
7771 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7775 unsigned HOST_WIDE_INT idx
;
7777 flags
&= ~OEP_ADDRESS_OF
;
7778 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7780 inchash::add_expr (field
, hstate
, flags
);
7781 inchash::add_expr (value
, hstate
, flags
);
7785 case STATEMENT_LIST
:
7787 tree_stmt_iterator i
;
7788 for (i
= tsi_start (CONST_CAST_TREE (t
));
7789 !tsi_end_p (i
); tsi_next (&i
))
7790 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7794 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7795 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7797 case IDENTIFIER_NODE
:
7798 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
7801 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7802 Otherwise nodes that compare equal according to operand_equal_p might
7803 get different hash codes. However, don't do this for machine specific
7804 or front end builtins, since the function code is overloaded in those
7806 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7807 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7809 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7810 code
= TREE_CODE (t
);
7814 if (POLY_INT_CST_P (t
))
7816 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7817 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7820 tclass
= TREE_CODE_CLASS (code
);
7822 if (tclass
== tcc_declaration
)
7824 /* DECL's have a unique ID */
7825 hstate
.add_hwi (DECL_UID (t
));
7827 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7829 /* For comparisons that can be swapped, use the lower
7831 enum tree_code ccode
= swap_tree_comparison (code
);
7834 hstate
.add_object (ccode
);
7835 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7836 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7838 else if (CONVERT_EXPR_CODE_P (code
))
7840 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7842 enum tree_code ccode
= NOP_EXPR
;
7843 hstate
.add_object (ccode
);
7845 /* Don't hash the type, that can lead to having nodes which
7846 compare equal according to operand_equal_p, but which
7847 have different hash codes. Make sure to include signedness
7848 in the hash computation. */
7849 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7850 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7852 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7853 else if (code
== MEM_REF
7854 && (flags
& OEP_ADDRESS_OF
) != 0
7855 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7856 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7857 && integer_zerop (TREE_OPERAND (t
, 1)))
7858 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7860 /* Don't ICE on FE specific trees, or their arguments etc.
7861 during operand_equal_p hash verification. */
7862 else if (!IS_EXPR_CODE_CLASS (tclass
))
7863 gcc_assert (flags
& OEP_HASH_CHECK
);
7866 unsigned int sflags
= flags
;
7868 hstate
.add_object (code
);
7873 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7874 flags
|= OEP_ADDRESS_OF
;
7880 case TARGET_MEM_REF
:
7881 flags
&= ~OEP_ADDRESS_OF
;
7886 case ARRAY_RANGE_REF
:
7889 sflags
&= ~OEP_ADDRESS_OF
;
7893 flags
&= ~OEP_ADDRESS_OF
;
7896 case WIDEN_MULT_PLUS_EXPR
:
7897 case WIDEN_MULT_MINUS_EXPR
:
7899 /* The multiplication operands are commutative. */
7900 inchash::hash one
, two
;
7901 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7902 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7903 hstate
.add_commutative (one
, two
);
7904 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7909 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7910 hstate
.add_int (CALL_EXPR_IFN (t
));
7914 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7915 Usually different TARGET_EXPRs just should use
7916 different temporaries in their slots. */
7917 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7924 /* Don't hash the type, that can lead to having nodes which
7925 compare equal according to operand_equal_p, but which
7926 have different hash codes. */
7927 if (code
== NON_LVALUE_EXPR
)
7929 /* Make sure to include signness in the hash computation. */
7930 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7931 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7934 else if (commutative_tree_code (code
))
7936 /* It's a commutative expression. We want to hash it the same
7937 however it appears. We do this by first hashing both operands
7938 and then rehashing based on the order of their independent
7940 inchash::hash one
, two
;
7941 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7942 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7943 hstate
.add_commutative (one
, two
);
7946 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7947 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7948 i
== 0 ? flags
: sflags
);
7956 /* Constructors for pointer, array and function types.
7957 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7958 constructed by language-dependent code, not here.) */
7960 /* Construct, lay out and return the type of pointers to TO_TYPE with
7961 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7962 reference all of memory. If such a type has already been
7963 constructed, reuse it. */
7966 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7970 bool could_alias
= can_alias_all
;
7972 if (to_type
== error_mark_node
)
7973 return error_mark_node
;
7975 /* If the pointed-to type has the may_alias attribute set, force
7976 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7977 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7978 can_alias_all
= true;
7980 /* In some cases, languages will have things that aren't a POINTER_TYPE
7981 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7982 In that case, return that type without regard to the rest of our
7985 ??? This is a kludge, but consistent with the way this function has
7986 always operated and there doesn't seem to be a good way to avoid this
7988 if (TYPE_POINTER_TO (to_type
) != 0
7989 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7990 return TYPE_POINTER_TO (to_type
);
7992 /* First, if we already have a type for pointers to TO_TYPE and it's
7993 the proper mode, use it. */
7994 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7995 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7998 t
= make_node (POINTER_TYPE
);
8000 TREE_TYPE (t
) = to_type
;
8001 SET_TYPE_MODE (t
, mode
);
8002 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8003 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8004 TYPE_POINTER_TO (to_type
) = t
;
8006 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8007 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8008 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8009 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8011 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8014 /* Lay out the type. This function has many callers that are concerned
8015 with expression-construction, and this simplifies them all. */
8021 /* By default build pointers in ptr_mode. */
8024 build_pointer_type (tree to_type
)
8026 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8027 : TYPE_ADDR_SPACE (to_type
);
8028 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8029 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8032 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8035 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8039 bool could_alias
= can_alias_all
;
8041 if (to_type
== error_mark_node
)
8042 return error_mark_node
;
8044 /* If the pointed-to type has the may_alias attribute set, force
8045 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8046 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8047 can_alias_all
= true;
8049 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8050 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8051 In that case, return that type without regard to the rest of our
8054 ??? This is a kludge, but consistent with the way this function has
8055 always operated and there doesn't seem to be a good way to avoid this
8057 if (TYPE_REFERENCE_TO (to_type
) != 0
8058 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8059 return TYPE_REFERENCE_TO (to_type
);
8061 /* First, if we already have a type for pointers to TO_TYPE and it's
8062 the proper mode, use it. */
8063 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8064 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8067 t
= make_node (REFERENCE_TYPE
);
8069 TREE_TYPE (t
) = to_type
;
8070 SET_TYPE_MODE (t
, mode
);
8071 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8072 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8073 TYPE_REFERENCE_TO (to_type
) = t
;
8075 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8076 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8077 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8078 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8080 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8089 /* Build the node for the type of references-to-TO_TYPE by default
8093 build_reference_type (tree to_type
)
8095 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8096 : TYPE_ADDR_SPACE (to_type
);
8097 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8098 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8101 #define MAX_INT_CACHED_PREC \
8102 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8103 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8105 /* Builds a signed or unsigned integer type of precision PRECISION.
8106 Used for C bitfields whose precision does not match that of
8107 built-in target types. */
8109 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8115 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8117 if (precision
<= MAX_INT_CACHED_PREC
)
8119 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8124 itype
= make_node (INTEGER_TYPE
);
8125 TYPE_PRECISION (itype
) = precision
;
8128 fixup_unsigned_type (itype
);
8130 fixup_signed_type (itype
);
8134 inchash::hash hstate
;
8135 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8136 ret
= type_hash_canon (hstate
.end (), itype
);
8137 if (precision
<= MAX_INT_CACHED_PREC
)
8138 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8143 #define MAX_BOOL_CACHED_PREC \
8144 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8145 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8147 /* Builds a boolean type of precision PRECISION.
8148 Used for boolean vectors to choose proper vector element size. */
8150 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8154 if (precision
<= MAX_BOOL_CACHED_PREC
)
8156 type
= nonstandard_boolean_type_cache
[precision
];
8161 type
= make_node (BOOLEAN_TYPE
);
8162 TYPE_PRECISION (type
) = precision
;
8163 fixup_signed_type (type
);
8165 if (precision
<= MAX_INT_CACHED_PREC
)
8166 nonstandard_boolean_type_cache
[precision
] = type
;
8171 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8172 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8173 is true, reuse such a type that has already been constructed. */
8176 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8178 tree itype
= make_node (INTEGER_TYPE
);
8180 TREE_TYPE (itype
) = type
;
8182 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8183 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8185 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8186 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8187 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8188 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8189 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8190 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8191 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8196 if ((TYPE_MIN_VALUE (itype
)
8197 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8198 || (TYPE_MAX_VALUE (itype
)
8199 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8201 /* Since we cannot reliably merge this type, we need to compare it using
8202 structural equality checks. */
8203 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8207 hashval_t hash
= type_hash_canon_hash (itype
);
8208 itype
= type_hash_canon (hash
, itype
);
8213 /* Wrapper around build_range_type_1 with SHARED set to true. */
8216 build_range_type (tree type
, tree lowval
, tree highval
)
8218 return build_range_type_1 (type
, lowval
, highval
, true);
8221 /* Wrapper around build_range_type_1 with SHARED set to false. */
8224 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8226 return build_range_type_1 (type
, lowval
, highval
, false);
8229 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8230 MAXVAL should be the maximum value in the domain
8231 (one less than the length of the array).
8233 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8234 We don't enforce this limit, that is up to caller (e.g. language front end).
8235 The limit exists because the result is a signed type and we don't handle
8236 sizes that use more than one HOST_WIDE_INT. */
8239 build_index_type (tree maxval
)
8241 return build_range_type (sizetype
, size_zero_node
, maxval
);
8244 /* Return true if the debug information for TYPE, a subtype, should be emitted
8245 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8246 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8247 debug info and doesn't reflect the source code. */
8250 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8252 tree base_type
= TREE_TYPE (type
), low
, high
;
8254 /* Subrange types have a base type which is an integral type. */
8255 if (!INTEGRAL_TYPE_P (base_type
))
8258 /* Get the real bounds of the subtype. */
8259 if (lang_hooks
.types
.get_subrange_bounds
)
8260 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8263 low
= TYPE_MIN_VALUE (type
);
8264 high
= TYPE_MAX_VALUE (type
);
8267 /* If the type and its base type have the same representation and the same
8268 name, then the type is not a subrange but a copy of the base type. */
8269 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8270 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8271 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8272 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8273 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8274 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8284 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8285 and number of elements specified by the range of values of INDEX_TYPE.
8286 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8287 If SHARED is true, reuse such a type that has already been constructed. */
8290 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8295 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8297 error ("arrays of functions are not meaningful");
8298 elt_type
= integer_type_node
;
8301 t
= make_node (ARRAY_TYPE
);
8302 TREE_TYPE (t
) = elt_type
;
8303 TYPE_DOMAIN (t
) = index_type
;
8304 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8305 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8308 /* If the element type is incomplete at this point we get marked for
8309 structural equality. Do not record these types in the canonical
8311 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8316 hashval_t hash
= type_hash_canon_hash (t
);
8317 t
= type_hash_canon (hash
, t
);
8320 if (TYPE_CANONICAL (t
) == t
)
8322 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8323 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8325 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8326 else if (TYPE_CANONICAL (elt_type
) != elt_type
8327 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8329 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8331 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8332 typeless_storage
, shared
);
8338 /* Wrapper around build_array_type_1 with SHARED set to true. */
8341 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8343 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8346 /* Wrapper around build_array_type_1 with SHARED set to false. */
8349 build_nonshared_array_type (tree elt_type
, tree index_type
)
8351 return build_array_type_1 (elt_type
, index_type
, false, false);
8354 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8358 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8360 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8363 /* Recursively examines the array elements of TYPE, until a non-array
8364 element type is found. */
8367 strip_array_types (tree type
)
8369 while (TREE_CODE (type
) == ARRAY_TYPE
)
8370 type
= TREE_TYPE (type
);
8375 /* Computes the canonical argument types from the argument type list
8378 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8379 on entry to this function, or if any of the ARGTYPES are
8382 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8383 true on entry to this function, or if any of the ARGTYPES are
8386 Returns a canonical argument list, which may be ARGTYPES when the
8387 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8388 true) or would not differ from ARGTYPES. */
8391 maybe_canonicalize_argtypes (tree argtypes
,
8392 bool *any_structural_p
,
8393 bool *any_noncanonical_p
)
8396 bool any_noncanonical_argtypes_p
= false;
8398 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8400 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8401 /* Fail gracefully by stating that the type is structural. */
8402 *any_structural_p
= true;
8403 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8404 *any_structural_p
= true;
8405 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8406 || TREE_PURPOSE (arg
))
8407 /* If the argument has a default argument, we consider it
8408 non-canonical even though the type itself is canonical.
8409 That way, different variants of function and method types
8410 with default arguments will all point to the variant with
8411 no defaults as their canonical type. */
8412 any_noncanonical_argtypes_p
= true;
8415 if (*any_structural_p
)
8418 if (any_noncanonical_argtypes_p
)
8420 /* Build the canonical list of argument types. */
8421 tree canon_argtypes
= NULL_TREE
;
8422 bool is_void
= false;
8424 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8426 if (arg
== void_list_node
)
8429 canon_argtypes
= tree_cons (NULL_TREE
,
8430 TYPE_CANONICAL (TREE_VALUE (arg
)),
8434 canon_argtypes
= nreverse (canon_argtypes
);
8436 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8438 /* There is a non-canonical type. */
8439 *any_noncanonical_p
= true;
8440 return canon_argtypes
;
8443 /* The canonical argument types are the same as ARGTYPES. */
8447 /* Construct, lay out and return
8448 the type of functions returning type VALUE_TYPE
8449 given arguments of types ARG_TYPES.
8450 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8451 are data type nodes for the arguments of the function.
8452 If such a type has already been constructed, reuse it. */
8455 build_function_type (tree value_type
, tree arg_types
)
8458 inchash::hash hstate
;
8459 bool any_structural_p
, any_noncanonical_p
;
8460 tree canon_argtypes
;
8462 gcc_assert (arg_types
!= error_mark_node
);
8464 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8466 error ("function return type cannot be function");
8467 value_type
= integer_type_node
;
8470 /* Make a node of the sort we want. */
8471 t
= make_node (FUNCTION_TYPE
);
8472 TREE_TYPE (t
) = value_type
;
8473 TYPE_ARG_TYPES (t
) = arg_types
;
8475 /* If we already have such a type, use the old one. */
8476 hashval_t hash
= type_hash_canon_hash (t
);
8477 t
= type_hash_canon (hash
, t
);
8479 /* Set up the canonical type. */
8480 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8481 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8482 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8484 &any_noncanonical_p
);
8485 if (any_structural_p
)
8486 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8487 else if (any_noncanonical_p
)
8488 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8491 if (!COMPLETE_TYPE_P (t
))
8496 /* Build a function type. The RETURN_TYPE is the type returned by the
8497 function. If VAARGS is set, no void_type_node is appended to the
8498 list. ARGP must be always be terminated be a NULL_TREE. */
8501 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8505 t
= va_arg (argp
, tree
);
8506 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8507 args
= tree_cons (NULL_TREE
, t
, args
);
8512 if (args
!= NULL_TREE
)
8513 args
= nreverse (args
);
8514 gcc_assert (last
!= void_list_node
);
8516 else if (args
== NULL_TREE
)
8517 args
= void_list_node
;
8521 args
= nreverse (args
);
8522 TREE_CHAIN (last
) = void_list_node
;
8524 args
= build_function_type (return_type
, args
);
8529 /* Build a function type. The RETURN_TYPE is the type returned by the
8530 function. If additional arguments are provided, they are
8531 additional argument types. The list of argument types must always
8532 be terminated by NULL_TREE. */
8535 build_function_type_list (tree return_type
, ...)
8540 va_start (p
, return_type
);
8541 args
= build_function_type_list_1 (false, return_type
, p
);
8546 /* Build a variable argument function type. The RETURN_TYPE is the
8547 type returned by the function. If additional arguments are provided,
8548 they are additional argument types. The list of argument types must
8549 always be terminated by NULL_TREE. */
8552 build_varargs_function_type_list (tree return_type
, ...)
8557 va_start (p
, return_type
);
8558 args
= build_function_type_list_1 (true, return_type
, p
);
8564 /* Build a function type. RETURN_TYPE is the type returned by the
8565 function; VAARGS indicates whether the function takes varargs. The
8566 function takes N named arguments, the types of which are provided in
8570 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8574 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8576 for (i
= n
- 1; i
>= 0; i
--)
8577 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8579 return build_function_type (return_type
, t
);
8582 /* Build a function type. RETURN_TYPE is the type returned by the
8583 function. The function takes N named arguments, the types of which
8584 are provided in ARG_TYPES. */
8587 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8589 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8592 /* Build a variable argument function type. RETURN_TYPE is the type
8593 returned by the function. The function takes N named arguments, the
8594 types of which are provided in ARG_TYPES. */
8597 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8599 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8602 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8603 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8604 for the method. An implicit additional parameter (of type
8605 pointer-to-BASETYPE) is added to the ARGTYPES. */
8608 build_method_type_directly (tree basetype
,
8614 bool any_structural_p
, any_noncanonical_p
;
8615 tree canon_argtypes
;
8617 /* Make a node of the sort we want. */
8618 t
= make_node (METHOD_TYPE
);
8620 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8621 TREE_TYPE (t
) = rettype
;
8622 ptype
= build_pointer_type (basetype
);
8624 /* The actual arglist for this function includes a "hidden" argument
8625 which is "this". Put it into the list of argument types. */
8626 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8627 TYPE_ARG_TYPES (t
) = argtypes
;
8629 /* If we already have such a type, use the old one. */
8630 hashval_t hash
= type_hash_canon_hash (t
);
8631 t
= type_hash_canon (hash
, t
);
8633 /* Set up the canonical type. */
8635 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8636 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8638 = (TYPE_CANONICAL (basetype
) != basetype
8639 || TYPE_CANONICAL (rettype
) != rettype
);
8640 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8642 &any_noncanonical_p
);
8643 if (any_structural_p
)
8644 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8645 else if (any_noncanonical_p
)
8647 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8648 TYPE_CANONICAL (rettype
),
8650 if (!COMPLETE_TYPE_P (t
))
8656 /* Construct, lay out and return the type of methods belonging to class
8657 BASETYPE and whose arguments and values are described by TYPE.
8658 If that type exists already, reuse it.
8659 TYPE must be a FUNCTION_TYPE node. */
8662 build_method_type (tree basetype
, tree type
)
8664 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8666 return build_method_type_directly (basetype
,
8668 TYPE_ARG_TYPES (type
));
8671 /* Construct, lay out and return the type of offsets to a value
8672 of type TYPE, within an object of type BASETYPE.
8673 If a suitable offset type exists already, reuse it. */
8676 build_offset_type (tree basetype
, tree type
)
8680 /* Make a node of the sort we want. */
8681 t
= make_node (OFFSET_TYPE
);
8683 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8684 TREE_TYPE (t
) = type
;
8686 /* If we already have such a type, use the old one. */
8687 hashval_t hash
= type_hash_canon_hash (t
);
8688 t
= type_hash_canon (hash
, t
);
8690 if (!COMPLETE_TYPE_P (t
))
8693 if (TYPE_CANONICAL (t
) == t
)
8695 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8696 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8697 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8698 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8699 || TYPE_CANONICAL (type
) != type
)
8701 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8702 TYPE_CANONICAL (type
));
8708 /* Create a complex type whose components are COMPONENT_TYPE.
8710 If NAMED is true, the type is given a TYPE_NAME. We do not always
8711 do so because this creates a DECL node and thus make the DECL_UIDs
8712 dependent on the type canonicalization hashtable, which is GC-ed,
8713 so the DECL_UIDs would not be stable wrt garbage collection. */
8716 build_complex_type (tree component_type
, bool named
)
8718 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8719 || SCALAR_FLOAT_TYPE_P (component_type
)
8720 || FIXED_POINT_TYPE_P (component_type
));
8722 /* Make a node of the sort we want. */
8723 tree probe
= make_node (COMPLEX_TYPE
);
8725 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8727 /* If we already have such a type, use the old one. */
8728 hashval_t hash
= type_hash_canon_hash (probe
);
8729 tree t
= type_hash_canon (hash
, probe
);
8733 /* We created a new type. The hash insertion will have laid
8734 out the type. We need to check the canonicalization and
8735 maybe set the name. */
8736 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8738 && TYPE_CANONICAL (t
) == t
);
8740 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8741 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8742 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8744 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8746 /* We need to create a name, since complex is a fundamental type. */
8749 const char *name
= NULL
;
8751 if (TREE_TYPE (t
) == char_type_node
)
8752 name
= "complex char";
8753 else if (TREE_TYPE (t
) == signed_char_type_node
)
8754 name
= "complex signed char";
8755 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8756 name
= "complex unsigned char";
8757 else if (TREE_TYPE (t
) == short_integer_type_node
)
8758 name
= "complex short int";
8759 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8760 name
= "complex short unsigned int";
8761 else if (TREE_TYPE (t
) == integer_type_node
)
8762 name
= "complex int";
8763 else if (TREE_TYPE (t
) == unsigned_type_node
)
8764 name
= "complex unsigned int";
8765 else if (TREE_TYPE (t
) == long_integer_type_node
)
8766 name
= "complex long int";
8767 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8768 name
= "complex long unsigned int";
8769 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8770 name
= "complex long long int";
8771 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8772 name
= "complex long long unsigned int";
8775 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8776 get_identifier (name
), t
);
8780 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8783 /* If TYPE is a real or complex floating-point type and the target
8784 does not directly support arithmetic on TYPE then return the wider
8785 type to be used for arithmetic on TYPE. Otherwise, return
8789 excess_precision_type (tree type
)
8791 /* The target can give two different responses to the question of
8792 which excess precision mode it would like depending on whether we
8793 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8795 enum excess_precision_type requested_type
8796 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8797 ? EXCESS_PRECISION_TYPE_FAST
8798 : EXCESS_PRECISION_TYPE_STANDARD
);
8800 enum flt_eval_method target_flt_eval_method
8801 = targetm
.c
.excess_precision (requested_type
);
8803 /* The target should not ask for unpredictable float evaluation (though
8804 it might advertise that implicitly the evaluation is unpredictable,
8805 but we don't care about that here, it will have been reported
8806 elsewhere). If it does ask for unpredictable evaluation, we have
8807 nothing to do here. */
8808 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8810 /* Nothing to do. The target has asked for all types we know about
8811 to be computed with their native precision and range. */
8812 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8815 /* The target will promote this type in a target-dependent way, so excess
8816 precision ought to leave it alone. */
8817 if (targetm
.promoted_type (type
) != NULL_TREE
)
8820 machine_mode float16_type_mode
= (float16_type_node
8821 ? TYPE_MODE (float16_type_node
)
8823 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8824 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8826 switch (TREE_CODE (type
))
8830 machine_mode type_mode
= TYPE_MODE (type
);
8831 switch (target_flt_eval_method
)
8833 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8834 if (type_mode
== float16_type_mode
)
8835 return float_type_node
;
8837 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8838 if (type_mode
== float16_type_mode
8839 || type_mode
== float_type_mode
)
8840 return double_type_node
;
8842 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8843 if (type_mode
== float16_type_mode
8844 || type_mode
== float_type_mode
8845 || type_mode
== double_type_mode
)
8846 return long_double_type_node
;
8855 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8857 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8858 switch (target_flt_eval_method
)
8860 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8861 if (type_mode
== float16_type_mode
)
8862 return complex_float_type_node
;
8864 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8865 if (type_mode
== float16_type_mode
8866 || type_mode
== float_type_mode
)
8867 return complex_double_type_node
;
8869 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8870 if (type_mode
== float16_type_mode
8871 || type_mode
== float_type_mode
8872 || type_mode
== double_type_mode
)
8873 return complex_long_double_type_node
;
8887 /* Return OP, stripped of any conversions to wider types as much as is safe.
8888 Converting the value back to OP's type makes a value equivalent to OP.
8890 If FOR_TYPE is nonzero, we return a value which, if converted to
8891 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8893 OP must have integer, real or enumeral type. Pointers are not allowed!
8895 There are some cases where the obvious value we could return
8896 would regenerate to OP if converted to OP's type,
8897 but would not extend like OP to wider types.
8898 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8899 For example, if OP is (unsigned short)(signed char)-1,
8900 we avoid returning (signed char)-1 if FOR_TYPE is int,
8901 even though extending that to an unsigned short would regenerate OP,
8902 since the result of extending (signed char)-1 to (int)
8903 is different from (int) OP. */
8906 get_unwidened (tree op
, tree for_type
)
8908 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8909 tree type
= TREE_TYPE (op
);
8911 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8913 = (for_type
!= 0 && for_type
!= type
8914 && final_prec
> TYPE_PRECISION (type
)
8915 && TYPE_UNSIGNED (type
));
8918 while (CONVERT_EXPR_P (op
))
8922 /* TYPE_PRECISION on vector types has different meaning
8923 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8924 so avoid them here. */
8925 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8928 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8929 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8931 /* Truncations are many-one so cannot be removed.
8932 Unless we are later going to truncate down even farther. */
8934 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8937 /* See what's inside this conversion. If we decide to strip it,
8939 op
= TREE_OPERAND (op
, 0);
8941 /* If we have not stripped any zero-extensions (uns is 0),
8942 we can strip any kind of extension.
8943 If we have previously stripped a zero-extension,
8944 only zero-extensions can safely be stripped.
8945 Any extension can be stripped if the bits it would produce
8946 are all going to be discarded later by truncating to FOR_TYPE. */
8950 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8952 /* TYPE_UNSIGNED says whether this is a zero-extension.
8953 Let's avoid computing it if it does not affect WIN
8954 and if UNS will not be needed again. */
8956 || CONVERT_EXPR_P (op
))
8957 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8965 /* If we finally reach a constant see if it fits in sth smaller and
8966 in that case convert it. */
8967 if (TREE_CODE (win
) == INTEGER_CST
)
8969 tree wtype
= TREE_TYPE (win
);
8970 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8972 prec
= MAX (prec
, final_prec
);
8973 if (prec
< TYPE_PRECISION (wtype
))
8975 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8976 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8977 win
= fold_convert (t
, win
);
8984 /* Return OP or a simpler expression for a narrower value
8985 which can be sign-extended or zero-extended to give back OP.
8986 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8987 or 0 if the value should be sign-extended. */
8990 get_narrower (tree op
, int *unsignedp_ptr
)
8995 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8997 while (TREE_CODE (op
) == NOP_EXPR
)
9000 = (TYPE_PRECISION (TREE_TYPE (op
))
9001 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
9003 /* Truncations are many-one so cannot be removed. */
9007 /* See what's inside this conversion. If we decide to strip it,
9012 op
= TREE_OPERAND (op
, 0);
9013 /* An extension: the outermost one can be stripped,
9014 but remember whether it is zero or sign extension. */
9016 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9017 /* Otherwise, if a sign extension has been stripped,
9018 only sign extensions can now be stripped;
9019 if a zero extension has been stripped, only zero-extensions. */
9020 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9024 else /* bitschange == 0 */
9026 /* A change in nominal type can always be stripped, but we must
9027 preserve the unsignedness. */
9029 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9031 op
= TREE_OPERAND (op
, 0);
9032 /* Keep trying to narrow, but don't assign op to win if it
9033 would turn an integral type into something else. */
9034 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9041 if (TREE_CODE (op
) == COMPONENT_REF
9042 /* Since type_for_size always gives an integer type. */
9043 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9044 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9045 /* Ensure field is laid out already. */
9046 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9047 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9049 unsigned HOST_WIDE_INT innerprec
9050 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9051 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9052 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9053 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9055 /* We can get this structure field in a narrower type that fits it,
9056 but the resulting extension to its nominal type (a fullword type)
9057 must satisfy the same conditions as for other extensions.
9059 Do this only for fields that are aligned (not bit-fields),
9060 because when bit-field insns will be used there is no
9061 advantage in doing this. */
9063 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9064 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9065 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9069 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9070 win
= fold_convert (type
, op
);
9074 *unsignedp_ptr
= uns
;
9078 /* Return true if integer constant C has a value that is permissible
9079 for TYPE, an integral type. */
9082 int_fits_type_p (const_tree c
, const_tree type
)
9084 tree type_low_bound
, type_high_bound
;
9085 bool ok_for_low_bound
, ok_for_high_bound
;
9086 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9088 /* Non-standard boolean types can have arbitrary precision but various
9089 transformations assume that they can only take values 0 and +/-1. */
9090 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9091 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
9094 type_low_bound
= TYPE_MIN_VALUE (type
);
9095 type_high_bound
= TYPE_MAX_VALUE (type
);
9097 /* If at least one bound of the type is a constant integer, we can check
9098 ourselves and maybe make a decision. If no such decision is possible, but
9099 this type is a subtype, try checking against that. Otherwise, use
9100 fits_to_tree_p, which checks against the precision.
9102 Compute the status for each possibly constant bound, and return if we see
9103 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9104 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9105 for "constant known to fit". */
9107 /* Check if c >= type_low_bound. */
9108 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9110 if (tree_int_cst_lt (c
, type_low_bound
))
9112 ok_for_low_bound
= true;
9115 ok_for_low_bound
= false;
9117 /* Check if c <= type_high_bound. */
9118 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9120 if (tree_int_cst_lt (type_high_bound
, c
))
9122 ok_for_high_bound
= true;
9125 ok_for_high_bound
= false;
9127 /* If the constant fits both bounds, the result is known. */
9128 if (ok_for_low_bound
&& ok_for_high_bound
)
9131 /* Perform some generic filtering which may allow making a decision
9132 even if the bounds are not constant. First, negative integers
9133 never fit in unsigned types, */
9134 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
9137 /* Second, narrower types always fit in wider ones. */
9138 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9141 /* Third, unsigned integers with top bit set never fit signed types. */
9142 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9144 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
9145 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9147 /* When a tree_cst is converted to a wide-int, the precision
9148 is taken from the type. However, if the precision of the
9149 mode underneath the type is smaller than that, it is
9150 possible that the value will not fit. The test below
9151 fails if any bit is set between the sign bit of the
9152 underlying mode and the top bit of the type. */
9153 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
9156 else if (wi::neg_p (wi::to_wide (c
)))
9160 /* If we haven't been able to decide at this point, there nothing more we
9161 can check ourselves here. Look at the base type if we have one and it
9162 has the same precision. */
9163 if (TREE_CODE (type
) == INTEGER_TYPE
9164 && TREE_TYPE (type
) != 0
9165 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9167 type
= TREE_TYPE (type
);
9171 /* Or to fits_to_tree_p, if nothing else. */
9172 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
9175 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9176 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9177 represented (assuming two's-complement arithmetic) within the bit
9178 precision of the type are returned instead. */
9181 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9183 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9184 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9185 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
9188 if (TYPE_UNSIGNED (type
))
9189 mpz_set_ui (min
, 0);
9192 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9193 wi::to_mpz (mn
, min
, SIGNED
);
9197 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9198 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9199 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9202 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9203 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9207 /* Return true if VAR is an automatic variable defined in function FN. */
9210 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9212 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9213 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9214 || TREE_CODE (var
) == PARM_DECL
)
9215 && ! TREE_STATIC (var
))
9216 || TREE_CODE (var
) == LABEL_DECL
9217 || TREE_CODE (var
) == RESULT_DECL
));
9220 /* Subprogram of following function. Called by walk_tree.
9222 Return *TP if it is an automatic variable or parameter of the
9223 function passed in as DATA. */
9226 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9228 tree fn
= (tree
) data
;
9233 else if (DECL_P (*tp
)
9234 && auto_var_in_fn_p (*tp
, fn
))
9240 /* Returns true if T is, contains, or refers to a type with variable
9241 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9242 arguments, but not the return type. If FN is nonzero, only return
9243 true if a modifier of the type or position of FN is a variable or
9244 parameter inside FN.
9246 This concept is more general than that of C99 'variably modified types':
9247 in C99, a struct type is never variably modified because a VLA may not
9248 appear as a structure member. However, in GNU C code like:
9250 struct S { int i[f()]; };
9252 is valid, and other languages may define similar constructs. */
9255 variably_modified_type_p (tree type
, tree fn
)
9259 /* Test if T is either variable (if FN is zero) or an expression containing
9260 a variable in FN. If TYPE isn't gimplified, return true also if
9261 gimplify_one_sizepos would gimplify the expression into a local
9263 #define RETURN_TRUE_IF_VAR(T) \
9264 do { tree _t = (T); \
9265 if (_t != NULL_TREE \
9266 && _t != error_mark_node \
9267 && !CONSTANT_CLASS_P (_t) \
9268 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9270 || (!TYPE_SIZES_GIMPLIFIED (type) \
9271 && (TREE_CODE (_t) != VAR_DECL \
9272 && !CONTAINS_PLACEHOLDER_P (_t))) \
9273 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9274 return true; } while (0)
9276 if (type
== error_mark_node
)
9279 /* If TYPE itself has variable size, it is variably modified. */
9280 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9281 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9283 switch (TREE_CODE (type
))
9286 case REFERENCE_TYPE
:
9288 /* Ada can have pointer types refering to themselves indirectly. */
9289 if (TREE_VISITED (type
))
9291 TREE_VISITED (type
) = true;
9292 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9294 TREE_VISITED (type
) = false;
9297 TREE_VISITED (type
) = false;
9302 /* If TYPE is a function type, it is variably modified if the
9303 return type is variably modified. */
9304 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9310 case FIXED_POINT_TYPE
:
9313 /* Scalar types are variably modified if their end points
9315 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9316 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9321 case QUAL_UNION_TYPE
:
9322 /* We can't see if any of the fields are variably-modified by the
9323 definition we normally use, since that would produce infinite
9324 recursion via pointers. */
9325 /* This is variably modified if some field's type is. */
9326 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9327 if (TREE_CODE (t
) == FIELD_DECL
)
9329 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9330 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9331 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9333 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9334 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9339 /* Do not call ourselves to avoid infinite recursion. This is
9340 variably modified if the element type is. */
9341 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9342 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9349 /* The current language may have other cases to check, but in general,
9350 all other types are not variably modified. */
9351 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9353 #undef RETURN_TRUE_IF_VAR
9356 /* Given a DECL or TYPE, return the scope in which it was declared, or
9357 NULL_TREE if there is no containing scope. */
9360 get_containing_scope (const_tree t
)
9362 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9365 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9368 get_ultimate_context (const_tree decl
)
9370 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9372 if (TREE_CODE (decl
) == BLOCK
)
9373 decl
= BLOCK_SUPERCONTEXT (decl
);
9375 decl
= get_containing_scope (decl
);
9380 /* Return the innermost context enclosing DECL that is
9381 a FUNCTION_DECL, or zero if none. */
9384 decl_function_context (const_tree decl
)
9388 if (TREE_CODE (decl
) == ERROR_MARK
)
9391 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9392 where we look up the function at runtime. Such functions always take
9393 a first argument of type 'pointer to real context'.
9395 C++ should really be fixed to use DECL_CONTEXT for the real context,
9396 and use something else for the "virtual context". */
9397 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9400 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9402 context
= DECL_CONTEXT (decl
);
9404 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9406 if (TREE_CODE (context
) == BLOCK
)
9407 context
= BLOCK_SUPERCONTEXT (context
);
9409 context
= get_containing_scope (context
);
9415 /* Return the innermost context enclosing DECL that is
9416 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9417 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9420 decl_type_context (const_tree decl
)
9422 tree context
= DECL_CONTEXT (decl
);
9425 switch (TREE_CODE (context
))
9427 case NAMESPACE_DECL
:
9428 case TRANSLATION_UNIT_DECL
:
9433 case QUAL_UNION_TYPE
:
9438 context
= DECL_CONTEXT (context
);
9442 context
= BLOCK_SUPERCONTEXT (context
);
9452 /* CALL is a CALL_EXPR. Return the declaration for the function
9453 called, or NULL_TREE if the called function cannot be
9457 get_callee_fndecl (const_tree call
)
9461 if (call
== error_mark_node
)
9462 return error_mark_node
;
9464 /* It's invalid to call this function with anything but a
9466 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9468 /* The first operand to the CALL is the address of the function
9470 addr
= CALL_EXPR_FN (call
);
9472 /* If there is no function, return early. */
9473 if (addr
== NULL_TREE
)
9478 /* If this is a readonly function pointer, extract its initial value. */
9479 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9480 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9481 && DECL_INITIAL (addr
))
9482 addr
= DECL_INITIAL (addr
);
9484 /* If the address is just `&f' for some function `f', then we know
9485 that `f' is being called. */
9486 if (TREE_CODE (addr
) == ADDR_EXPR
9487 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9488 return TREE_OPERAND (addr
, 0);
9490 /* We couldn't figure out what was being called. */
9494 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9495 return the associated function code, otherwise return CFN_LAST. */
9498 get_call_combined_fn (const_tree call
)
9500 /* It's invalid to call this function with anything but a CALL_EXPR. */
9501 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9503 if (!CALL_EXPR_FN (call
))
9504 return as_combined_fn (CALL_EXPR_IFN (call
));
9506 tree fndecl
= get_callee_fndecl (call
);
9507 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9508 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9513 /* Comparator of indices based on tree_node_counts. */
9516 tree_nodes_cmp (const void *p1
, const void *p2
)
9518 const unsigned *n1
= (const unsigned *)p1
;
9519 const unsigned *n2
= (const unsigned *)p2
;
9521 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9524 /* Comparator of indices based on tree_code_counts. */
9527 tree_codes_cmp (const void *p1
, const void *p2
)
9529 const unsigned *n1
= (const unsigned *)p1
;
9530 const unsigned *n2
= (const unsigned *)p2
;
9532 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9535 #define TREE_MEM_USAGE_SPACES 40
9537 /* Print debugging information about tree nodes generated during the compile,
9538 and any language-specific information. */
9541 dump_tree_statistics (void)
9543 if (GATHER_STATISTICS
)
9545 uint64_t total_nodes
, total_bytes
;
9546 fprintf (stderr
, "\nKind Nodes Bytes\n");
9547 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9548 total_nodes
= total_bytes
= 0;
9551 auto_vec
<unsigned> indices (all_kinds
);
9552 for (unsigned i
= 0; i
< all_kinds
; i
++)
9553 indices
.quick_push (i
);
9554 indices
.qsort (tree_nodes_cmp
);
9556 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9558 unsigned j
= indices
[i
];
9559 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9560 tree_node_kind_names
[i
], SIZE_AMOUNT (tree_node_counts
[j
]),
9561 SIZE_AMOUNT (tree_node_sizes
[j
]));
9562 total_nodes
+= tree_node_counts
[j
];
9563 total_bytes
+= tree_node_sizes
[j
];
9565 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9566 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9567 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9568 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9572 fprintf (stderr
, "Code Nodes\n");
9573 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9575 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9576 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9577 indices
.quick_push (i
);
9578 indices
.qsort (tree_codes_cmp
);
9580 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9582 unsigned j
= indices
[i
];
9583 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9584 get_tree_code_name ((enum tree_code
) j
),
9585 SIZE_AMOUNT (tree_code_counts
[j
]));
9587 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9588 fprintf (stderr
, "\n");
9589 ssanames_print_statistics ();
9590 fprintf (stderr
, "\n");
9591 phinodes_print_statistics ();
9592 fprintf (stderr
, "\n");
9596 fprintf (stderr
, "(No per-node statistics)\n");
9598 print_type_hash_statistics ();
9599 print_debug_expr_statistics ();
9600 print_value_expr_statistics ();
9601 lang_hooks
.print_statistics ();
9604 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9606 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9609 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9611 /* This relies on the raw feedback's top 4 bits being zero. */
9612 #define FEEDBACK(X) ((X) * 0x04c11db7)
9613 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9614 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9615 static const unsigned syndromes
[16] =
9617 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9618 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9619 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9620 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9625 value
<<= (32 - bytes
* 8);
9626 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9628 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9630 chksum
= (chksum
<< 4) ^ feedback
;
9636 /* Generate a crc32 of a string. */
9639 crc32_string (unsigned chksum
, const char *string
)
9642 chksum
= crc32_byte (chksum
, *string
);
9647 /* P is a string that will be used in a symbol. Mask out any characters
9648 that are not valid in that context. */
9651 clean_symbol_name (char *p
)
9655 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9658 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9665 /* For anonymous aggregate types, we need some sort of name to
9666 hold on to. In practice, this should not appear, but it should
9667 not be harmful if it does. */
9669 anon_aggrname_p(const_tree id_node
)
9671 #ifndef NO_DOT_IN_LABEL
9672 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9673 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9674 #else /* NO_DOT_IN_LABEL */
9675 #ifndef NO_DOLLAR_IN_LABEL
9676 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9677 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9678 #else /* NO_DOLLAR_IN_LABEL */
9679 #define ANON_AGGRNAME_PREFIX "__anon_"
9680 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9681 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9682 #endif /* NO_DOLLAR_IN_LABEL */
9683 #endif /* NO_DOT_IN_LABEL */
9686 /* Return a format for an anonymous aggregate name. */
9688 anon_aggrname_format()
9690 #ifndef NO_DOT_IN_LABEL
9692 #else /* NO_DOT_IN_LABEL */
9693 #ifndef NO_DOLLAR_IN_LABEL
9695 #else /* NO_DOLLAR_IN_LABEL */
9697 #endif /* NO_DOLLAR_IN_LABEL */
9698 #endif /* NO_DOT_IN_LABEL */
9701 /* Generate a name for a special-purpose function.
9702 The generated name may need to be unique across the whole link.
9703 Changes to this function may also require corresponding changes to
9704 xstrdup_mask_random.
9705 TYPE is some string to identify the purpose of this function to the
9706 linker or collect2; it must start with an uppercase letter,
9708 I - for constructors
9710 N - for C++ anonymous namespaces
9711 F - for DWARF unwind frame information. */
9714 get_file_function_name (const char *type
)
9720 /* If we already have a name we know to be unique, just use that. */
9721 if (first_global_object_name
)
9722 p
= q
= ASTRDUP (first_global_object_name
);
9723 /* If the target is handling the constructors/destructors, they
9724 will be local to this file and the name is only necessary for
9726 We also assign sub_I and sub_D sufixes to constructors called from
9727 the global static constructors. These are always local. */
9728 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9729 || (strncmp (type
, "sub_", 4) == 0
9730 && (type
[4] == 'I' || type
[4] == 'D')))
9732 const char *file
= main_input_filename
;
9734 file
= LOCATION_FILE (input_location
);
9735 /* Just use the file's basename, because the full pathname
9736 might be quite long. */
9737 p
= q
= ASTRDUP (lbasename (file
));
9741 /* Otherwise, the name must be unique across the entire link.
9742 We don't have anything that we know to be unique to this translation
9743 unit, so use what we do have and throw in some randomness. */
9745 const char *name
= weak_global_object_name
;
9746 const char *file
= main_input_filename
;
9751 file
= LOCATION_FILE (input_location
);
9753 len
= strlen (file
);
9754 q
= (char *) alloca (9 + 19 + len
+ 1);
9755 memcpy (q
, file
, len
+ 1);
9757 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9758 crc32_string (0, name
), get_random_seed (false));
9763 clean_symbol_name (q
);
9764 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9767 /* Set up the name of the file-level functions we may need.
9768 Use a global object (which is already required to be unique over
9769 the program) rather than the file name (which imposes extra
9771 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9773 return get_identifier (buf
);
9776 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9778 /* Complain that the tree code of NODE does not match the expected 0
9779 terminated list of trailing codes. The trailing code list can be
9780 empty, for a more vague error message. FILE, LINE, and FUNCTION
9781 are of the caller. */
9784 tree_check_failed (const_tree node
, const char *file
,
9785 int line
, const char *function
, ...)
9789 unsigned length
= 0;
9790 enum tree_code code
;
9792 va_start (args
, function
);
9793 while ((code
= (enum tree_code
) va_arg (args
, int)))
9794 length
+= 4 + strlen (get_tree_code_name (code
));
9799 va_start (args
, function
);
9800 length
+= strlen ("expected ");
9801 buffer
= tmp
= (char *) alloca (length
);
9803 while ((code
= (enum tree_code
) va_arg (args
, int)))
9805 const char *prefix
= length
? " or " : "expected ";
9807 strcpy (tmp
+ length
, prefix
);
9808 length
+= strlen (prefix
);
9809 strcpy (tmp
+ length
, get_tree_code_name (code
));
9810 length
+= strlen (get_tree_code_name (code
));
9815 buffer
= "unexpected node";
9817 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9818 buffer
, get_tree_code_name (TREE_CODE (node
)),
9819 function
, trim_filename (file
), line
);
9822 /* Complain that the tree code of NODE does match the expected 0
9823 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9827 tree_not_check_failed (const_tree node
, const char *file
,
9828 int line
, const char *function
, ...)
9832 unsigned length
= 0;
9833 enum tree_code code
;
9835 va_start (args
, function
);
9836 while ((code
= (enum tree_code
) va_arg (args
, int)))
9837 length
+= 4 + strlen (get_tree_code_name (code
));
9839 va_start (args
, function
);
9840 buffer
= (char *) alloca (length
);
9842 while ((code
= (enum tree_code
) va_arg (args
, int)))
9846 strcpy (buffer
+ length
, " or ");
9849 strcpy (buffer
+ length
, get_tree_code_name (code
));
9850 length
+= strlen (get_tree_code_name (code
));
9854 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9855 buffer
, get_tree_code_name (TREE_CODE (node
)),
9856 function
, trim_filename (file
), line
);
9859 /* Similar to tree_check_failed, except that we check for a class of tree
9860 code, given in CL. */
9863 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9864 const char *file
, int line
, const char *function
)
9867 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9868 TREE_CODE_CLASS_STRING (cl
),
9869 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9870 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9873 /* Similar to tree_check_failed, except that instead of specifying a
9874 dozen codes, use the knowledge that they're all sequential. */
9877 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9878 const char *function
, enum tree_code c1
,
9882 unsigned length
= 0;
9885 for (c
= c1
; c
<= c2
; ++c
)
9886 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9888 length
+= strlen ("expected ");
9889 buffer
= (char *) alloca (length
);
9892 for (c
= c1
; c
<= c2
; ++c
)
9894 const char *prefix
= length
? " or " : "expected ";
9896 strcpy (buffer
+ length
, prefix
);
9897 length
+= strlen (prefix
);
9898 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9899 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9902 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9903 buffer
, get_tree_code_name (TREE_CODE (node
)),
9904 function
, trim_filename (file
), line
);
9908 /* Similar to tree_check_failed, except that we check that a tree does
9909 not have the specified code, given in CL. */
9912 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9913 const char *file
, int line
, const char *function
)
9916 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9917 TREE_CODE_CLASS_STRING (cl
),
9918 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9919 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9923 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9926 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9927 const char *function
, enum omp_clause_code code
)
9929 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9930 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9931 function
, trim_filename (file
), line
);
9935 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9938 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9939 const char *function
, enum omp_clause_code c1
,
9940 enum omp_clause_code c2
)
9943 unsigned length
= 0;
9946 for (c
= c1
; c
<= c2
; ++c
)
9947 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9949 length
+= strlen ("expected ");
9950 buffer
= (char *) alloca (length
);
9953 for (c
= c1
; c
<= c2
; ++c
)
9955 const char *prefix
= length
? " or " : "expected ";
9957 strcpy (buffer
+ length
, prefix
);
9958 length
+= strlen (prefix
);
9959 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9960 length
+= strlen (omp_clause_code_name
[c
]);
9963 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9964 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9965 function
, trim_filename (file
), line
);
9969 #undef DEFTREESTRUCT
9970 #define DEFTREESTRUCT(VAL, NAME) NAME,
9972 static const char *ts_enum_names
[] = {
9973 #include "treestruct.def"
9975 #undef DEFTREESTRUCT
9977 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9979 /* Similar to tree_class_check_failed, except that we check for
9980 whether CODE contains the tree structure identified by EN. */
9983 tree_contains_struct_check_failed (const_tree node
,
9984 const enum tree_node_structure_enum en
,
9985 const char *file
, int line
,
9986 const char *function
)
9989 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9991 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9995 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9996 (dynamically sized) vector. */
9999 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10000 const char *function
)
10003 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
10004 idx
+ 1, len
, function
, trim_filename (file
), line
);
10007 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
10008 (dynamically sized) vector. */
10011 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
10012 const char *function
)
10015 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
10016 idx
+ 1, len
, function
, trim_filename (file
), line
);
10019 /* Similar to above, except that the check is for the bounds of the operand
10020 vector of an expression node EXP. */
10023 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
10024 int line
, const char *function
)
10026 enum tree_code code
= TREE_CODE (exp
);
10028 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
10029 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
10030 function
, trim_filename (file
), line
);
10033 /* Similar to above, except that the check is for the number of
10034 operands of an OMP_CLAUSE node. */
10037 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
10038 int line
, const char *function
)
10041 ("tree check: accessed operand %d of omp_clause %s with %d operands "
10042 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
10043 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
10044 trim_filename (file
), line
);
10046 #endif /* ENABLE_TREE_CHECKING */
10048 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
10049 and mapped to the machine mode MODE. Initialize its fields and build
10050 the information necessary for debugging output. */
10053 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
10056 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
10058 t
= make_node (VECTOR_TYPE
);
10059 TREE_TYPE (t
) = mv_innertype
;
10060 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
10061 SET_TYPE_MODE (t
, mode
);
10063 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
10064 SET_TYPE_STRUCTURAL_EQUALITY (t
);
10065 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
10066 || mode
!= VOIDmode
)
10067 && !VECTOR_BOOLEAN_TYPE_P (t
))
10069 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10073 hashval_t hash
= type_hash_canon_hash (t
);
10074 t
= type_hash_canon (hash
, t
);
10076 /* We have built a main variant, based on the main variant of the
10077 inner type. Use it to build the variant we return. */
10078 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10079 && TREE_TYPE (t
) != innertype
)
10080 return build_type_attribute_qual_variant (t
,
10081 TYPE_ATTRIBUTES (innertype
),
10082 TYPE_QUALS (innertype
));
10088 make_or_reuse_type (unsigned size
, int unsignedp
)
10092 if (size
== INT_TYPE_SIZE
)
10093 return unsignedp
? unsigned_type_node
: integer_type_node
;
10094 if (size
== CHAR_TYPE_SIZE
)
10095 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10096 if (size
== SHORT_TYPE_SIZE
)
10097 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10098 if (size
== LONG_TYPE_SIZE
)
10099 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10100 if (size
== LONG_LONG_TYPE_SIZE
)
10101 return (unsignedp
? long_long_unsigned_type_node
10102 : long_long_integer_type_node
);
10104 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10105 if (size
== int_n_data
[i
].bitsize
10106 && int_n_enabled_p
[i
])
10107 return (unsignedp
? int_n_trees
[i
].unsigned_type
10108 : int_n_trees
[i
].signed_type
);
10111 return make_unsigned_type (size
);
10113 return make_signed_type (size
);
10116 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10119 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10123 if (size
== SHORT_FRACT_TYPE_SIZE
)
10124 return unsignedp
? sat_unsigned_short_fract_type_node
10125 : sat_short_fract_type_node
;
10126 if (size
== FRACT_TYPE_SIZE
)
10127 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10128 if (size
== LONG_FRACT_TYPE_SIZE
)
10129 return unsignedp
? sat_unsigned_long_fract_type_node
10130 : sat_long_fract_type_node
;
10131 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10132 return unsignedp
? sat_unsigned_long_long_fract_type_node
10133 : sat_long_long_fract_type_node
;
10137 if (size
== SHORT_FRACT_TYPE_SIZE
)
10138 return unsignedp
? unsigned_short_fract_type_node
10139 : short_fract_type_node
;
10140 if (size
== FRACT_TYPE_SIZE
)
10141 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10142 if (size
== LONG_FRACT_TYPE_SIZE
)
10143 return unsignedp
? unsigned_long_fract_type_node
10144 : long_fract_type_node
;
10145 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10146 return unsignedp
? unsigned_long_long_fract_type_node
10147 : long_long_fract_type_node
;
10150 return make_fract_type (size
, unsignedp
, satp
);
10153 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10156 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10160 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10161 return unsignedp
? sat_unsigned_short_accum_type_node
10162 : sat_short_accum_type_node
;
10163 if (size
== ACCUM_TYPE_SIZE
)
10164 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10165 if (size
== LONG_ACCUM_TYPE_SIZE
)
10166 return unsignedp
? sat_unsigned_long_accum_type_node
10167 : sat_long_accum_type_node
;
10168 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10169 return unsignedp
? sat_unsigned_long_long_accum_type_node
10170 : sat_long_long_accum_type_node
;
10174 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10175 return unsignedp
? unsigned_short_accum_type_node
10176 : short_accum_type_node
;
10177 if (size
== ACCUM_TYPE_SIZE
)
10178 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10179 if (size
== LONG_ACCUM_TYPE_SIZE
)
10180 return unsignedp
? unsigned_long_accum_type_node
10181 : long_accum_type_node
;
10182 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10183 return unsignedp
? unsigned_long_long_accum_type_node
10184 : long_long_accum_type_node
;
10187 return make_accum_type (size
, unsignedp
, satp
);
10191 /* Create an atomic variant node for TYPE. This routine is called
10192 during initialization of data types to create the 5 basic atomic
10193 types. The generic build_variant_type function requires these to
10194 already be set up in order to function properly, so cannot be
10195 called from there. If ALIGN is non-zero, then ensure alignment is
10196 overridden to this value. */
10199 build_atomic_base (tree type
, unsigned int align
)
10203 /* Make sure its not already registered. */
10204 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10207 t
= build_variant_type_copy (type
);
10208 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10211 SET_TYPE_ALIGN (t
, align
);
10216 /* Information about the _FloatN and _FloatNx types. This must be in
10217 the same order as the corresponding TI_* enum values. */
10218 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10230 /* Create nodes for all integer types (and error_mark_node) using the sizes
10231 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10234 build_common_tree_nodes (bool signed_char
)
10238 error_mark_node
= make_node (ERROR_MARK
);
10239 TREE_TYPE (error_mark_node
) = error_mark_node
;
10241 initialize_sizetypes ();
10243 /* Define both `signed char' and `unsigned char'. */
10244 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10245 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10246 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10247 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10249 /* Define `char', which is like either `signed char' or `unsigned char'
10250 but not the same as either. */
10253 ? make_signed_type (CHAR_TYPE_SIZE
)
10254 : make_unsigned_type (CHAR_TYPE_SIZE
));
10255 TYPE_STRING_FLAG (char_type_node
) = 1;
10257 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10258 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10259 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10260 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10261 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10262 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10263 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10264 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10266 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10268 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10269 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10271 if (int_n_enabled_p
[i
])
10273 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10274 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10278 /* Define a boolean type. This type only represents boolean values but
10279 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10280 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10281 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10282 TYPE_PRECISION (boolean_type_node
) = 1;
10283 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10285 /* Define what type to use for size_t. */
10286 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10287 size_type_node
= unsigned_type_node
;
10288 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10289 size_type_node
= long_unsigned_type_node
;
10290 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10291 size_type_node
= long_long_unsigned_type_node
;
10292 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10293 size_type_node
= short_unsigned_type_node
;
10298 size_type_node
= NULL_TREE
;
10299 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10300 if (int_n_enabled_p
[i
])
10303 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10305 if (strcmp (name
, SIZE_TYPE
) == 0)
10307 size_type_node
= int_n_trees
[i
].unsigned_type
;
10310 if (size_type_node
== NULL_TREE
)
10311 gcc_unreachable ();
10314 /* Define what type to use for ptrdiff_t. */
10315 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10316 ptrdiff_type_node
= integer_type_node
;
10317 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10318 ptrdiff_type_node
= long_integer_type_node
;
10319 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10320 ptrdiff_type_node
= long_long_integer_type_node
;
10321 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10322 ptrdiff_type_node
= short_integer_type_node
;
10325 ptrdiff_type_node
= NULL_TREE
;
10326 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10327 if (int_n_enabled_p
[i
])
10330 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10331 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
10332 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10334 if (ptrdiff_type_node
== NULL_TREE
)
10335 gcc_unreachable ();
10338 /* Fill in the rest of the sized types. Reuse existing type nodes
10340 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10341 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10342 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10343 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10344 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10346 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10347 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10348 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10349 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10350 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10352 /* Don't call build_qualified type for atomics. That routine does
10353 special processing for atomics, and until they are initialized
10354 it's better not to make that call.
10356 Check to see if there is a target override for atomic types. */
10358 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10359 targetm
.atomic_align_for_mode (QImode
));
10360 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10361 targetm
.atomic_align_for_mode (HImode
));
10362 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10363 targetm
.atomic_align_for_mode (SImode
));
10364 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10365 targetm
.atomic_align_for_mode (DImode
));
10366 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10367 targetm
.atomic_align_for_mode (TImode
));
10369 access_public_node
= get_identifier ("public");
10370 access_protected_node
= get_identifier ("protected");
10371 access_private_node
= get_identifier ("private");
10373 /* Define these next since types below may used them. */
10374 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10375 integer_one_node
= build_int_cst (integer_type_node
, 1);
10376 integer_three_node
= build_int_cst (integer_type_node
, 3);
10377 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10379 size_zero_node
= size_int (0);
10380 size_one_node
= size_int (1);
10381 bitsize_zero_node
= bitsize_int (0);
10382 bitsize_one_node
= bitsize_int (1);
10383 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10385 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10386 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10388 void_type_node
= make_node (VOID_TYPE
);
10389 layout_type (void_type_node
);
10391 /* We are not going to have real types in C with less than byte alignment,
10392 so we might as well not have any types that claim to have it. */
10393 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10394 TYPE_USER_ALIGN (void_type_node
) = 0;
10396 void_node
= make_node (VOID_CST
);
10397 TREE_TYPE (void_node
) = void_type_node
;
10399 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10400 layout_type (TREE_TYPE (null_pointer_node
));
10402 ptr_type_node
= build_pointer_type (void_type_node
);
10403 const_ptr_type_node
10404 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10405 for (unsigned i
= 0;
10406 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10408 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10410 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10412 float_type_node
= make_node (REAL_TYPE
);
10413 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10414 layout_type (float_type_node
);
10416 double_type_node
= make_node (REAL_TYPE
);
10417 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10418 layout_type (double_type_node
);
10420 long_double_type_node
= make_node (REAL_TYPE
);
10421 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10422 layout_type (long_double_type_node
);
10424 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10426 int n
= floatn_nx_types
[i
].n
;
10427 bool extended
= floatn_nx_types
[i
].extended
;
10428 scalar_float_mode mode
;
10429 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10431 int precision
= GET_MODE_PRECISION (mode
);
10432 /* Work around the rs6000 KFmode having precision 113 not
10434 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10435 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10436 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10438 gcc_assert (min_precision
== n
);
10439 if (precision
< min_precision
)
10440 precision
= min_precision
;
10441 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10442 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10443 layout_type (FLOATN_NX_TYPE_NODE (i
));
10444 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10447 float_ptr_type_node
= build_pointer_type (float_type_node
);
10448 double_ptr_type_node
= build_pointer_type (double_type_node
);
10449 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10450 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10452 /* Fixed size integer types. */
10453 uint16_type_node
= make_or_reuse_type (16, 1);
10454 uint32_type_node
= make_or_reuse_type (32, 1);
10455 uint64_type_node
= make_or_reuse_type (64, 1);
10457 /* Decimal float types. */
10458 dfloat32_type_node
= make_node (REAL_TYPE
);
10459 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10460 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10461 layout_type (dfloat32_type_node
);
10462 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10464 dfloat64_type_node
= make_node (REAL_TYPE
);
10465 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10466 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10467 layout_type (dfloat64_type_node
);
10468 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10470 dfloat128_type_node
= make_node (REAL_TYPE
);
10471 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10472 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10473 layout_type (dfloat128_type_node
);
10474 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10476 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10477 complex_float_type_node
= build_complex_type (float_type_node
, true);
10478 complex_double_type_node
= build_complex_type (double_type_node
, true);
10479 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10482 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10484 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10485 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10486 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10489 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10490 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10491 sat_ ## KIND ## _type_node = \
10492 make_sat_signed_ ## KIND ## _type (SIZE); \
10493 sat_unsigned_ ## KIND ## _type_node = \
10494 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10495 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10496 unsigned_ ## KIND ## _type_node = \
10497 make_unsigned_ ## KIND ## _type (SIZE);
10499 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10500 sat_ ## WIDTH ## KIND ## _type_node = \
10501 make_sat_signed_ ## KIND ## _type (SIZE); \
10502 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10503 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10504 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10505 unsigned_ ## WIDTH ## KIND ## _type_node = \
10506 make_unsigned_ ## KIND ## _type (SIZE);
10508 /* Make fixed-point type nodes based on four different widths. */
10509 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10510 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10511 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10512 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10513 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10515 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10516 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10517 NAME ## _type_node = \
10518 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10519 u ## NAME ## _type_node = \
10520 make_or_reuse_unsigned_ ## KIND ## _type \
10521 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10522 sat_ ## NAME ## _type_node = \
10523 make_or_reuse_sat_signed_ ## KIND ## _type \
10524 (GET_MODE_BITSIZE (MODE ## mode)); \
10525 sat_u ## NAME ## _type_node = \
10526 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10527 (GET_MODE_BITSIZE (U ## MODE ## mode));
10529 /* Fixed-point type and mode nodes. */
10530 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10531 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10532 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10533 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10534 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10535 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10536 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10537 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10538 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10539 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10540 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10543 tree t
= targetm
.build_builtin_va_list ();
10545 /* Many back-ends define record types without setting TYPE_NAME.
10546 If we copied the record type here, we'd keep the original
10547 record type without a name. This breaks name mangling. So,
10548 don't copy record types and let c_common_nodes_and_builtins()
10549 declare the type to be __builtin_va_list. */
10550 if (TREE_CODE (t
) != RECORD_TYPE
)
10551 t
= build_variant_type_copy (t
);
10553 va_list_type_node
= t
;
10557 /* Modify DECL for given flags.
10558 TM_PURE attribute is set only on types, so the function will modify
10559 DECL's type when ECF_TM_PURE is used. */
10562 set_call_expr_flags (tree decl
, int flags
)
10564 if (flags
& ECF_NOTHROW
)
10565 TREE_NOTHROW (decl
) = 1;
10566 if (flags
& ECF_CONST
)
10567 TREE_READONLY (decl
) = 1;
10568 if (flags
& ECF_PURE
)
10569 DECL_PURE_P (decl
) = 1;
10570 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10571 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10572 if (flags
& ECF_NOVOPS
)
10573 DECL_IS_NOVOPS (decl
) = 1;
10574 if (flags
& ECF_NORETURN
)
10575 TREE_THIS_VOLATILE (decl
) = 1;
10576 if (flags
& ECF_MALLOC
)
10577 DECL_IS_MALLOC (decl
) = 1;
10578 if (flags
& ECF_RETURNS_TWICE
)
10579 DECL_IS_RETURNS_TWICE (decl
) = 1;
10580 if (flags
& ECF_LEAF
)
10581 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10582 NULL
, DECL_ATTRIBUTES (decl
));
10583 if (flags
& ECF_COLD
)
10584 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10585 NULL
, DECL_ATTRIBUTES (decl
));
10586 if (flags
& ECF_RET1
)
10587 DECL_ATTRIBUTES (decl
)
10588 = tree_cons (get_identifier ("fn spec"),
10589 build_tree_list (NULL_TREE
, build_string (1, "1")),
10590 DECL_ATTRIBUTES (decl
));
10591 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10592 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10593 /* Looping const or pure is implied by noreturn.
10594 There is currently no way to declare looping const or looping pure alone. */
10595 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10596 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10600 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10603 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10604 const char *library_name
, int ecf_flags
)
10608 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10609 library_name
, NULL_TREE
);
10610 set_call_expr_flags (decl
, ecf_flags
);
10612 set_builtin_decl (code
, decl
, true);
10615 /* Call this function after instantiating all builtins that the language
10616 front end cares about. This will build the rest of the builtins
10617 and internal functions that are relied upon by the tree optimizers and
10621 build_common_builtin_nodes (void)
10626 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10627 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10629 ftype
= build_function_type (void_type_node
, void_list_node
);
10630 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10631 local_define_builtin ("__builtin_unreachable", ftype
,
10632 BUILT_IN_UNREACHABLE
,
10633 "__builtin_unreachable",
10634 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10635 | ECF_CONST
| ECF_COLD
);
10636 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10637 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10639 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10642 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10643 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10645 ftype
= build_function_type_list (ptr_type_node
,
10646 ptr_type_node
, const_ptr_type_node
,
10647 size_type_node
, NULL_TREE
);
10649 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10650 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10651 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10652 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10653 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10654 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10657 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10659 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10660 const_ptr_type_node
, size_type_node
,
10662 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10663 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10666 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10668 ftype
= build_function_type_list (ptr_type_node
,
10669 ptr_type_node
, integer_type_node
,
10670 size_type_node
, NULL_TREE
);
10671 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10672 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10675 /* If we're checking the stack, `alloca' can throw. */
10676 const int alloca_flags
10677 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10679 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10681 ftype
= build_function_type_list (ptr_type_node
,
10682 size_type_node
, NULL_TREE
);
10683 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10684 "alloca", alloca_flags
);
10687 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10688 size_type_node
, NULL_TREE
);
10689 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10690 BUILT_IN_ALLOCA_WITH_ALIGN
,
10691 "__builtin_alloca_with_align",
10694 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10695 size_type_node
, size_type_node
, NULL_TREE
);
10696 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10697 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10698 "__builtin_alloca_with_align_and_max",
10701 ftype
= build_function_type_list (void_type_node
,
10702 ptr_type_node
, ptr_type_node
,
10703 ptr_type_node
, NULL_TREE
);
10704 local_define_builtin ("__builtin_init_trampoline", ftype
,
10705 BUILT_IN_INIT_TRAMPOLINE
,
10706 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10707 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10708 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10709 "__builtin_init_heap_trampoline",
10710 ECF_NOTHROW
| ECF_LEAF
);
10711 local_define_builtin ("__builtin_init_descriptor", ftype
,
10712 BUILT_IN_INIT_DESCRIPTOR
,
10713 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10715 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10716 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10717 BUILT_IN_ADJUST_TRAMPOLINE
,
10718 "__builtin_adjust_trampoline",
10719 ECF_CONST
| ECF_NOTHROW
);
10720 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10721 BUILT_IN_ADJUST_DESCRIPTOR
,
10722 "__builtin_adjust_descriptor",
10723 ECF_CONST
| ECF_NOTHROW
);
10725 ftype
= build_function_type_list (void_type_node
,
10726 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10727 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10728 BUILT_IN_NONLOCAL_GOTO
,
10729 "__builtin_nonlocal_goto",
10730 ECF_NORETURN
| ECF_NOTHROW
);
10732 ftype
= build_function_type_list (void_type_node
,
10733 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10734 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10735 BUILT_IN_SETJMP_SETUP
,
10736 "__builtin_setjmp_setup", ECF_NOTHROW
);
10738 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10739 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10740 BUILT_IN_SETJMP_RECEIVER
,
10741 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10743 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10744 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10745 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10747 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10748 local_define_builtin ("__builtin_stack_restore", ftype
,
10749 BUILT_IN_STACK_RESTORE
,
10750 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10752 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10753 const_ptr_type_node
, size_type_node
,
10755 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10756 "__builtin_memcmp_eq",
10757 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10759 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10760 "__builtin_strncmp_eq",
10761 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10763 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10764 "__builtin_strcmp_eq",
10765 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10767 /* If there's a possibility that we might use the ARM EABI, build the
10768 alternate __cxa_end_cleanup node used to resume from C++. */
10769 if (targetm
.arm_eabi_unwinder
)
10771 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10772 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10773 BUILT_IN_CXA_END_CLEANUP
,
10774 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10777 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10778 local_define_builtin ("__builtin_unwind_resume", ftype
,
10779 BUILT_IN_UNWIND_RESUME
,
10780 ((targetm_common
.except_unwind_info (&global_options
)
10782 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10785 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10787 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10789 local_define_builtin ("__builtin_return_address", ftype
,
10790 BUILT_IN_RETURN_ADDRESS
,
10791 "__builtin_return_address",
10795 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10796 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10798 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10799 ptr_type_node
, NULL_TREE
);
10800 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10801 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10802 BUILT_IN_PROFILE_FUNC_ENTER
,
10803 "__cyg_profile_func_enter", 0);
10804 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10805 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10806 BUILT_IN_PROFILE_FUNC_EXIT
,
10807 "__cyg_profile_func_exit", 0);
10810 /* The exception object and filter values from the runtime. The argument
10811 must be zero before exception lowering, i.e. from the front end. After
10812 exception lowering, it will be the region number for the exception
10813 landing pad. These functions are PURE instead of CONST to prevent
10814 them from being hoisted past the exception edge that will initialize
10815 its value in the landing pad. */
10816 ftype
= build_function_type_list (ptr_type_node
,
10817 integer_type_node
, NULL_TREE
);
10818 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10819 /* Only use TM_PURE if we have TM language support. */
10820 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10821 ecf_flags
|= ECF_TM_PURE
;
10822 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10823 "__builtin_eh_pointer", ecf_flags
);
10825 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10826 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10827 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10828 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10830 ftype
= build_function_type_list (void_type_node
,
10831 integer_type_node
, integer_type_node
,
10833 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10834 BUILT_IN_EH_COPY_VALUES
,
10835 "__builtin_eh_copy_values", ECF_NOTHROW
);
10837 /* Complex multiplication and division. These are handled as builtins
10838 rather than optabs because emit_library_call_value doesn't support
10839 complex. Further, we can do slightly better with folding these
10840 beasties if the real and complex parts of the arguments are separate. */
10844 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10846 char mode_name_buf
[4], *q
;
10848 enum built_in_function mcode
, dcode
;
10849 tree type
, inner_type
;
10850 const char *prefix
= "__";
10852 if (targetm
.libfunc_gnu_prefix
)
10855 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10858 inner_type
= TREE_TYPE (type
);
10860 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10861 inner_type
, inner_type
, NULL_TREE
);
10863 mcode
= ((enum built_in_function
)
10864 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10865 dcode
= ((enum built_in_function
)
10866 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10868 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10872 /* For -ftrapping-math these should throw from a former
10873 -fnon-call-exception stmt. */
10874 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10876 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10877 built_in_names
[mcode
],
10878 ECF_CONST
| ECF_LEAF
);
10880 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10882 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10883 built_in_names
[dcode
],
10884 ECF_CONST
| ECF_LEAF
);
10888 init_internal_fns ();
10891 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10894 If we requested a pointer to a vector, build up the pointers that
10895 we stripped off while looking for the inner type. Similarly for
10896 return values from functions.
10898 The argument TYPE is the top of the chain, and BOTTOM is the
10899 new type which we will point to. */
10902 reconstruct_complex_type (tree type
, tree bottom
)
10906 if (TREE_CODE (type
) == POINTER_TYPE
)
10908 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10909 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10910 TYPE_REF_CAN_ALIAS_ALL (type
));
10912 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10914 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10915 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10916 TYPE_REF_CAN_ALIAS_ALL (type
));
10918 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10920 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10921 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10923 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10925 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10926 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10928 else if (TREE_CODE (type
) == METHOD_TYPE
)
10930 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10931 /* The build_method_type_directly() routine prepends 'this' to argument list,
10932 so we must compensate by getting rid of it. */
10934 = build_method_type_directly
10935 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10937 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10939 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10941 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10942 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10947 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10948 TYPE_QUALS (type
));
10951 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10954 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10957 unsigned int bitsize
;
10959 switch (GET_MODE_CLASS (mode
))
10961 case MODE_VECTOR_BOOL
:
10962 case MODE_VECTOR_INT
:
10963 case MODE_VECTOR_FLOAT
:
10964 case MODE_VECTOR_FRACT
:
10965 case MODE_VECTOR_UFRACT
:
10966 case MODE_VECTOR_ACCUM
:
10967 case MODE_VECTOR_UACCUM
:
10968 nunits
= GET_MODE_NUNITS (mode
);
10972 /* Check that there are no leftover bits. */
10973 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10974 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10975 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10979 gcc_unreachable ();
10982 return make_vector_type (innertype
, nunits
, mode
);
10985 /* Similarly, but takes the inner type and number of units, which must be
10989 build_vector_type (tree innertype
, poly_int64 nunits
)
10991 return make_vector_type (innertype
, nunits
, VOIDmode
);
10994 /* Build truth vector with specified length and number of units. */
10997 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
10999 machine_mode mask_mode
11000 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
11003 if (mask_mode
== BLKmode
)
11004 vsize
= vector_size
* BITS_PER_UNIT
;
11006 vsize
= GET_MODE_BITSIZE (mask_mode
);
11008 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
11010 tree bool_type
= build_nonstandard_boolean_type (esize
);
11012 return make_vector_type (bool_type
, nunits
, mask_mode
);
11015 /* Returns a vector type corresponding to a comparison of VECTYPE. */
11018 build_same_sized_truth_vector_type (tree vectype
)
11020 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
11023 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
11025 if (known_eq (size
, 0U))
11026 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
11028 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
11031 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
11034 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
11036 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
11038 /* We always build the non-opaque variant before the opaque one,
11039 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
11040 cand
= TYPE_NEXT_VARIANT (t
);
11042 && TYPE_VECTOR_OPAQUE (cand
)
11043 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
11045 /* Othewise build a variant type and make sure to queue it after
11046 the non-opaque type. */
11047 cand
= build_distinct_type_copy (t
);
11048 TYPE_VECTOR_OPAQUE (cand
) = true;
11049 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
11050 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
11051 TYPE_NEXT_VARIANT (t
) = cand
;
11052 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
11056 /* Return the value of element I of VECTOR_CST T as a wide_int. */
11059 vector_cst_int_elt (const_tree t
, unsigned int i
)
11061 /* First handle elements that are directly encoded. */
11062 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11063 if (i
< encoded_nelts
)
11064 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
11066 /* Identify the pattern that contains element I and work out the index of
11067 the last encoded element for that pattern. */
11068 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11069 unsigned int pattern
= i
% npatterns
;
11070 unsigned int count
= i
/ npatterns
;
11071 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11073 /* If there are no steps, the final encoded value is the right one. */
11074 if (!VECTOR_CST_STEPPED_P (t
))
11075 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
11077 /* Otherwise work out the value from the last two encoded elements. */
11078 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
11079 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
11080 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
11081 return wi::to_wide (v2
) + (count
- 2) * diff
;
11084 /* Return the value of element I of VECTOR_CST T. */
11087 vector_cst_elt (const_tree t
, unsigned int i
)
11089 /* First handle elements that are directly encoded. */
11090 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
11091 if (i
< encoded_nelts
)
11092 return VECTOR_CST_ENCODED_ELT (t
, i
);
11094 /* If there are no steps, the final encoded value is the right one. */
11095 if (!VECTOR_CST_STEPPED_P (t
))
11097 /* Identify the pattern that contains element I and work out the index of
11098 the last encoded element for that pattern. */
11099 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
11100 unsigned int pattern
= i
% npatterns
;
11101 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
11102 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
11105 /* Otherwise work out the value from the last two encoded elements. */
11106 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
11107 vector_cst_int_elt (t
, i
));
11110 /* Given an initializer INIT, return TRUE if INIT is zero or some
11111 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
11112 null, set *NONZERO if and only if INIT is known not to be all
11113 zeros. The combination of return value of false and *NONZERO
11114 false implies that INIT may but need not be all zeros. Other
11115 combinations indicate definitive answers. */
11118 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
11124 /* Conservatively clear NONZERO and set it only if INIT is definitely
11130 unsigned HOST_WIDE_INT off
= 0;
11132 switch (TREE_CODE (init
))
11135 if (integer_zerop (init
))
11142 /* ??? Note that this is not correct for C4X float formats. There,
11143 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
11144 negative exponent. */
11145 if (real_zerop (init
)
11146 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
11153 if (fixed_zerop (init
))
11160 if (integer_zerop (init
)
11161 || (real_zerop (init
)
11162 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
11163 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
11170 if (VECTOR_CST_NPATTERNS (init
) == 1
11171 && VECTOR_CST_DUPLICATE_P (init
)
11172 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
11180 if (TREE_CLOBBER_P (init
))
11183 unsigned HOST_WIDE_INT idx
;
11186 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
11187 if (!initializer_zerop (elt
, nonzero
))
11195 tree arg
= TREE_OPERAND (init
, 0);
11196 if (TREE_CODE (arg
) != ADDR_EXPR
)
11198 tree offset
= TREE_OPERAND (init
, 1);
11199 if (TREE_CODE (offset
) != INTEGER_CST
11200 || !tree_fits_uhwi_p (offset
))
11202 off
= tree_to_uhwi (offset
);
11205 arg
= TREE_OPERAND (arg
, 0);
11206 if (TREE_CODE (arg
) != STRING_CST
)
11210 /* Fall through. */
11214 gcc_assert (off
<= INT_MAX
);
11217 int n
= TREE_STRING_LENGTH (init
);
11221 /* We need to loop through all elements to handle cases like
11222 "\0" and "\0foobar". */
11223 for (i
= 0; i
< n
; ++i
)
11224 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11238 /* Return true if EXPR is an initializer expression in which every element
11239 is a constant that is numerically equal to 0 or 1. The elements do not
11240 need to be equal to each other. */
11243 initializer_each_zero_or_onep (const_tree expr
)
11245 STRIP_ANY_LOCATION_WRAPPER (expr
);
11247 switch (TREE_CODE (expr
))
11250 return integer_zerop (expr
) || integer_onep (expr
);
11253 return real_zerop (expr
) || real_onep (expr
);
11257 unsigned HOST_WIDE_INT nelts
= vector_cst_encoded_nelts (expr
);
11258 if (VECTOR_CST_STEPPED_P (expr
)
11259 && !TYPE_VECTOR_SUBPARTS (TREE_TYPE (expr
)).is_constant (&nelts
))
11262 for (unsigned int i
= 0; i
< nelts
; ++i
)
11264 tree elt
= vector_cst_elt (expr
, i
);
11265 if (!initializer_each_zero_or_onep (elt
))
11277 /* Check if vector VEC consists of all the equal elements and
11278 that the number of elements corresponds to the type of VEC.
11279 The function returns first element of the vector
11280 or NULL_TREE if the vector is not uniform. */
11282 uniform_vector_p (const_tree vec
)
11285 unsigned HOST_WIDE_INT i
, nelts
;
11287 if (vec
== NULL_TREE
)
11290 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11292 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11293 return TREE_OPERAND (vec
, 0);
11295 else if (TREE_CODE (vec
) == VECTOR_CST
)
11297 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11298 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11302 else if (TREE_CODE (vec
) == CONSTRUCTOR
11303 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11305 first
= error_mark_node
;
11307 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11314 if (!operand_equal_p (first
, t
, 0))
11326 /* If the argument is INTEGER_CST, return it. If the argument is vector
11327 with all elements the same INTEGER_CST, return that INTEGER_CST. Otherwise
11329 Look through location wrappers. */
11332 uniform_integer_cst_p (tree t
)
11334 STRIP_ANY_LOCATION_WRAPPER (t
);
11336 if (TREE_CODE (t
) == INTEGER_CST
)
11339 if (VECTOR_TYPE_P (TREE_TYPE (t
)))
11341 t
= uniform_vector_p (t
);
11342 if (t
&& TREE_CODE (t
) == INTEGER_CST
)
11349 /* If VECTOR_CST T has a single nonzero element, return the index of that
11350 element, otherwise return -1. */
11353 single_nonzero_element (const_tree t
)
11355 unsigned HOST_WIDE_INT nelts
;
11356 unsigned int repeat_nelts
;
11357 if (VECTOR_CST_NELTS (t
).is_constant (&nelts
))
11358 repeat_nelts
= nelts
;
11359 else if (VECTOR_CST_NELTS_PER_PATTERN (t
) == 2)
11361 nelts
= vector_cst_encoded_nelts (t
);
11362 repeat_nelts
= VECTOR_CST_NPATTERNS (t
);
11368 for (unsigned int i
= 0; i
< nelts
; ++i
)
11370 tree elt
= vector_cst_elt (t
, i
);
11371 if (!integer_zerop (elt
) && !real_zerop (elt
))
11373 if (res
>= 0 || i
>= repeat_nelts
)
11381 /* Build an empty statement at location LOC. */
11384 build_empty_stmt (location_t loc
)
11386 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11387 SET_EXPR_LOCATION (t
, loc
);
11392 /* Build an OpenMP clause with code CODE. LOC is the location of the
11396 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11401 length
= omp_clause_num_ops
[code
];
11402 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11404 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11406 t
= (tree
) ggc_internal_alloc (size
);
11407 memset (t
, 0, size
);
11408 TREE_SET_CODE (t
, OMP_CLAUSE
);
11409 OMP_CLAUSE_SET_CODE (t
, code
);
11410 OMP_CLAUSE_LOCATION (t
) = loc
;
11415 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11416 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11417 Except for the CODE and operand count field, other storage for the
11418 object is initialized to zeros. */
11421 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11424 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11426 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11427 gcc_assert (len
>= 1);
11429 record_node_allocation_statistics (code
, length
);
11431 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11433 TREE_SET_CODE (t
, code
);
11435 /* Can't use TREE_OPERAND to store the length because if checking is
11436 enabled, it will try to check the length before we store it. :-P */
11437 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11442 /* Helper function for build_call_* functions; build a CALL_EXPR with
11443 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11444 the argument slots. */
11447 build_call_1 (tree return_type
, tree fn
, int nargs
)
11451 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11452 TREE_TYPE (t
) = return_type
;
11453 CALL_EXPR_FN (t
) = fn
;
11454 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11459 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11460 FN and a null static chain slot. NARGS is the number of call arguments
11461 which are specified as "..." arguments. */
11464 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11468 va_start (args
, nargs
);
11469 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11474 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11475 FN and a null static chain slot. NARGS is the number of call arguments
11476 which are specified as a va_list ARGS. */
11479 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11484 t
= build_call_1 (return_type
, fn
, nargs
);
11485 for (i
= 0; i
< nargs
; i
++)
11486 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11487 process_call_operands (t
);
11491 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11492 FN and a null static chain slot. NARGS is the number of call arguments
11493 which are specified as a tree array ARGS. */
11496 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11497 int nargs
, const tree
*args
)
11502 t
= build_call_1 (return_type
, fn
, nargs
);
11503 for (i
= 0; i
< nargs
; i
++)
11504 CALL_EXPR_ARG (t
, i
) = args
[i
];
11505 process_call_operands (t
);
11506 SET_EXPR_LOCATION (t
, loc
);
11510 /* Like build_call_array, but takes a vec. */
11513 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11518 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11519 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11520 CALL_EXPR_ARG (ret
, ix
) = t
;
11521 process_call_operands (ret
);
11525 /* Conveniently construct a function call expression. FNDECL names the
11526 function to be called and N arguments are passed in the array
11530 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11532 tree fntype
= TREE_TYPE (fndecl
);
11533 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11535 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11538 /* Conveniently construct a function call expression. FNDECL names the
11539 function to be called and the arguments are passed in the vector
11543 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11545 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11546 vec_safe_address (vec
));
11550 /* Conveniently construct a function call expression. FNDECL names the
11551 function to be called, N is the number of arguments, and the "..."
11552 parameters are the argument expressions. */
11555 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11558 tree
*argarray
= XALLOCAVEC (tree
, n
);
11562 for (i
= 0; i
< n
; i
++)
11563 argarray
[i
] = va_arg (ap
, tree
);
11565 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11568 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11569 varargs macros aren't supported by all bootstrap compilers. */
11572 build_call_expr (tree fndecl
, int n
, ...)
11575 tree
*argarray
= XALLOCAVEC (tree
, n
);
11579 for (i
= 0; i
< n
; i
++)
11580 argarray
[i
] = va_arg (ap
, tree
);
11582 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11585 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11586 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11587 It will get gimplified later into an ordinary internal function. */
11590 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11591 tree type
, int n
, const tree
*args
)
11593 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11594 for (int i
= 0; i
< n
; ++i
)
11595 CALL_EXPR_ARG (t
, i
) = args
[i
];
11596 SET_EXPR_LOCATION (t
, loc
);
11597 CALL_EXPR_IFN (t
) = ifn
;
11601 /* Build internal call expression. This is just like CALL_EXPR, except
11602 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11603 internal function. */
11606 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11607 tree type
, int n
, ...)
11610 tree
*argarray
= XALLOCAVEC (tree
, n
);
11614 for (i
= 0; i
< n
; i
++)
11615 argarray
[i
] = va_arg (ap
, tree
);
11617 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11620 /* Return a function call to FN, if the target is guaranteed to support it,
11623 N is the number of arguments, passed in the "...", and TYPE is the
11624 type of the return value. */
11627 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11631 tree
*argarray
= XALLOCAVEC (tree
, n
);
11635 for (i
= 0; i
< n
; i
++)
11636 argarray
[i
] = va_arg (ap
, tree
);
11638 if (internal_fn_p (fn
))
11640 internal_fn ifn
= as_internal_fn (fn
);
11641 if (direct_internal_fn_p (ifn
))
11643 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11644 if (!direct_internal_fn_supported_p (ifn
, types
,
11645 OPTIMIZE_FOR_BOTH
))
11648 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11652 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11655 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11659 /* Return a function call to the appropriate builtin alloca variant.
11661 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11662 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11663 bound for SIZE in case it is not a fixed value. */
11666 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11670 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11672 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11674 else if (align
> 0)
11676 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11677 return build_call_expr (t
, 2, size
, size_int (align
));
11681 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11682 return build_call_expr (t
, 1, size
);
11686 /* Create a new constant string literal consisting of elements of type
11687 ELTYPE and return a tree node representing char* pointer to it as
11688 an ADDR_EXPR (ARRAY_REF (ELTYPE, ...)). The STRING_CST value is
11689 the LEN bytes at STR (the representation of the string, which may
11693 build_string_literal (int len
, const char *str
,
11694 tree eltype
/* = char_type_node */)
11696 tree t
= build_string (len
, str
);
11697 tree index
= build_index_type (size_int (len
- 1));
11698 eltype
= build_type_variant (eltype
, 1, 0);
11699 tree type
= build_array_type (eltype
, index
);
11700 TREE_TYPE (t
) = type
;
11701 TREE_CONSTANT (t
) = 1;
11702 TREE_READONLY (t
) = 1;
11703 TREE_STATIC (t
) = 1;
11705 type
= build_pointer_type (eltype
);
11706 t
= build1 (ADDR_EXPR
, type
,
11707 build4 (ARRAY_REF
, eltype
,
11708 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11714 /* Return true if T (assumed to be a DECL) must be assigned a memory
11718 needs_to_live_in_memory (const_tree t
)
11720 return (TREE_ADDRESSABLE (t
)
11721 || is_global_var (t
)
11722 || (TREE_CODE (t
) == RESULT_DECL
11723 && !DECL_BY_REFERENCE (t
)
11724 && aggregate_value_p (t
, current_function_decl
)));
11727 /* Return value of a constant X and sign-extend it. */
11730 int_cst_value (const_tree x
)
11732 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11733 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11735 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11736 gcc_assert (cst_and_fits_in_hwi (x
));
11738 if (bits
< HOST_BITS_PER_WIDE_INT
)
11740 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11742 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11744 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11750 /* If TYPE is an integral or pointer type, return an integer type with
11751 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11752 if TYPE is already an integer type of signedness UNSIGNEDP.
11753 If TYPE is a floating-point type, return an integer type with the same
11754 bitsize and with the signedness given by UNSIGNEDP; this is useful
11755 when doing bit-level operations on a floating-point value. */
11758 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11760 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11763 if (TREE_CODE (type
) == VECTOR_TYPE
)
11765 tree inner
= TREE_TYPE (type
);
11766 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11769 if (inner
== inner2
)
11771 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11774 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11776 tree inner
= TREE_TYPE (type
);
11777 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11780 if (inner
== inner2
)
11782 return build_complex_type (inner2
);
11786 if (INTEGRAL_TYPE_P (type
)
11787 || POINTER_TYPE_P (type
)
11788 || TREE_CODE (type
) == OFFSET_TYPE
)
11789 bits
= TYPE_PRECISION (type
);
11790 else if (TREE_CODE (type
) == REAL_TYPE
)
11791 bits
= GET_MODE_BITSIZE (SCALAR_TYPE_MODE (type
));
11795 return build_nonstandard_integer_type (bits
, unsignedp
);
11798 /* If TYPE is an integral or pointer type, return an integer type with
11799 the same precision which is unsigned, or itself if TYPE is already an
11800 unsigned integer type. If TYPE is a floating-point type, return an
11801 unsigned integer type with the same bitsize as TYPE. */
11804 unsigned_type_for (tree type
)
11806 return signed_or_unsigned_type_for (1, type
);
11809 /* If TYPE is an integral or pointer type, return an integer type with
11810 the same precision which is signed, or itself if TYPE is already a
11811 signed integer type. If TYPE is a floating-point type, return a
11812 signed integer type with the same bitsize as TYPE. */
11815 signed_type_for (tree type
)
11817 return signed_or_unsigned_type_for (0, type
);
11820 /* If TYPE is a vector type, return a signed integer vector type with the
11821 same width and number of subparts. Otherwise return boolean_type_node. */
11824 truth_type_for (tree type
)
11826 if (TREE_CODE (type
) == VECTOR_TYPE
)
11828 if (VECTOR_BOOLEAN_TYPE_P (type
))
11830 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11831 GET_MODE_SIZE (TYPE_MODE (type
)));
11834 return boolean_type_node
;
11837 /* Returns the largest value obtainable by casting something in INNER type to
11841 upper_bound_in_type (tree outer
, tree inner
)
11843 unsigned int det
= 0;
11844 unsigned oprec
= TYPE_PRECISION (outer
);
11845 unsigned iprec
= TYPE_PRECISION (inner
);
11848 /* Compute a unique number for every combination. */
11849 det
|= (oprec
> iprec
) ? 4 : 0;
11850 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11851 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11853 /* Determine the exponent to use. */
11858 /* oprec <= iprec, outer: signed, inner: don't care. */
11863 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11867 /* oprec > iprec, outer: signed, inner: signed. */
11871 /* oprec > iprec, outer: signed, inner: unsigned. */
11875 /* oprec > iprec, outer: unsigned, inner: signed. */
11879 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11883 gcc_unreachable ();
11886 return wide_int_to_tree (outer
,
11887 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11890 /* Returns the smallest value obtainable by casting something in INNER type to
11894 lower_bound_in_type (tree outer
, tree inner
)
11896 unsigned oprec
= TYPE_PRECISION (outer
);
11897 unsigned iprec
= TYPE_PRECISION (inner
);
11899 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11901 if (TYPE_UNSIGNED (outer
)
11902 /* If we are widening something of an unsigned type, OUTER type
11903 contains all values of INNER type. In particular, both INNER
11904 and OUTER types have zero in common. */
11905 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11906 return build_int_cst (outer
, 0);
11909 /* If we are widening a signed type to another signed type, we
11910 want to obtain -2^^(iprec-1). If we are keeping the
11911 precision or narrowing to a signed type, we want to obtain
11913 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11914 return wide_int_to_tree (outer
,
11915 wi::mask (prec
- 1, true,
11916 TYPE_PRECISION (outer
)));
11920 /* Return nonzero if two operands that are suitable for PHI nodes are
11921 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11922 SSA_NAME or invariant. Note that this is strictly an optimization.
11923 That is, callers of this function can directly call operand_equal_p
11924 and get the same result, only slower. */
11927 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11931 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11933 return operand_equal_p (arg0
, arg1
, 0);
11936 /* Returns number of zeros at the end of binary representation of X. */
11939 num_ending_zeros (const_tree x
)
11941 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11945 #define WALK_SUBTREE(NODE) \
11948 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11954 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11955 be walked whenever a type is seen in the tree. Rest of operands and return
11956 value are as for walk_tree. */
11959 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11960 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11962 tree result
= NULL_TREE
;
11964 switch (TREE_CODE (type
))
11967 case REFERENCE_TYPE
:
11969 /* We have to worry about mutually recursive pointers. These can't
11970 be written in C. They can in Ada. It's pathological, but
11971 there's an ACATS test (c38102a) that checks it. Deal with this
11972 by checking if we're pointing to another pointer, that one
11973 points to another pointer, that one does too, and we have no htab.
11974 If so, get a hash table. We check three levels deep to avoid
11975 the cost of the hash table if we don't need one. */
11976 if (POINTER_TYPE_P (TREE_TYPE (type
))
11977 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11978 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11981 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11992 WALK_SUBTREE (TREE_TYPE (type
));
11996 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11998 /* Fall through. */
12000 case FUNCTION_TYPE
:
12001 WALK_SUBTREE (TREE_TYPE (type
));
12005 /* We never want to walk into default arguments. */
12006 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
12007 WALK_SUBTREE (TREE_VALUE (arg
));
12012 /* Don't follow this nodes's type if a pointer for fear that
12013 we'll have infinite recursion. If we have a PSET, then we
12016 || (!POINTER_TYPE_P (TREE_TYPE (type
))
12017 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
12018 WALK_SUBTREE (TREE_TYPE (type
));
12019 WALK_SUBTREE (TYPE_DOMAIN (type
));
12023 WALK_SUBTREE (TREE_TYPE (type
));
12024 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
12034 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
12035 called with the DATA and the address of each sub-tree. If FUNC returns a
12036 non-NULL value, the traversal is stopped, and the value returned by FUNC
12037 is returned. If PSET is non-NULL it is used to record the nodes visited,
12038 and to avoid visiting a node more than once. */
12041 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12042 hash_set
<tree
> *pset
, walk_tree_lh lh
)
12044 enum tree_code code
;
12048 #define WALK_SUBTREE_TAIL(NODE) \
12052 goto tail_recurse; \
12057 /* Skip empty subtrees. */
12061 /* Don't walk the same tree twice, if the user has requested
12062 that we avoid doing so. */
12063 if (pset
&& pset
->add (*tp
))
12066 /* Call the function. */
12068 result
= (*func
) (tp
, &walk_subtrees
, data
);
12070 /* If we found something, return it. */
12074 code
= TREE_CODE (*tp
);
12076 /* Even if we didn't, FUNC may have decided that there was nothing
12077 interesting below this point in the tree. */
12078 if (!walk_subtrees
)
12080 /* But we still need to check our siblings. */
12081 if (code
== TREE_LIST
)
12082 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12083 else if (code
== OMP_CLAUSE
)
12084 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12091 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
12092 if (result
|| !walk_subtrees
)
12099 case IDENTIFIER_NODE
:
12106 case PLACEHOLDER_EXPR
:
12110 /* None of these have subtrees other than those already walked
12115 WALK_SUBTREE (TREE_VALUE (*tp
));
12116 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
12121 int len
= TREE_VEC_LENGTH (*tp
);
12126 /* Walk all elements but the first. */
12128 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
12130 /* Now walk the first one as a tail call. */
12131 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
12135 WALK_SUBTREE (TREE_REALPART (*tp
));
12136 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
12140 unsigned HOST_WIDE_INT idx
;
12141 constructor_elt
*ce
;
12143 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
12145 WALK_SUBTREE (ce
->value
);
12150 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
12155 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
12157 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
12158 into declarations that are just mentioned, rather than
12159 declared; they don't really belong to this part of the tree.
12160 And, we can see cycles: the initializer for a declaration
12161 can refer to the declaration itself. */
12162 WALK_SUBTREE (DECL_INITIAL (decl
));
12163 WALK_SUBTREE (DECL_SIZE (decl
));
12164 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
12166 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
12169 case STATEMENT_LIST
:
12171 tree_stmt_iterator i
;
12172 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
12173 WALK_SUBTREE (*tsi_stmt_ptr (i
));
12178 switch (OMP_CLAUSE_CODE (*tp
))
12180 case OMP_CLAUSE_GANG
:
12181 case OMP_CLAUSE__GRIDDIM_
:
12182 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12185 case OMP_CLAUSE_ASYNC
:
12186 case OMP_CLAUSE_WAIT
:
12187 case OMP_CLAUSE_WORKER
:
12188 case OMP_CLAUSE_VECTOR
:
12189 case OMP_CLAUSE_NUM_GANGS
:
12190 case OMP_CLAUSE_NUM_WORKERS
:
12191 case OMP_CLAUSE_VECTOR_LENGTH
:
12192 case OMP_CLAUSE_PRIVATE
:
12193 case OMP_CLAUSE_SHARED
:
12194 case OMP_CLAUSE_FIRSTPRIVATE
:
12195 case OMP_CLAUSE_COPYIN
:
12196 case OMP_CLAUSE_COPYPRIVATE
:
12197 case OMP_CLAUSE_FINAL
:
12198 case OMP_CLAUSE_IF
:
12199 case OMP_CLAUSE_NUM_THREADS
:
12200 case OMP_CLAUSE_SCHEDULE
:
12201 case OMP_CLAUSE_UNIFORM
:
12202 case OMP_CLAUSE_DEPEND
:
12203 case OMP_CLAUSE_NONTEMPORAL
:
12204 case OMP_CLAUSE_NUM_TEAMS
:
12205 case OMP_CLAUSE_THREAD_LIMIT
:
12206 case OMP_CLAUSE_DEVICE
:
12207 case OMP_CLAUSE_DIST_SCHEDULE
:
12208 case OMP_CLAUSE_SAFELEN
:
12209 case OMP_CLAUSE_SIMDLEN
:
12210 case OMP_CLAUSE_ORDERED
:
12211 case OMP_CLAUSE_PRIORITY
:
12212 case OMP_CLAUSE_GRAINSIZE
:
12213 case OMP_CLAUSE_NUM_TASKS
:
12214 case OMP_CLAUSE_HINT
:
12215 case OMP_CLAUSE_TO_DECLARE
:
12216 case OMP_CLAUSE_LINK
:
12217 case OMP_CLAUSE_USE_DEVICE_PTR
:
12218 case OMP_CLAUSE_IS_DEVICE_PTR
:
12219 case OMP_CLAUSE__LOOPTEMP_
:
12220 case OMP_CLAUSE__REDUCTEMP_
:
12221 case OMP_CLAUSE__SIMDUID_
:
12222 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
12225 case OMP_CLAUSE_INDEPENDENT
:
12226 case OMP_CLAUSE_NOWAIT
:
12227 case OMP_CLAUSE_DEFAULT
:
12228 case OMP_CLAUSE_UNTIED
:
12229 case OMP_CLAUSE_MERGEABLE
:
12230 case OMP_CLAUSE_PROC_BIND
:
12231 case OMP_CLAUSE_INBRANCH
:
12232 case OMP_CLAUSE_NOTINBRANCH
:
12233 case OMP_CLAUSE_FOR
:
12234 case OMP_CLAUSE_PARALLEL
:
12235 case OMP_CLAUSE_SECTIONS
:
12236 case OMP_CLAUSE_TASKGROUP
:
12237 case OMP_CLAUSE_NOGROUP
:
12238 case OMP_CLAUSE_THREADS
:
12239 case OMP_CLAUSE_SIMD
:
12240 case OMP_CLAUSE_DEFAULTMAP
:
12241 case OMP_CLAUSE_AUTO
:
12242 case OMP_CLAUSE_SEQ
:
12243 case OMP_CLAUSE_TILE
:
12244 case OMP_CLAUSE__SIMT_
:
12245 case OMP_CLAUSE_IF_PRESENT
:
12246 case OMP_CLAUSE_FINALIZE
:
12247 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12249 case OMP_CLAUSE_LASTPRIVATE
:
12250 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12251 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
12252 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12254 case OMP_CLAUSE_COLLAPSE
:
12257 for (i
= 0; i
< 3; i
++)
12258 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12259 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12262 case OMP_CLAUSE_LINEAR
:
12263 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12264 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
12265 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
12266 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12268 case OMP_CLAUSE_ALIGNED
:
12269 case OMP_CLAUSE_FROM
:
12270 case OMP_CLAUSE_TO
:
12271 case OMP_CLAUSE_MAP
:
12272 case OMP_CLAUSE__CACHE_
:
12273 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
12274 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
12275 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12277 case OMP_CLAUSE_REDUCTION
:
12278 case OMP_CLAUSE_TASK_REDUCTION
:
12279 case OMP_CLAUSE_IN_REDUCTION
:
12282 for (i
= 0; i
< 5; i
++)
12283 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
12284 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
12288 gcc_unreachable ();
12296 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
12297 But, we only want to walk once. */
12298 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
12299 for (i
= 0; i
< len
; ++i
)
12300 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12301 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12305 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12306 defining. We only want to walk into these fields of a type in this
12307 case and not in the general case of a mere reference to the type.
12309 The criterion is as follows: if the field can be an expression, it
12310 must be walked only here. This should be in keeping with the fields
12311 that are directly gimplified in gimplify_type_sizes in order for the
12312 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12313 variable-sized types.
12315 Note that DECLs get walked as part of processing the BIND_EXPR. */
12316 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12318 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12319 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12322 /* Call the function for the type. See if it returns anything or
12323 doesn't want us to continue. If we are to continue, walk both
12324 the normal fields and those for the declaration case. */
12325 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12326 if (result
|| !walk_subtrees
)
12329 /* But do not walk a pointed-to type since it may itself need to
12330 be walked in the declaration case if it isn't anonymous. */
12331 if (!POINTER_TYPE_P (*type_p
))
12333 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12338 /* If this is a record type, also walk the fields. */
12339 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12343 for (field
= TYPE_FIELDS (*type_p
); field
;
12344 field
= DECL_CHAIN (field
))
12346 /* We'd like to look at the type of the field, but we can
12347 easily get infinite recursion. So assume it's pointed
12348 to elsewhere in the tree. Also, ignore things that
12350 if (TREE_CODE (field
) != FIELD_DECL
)
12353 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12354 WALK_SUBTREE (DECL_SIZE (field
));
12355 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12356 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12357 WALK_SUBTREE (DECL_QUALIFIER (field
));
12361 /* Same for scalar types. */
12362 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12363 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12364 || TREE_CODE (*type_p
) == INTEGER_TYPE
12365 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12366 || TREE_CODE (*type_p
) == REAL_TYPE
)
12368 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12369 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12372 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12373 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12378 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12382 /* Walk over all the sub-trees of this operand. */
12383 len
= TREE_OPERAND_LENGTH (*tp
);
12385 /* Go through the subtrees. We need to do this in forward order so
12386 that the scope of a FOR_EXPR is handled properly. */
12389 for (i
= 0; i
< len
- 1; ++i
)
12390 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12391 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12394 /* If this is a type, walk the needed fields in the type. */
12395 else if (TYPE_P (*tp
))
12396 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12400 /* We didn't find what we were looking for. */
12403 #undef WALK_SUBTREE_TAIL
12405 #undef WALK_SUBTREE
12407 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12410 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12415 hash_set
<tree
> pset
;
12416 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12422 tree_block (tree t
)
12424 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12426 if (IS_EXPR_CODE_CLASS (c
))
12427 return LOCATION_BLOCK (t
->exp
.locus
);
12428 gcc_unreachable ();
12433 tree_set_block (tree t
, tree b
)
12435 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12437 if (IS_EXPR_CODE_CLASS (c
))
12439 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12442 gcc_unreachable ();
12445 /* Create a nameless artificial label and put it in the current
12446 function context. The label has a location of LOC. Returns the
12447 newly created label. */
12450 create_artificial_label (location_t loc
)
12452 tree lab
= build_decl (loc
,
12453 LABEL_DECL
, NULL_TREE
, void_type_node
);
12455 DECL_ARTIFICIAL (lab
) = 1;
12456 DECL_IGNORED_P (lab
) = 1;
12457 DECL_CONTEXT (lab
) = current_function_decl
;
12461 /* Given a tree, try to return a useful variable name that we can use
12462 to prefix a temporary that is being assigned the value of the tree.
12463 I.E. given <temp> = &A, return A. */
12468 tree stripped_decl
;
12471 STRIP_NOPS (stripped_decl
);
12472 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12473 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12474 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12476 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12479 return IDENTIFIER_POINTER (name
);
12483 switch (TREE_CODE (stripped_decl
))
12486 return get_name (TREE_OPERAND (stripped_decl
, 0));
12493 /* Return true if TYPE has a variable argument list. */
12496 stdarg_p (const_tree fntype
)
12498 function_args_iterator args_iter
;
12499 tree n
= NULL_TREE
, t
;
12504 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12509 return n
!= NULL_TREE
&& n
!= void_type_node
;
12512 /* Return true if TYPE has a prototype. */
12515 prototype_p (const_tree fntype
)
12519 gcc_assert (fntype
!= NULL_TREE
);
12521 t
= TYPE_ARG_TYPES (fntype
);
12522 return (t
!= NULL_TREE
);
12525 /* If BLOCK is inlined from an __attribute__((__artificial__))
12526 routine, return pointer to location from where it has been
12529 block_nonartificial_location (tree block
)
12531 location_t
*ret
= NULL
;
12533 while (block
&& TREE_CODE (block
) == BLOCK
12534 && BLOCK_ABSTRACT_ORIGIN (block
))
12536 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12537 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12539 /* If AO is an artificial inline, point RET to the
12540 call site locus at which it has been inlined and continue
12541 the loop, in case AO's caller is also an artificial
12543 if (DECL_DECLARED_INLINE_P (ao
)
12544 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12545 ret
= &BLOCK_SOURCE_LOCATION (block
);
12549 else if (TREE_CODE (ao
) != BLOCK
)
12552 block
= BLOCK_SUPERCONTEXT (block
);
12558 /* If EXP is inlined from an __attribute__((__artificial__))
12559 function, return the location of the original call expression. */
12562 tree_nonartificial_location (tree exp
)
12564 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12569 return EXPR_LOCATION (exp
);
12573 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12576 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12579 cl_option_hasher::hash (tree x
)
12581 const_tree
const t
= x
;
12585 hashval_t hash
= 0;
12587 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12589 p
= (const char *)TREE_OPTIMIZATION (t
);
12590 len
= sizeof (struct cl_optimization
);
12593 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12594 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12597 gcc_unreachable ();
12599 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12601 for (i
= 0; i
< len
; i
++)
12603 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12608 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12609 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12613 cl_option_hasher::equal (tree x
, tree y
)
12615 const_tree
const xt
= x
;
12616 const_tree
const yt
= y
;
12618 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12621 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12622 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12623 TREE_OPTIMIZATION (yt
));
12624 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12625 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12626 TREE_TARGET_OPTION (yt
));
12628 gcc_unreachable ();
12631 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12634 build_optimization_node (struct gcc_options
*opts
)
12638 /* Use the cache of optimization nodes. */
12640 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12643 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12647 /* Insert this one into the hash table. */
12648 t
= cl_optimization_node
;
12651 /* Make a new node for next time round. */
12652 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12658 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12661 build_target_option_node (struct gcc_options
*opts
)
12665 /* Use the cache of optimization nodes. */
12667 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12670 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12674 /* Insert this one into the hash table. */
12675 t
= cl_target_option_node
;
12678 /* Make a new node for next time round. */
12679 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12685 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12686 so that they aren't saved during PCH writing. */
12689 prepare_target_option_nodes_for_pch (void)
12691 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12692 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12693 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12694 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12697 /* Determine the "ultimate origin" of a block. */
12700 block_ultimate_origin (const_tree block
)
12702 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12704 if (origin
== NULL_TREE
)
12708 gcc_checking_assert ((DECL_P (origin
)
12709 && DECL_ORIGIN (origin
) == origin
)
12710 || BLOCK_ORIGIN (origin
) == origin
);
12715 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12719 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12721 /* Do not strip casts into or out of differing address spaces. */
12722 if (POINTER_TYPE_P (outer_type
)
12723 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12725 if (!POINTER_TYPE_P (inner_type
)
12726 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12727 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12730 else if (POINTER_TYPE_P (inner_type
)
12731 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12733 /* We already know that outer_type is not a pointer with
12734 a non-generic address space. */
12738 /* Use precision rather then machine mode when we can, which gives
12739 the correct answer even for submode (bit-field) types. */
12740 if ((INTEGRAL_TYPE_P (outer_type
)
12741 || POINTER_TYPE_P (outer_type
)
12742 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12743 && (INTEGRAL_TYPE_P (inner_type
)
12744 || POINTER_TYPE_P (inner_type
)
12745 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12746 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12748 /* Otherwise fall back on comparing machine modes (e.g. for
12749 aggregate types, floats). */
12750 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12753 /* Return true iff conversion in EXP generates no instruction. Mark
12754 it inline so that we fully inline into the stripping functions even
12755 though we have two uses of this function. */
12758 tree_nop_conversion (const_tree exp
)
12760 tree outer_type
, inner_type
;
12762 if (location_wrapper_p (exp
))
12764 if (!CONVERT_EXPR_P (exp
)
12765 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12767 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12770 outer_type
= TREE_TYPE (exp
);
12771 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12776 return tree_nop_conversion_p (outer_type
, inner_type
);
12779 /* Return true iff conversion in EXP generates no instruction. Don't
12780 consider conversions changing the signedness. */
12783 tree_sign_nop_conversion (const_tree exp
)
12785 tree outer_type
, inner_type
;
12787 if (!tree_nop_conversion (exp
))
12790 outer_type
= TREE_TYPE (exp
);
12791 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12793 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12794 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12797 /* Strip conversions from EXP according to tree_nop_conversion and
12798 return the resulting expression. */
12801 tree_strip_nop_conversions (tree exp
)
12803 while (tree_nop_conversion (exp
))
12804 exp
= TREE_OPERAND (exp
, 0);
12808 /* Strip conversions from EXP according to tree_sign_nop_conversion
12809 and return the resulting expression. */
12812 tree_strip_sign_nop_conversions (tree exp
)
12814 while (tree_sign_nop_conversion (exp
))
12815 exp
= TREE_OPERAND (exp
, 0);
12819 /* Avoid any floating point extensions from EXP. */
12821 strip_float_extensions (tree exp
)
12823 tree sub
, expt
, subt
;
12825 /* For floating point constant look up the narrowest type that can hold
12826 it properly and handle it like (type)(narrowest_type)constant.
12827 This way we can optimize for instance a=a*2.0 where "a" is float
12828 but 2.0 is double constant. */
12829 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12831 REAL_VALUE_TYPE orig
;
12834 orig
= TREE_REAL_CST (exp
);
12835 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12836 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12837 type
= float_type_node
;
12838 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12839 > TYPE_PRECISION (double_type_node
)
12840 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12841 type
= double_type_node
;
12843 return build_real_truncate (type
, orig
);
12846 if (!CONVERT_EXPR_P (exp
))
12849 sub
= TREE_OPERAND (exp
, 0);
12850 subt
= TREE_TYPE (sub
);
12851 expt
= TREE_TYPE (exp
);
12853 if (!FLOAT_TYPE_P (subt
))
12856 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12859 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12862 return strip_float_extensions (sub
);
12865 /* Strip out all handled components that produce invariant
12869 strip_invariant_refs (const_tree op
)
12871 while (handled_component_p (op
))
12873 switch (TREE_CODE (op
))
12876 case ARRAY_RANGE_REF
:
12877 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12878 || TREE_OPERAND (op
, 2) != NULL_TREE
12879 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12883 case COMPONENT_REF
:
12884 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12890 op
= TREE_OPERAND (op
, 0);
12896 static GTY(()) tree gcc_eh_personality_decl
;
12898 /* Return the GCC personality function decl. */
12901 lhd_gcc_personality (void)
12903 if (!gcc_eh_personality_decl
)
12904 gcc_eh_personality_decl
= build_personality_function ("gcc");
12905 return gcc_eh_personality_decl
;
12908 /* TARGET is a call target of GIMPLE call statement
12909 (obtained by gimple_call_fn). Return true if it is
12910 OBJ_TYPE_REF representing an virtual call of C++ method.
12911 (As opposed to OBJ_TYPE_REF representing objc calls
12912 through a cast where middle-end devirtualization machinery
12916 virtual_method_call_p (const_tree target
)
12918 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12920 tree t
= TREE_TYPE (target
);
12921 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12923 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12925 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12926 /* If we do not have BINFO associated, it means that type was built
12927 without devirtualization enabled. Do not consider this a virtual
12929 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12934 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12937 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12940 tree base_binfo
, b
;
12942 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12943 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12944 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12946 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12951 /* Try to find a base info of BINFO that would have its field decl at offset
12952 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12953 found, return, otherwise return NULL_TREE. */
12956 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12958 tree type
= BINFO_TYPE (binfo
);
12962 HOST_WIDE_INT pos
, size
;
12966 if (types_same_for_odr (type
, expected_type
))
12968 if (maybe_lt (offset
, 0))
12971 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12973 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12976 pos
= int_bit_position (fld
);
12977 size
= tree_to_uhwi (DECL_SIZE (fld
));
12978 if (known_in_range_p (offset
, pos
, size
))
12981 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12984 /* Offset 0 indicates the primary base, whose vtable contents are
12985 represented in the binfo for the derived class. */
12986 else if (maybe_ne (offset
, 0))
12988 tree found_binfo
= NULL
, base_binfo
;
12989 /* Offsets in BINFO are in bytes relative to the whole structure
12990 while POS is in bits relative to the containing field. */
12991 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12994 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12995 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12996 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12998 found_binfo
= base_binfo
;
13002 binfo
= found_binfo
;
13004 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
13008 type
= TREE_TYPE (fld
);
13013 /* Returns true if X is a typedef decl. */
13016 is_typedef_decl (const_tree x
)
13018 return (x
&& TREE_CODE (x
) == TYPE_DECL
13019 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
13022 /* Returns true iff TYPE is a type variant created for a typedef. */
13025 typedef_variant_p (const_tree type
)
13027 return is_typedef_decl (TYPE_NAME (type
));
13030 /* A class to handle converting a string that might contain
13031 control characters, (eg newline, form-feed, etc), into one
13032 in which contains escape sequences instead. */
13034 class escaped_string
13037 escaped_string () { m_owned
= false; m_str
= NULL
; };
13038 ~escaped_string () { if (m_owned
) free (m_str
); }
13039 operator const char *() const { return (const char *) m_str
; }
13040 void escape (const char *);
13046 /* PR 84195: Replace control characters in "unescaped" with their
13047 escaped equivalents. Allow newlines if -fmessage-length has
13048 been set to a non-zero value. This is done here, rather than
13049 where the attribute is recorded as the message length can
13050 change between these two locations. */
13053 escaped_string::escape (const char *unescaped
)
13056 size_t i
, new_i
, len
;
13061 m_str
= const_cast<char *> (unescaped
);
13064 if (unescaped
== NULL
|| *unescaped
== 0)
13067 len
= strlen (unescaped
);
13071 for (i
= 0; i
< len
; i
++)
13073 char c
= unescaped
[i
];
13078 escaped
[new_i
++] = c
;
13082 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
13084 if (escaped
== NULL
)
13086 /* We only allocate space for a new string if we
13087 actually encounter a control character that
13088 needs replacing. */
13089 escaped
= (char *) xmalloc (len
* 2 + 1);
13090 strncpy (escaped
, unescaped
, i
);
13094 escaped
[new_i
++] = '\\';
13098 case '\a': escaped
[new_i
++] = 'a'; break;
13099 case '\b': escaped
[new_i
++] = 'b'; break;
13100 case '\f': escaped
[new_i
++] = 'f'; break;
13101 case '\n': escaped
[new_i
++] = 'n'; break;
13102 case '\r': escaped
[new_i
++] = 'r'; break;
13103 case '\t': escaped
[new_i
++] = 't'; break;
13104 case '\v': escaped
[new_i
++] = 'v'; break;
13105 default: escaped
[new_i
++] = '?'; break;
13109 escaped
[new_i
++] = c
;
13114 escaped
[new_i
] = 0;
13120 /* Warn about a use of an identifier which was marked deprecated. Returns
13121 whether a warning was given. */
13124 warn_deprecated_use (tree node
, tree attr
)
13126 escaped_string msg
;
13128 if (node
== 0 || !warn_deprecated_decl
)
13134 attr
= DECL_ATTRIBUTES (node
);
13135 else if (TYPE_P (node
))
13137 tree decl
= TYPE_STUB_DECL (node
);
13139 attr
= lookup_attribute ("deprecated",
13140 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
13145 attr
= lookup_attribute ("deprecated", attr
);
13148 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
13153 auto_diagnostic_group d
;
13155 w
= warning (OPT_Wdeprecated_declarations
,
13156 "%qD is deprecated: %s", node
, (const char *) msg
);
13158 w
= warning (OPT_Wdeprecated_declarations
,
13159 "%qD is deprecated", node
);
13161 inform (DECL_SOURCE_LOCATION (node
), "declared here");
13163 else if (TYPE_P (node
))
13165 tree what
= NULL_TREE
;
13166 tree decl
= TYPE_STUB_DECL (node
);
13168 if (TYPE_NAME (node
))
13170 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
13171 what
= TYPE_NAME (node
);
13172 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
13173 && DECL_NAME (TYPE_NAME (node
)))
13174 what
= DECL_NAME (TYPE_NAME (node
));
13177 auto_diagnostic_group d
;
13181 w
= warning (OPT_Wdeprecated_declarations
,
13182 "%qE is deprecated: %s", what
, (const char *) msg
);
13184 w
= warning (OPT_Wdeprecated_declarations
,
13185 "%qE is deprecated", what
);
13190 w
= warning (OPT_Wdeprecated_declarations
,
13191 "type is deprecated: %s", (const char *) msg
);
13193 w
= warning (OPT_Wdeprecated_declarations
,
13194 "type is deprecated");
13198 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
13204 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
13205 somewhere in it. */
13208 contains_bitfld_component_ref_p (const_tree ref
)
13210 while (handled_component_p (ref
))
13212 if (TREE_CODE (ref
) == COMPONENT_REF
13213 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
13215 ref
= TREE_OPERAND (ref
, 0);
13221 /* Try to determine whether a TRY_CATCH expression can fall through.
13222 This is a subroutine of block_may_fallthru. */
13225 try_catch_may_fallthru (const_tree stmt
)
13227 tree_stmt_iterator i
;
13229 /* If the TRY block can fall through, the whole TRY_CATCH can
13231 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
13234 i
= tsi_start (TREE_OPERAND (stmt
, 1));
13235 switch (TREE_CODE (tsi_stmt (i
)))
13238 /* We expect to see a sequence of CATCH_EXPR trees, each with a
13239 catch expression and a body. The whole TRY_CATCH may fall
13240 through iff any of the catch bodies falls through. */
13241 for (; !tsi_end_p (i
); tsi_next (&i
))
13243 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
13248 case EH_FILTER_EXPR
:
13249 /* The exception filter expression only matters if there is an
13250 exception. If the exception does not match EH_FILTER_TYPES,
13251 we will execute EH_FILTER_FAILURE, and we will fall through
13252 if that falls through. If the exception does match
13253 EH_FILTER_TYPES, the stack unwinder will continue up the
13254 stack, so we will not fall through. We don't know whether we
13255 will throw an exception which matches EH_FILTER_TYPES or not,
13256 so we just ignore EH_FILTER_TYPES and assume that we might
13257 throw an exception which doesn't match. */
13258 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
13261 /* This case represents statements to be executed when an
13262 exception occurs. Those statements are implicitly followed
13263 by a RESX statement to resume execution after the exception.
13264 So in this case the TRY_CATCH never falls through. */
13269 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
13270 need not be 100% accurate; simply be conservative and return true if we
13271 don't know. This is used only to avoid stupidly generating extra code.
13272 If we're wrong, we'll just delete the extra code later. */
13275 block_may_fallthru (const_tree block
)
13277 /* This CONST_CAST is okay because expr_last returns its argument
13278 unmodified and we assign it to a const_tree. */
13279 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
13281 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13285 /* Easy cases. If the last statement of the block implies
13286 control transfer, then we can't fall through. */
13290 /* If there is a default: label or case labels cover all possible
13291 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13292 to some case label in all cases and all we care is whether the
13293 SWITCH_BODY falls through. */
13294 if (SWITCH_ALL_CASES_P (stmt
))
13295 return block_may_fallthru (SWITCH_BODY (stmt
));
13299 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13301 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13304 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13306 case TRY_CATCH_EXPR
:
13307 return try_catch_may_fallthru (stmt
);
13309 case TRY_FINALLY_EXPR
:
13310 /* The finally clause is always executed after the try clause,
13311 so if it does not fall through, then the try-finally will not
13312 fall through. Otherwise, if the try clause does not fall
13313 through, then when the finally clause falls through it will
13314 resume execution wherever the try clause was going. So the
13315 whole try-finally will only fall through if both the try
13316 clause and the finally clause fall through. */
13317 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13318 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13321 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13322 stmt
= TREE_OPERAND (stmt
, 1);
13328 /* Functions that do not return do not fall through. */
13329 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13331 case CLEANUP_POINT_EXPR
:
13332 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13335 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13341 return lang_hooks
.block_may_fallthru (stmt
);
13345 /* True if we are using EH to handle cleanups. */
13346 static bool using_eh_for_cleanups_flag
= false;
13348 /* This routine is called from front ends to indicate eh should be used for
13351 using_eh_for_cleanups (void)
13353 using_eh_for_cleanups_flag
= true;
13356 /* Query whether EH is used for cleanups. */
13358 using_eh_for_cleanups_p (void)
13360 return using_eh_for_cleanups_flag
;
13363 /* Wrapper for tree_code_name to ensure that tree code is valid */
13365 get_tree_code_name (enum tree_code code
)
13367 const char *invalid
= "<invalid tree code>";
13369 if (code
>= MAX_TREE_CODES
)
13372 return tree_code_name
[code
];
13375 /* Drops the TREE_OVERFLOW flag from T. */
13378 drop_tree_overflow (tree t
)
13380 gcc_checking_assert (TREE_OVERFLOW (t
));
13382 /* For tree codes with a sharing machinery re-build the result. */
13383 if (poly_int_tree_p (t
))
13384 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13386 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13387 and canonicalize the result. */
13388 if (TREE_CODE (t
) == VECTOR_CST
)
13390 tree_vector_builder builder
;
13391 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13392 unsigned int count
= builder
.encoded_nelts ();
13393 for (unsigned int i
= 0; i
< count
; ++i
)
13395 tree elt
= VECTOR_CST_ELT (t
, i
);
13396 if (TREE_OVERFLOW (elt
))
13397 elt
= drop_tree_overflow (elt
);
13398 builder
.quick_push (elt
);
13400 return builder
.build ();
13403 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13404 and drop the flag. */
13406 TREE_OVERFLOW (t
) = 0;
13408 /* For constants that contain nested constants, drop the flag
13409 from those as well. */
13410 if (TREE_CODE (t
) == COMPLEX_CST
)
13412 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13413 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13414 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13415 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13421 /* Given a memory reference expression T, return its base address.
13422 The base address of a memory reference expression is the main
13423 object being referenced. For instance, the base address for
13424 'array[i].fld[j]' is 'array'. You can think of this as stripping
13425 away the offset part from a memory address.
13427 This function calls handled_component_p to strip away all the inner
13428 parts of the memory reference until it reaches the base object. */
13431 get_base_address (tree t
)
13433 while (handled_component_p (t
))
13434 t
= TREE_OPERAND (t
, 0);
13436 if ((TREE_CODE (t
) == MEM_REF
13437 || TREE_CODE (t
) == TARGET_MEM_REF
)
13438 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13439 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13441 /* ??? Either the alias oracle or all callers need to properly deal
13442 with WITH_SIZE_EXPRs before we can look through those. */
13443 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13449 /* Return a tree of sizetype representing the size, in bytes, of the element
13450 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13453 array_ref_element_size (tree exp
)
13455 tree aligned_size
= TREE_OPERAND (exp
, 3);
13456 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13457 location_t loc
= EXPR_LOCATION (exp
);
13459 /* If a size was specified in the ARRAY_REF, it's the size measured
13460 in alignment units of the element type. So multiply by that value. */
13463 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13464 sizetype from another type of the same width and signedness. */
13465 if (TREE_TYPE (aligned_size
) != sizetype
)
13466 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13467 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13468 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13471 /* Otherwise, take the size from that of the element type. Substitute
13472 any PLACEHOLDER_EXPR that we have. */
13474 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13477 /* Return a tree representing the lower bound of the array mentioned in
13478 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13481 array_ref_low_bound (tree exp
)
13483 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13485 /* If a lower bound is specified in EXP, use it. */
13486 if (TREE_OPERAND (exp
, 2))
13487 return TREE_OPERAND (exp
, 2);
13489 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13490 substituting for a PLACEHOLDER_EXPR as needed. */
13491 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13492 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13494 /* Otherwise, return a zero of the appropriate type. */
13495 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13498 /* Return a tree representing the upper bound of the array mentioned in
13499 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13502 array_ref_up_bound (tree exp
)
13504 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13506 /* If there is a domain type and it has an upper bound, use it, substituting
13507 for a PLACEHOLDER_EXPR as needed. */
13508 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13509 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13511 /* Otherwise fail. */
13515 /* Returns true if REF is an array reference or a component reference
13516 to an array at the end of a structure.
13517 If this is the case, the array may be allocated larger
13518 than its upper bound implies. */
13521 array_at_struct_end_p (tree ref
)
13525 if (TREE_CODE (ref
) == ARRAY_REF
13526 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13528 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13529 ref
= TREE_OPERAND (ref
, 0);
13531 else if (TREE_CODE (ref
) == COMPONENT_REF
13532 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13533 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13537 if (TREE_CODE (ref
) == STRING_CST
)
13540 tree ref_to_array
= ref
;
13541 while (handled_component_p (ref
))
13543 /* If the reference chain contains a component reference to a
13544 non-union type and there follows another field the reference
13545 is not at the end of a structure. */
13546 if (TREE_CODE (ref
) == COMPONENT_REF
)
13548 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13550 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13551 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13552 nextf
= DECL_CHAIN (nextf
);
13557 /* If we have a multi-dimensional array we do not consider
13558 a non-innermost dimension as flex array if the whole
13559 multi-dimensional array is at struct end.
13560 Same for an array of aggregates with a trailing array
13562 else if (TREE_CODE (ref
) == ARRAY_REF
)
13564 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13566 /* If we view an underlying object as sth else then what we
13567 gathered up to now is what we have to rely on. */
13568 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13571 gcc_unreachable ();
13573 ref
= TREE_OPERAND (ref
, 0);
13576 /* The array now is at struct end. Treat flexible arrays as
13577 always subject to extend, even into just padding constrained by
13578 an underlying decl. */
13579 if (! TYPE_SIZE (atype
)
13580 || ! TYPE_DOMAIN (atype
)
13581 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13584 if (TREE_CODE (ref
) == MEM_REF
13585 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13586 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13588 /* If the reference is based on a declared entity, the size of the array
13589 is constrained by its given domain. (Do not trust commons PR/69368). */
13591 && !(flag_unconstrained_commons
13592 && VAR_P (ref
) && DECL_COMMON (ref
))
13593 && DECL_SIZE_UNIT (ref
)
13594 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13596 /* Check whether the array domain covers all of the available
13599 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13600 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13601 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13603 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13606 /* If at least one extra element fits it is a flexarray. */
13607 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13608 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13610 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13611 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13620 /* Return a tree representing the offset, in bytes, of the field referenced
13621 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13624 component_ref_field_offset (tree exp
)
13626 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13627 tree field
= TREE_OPERAND (exp
, 1);
13628 location_t loc
= EXPR_LOCATION (exp
);
13630 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13631 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13633 if (aligned_offset
)
13635 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13636 sizetype from another type of the same width and signedness. */
13637 if (TREE_TYPE (aligned_offset
) != sizetype
)
13638 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13639 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13640 size_int (DECL_OFFSET_ALIGN (field
)
13644 /* Otherwise, take the offset from that of the field. Substitute
13645 any PLACEHOLDER_EXPR that we have. */
13647 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13650 /* Return the machine mode of T. For vectors, returns the mode of the
13651 inner type. The main use case is to feed the result to HONOR_NANS,
13652 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13655 element_mode (const_tree t
)
13659 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13661 return TYPE_MODE (t
);
13664 /* Vector types need to re-check the target flags each time we report
13665 the machine mode. We need to do this because attribute target can
13666 change the result of vector_mode_supported_p and have_regs_of_mode
13667 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13668 change on a per-function basis. */
13669 /* ??? Possibly a better solution is to run through all the types
13670 referenced by a function and re-compute the TYPE_MODE once, rather
13671 than make the TYPE_MODE macro call a function. */
13674 vector_type_mode (const_tree t
)
13678 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13680 mode
= t
->type_common
.mode
;
13681 if (VECTOR_MODE_P (mode
)
13682 && (!targetm
.vector_mode_supported_p (mode
)
13683 || !have_regs_of_mode
[mode
]))
13685 scalar_int_mode innermode
;
13687 /* For integers, try mapping it to a same-sized scalar mode. */
13688 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13690 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13691 * GET_MODE_BITSIZE (innermode
));
13692 scalar_int_mode mode
;
13693 if (int_mode_for_size (size
, 0).exists (&mode
)
13694 && have_regs_of_mode
[mode
])
13704 /* Verify that basic properties of T match TV and thus T can be a variant of
13705 TV. TV should be the more specified variant (i.e. the main variant). */
13708 verify_type_variant (const_tree t
, tree tv
)
13710 /* Type variant can differ by:
13712 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13713 ENCODE_QUAL_ADDR_SPACE.
13714 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13715 in this case some values may not be set in the variant types
13716 (see TYPE_COMPLETE_P checks).
13717 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13718 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13719 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13720 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13721 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13722 this is necessary to make it possible to merge types form different TUs
13723 - arrays, pointers and references may have TREE_TYPE that is a variant
13724 of TREE_TYPE of their main variants.
13725 - aggregates may have new TYPE_FIELDS list that list variants of
13726 the main variant TYPE_FIELDS.
13727 - vector types may differ by TYPE_VECTOR_OPAQUE
13730 /* Convenience macro for matching individual fields. */
13731 #define verify_variant_match(flag) \
13733 if (flag (tv) != flag (t)) \
13735 error ("type variant differs by %s", #flag); \
13741 /* tree_base checks. */
13743 verify_variant_match (TREE_CODE
);
13744 /* FIXME: Ada builds non-artificial variants of artificial types. */
13745 if (TYPE_ARTIFICIAL (tv
) && 0)
13746 verify_variant_match (TYPE_ARTIFICIAL
);
13747 if (POINTER_TYPE_P (tv
))
13748 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13749 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13750 verify_variant_match (TYPE_UNSIGNED
);
13751 verify_variant_match (TYPE_PACKED
);
13752 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13753 verify_variant_match (TYPE_REF_IS_RVALUE
);
13754 if (AGGREGATE_TYPE_P (t
))
13755 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13757 verify_variant_match (TYPE_SATURATING
);
13758 /* FIXME: This check trigger during libstdc++ build. */
13759 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13760 verify_variant_match (TYPE_FINAL_P
);
13762 /* tree_type_common checks. */
13764 if (COMPLETE_TYPE_P (t
))
13766 verify_variant_match (TYPE_MODE
);
13767 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13768 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13769 verify_variant_match (TYPE_SIZE
);
13770 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13771 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13772 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13774 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13775 TYPE_SIZE_UNIT (tv
), 0));
13776 error ("type variant has different TYPE_SIZE_UNIT");
13778 error ("type variant's TYPE_SIZE_UNIT");
13779 debug_tree (TYPE_SIZE_UNIT (tv
));
13780 error ("type's TYPE_SIZE_UNIT");
13781 debug_tree (TYPE_SIZE_UNIT (t
));
13785 verify_variant_match (TYPE_PRECISION
);
13786 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13787 if (RECORD_OR_UNION_TYPE_P (t
))
13788 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13789 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13790 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13791 /* During LTO we merge variant lists from diferent translation units
13792 that may differ BY TYPE_CONTEXT that in turn may point
13793 to TRANSLATION_UNIT_DECL.
13794 Ada also builds variants of types with different TYPE_CONTEXT. */
13795 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13796 verify_variant_match (TYPE_CONTEXT
);
13797 verify_variant_match (TYPE_STRING_FLAG
);
13798 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13800 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13805 /* tree_type_non_common checks. */
13807 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13808 and dangle the pointer from time to time. */
13809 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13810 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13811 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13813 error ("type variant has different TYPE_VFIELD");
13817 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13818 || TREE_CODE (t
) == INTEGER_TYPE
13819 || TREE_CODE (t
) == BOOLEAN_TYPE
13820 || TREE_CODE (t
) == REAL_TYPE
13821 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13823 verify_variant_match (TYPE_MAX_VALUE
);
13824 verify_variant_match (TYPE_MIN_VALUE
);
13826 if (TREE_CODE (t
) == METHOD_TYPE
)
13827 verify_variant_match (TYPE_METHOD_BASETYPE
);
13828 if (TREE_CODE (t
) == OFFSET_TYPE
)
13829 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13830 if (TREE_CODE (t
) == ARRAY_TYPE
)
13831 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13832 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13833 or even type's main variant. This is needed to make bootstrap pass
13834 and the bug seems new in GCC 5.
13835 C++ FE should be updated to make this consistent and we should check
13836 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13837 is a match with main variant.
13839 Also disable the check for Java for now because of parser hack that builds
13840 first an dummy BINFO and then sometimes replace it by real BINFO in some
13842 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13843 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13844 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13845 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13846 at LTO time only. */
13847 && (in_lto_p
&& odr_type_p (t
)))
13849 error ("type variant has different TYPE_BINFO");
13851 error ("type variant's TYPE_BINFO");
13852 debug_tree (TYPE_BINFO (tv
));
13853 error ("type's TYPE_BINFO");
13854 debug_tree (TYPE_BINFO (t
));
13858 /* Check various uses of TYPE_VALUES_RAW. */
13859 if (TREE_CODE (t
) == ENUMERAL_TYPE
13860 && TYPE_VALUES (t
))
13861 verify_variant_match (TYPE_VALUES
);
13862 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13863 verify_variant_match (TYPE_DOMAIN
);
13864 /* Permit incomplete variants of complete type. While FEs may complete
13865 all variants, this does not happen for C++ templates in all cases. */
13866 else if (RECORD_OR_UNION_TYPE_P (t
)
13867 && COMPLETE_TYPE_P (t
)
13868 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13872 /* Fortran builds qualified variants as new records with items of
13873 qualified type. Verify that they looks same. */
13874 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13876 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13877 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13878 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13879 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13880 /* FIXME: gfc_nonrestricted_type builds all types as variants
13881 with exception of pointer types. It deeply copies the type
13882 which means that we may end up with a variant type
13883 referring non-variant pointer. We may change it to
13884 produce types as variants, too, like
13885 objc_get_protocol_qualified_type does. */
13886 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13887 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13888 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13892 error ("type variant has different TYPE_FIELDS");
13894 error ("first mismatch is field");
13896 error ("and field");
13901 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13902 verify_variant_match (TYPE_ARG_TYPES
);
13903 /* For C++ the qualified variant of array type is really an array type
13904 of qualified TREE_TYPE.
13905 objc builds variants of pointer where pointer to type is a variant, too
13906 in objc_get_protocol_qualified_type. */
13907 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13908 && ((TREE_CODE (t
) != ARRAY_TYPE
13909 && !POINTER_TYPE_P (t
))
13910 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13911 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13913 error ("type variant has different TREE_TYPE");
13915 error ("type variant's TREE_TYPE");
13916 debug_tree (TREE_TYPE (tv
));
13917 error ("type's TREE_TYPE");
13918 debug_tree (TREE_TYPE (t
));
13921 if (type_with_alias_set_p (t
)
13922 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13924 error ("type is not compatible with its variant");
13926 error ("type variant's TREE_TYPE");
13927 debug_tree (TREE_TYPE (tv
));
13928 error ("type's TREE_TYPE");
13929 debug_tree (TREE_TYPE (t
));
13933 #undef verify_variant_match
13937 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13938 the middle-end types_compatible_p function. It needs to avoid
13939 claiming types are different for types that should be treated
13940 the same with respect to TBAA. Canonical types are also used
13941 for IL consistency checks via the useless_type_conversion_p
13942 predicate which does not handle all type kinds itself but falls
13943 back to pointer-comparison of TYPE_CANONICAL for aggregates
13946 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13947 type calculation because we need to allow inter-operability between signed
13948 and unsigned variants. */
13951 type_with_interoperable_signedness (const_tree type
)
13953 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13954 signed char and unsigned char. Similarly fortran FE builds
13955 C_SIZE_T as signed type, while C defines it unsigned. */
13957 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13959 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13960 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13963 /* Return true iff T1 and T2 are structurally identical for what
13965 This function is used both by lto.c canonical type merging and by the
13966 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13967 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13968 only for LTO because only in these cases TYPE_CANONICAL equivalence
13969 correspond to one defined by gimple_canonical_types_compatible_p. */
13972 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13973 bool trust_type_canonical
)
13975 /* Type variants should be same as the main variant. When not doing sanity
13976 checking to verify this fact, go to main variants and save some work. */
13977 if (trust_type_canonical
)
13979 t1
= TYPE_MAIN_VARIANT (t1
);
13980 t2
= TYPE_MAIN_VARIANT (t2
);
13983 /* Check first for the obvious case of pointer identity. */
13987 /* Check that we have two types to compare. */
13988 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13991 /* We consider complete types always compatible with incomplete type.
13992 This does not make sense for canonical type calculation and thus we
13993 need to ensure that we are never called on it.
13995 FIXME: For more correctness the function probably should have three modes
13996 1) mode assuming that types are complete mathcing their structure
13997 2) mode allowing incomplete types but producing equivalence classes
13998 and thus ignoring all info from complete types
13999 3) mode allowing incomplete types to match complete but checking
14000 compatibility between complete types.
14002 1 and 2 can be used for canonical type calculation. 3 is the real
14003 definition of type compatibility that can be used i.e. for warnings during
14004 declaration merging. */
14006 gcc_assert (!trust_type_canonical
14007 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
14008 /* If the types have been previously registered and found equal
14011 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
14012 && trust_type_canonical
)
14014 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
14015 they are always NULL, but they are set to non-NULL for types
14016 constructed by build_pointer_type and variants. In this case the
14017 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
14018 all pointers are considered equal. Be sure to not return false
14020 gcc_checking_assert (canonical_type_used_p (t1
)
14021 && canonical_type_used_p (t2
));
14022 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
14025 /* Can't be the same type if the types don't have the same code. */
14026 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
14027 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
14030 /* Qualifiers do not matter for canonical type comparison purposes. */
14032 /* Void types and nullptr types are always the same. */
14033 if (TREE_CODE (t1
) == VOID_TYPE
14034 || TREE_CODE (t1
) == NULLPTR_TYPE
)
14037 /* Can't be the same type if they have different mode. */
14038 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
14041 /* Non-aggregate types can be handled cheaply. */
14042 if (INTEGRAL_TYPE_P (t1
)
14043 || SCALAR_FLOAT_TYPE_P (t1
)
14044 || FIXED_POINT_TYPE_P (t1
)
14045 || TREE_CODE (t1
) == VECTOR_TYPE
14046 || TREE_CODE (t1
) == COMPLEX_TYPE
14047 || TREE_CODE (t1
) == OFFSET_TYPE
14048 || POINTER_TYPE_P (t1
))
14050 /* Can't be the same type if they have different recision. */
14051 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
14054 /* In some cases the signed and unsigned types are required to be
14056 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
14057 && !type_with_interoperable_signedness (t1
))
14060 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
14061 interoperable with "signed char". Unless all frontends are revisited
14062 to agree on these types, we must ignore the flag completely. */
14064 /* Fortran standard define C_PTR type that is compatible with every
14065 C pointer. For this reason we need to glob all pointers into one.
14066 Still pointers in different address spaces are not compatible. */
14067 if (POINTER_TYPE_P (t1
))
14069 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
14070 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
14074 /* Tail-recurse to components. */
14075 if (TREE_CODE (t1
) == VECTOR_TYPE
14076 || TREE_CODE (t1
) == COMPLEX_TYPE
)
14077 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
14079 trust_type_canonical
);
14084 /* Do type-specific comparisons. */
14085 switch (TREE_CODE (t1
))
14088 /* Array types are the same if the element types are the same and
14089 the number of elements are the same. */
14090 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14091 trust_type_canonical
)
14092 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
14093 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
14094 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
14098 tree i1
= TYPE_DOMAIN (t1
);
14099 tree i2
= TYPE_DOMAIN (t2
);
14101 /* For an incomplete external array, the type domain can be
14102 NULL_TREE. Check this condition also. */
14103 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
14105 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
14109 tree min1
= TYPE_MIN_VALUE (i1
);
14110 tree min2
= TYPE_MIN_VALUE (i2
);
14111 tree max1
= TYPE_MAX_VALUE (i1
);
14112 tree max2
= TYPE_MAX_VALUE (i2
);
14114 /* The minimum/maximum values have to be the same. */
14117 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
14118 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
14119 || operand_equal_p (min1
, min2
, 0))))
14122 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
14123 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
14124 || operand_equal_p (max1
, max2
, 0)))))
14132 case FUNCTION_TYPE
:
14133 /* Function types are the same if the return type and arguments types
14135 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
14136 trust_type_canonical
))
14139 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
14143 tree parms1
, parms2
;
14145 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
14147 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
14149 if (!gimple_canonical_types_compatible_p
14150 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
14151 trust_type_canonical
))
14155 if (parms1
|| parms2
)
14163 case QUAL_UNION_TYPE
:
14167 /* Don't try to compare variants of an incomplete type, before
14168 TYPE_FIELDS has been copied around. */
14169 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
14173 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
14176 /* For aggregate types, all the fields must be the same. */
14177 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
14179 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
14181 /* Skip non-fields and zero-sized fields. */
14182 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
14184 && integer_zerop (DECL_SIZE (f1
)))))
14185 f1
= TREE_CHAIN (f1
);
14186 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
14188 && integer_zerop (DECL_SIZE (f2
)))))
14189 f2
= TREE_CHAIN (f2
);
14192 /* The fields must have the same name, offset and type. */
14193 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
14194 || !gimple_compare_field_offset (f1
, f2
)
14195 || !gimple_canonical_types_compatible_p
14196 (TREE_TYPE (f1
), TREE_TYPE (f2
),
14197 trust_type_canonical
))
14201 /* If one aggregate has more fields than the other, they
14202 are not the same. */
14210 /* Consider all types with language specific trees in them mutually
14211 compatible. This is executed only from verify_type and false
14212 positives can be tolerated. */
14213 gcc_assert (!in_lto_p
);
14218 /* Verify type T. */
14221 verify_type (const_tree t
)
14223 bool error_found
= false;
14224 tree mv
= TYPE_MAIN_VARIANT (t
);
14227 error ("Main variant is not defined");
14228 error_found
= true;
14230 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
14232 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
14234 error_found
= true;
14236 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
14237 error_found
= true;
14239 tree ct
= TYPE_CANONICAL (t
);
14242 else if (TYPE_CANONICAL (t
) != ct
)
14244 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
14246 error_found
= true;
14248 /* Method and function types cannot be used to address memory and thus
14249 TYPE_CANONICAL really matters only for determining useless conversions.
14251 FIXME: C++ FE produce declarations of builtin functions that are not
14252 compatible with main variants. */
14253 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
14256 /* FIXME: gimple_canonical_types_compatible_p cannot compare types
14257 with variably sized arrays because their sizes possibly
14258 gimplified to different variables. */
14259 && !variably_modified_type_p (ct
, NULL
)
14260 && !gimple_canonical_types_compatible_p (t
, ct
, false)
14261 && COMPLETE_TYPE_P (t
))
14263 error ("TYPE_CANONICAL is not compatible");
14265 error_found
= true;
14268 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
14269 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
14271 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
14273 error_found
= true;
14275 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
14277 error ("TYPE_CANONICAL of main variant is not main variant");
14279 debug_tree (TYPE_MAIN_VARIANT (ct
));
14280 error_found
= true;
14284 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14285 if (RECORD_OR_UNION_TYPE_P (t
))
14287 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14288 and danagle the pointer from time to time. */
14289 if (TYPE_VFIELD (t
)
14290 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14291 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14293 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
14294 debug_tree (TYPE_VFIELD (t
));
14295 error_found
= true;
14298 else if (TREE_CODE (t
) == POINTER_TYPE
)
14300 if (TYPE_NEXT_PTR_TO (t
)
14301 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14303 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
14304 debug_tree (TYPE_NEXT_PTR_TO (t
));
14305 error_found
= true;
14308 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14310 if (TYPE_NEXT_REF_TO (t
)
14311 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14313 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
14314 debug_tree (TYPE_NEXT_REF_TO (t
));
14315 error_found
= true;
14318 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14319 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14321 /* FIXME: The following check should pass:
14322 useless_type_conversion_p (const_cast <tree> (t),
14323 TREE_TYPE (TYPE_MIN_VALUE (t))
14324 but does not for C sizetypes in LTO. */
14327 /* Check various uses of TYPE_MAXVAL_RAW. */
14328 if (RECORD_OR_UNION_TYPE_P (t
))
14330 if (!TYPE_BINFO (t
))
14332 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14334 error ("TYPE_BINFO is not TREE_BINFO");
14335 debug_tree (TYPE_BINFO (t
));
14336 error_found
= true;
14338 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14340 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
14341 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14342 error_found
= true;
14345 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14347 if (TYPE_METHOD_BASETYPE (t
)
14348 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14349 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14351 error ("TYPE_METHOD_BASETYPE is not record nor union");
14352 debug_tree (TYPE_METHOD_BASETYPE (t
));
14353 error_found
= true;
14356 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14358 if (TYPE_OFFSET_BASETYPE (t
)
14359 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14360 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14362 error ("TYPE_OFFSET_BASETYPE is not record nor union");
14363 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14364 error_found
= true;
14367 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14368 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14370 /* FIXME: The following check should pass:
14371 useless_type_conversion_p (const_cast <tree> (t),
14372 TREE_TYPE (TYPE_MAX_VALUE (t))
14373 but does not for C sizetypes in LTO. */
14375 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14377 if (TYPE_ARRAY_MAX_SIZE (t
)
14378 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14380 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
14381 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14382 error_found
= true;
14385 else if (TYPE_MAX_VALUE_RAW (t
))
14387 error ("TYPE_MAX_VALUE_RAW non-NULL");
14388 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14389 error_found
= true;
14392 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14394 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
14395 debug_tree (TYPE_LANG_SLOT_1 (t
));
14396 error_found
= true;
14399 /* Check various uses of TYPE_VALUES_RAW. */
14400 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14401 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14403 tree value
= TREE_VALUE (l
);
14404 tree name
= TREE_PURPOSE (l
);
14406 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14407 CONST_DECL of ENUMERAL TYPE. */
14408 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14410 error ("Enum value is not CONST_DECL or INTEGER_CST");
14411 debug_tree (value
);
14413 error_found
= true;
14415 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14416 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14418 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
14419 debug_tree (value
);
14421 error_found
= true;
14423 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14425 error ("Enum value name is not IDENTIFIER_NODE");
14426 debug_tree (value
);
14428 error_found
= true;
14431 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14433 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14435 error ("Array TYPE_DOMAIN is not integer type");
14436 debug_tree (TYPE_DOMAIN (t
));
14437 error_found
= true;
14440 else if (RECORD_OR_UNION_TYPE_P (t
))
14442 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14444 error ("TYPE_FIELDS defined in incomplete type");
14445 error_found
= true;
14447 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14449 /* TODO: verify properties of decls. */
14450 if (TREE_CODE (fld
) == FIELD_DECL
)
14452 else if (TREE_CODE (fld
) == TYPE_DECL
)
14454 else if (TREE_CODE (fld
) == CONST_DECL
)
14456 else if (VAR_P (fld
))
14458 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14460 else if (TREE_CODE (fld
) == USING_DECL
)
14462 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14466 error ("Wrong tree in TYPE_FIELDS list");
14468 error_found
= true;
14472 else if (TREE_CODE (t
) == INTEGER_TYPE
14473 || TREE_CODE (t
) == BOOLEAN_TYPE
14474 || TREE_CODE (t
) == OFFSET_TYPE
14475 || TREE_CODE (t
) == REFERENCE_TYPE
14476 || TREE_CODE (t
) == NULLPTR_TYPE
14477 || TREE_CODE (t
) == POINTER_TYPE
)
14479 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14481 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14482 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14483 error_found
= true;
14485 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14487 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14488 debug_tree (TYPE_CACHED_VALUES (t
));
14489 error_found
= true;
14491 /* Verify just enough of cache to ensure that no one copied it to new type.
14492 All copying should go by copy_node that should clear it. */
14493 else if (TYPE_CACHED_VALUES_P (t
))
14496 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14497 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14498 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14500 error ("wrong TYPE_CACHED_VALUES entry");
14501 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14502 error_found
= true;
14507 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14508 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14510 /* C++ FE uses TREE_PURPOSE to store initial values. */
14511 if (TREE_PURPOSE (l
) && in_lto_p
)
14513 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14515 error_found
= true;
14517 if (!TYPE_P (TREE_VALUE (l
)))
14519 error ("Wrong entry in TYPE_ARG_TYPES list");
14521 error_found
= true;
14524 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14526 error ("TYPE_VALUES_RAW field is non-NULL");
14527 debug_tree (TYPE_VALUES_RAW (t
));
14528 error_found
= true;
14530 if (TREE_CODE (t
) != INTEGER_TYPE
14531 && TREE_CODE (t
) != BOOLEAN_TYPE
14532 && TREE_CODE (t
) != OFFSET_TYPE
14533 && TREE_CODE (t
) != REFERENCE_TYPE
14534 && TREE_CODE (t
) != NULLPTR_TYPE
14535 && TREE_CODE (t
) != POINTER_TYPE
14536 && TYPE_CACHED_VALUES_P (t
))
14538 error ("TYPE_CACHED_VALUES_P is set while it should not");
14539 error_found
= true;
14541 if (TYPE_STRING_FLAG (t
)
14542 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14544 error ("TYPE_STRING_FLAG is set on wrong type code");
14545 error_found
= true;
14548 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14549 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14551 if (TREE_CODE (t
) == METHOD_TYPE
14552 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14554 error ("TYPE_METHOD_BASETYPE is not main variant");
14555 error_found
= true;
14560 debug_tree (const_cast <tree
> (t
));
14561 internal_error ("verify_type failed");
14566 /* Return 1 if ARG interpreted as signed in its precision is known to be
14567 always positive or 2 if ARG is known to be always negative, or 3 if
14568 ARG may be positive or negative. */
14571 get_range_pos_neg (tree arg
)
14573 if (arg
== error_mark_node
)
14576 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14578 if (TREE_CODE (arg
) == INTEGER_CST
)
14580 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14586 while (CONVERT_EXPR_P (arg
)
14587 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14588 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14590 arg
= TREE_OPERAND (arg
, 0);
14591 /* Narrower value zero extended into wider type
14592 will always result in positive values. */
14593 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14594 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14596 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14601 if (TREE_CODE (arg
) != SSA_NAME
)
14603 wide_int arg_min
, arg_max
;
14604 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14606 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14607 if (is_gimple_assign (g
)
14608 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14610 tree t
= gimple_assign_rhs1 (g
);
14611 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14612 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14614 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14615 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14617 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14626 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14628 /* For unsigned values, the "positive" range comes
14629 below the "negative" range. */
14630 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14632 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14637 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14639 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14648 /* Return true if ARG is marked with the nonnull attribute in the
14649 current function signature. */
14652 nonnull_arg_p (const_tree arg
)
14654 tree t
, attrs
, fntype
;
14655 unsigned HOST_WIDE_INT arg_num
;
14657 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14658 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14659 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14661 /* The static chain decl is always non null. */
14662 if (arg
== cfun
->static_chain_decl
)
14665 /* THIS argument of method is always non-NULL. */
14666 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14667 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14668 && flag_delete_null_pointer_checks
)
14671 /* Values passed by reference are always non-NULL. */
14672 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14673 && flag_delete_null_pointer_checks
)
14676 fntype
= TREE_TYPE (cfun
->decl
);
14677 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14679 attrs
= lookup_attribute ("nonnull", attrs
);
14681 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14682 if (attrs
== NULL_TREE
)
14685 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14686 if (TREE_VALUE (attrs
) == NULL_TREE
)
14689 /* Get the position number for ARG in the function signature. */
14690 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14692 t
= DECL_CHAIN (t
), arg_num
++)
14698 gcc_assert (t
== arg
);
14700 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14701 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14703 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14711 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14715 set_block (location_t loc
, tree block
)
14717 location_t pure_loc
= get_pure_location (loc
);
14718 source_range src_range
= get_range_from_loc (line_table
, loc
);
14719 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14723 set_source_range (tree expr
, location_t start
, location_t finish
)
14725 source_range src_range
;
14726 src_range
.m_start
= start
;
14727 src_range
.m_finish
= finish
;
14728 return set_source_range (expr
, src_range
);
14732 set_source_range (tree expr
, source_range src_range
)
14734 if (!EXPR_P (expr
))
14735 return UNKNOWN_LOCATION
;
14737 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14738 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14742 SET_EXPR_LOCATION (expr
, adhoc
);
14746 /* Return EXPR, potentially wrapped with a node expression LOC,
14747 if !CAN_HAVE_LOCATION_P (expr).
14749 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14750 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14752 Wrapper nodes can be identified using location_wrapper_p. */
14755 maybe_wrap_with_location (tree expr
, location_t loc
)
14759 if (loc
== UNKNOWN_LOCATION
)
14761 if (CAN_HAVE_LOCATION_P (expr
))
14763 /* We should only be adding wrappers for constants and for decls,
14764 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14765 gcc_assert (CONSTANT_CLASS_P (expr
)
14767 || EXCEPTIONAL_CLASS_P (expr
));
14769 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14770 any impact of the wrapper nodes. */
14771 if (EXCEPTIONAL_CLASS_P (expr
))
14774 /* If any auto_suppress_location_wrappers are active, don't create
14776 if (suppress_location_wrappers
> 0)
14780 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14781 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14782 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14783 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14784 /* Mark this node as being a wrapper. */
14785 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14789 int suppress_location_wrappers
;
14791 /* Return the name of combined function FN, for debugging purposes. */
14794 combined_fn_name (combined_fn fn
)
14796 if (builtin_fn_p (fn
))
14798 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14799 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14802 return internal_fn_name (as_internal_fn (fn
));
14805 /* Return a bitmap with a bit set corresponding to each argument in
14806 a function call type FNTYPE declared with attribute nonnull,
14807 or null if none of the function's argument are nonnull. The caller
14808 must free the bitmap. */
14811 get_nonnull_args (const_tree fntype
)
14813 if (fntype
== NULL_TREE
)
14816 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14820 bitmap argmap
= NULL
;
14822 /* A function declaration can specify multiple attribute nonnull,
14823 each with zero or more arguments. The loop below creates a bitmap
14824 representing a union of all the arguments. An empty (but non-null)
14825 bitmap means that all arguments have been declaraed nonnull. */
14826 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14828 attrs
= lookup_attribute ("nonnull", attrs
);
14833 argmap
= BITMAP_ALLOC (NULL
);
14835 if (!TREE_VALUE (attrs
))
14837 /* Clear the bitmap in case a previous attribute nonnull
14838 set it and this one overrides it for all arguments. */
14839 bitmap_clear (argmap
);
14843 /* Iterate over the indices of the format arguments declared nonnull
14844 and set a bit for each. */
14845 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14847 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14848 bitmap_set_bit (argmap
, val
);
14855 /* Returns true if TYPE is a type where it and all of its subobjects
14856 (recursively) are of structure, union, or array type. */
14859 default_is_empty_type (tree type
)
14861 if (RECORD_OR_UNION_TYPE_P (type
))
14863 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14864 if (TREE_CODE (field
) == FIELD_DECL
14865 && !DECL_PADDING_P (field
)
14866 && !default_is_empty_type (TREE_TYPE (field
)))
14870 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14871 return (integer_minus_onep (array_type_nelts (type
))
14872 || TYPE_DOMAIN (type
) == NULL_TREE
14873 || default_is_empty_type (TREE_TYPE (type
)));
14877 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14878 that shouldn't be passed via stack. */
14881 default_is_empty_record (const_tree type
)
14883 if (!abi_version_at_least (12))
14886 if (type
== error_mark_node
)
14889 if (TREE_ADDRESSABLE (type
))
14892 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14895 /* Like int_size_in_bytes, but handle empty records specially. */
14898 arg_int_size_in_bytes (const_tree type
)
14900 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14903 /* Like size_in_bytes, but handle empty records specially. */
14906 arg_size_in_bytes (const_tree type
)
14908 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14911 /* Return true if an expression with CODE has to have the same result type as
14912 its first operand. */
14915 expr_type_first_operand_type_p (tree_code code
)
14928 case TRUNC_DIV_EXPR
:
14929 case CEIL_DIV_EXPR
:
14930 case FLOOR_DIV_EXPR
:
14931 case ROUND_DIV_EXPR
:
14932 case TRUNC_MOD_EXPR
:
14933 case CEIL_MOD_EXPR
:
14934 case FLOOR_MOD_EXPR
:
14935 case ROUND_MOD_EXPR
:
14937 case EXACT_DIV_EXPR
:
14955 /* Return a typenode for the "standard" C type with a given name. */
14957 get_typenode_from_name (const char *name
)
14959 if (name
== NULL
|| *name
== '\0')
14962 if (strcmp (name
, "char") == 0)
14963 return char_type_node
;
14964 if (strcmp (name
, "unsigned char") == 0)
14965 return unsigned_char_type_node
;
14966 if (strcmp (name
, "signed char") == 0)
14967 return signed_char_type_node
;
14969 if (strcmp (name
, "short int") == 0)
14970 return short_integer_type_node
;
14971 if (strcmp (name
, "short unsigned int") == 0)
14972 return short_unsigned_type_node
;
14974 if (strcmp (name
, "int") == 0)
14975 return integer_type_node
;
14976 if (strcmp (name
, "unsigned int") == 0)
14977 return unsigned_type_node
;
14979 if (strcmp (name
, "long int") == 0)
14980 return long_integer_type_node
;
14981 if (strcmp (name
, "long unsigned int") == 0)
14982 return long_unsigned_type_node
;
14984 if (strcmp (name
, "long long int") == 0)
14985 return long_long_integer_type_node
;
14986 if (strcmp (name
, "long long unsigned int") == 0)
14987 return long_long_unsigned_type_node
;
14989 gcc_unreachable ();
14992 /* List of pointer types used to declare builtins before we have seen their
14995 Keep the size up to date in tree.h ! */
14996 const builtin_structptr_type builtin_structptr_types
[6] =
14998 { fileptr_type_node
, ptr_type_node
, "FILE" },
14999 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
15000 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
15001 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
15002 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
15003 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
15008 namespace selftest
{
15010 /* Selftests for tree. */
15012 /* Verify that integer constants are sane. */
15015 test_integer_constants ()
15017 ASSERT_TRUE (integer_type_node
!= NULL
);
15018 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
15020 tree type
= integer_type_node
;
15022 tree zero
= build_zero_cst (type
);
15023 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
15024 ASSERT_EQ (type
, TREE_TYPE (zero
));
15026 tree one
= build_int_cst (type
, 1);
15027 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
15028 ASSERT_EQ (type
, TREE_TYPE (zero
));
15031 /* Verify identifiers. */
15034 test_identifiers ()
15036 tree identifier
= get_identifier ("foo");
15037 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
15038 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
15041 /* Verify LABEL_DECL. */
15046 tree identifier
= get_identifier ("err");
15047 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
15048 identifier
, void_type_node
);
15049 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
15050 ASSERT_FALSE (FORCED_LABEL (label_decl
));
15053 /* Return a new VECTOR_CST node whose type is TYPE and whose values
15054 are given by VALS. */
15057 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
15059 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
15060 tree_vector_builder
builder (type
, vals
.length (), 1);
15061 builder
.splice (vals
);
15062 return builder
.build ();
15065 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
15068 check_vector_cst (vec
<tree
> expected
, tree actual
)
15070 ASSERT_KNOWN_EQ (expected
.length (),
15071 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
15072 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
15073 ASSERT_EQ (wi::to_wide (expected
[i
]),
15074 wi::to_wide (vector_cst_elt (actual
, i
)));
15077 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
15078 and that its elements match EXPECTED. */
15081 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
15082 unsigned int npatterns
)
15084 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15085 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15086 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
15087 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
15088 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15089 check_vector_cst (expected
, actual
);
15092 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
15093 and NPATTERNS background elements, and that its elements match
15097 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
15098 unsigned int npatterns
)
15100 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15101 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15102 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
15103 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15104 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
15105 check_vector_cst (expected
, actual
);
15108 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
15109 and that its elements match EXPECTED. */
15112 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
15113 unsigned int npatterns
)
15115 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
15116 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
15117 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
15118 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
15119 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
15120 check_vector_cst (expected
, actual
);
15123 /* Test the creation of VECTOR_CSTs. */
15126 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
15128 auto_vec
<tree
, 8> elements (8);
15129 elements
.quick_grow (8);
15130 tree element_type
= build_nonstandard_integer_type (16, true);
15131 tree vector_type
= build_vector_type (element_type
, 8);
15133 /* Test a simple linear series with a base of 0 and a step of 1:
15134 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
15135 for (unsigned int i
= 0; i
< 8; ++i
)
15136 elements
[i
] = build_int_cst (element_type
, i
);
15137 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15138 check_vector_cst_stepped (elements
, vector
, 1);
15140 /* Try the same with the first element replaced by 100:
15141 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
15142 elements
[0] = build_int_cst (element_type
, 100);
15143 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15144 check_vector_cst_stepped (elements
, vector
, 1);
15146 /* Try a series that wraps around.
15147 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
15148 for (unsigned int i
= 1; i
< 8; ++i
)
15149 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
15150 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15151 check_vector_cst_stepped (elements
, vector
, 1);
15153 /* Try a downward series:
15154 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
15155 for (unsigned int i
= 1; i
< 8; ++i
)
15156 elements
[i
] = build_int_cst (element_type
, 80 - i
);
15157 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15158 check_vector_cst_stepped (elements
, vector
, 1);
15160 /* Try two interleaved series with different bases and steps:
15161 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
15162 elements
[1] = build_int_cst (element_type
, 53);
15163 for (unsigned int i
= 2; i
< 8; i
+= 2)
15165 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
15166 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
15168 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15169 check_vector_cst_stepped (elements
, vector
, 2);
15171 /* Try a duplicated value:
15172 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
15173 for (unsigned int i
= 1; i
< 8; ++i
)
15174 elements
[i
] = elements
[0];
15175 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15176 check_vector_cst_duplicate (elements
, vector
, 1);
15178 /* Try an interleaved duplicated value:
15179 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
15180 elements
[1] = build_int_cst (element_type
, 55);
15181 for (unsigned int i
= 2; i
< 8; ++i
)
15182 elements
[i
] = elements
[i
- 2];
15183 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15184 check_vector_cst_duplicate (elements
, vector
, 2);
15186 /* Try a duplicated value with 2 exceptions
15187 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
15188 elements
[0] = build_int_cst (element_type
, 41);
15189 elements
[1] = build_int_cst (element_type
, 97);
15190 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15191 check_vector_cst_fill (elements
, vector
, 2);
15193 /* Try with and without a step
15194 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
15195 for (unsigned int i
= 3; i
< 8; i
+= 2)
15196 elements
[i
] = build_int_cst (element_type
, i
* 7);
15197 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15198 check_vector_cst_stepped (elements
, vector
, 2);
15200 /* Try a fully-general constant:
15201 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
15202 elements
[5] = build_int_cst (element_type
, 9990);
15203 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
15204 check_vector_cst_fill (elements
, vector
, 4);
15207 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
15208 Helper function for test_location_wrappers, to deal with STRIP_NOPS
15209 modifying its argument in-place. */
15212 check_strip_nops (tree node
, tree expected
)
15215 ASSERT_EQ (expected
, node
);
15218 /* Verify location wrappers. */
15221 test_location_wrappers ()
15223 location_t loc
= BUILTINS_LOCATION
;
15225 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
15227 /* Wrapping a constant. */
15228 tree int_cst
= build_int_cst (integer_type_node
, 42);
15229 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
15230 ASSERT_FALSE (location_wrapper_p (int_cst
));
15232 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
15233 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
15234 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
15235 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
15237 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
15238 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
15240 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
15241 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
15242 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
15243 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
15245 /* Wrapping a STRING_CST. */
15246 tree string_cst
= build_string (4, "foo");
15247 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
15248 ASSERT_FALSE (location_wrapper_p (string_cst
));
15250 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
15251 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
15252 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
15253 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
15254 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
15257 /* Wrapping a variable. */
15258 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
15259 get_identifier ("some_int_var"),
15260 integer_type_node
);
15261 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
15262 ASSERT_FALSE (location_wrapper_p (int_var
));
15264 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
15265 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
15266 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
15267 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
15269 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
15271 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
15272 ASSERT_FALSE (location_wrapper_p (r_cast
));
15273 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
15275 /* Verify that STRIP_NOPS removes wrappers. */
15276 check_strip_nops (wrapped_int_cst
, int_cst
);
15277 check_strip_nops (wrapped_string_cst
, string_cst
);
15278 check_strip_nops (wrapped_int_var
, int_var
);
15281 /* Test various tree predicates. Verify that location wrappers don't
15282 affect the results. */
15287 /* Build various constants and wrappers around them. */
15289 location_t loc
= BUILTINS_LOCATION
;
15291 tree i_0
= build_int_cst (integer_type_node
, 0);
15292 tree wr_i_0
= maybe_wrap_with_location (i_0
, loc
);
15294 tree i_1
= build_int_cst (integer_type_node
, 1);
15295 tree wr_i_1
= maybe_wrap_with_location (i_1
, loc
);
15297 tree i_m1
= build_int_cst (integer_type_node
, -1);
15298 tree wr_i_m1
= maybe_wrap_with_location (i_m1
, loc
);
15300 tree f_0
= build_real_from_int_cst (float_type_node
, i_0
);
15301 tree wr_f_0
= maybe_wrap_with_location (f_0
, loc
);
15302 tree f_1
= build_real_from_int_cst (float_type_node
, i_1
);
15303 tree wr_f_1
= maybe_wrap_with_location (f_1
, loc
);
15304 tree f_m1
= build_real_from_int_cst (float_type_node
, i_m1
);
15305 tree wr_f_m1
= maybe_wrap_with_location (f_m1
, loc
);
15307 tree c_i_0
= build_complex (NULL_TREE
, i_0
, i_0
);
15308 tree c_i_1
= build_complex (NULL_TREE
, i_1
, i_0
);
15309 tree c_i_m1
= build_complex (NULL_TREE
, i_m1
, i_0
);
15311 tree c_f_0
= build_complex (NULL_TREE
, f_0
, f_0
);
15312 tree c_f_1
= build_complex (NULL_TREE
, f_1
, f_0
);
15313 tree c_f_m1
= build_complex (NULL_TREE
, f_m1
, f_0
);
15315 /* TODO: vector constants. */
15317 /* Test integer_onep. */
15318 ASSERT_FALSE (integer_onep (i_0
));
15319 ASSERT_FALSE (integer_onep (wr_i_0
));
15320 ASSERT_TRUE (integer_onep (i_1
));
15321 ASSERT_TRUE (integer_onep (wr_i_1
));
15322 ASSERT_FALSE (integer_onep (i_m1
));
15323 ASSERT_FALSE (integer_onep (wr_i_m1
));
15324 ASSERT_FALSE (integer_onep (f_0
));
15325 ASSERT_FALSE (integer_onep (wr_f_0
));
15326 ASSERT_FALSE (integer_onep (f_1
));
15327 ASSERT_FALSE (integer_onep (wr_f_1
));
15328 ASSERT_FALSE (integer_onep (f_m1
));
15329 ASSERT_FALSE (integer_onep (wr_f_m1
));
15330 ASSERT_FALSE (integer_onep (c_i_0
));
15331 ASSERT_TRUE (integer_onep (c_i_1
));
15332 ASSERT_FALSE (integer_onep (c_i_m1
));
15333 ASSERT_FALSE (integer_onep (c_f_0
));
15334 ASSERT_FALSE (integer_onep (c_f_1
));
15335 ASSERT_FALSE (integer_onep (c_f_m1
));
15337 /* Test integer_zerop. */
15338 ASSERT_TRUE (integer_zerop (i_0
));
15339 ASSERT_TRUE (integer_zerop (wr_i_0
));
15340 ASSERT_FALSE (integer_zerop (i_1
));
15341 ASSERT_FALSE (integer_zerop (wr_i_1
));
15342 ASSERT_FALSE (integer_zerop (i_m1
));
15343 ASSERT_FALSE (integer_zerop (wr_i_m1
));
15344 ASSERT_FALSE (integer_zerop (f_0
));
15345 ASSERT_FALSE (integer_zerop (wr_f_0
));
15346 ASSERT_FALSE (integer_zerop (f_1
));
15347 ASSERT_FALSE (integer_zerop (wr_f_1
));
15348 ASSERT_FALSE (integer_zerop (f_m1
));
15349 ASSERT_FALSE (integer_zerop (wr_f_m1
));
15350 ASSERT_TRUE (integer_zerop (c_i_0
));
15351 ASSERT_FALSE (integer_zerop (c_i_1
));
15352 ASSERT_FALSE (integer_zerop (c_i_m1
));
15353 ASSERT_FALSE (integer_zerop (c_f_0
));
15354 ASSERT_FALSE (integer_zerop (c_f_1
));
15355 ASSERT_FALSE (integer_zerop (c_f_m1
));
15357 /* Test integer_all_onesp. */
15358 ASSERT_FALSE (integer_all_onesp (i_0
));
15359 ASSERT_FALSE (integer_all_onesp (wr_i_0
));
15360 ASSERT_FALSE (integer_all_onesp (i_1
));
15361 ASSERT_FALSE (integer_all_onesp (wr_i_1
));
15362 ASSERT_TRUE (integer_all_onesp (i_m1
));
15363 ASSERT_TRUE (integer_all_onesp (wr_i_m1
));
15364 ASSERT_FALSE (integer_all_onesp (f_0
));
15365 ASSERT_FALSE (integer_all_onesp (wr_f_0
));
15366 ASSERT_FALSE (integer_all_onesp (f_1
));
15367 ASSERT_FALSE (integer_all_onesp (wr_f_1
));
15368 ASSERT_FALSE (integer_all_onesp (f_m1
));
15369 ASSERT_FALSE (integer_all_onesp (wr_f_m1
));
15370 ASSERT_FALSE (integer_all_onesp (c_i_0
));
15371 ASSERT_FALSE (integer_all_onesp (c_i_1
));
15372 ASSERT_FALSE (integer_all_onesp (c_i_m1
));
15373 ASSERT_FALSE (integer_all_onesp (c_f_0
));
15374 ASSERT_FALSE (integer_all_onesp (c_f_1
));
15375 ASSERT_FALSE (integer_all_onesp (c_f_m1
));
15377 /* Test integer_minus_onep. */
15378 ASSERT_FALSE (integer_minus_onep (i_0
));
15379 ASSERT_FALSE (integer_minus_onep (wr_i_0
));
15380 ASSERT_FALSE (integer_minus_onep (i_1
));
15381 ASSERT_FALSE (integer_minus_onep (wr_i_1
));
15382 ASSERT_TRUE (integer_minus_onep (i_m1
));
15383 ASSERT_TRUE (integer_minus_onep (wr_i_m1
));
15384 ASSERT_FALSE (integer_minus_onep (f_0
));
15385 ASSERT_FALSE (integer_minus_onep (wr_f_0
));
15386 ASSERT_FALSE (integer_minus_onep (f_1
));
15387 ASSERT_FALSE (integer_minus_onep (wr_f_1
));
15388 ASSERT_FALSE (integer_minus_onep (f_m1
));
15389 ASSERT_FALSE (integer_minus_onep (wr_f_m1
));
15390 ASSERT_FALSE (integer_minus_onep (c_i_0
));
15391 ASSERT_FALSE (integer_minus_onep (c_i_1
));
15392 ASSERT_TRUE (integer_minus_onep (c_i_m1
));
15393 ASSERT_FALSE (integer_minus_onep (c_f_0
));
15394 ASSERT_FALSE (integer_minus_onep (c_f_1
));
15395 ASSERT_FALSE (integer_minus_onep (c_f_m1
));
15397 /* Test integer_each_onep. */
15398 ASSERT_FALSE (integer_each_onep (i_0
));
15399 ASSERT_FALSE (integer_each_onep (wr_i_0
));
15400 ASSERT_TRUE (integer_each_onep (i_1
));
15401 ASSERT_TRUE (integer_each_onep (wr_i_1
));
15402 ASSERT_FALSE (integer_each_onep (i_m1
));
15403 ASSERT_FALSE (integer_each_onep (wr_i_m1
));
15404 ASSERT_FALSE (integer_each_onep (f_0
));
15405 ASSERT_FALSE (integer_each_onep (wr_f_0
));
15406 ASSERT_FALSE (integer_each_onep (f_1
));
15407 ASSERT_FALSE (integer_each_onep (wr_f_1
));
15408 ASSERT_FALSE (integer_each_onep (f_m1
));
15409 ASSERT_FALSE (integer_each_onep (wr_f_m1
));
15410 ASSERT_FALSE (integer_each_onep (c_i_0
));
15411 ASSERT_FALSE (integer_each_onep (c_i_1
));
15412 ASSERT_FALSE (integer_each_onep (c_i_m1
));
15413 ASSERT_FALSE (integer_each_onep (c_f_0
));
15414 ASSERT_FALSE (integer_each_onep (c_f_1
));
15415 ASSERT_FALSE (integer_each_onep (c_f_m1
));
15417 /* Test integer_truep. */
15418 ASSERT_FALSE (integer_truep (i_0
));
15419 ASSERT_FALSE (integer_truep (wr_i_0
));
15420 ASSERT_TRUE (integer_truep (i_1
));
15421 ASSERT_TRUE (integer_truep (wr_i_1
));
15422 ASSERT_FALSE (integer_truep (i_m1
));
15423 ASSERT_FALSE (integer_truep (wr_i_m1
));
15424 ASSERT_FALSE (integer_truep (f_0
));
15425 ASSERT_FALSE (integer_truep (wr_f_0
));
15426 ASSERT_FALSE (integer_truep (f_1
));
15427 ASSERT_FALSE (integer_truep (wr_f_1
));
15428 ASSERT_FALSE (integer_truep (f_m1
));
15429 ASSERT_FALSE (integer_truep (wr_f_m1
));
15430 ASSERT_FALSE (integer_truep (c_i_0
));
15431 ASSERT_TRUE (integer_truep (c_i_1
));
15432 ASSERT_FALSE (integer_truep (c_i_m1
));
15433 ASSERT_FALSE (integer_truep (c_f_0
));
15434 ASSERT_FALSE (integer_truep (c_f_1
));
15435 ASSERT_FALSE (integer_truep (c_f_m1
));
15437 /* Test integer_nonzerop. */
15438 ASSERT_FALSE (integer_nonzerop (i_0
));
15439 ASSERT_FALSE (integer_nonzerop (wr_i_0
));
15440 ASSERT_TRUE (integer_nonzerop (i_1
));
15441 ASSERT_TRUE (integer_nonzerop (wr_i_1
));
15442 ASSERT_TRUE (integer_nonzerop (i_m1
));
15443 ASSERT_TRUE (integer_nonzerop (wr_i_m1
));
15444 ASSERT_FALSE (integer_nonzerop (f_0
));
15445 ASSERT_FALSE (integer_nonzerop (wr_f_0
));
15446 ASSERT_FALSE (integer_nonzerop (f_1
));
15447 ASSERT_FALSE (integer_nonzerop (wr_f_1
));
15448 ASSERT_FALSE (integer_nonzerop (f_m1
));
15449 ASSERT_FALSE (integer_nonzerop (wr_f_m1
));
15450 ASSERT_FALSE (integer_nonzerop (c_i_0
));
15451 ASSERT_TRUE (integer_nonzerop (c_i_1
));
15452 ASSERT_TRUE (integer_nonzerop (c_i_m1
));
15453 ASSERT_FALSE (integer_nonzerop (c_f_0
));
15454 ASSERT_FALSE (integer_nonzerop (c_f_1
));
15455 ASSERT_FALSE (integer_nonzerop (c_f_m1
));
15457 /* Test real_zerop. */
15458 ASSERT_FALSE (real_zerop (i_0
));
15459 ASSERT_FALSE (real_zerop (wr_i_0
));
15460 ASSERT_FALSE (real_zerop (i_1
));
15461 ASSERT_FALSE (real_zerop (wr_i_1
));
15462 ASSERT_FALSE (real_zerop (i_m1
));
15463 ASSERT_FALSE (real_zerop (wr_i_m1
));
15464 ASSERT_TRUE (real_zerop (f_0
));
15465 ASSERT_TRUE (real_zerop (wr_f_0
));
15466 ASSERT_FALSE (real_zerop (f_1
));
15467 ASSERT_FALSE (real_zerop (wr_f_1
));
15468 ASSERT_FALSE (real_zerop (f_m1
));
15469 ASSERT_FALSE (real_zerop (wr_f_m1
));
15470 ASSERT_FALSE (real_zerop (c_i_0
));
15471 ASSERT_FALSE (real_zerop (c_i_1
));
15472 ASSERT_FALSE (real_zerop (c_i_m1
));
15473 ASSERT_TRUE (real_zerop (c_f_0
));
15474 ASSERT_FALSE (real_zerop (c_f_1
));
15475 ASSERT_FALSE (real_zerop (c_f_m1
));
15477 /* Test real_onep. */
15478 ASSERT_FALSE (real_onep (i_0
));
15479 ASSERT_FALSE (real_onep (wr_i_0
));
15480 ASSERT_FALSE (real_onep (i_1
));
15481 ASSERT_FALSE (real_onep (wr_i_1
));
15482 ASSERT_FALSE (real_onep (i_m1
));
15483 ASSERT_FALSE (real_onep (wr_i_m1
));
15484 ASSERT_FALSE (real_onep (f_0
));
15485 ASSERT_FALSE (real_onep (wr_f_0
));
15486 ASSERT_TRUE (real_onep (f_1
));
15487 ASSERT_TRUE (real_onep (wr_f_1
));
15488 ASSERT_FALSE (real_onep (f_m1
));
15489 ASSERT_FALSE (real_onep (wr_f_m1
));
15490 ASSERT_FALSE (real_onep (c_i_0
));
15491 ASSERT_FALSE (real_onep (c_i_1
));
15492 ASSERT_FALSE (real_onep (c_i_m1
));
15493 ASSERT_FALSE (real_onep (c_f_0
));
15494 ASSERT_TRUE (real_onep (c_f_1
));
15495 ASSERT_FALSE (real_onep (c_f_m1
));
15497 /* Test real_minus_onep. */
15498 ASSERT_FALSE (real_minus_onep (i_0
));
15499 ASSERT_FALSE (real_minus_onep (wr_i_0
));
15500 ASSERT_FALSE (real_minus_onep (i_1
));
15501 ASSERT_FALSE (real_minus_onep (wr_i_1
));
15502 ASSERT_FALSE (real_minus_onep (i_m1
));
15503 ASSERT_FALSE (real_minus_onep (wr_i_m1
));
15504 ASSERT_FALSE (real_minus_onep (f_0
));
15505 ASSERT_FALSE (real_minus_onep (wr_f_0
));
15506 ASSERT_FALSE (real_minus_onep (f_1
));
15507 ASSERT_FALSE (real_minus_onep (wr_f_1
));
15508 ASSERT_TRUE (real_minus_onep (f_m1
));
15509 ASSERT_TRUE (real_minus_onep (wr_f_m1
));
15510 ASSERT_FALSE (real_minus_onep (c_i_0
));
15511 ASSERT_FALSE (real_minus_onep (c_i_1
));
15512 ASSERT_FALSE (real_minus_onep (c_i_m1
));
15513 ASSERT_FALSE (real_minus_onep (c_f_0
));
15514 ASSERT_FALSE (real_minus_onep (c_f_1
));
15515 ASSERT_TRUE (real_minus_onep (c_f_m1
));
15518 ASSERT_TRUE (zerop (i_0
));
15519 ASSERT_TRUE (zerop (wr_i_0
));
15520 ASSERT_FALSE (zerop (i_1
));
15521 ASSERT_FALSE (zerop (wr_i_1
));
15522 ASSERT_FALSE (zerop (i_m1
));
15523 ASSERT_FALSE (zerop (wr_i_m1
));
15524 ASSERT_TRUE (zerop (f_0
));
15525 ASSERT_TRUE (zerop (wr_f_0
));
15526 ASSERT_FALSE (zerop (f_1
));
15527 ASSERT_FALSE (zerop (wr_f_1
));
15528 ASSERT_FALSE (zerop (f_m1
));
15529 ASSERT_FALSE (zerop (wr_f_m1
));
15530 ASSERT_TRUE (zerop (c_i_0
));
15531 ASSERT_FALSE (zerop (c_i_1
));
15532 ASSERT_FALSE (zerop (c_i_m1
));
15533 ASSERT_TRUE (zerop (c_f_0
));
15534 ASSERT_FALSE (zerop (c_f_1
));
15535 ASSERT_FALSE (zerop (c_f_m1
));
15537 /* Test tree_expr_nonnegative_p. */
15538 ASSERT_TRUE (tree_expr_nonnegative_p (i_0
));
15539 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_0
));
15540 ASSERT_TRUE (tree_expr_nonnegative_p (i_1
));
15541 ASSERT_TRUE (tree_expr_nonnegative_p (wr_i_1
));
15542 ASSERT_FALSE (tree_expr_nonnegative_p (i_m1
));
15543 ASSERT_FALSE (tree_expr_nonnegative_p (wr_i_m1
));
15544 ASSERT_TRUE (tree_expr_nonnegative_p (f_0
));
15545 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_0
));
15546 ASSERT_TRUE (tree_expr_nonnegative_p (f_1
));
15547 ASSERT_TRUE (tree_expr_nonnegative_p (wr_f_1
));
15548 ASSERT_FALSE (tree_expr_nonnegative_p (f_m1
));
15549 ASSERT_FALSE (tree_expr_nonnegative_p (wr_f_m1
));
15550 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_0
));
15551 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_1
));
15552 ASSERT_FALSE (tree_expr_nonnegative_p (c_i_m1
));
15553 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_0
));
15554 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_1
));
15555 ASSERT_FALSE (tree_expr_nonnegative_p (c_f_m1
));
15557 /* Test tree_expr_nonzero_p. */
15558 ASSERT_FALSE (tree_expr_nonzero_p (i_0
));
15559 ASSERT_FALSE (tree_expr_nonzero_p (wr_i_0
));
15560 ASSERT_TRUE (tree_expr_nonzero_p (i_1
));
15561 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_1
));
15562 ASSERT_TRUE (tree_expr_nonzero_p (i_m1
));
15563 ASSERT_TRUE (tree_expr_nonzero_p (wr_i_m1
));
15565 /* Test integer_valued_real_p. */
15566 ASSERT_FALSE (integer_valued_real_p (i_0
));
15567 ASSERT_TRUE (integer_valued_real_p (f_0
));
15568 ASSERT_TRUE (integer_valued_real_p (wr_f_0
));
15569 ASSERT_TRUE (integer_valued_real_p (f_1
));
15570 ASSERT_TRUE (integer_valued_real_p (wr_f_1
));
15572 /* Test integer_pow2p. */
15573 ASSERT_FALSE (integer_pow2p (i_0
));
15574 ASSERT_TRUE (integer_pow2p (i_1
));
15575 ASSERT_TRUE (integer_pow2p (wr_i_1
));
15577 /* Test uniform_integer_cst_p. */
15578 ASSERT_TRUE (uniform_integer_cst_p (i_0
));
15579 ASSERT_TRUE (uniform_integer_cst_p (wr_i_0
));
15580 ASSERT_TRUE (uniform_integer_cst_p (i_1
));
15581 ASSERT_TRUE (uniform_integer_cst_p (wr_i_1
));
15582 ASSERT_TRUE (uniform_integer_cst_p (i_m1
));
15583 ASSERT_TRUE (uniform_integer_cst_p (wr_i_m1
));
15584 ASSERT_FALSE (uniform_integer_cst_p (f_0
));
15585 ASSERT_FALSE (uniform_integer_cst_p (wr_f_0
));
15586 ASSERT_FALSE (uniform_integer_cst_p (f_1
));
15587 ASSERT_FALSE (uniform_integer_cst_p (wr_f_1
));
15588 ASSERT_FALSE (uniform_integer_cst_p (f_m1
));
15589 ASSERT_FALSE (uniform_integer_cst_p (wr_f_m1
));
15590 ASSERT_FALSE (uniform_integer_cst_p (c_i_0
));
15591 ASSERT_FALSE (uniform_integer_cst_p (c_i_1
));
15592 ASSERT_FALSE (uniform_integer_cst_p (c_i_m1
));
15593 ASSERT_FALSE (uniform_integer_cst_p (c_f_0
));
15594 ASSERT_FALSE (uniform_integer_cst_p (c_f_1
));
15595 ASSERT_FALSE (uniform_integer_cst_p (c_f_m1
));
15598 /* Check that string escaping works correctly. */
15601 test_escaped_strings (void)
15604 escaped_string msg
;
15607 /* ASSERT_STREQ does not accept NULL as a valid test
15608 result, so we have to use ASSERT_EQ instead. */
15609 ASSERT_EQ (NULL
, (const char *) msg
);
15612 ASSERT_STREQ ("", (const char *) msg
);
15614 msg
.escape ("foobar");
15615 ASSERT_STREQ ("foobar", (const char *) msg
);
15617 /* Ensure that we have -fmessage-length set to 0. */
15618 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15619 pp_line_cutoff (global_dc
->printer
) = 0;
15621 msg
.escape ("foo\nbar");
15622 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15624 msg
.escape ("\a\b\f\n\r\t\v");
15625 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15627 /* Now repeat the tests with -fmessage-length set to 5. */
15628 pp_line_cutoff (global_dc
->printer
) = 5;
15630 /* Note that the newline is not translated into an escape. */
15631 msg
.escape ("foo\nbar");
15632 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15634 msg
.escape ("\a\b\f\n\r\t\v");
15635 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15637 /* Restore the original message length setting. */
15638 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15641 /* Run all of the selftests within this file. */
15646 test_integer_constants ();
15647 test_identifiers ();
15649 test_vector_cst_patterns ();
15650 test_location_wrappers ();
15651 test_predicates ();
15652 test_escaped_strings ();
15655 } // namespace selftest
15657 #endif /* CHECKING_P */
15659 #include "gt-tree.h"