1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2018 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 tree global_trees
[TI_MAX
];
269 tree integer_types
[itk_none
];
271 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
272 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
274 bool tree_contains_struct
[MAX_TREE_CODES
][64];
276 /* Number of operands for each OpenMP clause. */
277 unsigned const char omp_clause_num_ops
[] =
279 0, /* OMP_CLAUSE_ERROR */
280 1, /* OMP_CLAUSE_PRIVATE */
281 1, /* OMP_CLAUSE_SHARED */
282 1, /* OMP_CLAUSE_FIRSTPRIVATE */
283 2, /* OMP_CLAUSE_LASTPRIVATE */
284 5, /* OMP_CLAUSE_REDUCTION */
285 5, /* OMP_CLAUSE_TASK_REDUCTION */
286 5, /* OMP_CLAUSE_IN_REDUCTION */
287 1, /* OMP_CLAUSE_COPYIN */
288 1, /* OMP_CLAUSE_COPYPRIVATE */
289 3, /* OMP_CLAUSE_LINEAR */
290 2, /* OMP_CLAUSE_ALIGNED */
291 1, /* OMP_CLAUSE_DEPEND */
292 1, /* OMP_CLAUSE_NONTEMPORAL */
293 1, /* OMP_CLAUSE_UNIFORM */
294 1, /* OMP_CLAUSE_TO_DECLARE */
295 1, /* OMP_CLAUSE_LINK */
296 2, /* OMP_CLAUSE_FROM */
297 2, /* OMP_CLAUSE_TO */
298 2, /* OMP_CLAUSE_MAP */
299 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
300 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
301 2, /* OMP_CLAUSE__CACHE_ */
302 2, /* OMP_CLAUSE_GANG */
303 1, /* OMP_CLAUSE_ASYNC */
304 1, /* OMP_CLAUSE_WAIT */
305 0, /* OMP_CLAUSE_AUTO */
306 0, /* OMP_CLAUSE_SEQ */
307 1, /* OMP_CLAUSE__LOOPTEMP_ */
308 1, /* OMP_CLAUSE__REDUCTEMP_ */
309 1, /* OMP_CLAUSE_IF */
310 1, /* OMP_CLAUSE_NUM_THREADS */
311 1, /* OMP_CLAUSE_SCHEDULE */
312 0, /* OMP_CLAUSE_NOWAIT */
313 1, /* OMP_CLAUSE_ORDERED */
314 0, /* OMP_CLAUSE_DEFAULT */
315 3, /* OMP_CLAUSE_COLLAPSE */
316 0, /* OMP_CLAUSE_UNTIED */
317 1, /* OMP_CLAUSE_FINAL */
318 0, /* OMP_CLAUSE_MERGEABLE */
319 1, /* OMP_CLAUSE_DEVICE */
320 1, /* OMP_CLAUSE_DIST_SCHEDULE */
321 0, /* OMP_CLAUSE_INBRANCH */
322 0, /* OMP_CLAUSE_NOTINBRANCH */
323 1, /* OMP_CLAUSE_NUM_TEAMS */
324 1, /* OMP_CLAUSE_THREAD_LIMIT */
325 0, /* OMP_CLAUSE_PROC_BIND */
326 1, /* OMP_CLAUSE_SAFELEN */
327 1, /* OMP_CLAUSE_SIMDLEN */
328 0, /* OMP_CLAUSE_FOR */
329 0, /* OMP_CLAUSE_PARALLEL */
330 0, /* OMP_CLAUSE_SECTIONS */
331 0, /* OMP_CLAUSE_TASKGROUP */
332 1, /* OMP_CLAUSE_PRIORITY */
333 1, /* OMP_CLAUSE_GRAINSIZE */
334 1, /* OMP_CLAUSE_NUM_TASKS */
335 0, /* OMP_CLAUSE_NOGROUP */
336 0, /* OMP_CLAUSE_THREADS */
337 0, /* OMP_CLAUSE_SIMD */
338 1, /* OMP_CLAUSE_HINT */
339 0, /* OMP_CLAUSE_DEFALTMAP */
340 1, /* OMP_CLAUSE__SIMDUID_ */
341 0, /* OMP_CLAUSE__SIMT_ */
342 0, /* OMP_CLAUSE_INDEPENDENT */
343 1, /* OMP_CLAUSE_WORKER */
344 1, /* OMP_CLAUSE_VECTOR */
345 1, /* OMP_CLAUSE_NUM_GANGS */
346 1, /* OMP_CLAUSE_NUM_WORKERS */
347 1, /* OMP_CLAUSE_VECTOR_LENGTH */
348 3, /* OMP_CLAUSE_TILE */
349 2, /* OMP_CLAUSE__GRIDDIM_ */
350 0, /* OMP_CLAUSE_IF_PRESENT */
351 0, /* OMP_CLAUSE_FINALIZE */
354 const char * const omp_clause_code_name
[] =
432 /* Return the tree node structure used by tree code CODE. */
434 static inline enum tree_node_structure_enum
435 tree_node_structure_for_code (enum tree_code code
)
437 switch (TREE_CODE_CLASS (code
))
439 case tcc_declaration
:
444 return TS_FIELD_DECL
;
450 return TS_LABEL_DECL
;
452 return TS_RESULT_DECL
;
453 case DEBUG_EXPR_DECL
:
456 return TS_CONST_DECL
;
460 return TS_FUNCTION_DECL
;
461 case TRANSLATION_UNIT_DECL
:
462 return TS_TRANSLATION_UNIT_DECL
;
464 return TS_DECL_NON_COMMON
;
468 return TS_TYPE_NON_COMMON
;
477 default: /* tcc_constant and tcc_exceptional */
482 /* tcc_constant cases. */
483 case VOID_CST
: return TS_TYPED
;
484 case INTEGER_CST
: return TS_INT_CST
;
485 case POLY_INT_CST
: return TS_POLY_INT_CST
;
486 case REAL_CST
: return TS_REAL_CST
;
487 case FIXED_CST
: return TS_FIXED_CST
;
488 case COMPLEX_CST
: return TS_COMPLEX
;
489 case VECTOR_CST
: return TS_VECTOR
;
490 case STRING_CST
: return TS_STRING
;
491 /* tcc_exceptional cases. */
492 case ERROR_MARK
: return TS_COMMON
;
493 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
494 case TREE_LIST
: return TS_LIST
;
495 case TREE_VEC
: return TS_VEC
;
496 case SSA_NAME
: return TS_SSA_NAME
;
497 case PLACEHOLDER_EXPR
: return TS_COMMON
;
498 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
499 case BLOCK
: return TS_BLOCK
;
500 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
501 case TREE_BINFO
: return TS_BINFO
;
502 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
503 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
504 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
512 /* Initialize tree_contains_struct to describe the hierarchy of tree
516 initialize_tree_contains_struct (void)
520 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
523 enum tree_node_structure_enum ts_code
;
525 code
= (enum tree_code
) i
;
526 ts_code
= tree_node_structure_for_code (code
);
528 /* Mark the TS structure itself. */
529 tree_contains_struct
[code
][ts_code
] = 1;
531 /* Mark all the structures that TS is derived from. */
536 case TS_OPTIMIZATION
:
537 case TS_TARGET_OPTION
:
543 case TS_POLY_INT_CST
:
552 case TS_STATEMENT_LIST
:
553 MARK_TS_TYPED (code
);
557 case TS_DECL_MINIMAL
:
563 MARK_TS_COMMON (code
);
566 case TS_TYPE_WITH_LANG_SPECIFIC
:
567 MARK_TS_TYPE_COMMON (code
);
570 case TS_TYPE_NON_COMMON
:
571 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
575 MARK_TS_DECL_MINIMAL (code
);
580 MARK_TS_DECL_COMMON (code
);
583 case TS_DECL_NON_COMMON
:
584 MARK_TS_DECL_WITH_VIS (code
);
587 case TS_DECL_WITH_VIS
:
591 MARK_TS_DECL_WRTL (code
);
595 MARK_TS_DECL_COMMON (code
);
599 MARK_TS_DECL_WITH_VIS (code
);
603 case TS_FUNCTION_DECL
:
604 MARK_TS_DECL_NON_COMMON (code
);
607 case TS_TRANSLATION_UNIT_DECL
:
608 MARK_TS_DECL_COMMON (code
);
616 /* Basic consistency checks for attributes used in fold. */
617 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
618 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
619 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
620 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
621 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
622 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
623 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
624 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
625 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
626 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
628 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
629 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
630 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
631 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
632 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
633 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
634 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
635 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
636 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
637 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
638 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
639 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
640 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
641 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
642 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
643 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
644 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
645 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
646 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
647 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
648 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
649 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
650 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
651 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
652 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
653 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
654 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
655 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
656 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
665 /* Initialize the hash table of types. */
667 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
670 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
673 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
675 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
677 poly_int_cst_hash_table
= hash_table
<poly_int_cst_hasher
>::create_ggc (64);
679 int_cst_node
= make_int_cst (1, 1);
681 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
683 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
684 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
686 /* Initialize the tree_contains_struct array. */
687 initialize_tree_contains_struct ();
688 lang_hooks
.init_ts ();
692 /* The name of the object as the assembler will see it (but before any
693 translations made by ASM_OUTPUT_LABELREF). Often this is the same
694 as DECL_NAME. It is an IDENTIFIER_NODE. */
696 decl_assembler_name (tree decl
)
698 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
699 lang_hooks
.set_decl_assembler_name (decl
);
700 return DECL_ASSEMBLER_NAME_RAW (decl
);
703 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
704 (either of which may be NULL). Inform the FE, if this changes the
708 overwrite_decl_assembler_name (tree decl
, tree name
)
710 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
711 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
714 /* When the target supports COMDAT groups, this indicates which group the
715 DECL is associated with. This can be either an IDENTIFIER_NODE or a
716 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
718 decl_comdat_group (const_tree node
)
720 struct symtab_node
*snode
= symtab_node::get (node
);
723 return snode
->get_comdat_group ();
726 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
728 decl_comdat_group_id (const_tree node
)
730 struct symtab_node
*snode
= symtab_node::get (node
);
733 return snode
->get_comdat_group_id ();
736 /* When the target supports named section, return its name as IDENTIFIER_NODE
737 or NULL if it is in no section. */
739 decl_section_name (const_tree node
)
741 struct symtab_node
*snode
= symtab_node::get (node
);
744 return snode
->get_section ();
747 /* Set section name of NODE to VALUE (that is expected to be
750 set_decl_section_name (tree node
, const char *value
)
752 struct symtab_node
*snode
;
756 snode
= symtab_node::get (node
);
760 else if (VAR_P (node
))
761 snode
= varpool_node::get_create (node
);
763 snode
= cgraph_node::get_create (node
);
764 snode
->set_section (value
);
767 /* Return TLS model of a variable NODE. */
769 decl_tls_model (const_tree node
)
771 struct varpool_node
*snode
= varpool_node::get (node
);
773 return TLS_MODEL_NONE
;
774 return snode
->tls_model
;
777 /* Set TLS model of variable NODE to MODEL. */
779 set_decl_tls_model (tree node
, enum tls_model model
)
781 struct varpool_node
*vnode
;
783 if (model
== TLS_MODEL_NONE
)
785 vnode
= varpool_node::get (node
);
790 vnode
= varpool_node::get_create (node
);
791 vnode
->tls_model
= model
;
794 /* Compute the number of bytes occupied by a tree with code CODE.
795 This function cannot be used for nodes that have variable sizes,
796 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
798 tree_code_size (enum tree_code code
)
800 switch (TREE_CODE_CLASS (code
))
802 case tcc_declaration
: /* A decl node */
805 case FIELD_DECL
: return sizeof (tree_field_decl
);
806 case PARM_DECL
: return sizeof (tree_parm_decl
);
807 case VAR_DECL
: return sizeof (tree_var_decl
);
808 case LABEL_DECL
: return sizeof (tree_label_decl
);
809 case RESULT_DECL
: return sizeof (tree_result_decl
);
810 case CONST_DECL
: return sizeof (tree_const_decl
);
811 case TYPE_DECL
: return sizeof (tree_type_decl
);
812 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
813 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
814 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
817 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
819 gcc_checking_assert (code
>= NUM_TREE_CODES
);
820 return lang_hooks
.tree_size (code
);
823 case tcc_type
: /* a type node */
834 case FIXED_POINT_TYPE
:
840 case QUAL_UNION_TYPE
:
844 case LANG_TYPE
: return sizeof (tree_type_non_common
);
846 gcc_checking_assert (code
>= NUM_TREE_CODES
);
847 return lang_hooks
.tree_size (code
);
850 case tcc_reference
: /* a reference */
851 case tcc_expression
: /* an expression */
852 case tcc_statement
: /* an expression with side effects */
853 case tcc_comparison
: /* a comparison expression */
854 case tcc_unary
: /* a unary arithmetic expression */
855 case tcc_binary
: /* a binary arithmetic expression */
856 return (sizeof (struct tree_exp
)
857 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
859 case tcc_constant
: /* a constant */
862 case VOID_CST
: return sizeof (tree_typed
);
863 case INTEGER_CST
: gcc_unreachable ();
864 case POLY_INT_CST
: return sizeof (tree_poly_int_cst
);
865 case REAL_CST
: return sizeof (tree_real_cst
);
866 case FIXED_CST
: return sizeof (tree_fixed_cst
);
867 case COMPLEX_CST
: return sizeof (tree_complex
);
868 case VECTOR_CST
: gcc_unreachable ();
869 case STRING_CST
: gcc_unreachable ();
871 gcc_checking_assert (code
>= NUM_TREE_CODES
);
872 return lang_hooks
.tree_size (code
);
875 case tcc_exceptional
: /* something random, like an identifier. */
878 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
879 case TREE_LIST
: return sizeof (tree_list
);
882 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
884 case TREE_VEC
: gcc_unreachable ();
885 case OMP_CLAUSE
: gcc_unreachable ();
887 case SSA_NAME
: return sizeof (tree_ssa_name
);
889 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
890 case BLOCK
: return sizeof (struct tree_block
);
891 case CONSTRUCTOR
: return sizeof (tree_constructor
);
892 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
893 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
896 gcc_checking_assert (code
>= NUM_TREE_CODES
);
897 return lang_hooks
.tree_size (code
);
905 /* Compute the number of bytes occupied by NODE. This routine only
906 looks at TREE_CODE, except for those nodes that have variable sizes. */
908 tree_size (const_tree node
)
910 const enum tree_code code
= TREE_CODE (node
);
914 return (sizeof (struct tree_int_cst
)
915 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
918 return (offsetof (struct tree_binfo
, base_binfos
)
920 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
923 return (sizeof (struct tree_vec
)
924 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
927 return (sizeof (struct tree_vector
)
928 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
931 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
934 return (sizeof (struct tree_omp_clause
)
935 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
939 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
940 return (sizeof (struct tree_exp
)
941 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
943 return tree_code_size (code
);
947 /* Return tree node kind based on tree CODE. */
949 static tree_node_kind
950 get_stats_node_kind (enum tree_code code
)
952 enum tree_code_class type
= TREE_CODE_CLASS (code
);
956 case tcc_declaration
: /* A decl node */
958 case tcc_type
: /* a type node */
960 case tcc_statement
: /* an expression with side effects */
962 case tcc_reference
: /* a reference */
964 case tcc_expression
: /* an expression */
965 case tcc_comparison
: /* a comparison expression */
966 case tcc_unary
: /* a unary arithmetic expression */
967 case tcc_binary
: /* a binary arithmetic expression */
969 case tcc_constant
: /* a constant */
971 case tcc_exceptional
: /* something random, like an identifier. */
974 case IDENTIFIER_NODE
:
981 return ssa_name_kind
;
987 return omp_clause_kind
;
999 /* Record interesting allocation statistics for a tree node with CODE
1003 record_node_allocation_statistics (enum tree_code code
, size_t length
)
1005 if (!GATHER_STATISTICS
)
1008 tree_node_kind kind
= get_stats_node_kind (code
);
1010 tree_code_counts
[(int) code
]++;
1011 tree_node_counts
[(int) kind
]++;
1012 tree_node_sizes
[(int) kind
] += length
;
1015 /* Allocate and return a new UID from the DECL_UID namespace. */
1018 allocate_decl_uid (void)
1020 return next_decl_uid
++;
1023 /* Return a newly allocated node of code CODE. For decl and type
1024 nodes, some other fields are initialized. The rest of the node is
1025 initialized to zero. This function cannot be used for TREE_VEC,
1026 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1029 Achoo! I got a code in the node. */
1032 make_node (enum tree_code code MEM_STAT_DECL
)
1035 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1036 size_t length
= tree_code_size (code
);
1038 record_node_allocation_statistics (code
, length
);
1040 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1041 TREE_SET_CODE (t
, code
);
1046 if (code
!= DEBUG_BEGIN_STMT
)
1047 TREE_SIDE_EFFECTS (t
) = 1;
1050 case tcc_declaration
:
1051 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1053 if (code
== FUNCTION_DECL
)
1055 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1056 SET_DECL_MODE (t
, FUNCTION_MODE
);
1059 SET_DECL_ALIGN (t
, 1);
1061 DECL_SOURCE_LOCATION (t
) = input_location
;
1062 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1063 DECL_UID (t
) = --next_debug_decl_uid
;
1066 DECL_UID (t
) = allocate_decl_uid ();
1067 SET_DECL_PT_UID (t
, -1);
1069 if (TREE_CODE (t
) == LABEL_DECL
)
1070 LABEL_DECL_UID (t
) = -1;
1075 TYPE_UID (t
) = next_type_uid
++;
1076 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1077 TYPE_USER_ALIGN (t
) = 0;
1078 TYPE_MAIN_VARIANT (t
) = t
;
1079 TYPE_CANONICAL (t
) = t
;
1081 /* Default to no attributes for type, but let target change that. */
1082 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1083 targetm
.set_default_type_attributes (t
);
1085 /* We have not yet computed the alias set for this type. */
1086 TYPE_ALIAS_SET (t
) = -1;
1090 TREE_CONSTANT (t
) = 1;
1093 case tcc_expression
:
1099 case PREDECREMENT_EXPR
:
1100 case PREINCREMENT_EXPR
:
1101 case POSTDECREMENT_EXPR
:
1102 case POSTINCREMENT_EXPR
:
1103 /* All of these have side-effects, no matter what their
1105 TREE_SIDE_EFFECTS (t
) = 1;
1113 case tcc_exceptional
:
1116 case TARGET_OPTION_NODE
:
1117 TREE_TARGET_OPTION(t
)
1118 = ggc_cleared_alloc
<struct cl_target_option
> ();
1121 case OPTIMIZATION_NODE
:
1122 TREE_OPTIMIZATION (t
)
1123 = ggc_cleared_alloc
<struct cl_optimization
> ();
1132 /* Other classes need no special treatment. */
1139 /* Free tree node. */
1142 free_node (tree node
)
1144 enum tree_code code
= TREE_CODE (node
);
1145 if (GATHER_STATISTICS
)
1147 enum tree_node_kind kind
= get_stats_node_kind (code
);
1149 gcc_checking_assert (tree_code_counts
[(int) TREE_CODE (node
)] != 0);
1150 gcc_checking_assert (tree_node_counts
[(int) kind
] != 0);
1151 gcc_checking_assert (tree_node_sizes
[(int) kind
] >= tree_size (node
));
1153 tree_code_counts
[(int) TREE_CODE (node
)]--;
1154 tree_node_counts
[(int) kind
]--;
1155 tree_node_sizes
[(int) kind
] -= tree_size (node
);
1157 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1158 vec_free (CONSTRUCTOR_ELTS (node
));
1159 else if (code
== BLOCK
)
1160 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1161 else if (code
== TREE_BINFO
)
1162 vec_free (BINFO_BASE_ACCESSES (node
));
1166 /* Return a new node with the same contents as NODE except that its
1167 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1170 copy_node (tree node MEM_STAT_DECL
)
1173 enum tree_code code
= TREE_CODE (node
);
1176 gcc_assert (code
!= STATEMENT_LIST
);
1178 length
= tree_size (node
);
1179 record_node_allocation_statistics (code
, length
);
1180 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1181 memcpy (t
, node
, length
);
1183 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1185 TREE_ASM_WRITTEN (t
) = 0;
1186 TREE_VISITED (t
) = 0;
1188 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1190 if (code
== DEBUG_EXPR_DECL
)
1191 DECL_UID (t
) = --next_debug_decl_uid
;
1194 DECL_UID (t
) = allocate_decl_uid ();
1195 if (DECL_PT_UID_SET_P (node
))
1196 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1198 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1199 && DECL_HAS_VALUE_EXPR_P (node
))
1201 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1202 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1204 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1207 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1208 t
->decl_with_vis
.symtab_node
= NULL
;
1210 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1212 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1213 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1215 if (TREE_CODE (node
) == FUNCTION_DECL
)
1217 DECL_STRUCT_FUNCTION (t
) = NULL
;
1218 t
->decl_with_vis
.symtab_node
= NULL
;
1221 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1223 TYPE_UID (t
) = next_type_uid
++;
1224 /* The following is so that the debug code for
1225 the copy is different from the original type.
1226 The two statements usually duplicate each other
1227 (because they clear fields of the same union),
1228 but the optimizer should catch that. */
1229 TYPE_SYMTAB_ADDRESS (t
) = 0;
1230 TYPE_SYMTAB_DIE (t
) = 0;
1232 /* Do not copy the values cache. */
1233 if (TYPE_CACHED_VALUES_P (t
))
1235 TYPE_CACHED_VALUES_P (t
) = 0;
1236 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1239 else if (code
== TARGET_OPTION_NODE
)
1241 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1242 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1243 sizeof (struct cl_target_option
));
1245 else if (code
== OPTIMIZATION_NODE
)
1247 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1248 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1249 sizeof (struct cl_optimization
));
1255 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1256 For example, this can copy a list made of TREE_LIST nodes. */
1259 copy_list (tree list
)
1267 head
= prev
= copy_node (list
);
1268 next
= TREE_CHAIN (list
);
1271 TREE_CHAIN (prev
) = copy_node (next
);
1272 prev
= TREE_CHAIN (prev
);
1273 next
= TREE_CHAIN (next
);
1279 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1280 INTEGER_CST with value CST and type TYPE. */
1283 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1285 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1286 /* We need extra HWIs if CST is an unsigned integer with its
1288 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1289 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1290 return cst
.get_len ();
1293 /* Return a new INTEGER_CST with value CST and type TYPE. */
1296 build_new_int_cst (tree type
, const wide_int
&cst
)
1298 unsigned int len
= cst
.get_len ();
1299 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1300 tree nt
= make_int_cst (len
, ext_len
);
1305 TREE_INT_CST_ELT (nt
, ext_len
)
1306 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1307 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1308 TREE_INT_CST_ELT (nt
, i
) = -1;
1310 else if (TYPE_UNSIGNED (type
)
1311 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1314 TREE_INT_CST_ELT (nt
, len
)
1315 = zext_hwi (cst
.elt (len
),
1316 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1319 for (unsigned int i
= 0; i
< len
; i
++)
1320 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1321 TREE_TYPE (nt
) = type
;
1325 /* Return a new POLY_INT_CST with coefficients COEFFS and type TYPE. */
1328 build_new_poly_int_cst (tree type
, tree (&coeffs
)[NUM_POLY_INT_COEFFS
]
1331 size_t length
= sizeof (struct tree_poly_int_cst
);
1332 record_node_allocation_statistics (POLY_INT_CST
, length
);
1334 tree t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1336 TREE_SET_CODE (t
, POLY_INT_CST
);
1337 TREE_CONSTANT (t
) = 1;
1338 TREE_TYPE (t
) = type
;
1339 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1340 POLY_INT_CST_COEFF (t
, i
) = coeffs
[i
];
1344 /* Create a constant tree that contains CST sign-extended to TYPE. */
1347 build_int_cst (tree type
, poly_int64 cst
)
1349 /* Support legacy code. */
1351 type
= integer_type_node
;
1353 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1356 /* Create a constant tree that contains CST zero-extended to TYPE. */
1359 build_int_cstu (tree type
, poly_uint64 cst
)
1361 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1364 /* Create a constant tree that contains CST sign-extended to TYPE. */
1367 build_int_cst_type (tree type
, poly_int64 cst
)
1370 return wide_int_to_tree (type
, wi::shwi (cst
, TYPE_PRECISION (type
)));
1373 /* Constructs tree in type TYPE from with value given by CST. Signedness
1374 of CST is assumed to be the same as the signedness of TYPE. */
1377 double_int_to_tree (tree type
, double_int cst
)
1379 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1382 /* We force the wide_int CST to the range of the type TYPE by sign or
1383 zero extending it. OVERFLOWABLE indicates if we are interested in
1384 overflow of the value, when >0 we are only interested in signed
1385 overflow, for <0 we are interested in any overflow. OVERFLOWED
1386 indicates whether overflow has already occurred. CONST_OVERFLOWED
1387 indicates whether constant overflow has already occurred. We force
1388 T's value to be within range of T's type (by setting to 0 or 1 all
1389 the bits outside the type's range). We set TREE_OVERFLOWED if,
1390 OVERFLOWED is nonzero,
1391 or OVERFLOWABLE is >0 and signed overflow occurs
1392 or OVERFLOWABLE is <0 and any overflow occurs
1393 We return a new tree node for the extended wide_int. The node
1394 is shared if no overflow flags are set. */
1398 force_fit_type (tree type
, const poly_wide_int_ref
&cst
,
1399 int overflowable
, bool overflowed
)
1401 signop sign
= TYPE_SIGN (type
);
1403 /* If we need to set overflow flags, return a new unshared node. */
1404 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1408 || (overflowable
> 0 && sign
== SIGNED
))
1410 poly_wide_int tmp
= poly_wide_int::from (cst
, TYPE_PRECISION (type
),
1413 if (tmp
.is_constant ())
1414 t
= build_new_int_cst (type
, tmp
.coeffs
[0]);
1417 tree coeffs
[NUM_POLY_INT_COEFFS
];
1418 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1420 coeffs
[i
] = build_new_int_cst (type
, tmp
.coeffs
[i
]);
1421 TREE_OVERFLOW (coeffs
[i
]) = 1;
1423 t
= build_new_poly_int_cst (type
, coeffs
);
1425 TREE_OVERFLOW (t
) = 1;
1430 /* Else build a shared node. */
1431 return wide_int_to_tree (type
, cst
);
1434 /* These are the hash table functions for the hash table of INTEGER_CST
1435 nodes of a sizetype. */
1437 /* Return the hash code X, an INTEGER_CST. */
1440 int_cst_hasher::hash (tree x
)
1442 const_tree
const t
= x
;
1443 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1446 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1447 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1452 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1453 is the same as that given by *Y, which is the same. */
1456 int_cst_hasher::equal (tree x
, tree y
)
1458 const_tree
const xt
= x
;
1459 const_tree
const yt
= y
;
1461 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1462 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1463 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1466 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1467 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1473 /* Create an INT_CST node of TYPE and value CST.
1474 The returned node is always shared. For small integers we use a
1475 per-type vector cache, for larger ones we use a single hash table.
1476 The value is extended from its precision according to the sign of
1477 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1478 the upper bits and ensures that hashing and value equality based
1479 upon the underlying HOST_WIDE_INTs works without masking. */
1482 wide_int_to_tree_1 (tree type
, const wide_int_ref
&pcst
)
1489 unsigned int prec
= TYPE_PRECISION (type
);
1490 signop sgn
= TYPE_SIGN (type
);
1492 /* Verify that everything is canonical. */
1493 int l
= pcst
.get_len ();
1496 if (pcst
.elt (l
- 1) == 0)
1497 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1498 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1499 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1502 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1503 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1507 /* We just need to store a single HOST_WIDE_INT. */
1509 if (TYPE_UNSIGNED (type
))
1510 hwi
= cst
.to_uhwi ();
1512 hwi
= cst
.to_shwi ();
1514 switch (TREE_CODE (type
))
1517 gcc_assert (hwi
== 0);
1521 case REFERENCE_TYPE
:
1522 /* Cache NULL pointer and zero bounds. */
1531 /* Cache false or true. */
1533 if (IN_RANGE (hwi
, 0, 1))
1539 if (TYPE_SIGN (type
) == UNSIGNED
)
1542 limit
= INTEGER_SHARE_LIMIT
;
1543 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1548 /* Cache [-1, N). */
1549 limit
= INTEGER_SHARE_LIMIT
+ 1;
1550 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1564 /* Look for it in the type's vector of small shared ints. */
1565 if (!TYPE_CACHED_VALUES_P (type
))
1567 TYPE_CACHED_VALUES_P (type
) = 1;
1568 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1571 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1573 /* Make sure no one is clobbering the shared constant. */
1574 gcc_checking_assert (TREE_TYPE (t
) == type
1575 && TREE_INT_CST_NUNITS (t
) == 1
1576 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1577 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1578 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1581 /* Create a new shared int. */
1582 t
= build_new_int_cst (type
, cst
);
1583 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1588 /* Use the cache of larger shared ints, using int_cst_node as
1591 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1592 TREE_TYPE (int_cst_node
) = type
;
1594 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1598 /* Insert this one into the hash table. */
1601 /* Make a new node for next time round. */
1602 int_cst_node
= make_int_cst (1, 1);
1608 /* The value either hashes properly or we drop it on the floor
1609 for the gc to take care of. There will not be enough of them
1612 tree nt
= build_new_int_cst (type
, cst
);
1613 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1617 /* Insert this one into the hash table. */
1629 poly_int_cst_hasher::hash (tree t
)
1631 inchash::hash hstate
;
1633 hstate
.add_int (TYPE_UID (TREE_TYPE (t
)));
1634 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1635 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
1637 return hstate
.end ();
1641 poly_int_cst_hasher::equal (tree x
, const compare_type
&y
)
1643 if (TREE_TYPE (x
) != y
.first
)
1645 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1646 if (wi::to_wide (POLY_INT_CST_COEFF (x
, i
)) != y
.second
->coeffs
[i
])
1651 /* Build a POLY_INT_CST node with type TYPE and with the elements in VALUES.
1652 The elements must also have type TYPE. */
1655 build_poly_int_cst (tree type
, const poly_wide_int_ref
&values
)
1657 unsigned int prec
= TYPE_PRECISION (type
);
1658 gcc_assert (prec
<= values
.coeffs
[0].get_precision ());
1659 poly_wide_int c
= poly_wide_int::from (values
, prec
, SIGNED
);
1662 h
.add_int (TYPE_UID (type
));
1663 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1664 h
.add_wide_int (c
.coeffs
[i
]);
1665 poly_int_cst_hasher::compare_type
comp (type
, &c
);
1666 tree
*slot
= poly_int_cst_hash_table
->find_slot_with_hash (comp
, h
.end (),
1668 if (*slot
== NULL_TREE
)
1670 tree coeffs
[NUM_POLY_INT_COEFFS
];
1671 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
1672 coeffs
[i
] = wide_int_to_tree_1 (type
, c
.coeffs
[i
]);
1673 *slot
= build_new_poly_int_cst (type
, coeffs
);
1678 /* Create a constant tree with value VALUE in type TYPE. */
1681 wide_int_to_tree (tree type
, const poly_wide_int_ref
&value
)
1683 if (value
.is_constant ())
1684 return wide_int_to_tree_1 (type
, value
.coeffs
[0]);
1685 return build_poly_int_cst (type
, value
);
1689 cache_integer_cst (tree t
)
1691 tree type
= TREE_TYPE (t
);
1694 int prec
= TYPE_PRECISION (type
);
1696 gcc_assert (!TREE_OVERFLOW (t
));
1698 switch (TREE_CODE (type
))
1701 gcc_assert (integer_zerop (t
));
1705 case REFERENCE_TYPE
:
1706 /* Cache NULL pointer. */
1707 if (integer_zerop (t
))
1715 /* Cache false or true. */
1717 if (wi::ltu_p (wi::to_wide (t
), 2))
1718 ix
= TREE_INT_CST_ELT (t
, 0);
1723 if (TYPE_UNSIGNED (type
))
1726 limit
= INTEGER_SHARE_LIMIT
;
1728 /* This is a little hokie, but if the prec is smaller than
1729 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1730 obvious test will not get the correct answer. */
1731 if (prec
< HOST_BITS_PER_WIDE_INT
)
1733 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1734 ix
= tree_to_uhwi (t
);
1736 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1737 ix
= tree_to_uhwi (t
);
1742 limit
= INTEGER_SHARE_LIMIT
+ 1;
1744 if (integer_minus_onep (t
))
1746 else if (!wi::neg_p (wi::to_wide (t
)))
1748 if (prec
< HOST_BITS_PER_WIDE_INT
)
1750 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1751 ix
= tree_to_shwi (t
) + 1;
1753 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1754 ix
= tree_to_shwi (t
) + 1;
1768 /* Look for it in the type's vector of small shared ints. */
1769 if (!TYPE_CACHED_VALUES_P (type
))
1771 TYPE_CACHED_VALUES_P (type
) = 1;
1772 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1775 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1776 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1780 /* Use the cache of larger shared ints. */
1781 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1782 /* If there is already an entry for the number verify it's the
1785 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1787 /* Otherwise insert this one into the hash table. */
1793 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1794 and the rest are zeros. */
1797 build_low_bits_mask (tree type
, unsigned bits
)
1799 gcc_assert (bits
<= TYPE_PRECISION (type
));
1801 return wide_int_to_tree (type
, wi::mask (bits
, false,
1802 TYPE_PRECISION (type
)));
1805 /* Checks that X is integer constant that can be expressed in (unsigned)
1806 HOST_WIDE_INT without loss of precision. */
1809 cst_and_fits_in_hwi (const_tree x
)
1811 return (TREE_CODE (x
) == INTEGER_CST
1812 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1815 /* Build a newly constructed VECTOR_CST with the given values of
1816 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1819 make_vector (unsigned log2_npatterns
,
1820 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1822 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1824 unsigned npatterns
= 1 << log2_npatterns
;
1825 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1826 unsigned length
= (sizeof (struct tree_vector
)
1827 + (encoded_nelts
- 1) * sizeof (tree
));
1829 record_node_allocation_statistics (VECTOR_CST
, length
);
1831 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1833 TREE_SET_CODE (t
, VECTOR_CST
);
1834 TREE_CONSTANT (t
) = 1;
1835 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1836 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1841 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1842 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1845 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1847 unsigned HOST_WIDE_INT idx
, nelts
;
1850 /* We can't construct a VECTOR_CST for a variable number of elements. */
1851 nelts
= TYPE_VECTOR_SUBPARTS (type
).to_constant ();
1852 tree_vector_builder
vec (type
, nelts
, 1);
1853 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1855 if (TREE_CODE (value
) == VECTOR_CST
)
1857 /* If NELTS is constant then this must be too. */
1858 unsigned int sub_nelts
= VECTOR_CST_NELTS (value
).to_constant ();
1859 for (unsigned i
= 0; i
< sub_nelts
; ++i
)
1860 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1863 vec
.quick_push (value
);
1865 while (vec
.length () < nelts
)
1866 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1868 return vec
.build ();
1871 /* Build a vector of type VECTYPE where all the elements are SCs. */
1873 build_vector_from_val (tree vectype
, tree sc
)
1875 unsigned HOST_WIDE_INT i
, nunits
;
1877 if (sc
== error_mark_node
)
1880 /* Verify that the vector type is suitable for SC. Note that there
1881 is some inconsistency in the type-system with respect to restrict
1882 qualifications of pointers. Vector types always have a main-variant
1883 element type and the qualification is applied to the vector-type.
1884 So TREE_TYPE (vector-type) does not return a properly qualified
1885 vector element-type. */
1886 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1887 TREE_TYPE (vectype
)));
1889 if (CONSTANT_CLASS_P (sc
))
1891 tree_vector_builder
v (vectype
, 1, 1);
1895 else if (!TYPE_VECTOR_SUBPARTS (vectype
).is_constant (&nunits
))
1896 return fold_build1 (VEC_DUPLICATE_EXPR
, vectype
, sc
);
1899 vec
<constructor_elt
, va_gc
> *v
;
1900 vec_alloc (v
, nunits
);
1901 for (i
= 0; i
< nunits
; ++i
)
1902 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1903 return build_constructor (vectype
, v
);
1907 /* Build a vector series of type TYPE in which element I has the value
1908 BASE + I * STEP. The result is a constant if BASE and STEP are constant
1909 and a VEC_SERIES_EXPR otherwise. */
1912 build_vec_series (tree type
, tree base
, tree step
)
1914 if (integer_zerop (step
))
1915 return build_vector_from_val (type
, base
);
1916 if (TREE_CODE (base
) == INTEGER_CST
&& TREE_CODE (step
) == INTEGER_CST
)
1918 tree_vector_builder
builder (type
, 1, 3);
1919 tree elt1
= wide_int_to_tree (TREE_TYPE (base
),
1920 wi::to_wide (base
) + wi::to_wide (step
));
1921 tree elt2
= wide_int_to_tree (TREE_TYPE (base
),
1922 wi::to_wide (elt1
) + wi::to_wide (step
));
1923 builder
.quick_push (base
);
1924 builder
.quick_push (elt1
);
1925 builder
.quick_push (elt2
);
1926 return builder
.build ();
1928 return build2 (VEC_SERIES_EXPR
, type
, base
, step
);
1931 /* Return a vector with the same number of units and number of bits
1932 as VEC_TYPE, but in which the elements are a linear series of unsigned
1933 integers { BASE, BASE + STEP, BASE + STEP * 2, ... }. */
1936 build_index_vector (tree vec_type
, poly_uint64 base
, poly_uint64 step
)
1938 tree index_vec_type
= vec_type
;
1939 tree index_elt_type
= TREE_TYPE (vec_type
);
1940 poly_uint64 nunits
= TYPE_VECTOR_SUBPARTS (vec_type
);
1941 if (!INTEGRAL_TYPE_P (index_elt_type
) || !TYPE_UNSIGNED (index_elt_type
))
1943 index_elt_type
= build_nonstandard_integer_type
1944 (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (index_elt_type
)), true);
1945 index_vec_type
= build_vector_type (index_elt_type
, nunits
);
1948 tree_vector_builder
v (index_vec_type
, 1, 3);
1949 for (unsigned int i
= 0; i
< 3; ++i
)
1950 v
.quick_push (build_int_cstu (index_elt_type
, base
+ i
* step
));
1954 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1955 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1958 recompute_constructor_flags (tree c
)
1962 bool constant_p
= true;
1963 bool side_effects_p
= false;
1964 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1966 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1968 /* Mostly ctors will have elts that don't have side-effects, so
1969 the usual case is to scan all the elements. Hence a single
1970 loop for both const and side effects, rather than one loop
1971 each (with early outs). */
1972 if (!TREE_CONSTANT (val
))
1974 if (TREE_SIDE_EFFECTS (val
))
1975 side_effects_p
= true;
1978 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1979 TREE_CONSTANT (c
) = constant_p
;
1982 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1986 verify_constructor_flags (tree c
)
1990 bool constant_p
= TREE_CONSTANT (c
);
1991 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1992 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1994 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1996 if (constant_p
&& !TREE_CONSTANT (val
))
1997 internal_error ("non-constant element in constant CONSTRUCTOR");
1998 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1999 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
2003 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2004 are in the vec pointed to by VALS. */
2006 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
2008 tree c
= make_node (CONSTRUCTOR
);
2010 TREE_TYPE (c
) = type
;
2011 CONSTRUCTOR_ELTS (c
) = vals
;
2013 recompute_constructor_flags (c
);
2018 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
2021 build_constructor_single (tree type
, tree index
, tree value
)
2023 vec
<constructor_elt
, va_gc
> *v
;
2024 constructor_elt elt
= {index
, value
};
2027 v
->quick_push (elt
);
2029 return build_constructor (type
, v
);
2033 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
2034 are in a list pointed to by VALS. */
2036 build_constructor_from_list (tree type
, tree vals
)
2039 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2043 vec_alloc (v
, list_length (vals
));
2044 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
2045 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
2048 return build_constructor (type
, v
);
2051 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
2052 of elements, provided as index/value pairs. */
2055 build_constructor_va (tree type
, int nelts
, ...)
2057 vec
<constructor_elt
, va_gc
> *v
= NULL
;
2060 va_start (p
, nelts
);
2061 vec_alloc (v
, nelts
);
2064 tree index
= va_arg (p
, tree
);
2065 tree value
= va_arg (p
, tree
);
2066 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
2069 return build_constructor (type
, v
);
2072 /* Return a node of type TYPE for which TREE_CLOBBER_P is true. */
2075 build_clobber (tree type
)
2077 tree clobber
= build_constructor (type
, NULL
);
2078 TREE_THIS_VOLATILE (clobber
) = true;
2082 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
2085 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
2088 FIXED_VALUE_TYPE
*fp
;
2090 v
= make_node (FIXED_CST
);
2091 fp
= ggc_alloc
<fixed_value
> ();
2092 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
2094 TREE_TYPE (v
) = type
;
2095 TREE_FIXED_CST_PTR (v
) = fp
;
2099 /* Return a new REAL_CST node whose type is TYPE and value is D. */
2102 build_real (tree type
, REAL_VALUE_TYPE d
)
2105 REAL_VALUE_TYPE
*dp
;
2108 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
2109 Consider doing it via real_convert now. */
2111 v
= make_node (REAL_CST
);
2112 dp
= ggc_alloc
<real_value
> ();
2113 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
2115 TREE_TYPE (v
) = type
;
2116 TREE_REAL_CST_PTR (v
) = dp
;
2117 TREE_OVERFLOW (v
) = overflow
;
2121 /* Like build_real, but first truncate D to the type. */
2124 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
2126 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
2129 /* Return a new REAL_CST node whose type is TYPE
2130 and whose value is the integer value of the INTEGER_CST node I. */
2133 real_value_from_int_cst (const_tree type
, const_tree i
)
2137 /* Clear all bits of the real value type so that we can later do
2138 bitwise comparisons to see if two values are the same. */
2139 memset (&d
, 0, sizeof d
);
2141 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
2142 TYPE_SIGN (TREE_TYPE (i
)));
2146 /* Given a tree representing an integer constant I, return a tree
2147 representing the same value as a floating-point constant of type TYPE. */
2150 build_real_from_int_cst (tree type
, const_tree i
)
2153 int overflow
= TREE_OVERFLOW (i
);
2155 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2157 TREE_OVERFLOW (v
) |= overflow
;
2161 /* Return a newly constructed STRING_CST node whose value is
2162 the LEN characters at STR.
2163 Note that for a C string literal, LEN should include the trailing NUL.
2164 The TREE_TYPE is not initialized. */
2167 build_string (int len
, const char *str
)
2172 /* Do not waste bytes provided by padding of struct tree_string. */
2173 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2175 record_node_allocation_statistics (STRING_CST
, length
);
2177 s
= (tree
) ggc_internal_alloc (length
);
2179 memset (s
, 0, sizeof (struct tree_typed
));
2180 TREE_SET_CODE (s
, STRING_CST
);
2181 TREE_CONSTANT (s
) = 1;
2182 TREE_STRING_LENGTH (s
) = len
;
2183 memcpy (s
->string
.str
, str
, len
);
2184 s
->string
.str
[len
] = '\0';
2189 /* Return a newly constructed COMPLEX_CST node whose value is
2190 specified by the real and imaginary parts REAL and IMAG.
2191 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2192 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2195 build_complex (tree type
, tree real
, tree imag
)
2197 tree t
= make_node (COMPLEX_CST
);
2199 TREE_REALPART (t
) = real
;
2200 TREE_IMAGPART (t
) = imag
;
2201 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2202 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2206 /* Build a complex (inf +- 0i), such as for the result of cproj.
2207 TYPE is the complex tree type of the result. If NEG is true, the
2208 imaginary zero is negative. */
2211 build_complex_inf (tree type
, bool neg
)
2213 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2217 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2218 build_real (TREE_TYPE (type
), rzero
));
2221 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2222 element is set to 1. In particular, this is 1 + i for complex types. */
2225 build_each_one_cst (tree type
)
2227 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2229 tree scalar
= build_one_cst (TREE_TYPE (type
));
2230 return build_complex (type
, scalar
, scalar
);
2233 return build_one_cst (type
);
2236 /* Return a constant of arithmetic type TYPE which is the
2237 multiplicative identity of the set TYPE. */
2240 build_one_cst (tree type
)
2242 switch (TREE_CODE (type
))
2244 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2245 case POINTER_TYPE
: case REFERENCE_TYPE
:
2247 return build_int_cst (type
, 1);
2250 return build_real (type
, dconst1
);
2252 case FIXED_POINT_TYPE
:
2253 /* We can only generate 1 for accum types. */
2254 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2255 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2259 tree scalar
= build_one_cst (TREE_TYPE (type
));
2261 return build_vector_from_val (type
, scalar
);
2265 return build_complex (type
,
2266 build_one_cst (TREE_TYPE (type
)),
2267 build_zero_cst (TREE_TYPE (type
)));
2274 /* Return an integer of type TYPE containing all 1's in as much precision as
2275 it contains, or a complex or vector whose subparts are such integers. */
2278 build_all_ones_cst (tree type
)
2280 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2282 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2283 return build_complex (type
, scalar
, scalar
);
2286 return build_minus_one_cst (type
);
2289 /* Return a constant of arithmetic type TYPE which is the
2290 opposite of the multiplicative identity of the set TYPE. */
2293 build_minus_one_cst (tree type
)
2295 switch (TREE_CODE (type
))
2297 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2298 case POINTER_TYPE
: case REFERENCE_TYPE
:
2300 return build_int_cst (type
, -1);
2303 return build_real (type
, dconstm1
);
2305 case FIXED_POINT_TYPE
:
2306 /* We can only generate 1 for accum types. */
2307 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2308 return build_fixed (type
,
2309 fixed_from_double_int (double_int_minus_one
,
2310 SCALAR_TYPE_MODE (type
)));
2314 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2316 return build_vector_from_val (type
, scalar
);
2320 return build_complex (type
,
2321 build_minus_one_cst (TREE_TYPE (type
)),
2322 build_zero_cst (TREE_TYPE (type
)));
2329 /* Build 0 constant of type TYPE. This is used by constructor folding
2330 and thus the constant should be represented in memory by
2334 build_zero_cst (tree type
)
2336 switch (TREE_CODE (type
))
2338 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2339 case POINTER_TYPE
: case REFERENCE_TYPE
:
2340 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2341 return build_int_cst (type
, 0);
2344 return build_real (type
, dconst0
);
2346 case FIXED_POINT_TYPE
:
2347 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2351 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2353 return build_vector_from_val (type
, scalar
);
2358 tree zero
= build_zero_cst (TREE_TYPE (type
));
2360 return build_complex (type
, zero
, zero
);
2364 if (!AGGREGATE_TYPE_P (type
))
2365 return fold_convert (type
, integer_zero_node
);
2366 return build_constructor (type
, NULL
);
2371 /* Build a BINFO with LEN language slots. */
2374 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2377 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2378 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2380 record_node_allocation_statistics (TREE_BINFO
, length
);
2382 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2384 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2386 TREE_SET_CODE (t
, TREE_BINFO
);
2388 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2393 /* Create a CASE_LABEL_EXPR tree node and return it. */
2396 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2398 tree t
= make_node (CASE_LABEL_EXPR
);
2400 TREE_TYPE (t
) = void_type_node
;
2401 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2403 CASE_LOW (t
) = low_value
;
2404 CASE_HIGH (t
) = high_value
;
2405 CASE_LABEL (t
) = label_decl
;
2406 CASE_CHAIN (t
) = NULL_TREE
;
2411 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2412 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2413 The latter determines the length of the HOST_WIDE_INT vector. */
2416 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2419 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2420 + sizeof (struct tree_int_cst
));
2423 record_node_allocation_statistics (INTEGER_CST
, length
);
2425 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2427 TREE_SET_CODE (t
, INTEGER_CST
);
2428 TREE_INT_CST_NUNITS (t
) = len
;
2429 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2430 /* to_offset can only be applied to trees that are offset_int-sized
2431 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2432 must be exactly the precision of offset_int and so LEN is correct. */
2433 if (ext_len
<= OFFSET_INT_ELTS
)
2434 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2436 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2438 TREE_CONSTANT (t
) = 1;
2443 /* Build a newly constructed TREE_VEC node of length LEN. */
2446 make_tree_vec (int len MEM_STAT_DECL
)
2449 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2451 record_node_allocation_statistics (TREE_VEC
, length
);
2453 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2455 TREE_SET_CODE (t
, TREE_VEC
);
2456 TREE_VEC_LENGTH (t
) = len
;
2461 /* Grow a TREE_VEC node to new length LEN. */
2464 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2466 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2468 int oldlen
= TREE_VEC_LENGTH (v
);
2469 gcc_assert (len
> oldlen
);
2471 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2472 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2474 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2476 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2478 TREE_VEC_LENGTH (v
) = len
;
2483 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2484 fixed, and scalar, complex or vector. */
2487 zerop (const_tree expr
)
2489 return (integer_zerop (expr
)
2490 || real_zerop (expr
)
2491 || fixed_zerop (expr
));
2494 /* Return 1 if EXPR is the integer constant zero or a complex constant
2498 integer_zerop (const_tree expr
)
2500 switch (TREE_CODE (expr
))
2503 return wi::to_wide (expr
) == 0;
2505 return (integer_zerop (TREE_REALPART (expr
))
2506 && integer_zerop (TREE_IMAGPART (expr
)));
2508 return (VECTOR_CST_NPATTERNS (expr
) == 1
2509 && VECTOR_CST_DUPLICATE_P (expr
)
2510 && integer_zerop (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2516 /* Return 1 if EXPR is the integer constant one or the corresponding
2517 complex constant. */
2520 integer_onep (const_tree expr
)
2522 switch (TREE_CODE (expr
))
2525 return wi::eq_p (wi::to_widest (expr
), 1);
2527 return (integer_onep (TREE_REALPART (expr
))
2528 && integer_zerop (TREE_IMAGPART (expr
)));
2530 return (VECTOR_CST_NPATTERNS (expr
) == 1
2531 && VECTOR_CST_DUPLICATE_P (expr
)
2532 && integer_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2538 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2539 return 1 if every piece is the integer constant one. */
2542 integer_each_onep (const_tree expr
)
2544 if (TREE_CODE (expr
) == COMPLEX_CST
)
2545 return (integer_onep (TREE_REALPART (expr
))
2546 && integer_onep (TREE_IMAGPART (expr
)));
2548 return integer_onep (expr
);
2551 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2552 it contains, or a complex or vector whose subparts are such integers. */
2555 integer_all_onesp (const_tree expr
)
2557 if (TREE_CODE (expr
) == COMPLEX_CST
2558 && integer_all_onesp (TREE_REALPART (expr
))
2559 && integer_all_onesp (TREE_IMAGPART (expr
)))
2562 else if (TREE_CODE (expr
) == VECTOR_CST
)
2563 return (VECTOR_CST_NPATTERNS (expr
) == 1
2564 && VECTOR_CST_DUPLICATE_P (expr
)
2565 && integer_all_onesp (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2567 else if (TREE_CODE (expr
) != INTEGER_CST
)
2570 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2571 == wi::to_wide (expr
));
2574 /* Return 1 if EXPR is the integer constant minus one. */
2577 integer_minus_onep (const_tree expr
)
2579 if (TREE_CODE (expr
) == COMPLEX_CST
)
2580 return (integer_all_onesp (TREE_REALPART (expr
))
2581 && integer_zerop (TREE_IMAGPART (expr
)));
2583 return integer_all_onesp (expr
);
2586 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2590 integer_pow2p (const_tree expr
)
2592 if (TREE_CODE (expr
) == COMPLEX_CST
2593 && integer_pow2p (TREE_REALPART (expr
))
2594 && integer_zerop (TREE_IMAGPART (expr
)))
2597 if (TREE_CODE (expr
) != INTEGER_CST
)
2600 return wi::popcount (wi::to_wide (expr
)) == 1;
2603 /* Return 1 if EXPR is an integer constant other than zero or a
2604 complex constant other than zero. */
2607 integer_nonzerop (const_tree expr
)
2609 return ((TREE_CODE (expr
) == INTEGER_CST
2610 && wi::to_wide (expr
) != 0)
2611 || (TREE_CODE (expr
) == COMPLEX_CST
2612 && (integer_nonzerop (TREE_REALPART (expr
))
2613 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2616 /* Return 1 if EXPR is the integer constant one. For vector,
2617 return 1 if every piece is the integer constant minus one
2618 (representing the value TRUE). */
2621 integer_truep (const_tree expr
)
2623 if (TREE_CODE (expr
) == VECTOR_CST
)
2624 return integer_all_onesp (expr
);
2625 return integer_onep (expr
);
2628 /* Return 1 if EXPR is the fixed-point constant zero. */
2631 fixed_zerop (const_tree expr
)
2633 return (TREE_CODE (expr
) == FIXED_CST
2634 && TREE_FIXED_CST (expr
).data
.is_zero ());
2637 /* Return the power of two represented by a tree node known to be a
2641 tree_log2 (const_tree expr
)
2643 if (TREE_CODE (expr
) == COMPLEX_CST
)
2644 return tree_log2 (TREE_REALPART (expr
));
2646 return wi::exact_log2 (wi::to_wide (expr
));
2649 /* Similar, but return the largest integer Y such that 2 ** Y is less
2650 than or equal to EXPR. */
2653 tree_floor_log2 (const_tree expr
)
2655 if (TREE_CODE (expr
) == COMPLEX_CST
)
2656 return tree_log2 (TREE_REALPART (expr
));
2658 return wi::floor_log2 (wi::to_wide (expr
));
2661 /* Return number of known trailing zero bits in EXPR, or, if the value of
2662 EXPR is known to be zero, the precision of it's type. */
2665 tree_ctz (const_tree expr
)
2667 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2668 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2671 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2672 switch (TREE_CODE (expr
))
2675 ret1
= wi::ctz (wi::to_wide (expr
));
2676 return MIN (ret1
, prec
);
2678 ret1
= wi::ctz (get_nonzero_bits (expr
));
2679 return MIN (ret1
, prec
);
2686 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2689 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2690 return MIN (ret1
, ret2
);
2691 case POINTER_PLUS_EXPR
:
2692 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2693 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2694 /* Second operand is sizetype, which could be in theory
2695 wider than pointer's precision. Make sure we never
2696 return more than prec. */
2697 ret2
= MIN (ret2
, prec
);
2698 return MIN (ret1
, ret2
);
2700 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2701 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2702 return MAX (ret1
, ret2
);
2704 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2705 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2706 return MIN (ret1
+ ret2
, prec
);
2708 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2709 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2710 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2712 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2713 return MIN (ret1
+ ret2
, prec
);
2717 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2718 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2720 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2721 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2726 case TRUNC_DIV_EXPR
:
2728 case FLOOR_DIV_EXPR
:
2729 case ROUND_DIV_EXPR
:
2730 case EXACT_DIV_EXPR
:
2731 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2732 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2734 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2737 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2745 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2746 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2748 return MIN (ret1
, prec
);
2750 return tree_ctz (TREE_OPERAND (expr
, 0));
2752 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2755 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2756 return MIN (ret1
, ret2
);
2758 return tree_ctz (TREE_OPERAND (expr
, 1));
2760 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2761 if (ret1
> BITS_PER_UNIT
)
2763 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2764 return MIN (ret1
, prec
);
2772 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2773 decimal float constants, so don't return 1 for them. */
2776 real_zerop (const_tree expr
)
2778 switch (TREE_CODE (expr
))
2781 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2782 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2784 return real_zerop (TREE_REALPART (expr
))
2785 && real_zerop (TREE_IMAGPART (expr
));
2788 /* Don't simply check for a duplicate because the predicate
2789 accepts both +0.0 and -0.0. */
2790 unsigned count
= vector_cst_encoded_nelts (expr
);
2791 for (unsigned int i
= 0; i
< count
; ++i
)
2792 if (!real_zerop (VECTOR_CST_ENCODED_ELT (expr
, i
)))
2801 /* Return 1 if EXPR is the real constant one in real or complex form.
2802 Trailing zeroes matter for decimal float constants, so don't return
2806 real_onep (const_tree expr
)
2808 switch (TREE_CODE (expr
))
2811 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2812 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2814 return real_onep (TREE_REALPART (expr
))
2815 && real_zerop (TREE_IMAGPART (expr
));
2817 return (VECTOR_CST_NPATTERNS (expr
) == 1
2818 && VECTOR_CST_DUPLICATE_P (expr
)
2819 && real_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2825 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2826 matter for decimal float constants, so don't return 1 for them. */
2829 real_minus_onep (const_tree expr
)
2831 switch (TREE_CODE (expr
))
2834 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2835 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2837 return real_minus_onep (TREE_REALPART (expr
))
2838 && real_zerop (TREE_IMAGPART (expr
));
2840 return (VECTOR_CST_NPATTERNS (expr
) == 1
2841 && VECTOR_CST_DUPLICATE_P (expr
)
2842 && real_minus_onep (VECTOR_CST_ENCODED_ELT (expr
, 0)));
2848 /* Nonzero if EXP is a constant or a cast of a constant. */
2851 really_constant_p (const_tree exp
)
2853 /* This is not quite the same as STRIP_NOPS. It does more. */
2854 while (CONVERT_EXPR_P (exp
)
2855 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2856 exp
= TREE_OPERAND (exp
, 0);
2857 return TREE_CONSTANT (exp
);
2860 /* Return true if T holds a polynomial pointer difference, storing it in
2861 *VALUE if so. A true return means that T's precision is no greater
2862 than 64 bits, which is the largest address space we support, so *VALUE
2863 never loses precision. However, the signedness of the result does
2864 not necessarily match the signedness of T: sometimes an unsigned type
2865 like sizetype is used to encode a value that is actually negative. */
2868 ptrdiff_tree_p (const_tree t
, poly_int64_pod
*value
)
2872 if (TREE_CODE (t
) == INTEGER_CST
)
2874 if (!cst_and_fits_in_hwi (t
))
2876 *value
= int_cst_value (t
);
2879 if (POLY_INT_CST_P (t
))
2881 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2882 if (!cst_and_fits_in_hwi (POLY_INT_CST_COEFF (t
, i
)))
2884 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
2885 value
->coeffs
[i
] = int_cst_value (POLY_INT_CST_COEFF (t
, i
));
2892 tree_to_poly_int64 (const_tree t
)
2894 gcc_assert (tree_fits_poly_int64_p (t
));
2895 if (POLY_INT_CST_P (t
))
2896 return poly_int_cst_value (t
).force_shwi ();
2897 return TREE_INT_CST_LOW (t
);
2901 tree_to_poly_uint64 (const_tree t
)
2903 gcc_assert (tree_fits_poly_uint64_p (t
));
2904 if (POLY_INT_CST_P (t
))
2905 return poly_int_cst_value (t
).force_uhwi ();
2906 return TREE_INT_CST_LOW (t
);
2909 /* Return first list element whose TREE_VALUE is ELEM.
2910 Return 0 if ELEM is not in LIST. */
2913 value_member (tree elem
, tree list
)
2917 if (elem
== TREE_VALUE (list
))
2919 list
= TREE_CHAIN (list
);
2924 /* Return first list element whose TREE_PURPOSE is ELEM.
2925 Return 0 if ELEM is not in LIST. */
2928 purpose_member (const_tree elem
, tree list
)
2932 if (elem
== TREE_PURPOSE (list
))
2934 list
= TREE_CHAIN (list
);
2939 /* Return true if ELEM is in V. */
2942 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2946 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2952 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2956 chain_index (int idx
, tree chain
)
2958 for (; chain
&& idx
> 0; --idx
)
2959 chain
= TREE_CHAIN (chain
);
2963 /* Return nonzero if ELEM is part of the chain CHAIN. */
2966 chain_member (const_tree elem
, const_tree chain
)
2972 chain
= DECL_CHAIN (chain
);
2978 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2979 We expect a null pointer to mark the end of the chain.
2980 This is the Lisp primitive `length'. */
2983 list_length (const_tree t
)
2986 #ifdef ENABLE_TREE_CHECKING
2994 #ifdef ENABLE_TREE_CHECKING
2997 gcc_assert (p
!= q
);
3005 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
3006 UNION_TYPE TYPE, or NULL_TREE if none. */
3009 first_field (const_tree type
)
3011 tree t
= TYPE_FIELDS (type
);
3012 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
3017 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
3018 by modifying the last node in chain 1 to point to chain 2.
3019 This is the Lisp primitive `nconc'. */
3022 chainon (tree op1
, tree op2
)
3031 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
3033 TREE_CHAIN (t1
) = op2
;
3035 #ifdef ENABLE_TREE_CHECKING
3038 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
3039 gcc_assert (t2
!= t1
);
3046 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
3049 tree_last (tree chain
)
3053 while ((next
= TREE_CHAIN (chain
)))
3058 /* Reverse the order of elements in the chain T,
3059 and return the new head of the chain (old last element). */
3064 tree prev
= 0, decl
, next
;
3065 for (decl
= t
; decl
; decl
= next
)
3067 /* We shouldn't be using this function to reverse BLOCK chains; we
3068 have blocks_nreverse for that. */
3069 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
3070 next
= TREE_CHAIN (decl
);
3071 TREE_CHAIN (decl
) = prev
;
3077 /* Return a newly created TREE_LIST node whose
3078 purpose and value fields are PARM and VALUE. */
3081 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
3083 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
3084 TREE_PURPOSE (t
) = parm
;
3085 TREE_VALUE (t
) = value
;
3089 /* Build a chain of TREE_LIST nodes from a vector. */
3092 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
3094 tree ret
= NULL_TREE
;
3098 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
3100 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
3101 pp
= &TREE_CHAIN (*pp
);
3106 /* Return a newly created TREE_LIST node whose
3107 purpose and value fields are PURPOSE and VALUE
3108 and whose TREE_CHAIN is CHAIN. */
3111 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
3115 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
3116 memset (node
, 0, sizeof (struct tree_common
));
3118 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
3120 TREE_SET_CODE (node
, TREE_LIST
);
3121 TREE_CHAIN (node
) = chain
;
3122 TREE_PURPOSE (node
) = purpose
;
3123 TREE_VALUE (node
) = value
;
3127 /* Return the values of the elements of a CONSTRUCTOR as a vector of
3131 ctor_to_vec (tree ctor
)
3133 vec
<tree
, va_gc
> *vec
;
3134 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
3138 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
3139 vec
->quick_push (val
);
3144 /* Return the size nominally occupied by an object of type TYPE
3145 when it resides in memory. The value is measured in units of bytes,
3146 and its data type is that normally used for type sizes
3147 (which is the first type created by make_signed_type or
3148 make_unsigned_type). */
3151 size_in_bytes_loc (location_t loc
, const_tree type
)
3155 if (type
== error_mark_node
)
3156 return integer_zero_node
;
3158 type
= TYPE_MAIN_VARIANT (type
);
3159 t
= TYPE_SIZE_UNIT (type
);
3163 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
3164 return size_zero_node
;
3170 /* Return the size of TYPE (in bytes) as a wide integer
3171 or return -1 if the size can vary or is larger than an integer. */
3174 int_size_in_bytes (const_tree type
)
3178 if (type
== error_mark_node
)
3181 type
= TYPE_MAIN_VARIANT (type
);
3182 t
= TYPE_SIZE_UNIT (type
);
3184 if (t
&& tree_fits_uhwi_p (t
))
3185 return TREE_INT_CST_LOW (t
);
3190 /* Return the maximum size of TYPE (in bytes) as a wide integer
3191 or return -1 if the size can vary or is larger than an integer. */
3194 max_int_size_in_bytes (const_tree type
)
3196 HOST_WIDE_INT size
= -1;
3199 /* If this is an array type, check for a possible MAX_SIZE attached. */
3201 if (TREE_CODE (type
) == ARRAY_TYPE
)
3203 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3205 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3206 size
= tree_to_uhwi (size_tree
);
3209 /* If we still haven't been able to get a size, see if the language
3210 can compute a maximum size. */
3214 size_tree
= lang_hooks
.types
.max_size (type
);
3216 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3217 size
= tree_to_uhwi (size_tree
);
3223 /* Return the bit position of FIELD, in bits from the start of the record.
3224 This is a tree of type bitsizetype. */
3227 bit_position (const_tree field
)
3229 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3230 DECL_FIELD_BIT_OFFSET (field
));
3233 /* Return the byte position of FIELD, in bytes from the start of the record.
3234 This is a tree of type sizetype. */
3237 byte_position (const_tree field
)
3239 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3240 DECL_FIELD_BIT_OFFSET (field
));
3243 /* Likewise, but return as an integer. It must be representable in
3244 that way (since it could be a signed value, we don't have the
3245 option of returning -1 like int_size_in_byte can. */
3248 int_byte_position (const_tree field
)
3250 return tree_to_shwi (byte_position (field
));
3253 /* Return the strictest alignment, in bits, that T is known to have. */
3256 expr_align (const_tree t
)
3258 unsigned int align0
, align1
;
3260 switch (TREE_CODE (t
))
3262 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3263 /* If we have conversions, we know that the alignment of the
3264 object must meet each of the alignments of the types. */
3265 align0
= expr_align (TREE_OPERAND (t
, 0));
3266 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3267 return MAX (align0
, align1
);
3269 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3270 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3271 case CLEANUP_POINT_EXPR
:
3272 /* These don't change the alignment of an object. */
3273 return expr_align (TREE_OPERAND (t
, 0));
3276 /* The best we can do is say that the alignment is the least aligned
3278 align0
= expr_align (TREE_OPERAND (t
, 1));
3279 align1
= expr_align (TREE_OPERAND (t
, 2));
3280 return MIN (align0
, align1
);
3282 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3283 meaningfully, it's always 1. */
3284 case LABEL_DECL
: case CONST_DECL
:
3285 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3287 gcc_assert (DECL_ALIGN (t
) != 0);
3288 return DECL_ALIGN (t
);
3294 /* Otherwise take the alignment from that of the type. */
3295 return TYPE_ALIGN (TREE_TYPE (t
));
3298 /* Return, as a tree node, the number of elements for TYPE (which is an
3299 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3302 array_type_nelts (const_tree type
)
3304 tree index_type
, min
, max
;
3306 /* If they did it with unspecified bounds, then we should have already
3307 given an error about it before we got here. */
3308 if (! TYPE_DOMAIN (type
))
3309 return error_mark_node
;
3311 index_type
= TYPE_DOMAIN (type
);
3312 min
= TYPE_MIN_VALUE (index_type
);
3313 max
= TYPE_MAX_VALUE (index_type
);
3315 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3317 return error_mark_node
;
3319 return (integer_zerop (min
)
3321 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3324 /* If arg is static -- a reference to an object in static storage -- then
3325 return the object. This is not the same as the C meaning of `static'.
3326 If arg isn't static, return NULL. */
3331 switch (TREE_CODE (arg
))
3334 /* Nested functions are static, even though taking their address will
3335 involve a trampoline as we unnest the nested function and create
3336 the trampoline on the tree level. */
3340 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3341 && ! DECL_THREAD_LOCAL_P (arg
)
3342 && ! DECL_DLLIMPORT_P (arg
)
3346 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3350 return TREE_STATIC (arg
) ? arg
: NULL
;
3357 /* If the thing being referenced is not a field, then it is
3358 something language specific. */
3359 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3361 /* If we are referencing a bitfield, we can't evaluate an
3362 ADDR_EXPR at compile time and so it isn't a constant. */
3363 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3366 return staticp (TREE_OPERAND (arg
, 0));
3372 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3375 case ARRAY_RANGE_REF
:
3376 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3377 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3378 return staticp (TREE_OPERAND (arg
, 0));
3382 case COMPOUND_LITERAL_EXPR
:
3383 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3393 /* Return whether OP is a DECL whose address is function-invariant. */
3396 decl_address_invariant_p (const_tree op
)
3398 /* The conditions below are slightly less strict than the one in
3401 switch (TREE_CODE (op
))
3410 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3411 || DECL_THREAD_LOCAL_P (op
)
3412 || DECL_CONTEXT (op
) == current_function_decl
3413 || decl_function_context (op
) == current_function_decl
)
3418 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3419 || decl_function_context (op
) == current_function_decl
)
3430 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3433 decl_address_ip_invariant_p (const_tree op
)
3435 /* The conditions below are slightly less strict than the one in
3438 switch (TREE_CODE (op
))
3446 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3447 && !DECL_DLLIMPORT_P (op
))
3448 || DECL_THREAD_LOCAL_P (op
))
3453 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3465 /* Return true if T is function-invariant (internal function, does
3466 not handle arithmetic; that's handled in skip_simple_arithmetic and
3467 tree_invariant_p). */
3470 tree_invariant_p_1 (tree t
)
3474 if (TREE_CONSTANT (t
)
3475 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3478 switch (TREE_CODE (t
))
3484 op
= TREE_OPERAND (t
, 0);
3485 while (handled_component_p (op
))
3487 switch (TREE_CODE (op
))
3490 case ARRAY_RANGE_REF
:
3491 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3492 || TREE_OPERAND (op
, 2) != NULL_TREE
3493 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3498 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3504 op
= TREE_OPERAND (op
, 0);
3507 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3516 /* Return true if T is function-invariant. */
3519 tree_invariant_p (tree t
)
3521 tree inner
= skip_simple_arithmetic (t
);
3522 return tree_invariant_p_1 (inner
);
3525 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3526 Do this to any expression which may be used in more than one place,
3527 but must be evaluated only once.
3529 Normally, expand_expr would reevaluate the expression each time.
3530 Calling save_expr produces something that is evaluated and recorded
3531 the first time expand_expr is called on it. Subsequent calls to
3532 expand_expr just reuse the recorded value.
3534 The call to expand_expr that generates code that actually computes
3535 the value is the first call *at compile time*. Subsequent calls
3536 *at compile time* generate code to use the saved value.
3537 This produces correct result provided that *at run time* control
3538 always flows through the insns made by the first expand_expr
3539 before reaching the other places where the save_expr was evaluated.
3540 You, the caller of save_expr, must make sure this is so.
3542 Constants, and certain read-only nodes, are returned with no
3543 SAVE_EXPR because that is safe. Expressions containing placeholders
3544 are not touched; see tree.def for an explanation of what these
3548 save_expr (tree expr
)
3552 /* If the tree evaluates to a constant, then we don't want to hide that
3553 fact (i.e. this allows further folding, and direct checks for constants).
3554 However, a read-only object that has side effects cannot be bypassed.
3555 Since it is no problem to reevaluate literals, we just return the
3557 inner
= skip_simple_arithmetic (expr
);
3558 if (TREE_CODE (inner
) == ERROR_MARK
)
3561 if (tree_invariant_p_1 (inner
))
3564 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3565 it means that the size or offset of some field of an object depends on
3566 the value within another field.
3568 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3569 and some variable since it would then need to be both evaluated once and
3570 evaluated more than once. Front-ends must assure this case cannot
3571 happen by surrounding any such subexpressions in their own SAVE_EXPR
3572 and forcing evaluation at the proper time. */
3573 if (contains_placeholder_p (inner
))
3576 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3578 /* This expression might be placed ahead of a jump to ensure that the
3579 value was computed on both sides of the jump. So make sure it isn't
3580 eliminated as dead. */
3581 TREE_SIDE_EFFECTS (expr
) = 1;
3585 /* Look inside EXPR into any simple arithmetic operations. Return the
3586 outermost non-arithmetic or non-invariant node. */
3589 skip_simple_arithmetic (tree expr
)
3591 /* We don't care about whether this can be used as an lvalue in this
3593 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3594 expr
= TREE_OPERAND (expr
, 0);
3596 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3597 a constant, it will be more efficient to not make another SAVE_EXPR since
3598 it will allow better simplification and GCSE will be able to merge the
3599 computations if they actually occur. */
3602 if (UNARY_CLASS_P (expr
))
3603 expr
= TREE_OPERAND (expr
, 0);
3604 else if (BINARY_CLASS_P (expr
))
3606 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3607 expr
= TREE_OPERAND (expr
, 0);
3608 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3609 expr
= TREE_OPERAND (expr
, 1);
3620 /* Look inside EXPR into simple arithmetic operations involving constants.
3621 Return the outermost non-arithmetic or non-constant node. */
3624 skip_simple_constant_arithmetic (tree expr
)
3626 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3627 expr
= TREE_OPERAND (expr
, 0);
3631 if (UNARY_CLASS_P (expr
))
3632 expr
= TREE_OPERAND (expr
, 0);
3633 else if (BINARY_CLASS_P (expr
))
3635 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3636 expr
= TREE_OPERAND (expr
, 0);
3637 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3638 expr
= TREE_OPERAND (expr
, 1);
3649 /* Return which tree structure is used by T. */
3651 enum tree_node_structure_enum
3652 tree_node_structure (const_tree t
)
3654 const enum tree_code code
= TREE_CODE (t
);
3655 return tree_node_structure_for_code (code
);
3658 /* Set various status flags when building a CALL_EXPR object T. */
3661 process_call_operands (tree t
)
3663 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3664 bool read_only
= false;
3665 int i
= call_expr_flags (t
);
3667 /* Calls have side-effects, except those to const or pure functions. */
3668 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3669 side_effects
= true;
3670 /* Propagate TREE_READONLY of arguments for const functions. */
3674 if (!side_effects
|| read_only
)
3675 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3677 tree op
= TREE_OPERAND (t
, i
);
3678 if (op
&& TREE_SIDE_EFFECTS (op
))
3679 side_effects
= true;
3680 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3684 TREE_SIDE_EFFECTS (t
) = side_effects
;
3685 TREE_READONLY (t
) = read_only
;
3688 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3689 size or offset that depends on a field within a record. */
3692 contains_placeholder_p (const_tree exp
)
3694 enum tree_code code
;
3699 code
= TREE_CODE (exp
);
3700 if (code
== PLACEHOLDER_EXPR
)
3703 switch (TREE_CODE_CLASS (code
))
3706 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3707 position computations since they will be converted into a
3708 WITH_RECORD_EXPR involving the reference, which will assume
3709 here will be valid. */
3710 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3712 case tcc_exceptional
:
3713 if (code
== TREE_LIST
)
3714 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3715 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3720 case tcc_comparison
:
3721 case tcc_expression
:
3725 /* Ignoring the first operand isn't quite right, but works best. */
3726 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3729 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3730 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3731 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3734 /* The save_expr function never wraps anything containing
3735 a PLACEHOLDER_EXPR. */
3742 switch (TREE_CODE_LENGTH (code
))
3745 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3747 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3748 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3759 const_call_expr_arg_iterator iter
;
3760 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3761 if (CONTAINS_PLACEHOLDER_P (arg
))
3775 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3776 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3780 type_contains_placeholder_1 (const_tree type
)
3782 /* If the size contains a placeholder or the parent type (component type in
3783 the case of arrays) type involves a placeholder, this type does. */
3784 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3785 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3786 || (!POINTER_TYPE_P (type
)
3788 && type_contains_placeholder_p (TREE_TYPE (type
))))
3791 /* Now do type-specific checks. Note that the last part of the check above
3792 greatly limits what we have to do below. */
3793 switch (TREE_CODE (type
))
3801 case REFERENCE_TYPE
:
3810 case FIXED_POINT_TYPE
:
3811 /* Here we just check the bounds. */
3812 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3813 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3816 /* We have already checked the component type above, so just check
3817 the domain type. Flexible array members have a null domain. */
3818 return TYPE_DOMAIN (type
) ?
3819 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3823 case QUAL_UNION_TYPE
:
3827 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3828 if (TREE_CODE (field
) == FIELD_DECL
3829 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3830 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3831 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3832 || type_contains_placeholder_p (TREE_TYPE (field
))))
3843 /* Wrapper around above function used to cache its result. */
3846 type_contains_placeholder_p (tree type
)
3850 /* If the contains_placeholder_bits field has been initialized,
3851 then we know the answer. */
3852 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3853 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3855 /* Indicate that we've seen this type node, and the answer is false.
3856 This is what we want to return if we run into recursion via fields. */
3857 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3859 /* Compute the real value. */
3860 result
= type_contains_placeholder_1 (type
);
3862 /* Store the real value. */
3863 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3868 /* Push tree EXP onto vector QUEUE if it is not already present. */
3871 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3876 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3877 if (simple_cst_equal (iter
, exp
) == 1)
3881 queue
->safe_push (exp
);
3884 /* Given a tree EXP, find all occurrences of references to fields
3885 in a PLACEHOLDER_EXPR and place them in vector REFS without
3886 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3887 we assume here that EXP contains only arithmetic expressions
3888 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3892 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3894 enum tree_code code
= TREE_CODE (exp
);
3898 /* We handle TREE_LIST and COMPONENT_REF separately. */
3899 if (code
== TREE_LIST
)
3901 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3902 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3904 else if (code
== COMPONENT_REF
)
3906 for (inner
= TREE_OPERAND (exp
, 0);
3907 REFERENCE_CLASS_P (inner
);
3908 inner
= TREE_OPERAND (inner
, 0))
3911 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3912 push_without_duplicates (exp
, refs
);
3914 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3917 switch (TREE_CODE_CLASS (code
))
3922 case tcc_declaration
:
3923 /* Variables allocated to static storage can stay. */
3924 if (!TREE_STATIC (exp
))
3925 push_without_duplicates (exp
, refs
);
3928 case tcc_expression
:
3929 /* This is the pattern built in ada/make_aligning_type. */
3930 if (code
== ADDR_EXPR
3931 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3933 push_without_duplicates (exp
, refs
);
3939 case tcc_exceptional
:
3942 case tcc_comparison
:
3944 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3945 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3949 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3950 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3958 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3959 return a tree with all occurrences of references to F in a
3960 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3961 CONST_DECLs. Note that we assume here that EXP contains only
3962 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3963 occurring only in their argument list. */
3966 substitute_in_expr (tree exp
, tree f
, tree r
)
3968 enum tree_code code
= TREE_CODE (exp
);
3969 tree op0
, op1
, op2
, op3
;
3972 /* We handle TREE_LIST and COMPONENT_REF separately. */
3973 if (code
== TREE_LIST
)
3975 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3976 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3977 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3980 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3982 else if (code
== COMPONENT_REF
)
3986 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3987 and it is the right field, replace it with R. */
3988 for (inner
= TREE_OPERAND (exp
, 0);
3989 REFERENCE_CLASS_P (inner
);
3990 inner
= TREE_OPERAND (inner
, 0))
3994 op1
= TREE_OPERAND (exp
, 1);
3996 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3999 /* If this expression hasn't been completed let, leave it alone. */
4000 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
4003 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4004 if (op0
== TREE_OPERAND (exp
, 0))
4008 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
4011 switch (TREE_CODE_CLASS (code
))
4016 case tcc_declaration
:
4022 case tcc_expression
:
4028 case tcc_exceptional
:
4031 case tcc_comparison
:
4033 switch (TREE_CODE_LENGTH (code
))
4039 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4040 if (op0
== TREE_OPERAND (exp
, 0))
4043 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4047 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4048 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4050 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4053 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4057 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4058 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4059 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4061 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4062 && op2
== TREE_OPERAND (exp
, 2))
4065 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4069 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
4070 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
4071 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
4072 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
4074 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4075 && op2
== TREE_OPERAND (exp
, 2)
4076 && op3
== TREE_OPERAND (exp
, 3))
4080 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4092 new_tree
= NULL_TREE
;
4094 /* If we are trying to replace F with a constant or with another
4095 instance of one of the arguments of the call, inline back
4096 functions which do nothing else than computing a value from
4097 the arguments they are passed. This makes it possible to
4098 fold partially or entirely the replacement expression. */
4099 if (code
== CALL_EXPR
)
4101 bool maybe_inline
= false;
4102 if (CONSTANT_CLASS_P (r
))
4103 maybe_inline
= true;
4105 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4106 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
4108 maybe_inline
= true;
4113 tree t
= maybe_inline_call_in_expr (exp
);
4115 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
4119 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4121 tree op
= TREE_OPERAND (exp
, i
);
4122 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
4126 new_tree
= copy_node (exp
);
4127 TREE_OPERAND (new_tree
, i
) = new_op
;
4133 new_tree
= fold (new_tree
);
4134 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4135 process_call_operands (new_tree
);
4146 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4148 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4149 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4154 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
4155 for it within OBJ, a tree that is an object or a chain of references. */
4158 substitute_placeholder_in_expr (tree exp
, tree obj
)
4160 enum tree_code code
= TREE_CODE (exp
);
4161 tree op0
, op1
, op2
, op3
;
4164 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
4165 in the chain of OBJ. */
4166 if (code
== PLACEHOLDER_EXPR
)
4168 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
4171 for (elt
= obj
; elt
!= 0;
4172 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4173 || TREE_CODE (elt
) == COND_EXPR
)
4174 ? TREE_OPERAND (elt
, 1)
4175 : (REFERENCE_CLASS_P (elt
)
4176 || UNARY_CLASS_P (elt
)
4177 || BINARY_CLASS_P (elt
)
4178 || VL_EXP_CLASS_P (elt
)
4179 || EXPRESSION_CLASS_P (elt
))
4180 ? TREE_OPERAND (elt
, 0) : 0))
4181 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
4184 for (elt
= obj
; elt
!= 0;
4185 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4186 || TREE_CODE (elt
) == COND_EXPR
)
4187 ? TREE_OPERAND (elt
, 1)
4188 : (REFERENCE_CLASS_P (elt
)
4189 || UNARY_CLASS_P (elt
)
4190 || BINARY_CLASS_P (elt
)
4191 || VL_EXP_CLASS_P (elt
)
4192 || EXPRESSION_CLASS_P (elt
))
4193 ? TREE_OPERAND (elt
, 0) : 0))
4194 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4195 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4197 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4199 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4200 survives until RTL generation, there will be an error. */
4204 /* TREE_LIST is special because we need to look at TREE_VALUE
4205 and TREE_CHAIN, not TREE_OPERANDS. */
4206 else if (code
== TREE_LIST
)
4208 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4209 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4210 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4213 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4216 switch (TREE_CODE_CLASS (code
))
4219 case tcc_declaration
:
4222 case tcc_exceptional
:
4225 case tcc_comparison
:
4226 case tcc_expression
:
4229 switch (TREE_CODE_LENGTH (code
))
4235 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4236 if (op0
== TREE_OPERAND (exp
, 0))
4239 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4243 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4244 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4246 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4249 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4253 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4254 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4255 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4257 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4258 && op2
== TREE_OPERAND (exp
, 2))
4261 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4265 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4266 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4267 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4268 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4270 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4271 && op2
== TREE_OPERAND (exp
, 2)
4272 && op3
== TREE_OPERAND (exp
, 3))
4276 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4288 new_tree
= NULL_TREE
;
4290 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4292 tree op
= TREE_OPERAND (exp
, i
);
4293 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4297 new_tree
= copy_node (exp
);
4298 TREE_OPERAND (new_tree
, i
) = new_op
;
4304 new_tree
= fold (new_tree
);
4305 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4306 process_call_operands (new_tree
);
4317 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4319 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4320 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4326 /* Subroutine of stabilize_reference; this is called for subtrees of
4327 references. Any expression with side-effects must be put in a SAVE_EXPR
4328 to ensure that it is only evaluated once.
4330 We don't put SAVE_EXPR nodes around everything, because assigning very
4331 simple expressions to temporaries causes us to miss good opportunities
4332 for optimizations. Among other things, the opportunity to fold in the
4333 addition of a constant into an addressing mode often gets lost, e.g.
4334 "y[i+1] += x;". In general, we take the approach that we should not make
4335 an assignment unless we are forced into it - i.e., that any non-side effect
4336 operator should be allowed, and that cse should take care of coalescing
4337 multiple utterances of the same expression should that prove fruitful. */
4340 stabilize_reference_1 (tree e
)
4343 enum tree_code code
= TREE_CODE (e
);
4345 /* We cannot ignore const expressions because it might be a reference
4346 to a const array but whose index contains side-effects. But we can
4347 ignore things that are actual constant or that already have been
4348 handled by this function. */
4350 if (tree_invariant_p (e
))
4353 switch (TREE_CODE_CLASS (code
))
4355 case tcc_exceptional
:
4356 /* Always wrap STATEMENT_LIST into SAVE_EXPR, even if it doesn't
4357 have side-effects. */
4358 if (code
== STATEMENT_LIST
)
4359 return save_expr (e
);
4362 case tcc_declaration
:
4363 case tcc_comparison
:
4365 case tcc_expression
:
4368 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4369 so that it will only be evaluated once. */
4370 /* The reference (r) and comparison (<) classes could be handled as
4371 below, but it is generally faster to only evaluate them once. */
4372 if (TREE_SIDE_EFFECTS (e
))
4373 return save_expr (e
);
4377 /* Constants need no processing. In fact, we should never reach
4382 /* Division is slow and tends to be compiled with jumps,
4383 especially the division by powers of 2 that is often
4384 found inside of an array reference. So do it just once. */
4385 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4386 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4387 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4388 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4389 return save_expr (e
);
4390 /* Recursively stabilize each operand. */
4391 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4392 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4396 /* Recursively stabilize each operand. */
4397 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4404 TREE_TYPE (result
) = TREE_TYPE (e
);
4405 TREE_READONLY (result
) = TREE_READONLY (e
);
4406 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4407 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4412 /* Stabilize a reference so that we can use it any number of times
4413 without causing its operands to be evaluated more than once.
4414 Returns the stabilized reference. This works by means of save_expr,
4415 so see the caveats in the comments about save_expr.
4417 Also allows conversion expressions whose operands are references.
4418 Any other kind of expression is returned unchanged. */
4421 stabilize_reference (tree ref
)
4424 enum tree_code code
= TREE_CODE (ref
);
4431 /* No action is needed in this case. */
4436 case FIX_TRUNC_EXPR
:
4437 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4441 result
= build_nt (INDIRECT_REF
,
4442 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4446 result
= build_nt (COMPONENT_REF
,
4447 stabilize_reference (TREE_OPERAND (ref
, 0)),
4448 TREE_OPERAND (ref
, 1), NULL_TREE
);
4452 result
= build_nt (BIT_FIELD_REF
,
4453 stabilize_reference (TREE_OPERAND (ref
, 0)),
4454 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4455 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4459 result
= build_nt (ARRAY_REF
,
4460 stabilize_reference (TREE_OPERAND (ref
, 0)),
4461 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4462 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4465 case ARRAY_RANGE_REF
:
4466 result
= build_nt (ARRAY_RANGE_REF
,
4467 stabilize_reference (TREE_OPERAND (ref
, 0)),
4468 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4469 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4473 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4474 it wouldn't be ignored. This matters when dealing with
4476 return stabilize_reference_1 (ref
);
4478 /* If arg isn't a kind of lvalue we recognize, make no change.
4479 Caller should recognize the error for an invalid lvalue. */
4484 return error_mark_node
;
4487 TREE_TYPE (result
) = TREE_TYPE (ref
);
4488 TREE_READONLY (result
) = TREE_READONLY (ref
);
4489 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4490 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4495 /* Low-level constructors for expressions. */
4497 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4498 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4501 recompute_tree_invariant_for_addr_expr (tree t
)
4504 bool tc
= true, se
= false;
4506 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4508 /* We started out assuming this address is both invariant and constant, but
4509 does not have side effects. Now go down any handled components and see if
4510 any of them involve offsets that are either non-constant or non-invariant.
4511 Also check for side-effects.
4513 ??? Note that this code makes no attempt to deal with the case where
4514 taking the address of something causes a copy due to misalignment. */
4516 #define UPDATE_FLAGS(NODE) \
4517 do { tree _node = (NODE); \
4518 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4519 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4521 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4522 node
= TREE_OPERAND (node
, 0))
4524 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4525 array reference (probably made temporarily by the G++ front end),
4526 so ignore all the operands. */
4527 if ((TREE_CODE (node
) == ARRAY_REF
4528 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4529 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4531 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4532 if (TREE_OPERAND (node
, 2))
4533 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4534 if (TREE_OPERAND (node
, 3))
4535 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4537 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4538 FIELD_DECL, apparently. The G++ front end can put something else
4539 there, at least temporarily. */
4540 else if (TREE_CODE (node
) == COMPONENT_REF
4541 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4543 if (TREE_OPERAND (node
, 2))
4544 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4548 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4550 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4551 the address, since &(*a)->b is a form of addition. If it's a constant, the
4552 address is constant too. If it's a decl, its address is constant if the
4553 decl is static. Everything else is not constant and, furthermore,
4554 taking the address of a volatile variable is not volatile. */
4555 if (TREE_CODE (node
) == INDIRECT_REF
4556 || TREE_CODE (node
) == MEM_REF
)
4557 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4558 else if (CONSTANT_CLASS_P (node
))
4560 else if (DECL_P (node
))
4561 tc
&= (staticp (node
) != NULL_TREE
);
4565 se
|= TREE_SIDE_EFFECTS (node
);
4569 TREE_CONSTANT (t
) = tc
;
4570 TREE_SIDE_EFFECTS (t
) = se
;
4574 /* Build an expression of code CODE, data type TYPE, and operands as
4575 specified. Expressions and reference nodes can be created this way.
4576 Constants, decls, types and misc nodes cannot be.
4578 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4579 enough for all extant tree codes. */
4582 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4586 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4588 t
= make_node (code PASS_MEM_STAT
);
4595 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4597 int length
= sizeof (struct tree_exp
);
4600 record_node_allocation_statistics (code
, length
);
4602 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4604 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4606 memset (t
, 0, sizeof (struct tree_common
));
4608 TREE_SET_CODE (t
, code
);
4610 TREE_TYPE (t
) = type
;
4611 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4612 TREE_OPERAND (t
, 0) = node
;
4613 if (node
&& !TYPE_P (node
))
4615 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4616 TREE_READONLY (t
) = TREE_READONLY (node
);
4619 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4621 if (code
!= DEBUG_BEGIN_STMT
)
4622 TREE_SIDE_EFFECTS (t
) = 1;
4627 /* All of these have side-effects, no matter what their
4629 TREE_SIDE_EFFECTS (t
) = 1;
4630 TREE_READONLY (t
) = 0;
4634 /* Whether a dereference is readonly has nothing to do with whether
4635 its operand is readonly. */
4636 TREE_READONLY (t
) = 0;
4641 recompute_tree_invariant_for_addr_expr (t
);
4645 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4646 && node
&& !TYPE_P (node
)
4647 && TREE_CONSTANT (node
))
4648 TREE_CONSTANT (t
) = 1;
4649 if (TREE_CODE_CLASS (code
) == tcc_reference
4650 && node
&& TREE_THIS_VOLATILE (node
))
4651 TREE_THIS_VOLATILE (t
) = 1;
4658 #define PROCESS_ARG(N) \
4660 TREE_OPERAND (t, N) = arg##N; \
4661 if (arg##N &&!TYPE_P (arg##N)) \
4663 if (TREE_SIDE_EFFECTS (arg##N)) \
4665 if (!TREE_READONLY (arg##N) \
4666 && !CONSTANT_CLASS_P (arg##N)) \
4667 (void) (read_only = 0); \
4668 if (!TREE_CONSTANT (arg##N)) \
4669 (void) (constant = 0); \
4674 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4676 bool constant
, read_only
, side_effects
, div_by_zero
;
4679 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4681 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4682 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4683 /* When sizetype precision doesn't match that of pointers
4684 we need to be able to build explicit extensions or truncations
4685 of the offset argument. */
4686 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4687 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4688 && TREE_CODE (arg1
) == INTEGER_CST
);
4690 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4691 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4692 && ptrofftype_p (TREE_TYPE (arg1
)));
4694 t
= make_node (code PASS_MEM_STAT
);
4697 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4698 result based on those same flags for the arguments. But if the
4699 arguments aren't really even `tree' expressions, we shouldn't be trying
4702 /* Expressions without side effects may be constant if their
4703 arguments are as well. */
4704 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4705 || TREE_CODE_CLASS (code
) == tcc_binary
);
4707 side_effects
= TREE_SIDE_EFFECTS (t
);
4711 case TRUNC_DIV_EXPR
:
4713 case FLOOR_DIV_EXPR
:
4714 case ROUND_DIV_EXPR
:
4715 case EXACT_DIV_EXPR
:
4717 case FLOOR_MOD_EXPR
:
4718 case ROUND_MOD_EXPR
:
4719 case TRUNC_MOD_EXPR
:
4720 div_by_zero
= integer_zerop (arg1
);
4723 div_by_zero
= false;
4729 TREE_SIDE_EFFECTS (t
) = side_effects
;
4730 if (code
== MEM_REF
)
4732 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4734 tree o
= TREE_OPERAND (arg0
, 0);
4735 TREE_READONLY (t
) = TREE_READONLY (o
);
4736 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4741 TREE_READONLY (t
) = read_only
;
4742 /* Don't mark X / 0 as constant. */
4743 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4744 TREE_THIS_VOLATILE (t
)
4745 = (TREE_CODE_CLASS (code
) == tcc_reference
4746 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4754 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4755 tree arg2 MEM_STAT_DECL
)
4757 bool constant
, read_only
, side_effects
;
4760 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4761 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4763 t
= make_node (code PASS_MEM_STAT
);
4768 /* As a special exception, if COND_EXPR has NULL branches, we
4769 assume that it is a gimple statement and always consider
4770 it to have side effects. */
4771 if (code
== COND_EXPR
4772 && tt
== void_type_node
4773 && arg1
== NULL_TREE
4774 && arg2
== NULL_TREE
)
4775 side_effects
= true;
4777 side_effects
= TREE_SIDE_EFFECTS (t
);
4783 if (code
== COND_EXPR
)
4784 TREE_READONLY (t
) = read_only
;
4786 TREE_SIDE_EFFECTS (t
) = side_effects
;
4787 TREE_THIS_VOLATILE (t
)
4788 = (TREE_CODE_CLASS (code
) == tcc_reference
4789 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4795 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4796 tree arg2
, tree arg3 MEM_STAT_DECL
)
4798 bool constant
, read_only
, side_effects
;
4801 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4803 t
= make_node (code PASS_MEM_STAT
);
4806 side_effects
= TREE_SIDE_EFFECTS (t
);
4813 TREE_SIDE_EFFECTS (t
) = side_effects
;
4814 TREE_THIS_VOLATILE (t
)
4815 = (TREE_CODE_CLASS (code
) == tcc_reference
4816 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4822 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4823 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4825 bool constant
, read_only
, side_effects
;
4828 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4830 t
= make_node (code PASS_MEM_STAT
);
4833 side_effects
= TREE_SIDE_EFFECTS (t
);
4841 TREE_SIDE_EFFECTS (t
) = side_effects
;
4842 if (code
== TARGET_MEM_REF
)
4844 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4846 tree o
= TREE_OPERAND (arg0
, 0);
4847 TREE_READONLY (t
) = TREE_READONLY (o
);
4848 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4852 TREE_THIS_VOLATILE (t
)
4853 = (TREE_CODE_CLASS (code
) == tcc_reference
4854 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4859 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4860 on the pointer PTR. */
4863 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4865 poly_int64 offset
= 0;
4866 tree ptype
= TREE_TYPE (ptr
);
4868 /* For convenience allow addresses that collapse to a simple base
4870 if (TREE_CODE (ptr
) == ADDR_EXPR
4871 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4872 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4874 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4876 if (TREE_CODE (ptr
) == MEM_REF
)
4878 offset
+= mem_ref_offset (ptr
).force_shwi ();
4879 ptr
= TREE_OPERAND (ptr
, 0);
4882 ptr
= build_fold_addr_expr (ptr
);
4883 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4885 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4886 ptr
, build_int_cst (ptype
, offset
));
4887 SET_EXPR_LOCATION (tem
, loc
);
4891 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4894 mem_ref_offset (const_tree t
)
4896 return poly_offset_int::from (wi::to_poly_wide (TREE_OPERAND (t
, 1)),
4900 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4901 offsetted by OFFSET units. */
4904 build_invariant_address (tree type
, tree base
, poly_int64 offset
)
4906 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4907 build_fold_addr_expr (base
),
4908 build_int_cst (ptr_type_node
, offset
));
4909 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4910 recompute_tree_invariant_for_addr_expr (addr
);
4914 /* Similar except don't specify the TREE_TYPE
4915 and leave the TREE_SIDE_EFFECTS as 0.
4916 It is permissible for arguments to be null,
4917 or even garbage if their values do not matter. */
4920 build_nt (enum tree_code code
, ...)
4927 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4931 t
= make_node (code
);
4932 length
= TREE_CODE_LENGTH (code
);
4934 for (i
= 0; i
< length
; i
++)
4935 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4941 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4945 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4950 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4951 CALL_EXPR_FN (ret
) = fn
;
4952 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4953 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4954 CALL_EXPR_ARG (ret
, ix
) = t
;
4958 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4959 We do NOT enter this node in any sort of symbol table.
4961 LOC is the location of the decl.
4963 layout_decl is used to set up the decl's storage layout.
4964 Other slots are initialized to 0 or null pointers. */
4967 build_decl (location_t loc
, enum tree_code code
, tree name
,
4968 tree type MEM_STAT_DECL
)
4972 t
= make_node (code PASS_MEM_STAT
);
4973 DECL_SOURCE_LOCATION (t
) = loc
;
4975 /* if (type == error_mark_node)
4976 type = integer_type_node; */
4977 /* That is not done, deliberately, so that having error_mark_node
4978 as the type can suppress useless errors in the use of this variable. */
4980 DECL_NAME (t
) = name
;
4981 TREE_TYPE (t
) = type
;
4983 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4989 /* Builds and returns function declaration with NAME and TYPE. */
4992 build_fn_decl (const char *name
, tree type
)
4994 tree id
= get_identifier (name
);
4995 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4997 DECL_EXTERNAL (decl
) = 1;
4998 TREE_PUBLIC (decl
) = 1;
4999 DECL_ARTIFICIAL (decl
) = 1;
5000 TREE_NOTHROW (decl
) = 1;
5005 vec
<tree
, va_gc
> *all_translation_units
;
5007 /* Builds a new translation-unit decl with name NAME, queues it in the
5008 global list of translation-unit decls and returns it. */
5011 build_translation_unit_decl (tree name
)
5013 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
5015 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
5016 vec_safe_push (all_translation_units
, tu
);
5021 /* BLOCK nodes are used to represent the structure of binding contours
5022 and declarations, once those contours have been exited and their contents
5023 compiled. This information is used for outputting debugging info. */
5026 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
5028 tree block
= make_node (BLOCK
);
5030 BLOCK_VARS (block
) = vars
;
5031 BLOCK_SUBBLOCKS (block
) = subblocks
;
5032 BLOCK_SUPERCONTEXT (block
) = supercontext
;
5033 BLOCK_CHAIN (block
) = chain
;
5038 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
5040 LOC is the location to use in tree T. */
5043 protected_set_expr_location (tree t
, location_t loc
)
5045 if (CAN_HAVE_LOCATION_P (t
))
5046 SET_EXPR_LOCATION (t
, loc
);
5049 /* Data used when collecting DECLs and TYPEs for language data removal. */
5051 struct free_lang_data_d
5053 free_lang_data_d () : decls (100), types (100) {}
5055 /* Worklist to avoid excessive recursion. */
5056 auto_vec
<tree
> worklist
;
5058 /* Set of traversed objects. Used to avoid duplicate visits. */
5059 hash_set
<tree
> pset
;
5061 /* Array of symbols to process with free_lang_data_in_decl. */
5062 auto_vec
<tree
> decls
;
5064 /* Array of types to process with free_lang_data_in_type. */
5065 auto_vec
<tree
> types
;
5069 /* Add type or decl T to one of the list of tree nodes that need their
5070 language data removed. The lists are held inside FLD. */
5073 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5076 fld
->decls
.safe_push (t
);
5077 else if (TYPE_P (t
))
5078 fld
->types
.safe_push (t
);
5083 /* Push tree node T into FLD->WORKLIST. */
5086 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5088 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5089 fld
->worklist
.safe_push ((t
));
5094 /* Return simplified TYPE_NAME of TYPE. */
5097 fld_simplified_type_name (tree type
)
5099 if (!TYPE_NAME (type
) || TREE_CODE (TYPE_NAME (type
)) != TYPE_DECL
)
5100 return TYPE_NAME (type
);
5101 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5102 TYPE_DECL if the type doesn't have linkage.
5103 this must match fld_ */
5104 if (type
!= TYPE_MAIN_VARIANT (type
) || ! type_with_linkage_p (type
))
5105 return DECL_NAME (TYPE_NAME (type
));
5106 return TYPE_NAME (type
);
5109 /* Do same comparsion as check_qualified_type skipping lang part of type
5110 and be more permissive about type names: we only care that names are
5111 same (for diagnostics) and that ODR names are the same. */
5114 fld_type_variant_equal_p (tree t
, tree v
)
5116 if (TYPE_QUALS (t
) != TYPE_QUALS (v
)
5117 /* We want to match incomplete variants with complete types.
5118 In this case we need to ignore alignment. */
5119 || ((!RECORD_OR_UNION_TYPE_P (t
) || COMPLETE_TYPE_P (v
))
5120 && (TYPE_ALIGN (t
) != TYPE_ALIGN (v
)
5121 || TYPE_USER_ALIGN (t
) != TYPE_USER_ALIGN (v
)))
5122 || fld_simplified_type_name (t
) != fld_simplified_type_name (v
)
5123 || !attribute_list_equal (TYPE_ATTRIBUTES (t
),
5124 TYPE_ATTRIBUTES (v
)))
5130 /* Find variant of FIRST that match T and create new one if necessary. */
5133 fld_type_variant (tree first
, tree t
, struct free_lang_data_d
*fld
)
5135 if (first
== TYPE_MAIN_VARIANT (t
))
5137 for (tree v
= first
; v
; v
= TYPE_NEXT_VARIANT (v
))
5138 if (fld_type_variant_equal_p (t
, v
))
5140 tree v
= build_variant_type_copy (first
);
5141 TYPE_READONLY (v
) = TYPE_READONLY (t
);
5142 TYPE_VOLATILE (v
) = TYPE_VOLATILE (t
);
5143 TYPE_ATOMIC (v
) = TYPE_ATOMIC (t
);
5144 TYPE_RESTRICT (v
) = TYPE_RESTRICT (t
);
5145 TYPE_ADDR_SPACE (v
) = TYPE_ADDR_SPACE (t
);
5146 TYPE_NAME (v
) = TYPE_NAME (t
);
5147 TYPE_ATTRIBUTES (v
) = TYPE_ATTRIBUTES (t
);
5148 TYPE_CANONICAL (v
) = TYPE_CANONICAL (t
);
5149 /* Variants of incomplete types should have alignment
5150 set to BITS_PER_UNIT. Do not copy the actual alignment. */
5151 if (!RECORD_OR_UNION_TYPE_P (v
) || COMPLETE_TYPE_P (v
))
5153 SET_TYPE_ALIGN (v
, TYPE_ALIGN (t
));
5154 TYPE_USER_ALIGN (v
) = TYPE_USER_ALIGN (t
);
5156 gcc_checking_assert (fld_type_variant_equal_p (t
,v
));
5157 add_tree_to_fld_list (v
, fld
);
5161 /* Map complete types to incomplete types. */
5163 static hash_map
<tree
, tree
> *fld_incomplete_types
;
5165 /* For T being aggregate type try to turn it into a incomplete variant.
5166 Return T if no simplification is possible. */
5169 fld_incomplete_type_of (tree t
, struct free_lang_data_d
*fld
)
5173 if (POINTER_TYPE_P (t
))
5175 tree t2
= fld_incomplete_type_of (TREE_TYPE (t
), fld
);
5176 if (t2
!= TREE_TYPE (t
))
5179 if (TREE_CODE (t
) == POINTER_TYPE
)
5180 first
= build_pointer_type_for_mode (t2
, TYPE_MODE (t
),
5181 TYPE_REF_CAN_ALIAS_ALL (t
));
5183 first
= build_reference_type_for_mode (t2
, TYPE_MODE (t
),
5184 TYPE_REF_CAN_ALIAS_ALL (t
));
5185 gcc_assert (TYPE_CANONICAL (t2
) != t2
5186 && TYPE_CANONICAL (t2
) == TYPE_CANONICAL (TREE_TYPE (t
)));
5187 add_tree_to_fld_list (first
, fld
);
5188 return fld_type_variant (first
, t
, fld
);
5192 if (!RECORD_OR_UNION_TYPE_P (t
) || !COMPLETE_TYPE_P (t
))
5194 if (TYPE_MAIN_VARIANT (t
) == t
)
5198 = fld_incomplete_types
->get_or_insert (t
, &existed
);
5202 copy
= build_distinct_type_copy (t
);
5204 /* It is possible type was not seen by free_lang_data yet. */
5205 add_tree_to_fld_list (copy
, fld
);
5206 TYPE_SIZE (copy
) = NULL
;
5207 SET_TYPE_MODE (copy
, VOIDmode
);
5208 SET_TYPE_ALIGN (copy
, BITS_PER_UNIT
);
5209 TYPE_USER_ALIGN (copy
) = 0;
5210 TYPE_SIZE_UNIT (copy
) = NULL
;
5211 TYPE_CANONICAL (copy
) = TYPE_CANONICAL (t
);
5212 TYPE_TYPELESS_STORAGE (copy
) = 0;
5213 TREE_ADDRESSABLE (copy
) = 0;
5214 if (AGGREGATE_TYPE_P (t
))
5216 TYPE_FIELDS (copy
) = NULL
;
5217 TYPE_BINFO (copy
) = NULL
;
5220 TYPE_VALUES (copy
) = NULL
;
5224 return (fld_type_variant
5225 (fld_incomplete_type_of (TYPE_MAIN_VARIANT (t
), fld
), t
, fld
));
5228 /* Simplify type T for scenarios where we do not need complete pointer
5232 fld_simplified_type (tree t
, struct free_lang_data_d
*fld
)
5234 if (t
&& POINTER_TYPE_P (t
))
5235 return fld_incomplete_type_of (t
, fld
);
5239 /* Reset the expression *EXPR_P, a size or position.
5241 ??? We could reset all non-constant sizes or positions. But it's cheap
5242 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5244 We need to reset self-referential sizes or positions because they cannot
5245 be gimplified and thus can contain a CALL_EXPR after the gimplification
5246 is finished, which will run afoul of LTO streaming. And they need to be
5247 reset to something essentially dummy but not constant, so as to preserve
5248 the properties of the object they are attached to. */
5251 free_lang_data_in_one_sizepos (tree
*expr_p
)
5253 tree expr
= *expr_p
;
5254 if (CONTAINS_PLACEHOLDER_P (expr
))
5255 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5259 /* Reset all the fields in a binfo node BINFO. We only keep
5260 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5263 free_lang_data_in_binfo (tree binfo
)
5268 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5270 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5271 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5272 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5273 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5274 BINFO_VPTR_FIELD (binfo
) = NULL_TREE
;
5276 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5277 free_lang_data_in_binfo (t
);
5281 /* Reset all language specific information still present in TYPE. */
5284 free_lang_data_in_type (tree type
, struct free_lang_data_d
*fld
)
5286 gcc_assert (TYPE_P (type
));
5288 /* Give the FE a chance to remove its own data first. */
5289 lang_hooks
.free_lang_data (type
);
5291 TREE_LANG_FLAG_0 (type
) = 0;
5292 TREE_LANG_FLAG_1 (type
) = 0;
5293 TREE_LANG_FLAG_2 (type
) = 0;
5294 TREE_LANG_FLAG_3 (type
) = 0;
5295 TREE_LANG_FLAG_4 (type
) = 0;
5296 TREE_LANG_FLAG_5 (type
) = 0;
5297 TREE_LANG_FLAG_6 (type
) = 0;
5299 TYPE_NEEDS_CONSTRUCTING (type
) = 0;
5301 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5303 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5304 /* Remove the const and volatile qualifiers from arguments. The
5305 C++ front end removes them, but the C front end does not,
5306 leading to false ODR violation errors when merging two
5307 instances of the same function signature compiled by
5308 different front ends. */
5309 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5311 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5312 tree arg_type
= TREE_VALUE (p
);
5314 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5316 int quals
= TYPE_QUALS (arg_type
)
5318 & ~TYPE_QUAL_VOLATILE
;
5319 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5320 free_lang_data_in_type (TREE_VALUE (p
), fld
);
5322 /* C++ FE uses TREE_PURPOSE to store initial values. */
5323 TREE_PURPOSE (p
) = NULL
;
5326 else if (TREE_CODE (type
) == METHOD_TYPE
)
5328 TREE_TYPE (type
) = fld_simplified_type (TREE_TYPE (type
), fld
);
5329 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5331 /* C++ FE uses TREE_PURPOSE to store initial values. */
5332 TREE_VALUE (p
) = fld_simplified_type (TREE_VALUE (p
), fld
);
5333 TREE_PURPOSE (p
) = NULL
;
5336 else if (RECORD_OR_UNION_TYPE_P (type
))
5338 /* Remove members that are not FIELD_DECLs from the field list
5339 of an aggregate. These occur in C++. */
5340 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
5341 if (TREE_CODE (member
) == FIELD_DECL
)
5342 prev
= &DECL_CHAIN (member
);
5344 *prev
= DECL_CHAIN (member
);
5346 TYPE_VFIELD (type
) = NULL_TREE
;
5348 if (TYPE_BINFO (type
))
5350 free_lang_data_in_binfo (TYPE_BINFO (type
));
5351 /* We need to preserve link to bases and virtual table for all
5352 polymorphic types to make devirtualization machinery working. */
5353 if (!BINFO_VTABLE (TYPE_BINFO (type
))
5354 || !flag_devirtualize
)
5355 TYPE_BINFO (type
) = NULL
;
5358 else if (INTEGRAL_TYPE_P (type
)
5359 || SCALAR_FLOAT_TYPE_P (type
)
5360 || FIXED_POINT_TYPE_P (type
))
5362 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
5364 /* Type values are used only for C++ ODR checking. Drop them
5365 for all type variants and non-ODR types. */
5366 if (TYPE_MAIN_VARIANT (type
) != type
5367 || !type_with_linkage_p (type
))
5368 TYPE_VALUES (type
) = NULL
;
5370 /* Simplify representation by recording only values rather
5371 than const decls. */
5372 for (tree e
= TYPE_VALUES (type
); e
; e
= TREE_CHAIN (e
))
5373 if (TREE_CODE (TREE_VALUE (e
)) == CONST_DECL
)
5374 TREE_VALUE (e
) = DECL_INITIAL (TREE_VALUE (e
));
5376 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5377 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5380 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5382 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5383 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5385 if (TYPE_CONTEXT (type
)
5386 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5388 tree ctx
= TYPE_CONTEXT (type
);
5391 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5393 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5394 TYPE_CONTEXT (type
) = ctx
;
5397 /* Drop TYPE_DECLs in TYPE_NAME in favor of the identifier in the
5398 TYPE_DECL if the type doesn't have linkage.
5399 this must match fld_ */
5400 if (type
!= TYPE_MAIN_VARIANT (type
) || ! type_with_linkage_p (type
))
5401 TYPE_STUB_DECL (type
) = NULL
;
5402 TYPE_NAME (type
) = fld_simplified_type_name (type
);
5406 /* Return true if DECL may need an assembler name to be set. */
5409 need_assembler_name_p (tree decl
)
5411 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5412 Rule merging. This makes type_odr_p to return true on those types during
5413 LTO and by comparing the mangled name, we can say what types are intended
5414 to be equivalent across compilation unit.
5416 We do not store names of type_in_anonymous_namespace_p.
5418 Record, union and enumeration type have linkage that allows use
5419 to check type_in_anonymous_namespace_p. We do not mangle compound types
5420 that always can be compared structurally.
5422 Similarly for builtin types, we compare properties of their main variant.
5423 A special case are integer types where mangling do make differences
5424 between char/signed char/unsigned char etc. Storing name for these makes
5425 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5426 See cp/mangle.c:write_builtin_type for details. */
5428 if (flag_lto_odr_type_mering
5429 && TREE_CODE (decl
) == TYPE_DECL
5431 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5432 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5433 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5434 && (type_with_linkage_p (TREE_TYPE (decl
))
5435 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5436 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5437 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5438 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5439 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5442 /* If DECL already has its assembler name set, it does not need a
5444 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5445 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5448 /* Abstract decls do not need an assembler name. */
5449 if (DECL_ABSTRACT_P (decl
))
5452 /* For VAR_DECLs, only static, public and external symbols need an
5455 && !TREE_STATIC (decl
)
5456 && !TREE_PUBLIC (decl
)
5457 && !DECL_EXTERNAL (decl
))
5460 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5462 /* Do not set assembler name on builtins. Allow RTL expansion to
5463 decide whether to expand inline or via a regular call. */
5464 if (fndecl_built_in_p (decl
)
5465 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5468 /* Functions represented in the callgraph need an assembler name. */
5469 if (cgraph_node::get (decl
) != NULL
)
5472 /* Unused and not public functions don't need an assembler name. */
5473 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5481 /* Reset all language specific information still present in symbol
5485 free_lang_data_in_decl (tree decl
, struct free_lang_data_d
*fld
)
5487 gcc_assert (DECL_P (decl
));
5489 /* Give the FE a chance to remove its own data first. */
5490 lang_hooks
.free_lang_data (decl
);
5492 TREE_LANG_FLAG_0 (decl
) = 0;
5493 TREE_LANG_FLAG_1 (decl
) = 0;
5494 TREE_LANG_FLAG_2 (decl
) = 0;
5495 TREE_LANG_FLAG_3 (decl
) = 0;
5496 TREE_LANG_FLAG_4 (decl
) = 0;
5497 TREE_LANG_FLAG_5 (decl
) = 0;
5498 TREE_LANG_FLAG_6 (decl
) = 0;
5500 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5501 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5502 if (TREE_CODE (decl
) == FIELD_DECL
)
5504 DECL_FCONTEXT (decl
) = NULL
;
5505 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5506 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5507 DECL_QUALIFIER (decl
) = NULL_TREE
;
5510 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5512 struct cgraph_node
*node
;
5513 /* Frontends do not set TREE_ADDRESSABLE on public variables even though
5514 the address may be taken in other unit, so this flag has no practical
5517 It would make more sense if frontends set TREE_ADDRESSABLE to 0 only
5518 for public objects that indeed can not be adressed, but it is not
5519 the case. Set the flag to true so we do not get merge failures for
5520 i.e. virtual tables between units that take address of it and
5521 units that don't. */
5522 if (TREE_PUBLIC (decl
))
5523 TREE_ADDRESSABLE (decl
) = true;
5524 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5525 if (!(node
= cgraph_node::get (decl
))
5526 || (!node
->definition
&& !node
->clones
))
5529 node
->release_body ();
5532 release_function_body (decl
);
5533 DECL_ARGUMENTS (decl
) = NULL
;
5534 DECL_RESULT (decl
) = NULL
;
5535 DECL_INITIAL (decl
) = error_mark_node
;
5538 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5542 /* If DECL has a gimple body, then the context for its
5543 arguments must be DECL. Otherwise, it doesn't really
5544 matter, as we will not be emitting any code for DECL. In
5545 general, there may be other instances of DECL created by
5546 the front end and since PARM_DECLs are generally shared,
5547 their DECL_CONTEXT changes as the replicas of DECL are
5548 created. The only time where DECL_CONTEXT is important
5549 is for the FUNCTION_DECLs that have a gimple body (since
5550 the PARM_DECL will be used in the function's body). */
5551 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5552 DECL_CONTEXT (t
) = decl
;
5553 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5554 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5555 = target_option_default_node
;
5556 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5557 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5558 = optimization_default_node
;
5561 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5562 At this point, it is not needed anymore. */
5563 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5565 /* Clear the abstract origin if it refers to a method.
5566 Otherwise dwarf2out.c will ICE as we splice functions out of
5567 TYPE_FIELDS and thus the origin will not be output
5569 if (DECL_ABSTRACT_ORIGIN (decl
)
5570 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5571 && RECORD_OR_UNION_TYPE_P
5572 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5573 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5575 DECL_VINDEX (decl
) = NULL_TREE
;
5577 else if (VAR_P (decl
))
5579 /* See comment above why we set the flag for functoins. */
5580 if (TREE_PUBLIC (decl
))
5581 TREE_ADDRESSABLE (decl
) = true;
5582 if ((DECL_EXTERNAL (decl
)
5583 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5584 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5585 DECL_INITIAL (decl
) = NULL_TREE
;
5587 else if (TREE_CODE (decl
) == TYPE_DECL
)
5589 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5590 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5591 /* TREE_PUBLIC is used to tell if type is anonymous. */
5592 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 0;
5593 DECL_INITIAL (decl
) = NULL_TREE
;
5594 DECL_ORIGINAL_TYPE (decl
) = NULL_TREE
;
5595 DECL_MODE (decl
) = VOIDmode
;
5596 TREE_TYPE (decl
) = void_type_node
;
5597 SET_DECL_ALIGN (decl
, 0);
5599 else if (TREE_CODE (decl
) == FIELD_DECL
)
5601 TREE_TYPE (decl
) = fld_simplified_type (TREE_TYPE (decl
), fld
);
5602 DECL_INITIAL (decl
) = NULL_TREE
;
5604 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5605 && DECL_INITIAL (decl
)
5606 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5608 /* Strip builtins from the translation-unit BLOCK. We still have targets
5609 without builtin_decl_explicit support and also builtins are shared
5610 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5611 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5615 if (fndecl_built_in_p (var
))
5616 *nextp
= TREE_CHAIN (var
);
5618 nextp
= &TREE_CHAIN (var
);
5621 /* We need to keep field decls associated with their trees. Otherwise tree
5622 merging may merge some fileds and keep others disjoint wich in turn will
5623 not do well with TREE_CHAIN pointers linking them.
5625 Also do not drop containing types for virtual methods and tables because
5626 these are needed by devirtualization. */
5627 if (TREE_CODE (decl
) != FIELD_DECL
5628 && ((TREE_CODE (decl
) != VAR_DECL
&& TREE_CODE (decl
) != FUNCTION_DECL
)
5629 || !DECL_VIRTUAL_P (decl
)))
5631 tree ctx
= DECL_CONTEXT (decl
);
5632 /* Variably modified types are needed for tree_is_indexable to decide
5633 whether the type needs to go to local or global section.
5634 This code is semi-broken but for now it is easiest to keep contexts
5636 if (ctx
&& TYPE_P (ctx
)
5637 && !variably_modified_type_p (ctx
, NULL_TREE
))
5639 while (ctx
&& TYPE_P (ctx
))
5640 ctx
= TYPE_CONTEXT (ctx
);
5641 DECL_CONTEXT (decl
) = ctx
;
5647 /* Operand callback helper for free_lang_data_in_node. *TP is the
5648 subtree operand being considered. */
5651 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5654 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5656 if (TREE_CODE (t
) == TREE_LIST
)
5659 /* Language specific nodes will be removed, so there is no need
5660 to gather anything under them. */
5661 if (is_lang_specific (t
))
5669 /* Note that walk_tree does not traverse every possible field in
5670 decls, so we have to do our own traversals here. */
5671 add_tree_to_fld_list (t
, fld
);
5673 fld_worklist_push (DECL_NAME (t
), fld
);
5674 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5675 fld_worklist_push (DECL_SIZE (t
), fld
);
5676 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5678 /* We are going to remove everything under DECL_INITIAL for
5679 TYPE_DECLs. No point walking them. */
5680 if (TREE_CODE (t
) != TYPE_DECL
)
5681 fld_worklist_push (DECL_INITIAL (t
), fld
);
5683 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5684 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5686 if (TREE_CODE (t
) == FUNCTION_DECL
)
5688 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5689 fld_worklist_push (DECL_RESULT (t
), fld
);
5691 else if (TREE_CODE (t
) == FIELD_DECL
)
5693 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5694 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5695 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5696 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5699 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5700 && DECL_HAS_VALUE_EXPR_P (t
))
5701 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5703 if (TREE_CODE (t
) != FIELD_DECL
5704 && TREE_CODE (t
) != TYPE_DECL
)
5705 fld_worklist_push (TREE_CHAIN (t
), fld
);
5708 else if (TYPE_P (t
))
5710 /* Note that walk_tree does not traverse every possible field in
5711 types, so we have to do our own traversals here. */
5712 add_tree_to_fld_list (t
, fld
);
5714 if (!RECORD_OR_UNION_TYPE_P (t
))
5715 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5716 fld_worklist_push (TYPE_SIZE (t
), fld
);
5717 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5718 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5719 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5720 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5721 fld_worklist_push (TYPE_NAME (t
), fld
);
5722 /* While we do not stream TYPE_POINTER_TO and TYPE_REFERENCE_TO
5723 lists, we may look types up in these lists and use them while
5724 optimizing the function body. Thus we need to free lang data
5726 if (TREE_CODE (t
) == POINTER_TYPE
)
5727 fld_worklist_push (TYPE_NEXT_PTR_TO (t
), fld
);
5728 if (TREE_CODE (t
) == REFERENCE_TYPE
)
5729 fld_worklist_push (TYPE_NEXT_REF_TO (t
), fld
);
5730 if (!POINTER_TYPE_P (t
))
5731 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5732 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5733 if (!RECORD_OR_UNION_TYPE_P (t
))
5734 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5735 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5736 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5737 do not and want not to reach unused variants this way. */
5738 if (TYPE_CONTEXT (t
))
5740 tree ctx
= TYPE_CONTEXT (t
);
5741 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5742 So push that instead. */
5743 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5744 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5745 fld_worklist_push (ctx
, fld
);
5747 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5748 and want not to reach unused types this way. */
5750 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5754 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5755 fld_worklist_push (TREE_TYPE (tem
), fld
);
5756 fld_worklist_push (BINFO_TYPE (TYPE_BINFO (t
)), fld
);
5757 fld_worklist_push (BINFO_VTABLE (TYPE_BINFO (t
)), fld
);
5759 if (RECORD_OR_UNION_TYPE_P (t
))
5762 /* Push all TYPE_FIELDS - there can be interleaving interesting
5763 and non-interesting things. */
5764 tem
= TYPE_FIELDS (t
);
5767 if (TREE_CODE (tem
) == FIELD_DECL
)
5768 fld_worklist_push (tem
, fld
);
5769 tem
= TREE_CHAIN (tem
);
5772 if (FUNC_OR_METHOD_TYPE_P (t
))
5773 fld_worklist_push (TYPE_METHOD_BASETYPE (t
), fld
);
5775 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5778 else if (TREE_CODE (t
) == BLOCK
)
5780 for (tree
*tem
= &BLOCK_VARS (t
); *tem
; )
5782 if (TREE_CODE (*tem
) != VAR_DECL
5783 || !auto_var_in_fn_p (*tem
, DECL_CONTEXT (*tem
)))
5785 gcc_assert (TREE_CODE (*tem
) != RESULT_DECL
5786 && TREE_CODE (*tem
) != PARM_DECL
);
5787 *tem
= TREE_CHAIN (*tem
);
5791 fld_worklist_push (*tem
, fld
);
5792 tem
= &TREE_CHAIN (*tem
);
5795 for (tree tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5796 fld_worklist_push (tem
, fld
);
5797 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5800 if (TREE_CODE (t
) != IDENTIFIER_NODE
5801 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5802 fld_worklist_push (TREE_TYPE (t
), fld
);
5808 /* Find decls and types in T. */
5811 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5815 if (!fld
->pset
.contains (t
))
5816 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5817 if (fld
->worklist
.is_empty ())
5819 t
= fld
->worklist
.pop ();
5823 /* Translate all the types in LIST with the corresponding runtime
5827 get_eh_types_for_runtime (tree list
)
5831 if (list
== NULL_TREE
)
5834 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5836 list
= TREE_CHAIN (list
);
5839 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5840 TREE_CHAIN (prev
) = n
;
5841 prev
= TREE_CHAIN (prev
);
5842 list
= TREE_CHAIN (list
);
5849 /* Find decls and types referenced in EH region R and store them in
5850 FLD->DECLS and FLD->TYPES. */
5853 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5864 /* The types referenced in each catch must first be changed to the
5865 EH types used at runtime. This removes references to FE types
5867 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5869 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5870 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5875 case ERT_ALLOWED_EXCEPTIONS
:
5876 r
->u
.allowed
.type_list
5877 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5878 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5881 case ERT_MUST_NOT_THROW
:
5882 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5883 find_decls_types_r
, fld
, &fld
->pset
);
5889 /* Find decls and types referenced in cgraph node N and store them in
5890 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5891 look for *every* kind of DECL and TYPE node reachable from N,
5892 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5893 NAMESPACE_DECLs, etc). */
5896 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5899 struct function
*fn
;
5903 find_decls_types (n
->decl
, fld
);
5905 if (!gimple_has_body_p (n
->decl
))
5908 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5910 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5912 /* Traverse locals. */
5913 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5914 find_decls_types (t
, fld
);
5916 /* Traverse EH regions in FN. */
5919 FOR_ALL_EH_REGION_FN (r
, fn
)
5920 find_decls_types_in_eh_region (r
, fld
);
5923 /* Traverse every statement in FN. */
5924 FOR_EACH_BB_FN (bb
, fn
)
5927 gimple_stmt_iterator si
;
5930 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5932 gphi
*phi
= psi
.phi ();
5934 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5936 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5937 find_decls_types (*arg_p
, fld
);
5941 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5943 gimple
*stmt
= gsi_stmt (si
);
5945 if (is_gimple_call (stmt
))
5946 find_decls_types (gimple_call_fntype (stmt
), fld
);
5948 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5950 tree arg
= gimple_op (stmt
, i
);
5951 find_decls_types (arg
, fld
);
5958 /* Find decls and types referenced in varpool node N and store them in
5959 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5960 look for *every* kind of DECL and TYPE node reachable from N,
5961 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5962 NAMESPACE_DECLs, etc). */
5965 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5967 find_decls_types (v
->decl
, fld
);
5970 /* If T needs an assembler name, have one created for it. */
5973 assign_assembler_name_if_needed (tree t
)
5975 if (need_assembler_name_p (t
))
5977 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5978 diagnostics that use input_location to show locus
5979 information. The problem here is that, at this point,
5980 input_location is generally anchored to the end of the file
5981 (since the parser is long gone), so we don't have a good
5982 position to pin it to.
5984 To alleviate this problem, this uses the location of T's
5985 declaration. Examples of this are
5986 testsuite/g++.dg/template/cond2.C and
5987 testsuite/g++.dg/template/pr35240.C. */
5988 location_t saved_location
= input_location
;
5989 input_location
= DECL_SOURCE_LOCATION (t
);
5991 decl_assembler_name (t
);
5993 input_location
= saved_location
;
5998 /* Free language specific information for every operand and expression
5999 in every node of the call graph. This process operates in three stages:
6001 1- Every callgraph node and varpool node is traversed looking for
6002 decls and types embedded in them. This is a more exhaustive
6003 search than that done by find_referenced_vars, because it will
6004 also collect individual fields, decls embedded in types, etc.
6006 2- All the decls found are sent to free_lang_data_in_decl.
6008 3- All the types found are sent to free_lang_data_in_type.
6010 The ordering between decls and types is important because
6011 free_lang_data_in_decl sets assembler names, which includes
6012 mangling. So types cannot be freed up until assembler names have
6016 free_lang_data_in_cgraph (void)
6018 struct cgraph_node
*n
;
6020 struct free_lang_data_d fld
;
6025 /* Find decls and types in the body of every function in the callgraph. */
6026 FOR_EACH_FUNCTION (n
)
6027 find_decls_types_in_node (n
, &fld
);
6029 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
6030 find_decls_types (p
->decl
, &fld
);
6032 /* Find decls and types in every varpool symbol. */
6033 FOR_EACH_VARIABLE (v
)
6034 find_decls_types_in_var (v
, &fld
);
6036 /* Set the assembler name on every decl found. We need to do this
6037 now because free_lang_data_in_decl will invalidate data needed
6038 for mangling. This breaks mangling on interdependent decls. */
6039 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
6040 assign_assembler_name_if_needed (t
);
6042 /* Traverse every decl found freeing its language data. */
6043 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
6044 free_lang_data_in_decl (t
, &fld
);
6046 /* Traverse every type found freeing its language data. */
6047 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6048 free_lang_data_in_type (t
, &fld
);
6051 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
6057 /* Free resources that are used by FE but are not needed once they are done. */
6060 free_lang_data (void)
6064 /* If we are the LTO frontend we have freed lang-specific data already. */
6066 || (!flag_generate_lto
&& !flag_generate_offload
))
6069 fld_incomplete_types
= new hash_map
<tree
, tree
>;
6071 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
6072 if (vec_safe_is_empty (all_translation_units
))
6073 build_translation_unit_decl (NULL_TREE
);
6075 /* Allocate and assign alias sets to the standard integer types
6076 while the slots are still in the way the frontends generated them. */
6077 for (i
= 0; i
< itk_none
; ++i
)
6078 if (integer_types
[i
])
6079 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6081 /* Traverse the IL resetting language specific information for
6082 operands, expressions, etc. */
6083 free_lang_data_in_cgraph ();
6085 /* Create gimple variants for common types. */
6086 for (unsigned i
= 0;
6087 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
6089 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
6091 /* Reset some langhooks. Do not reset types_compatible_p, it may
6092 still be used indirectly via the get_alias_set langhook. */
6093 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6094 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6095 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6096 lang_hooks
.overwrite_decl_assembler_name
= lhd_overwrite_decl_assembler_name
;
6097 lang_hooks
.print_xnode
= lhd_print_tree_nothing
;
6098 lang_hooks
.print_decl
= lhd_print_tree_nothing
;
6099 lang_hooks
.print_type
= lhd_print_tree_nothing
;
6100 lang_hooks
.print_identifier
= lhd_print_tree_nothing
;
6102 lang_hooks
.tree_inlining
.var_mod_type_p
= hook_bool_tree_tree_false
;
6104 /* We do not want the default decl_assembler_name implementation,
6105 rather if we have fixed everything we want a wrapper around it
6106 asserting that all non-local symbols already got their assembler
6107 name and only produce assembler names for local symbols. Or rather
6108 make sure we never call decl_assembler_name on local symbols and
6109 devise a separate, middle-end private scheme for it. */
6111 /* Reset diagnostic machinery. */
6112 tree_diagnostics_defaults (global_dc
);
6114 rebuild_type_inheritance_graph ();
6116 delete fld_incomplete_types
;
6124 const pass_data pass_data_ipa_free_lang_data
=
6126 SIMPLE_IPA_PASS
, /* type */
6127 "*free_lang_data", /* name */
6128 OPTGROUP_NONE
, /* optinfo_flags */
6129 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6130 0, /* properties_required */
6131 0, /* properties_provided */
6132 0, /* properties_destroyed */
6133 0, /* todo_flags_start */
6134 0, /* todo_flags_finish */
6137 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6140 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6141 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6144 /* opt_pass methods: */
6145 virtual unsigned int execute (function
*) { return free_lang_data (); }
6147 }; // class pass_ipa_free_lang_data
6151 simple_ipa_opt_pass
*
6152 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6154 return new pass_ipa_free_lang_data (ctxt
);
6157 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6158 of the various TYPE_QUAL values. */
6161 set_type_quals (tree type
, int type_quals
)
6163 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6164 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6165 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6166 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6167 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6170 /* Returns true iff CAND and BASE have equivalent language-specific
6174 check_lang_type (const_tree cand
, const_tree base
)
6176 if (lang_hooks
.types
.type_hash_eq
== NULL
)
6178 /* type_hash_eq currently only applies to these types. */
6179 if (TREE_CODE (cand
) != FUNCTION_TYPE
6180 && TREE_CODE (cand
) != METHOD_TYPE
)
6182 return lang_hooks
.types
.type_hash_eq (cand
, base
);
6185 /* Returns true iff unqualified CAND and BASE are equivalent. */
6188 check_base_type (const_tree cand
, const_tree base
)
6190 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6191 /* Apparently this is needed for Objective-C. */
6192 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6193 /* Check alignment. */
6194 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6195 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6196 TYPE_ATTRIBUTES (base
)));
6199 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6202 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6204 return (TYPE_QUALS (cand
) == type_quals
6205 && check_base_type (cand
, base
)
6206 && check_lang_type (cand
, base
));
6209 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6212 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6214 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6215 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6216 /* Apparently this is needed for Objective-C. */
6217 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6218 /* Check alignment. */
6219 && TYPE_ALIGN (cand
) == align
6220 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6221 TYPE_ATTRIBUTES (base
))
6222 && check_lang_type (cand
, base
));
6225 /* This function checks to see if TYPE matches the size one of the built-in
6226 atomic types, and returns that core atomic type. */
6229 find_atomic_core_type (tree type
)
6231 tree base_atomic_type
;
6233 /* Only handle complete types. */
6234 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
6237 switch (tree_to_uhwi (TYPE_SIZE (type
)))
6240 base_atomic_type
= atomicQI_type_node
;
6244 base_atomic_type
= atomicHI_type_node
;
6248 base_atomic_type
= atomicSI_type_node
;
6252 base_atomic_type
= atomicDI_type_node
;
6256 base_atomic_type
= atomicTI_type_node
;
6260 base_atomic_type
= NULL_TREE
;
6263 return base_atomic_type
;
6266 /* Return a version of the TYPE, qualified as indicated by the
6267 TYPE_QUALS, if one exists. If no qualified version exists yet,
6268 return NULL_TREE. */
6271 get_qualified_type (tree type
, int type_quals
)
6275 if (TYPE_QUALS (type
) == type_quals
)
6278 /* Search the chain of variants to see if there is already one there just
6279 like the one we need to have. If so, use that existing one. We must
6280 preserve the TYPE_NAME, since there is code that depends on this. */
6281 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6282 if (check_qualified_type (t
, type
, type_quals
))
6288 /* Like get_qualified_type, but creates the type if it does not
6289 exist. This function never returns NULL_TREE. */
6292 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
6296 /* See if we already have the appropriate qualified variant. */
6297 t
= get_qualified_type (type
, type_quals
);
6299 /* If not, build it. */
6302 t
= build_variant_type_copy (type PASS_MEM_STAT
);
6303 set_type_quals (t
, type_quals
);
6305 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6307 /* See if this object can map to a basic atomic type. */
6308 tree atomic_type
= find_atomic_core_type (type
);
6311 /* Ensure the alignment of this type is compatible with
6312 the required alignment of the atomic type. */
6313 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6314 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6318 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6319 /* Propagate structural equality. */
6320 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6321 else if (TYPE_CANONICAL (type
) != type
)
6322 /* Build the underlying canonical type, since it is different
6325 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6326 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6329 /* T is its own canonical type. */
6330 TYPE_CANONICAL (t
) = t
;
6337 /* Create a variant of type T with alignment ALIGN. */
6340 build_aligned_type (tree type
, unsigned int align
)
6344 if (TYPE_PACKED (type
)
6345 || TYPE_ALIGN (type
) == align
)
6348 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6349 if (check_aligned_type (t
, type
, align
))
6352 t
= build_variant_type_copy (type
);
6353 SET_TYPE_ALIGN (t
, align
);
6354 TYPE_USER_ALIGN (t
) = 1;
6359 /* Create a new distinct copy of TYPE. The new type is made its own
6360 MAIN_VARIANT. If TYPE requires structural equality checks, the
6361 resulting type requires structural equality checks; otherwise, its
6362 TYPE_CANONICAL points to itself. */
6365 build_distinct_type_copy (tree type MEM_STAT_DECL
)
6367 tree t
= copy_node (type PASS_MEM_STAT
);
6369 TYPE_POINTER_TO (t
) = 0;
6370 TYPE_REFERENCE_TO (t
) = 0;
6372 /* Set the canonical type either to a new equivalence class, or
6373 propagate the need for structural equality checks. */
6374 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6375 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6377 TYPE_CANONICAL (t
) = t
;
6379 /* Make it its own variant. */
6380 TYPE_MAIN_VARIANT (t
) = t
;
6381 TYPE_NEXT_VARIANT (t
) = 0;
6383 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6384 whose TREE_TYPE is not t. This can also happen in the Ada
6385 frontend when using subtypes. */
6390 /* Create a new variant of TYPE, equivalent but distinct. This is so
6391 the caller can modify it. TYPE_CANONICAL for the return type will
6392 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6393 are considered equal by the language itself (or that both types
6394 require structural equality checks). */
6397 build_variant_type_copy (tree type MEM_STAT_DECL
)
6399 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6401 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6403 /* Since we're building a variant, assume that it is a non-semantic
6404 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6405 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6406 /* Type variants have no alias set defined. */
6407 TYPE_ALIAS_SET (t
) = -1;
6409 /* Add the new type to the chain of variants of TYPE. */
6410 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6411 TYPE_NEXT_VARIANT (m
) = t
;
6412 TYPE_MAIN_VARIANT (t
) = m
;
6417 /* Return true if the from tree in both tree maps are equal. */
6420 tree_map_base_eq (const void *va
, const void *vb
)
6422 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6423 *const b
= (const struct tree_map_base
*) vb
;
6424 return (a
->from
== b
->from
);
6427 /* Hash a from tree in a tree_base_map. */
6430 tree_map_base_hash (const void *item
)
6432 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6435 /* Return true if this tree map structure is marked for garbage collection
6436 purposes. We simply return true if the from tree is marked, so that this
6437 structure goes away when the from tree goes away. */
6440 tree_map_base_marked_p (const void *p
)
6442 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6445 /* Hash a from tree in a tree_map. */
6448 tree_map_hash (const void *item
)
6450 return (((const struct tree_map
*) item
)->hash
);
6453 /* Hash a from tree in a tree_decl_map. */
6456 tree_decl_map_hash (const void *item
)
6458 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6461 /* Return the initialization priority for DECL. */
6464 decl_init_priority_lookup (tree decl
)
6466 symtab_node
*snode
= symtab_node::get (decl
);
6469 return DEFAULT_INIT_PRIORITY
;
6471 snode
->get_init_priority ();
6474 /* Return the finalization priority for DECL. */
6477 decl_fini_priority_lookup (tree decl
)
6479 cgraph_node
*node
= cgraph_node::get (decl
);
6482 return DEFAULT_INIT_PRIORITY
;
6484 node
->get_fini_priority ();
6487 /* Set the initialization priority for DECL to PRIORITY. */
6490 decl_init_priority_insert (tree decl
, priority_type priority
)
6492 struct symtab_node
*snode
;
6494 if (priority
== DEFAULT_INIT_PRIORITY
)
6496 snode
= symtab_node::get (decl
);
6500 else if (VAR_P (decl
))
6501 snode
= varpool_node::get_create (decl
);
6503 snode
= cgraph_node::get_create (decl
);
6504 snode
->set_init_priority (priority
);
6507 /* Set the finalization priority for DECL to PRIORITY. */
6510 decl_fini_priority_insert (tree decl
, priority_type priority
)
6512 struct cgraph_node
*node
;
6514 if (priority
== DEFAULT_INIT_PRIORITY
)
6516 node
= cgraph_node::get (decl
);
6521 node
= cgraph_node::get_create (decl
);
6522 node
->set_fini_priority (priority
);
6525 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6528 print_debug_expr_statistics (void)
6530 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6531 (long) debug_expr_for_decl
->size (),
6532 (long) debug_expr_for_decl
->elements (),
6533 debug_expr_for_decl
->collisions ());
6536 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6539 print_value_expr_statistics (void)
6541 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6542 (long) value_expr_for_decl
->size (),
6543 (long) value_expr_for_decl
->elements (),
6544 value_expr_for_decl
->collisions ());
6547 /* Lookup a debug expression for FROM, and return it if we find one. */
6550 decl_debug_expr_lookup (tree from
)
6552 struct tree_decl_map
*h
, in
;
6553 in
.base
.from
= from
;
6555 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6561 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6564 decl_debug_expr_insert (tree from
, tree to
)
6566 struct tree_decl_map
*h
;
6568 h
= ggc_alloc
<tree_decl_map
> ();
6569 h
->base
.from
= from
;
6571 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6574 /* Lookup a value expression for FROM, and return it if we find one. */
6577 decl_value_expr_lookup (tree from
)
6579 struct tree_decl_map
*h
, in
;
6580 in
.base
.from
= from
;
6582 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6588 /* Insert a mapping FROM->TO in the value expression hashtable. */
6591 decl_value_expr_insert (tree from
, tree to
)
6593 struct tree_decl_map
*h
;
6595 h
= ggc_alloc
<tree_decl_map
> ();
6596 h
->base
.from
= from
;
6598 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6601 /* Lookup a vector of debug arguments for FROM, and return it if we
6605 decl_debug_args_lookup (tree from
)
6607 struct tree_vec_map
*h
, in
;
6609 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6611 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6612 in
.base
.from
= from
;
6613 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6619 /* Insert a mapping FROM->empty vector of debug arguments in the value
6620 expression hashtable. */
6623 decl_debug_args_insert (tree from
)
6625 struct tree_vec_map
*h
;
6628 if (DECL_HAS_DEBUG_ARGS_P (from
))
6629 return decl_debug_args_lookup (from
);
6630 if (debug_args_for_decl
== NULL
)
6631 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6632 h
= ggc_alloc
<tree_vec_map
> ();
6633 h
->base
.from
= from
;
6635 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6637 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6641 /* Hashing of types so that we don't make duplicates.
6642 The entry point is `type_hash_canon'. */
6644 /* Generate the default hash code for TYPE. This is designed for
6645 speed, rather than maximum entropy. */
6648 type_hash_canon_hash (tree type
)
6650 inchash::hash hstate
;
6652 hstate
.add_int (TREE_CODE (type
));
6654 if (TREE_TYPE (type
))
6655 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6657 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6658 /* Just the identifier is adequate to distinguish. */
6659 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6661 switch (TREE_CODE (type
))
6664 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6667 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6668 if (TREE_VALUE (t
) != error_mark_node
)
6669 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6673 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6678 if (TYPE_DOMAIN (type
))
6679 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6680 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6682 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6683 hstate
.add_object (typeless
);
6690 tree t
= TYPE_MAX_VALUE (type
);
6692 t
= TYPE_MIN_VALUE (type
);
6693 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6694 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6699 case FIXED_POINT_TYPE
:
6701 unsigned prec
= TYPE_PRECISION (type
);
6702 hstate
.add_object (prec
);
6707 hstate
.add_poly_int (TYPE_VECTOR_SUBPARTS (type
));
6714 return hstate
.end ();
6717 /* These are the Hashtable callback functions. */
6719 /* Returns true iff the types are equivalent. */
6722 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6724 /* First test the things that are the same for all types. */
6725 if (a
->hash
!= b
->hash
6726 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6727 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6728 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6729 TYPE_ATTRIBUTES (b
->type
))
6730 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6731 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6734 /* Be careful about comparing arrays before and after the element type
6735 has been completed; don't compare TYPE_ALIGN unless both types are
6737 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6738 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6739 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6742 switch (TREE_CODE (a
->type
))
6747 case REFERENCE_TYPE
:
6752 return known_eq (TYPE_VECTOR_SUBPARTS (a
->type
),
6753 TYPE_VECTOR_SUBPARTS (b
->type
));
6756 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6757 && !(TYPE_VALUES (a
->type
)
6758 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6759 && TYPE_VALUES (b
->type
)
6760 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6761 && type_list_equal (TYPE_VALUES (a
->type
),
6762 TYPE_VALUES (b
->type
))))
6770 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6772 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6773 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6774 TYPE_MAX_VALUE (b
->type
)))
6775 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6776 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6777 TYPE_MIN_VALUE (b
->type
))));
6779 case FIXED_POINT_TYPE
:
6780 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6783 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6786 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6787 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6788 || (TYPE_ARG_TYPES (a
->type
)
6789 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6790 && TYPE_ARG_TYPES (b
->type
)
6791 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6792 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6793 TYPE_ARG_TYPES (b
->type
)))))
6797 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6798 where the flag should be inherited from the element type
6799 and can change after ARRAY_TYPEs are created; on non-aggregates
6800 compare it and hash it, scalars will never have that flag set
6801 and we need to differentiate between arrays created by different
6802 front-ends or middle-end created arrays. */
6803 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6804 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6805 || (TYPE_TYPELESS_STORAGE (a
->type
)
6806 == TYPE_TYPELESS_STORAGE (b
->type
))));
6810 case QUAL_UNION_TYPE
:
6811 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6812 || (TYPE_FIELDS (a
->type
)
6813 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6814 && TYPE_FIELDS (b
->type
)
6815 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6816 && type_list_equal (TYPE_FIELDS (a
->type
),
6817 TYPE_FIELDS (b
->type
))));
6820 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6821 || (TYPE_ARG_TYPES (a
->type
)
6822 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6823 && TYPE_ARG_TYPES (b
->type
)
6824 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6825 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6826 TYPE_ARG_TYPES (b
->type
))))
6834 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6835 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6840 /* Given TYPE, and HASHCODE its hash code, return the canonical
6841 object for an identical type if one already exists.
6842 Otherwise, return TYPE, and record it as the canonical object.
6844 To use this function, first create a type of the sort you want.
6845 Then compute its hash code from the fields of the type that
6846 make it different from other similar types.
6847 Then call this function and use the value. */
6850 type_hash_canon (unsigned int hashcode
, tree type
)
6855 /* The hash table only contains main variants, so ensure that's what we're
6857 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6859 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6860 must call that routine before comparing TYPE_ALIGNs. */
6866 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6869 tree t1
= ((type_hash
*) *loc
)->type
;
6870 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
6872 if (TYPE_UID (type
) + 1 == next_type_uid
)
6874 /* Free also min/max values and the cache for integer
6875 types. This can't be done in free_node, as LTO frees
6876 those on its own. */
6877 if (TREE_CODE (type
) == INTEGER_TYPE
)
6879 if (TYPE_MIN_VALUE (type
)
6880 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6882 /* Zero is always in TYPE_CACHED_VALUES. */
6883 if (! TYPE_UNSIGNED (type
))
6884 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6885 ggc_free (TYPE_MIN_VALUE (type
));
6887 if (TYPE_MAX_VALUE (type
)
6888 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6890 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6891 ggc_free (TYPE_MAX_VALUE (type
));
6893 if (TYPE_CACHED_VALUES_P (type
))
6894 ggc_free (TYPE_CACHED_VALUES (type
));
6901 struct type_hash
*h
;
6903 h
= ggc_alloc
<type_hash
> ();
6913 print_type_hash_statistics (void)
6915 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6916 (long) type_hash_table
->size (),
6917 (long) type_hash_table
->elements (),
6918 type_hash_table
->collisions ());
6921 /* Given two lists of types
6922 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6923 return 1 if the lists contain the same types in the same order.
6924 Also, the TREE_PURPOSEs must match. */
6927 type_list_equal (const_tree l1
, const_tree l2
)
6931 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6932 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6933 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6934 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6935 && (TREE_TYPE (TREE_PURPOSE (t1
))
6936 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6942 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6943 given by TYPE. If the argument list accepts variable arguments,
6944 then this function counts only the ordinary arguments. */
6947 type_num_arguments (const_tree type
)
6952 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6953 /* If the function does not take a variable number of arguments,
6954 the last element in the list will have type `void'. */
6955 if (VOID_TYPE_P (TREE_VALUE (t
)))
6963 /* Nonzero if integer constants T1 and T2
6964 represent the same constant value. */
6967 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6972 if (t1
== 0 || t2
== 0)
6975 if (TREE_CODE (t1
) == INTEGER_CST
6976 && TREE_CODE (t2
) == INTEGER_CST
6977 && wi::to_widest (t1
) == wi::to_widest (t2
))
6983 /* Return true if T is an INTEGER_CST whose numerical value (extended
6984 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6987 tree_fits_shwi_p (const_tree t
)
6989 return (t
!= NULL_TREE
6990 && TREE_CODE (t
) == INTEGER_CST
6991 && wi::fits_shwi_p (wi::to_widest (t
)));
6994 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
6995 value (extended according to TYPE_UNSIGNED) fits in a poly_int64. */
6998 tree_fits_poly_int64_p (const_tree t
)
7002 if (POLY_INT_CST_P (t
))
7004 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7005 if (!wi::fits_shwi_p (wi::to_wide (POLY_INT_CST_COEFF (t
, i
))))
7009 return (TREE_CODE (t
) == INTEGER_CST
7010 && wi::fits_shwi_p (wi::to_widest (t
)));
7013 /* Return true if T is an INTEGER_CST whose numerical value (extended
7014 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7017 tree_fits_uhwi_p (const_tree t
)
7019 return (t
!= NULL_TREE
7020 && TREE_CODE (t
) == INTEGER_CST
7021 && wi::fits_uhwi_p (wi::to_widest (t
)));
7024 /* Return true if T is an INTEGER_CST or POLY_INT_CST whose numerical
7025 value (extended according to TYPE_UNSIGNED) fits in a poly_uint64. */
7028 tree_fits_poly_uint64_p (const_tree t
)
7032 if (POLY_INT_CST_P (t
))
7034 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; i
++)
7035 if (!wi::fits_uhwi_p (wi::to_widest (POLY_INT_CST_COEFF (t
, i
))))
7039 return (TREE_CODE (t
) == INTEGER_CST
7040 && wi::fits_uhwi_p (wi::to_widest (t
)));
7043 /* T is an INTEGER_CST whose numerical value (extended according to
7044 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7048 tree_to_shwi (const_tree t
)
7050 gcc_assert (tree_fits_shwi_p (t
));
7051 return TREE_INT_CST_LOW (t
);
7054 /* T is an INTEGER_CST whose numerical value (extended according to
7055 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7058 unsigned HOST_WIDE_INT
7059 tree_to_uhwi (const_tree t
)
7061 gcc_assert (tree_fits_uhwi_p (t
));
7062 return TREE_INT_CST_LOW (t
);
7065 /* Return the most significant (sign) bit of T. */
7068 tree_int_cst_sign_bit (const_tree t
)
7070 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7072 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
7075 /* Return an indication of the sign of the integer constant T.
7076 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7077 Note that -1 will never be returned if T's type is unsigned. */
7080 tree_int_cst_sgn (const_tree t
)
7082 if (wi::to_wide (t
) == 0)
7084 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7086 else if (wi::neg_p (wi::to_wide (t
)))
7092 /* Return the minimum number of bits needed to represent VALUE in a
7093 signed or unsigned type, UNSIGNEDP says which. */
7096 tree_int_cst_min_precision (tree value
, signop sgn
)
7098 /* If the value is negative, compute its negative minus 1. The latter
7099 adjustment is because the absolute value of the largest negative value
7100 is one larger than the largest positive value. This is equivalent to
7101 a bit-wise negation, so use that operation instead. */
7103 if (tree_int_cst_sgn (value
) < 0)
7104 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7106 /* Return the number of bits needed, taking into account the fact
7107 that we need one more bit for a signed than unsigned type.
7108 If value is 0 or -1, the minimum precision is 1 no matter
7109 whether unsignedp is true or false. */
7111 if (integer_zerop (value
))
7114 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7117 /* Return truthvalue of whether T1 is the same tree structure as T2.
7118 Return 1 if they are the same.
7119 Return 0 if they are understandably different.
7120 Return -1 if either contains tree structure not understood by
7124 simple_cst_equal (const_tree t1
, const_tree t2
)
7126 enum tree_code code1
, code2
;
7132 if (t1
== 0 || t2
== 0)
7135 code1
= TREE_CODE (t1
);
7136 code2
= TREE_CODE (t2
);
7138 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7140 if (CONVERT_EXPR_CODE_P (code2
)
7141 || code2
== NON_LVALUE_EXPR
)
7142 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7144 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7147 else if (CONVERT_EXPR_CODE_P (code2
)
7148 || code2
== NON_LVALUE_EXPR
)
7149 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7157 return wi::to_widest (t1
) == wi::to_widest (t2
);
7160 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7163 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7166 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7167 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7168 TREE_STRING_LENGTH (t1
)));
7172 unsigned HOST_WIDE_INT idx
;
7173 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7174 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7176 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7179 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7180 /* ??? Should we handle also fields here? */
7181 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7187 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7190 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7193 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7196 const_tree arg1
, arg2
;
7197 const_call_expr_arg_iterator iter1
, iter2
;
7198 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7199 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7201 arg1
= next_const_call_expr_arg (&iter1
),
7202 arg2
= next_const_call_expr_arg (&iter2
))
7204 cmp
= simple_cst_equal (arg1
, arg2
);
7208 return arg1
== arg2
;
7212 /* Special case: if either target is an unallocated VAR_DECL,
7213 it means that it's going to be unified with whatever the
7214 TARGET_EXPR is really supposed to initialize, so treat it
7215 as being equivalent to anything. */
7216 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7217 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7218 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7219 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7220 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7221 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7224 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7229 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7231 case WITH_CLEANUP_EXPR
:
7232 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7236 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7239 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7240 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7251 if (POLY_INT_CST_P (t1
))
7252 /* A false return means maybe_ne rather than known_ne. */
7253 return known_eq (poly_widest_int::from (poly_int_cst_value (t1
),
7254 TYPE_SIGN (TREE_TYPE (t1
))),
7255 poly_widest_int::from (poly_int_cst_value (t2
),
7256 TYPE_SIGN (TREE_TYPE (t2
))));
7260 /* This general rule works for most tree codes. All exceptions should be
7261 handled above. If this is a language-specific tree code, we can't
7262 trust what might be in the operand, so say we don't know
7264 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7267 switch (TREE_CODE_CLASS (code1
))
7271 case tcc_comparison
:
7272 case tcc_expression
:
7276 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7278 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7290 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7291 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7292 than U, respectively. */
7295 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7297 if (tree_int_cst_sgn (t
) < 0)
7299 else if (!tree_fits_uhwi_p (t
))
7301 else if (TREE_INT_CST_LOW (t
) == u
)
7303 else if (TREE_INT_CST_LOW (t
) < u
)
7309 /* Return true if SIZE represents a constant size that is in bounds of
7310 what the middle-end and the backend accepts (covering not more than
7311 half of the address-space). */
7314 valid_constant_size_p (const_tree size
)
7316 if (POLY_INT_CST_P (size
))
7318 if (TREE_OVERFLOW (size
))
7320 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7321 if (!valid_constant_size_p (POLY_INT_CST_COEFF (size
, i
)))
7325 if (! tree_fits_uhwi_p (size
)
7326 || TREE_OVERFLOW (size
)
7327 || tree_int_cst_sign_bit (size
) != 0)
7332 /* Return the precision of the type, or for a complex or vector type the
7333 precision of the type of its elements. */
7336 element_precision (const_tree type
)
7339 type
= TREE_TYPE (type
);
7340 enum tree_code code
= TREE_CODE (type
);
7341 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7342 type
= TREE_TYPE (type
);
7344 return TYPE_PRECISION (type
);
7347 /* Return true if CODE represents an associative tree code. Otherwise
7350 associative_tree_code (enum tree_code code
)
7369 /* Return true if CODE represents a commutative tree code. Otherwise
7372 commutative_tree_code (enum tree_code code
)
7378 case MULT_HIGHPART_EXPR
:
7386 case UNORDERED_EXPR
:
7390 case TRUTH_AND_EXPR
:
7391 case TRUTH_XOR_EXPR
:
7393 case WIDEN_MULT_EXPR
:
7394 case VEC_WIDEN_MULT_HI_EXPR
:
7395 case VEC_WIDEN_MULT_LO_EXPR
:
7396 case VEC_WIDEN_MULT_EVEN_EXPR
:
7397 case VEC_WIDEN_MULT_ODD_EXPR
:
7406 /* Return true if CODE represents a ternary tree code for which the
7407 first two operands are commutative. Otherwise return false. */
7409 commutative_ternary_tree_code (enum tree_code code
)
7413 case WIDEN_MULT_PLUS_EXPR
:
7414 case WIDEN_MULT_MINUS_EXPR
:
7424 /* Returns true if CODE can overflow. */
7427 operation_can_overflow (enum tree_code code
)
7435 /* Can overflow in various ways. */
7437 case TRUNC_DIV_EXPR
:
7438 case EXACT_DIV_EXPR
:
7439 case FLOOR_DIV_EXPR
:
7441 /* For INT_MIN / -1. */
7448 /* These operators cannot overflow. */
7453 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7454 ftrapv doesn't generate trapping insns for CODE. */
7457 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7459 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7461 /* We don't generate instructions that trap on overflow for complex or vector
7463 if (!INTEGRAL_TYPE_P (type
))
7466 if (!TYPE_OVERFLOW_TRAPS (type
))
7476 /* These operators can overflow, and -ftrapv generates trapping code for
7479 case TRUNC_DIV_EXPR
:
7480 case EXACT_DIV_EXPR
:
7481 case FLOOR_DIV_EXPR
:
7484 /* These operators can overflow, but -ftrapv does not generate trapping
7488 /* These operators cannot overflow. */
7496 /* Generate a hash value for an expression. This can be used iteratively
7497 by passing a previous result as the HSTATE argument.
7499 This function is intended to produce the same hash for expressions which
7500 would compare equal using operand_equal_p. */
7502 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7505 enum tree_code code
;
7506 enum tree_code_class tclass
;
7508 if (t
== NULL_TREE
|| t
== error_mark_node
)
7510 hstate
.merge_hash (0);
7514 if (!(flags
& OEP_ADDRESS_OF
))
7517 code
= TREE_CODE (t
);
7521 /* Alas, constants aren't shared, so we can't rely on pointer
7524 hstate
.merge_hash (0);
7527 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7528 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7529 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7534 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7537 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7538 hstate
.merge_hash (val2
);
7543 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7544 hstate
.merge_hash (val2
);
7548 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7549 TREE_STRING_LENGTH (t
));
7552 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7553 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7557 hstate
.add_int (VECTOR_CST_NPATTERNS (t
));
7558 hstate
.add_int (VECTOR_CST_NELTS_PER_PATTERN (t
));
7559 unsigned int count
= vector_cst_encoded_nelts (t
);
7560 for (unsigned int i
= 0; i
< count
; ++i
)
7561 inchash::add_expr (VECTOR_CST_ENCODED_ELT (t
, i
), hstate
, flags
);
7565 /* We can just compare by pointer. */
7566 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7568 case PLACEHOLDER_EXPR
:
7569 /* The node itself doesn't matter. */
7576 /* A list of expressions, for a CALL_EXPR or as the elements of a
7578 for (; t
; t
= TREE_CHAIN (t
))
7579 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7583 unsigned HOST_WIDE_INT idx
;
7585 flags
&= ~OEP_ADDRESS_OF
;
7586 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7588 inchash::add_expr (field
, hstate
, flags
);
7589 inchash::add_expr (value
, hstate
, flags
);
7593 case STATEMENT_LIST
:
7595 tree_stmt_iterator i
;
7596 for (i
= tsi_start (CONST_CAST_TREE (t
));
7597 !tsi_end_p (i
); tsi_next (&i
))
7598 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7602 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7603 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7605 case IDENTIFIER_NODE
:
7606 hstate
.add_object (IDENTIFIER_HASH_VALUE (t
));
7609 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7610 Otherwise nodes that compare equal according to operand_equal_p might
7611 get different hash codes. However, don't do this for machine specific
7612 or front end builtins, since the function code is overloaded in those
7614 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7615 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7617 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7618 code
= TREE_CODE (t
);
7622 if (POLY_INT_CST_P (t
))
7624 for (unsigned int i
= 0; i
< NUM_POLY_INT_COEFFS
; ++i
)
7625 hstate
.add_wide_int (wi::to_wide (POLY_INT_CST_COEFF (t
, i
)));
7628 tclass
= TREE_CODE_CLASS (code
);
7630 if (tclass
== tcc_declaration
)
7632 /* DECL's have a unique ID */
7633 hstate
.add_hwi (DECL_UID (t
));
7635 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7637 /* For comparisons that can be swapped, use the lower
7639 enum tree_code ccode
= swap_tree_comparison (code
);
7642 hstate
.add_object (ccode
);
7643 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7644 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7646 else if (CONVERT_EXPR_CODE_P (code
))
7648 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7650 enum tree_code ccode
= NOP_EXPR
;
7651 hstate
.add_object (ccode
);
7653 /* Don't hash the type, that can lead to having nodes which
7654 compare equal according to operand_equal_p, but which
7655 have different hash codes. Make sure to include signedness
7656 in the hash computation. */
7657 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7658 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7660 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7661 else if (code
== MEM_REF
7662 && (flags
& OEP_ADDRESS_OF
) != 0
7663 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7664 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7665 && integer_zerop (TREE_OPERAND (t
, 1)))
7666 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7668 /* Don't ICE on FE specific trees, or their arguments etc.
7669 during operand_equal_p hash verification. */
7670 else if (!IS_EXPR_CODE_CLASS (tclass
))
7671 gcc_assert (flags
& OEP_HASH_CHECK
);
7674 unsigned int sflags
= flags
;
7676 hstate
.add_object (code
);
7681 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7682 flags
|= OEP_ADDRESS_OF
;
7688 case TARGET_MEM_REF
:
7689 flags
&= ~OEP_ADDRESS_OF
;
7694 case ARRAY_RANGE_REF
:
7697 sflags
&= ~OEP_ADDRESS_OF
;
7701 flags
&= ~OEP_ADDRESS_OF
;
7704 case WIDEN_MULT_PLUS_EXPR
:
7705 case WIDEN_MULT_MINUS_EXPR
:
7707 /* The multiplication operands are commutative. */
7708 inchash::hash one
, two
;
7709 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7710 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7711 hstate
.add_commutative (one
, two
);
7712 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7717 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7718 hstate
.add_int (CALL_EXPR_IFN (t
));
7722 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7723 Usually different TARGET_EXPRs just should use
7724 different temporaries in their slots. */
7725 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7732 /* Don't hash the type, that can lead to having nodes which
7733 compare equal according to operand_equal_p, but which
7734 have different hash codes. */
7735 if (code
== NON_LVALUE_EXPR
)
7737 /* Make sure to include signness in the hash computation. */
7738 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7739 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7742 else if (commutative_tree_code (code
))
7744 /* It's a commutative expression. We want to hash it the same
7745 however it appears. We do this by first hashing both operands
7746 and then rehashing based on the order of their independent
7748 inchash::hash one
, two
;
7749 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7750 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7751 hstate
.add_commutative (one
, two
);
7754 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7755 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7756 i
== 0 ? flags
: sflags
);
7764 /* Constructors for pointer, array and function types.
7765 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7766 constructed by language-dependent code, not here.) */
7768 /* Construct, lay out and return the type of pointers to TO_TYPE with
7769 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7770 reference all of memory. If such a type has already been
7771 constructed, reuse it. */
7774 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7778 bool could_alias
= can_alias_all
;
7780 if (to_type
== error_mark_node
)
7781 return error_mark_node
;
7783 /* If the pointed-to type has the may_alias attribute set, force
7784 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7785 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7786 can_alias_all
= true;
7788 /* In some cases, languages will have things that aren't a POINTER_TYPE
7789 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7790 In that case, return that type without regard to the rest of our
7793 ??? This is a kludge, but consistent with the way this function has
7794 always operated and there doesn't seem to be a good way to avoid this
7796 if (TYPE_POINTER_TO (to_type
) != 0
7797 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7798 return TYPE_POINTER_TO (to_type
);
7800 /* First, if we already have a type for pointers to TO_TYPE and it's
7801 the proper mode, use it. */
7802 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7803 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7806 t
= make_node (POINTER_TYPE
);
7808 TREE_TYPE (t
) = to_type
;
7809 SET_TYPE_MODE (t
, mode
);
7810 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7811 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7812 TYPE_POINTER_TO (to_type
) = t
;
7814 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7815 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7816 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7817 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7819 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7822 /* Lay out the type. This function has many callers that are concerned
7823 with expression-construction, and this simplifies them all. */
7829 /* By default build pointers in ptr_mode. */
7832 build_pointer_type (tree to_type
)
7834 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7835 : TYPE_ADDR_SPACE (to_type
);
7836 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7837 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7840 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7843 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7847 bool could_alias
= can_alias_all
;
7849 if (to_type
== error_mark_node
)
7850 return error_mark_node
;
7852 /* If the pointed-to type has the may_alias attribute set, force
7853 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7854 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7855 can_alias_all
= true;
7857 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7858 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7859 In that case, return that type without regard to the rest of our
7862 ??? This is a kludge, but consistent with the way this function has
7863 always operated and there doesn't seem to be a good way to avoid this
7865 if (TYPE_REFERENCE_TO (to_type
) != 0
7866 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7867 return TYPE_REFERENCE_TO (to_type
);
7869 /* First, if we already have a type for pointers to TO_TYPE and it's
7870 the proper mode, use it. */
7871 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7872 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7875 t
= make_node (REFERENCE_TYPE
);
7877 TREE_TYPE (t
) = to_type
;
7878 SET_TYPE_MODE (t
, mode
);
7879 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7880 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7881 TYPE_REFERENCE_TO (to_type
) = t
;
7883 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7884 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7885 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7886 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7888 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7897 /* Build the node for the type of references-to-TO_TYPE by default
7901 build_reference_type (tree to_type
)
7903 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7904 : TYPE_ADDR_SPACE (to_type
);
7905 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7906 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7909 #define MAX_INT_CACHED_PREC \
7910 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7911 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7913 /* Builds a signed or unsigned integer type of precision PRECISION.
7914 Used for C bitfields whose precision does not match that of
7915 built-in target types. */
7917 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7923 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7925 if (precision
<= MAX_INT_CACHED_PREC
)
7927 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7932 itype
= make_node (INTEGER_TYPE
);
7933 TYPE_PRECISION (itype
) = precision
;
7936 fixup_unsigned_type (itype
);
7938 fixup_signed_type (itype
);
7942 inchash::hash hstate
;
7943 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7944 ret
= type_hash_canon (hstate
.end (), itype
);
7945 if (precision
<= MAX_INT_CACHED_PREC
)
7946 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7951 #define MAX_BOOL_CACHED_PREC \
7952 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7953 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7955 /* Builds a boolean type of precision PRECISION.
7956 Used for boolean vectors to choose proper vector element size. */
7958 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7962 if (precision
<= MAX_BOOL_CACHED_PREC
)
7964 type
= nonstandard_boolean_type_cache
[precision
];
7969 type
= make_node (BOOLEAN_TYPE
);
7970 TYPE_PRECISION (type
) = precision
;
7971 fixup_signed_type (type
);
7973 if (precision
<= MAX_INT_CACHED_PREC
)
7974 nonstandard_boolean_type_cache
[precision
] = type
;
7979 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7980 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7981 is true, reuse such a type that has already been constructed. */
7984 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7986 tree itype
= make_node (INTEGER_TYPE
);
7988 TREE_TYPE (itype
) = type
;
7990 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7991 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7993 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7994 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7995 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7996 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7997 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7998 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7999 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
8004 if ((TYPE_MIN_VALUE (itype
)
8005 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8006 || (TYPE_MAX_VALUE (itype
)
8007 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8009 /* Since we cannot reliably merge this type, we need to compare it using
8010 structural equality checks. */
8011 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8015 hashval_t hash
= type_hash_canon_hash (itype
);
8016 itype
= type_hash_canon (hash
, itype
);
8021 /* Wrapper around build_range_type_1 with SHARED set to true. */
8024 build_range_type (tree type
, tree lowval
, tree highval
)
8026 return build_range_type_1 (type
, lowval
, highval
, true);
8029 /* Wrapper around build_range_type_1 with SHARED set to false. */
8032 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8034 return build_range_type_1 (type
, lowval
, highval
, false);
8037 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8038 MAXVAL should be the maximum value in the domain
8039 (one less than the length of the array).
8041 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8042 We don't enforce this limit, that is up to caller (e.g. language front end).
8043 The limit exists because the result is a signed type and we don't handle
8044 sizes that use more than one HOST_WIDE_INT. */
8047 build_index_type (tree maxval
)
8049 return build_range_type (sizetype
, size_zero_node
, maxval
);
8052 /* Return true if the debug information for TYPE, a subtype, should be emitted
8053 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8054 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8055 debug info and doesn't reflect the source code. */
8058 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8060 tree base_type
= TREE_TYPE (type
), low
, high
;
8062 /* Subrange types have a base type which is an integral type. */
8063 if (!INTEGRAL_TYPE_P (base_type
))
8066 /* Get the real bounds of the subtype. */
8067 if (lang_hooks
.types
.get_subrange_bounds
)
8068 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8071 low
= TYPE_MIN_VALUE (type
);
8072 high
= TYPE_MAX_VALUE (type
);
8075 /* If the type and its base type have the same representation and the same
8076 name, then the type is not a subrange but a copy of the base type. */
8077 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8078 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8079 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8080 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8081 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8082 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8092 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8093 and number of elements specified by the range of values of INDEX_TYPE.
8094 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
8095 If SHARED is true, reuse such a type that has already been constructed. */
8098 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
8103 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8105 error ("arrays of functions are not meaningful");
8106 elt_type
= integer_type_node
;
8109 t
= make_node (ARRAY_TYPE
);
8110 TREE_TYPE (t
) = elt_type
;
8111 TYPE_DOMAIN (t
) = index_type
;
8112 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8113 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
8116 /* If the element type is incomplete at this point we get marked for
8117 structural equality. Do not record these types in the canonical
8119 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8124 hashval_t hash
= type_hash_canon_hash (t
);
8125 t
= type_hash_canon (hash
, t
);
8128 if (TYPE_CANONICAL (t
) == t
)
8130 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8131 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8133 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8134 else if (TYPE_CANONICAL (elt_type
) != elt_type
8135 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8137 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8139 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8140 typeless_storage
, shared
);
8146 /* Wrapper around build_array_type_1 with SHARED set to true. */
8149 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
8151 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
8154 /* Wrapper around build_array_type_1 with SHARED set to false. */
8157 build_nonshared_array_type (tree elt_type
, tree index_type
)
8159 return build_array_type_1 (elt_type
, index_type
, false, false);
8162 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8166 build_array_type_nelts (tree elt_type
, poly_uint64 nelts
)
8168 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8171 /* Recursively examines the array elements of TYPE, until a non-array
8172 element type is found. */
8175 strip_array_types (tree type
)
8177 while (TREE_CODE (type
) == ARRAY_TYPE
)
8178 type
= TREE_TYPE (type
);
8183 /* Computes the canonical argument types from the argument type list
8186 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8187 on entry to this function, or if any of the ARGTYPES are
8190 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8191 true on entry to this function, or if any of the ARGTYPES are
8194 Returns a canonical argument list, which may be ARGTYPES when the
8195 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8196 true) or would not differ from ARGTYPES. */
8199 maybe_canonicalize_argtypes (tree argtypes
,
8200 bool *any_structural_p
,
8201 bool *any_noncanonical_p
)
8204 bool any_noncanonical_argtypes_p
= false;
8206 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8208 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8209 /* Fail gracefully by stating that the type is structural. */
8210 *any_structural_p
= true;
8211 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8212 *any_structural_p
= true;
8213 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8214 || TREE_PURPOSE (arg
))
8215 /* If the argument has a default argument, we consider it
8216 non-canonical even though the type itself is canonical.
8217 That way, different variants of function and method types
8218 with default arguments will all point to the variant with
8219 no defaults as their canonical type. */
8220 any_noncanonical_argtypes_p
= true;
8223 if (*any_structural_p
)
8226 if (any_noncanonical_argtypes_p
)
8228 /* Build the canonical list of argument types. */
8229 tree canon_argtypes
= NULL_TREE
;
8230 bool is_void
= false;
8232 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8234 if (arg
== void_list_node
)
8237 canon_argtypes
= tree_cons (NULL_TREE
,
8238 TYPE_CANONICAL (TREE_VALUE (arg
)),
8242 canon_argtypes
= nreverse (canon_argtypes
);
8244 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8246 /* There is a non-canonical type. */
8247 *any_noncanonical_p
= true;
8248 return canon_argtypes
;
8251 /* The canonical argument types are the same as ARGTYPES. */
8255 /* Construct, lay out and return
8256 the type of functions returning type VALUE_TYPE
8257 given arguments of types ARG_TYPES.
8258 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8259 are data type nodes for the arguments of the function.
8260 If such a type has already been constructed, reuse it. */
8263 build_function_type (tree value_type
, tree arg_types
)
8266 inchash::hash hstate
;
8267 bool any_structural_p
, any_noncanonical_p
;
8268 tree canon_argtypes
;
8270 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8272 error ("function return type cannot be function");
8273 value_type
= integer_type_node
;
8276 /* Make a node of the sort we want. */
8277 t
= make_node (FUNCTION_TYPE
);
8278 TREE_TYPE (t
) = value_type
;
8279 TYPE_ARG_TYPES (t
) = arg_types
;
8281 /* If we already have such a type, use the old one. */
8282 hashval_t hash
= type_hash_canon_hash (t
);
8283 t
= type_hash_canon (hash
, t
);
8285 /* Set up the canonical type. */
8286 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8287 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8288 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8290 &any_noncanonical_p
);
8291 if (any_structural_p
)
8292 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8293 else if (any_noncanonical_p
)
8294 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8297 if (!COMPLETE_TYPE_P (t
))
8302 /* Build a function type. The RETURN_TYPE is the type returned by the
8303 function. If VAARGS is set, no void_type_node is appended to the
8304 list. ARGP must be always be terminated be a NULL_TREE. */
8307 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8311 t
= va_arg (argp
, tree
);
8312 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8313 args
= tree_cons (NULL_TREE
, t
, args
);
8318 if (args
!= NULL_TREE
)
8319 args
= nreverse (args
);
8320 gcc_assert (last
!= void_list_node
);
8322 else if (args
== NULL_TREE
)
8323 args
= void_list_node
;
8327 args
= nreverse (args
);
8328 TREE_CHAIN (last
) = void_list_node
;
8330 args
= build_function_type (return_type
, args
);
8335 /* Build a function type. The RETURN_TYPE is the type returned by the
8336 function. If additional arguments are provided, they are
8337 additional argument types. The list of argument types must always
8338 be terminated by NULL_TREE. */
8341 build_function_type_list (tree return_type
, ...)
8346 va_start (p
, return_type
);
8347 args
= build_function_type_list_1 (false, return_type
, p
);
8352 /* Build a variable argument function type. The RETURN_TYPE is the
8353 type returned by the function. If additional arguments are provided,
8354 they are additional argument types. The list of argument types must
8355 always be terminated by NULL_TREE. */
8358 build_varargs_function_type_list (tree return_type
, ...)
8363 va_start (p
, return_type
);
8364 args
= build_function_type_list_1 (true, return_type
, p
);
8370 /* Build a function type. RETURN_TYPE is the type returned by the
8371 function; VAARGS indicates whether the function takes varargs. The
8372 function takes N named arguments, the types of which are provided in
8376 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8380 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8382 for (i
= n
- 1; i
>= 0; i
--)
8383 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8385 return build_function_type (return_type
, t
);
8388 /* Build a function type. RETURN_TYPE is the type returned by the
8389 function. The function takes N named arguments, the types of which
8390 are provided in ARG_TYPES. */
8393 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8395 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8398 /* Build a variable argument function type. RETURN_TYPE is the type
8399 returned by the function. The function takes N named arguments, the
8400 types of which are provided in ARG_TYPES. */
8403 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8405 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8408 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8409 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8410 for the method. An implicit additional parameter (of type
8411 pointer-to-BASETYPE) is added to the ARGTYPES. */
8414 build_method_type_directly (tree basetype
,
8420 bool any_structural_p
, any_noncanonical_p
;
8421 tree canon_argtypes
;
8423 /* Make a node of the sort we want. */
8424 t
= make_node (METHOD_TYPE
);
8426 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8427 TREE_TYPE (t
) = rettype
;
8428 ptype
= build_pointer_type (basetype
);
8430 /* The actual arglist for this function includes a "hidden" argument
8431 which is "this". Put it into the list of argument types. */
8432 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8433 TYPE_ARG_TYPES (t
) = argtypes
;
8435 /* If we already have such a type, use the old one. */
8436 hashval_t hash
= type_hash_canon_hash (t
);
8437 t
= type_hash_canon (hash
, t
);
8439 /* Set up the canonical type. */
8441 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8442 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8444 = (TYPE_CANONICAL (basetype
) != basetype
8445 || TYPE_CANONICAL (rettype
) != rettype
);
8446 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8448 &any_noncanonical_p
);
8449 if (any_structural_p
)
8450 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8451 else if (any_noncanonical_p
)
8453 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8454 TYPE_CANONICAL (rettype
),
8456 if (!COMPLETE_TYPE_P (t
))
8462 /* Construct, lay out and return the type of methods belonging to class
8463 BASETYPE and whose arguments and values are described by TYPE.
8464 If that type exists already, reuse it.
8465 TYPE must be a FUNCTION_TYPE node. */
8468 build_method_type (tree basetype
, tree type
)
8470 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8472 return build_method_type_directly (basetype
,
8474 TYPE_ARG_TYPES (type
));
8477 /* Construct, lay out and return the type of offsets to a value
8478 of type TYPE, within an object of type BASETYPE.
8479 If a suitable offset type exists already, reuse it. */
8482 build_offset_type (tree basetype
, tree type
)
8486 /* Make a node of the sort we want. */
8487 t
= make_node (OFFSET_TYPE
);
8489 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8490 TREE_TYPE (t
) = type
;
8492 /* If we already have such a type, use the old one. */
8493 hashval_t hash
= type_hash_canon_hash (t
);
8494 t
= type_hash_canon (hash
, t
);
8496 if (!COMPLETE_TYPE_P (t
))
8499 if (TYPE_CANONICAL (t
) == t
)
8501 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8502 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8503 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8504 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8505 || TYPE_CANONICAL (type
) != type
)
8507 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8508 TYPE_CANONICAL (type
));
8514 /* Create a complex type whose components are COMPONENT_TYPE.
8516 If NAMED is true, the type is given a TYPE_NAME. We do not always
8517 do so because this creates a DECL node and thus make the DECL_UIDs
8518 dependent on the type canonicalization hashtable, which is GC-ed,
8519 so the DECL_UIDs would not be stable wrt garbage collection. */
8522 build_complex_type (tree component_type
, bool named
)
8524 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8525 || SCALAR_FLOAT_TYPE_P (component_type
)
8526 || FIXED_POINT_TYPE_P (component_type
));
8528 /* Make a node of the sort we want. */
8529 tree probe
= make_node (COMPLEX_TYPE
);
8531 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8533 /* If we already have such a type, use the old one. */
8534 hashval_t hash
= type_hash_canon_hash (probe
);
8535 tree t
= type_hash_canon (hash
, probe
);
8539 /* We created a new type. The hash insertion will have laid
8540 out the type. We need to check the canonicalization and
8541 maybe set the name. */
8542 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8544 && TYPE_CANONICAL (t
) == t
);
8546 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8547 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8548 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8550 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8552 /* We need to create a name, since complex is a fundamental type. */
8555 const char *name
= NULL
;
8557 if (TREE_TYPE (t
) == char_type_node
)
8558 name
= "complex char";
8559 else if (TREE_TYPE (t
) == signed_char_type_node
)
8560 name
= "complex signed char";
8561 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8562 name
= "complex unsigned char";
8563 else if (TREE_TYPE (t
) == short_integer_type_node
)
8564 name
= "complex short int";
8565 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8566 name
= "complex short unsigned int";
8567 else if (TREE_TYPE (t
) == integer_type_node
)
8568 name
= "complex int";
8569 else if (TREE_TYPE (t
) == unsigned_type_node
)
8570 name
= "complex unsigned int";
8571 else if (TREE_TYPE (t
) == long_integer_type_node
)
8572 name
= "complex long int";
8573 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8574 name
= "complex long unsigned int";
8575 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8576 name
= "complex long long int";
8577 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8578 name
= "complex long long unsigned int";
8581 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8582 get_identifier (name
), t
);
8586 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8589 /* If TYPE is a real or complex floating-point type and the target
8590 does not directly support arithmetic on TYPE then return the wider
8591 type to be used for arithmetic on TYPE. Otherwise, return
8595 excess_precision_type (tree type
)
8597 /* The target can give two different responses to the question of
8598 which excess precision mode it would like depending on whether we
8599 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8601 enum excess_precision_type requested_type
8602 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8603 ? EXCESS_PRECISION_TYPE_FAST
8604 : EXCESS_PRECISION_TYPE_STANDARD
);
8606 enum flt_eval_method target_flt_eval_method
8607 = targetm
.c
.excess_precision (requested_type
);
8609 /* The target should not ask for unpredictable float evaluation (though
8610 it might advertise that implicitly the evaluation is unpredictable,
8611 but we don't care about that here, it will have been reported
8612 elsewhere). If it does ask for unpredictable evaluation, we have
8613 nothing to do here. */
8614 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8616 /* Nothing to do. The target has asked for all types we know about
8617 to be computed with their native precision and range. */
8618 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8621 /* The target will promote this type in a target-dependent way, so excess
8622 precision ought to leave it alone. */
8623 if (targetm
.promoted_type (type
) != NULL_TREE
)
8626 machine_mode float16_type_mode
= (float16_type_node
8627 ? TYPE_MODE (float16_type_node
)
8629 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8630 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8632 switch (TREE_CODE (type
))
8636 machine_mode type_mode
= TYPE_MODE (type
);
8637 switch (target_flt_eval_method
)
8639 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8640 if (type_mode
== float16_type_mode
)
8641 return float_type_node
;
8643 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8644 if (type_mode
== float16_type_mode
8645 || type_mode
== float_type_mode
)
8646 return double_type_node
;
8648 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8649 if (type_mode
== float16_type_mode
8650 || type_mode
== float_type_mode
8651 || type_mode
== double_type_mode
)
8652 return long_double_type_node
;
8661 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8663 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8664 switch (target_flt_eval_method
)
8666 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8667 if (type_mode
== float16_type_mode
)
8668 return complex_float_type_node
;
8670 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8671 if (type_mode
== float16_type_mode
8672 || type_mode
== float_type_mode
)
8673 return complex_double_type_node
;
8675 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8676 if (type_mode
== float16_type_mode
8677 || type_mode
== float_type_mode
8678 || type_mode
== double_type_mode
)
8679 return complex_long_double_type_node
;
8693 /* Return OP, stripped of any conversions to wider types as much as is safe.
8694 Converting the value back to OP's type makes a value equivalent to OP.
8696 If FOR_TYPE is nonzero, we return a value which, if converted to
8697 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8699 OP must have integer, real or enumeral type. Pointers are not allowed!
8701 There are some cases where the obvious value we could return
8702 would regenerate to OP if converted to OP's type,
8703 but would not extend like OP to wider types.
8704 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8705 For example, if OP is (unsigned short)(signed char)-1,
8706 we avoid returning (signed char)-1 if FOR_TYPE is int,
8707 even though extending that to an unsigned short would regenerate OP,
8708 since the result of extending (signed char)-1 to (int)
8709 is different from (int) OP. */
8712 get_unwidened (tree op
, tree for_type
)
8714 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8715 tree type
= TREE_TYPE (op
);
8717 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8719 = (for_type
!= 0 && for_type
!= type
8720 && final_prec
> TYPE_PRECISION (type
)
8721 && TYPE_UNSIGNED (type
));
8724 while (CONVERT_EXPR_P (op
))
8728 /* TYPE_PRECISION on vector types has different meaning
8729 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8730 so avoid them here. */
8731 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8734 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8735 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8737 /* Truncations are many-one so cannot be removed.
8738 Unless we are later going to truncate down even farther. */
8740 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8743 /* See what's inside this conversion. If we decide to strip it,
8745 op
= TREE_OPERAND (op
, 0);
8747 /* If we have not stripped any zero-extensions (uns is 0),
8748 we can strip any kind of extension.
8749 If we have previously stripped a zero-extension,
8750 only zero-extensions can safely be stripped.
8751 Any extension can be stripped if the bits it would produce
8752 are all going to be discarded later by truncating to FOR_TYPE. */
8756 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8758 /* TYPE_UNSIGNED says whether this is a zero-extension.
8759 Let's avoid computing it if it does not affect WIN
8760 and if UNS will not be needed again. */
8762 || CONVERT_EXPR_P (op
))
8763 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8771 /* If we finally reach a constant see if it fits in sth smaller and
8772 in that case convert it. */
8773 if (TREE_CODE (win
) == INTEGER_CST
)
8775 tree wtype
= TREE_TYPE (win
);
8776 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8778 prec
= MAX (prec
, final_prec
);
8779 if (prec
< TYPE_PRECISION (wtype
))
8781 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8782 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8783 win
= fold_convert (t
, win
);
8790 /* Return OP or a simpler expression for a narrower value
8791 which can be sign-extended or zero-extended to give back OP.
8792 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8793 or 0 if the value should be sign-extended. */
8796 get_narrower (tree op
, int *unsignedp_ptr
)
8801 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8803 while (TREE_CODE (op
) == NOP_EXPR
)
8806 = (TYPE_PRECISION (TREE_TYPE (op
))
8807 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8809 /* Truncations are many-one so cannot be removed. */
8813 /* See what's inside this conversion. If we decide to strip it,
8818 op
= TREE_OPERAND (op
, 0);
8819 /* An extension: the outermost one can be stripped,
8820 but remember whether it is zero or sign extension. */
8822 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8823 /* Otherwise, if a sign extension has been stripped,
8824 only sign extensions can now be stripped;
8825 if a zero extension has been stripped, only zero-extensions. */
8826 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8830 else /* bitschange == 0 */
8832 /* A change in nominal type can always be stripped, but we must
8833 preserve the unsignedness. */
8835 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8837 op
= TREE_OPERAND (op
, 0);
8838 /* Keep trying to narrow, but don't assign op to win if it
8839 would turn an integral type into something else. */
8840 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8847 if (TREE_CODE (op
) == COMPONENT_REF
8848 /* Since type_for_size always gives an integer type. */
8849 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8850 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8851 /* Ensure field is laid out already. */
8852 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8853 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8855 unsigned HOST_WIDE_INT innerprec
8856 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8857 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8858 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8859 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8861 /* We can get this structure field in a narrower type that fits it,
8862 but the resulting extension to its nominal type (a fullword type)
8863 must satisfy the same conditions as for other extensions.
8865 Do this only for fields that are aligned (not bit-fields),
8866 because when bit-field insns will be used there is no
8867 advantage in doing this. */
8869 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8870 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8871 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8875 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8876 win
= fold_convert (type
, op
);
8880 *unsignedp_ptr
= uns
;
8884 /* Return true if integer constant C has a value that is permissible
8885 for TYPE, an integral type. */
8888 int_fits_type_p (const_tree c
, const_tree type
)
8890 tree type_low_bound
, type_high_bound
;
8891 bool ok_for_low_bound
, ok_for_high_bound
;
8892 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8894 /* Non-standard boolean types can have arbitrary precision but various
8895 transformations assume that they can only take values 0 and +/-1. */
8896 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8897 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8900 type_low_bound
= TYPE_MIN_VALUE (type
);
8901 type_high_bound
= TYPE_MAX_VALUE (type
);
8903 /* If at least one bound of the type is a constant integer, we can check
8904 ourselves and maybe make a decision. If no such decision is possible, but
8905 this type is a subtype, try checking against that. Otherwise, use
8906 fits_to_tree_p, which checks against the precision.
8908 Compute the status for each possibly constant bound, and return if we see
8909 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8910 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8911 for "constant known to fit". */
8913 /* Check if c >= type_low_bound. */
8914 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8916 if (tree_int_cst_lt (c
, type_low_bound
))
8918 ok_for_low_bound
= true;
8921 ok_for_low_bound
= false;
8923 /* Check if c <= type_high_bound. */
8924 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8926 if (tree_int_cst_lt (type_high_bound
, c
))
8928 ok_for_high_bound
= true;
8931 ok_for_high_bound
= false;
8933 /* If the constant fits both bounds, the result is known. */
8934 if (ok_for_low_bound
&& ok_for_high_bound
)
8937 /* Perform some generic filtering which may allow making a decision
8938 even if the bounds are not constant. First, negative integers
8939 never fit in unsigned types, */
8940 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8943 /* Second, narrower types always fit in wider ones. */
8944 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8947 /* Third, unsigned integers with top bit set never fit signed types. */
8948 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8950 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8951 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8953 /* When a tree_cst is converted to a wide-int, the precision
8954 is taken from the type. However, if the precision of the
8955 mode underneath the type is smaller than that, it is
8956 possible that the value will not fit. The test below
8957 fails if any bit is set between the sign bit of the
8958 underlying mode and the top bit of the type. */
8959 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8962 else if (wi::neg_p (wi::to_wide (c
)))
8966 /* If we haven't been able to decide at this point, there nothing more we
8967 can check ourselves here. Look at the base type if we have one and it
8968 has the same precision. */
8969 if (TREE_CODE (type
) == INTEGER_TYPE
8970 && TREE_TYPE (type
) != 0
8971 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8973 type
= TREE_TYPE (type
);
8977 /* Or to fits_to_tree_p, if nothing else. */
8978 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8981 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8982 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8983 represented (assuming two's-complement arithmetic) within the bit
8984 precision of the type are returned instead. */
8987 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8989 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8990 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8991 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8994 if (TYPE_UNSIGNED (type
))
8995 mpz_set_ui (min
, 0);
8998 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8999 wi::to_mpz (mn
, min
, SIGNED
);
9003 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9004 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9005 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
9008 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9009 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9013 /* Return true if VAR is an automatic variable defined in function FN. */
9016 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9018 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9019 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9020 || TREE_CODE (var
) == PARM_DECL
)
9021 && ! TREE_STATIC (var
))
9022 || TREE_CODE (var
) == LABEL_DECL
9023 || TREE_CODE (var
) == RESULT_DECL
));
9026 /* Subprogram of following function. Called by walk_tree.
9028 Return *TP if it is an automatic variable or parameter of the
9029 function passed in as DATA. */
9032 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9034 tree fn
= (tree
) data
;
9039 else if (DECL_P (*tp
)
9040 && auto_var_in_fn_p (*tp
, fn
))
9046 /* Returns true if T is, contains, or refers to a type with variable
9047 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9048 arguments, but not the return type. If FN is nonzero, only return
9049 true if a modifier of the type or position of FN is a variable or
9050 parameter inside FN.
9052 This concept is more general than that of C99 'variably modified types':
9053 in C99, a struct type is never variably modified because a VLA may not
9054 appear as a structure member. However, in GNU C code like:
9056 struct S { int i[f()]; };
9058 is valid, and other languages may define similar constructs. */
9061 variably_modified_type_p (tree type
, tree fn
)
9065 /* Test if T is either variable (if FN is zero) or an expression containing
9066 a variable in FN. If TYPE isn't gimplified, return true also if
9067 gimplify_one_sizepos would gimplify the expression into a local
9069 #define RETURN_TRUE_IF_VAR(T) \
9070 do { tree _t = (T); \
9071 if (_t != NULL_TREE \
9072 && _t != error_mark_node \
9073 && !CONSTANT_CLASS_P (_t) \
9074 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9076 || (!TYPE_SIZES_GIMPLIFIED (type) \
9077 && (TREE_CODE (_t) != VAR_DECL \
9078 && !CONTAINS_PLACEHOLDER_P (_t))) \
9079 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9080 return true; } while (0)
9082 if (type
== error_mark_node
)
9085 /* If TYPE itself has variable size, it is variably modified. */
9086 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9087 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9089 switch (TREE_CODE (type
))
9092 case REFERENCE_TYPE
:
9094 /* Ada can have pointer types refering to themselves indirectly. */
9095 if (TREE_VISITED (type
))
9097 TREE_VISITED (type
) = true;
9098 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9100 TREE_VISITED (type
) = false;
9103 TREE_VISITED (type
) = false;
9108 /* If TYPE is a function type, it is variably modified if the
9109 return type is variably modified. */
9110 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9116 case FIXED_POINT_TYPE
:
9119 /* Scalar types are variably modified if their end points
9121 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9122 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9127 case QUAL_UNION_TYPE
:
9128 /* We can't see if any of the fields are variably-modified by the
9129 definition we normally use, since that would produce infinite
9130 recursion via pointers. */
9131 /* This is variably modified if some field's type is. */
9132 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9133 if (TREE_CODE (t
) == FIELD_DECL
)
9135 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9136 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9137 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9139 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9140 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9145 /* Do not call ourselves to avoid infinite recursion. This is
9146 variably modified if the element type is. */
9147 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9148 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9155 /* The current language may have other cases to check, but in general,
9156 all other types are not variably modified. */
9157 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9159 #undef RETURN_TRUE_IF_VAR
9162 /* Given a DECL or TYPE, return the scope in which it was declared, or
9163 NULL_TREE if there is no containing scope. */
9166 get_containing_scope (const_tree t
)
9168 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9171 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
9174 get_ultimate_context (const_tree decl
)
9176 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
9178 if (TREE_CODE (decl
) == BLOCK
)
9179 decl
= BLOCK_SUPERCONTEXT (decl
);
9181 decl
= get_containing_scope (decl
);
9186 /* Return the innermost context enclosing DECL that is
9187 a FUNCTION_DECL, or zero if none. */
9190 decl_function_context (const_tree decl
)
9194 if (TREE_CODE (decl
) == ERROR_MARK
)
9197 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9198 where we look up the function at runtime. Such functions always take
9199 a first argument of type 'pointer to real context'.
9201 C++ should really be fixed to use DECL_CONTEXT for the real context,
9202 and use something else for the "virtual context". */
9203 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
9206 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9208 context
= DECL_CONTEXT (decl
);
9210 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9212 if (TREE_CODE (context
) == BLOCK
)
9213 context
= BLOCK_SUPERCONTEXT (context
);
9215 context
= get_containing_scope (context
);
9221 /* Return the innermost context enclosing DECL that is
9222 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9223 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9226 decl_type_context (const_tree decl
)
9228 tree context
= DECL_CONTEXT (decl
);
9231 switch (TREE_CODE (context
))
9233 case NAMESPACE_DECL
:
9234 case TRANSLATION_UNIT_DECL
:
9239 case QUAL_UNION_TYPE
:
9244 context
= DECL_CONTEXT (context
);
9248 context
= BLOCK_SUPERCONTEXT (context
);
9258 /* CALL is a CALL_EXPR. Return the declaration for the function
9259 called, or NULL_TREE if the called function cannot be
9263 get_callee_fndecl (const_tree call
)
9267 if (call
== error_mark_node
)
9268 return error_mark_node
;
9270 /* It's invalid to call this function with anything but a
9272 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9274 /* The first operand to the CALL is the address of the function
9276 addr
= CALL_EXPR_FN (call
);
9278 /* If there is no function, return early. */
9279 if (addr
== NULL_TREE
)
9284 /* If this is a readonly function pointer, extract its initial value. */
9285 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9286 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9287 && DECL_INITIAL (addr
))
9288 addr
= DECL_INITIAL (addr
);
9290 /* If the address is just `&f' for some function `f', then we know
9291 that `f' is being called. */
9292 if (TREE_CODE (addr
) == ADDR_EXPR
9293 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9294 return TREE_OPERAND (addr
, 0);
9296 /* We couldn't figure out what was being called. */
9300 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9301 return the associated function code, otherwise return CFN_LAST. */
9304 get_call_combined_fn (const_tree call
)
9306 /* It's invalid to call this function with anything but a CALL_EXPR. */
9307 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9309 if (!CALL_EXPR_FN (call
))
9310 return as_combined_fn (CALL_EXPR_IFN (call
));
9312 tree fndecl
= get_callee_fndecl (call
);
9313 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
9314 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9319 /* Comparator of indices based on tree_node_counts. */
9322 tree_nodes_cmp (const void *p1
, const void *p2
)
9324 const unsigned *n1
= (const unsigned *)p1
;
9325 const unsigned *n2
= (const unsigned *)p2
;
9327 return tree_node_counts
[*n1
] - tree_node_counts
[*n2
];
9330 /* Comparator of indices based on tree_code_counts. */
9333 tree_codes_cmp (const void *p1
, const void *p2
)
9335 const unsigned *n1
= (const unsigned *)p1
;
9336 const unsigned *n2
= (const unsigned *)p2
;
9338 return tree_code_counts
[*n1
] - tree_code_counts
[*n2
];
9341 #define TREE_MEM_USAGE_SPACES 40
9343 /* Print debugging information about tree nodes generated during the compile,
9344 and any language-specific information. */
9347 dump_tree_statistics (void)
9349 if (GATHER_STATISTICS
)
9351 uint64_t total_nodes
, total_bytes
;
9352 fprintf (stderr
, "\nKind Nodes Bytes\n");
9353 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9354 total_nodes
= total_bytes
= 0;
9357 auto_vec
<unsigned> indices (all_kinds
);
9358 for (unsigned i
= 0; i
< all_kinds
; i
++)
9359 indices
.quick_push (i
);
9360 indices
.qsort (tree_nodes_cmp
);
9362 for (unsigned i
= 0; i
< (int) all_kinds
; i
++)
9364 unsigned j
= indices
[i
];
9365 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n",
9366 tree_node_kind_names
[i
], SIZE_AMOUNT (tree_node_counts
[j
]),
9367 SIZE_AMOUNT (tree_node_sizes
[j
]));
9368 total_nodes
+= tree_node_counts
[j
];
9369 total_bytes
+= tree_node_sizes
[j
];
9371 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9372 fprintf (stderr
, "%-20s %6" PRIu64
"%c %9" PRIu64
"%c\n", "Total",
9373 SIZE_AMOUNT (total_nodes
), SIZE_AMOUNT (total_bytes
));
9374 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9378 fprintf (stderr
, "Code Nodes\n");
9379 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9381 auto_vec
<unsigned> indices (MAX_TREE_CODES
);
9382 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9383 indices
.quick_push (i
);
9384 indices
.qsort (tree_codes_cmp
);
9386 for (unsigned i
= 0; i
< MAX_TREE_CODES
; i
++)
9388 unsigned j
= indices
[i
];
9389 fprintf (stderr
, "%-32s %6" PRIu64
"%c\n",
9390 get_tree_code_name ((enum tree_code
) j
),
9391 SIZE_AMOUNT (tree_code_counts
[j
]));
9393 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9394 fprintf (stderr
, "\n");
9395 ssanames_print_statistics ();
9396 fprintf (stderr
, "\n");
9397 phinodes_print_statistics ();
9398 fprintf (stderr
, "\n");
9402 fprintf (stderr
, "(No per-node statistics)\n");
9404 print_type_hash_statistics ();
9405 print_debug_expr_statistics ();
9406 print_value_expr_statistics ();
9407 lang_hooks
.print_statistics ();
9410 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9412 /* Generate a crc32 of the low BYTES bytes of VALUE. */
9415 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
9417 /* This relies on the raw feedback's top 4 bits being zero. */
9418 #define FEEDBACK(X) ((X) * 0x04c11db7)
9419 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
9420 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
9421 static const unsigned syndromes
[16] =
9423 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
9424 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
9425 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
9426 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
9431 value
<<= (32 - bytes
* 8);
9432 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
9434 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
9436 chksum
= (chksum
<< 4) ^ feedback
;
9442 /* Generate a crc32 of a string. */
9445 crc32_string (unsigned chksum
, const char *string
)
9448 chksum
= crc32_byte (chksum
, *string
);
9453 /* P is a string that will be used in a symbol. Mask out any characters
9454 that are not valid in that context. */
9457 clean_symbol_name (char *p
)
9461 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9464 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9471 /* For anonymous aggregate types, we need some sort of name to
9472 hold on to. In practice, this should not appear, but it should
9473 not be harmful if it does. */
9475 anon_aggrname_p(const_tree id_node
)
9477 #ifndef NO_DOT_IN_LABEL
9478 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9479 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9480 #else /* NO_DOT_IN_LABEL */
9481 #ifndef NO_DOLLAR_IN_LABEL
9482 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9483 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9484 #else /* NO_DOLLAR_IN_LABEL */
9485 #define ANON_AGGRNAME_PREFIX "__anon_"
9486 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9487 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9488 #endif /* NO_DOLLAR_IN_LABEL */
9489 #endif /* NO_DOT_IN_LABEL */
9492 /* Return a format for an anonymous aggregate name. */
9494 anon_aggrname_format()
9496 #ifndef NO_DOT_IN_LABEL
9498 #else /* NO_DOT_IN_LABEL */
9499 #ifndef NO_DOLLAR_IN_LABEL
9501 #else /* NO_DOLLAR_IN_LABEL */
9503 #endif /* NO_DOLLAR_IN_LABEL */
9504 #endif /* NO_DOT_IN_LABEL */
9507 /* Generate a name for a special-purpose function.
9508 The generated name may need to be unique across the whole link.
9509 Changes to this function may also require corresponding changes to
9510 xstrdup_mask_random.
9511 TYPE is some string to identify the purpose of this function to the
9512 linker or collect2; it must start with an uppercase letter,
9514 I - for constructors
9516 N - for C++ anonymous namespaces
9517 F - for DWARF unwind frame information. */
9520 get_file_function_name (const char *type
)
9526 /* If we already have a name we know to be unique, just use that. */
9527 if (first_global_object_name
)
9528 p
= q
= ASTRDUP (first_global_object_name
);
9529 /* If the target is handling the constructors/destructors, they
9530 will be local to this file and the name is only necessary for
9532 We also assign sub_I and sub_D sufixes to constructors called from
9533 the global static constructors. These are always local. */
9534 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9535 || (strncmp (type
, "sub_", 4) == 0
9536 && (type
[4] == 'I' || type
[4] == 'D')))
9538 const char *file
= main_input_filename
;
9540 file
= LOCATION_FILE (input_location
);
9541 /* Just use the file's basename, because the full pathname
9542 might be quite long. */
9543 p
= q
= ASTRDUP (lbasename (file
));
9547 /* Otherwise, the name must be unique across the entire link.
9548 We don't have anything that we know to be unique to this translation
9549 unit, so use what we do have and throw in some randomness. */
9551 const char *name
= weak_global_object_name
;
9552 const char *file
= main_input_filename
;
9557 file
= LOCATION_FILE (input_location
);
9559 len
= strlen (file
);
9560 q
= (char *) alloca (9 + 19 + len
+ 1);
9561 memcpy (q
, file
, len
+ 1);
9563 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9564 crc32_string (0, name
), get_random_seed (false));
9569 clean_symbol_name (q
);
9570 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9573 /* Set up the name of the file-level functions we may need.
9574 Use a global object (which is already required to be unique over
9575 the program) rather than the file name (which imposes extra
9577 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9579 return get_identifier (buf
);
9582 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9584 /* Complain that the tree code of NODE does not match the expected 0
9585 terminated list of trailing codes. The trailing code list can be
9586 empty, for a more vague error message. FILE, LINE, and FUNCTION
9587 are of the caller. */
9590 tree_check_failed (const_tree node
, const char *file
,
9591 int line
, const char *function
, ...)
9595 unsigned length
= 0;
9596 enum tree_code code
;
9598 va_start (args
, function
);
9599 while ((code
= (enum tree_code
) va_arg (args
, int)))
9600 length
+= 4 + strlen (get_tree_code_name (code
));
9605 va_start (args
, function
);
9606 length
+= strlen ("expected ");
9607 buffer
= tmp
= (char *) alloca (length
);
9609 while ((code
= (enum tree_code
) va_arg (args
, int)))
9611 const char *prefix
= length
? " or " : "expected ";
9613 strcpy (tmp
+ length
, prefix
);
9614 length
+= strlen (prefix
);
9615 strcpy (tmp
+ length
, get_tree_code_name (code
));
9616 length
+= strlen (get_tree_code_name (code
));
9621 buffer
= "unexpected node";
9623 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9624 buffer
, get_tree_code_name (TREE_CODE (node
)),
9625 function
, trim_filename (file
), line
);
9628 /* Complain that the tree code of NODE does match the expected 0
9629 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9633 tree_not_check_failed (const_tree node
, const char *file
,
9634 int line
, const char *function
, ...)
9638 unsigned length
= 0;
9639 enum tree_code code
;
9641 va_start (args
, function
);
9642 while ((code
= (enum tree_code
) va_arg (args
, int)))
9643 length
+= 4 + strlen (get_tree_code_name (code
));
9645 va_start (args
, function
);
9646 buffer
= (char *) alloca (length
);
9648 while ((code
= (enum tree_code
) va_arg (args
, int)))
9652 strcpy (buffer
+ length
, " or ");
9655 strcpy (buffer
+ length
, get_tree_code_name (code
));
9656 length
+= strlen (get_tree_code_name (code
));
9660 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9661 buffer
, get_tree_code_name (TREE_CODE (node
)),
9662 function
, trim_filename (file
), line
);
9665 /* Similar to tree_check_failed, except that we check for a class of tree
9666 code, given in CL. */
9669 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9670 const char *file
, int line
, const char *function
)
9673 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9674 TREE_CODE_CLASS_STRING (cl
),
9675 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9676 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9679 /* Similar to tree_check_failed, except that instead of specifying a
9680 dozen codes, use the knowledge that they're all sequential. */
9683 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9684 const char *function
, enum tree_code c1
,
9688 unsigned length
= 0;
9691 for (c
= c1
; c
<= c2
; ++c
)
9692 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9694 length
+= strlen ("expected ");
9695 buffer
= (char *) alloca (length
);
9698 for (c
= c1
; c
<= c2
; ++c
)
9700 const char *prefix
= length
? " or " : "expected ";
9702 strcpy (buffer
+ length
, prefix
);
9703 length
+= strlen (prefix
);
9704 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9705 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9708 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9709 buffer
, get_tree_code_name (TREE_CODE (node
)),
9710 function
, trim_filename (file
), line
);
9714 /* Similar to tree_check_failed, except that we check that a tree does
9715 not have the specified code, given in CL. */
9718 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9719 const char *file
, int line
, const char *function
)
9722 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9723 TREE_CODE_CLASS_STRING (cl
),
9724 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9725 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9729 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9732 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9733 const char *function
, enum omp_clause_code code
)
9735 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9736 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9737 function
, trim_filename (file
), line
);
9741 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9744 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9745 const char *function
, enum omp_clause_code c1
,
9746 enum omp_clause_code c2
)
9749 unsigned length
= 0;
9752 for (c
= c1
; c
<= c2
; ++c
)
9753 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9755 length
+= strlen ("expected ");
9756 buffer
= (char *) alloca (length
);
9759 for (c
= c1
; c
<= c2
; ++c
)
9761 const char *prefix
= length
? " or " : "expected ";
9763 strcpy (buffer
+ length
, prefix
);
9764 length
+= strlen (prefix
);
9765 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9766 length
+= strlen (omp_clause_code_name
[c
]);
9769 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9770 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9771 function
, trim_filename (file
), line
);
9775 #undef DEFTREESTRUCT
9776 #define DEFTREESTRUCT(VAL, NAME) NAME,
9778 static const char *ts_enum_names
[] = {
9779 #include "treestruct.def"
9781 #undef DEFTREESTRUCT
9783 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9785 /* Similar to tree_class_check_failed, except that we check for
9786 whether CODE contains the tree structure identified by EN. */
9789 tree_contains_struct_check_failed (const_tree node
,
9790 const enum tree_node_structure_enum en
,
9791 const char *file
, int line
,
9792 const char *function
)
9795 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9797 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9801 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9802 (dynamically sized) vector. */
9805 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9806 const char *function
)
9809 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9810 idx
+ 1, len
, function
, trim_filename (file
), line
);
9813 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9814 (dynamically sized) vector. */
9817 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9818 const char *function
)
9821 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9822 idx
+ 1, len
, function
, trim_filename (file
), line
);
9825 /* Similar to above, except that the check is for the bounds of the operand
9826 vector of an expression node EXP. */
9829 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9830 int line
, const char *function
)
9832 enum tree_code code
= TREE_CODE (exp
);
9834 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9835 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9836 function
, trim_filename (file
), line
);
9839 /* Similar to above, except that the check is for the number of
9840 operands of an OMP_CLAUSE node. */
9843 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9844 int line
, const char *function
)
9847 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9848 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9849 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9850 trim_filename (file
), line
);
9852 #endif /* ENABLE_TREE_CHECKING */
9854 /* Create a new vector type node holding NUNITS units of type INNERTYPE,
9855 and mapped to the machine mode MODE. Initialize its fields and build
9856 the information necessary for debugging output. */
9859 make_vector_type (tree innertype
, poly_int64 nunits
, machine_mode mode
)
9862 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9864 t
= make_node (VECTOR_TYPE
);
9865 TREE_TYPE (t
) = mv_innertype
;
9866 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9867 SET_TYPE_MODE (t
, mode
);
9869 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9870 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9871 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9872 || mode
!= VOIDmode
)
9873 && !VECTOR_BOOLEAN_TYPE_P (t
))
9875 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9879 hashval_t hash
= type_hash_canon_hash (t
);
9880 t
= type_hash_canon (hash
, t
);
9882 /* We have built a main variant, based on the main variant of the
9883 inner type. Use it to build the variant we return. */
9884 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9885 && TREE_TYPE (t
) != innertype
)
9886 return build_type_attribute_qual_variant (t
,
9887 TYPE_ATTRIBUTES (innertype
),
9888 TYPE_QUALS (innertype
));
9894 make_or_reuse_type (unsigned size
, int unsignedp
)
9898 if (size
== INT_TYPE_SIZE
)
9899 return unsignedp
? unsigned_type_node
: integer_type_node
;
9900 if (size
== CHAR_TYPE_SIZE
)
9901 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9902 if (size
== SHORT_TYPE_SIZE
)
9903 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9904 if (size
== LONG_TYPE_SIZE
)
9905 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9906 if (size
== LONG_LONG_TYPE_SIZE
)
9907 return (unsignedp
? long_long_unsigned_type_node
9908 : long_long_integer_type_node
);
9910 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9911 if (size
== int_n_data
[i
].bitsize
9912 && int_n_enabled_p
[i
])
9913 return (unsignedp
? int_n_trees
[i
].unsigned_type
9914 : int_n_trees
[i
].signed_type
);
9917 return make_unsigned_type (size
);
9919 return make_signed_type (size
);
9922 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9925 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9929 if (size
== SHORT_FRACT_TYPE_SIZE
)
9930 return unsignedp
? sat_unsigned_short_fract_type_node
9931 : sat_short_fract_type_node
;
9932 if (size
== FRACT_TYPE_SIZE
)
9933 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9934 if (size
== LONG_FRACT_TYPE_SIZE
)
9935 return unsignedp
? sat_unsigned_long_fract_type_node
9936 : sat_long_fract_type_node
;
9937 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9938 return unsignedp
? sat_unsigned_long_long_fract_type_node
9939 : sat_long_long_fract_type_node
;
9943 if (size
== SHORT_FRACT_TYPE_SIZE
)
9944 return unsignedp
? unsigned_short_fract_type_node
9945 : short_fract_type_node
;
9946 if (size
== FRACT_TYPE_SIZE
)
9947 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9948 if (size
== LONG_FRACT_TYPE_SIZE
)
9949 return unsignedp
? unsigned_long_fract_type_node
9950 : long_fract_type_node
;
9951 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9952 return unsignedp
? unsigned_long_long_fract_type_node
9953 : long_long_fract_type_node
;
9956 return make_fract_type (size
, unsignedp
, satp
);
9959 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9962 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9966 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9967 return unsignedp
? sat_unsigned_short_accum_type_node
9968 : sat_short_accum_type_node
;
9969 if (size
== ACCUM_TYPE_SIZE
)
9970 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9971 if (size
== LONG_ACCUM_TYPE_SIZE
)
9972 return unsignedp
? sat_unsigned_long_accum_type_node
9973 : sat_long_accum_type_node
;
9974 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9975 return unsignedp
? sat_unsigned_long_long_accum_type_node
9976 : sat_long_long_accum_type_node
;
9980 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9981 return unsignedp
? unsigned_short_accum_type_node
9982 : short_accum_type_node
;
9983 if (size
== ACCUM_TYPE_SIZE
)
9984 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9985 if (size
== LONG_ACCUM_TYPE_SIZE
)
9986 return unsignedp
? unsigned_long_accum_type_node
9987 : long_accum_type_node
;
9988 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9989 return unsignedp
? unsigned_long_long_accum_type_node
9990 : long_long_accum_type_node
;
9993 return make_accum_type (size
, unsignedp
, satp
);
9997 /* Create an atomic variant node for TYPE. This routine is called
9998 during initialization of data types to create the 5 basic atomic
9999 types. The generic build_variant_type function requires these to
10000 already be set up in order to function properly, so cannot be
10001 called from there. If ALIGN is non-zero, then ensure alignment is
10002 overridden to this value. */
10005 build_atomic_base (tree type
, unsigned int align
)
10009 /* Make sure its not already registered. */
10010 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10013 t
= build_variant_type_copy (type
);
10014 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10017 SET_TYPE_ALIGN (t
, align
);
10022 /* Information about the _FloatN and _FloatNx types. This must be in
10023 the same order as the corresponding TI_* enum values. */
10024 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10036 /* Create nodes for all integer types (and error_mark_node) using the sizes
10037 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10040 build_common_tree_nodes (bool signed_char
)
10044 error_mark_node
= make_node (ERROR_MARK
);
10045 TREE_TYPE (error_mark_node
) = error_mark_node
;
10047 initialize_sizetypes ();
10049 /* Define both `signed char' and `unsigned char'. */
10050 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10051 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10052 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10053 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10055 /* Define `char', which is like either `signed char' or `unsigned char'
10056 but not the same as either. */
10059 ? make_signed_type (CHAR_TYPE_SIZE
)
10060 : make_unsigned_type (CHAR_TYPE_SIZE
));
10061 TYPE_STRING_FLAG (char_type_node
) = 1;
10063 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10064 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10065 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10066 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10067 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10068 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10069 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10070 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10072 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10074 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10075 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10077 if (int_n_enabled_p
[i
])
10079 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10080 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10084 /* Define a boolean type. This type only represents boolean values but
10085 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10086 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10087 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10088 TYPE_PRECISION (boolean_type_node
) = 1;
10089 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10091 /* Define what type to use for size_t. */
10092 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10093 size_type_node
= unsigned_type_node
;
10094 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10095 size_type_node
= long_unsigned_type_node
;
10096 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10097 size_type_node
= long_long_unsigned_type_node
;
10098 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10099 size_type_node
= short_unsigned_type_node
;
10104 size_type_node
= NULL_TREE
;
10105 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10106 if (int_n_enabled_p
[i
])
10109 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10111 if (strcmp (name
, SIZE_TYPE
) == 0)
10113 size_type_node
= int_n_trees
[i
].unsigned_type
;
10116 if (size_type_node
== NULL_TREE
)
10117 gcc_unreachable ();
10120 /* Define what type to use for ptrdiff_t. */
10121 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
10122 ptrdiff_type_node
= integer_type_node
;
10123 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
10124 ptrdiff_type_node
= long_integer_type_node
;
10125 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
10126 ptrdiff_type_node
= long_long_integer_type_node
;
10127 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
10128 ptrdiff_type_node
= short_integer_type_node
;
10131 ptrdiff_type_node
= NULL_TREE
;
10132 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10133 if (int_n_enabled_p
[i
])
10136 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
10137 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
10138 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
10140 if (ptrdiff_type_node
== NULL_TREE
)
10141 gcc_unreachable ();
10144 /* Fill in the rest of the sized types. Reuse existing type nodes
10146 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10147 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10148 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10149 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10150 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10152 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10153 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10154 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10155 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10156 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10158 /* Don't call build_qualified type for atomics. That routine does
10159 special processing for atomics, and until they are initialized
10160 it's better not to make that call.
10162 Check to see if there is a target override for atomic types. */
10164 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10165 targetm
.atomic_align_for_mode (QImode
));
10166 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10167 targetm
.atomic_align_for_mode (HImode
));
10168 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10169 targetm
.atomic_align_for_mode (SImode
));
10170 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10171 targetm
.atomic_align_for_mode (DImode
));
10172 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10173 targetm
.atomic_align_for_mode (TImode
));
10175 access_public_node
= get_identifier ("public");
10176 access_protected_node
= get_identifier ("protected");
10177 access_private_node
= get_identifier ("private");
10179 /* Define these next since types below may used them. */
10180 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10181 integer_one_node
= build_int_cst (integer_type_node
, 1);
10182 integer_three_node
= build_int_cst (integer_type_node
, 3);
10183 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10185 size_zero_node
= size_int (0);
10186 size_one_node
= size_int (1);
10187 bitsize_zero_node
= bitsize_int (0);
10188 bitsize_one_node
= bitsize_int (1);
10189 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10191 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10192 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10194 void_type_node
= make_node (VOID_TYPE
);
10195 layout_type (void_type_node
);
10197 /* We are not going to have real types in C with less than byte alignment,
10198 so we might as well not have any types that claim to have it. */
10199 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10200 TYPE_USER_ALIGN (void_type_node
) = 0;
10202 void_node
= make_node (VOID_CST
);
10203 TREE_TYPE (void_node
) = void_type_node
;
10205 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10206 layout_type (TREE_TYPE (null_pointer_node
));
10208 ptr_type_node
= build_pointer_type (void_type_node
);
10209 const_ptr_type_node
10210 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10211 for (unsigned i
= 0;
10212 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
10214 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
10216 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10218 float_type_node
= make_node (REAL_TYPE
);
10219 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10220 layout_type (float_type_node
);
10222 double_type_node
= make_node (REAL_TYPE
);
10223 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10224 layout_type (double_type_node
);
10226 long_double_type_node
= make_node (REAL_TYPE
);
10227 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10228 layout_type (long_double_type_node
);
10230 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10232 int n
= floatn_nx_types
[i
].n
;
10233 bool extended
= floatn_nx_types
[i
].extended
;
10234 scalar_float_mode mode
;
10235 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
10237 int precision
= GET_MODE_PRECISION (mode
);
10238 /* Work around the rs6000 KFmode having precision 113 not
10240 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10241 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10242 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10244 gcc_assert (min_precision
== n
);
10245 if (precision
< min_precision
)
10246 precision
= min_precision
;
10247 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10248 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10249 layout_type (FLOATN_NX_TYPE_NODE (i
));
10250 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10253 float_ptr_type_node
= build_pointer_type (float_type_node
);
10254 double_ptr_type_node
= build_pointer_type (double_type_node
);
10255 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10256 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10258 /* Fixed size integer types. */
10259 uint16_type_node
= make_or_reuse_type (16, 1);
10260 uint32_type_node
= make_or_reuse_type (32, 1);
10261 uint64_type_node
= make_or_reuse_type (64, 1);
10263 /* Decimal float types. */
10264 dfloat32_type_node
= make_node (REAL_TYPE
);
10265 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10266 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10267 layout_type (dfloat32_type_node
);
10268 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10270 dfloat64_type_node
= make_node (REAL_TYPE
);
10271 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10272 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10273 layout_type (dfloat64_type_node
);
10274 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10276 dfloat128_type_node
= make_node (REAL_TYPE
);
10277 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10278 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10279 layout_type (dfloat128_type_node
);
10280 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10282 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10283 complex_float_type_node
= build_complex_type (float_type_node
, true);
10284 complex_double_type_node
= build_complex_type (double_type_node
, true);
10285 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10288 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10290 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10291 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10292 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10295 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10296 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10297 sat_ ## KIND ## _type_node = \
10298 make_sat_signed_ ## KIND ## _type (SIZE); \
10299 sat_unsigned_ ## KIND ## _type_node = \
10300 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10301 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10302 unsigned_ ## KIND ## _type_node = \
10303 make_unsigned_ ## KIND ## _type (SIZE);
10305 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10306 sat_ ## WIDTH ## KIND ## _type_node = \
10307 make_sat_signed_ ## KIND ## _type (SIZE); \
10308 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10309 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10310 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10311 unsigned_ ## WIDTH ## KIND ## _type_node = \
10312 make_unsigned_ ## KIND ## _type (SIZE);
10314 /* Make fixed-point type nodes based on four different widths. */
10315 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10316 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10317 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10318 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10319 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10321 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10322 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10323 NAME ## _type_node = \
10324 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10325 u ## NAME ## _type_node = \
10326 make_or_reuse_unsigned_ ## KIND ## _type \
10327 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10328 sat_ ## NAME ## _type_node = \
10329 make_or_reuse_sat_signed_ ## KIND ## _type \
10330 (GET_MODE_BITSIZE (MODE ## mode)); \
10331 sat_u ## NAME ## _type_node = \
10332 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10333 (GET_MODE_BITSIZE (U ## MODE ## mode));
10335 /* Fixed-point type and mode nodes. */
10336 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10337 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10338 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10339 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10340 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10341 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10342 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10343 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10344 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10345 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10346 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10349 tree t
= targetm
.build_builtin_va_list ();
10351 /* Many back-ends define record types without setting TYPE_NAME.
10352 If we copied the record type here, we'd keep the original
10353 record type without a name. This breaks name mangling. So,
10354 don't copy record types and let c_common_nodes_and_builtins()
10355 declare the type to be __builtin_va_list. */
10356 if (TREE_CODE (t
) != RECORD_TYPE
)
10357 t
= build_variant_type_copy (t
);
10359 va_list_type_node
= t
;
10363 /* Modify DECL for given flags.
10364 TM_PURE attribute is set only on types, so the function will modify
10365 DECL's type when ECF_TM_PURE is used. */
10368 set_call_expr_flags (tree decl
, int flags
)
10370 if (flags
& ECF_NOTHROW
)
10371 TREE_NOTHROW (decl
) = 1;
10372 if (flags
& ECF_CONST
)
10373 TREE_READONLY (decl
) = 1;
10374 if (flags
& ECF_PURE
)
10375 DECL_PURE_P (decl
) = 1;
10376 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10377 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10378 if (flags
& ECF_NOVOPS
)
10379 DECL_IS_NOVOPS (decl
) = 1;
10380 if (flags
& ECF_NORETURN
)
10381 TREE_THIS_VOLATILE (decl
) = 1;
10382 if (flags
& ECF_MALLOC
)
10383 DECL_IS_MALLOC (decl
) = 1;
10384 if (flags
& ECF_RETURNS_TWICE
)
10385 DECL_IS_RETURNS_TWICE (decl
) = 1;
10386 if (flags
& ECF_LEAF
)
10387 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10388 NULL
, DECL_ATTRIBUTES (decl
));
10389 if (flags
& ECF_COLD
)
10390 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
10391 NULL
, DECL_ATTRIBUTES (decl
));
10392 if (flags
& ECF_RET1
)
10393 DECL_ATTRIBUTES (decl
)
10394 = tree_cons (get_identifier ("fn spec"),
10395 build_tree_list (NULL_TREE
, build_string (1, "1")),
10396 DECL_ATTRIBUTES (decl
));
10397 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10398 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10399 /* Looping const or pure is implied by noreturn.
10400 There is currently no way to declare looping const or looping pure alone. */
10401 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10402 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10406 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10409 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10410 const char *library_name
, int ecf_flags
)
10414 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10415 library_name
, NULL_TREE
);
10416 set_call_expr_flags (decl
, ecf_flags
);
10418 set_builtin_decl (code
, decl
, true);
10421 /* Call this function after instantiating all builtins that the language
10422 front end cares about. This will build the rest of the builtins
10423 and internal functions that are relied upon by the tree optimizers and
10427 build_common_builtin_nodes (void)
10432 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10433 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10435 ftype
= build_function_type (void_type_node
, void_list_node
);
10436 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10437 local_define_builtin ("__builtin_unreachable", ftype
,
10438 BUILT_IN_UNREACHABLE
,
10439 "__builtin_unreachable",
10440 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10441 | ECF_CONST
| ECF_COLD
);
10442 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10443 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10445 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
10448 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10449 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10451 ftype
= build_function_type_list (ptr_type_node
,
10452 ptr_type_node
, const_ptr_type_node
,
10453 size_type_node
, NULL_TREE
);
10455 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10456 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10457 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10458 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10459 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10460 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10463 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10465 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10466 const_ptr_type_node
, size_type_node
,
10468 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10469 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10472 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10474 ftype
= build_function_type_list (ptr_type_node
,
10475 ptr_type_node
, integer_type_node
,
10476 size_type_node
, NULL_TREE
);
10477 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10478 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10481 /* If we're checking the stack, `alloca' can throw. */
10482 const int alloca_flags
10483 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10485 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10487 ftype
= build_function_type_list (ptr_type_node
,
10488 size_type_node
, NULL_TREE
);
10489 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10490 "alloca", alloca_flags
);
10493 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10494 size_type_node
, NULL_TREE
);
10495 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10496 BUILT_IN_ALLOCA_WITH_ALIGN
,
10497 "__builtin_alloca_with_align",
10500 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10501 size_type_node
, size_type_node
, NULL_TREE
);
10502 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10503 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10504 "__builtin_alloca_with_align_and_max",
10507 ftype
= build_function_type_list (void_type_node
,
10508 ptr_type_node
, ptr_type_node
,
10509 ptr_type_node
, NULL_TREE
);
10510 local_define_builtin ("__builtin_init_trampoline", ftype
,
10511 BUILT_IN_INIT_TRAMPOLINE
,
10512 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10513 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10514 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10515 "__builtin_init_heap_trampoline",
10516 ECF_NOTHROW
| ECF_LEAF
);
10517 local_define_builtin ("__builtin_init_descriptor", ftype
,
10518 BUILT_IN_INIT_DESCRIPTOR
,
10519 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10521 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10522 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10523 BUILT_IN_ADJUST_TRAMPOLINE
,
10524 "__builtin_adjust_trampoline",
10525 ECF_CONST
| ECF_NOTHROW
);
10526 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10527 BUILT_IN_ADJUST_DESCRIPTOR
,
10528 "__builtin_adjust_descriptor",
10529 ECF_CONST
| ECF_NOTHROW
);
10531 ftype
= build_function_type_list (void_type_node
,
10532 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10533 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10534 BUILT_IN_NONLOCAL_GOTO
,
10535 "__builtin_nonlocal_goto",
10536 ECF_NORETURN
| ECF_NOTHROW
);
10538 ftype
= build_function_type_list (void_type_node
,
10539 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10540 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10541 BUILT_IN_SETJMP_SETUP
,
10542 "__builtin_setjmp_setup", ECF_NOTHROW
);
10544 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10545 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10546 BUILT_IN_SETJMP_RECEIVER
,
10547 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10549 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10550 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10551 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10553 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10554 local_define_builtin ("__builtin_stack_restore", ftype
,
10555 BUILT_IN_STACK_RESTORE
,
10556 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10558 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10559 const_ptr_type_node
, size_type_node
,
10561 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10562 "__builtin_memcmp_eq",
10563 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10565 local_define_builtin ("__builtin_strncmp_eq", ftype
, BUILT_IN_STRNCMP_EQ
,
10566 "__builtin_strncmp_eq",
10567 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10569 local_define_builtin ("__builtin_strcmp_eq", ftype
, BUILT_IN_STRCMP_EQ
,
10570 "__builtin_strcmp_eq",
10571 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10573 /* If there's a possibility that we might use the ARM EABI, build the
10574 alternate __cxa_end_cleanup node used to resume from C++. */
10575 if (targetm
.arm_eabi_unwinder
)
10577 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10578 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10579 BUILT_IN_CXA_END_CLEANUP
,
10580 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10583 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10584 local_define_builtin ("__builtin_unwind_resume", ftype
,
10585 BUILT_IN_UNWIND_RESUME
,
10586 ((targetm_common
.except_unwind_info (&global_options
)
10588 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10591 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10593 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10595 local_define_builtin ("__builtin_return_address", ftype
,
10596 BUILT_IN_RETURN_ADDRESS
,
10597 "__builtin_return_address",
10601 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10602 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10604 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10605 ptr_type_node
, NULL_TREE
);
10606 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10607 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10608 BUILT_IN_PROFILE_FUNC_ENTER
,
10609 "__cyg_profile_func_enter", 0);
10610 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10611 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10612 BUILT_IN_PROFILE_FUNC_EXIT
,
10613 "__cyg_profile_func_exit", 0);
10616 /* The exception object and filter values from the runtime. The argument
10617 must be zero before exception lowering, i.e. from the front end. After
10618 exception lowering, it will be the region number for the exception
10619 landing pad. These functions are PURE instead of CONST to prevent
10620 them from being hoisted past the exception edge that will initialize
10621 its value in the landing pad. */
10622 ftype
= build_function_type_list (ptr_type_node
,
10623 integer_type_node
, NULL_TREE
);
10624 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10625 /* Only use TM_PURE if we have TM language support. */
10626 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10627 ecf_flags
|= ECF_TM_PURE
;
10628 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10629 "__builtin_eh_pointer", ecf_flags
);
10631 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10632 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10633 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10634 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10636 ftype
= build_function_type_list (void_type_node
,
10637 integer_type_node
, integer_type_node
,
10639 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10640 BUILT_IN_EH_COPY_VALUES
,
10641 "__builtin_eh_copy_values", ECF_NOTHROW
);
10643 /* Complex multiplication and division. These are handled as builtins
10644 rather than optabs because emit_library_call_value doesn't support
10645 complex. Further, we can do slightly better with folding these
10646 beasties if the real and complex parts of the arguments are separate. */
10650 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10652 char mode_name_buf
[4], *q
;
10654 enum built_in_function mcode
, dcode
;
10655 tree type
, inner_type
;
10656 const char *prefix
= "__";
10658 if (targetm
.libfunc_gnu_prefix
)
10661 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10664 inner_type
= TREE_TYPE (type
);
10666 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10667 inner_type
, inner_type
, NULL_TREE
);
10669 mcode
= ((enum built_in_function
)
10670 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10671 dcode
= ((enum built_in_function
)
10672 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10674 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10678 /* For -ftrapping-math these should throw from a former
10679 -fnon-call-exception stmt. */
10680 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10682 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10683 built_in_names
[mcode
],
10684 ECF_CONST
| ECF_LEAF
);
10686 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10688 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10689 built_in_names
[dcode
],
10690 ECF_CONST
| ECF_LEAF
);
10694 init_internal_fns ();
10697 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10700 If we requested a pointer to a vector, build up the pointers that
10701 we stripped off while looking for the inner type. Similarly for
10702 return values from functions.
10704 The argument TYPE is the top of the chain, and BOTTOM is the
10705 new type which we will point to. */
10708 reconstruct_complex_type (tree type
, tree bottom
)
10712 if (TREE_CODE (type
) == POINTER_TYPE
)
10714 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10715 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10716 TYPE_REF_CAN_ALIAS_ALL (type
));
10718 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10720 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10721 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10722 TYPE_REF_CAN_ALIAS_ALL (type
));
10724 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10726 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10727 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10729 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10731 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10732 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10734 else if (TREE_CODE (type
) == METHOD_TYPE
)
10736 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10737 /* The build_method_type_directly() routine prepends 'this' to argument list,
10738 so we must compensate by getting rid of it. */
10740 = build_method_type_directly
10741 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10743 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10745 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10747 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10748 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10753 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10754 TYPE_QUALS (type
));
10757 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10760 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10763 unsigned int bitsize
;
10765 switch (GET_MODE_CLASS (mode
))
10767 case MODE_VECTOR_BOOL
:
10768 case MODE_VECTOR_INT
:
10769 case MODE_VECTOR_FLOAT
:
10770 case MODE_VECTOR_FRACT
:
10771 case MODE_VECTOR_UFRACT
:
10772 case MODE_VECTOR_ACCUM
:
10773 case MODE_VECTOR_UACCUM
:
10774 nunits
= GET_MODE_NUNITS (mode
);
10778 /* Check that there are no leftover bits. */
10779 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10780 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10781 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10785 gcc_unreachable ();
10788 return make_vector_type (innertype
, nunits
, mode
);
10791 /* Similarly, but takes the inner type and number of units, which must be
10795 build_vector_type (tree innertype
, poly_int64 nunits
)
10797 return make_vector_type (innertype
, nunits
, VOIDmode
);
10800 /* Build truth vector with specified length and number of units. */
10803 build_truth_vector_type (poly_uint64 nunits
, poly_uint64 vector_size
)
10805 machine_mode mask_mode
10806 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10809 if (mask_mode
== BLKmode
)
10810 vsize
= vector_size
* BITS_PER_UNIT
;
10812 vsize
= GET_MODE_BITSIZE (mask_mode
);
10814 unsigned HOST_WIDE_INT esize
= vector_element_size (vsize
, nunits
);
10816 tree bool_type
= build_nonstandard_boolean_type (esize
);
10818 return make_vector_type (bool_type
, nunits
, mask_mode
);
10821 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10824 build_same_sized_truth_vector_type (tree vectype
)
10826 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10829 poly_uint64 size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10831 if (known_eq (size
, 0U))
10832 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10834 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10837 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10840 build_opaque_vector_type (tree innertype
, poly_int64 nunits
)
10842 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10844 /* We always build the non-opaque variant before the opaque one,
10845 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10846 cand
= TYPE_NEXT_VARIANT (t
);
10848 && TYPE_VECTOR_OPAQUE (cand
)
10849 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10851 /* Othewise build a variant type and make sure to queue it after
10852 the non-opaque type. */
10853 cand
= build_distinct_type_copy (t
);
10854 TYPE_VECTOR_OPAQUE (cand
) = true;
10855 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10856 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10857 TYPE_NEXT_VARIANT (t
) = cand
;
10858 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10862 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10865 vector_cst_int_elt (const_tree t
, unsigned int i
)
10867 /* First handle elements that are directly encoded. */
10868 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10869 if (i
< encoded_nelts
)
10870 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10872 /* Identify the pattern that contains element I and work out the index of
10873 the last encoded element for that pattern. */
10874 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10875 unsigned int pattern
= i
% npatterns
;
10876 unsigned int count
= i
/ npatterns
;
10877 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10879 /* If there are no steps, the final encoded value is the right one. */
10880 if (!VECTOR_CST_STEPPED_P (t
))
10881 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10883 /* Otherwise work out the value from the last two encoded elements. */
10884 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10885 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10886 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10887 return wi::to_wide (v2
) + (count
- 2) * diff
;
10890 /* Return the value of element I of VECTOR_CST T. */
10893 vector_cst_elt (const_tree t
, unsigned int i
)
10895 /* First handle elements that are directly encoded. */
10896 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10897 if (i
< encoded_nelts
)
10898 return VECTOR_CST_ENCODED_ELT (t
, i
);
10900 /* If there are no steps, the final encoded value is the right one. */
10901 if (!VECTOR_CST_STEPPED_P (t
))
10903 /* Identify the pattern that contains element I and work out the index of
10904 the last encoded element for that pattern. */
10905 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10906 unsigned int pattern
= i
% npatterns
;
10907 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10908 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10911 /* Otherwise work out the value from the last two encoded elements. */
10912 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10913 vector_cst_int_elt (t
, i
));
10916 /* Given an initializer INIT, return TRUE if INIT is zero or some
10917 aggregate of zeros. Otherwise return FALSE. If NONZERO is not
10918 null, set *NONZERO if and only if INIT is known not to be all
10919 zeros. The combination of return value of false and *NONZERO
10920 false implies that INIT may but need not be all zeros. Other
10921 combinations indicate definitive answers. */
10924 initializer_zerop (const_tree init
, bool *nonzero
/* = NULL */)
10930 /* Conservatively clear NONZERO and set it only if INIT is definitely
10936 unsigned HOST_WIDE_INT off
= 0;
10938 switch (TREE_CODE (init
))
10941 if (integer_zerop (init
))
10948 /* ??? Note that this is not correct for C4X float formats. There,
10949 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10950 negative exponent. */
10951 if (real_zerop (init
)
10952 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
)))
10959 if (fixed_zerop (init
))
10966 if (integer_zerop (init
)
10967 || (real_zerop (init
)
10968 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10969 && !REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
)))))
10976 if (VECTOR_CST_NPATTERNS (init
) == 1
10977 && VECTOR_CST_DUPLICATE_P (init
)
10978 && initializer_zerop (VECTOR_CST_ENCODED_ELT (init
, 0)))
10986 if (TREE_CLOBBER_P (init
))
10989 unsigned HOST_WIDE_INT idx
;
10992 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10993 if (!initializer_zerop (elt
, nonzero
))
11001 tree arg
= TREE_OPERAND (init
, 0);
11002 if (TREE_CODE (arg
) != ADDR_EXPR
)
11004 tree offset
= TREE_OPERAND (init
, 1);
11005 if (TREE_CODE (offset
) != INTEGER_CST
11006 || !tree_fits_uhwi_p (offset
))
11008 off
= tree_to_uhwi (offset
);
11011 arg
= TREE_OPERAND (arg
, 0);
11012 if (TREE_CODE (arg
) != STRING_CST
)
11016 /* Fall through. */
11020 gcc_assert (off
<= INT_MAX
);
11023 int n
= TREE_STRING_LENGTH (init
);
11027 /* We need to loop through all elements to handle cases like
11028 "\0" and "\0foobar". */
11029 for (i
= 0; i
< n
; ++i
)
11030 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11044 /* Check if vector VEC consists of all the equal elements and
11045 that the number of elements corresponds to the type of VEC.
11046 The function returns first element of the vector
11047 or NULL_TREE if the vector is not uniform. */
11049 uniform_vector_p (const_tree vec
)
11052 unsigned HOST_WIDE_INT i
, nelts
;
11054 if (vec
== NULL_TREE
)
11057 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11059 if (TREE_CODE (vec
) == VEC_DUPLICATE_EXPR
)
11060 return TREE_OPERAND (vec
, 0);
11062 else if (TREE_CODE (vec
) == VECTOR_CST
)
11064 if (VECTOR_CST_NPATTERNS (vec
) == 1 && VECTOR_CST_DUPLICATE_P (vec
))
11065 return VECTOR_CST_ENCODED_ELT (vec
, 0);
11069 else if (TREE_CODE (vec
) == CONSTRUCTOR
11070 && TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)).is_constant (&nelts
))
11072 first
= error_mark_node
;
11074 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11081 if (!operand_equal_p (first
, t
, 0))
11093 /* Build an empty statement at location LOC. */
11096 build_empty_stmt (location_t loc
)
11098 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11099 SET_EXPR_LOCATION (t
, loc
);
11104 /* Build an OpenMP clause with code CODE. LOC is the location of the
11108 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11113 length
= omp_clause_num_ops
[code
];
11114 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11116 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11118 t
= (tree
) ggc_internal_alloc (size
);
11119 memset (t
, 0, size
);
11120 TREE_SET_CODE (t
, OMP_CLAUSE
);
11121 OMP_CLAUSE_SET_CODE (t
, code
);
11122 OMP_CLAUSE_LOCATION (t
) = loc
;
11127 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11128 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11129 Except for the CODE and operand count field, other storage for the
11130 object is initialized to zeros. */
11133 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
11136 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11138 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11139 gcc_assert (len
>= 1);
11141 record_node_allocation_statistics (code
, length
);
11143 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11145 TREE_SET_CODE (t
, code
);
11147 /* Can't use TREE_OPERAND to store the length because if checking is
11148 enabled, it will try to check the length before we store it. :-P */
11149 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11154 /* Helper function for build_call_* functions; build a CALL_EXPR with
11155 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11156 the argument slots. */
11159 build_call_1 (tree return_type
, tree fn
, int nargs
)
11163 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11164 TREE_TYPE (t
) = return_type
;
11165 CALL_EXPR_FN (t
) = fn
;
11166 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11171 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11172 FN and a null static chain slot. NARGS is the number of call arguments
11173 which are specified as "..." arguments. */
11176 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11180 va_start (args
, nargs
);
11181 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11186 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11187 FN and a null static chain slot. NARGS is the number of call arguments
11188 which are specified as a va_list ARGS. */
11191 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11196 t
= build_call_1 (return_type
, fn
, nargs
);
11197 for (i
= 0; i
< nargs
; i
++)
11198 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11199 process_call_operands (t
);
11203 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11204 FN and a null static chain slot. NARGS is the number of call arguments
11205 which are specified as a tree array ARGS. */
11208 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11209 int nargs
, const tree
*args
)
11214 t
= build_call_1 (return_type
, fn
, nargs
);
11215 for (i
= 0; i
< nargs
; i
++)
11216 CALL_EXPR_ARG (t
, i
) = args
[i
];
11217 process_call_operands (t
);
11218 SET_EXPR_LOCATION (t
, loc
);
11222 /* Like build_call_array, but takes a vec. */
11225 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11230 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11231 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11232 CALL_EXPR_ARG (ret
, ix
) = t
;
11233 process_call_operands (ret
);
11237 /* Conveniently construct a function call expression. FNDECL names the
11238 function to be called and N arguments are passed in the array
11242 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11244 tree fntype
= TREE_TYPE (fndecl
);
11245 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11247 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11250 /* Conveniently construct a function call expression. FNDECL names the
11251 function to be called and the arguments are passed in the vector
11255 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11257 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11258 vec_safe_address (vec
));
11262 /* Conveniently construct a function call expression. FNDECL names the
11263 function to be called, N is the number of arguments, and the "..."
11264 parameters are the argument expressions. */
11267 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11270 tree
*argarray
= XALLOCAVEC (tree
, n
);
11274 for (i
= 0; i
< n
; i
++)
11275 argarray
[i
] = va_arg (ap
, tree
);
11277 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11280 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11281 varargs macros aren't supported by all bootstrap compilers. */
11284 build_call_expr (tree fndecl
, int n
, ...)
11287 tree
*argarray
= XALLOCAVEC (tree
, n
);
11291 for (i
= 0; i
< n
; i
++)
11292 argarray
[i
] = va_arg (ap
, tree
);
11294 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11297 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11298 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11299 It will get gimplified later into an ordinary internal function. */
11302 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11303 tree type
, int n
, const tree
*args
)
11305 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11306 for (int i
= 0; i
< n
; ++i
)
11307 CALL_EXPR_ARG (t
, i
) = args
[i
];
11308 SET_EXPR_LOCATION (t
, loc
);
11309 CALL_EXPR_IFN (t
) = ifn
;
11313 /* Build internal call expression. This is just like CALL_EXPR, except
11314 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11315 internal function. */
11318 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11319 tree type
, int n
, ...)
11322 tree
*argarray
= XALLOCAVEC (tree
, n
);
11326 for (i
= 0; i
< n
; i
++)
11327 argarray
[i
] = va_arg (ap
, tree
);
11329 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11332 /* Return a function call to FN, if the target is guaranteed to support it,
11335 N is the number of arguments, passed in the "...", and TYPE is the
11336 type of the return value. */
11339 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11343 tree
*argarray
= XALLOCAVEC (tree
, n
);
11347 for (i
= 0; i
< n
; i
++)
11348 argarray
[i
] = va_arg (ap
, tree
);
11350 if (internal_fn_p (fn
))
11352 internal_fn ifn
= as_internal_fn (fn
);
11353 if (direct_internal_fn_p (ifn
))
11355 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11356 if (!direct_internal_fn_supported_p (ifn
, types
,
11357 OPTIMIZE_FOR_BOTH
))
11360 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11364 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11367 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11371 /* Return a function call to the appropriate builtin alloca variant.
11373 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
11374 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
11375 bound for SIZE in case it is not a fixed value. */
11378 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
11382 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
11384 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
11386 else if (align
> 0)
11388 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
11389 return build_call_expr (t
, 2, size
, size_int (align
));
11393 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
11394 return build_call_expr (t
, 1, size
);
11398 /* Create a new constant string literal and return a char* pointer to it.
11399 The STRING_CST value is the LEN characters at STR. */
11401 build_string_literal (int len
, const char *str
)
11403 tree t
, elem
, index
, type
;
11405 t
= build_string (len
, str
);
11406 elem
= build_type_variant (char_type_node
, 1, 0);
11407 index
= build_index_type (size_int (len
- 1));
11408 type
= build_array_type (elem
, index
);
11409 TREE_TYPE (t
) = type
;
11410 TREE_CONSTANT (t
) = 1;
11411 TREE_READONLY (t
) = 1;
11412 TREE_STATIC (t
) = 1;
11414 type
= build_pointer_type (elem
);
11415 t
= build1 (ADDR_EXPR
, type
,
11416 build4 (ARRAY_REF
, elem
,
11417 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11423 /* Return true if T (assumed to be a DECL) must be assigned a memory
11427 needs_to_live_in_memory (const_tree t
)
11429 return (TREE_ADDRESSABLE (t
)
11430 || is_global_var (t
)
11431 || (TREE_CODE (t
) == RESULT_DECL
11432 && !DECL_BY_REFERENCE (t
)
11433 && aggregate_value_p (t
, current_function_decl
)));
11436 /* Return value of a constant X and sign-extend it. */
11439 int_cst_value (const_tree x
)
11441 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11442 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11444 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11445 gcc_assert (cst_and_fits_in_hwi (x
));
11447 if (bits
< HOST_BITS_PER_WIDE_INT
)
11449 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11451 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11453 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11459 /* If TYPE is an integral or pointer type, return an integer type with
11460 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11461 if TYPE is already an integer type of signedness UNSIGNEDP. */
11464 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11466 if (ANY_INTEGRAL_TYPE_P (type
) && TYPE_UNSIGNED (type
) == unsignedp
)
11469 if (TREE_CODE (type
) == VECTOR_TYPE
)
11471 tree inner
= TREE_TYPE (type
);
11472 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11475 if (inner
== inner2
)
11477 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11480 if (TREE_CODE (type
) == COMPLEX_TYPE
)
11482 tree inner
= TREE_TYPE (type
);
11483 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11486 if (inner
== inner2
)
11488 return build_complex_type (inner2
);
11491 if (!INTEGRAL_TYPE_P (type
)
11492 && !POINTER_TYPE_P (type
)
11493 && TREE_CODE (type
) != OFFSET_TYPE
)
11496 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11499 /* If TYPE is an integral or pointer type, return an integer type with
11500 the same precision which is unsigned, or itself if TYPE is already an
11501 unsigned integer type. */
11504 unsigned_type_for (tree type
)
11506 return signed_or_unsigned_type_for (1, type
);
11509 /* If TYPE is an integral or pointer type, return an integer type with
11510 the same precision which is signed, or itself if TYPE is already a
11511 signed integer type. */
11514 signed_type_for (tree type
)
11516 return signed_or_unsigned_type_for (0, type
);
11519 /* If TYPE is a vector type, return a signed integer vector type with the
11520 same width and number of subparts. Otherwise return boolean_type_node. */
11523 truth_type_for (tree type
)
11525 if (TREE_CODE (type
) == VECTOR_TYPE
)
11527 if (VECTOR_BOOLEAN_TYPE_P (type
))
11529 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11530 GET_MODE_SIZE (TYPE_MODE (type
)));
11533 return boolean_type_node
;
11536 /* Returns the largest value obtainable by casting something in INNER type to
11540 upper_bound_in_type (tree outer
, tree inner
)
11542 unsigned int det
= 0;
11543 unsigned oprec
= TYPE_PRECISION (outer
);
11544 unsigned iprec
= TYPE_PRECISION (inner
);
11547 /* Compute a unique number for every combination. */
11548 det
|= (oprec
> iprec
) ? 4 : 0;
11549 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11550 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11552 /* Determine the exponent to use. */
11557 /* oprec <= iprec, outer: signed, inner: don't care. */
11562 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11566 /* oprec > iprec, outer: signed, inner: signed. */
11570 /* oprec > iprec, outer: signed, inner: unsigned. */
11574 /* oprec > iprec, outer: unsigned, inner: signed. */
11578 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11582 gcc_unreachable ();
11585 return wide_int_to_tree (outer
,
11586 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11589 /* Returns the smallest value obtainable by casting something in INNER type to
11593 lower_bound_in_type (tree outer
, tree inner
)
11595 unsigned oprec
= TYPE_PRECISION (outer
);
11596 unsigned iprec
= TYPE_PRECISION (inner
);
11598 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11600 if (TYPE_UNSIGNED (outer
)
11601 /* If we are widening something of an unsigned type, OUTER type
11602 contains all values of INNER type. In particular, both INNER
11603 and OUTER types have zero in common. */
11604 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11605 return build_int_cst (outer
, 0);
11608 /* If we are widening a signed type to another signed type, we
11609 want to obtain -2^^(iprec-1). If we are keeping the
11610 precision or narrowing to a signed type, we want to obtain
11612 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11613 return wide_int_to_tree (outer
,
11614 wi::mask (prec
- 1, true,
11615 TYPE_PRECISION (outer
)));
11619 /* Return nonzero if two operands that are suitable for PHI nodes are
11620 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11621 SSA_NAME or invariant. Note that this is strictly an optimization.
11622 That is, callers of this function can directly call operand_equal_p
11623 and get the same result, only slower. */
11626 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11630 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11632 return operand_equal_p (arg0
, arg1
, 0);
11635 /* Returns number of zeros at the end of binary representation of X. */
11638 num_ending_zeros (const_tree x
)
11640 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11644 #define WALK_SUBTREE(NODE) \
11647 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11653 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11654 be walked whenever a type is seen in the tree. Rest of operands and return
11655 value are as for walk_tree. */
11658 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11659 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11661 tree result
= NULL_TREE
;
11663 switch (TREE_CODE (type
))
11666 case REFERENCE_TYPE
:
11668 /* We have to worry about mutually recursive pointers. These can't
11669 be written in C. They can in Ada. It's pathological, but
11670 there's an ACATS test (c38102a) that checks it. Deal with this
11671 by checking if we're pointing to another pointer, that one
11672 points to another pointer, that one does too, and we have no htab.
11673 If so, get a hash table. We check three levels deep to avoid
11674 the cost of the hash table if we don't need one. */
11675 if (POINTER_TYPE_P (TREE_TYPE (type
))
11676 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11677 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11680 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11691 WALK_SUBTREE (TREE_TYPE (type
));
11695 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11697 /* Fall through. */
11699 case FUNCTION_TYPE
:
11700 WALK_SUBTREE (TREE_TYPE (type
));
11704 /* We never want to walk into default arguments. */
11705 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11706 WALK_SUBTREE (TREE_VALUE (arg
));
11711 /* Don't follow this nodes's type if a pointer for fear that
11712 we'll have infinite recursion. If we have a PSET, then we
11715 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11716 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11717 WALK_SUBTREE (TREE_TYPE (type
));
11718 WALK_SUBTREE (TYPE_DOMAIN (type
));
11722 WALK_SUBTREE (TREE_TYPE (type
));
11723 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11733 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11734 called with the DATA and the address of each sub-tree. If FUNC returns a
11735 non-NULL value, the traversal is stopped, and the value returned by FUNC
11736 is returned. If PSET is non-NULL it is used to record the nodes visited,
11737 and to avoid visiting a node more than once. */
11740 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11741 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11743 enum tree_code code
;
11747 #define WALK_SUBTREE_TAIL(NODE) \
11751 goto tail_recurse; \
11756 /* Skip empty subtrees. */
11760 /* Don't walk the same tree twice, if the user has requested
11761 that we avoid doing so. */
11762 if (pset
&& pset
->add (*tp
))
11765 /* Call the function. */
11767 result
= (*func
) (tp
, &walk_subtrees
, data
);
11769 /* If we found something, return it. */
11773 code
= TREE_CODE (*tp
);
11775 /* Even if we didn't, FUNC may have decided that there was nothing
11776 interesting below this point in the tree. */
11777 if (!walk_subtrees
)
11779 /* But we still need to check our siblings. */
11780 if (code
== TREE_LIST
)
11781 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11782 else if (code
== OMP_CLAUSE
)
11783 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11790 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11791 if (result
|| !walk_subtrees
)
11798 case IDENTIFIER_NODE
:
11805 case PLACEHOLDER_EXPR
:
11809 /* None of these have subtrees other than those already walked
11814 WALK_SUBTREE (TREE_VALUE (*tp
));
11815 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11820 int len
= TREE_VEC_LENGTH (*tp
);
11825 /* Walk all elements but the first. */
11827 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11829 /* Now walk the first one as a tail call. */
11830 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11834 WALK_SUBTREE (TREE_REALPART (*tp
));
11835 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11839 unsigned HOST_WIDE_INT idx
;
11840 constructor_elt
*ce
;
11842 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11844 WALK_SUBTREE (ce
->value
);
11849 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11854 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11856 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11857 into declarations that are just mentioned, rather than
11858 declared; they don't really belong to this part of the tree.
11859 And, we can see cycles: the initializer for a declaration
11860 can refer to the declaration itself. */
11861 WALK_SUBTREE (DECL_INITIAL (decl
));
11862 WALK_SUBTREE (DECL_SIZE (decl
));
11863 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11865 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11868 case STATEMENT_LIST
:
11870 tree_stmt_iterator i
;
11871 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11872 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11877 switch (OMP_CLAUSE_CODE (*tp
))
11879 case OMP_CLAUSE_GANG
:
11880 case OMP_CLAUSE__GRIDDIM_
:
11881 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11884 case OMP_CLAUSE_ASYNC
:
11885 case OMP_CLAUSE_WAIT
:
11886 case OMP_CLAUSE_WORKER
:
11887 case OMP_CLAUSE_VECTOR
:
11888 case OMP_CLAUSE_NUM_GANGS
:
11889 case OMP_CLAUSE_NUM_WORKERS
:
11890 case OMP_CLAUSE_VECTOR_LENGTH
:
11891 case OMP_CLAUSE_PRIVATE
:
11892 case OMP_CLAUSE_SHARED
:
11893 case OMP_CLAUSE_FIRSTPRIVATE
:
11894 case OMP_CLAUSE_COPYIN
:
11895 case OMP_CLAUSE_COPYPRIVATE
:
11896 case OMP_CLAUSE_FINAL
:
11897 case OMP_CLAUSE_IF
:
11898 case OMP_CLAUSE_NUM_THREADS
:
11899 case OMP_CLAUSE_SCHEDULE
:
11900 case OMP_CLAUSE_UNIFORM
:
11901 case OMP_CLAUSE_DEPEND
:
11902 case OMP_CLAUSE_NONTEMPORAL
:
11903 case OMP_CLAUSE_NUM_TEAMS
:
11904 case OMP_CLAUSE_THREAD_LIMIT
:
11905 case OMP_CLAUSE_DEVICE
:
11906 case OMP_CLAUSE_DIST_SCHEDULE
:
11907 case OMP_CLAUSE_SAFELEN
:
11908 case OMP_CLAUSE_SIMDLEN
:
11909 case OMP_CLAUSE_ORDERED
:
11910 case OMP_CLAUSE_PRIORITY
:
11911 case OMP_CLAUSE_GRAINSIZE
:
11912 case OMP_CLAUSE_NUM_TASKS
:
11913 case OMP_CLAUSE_HINT
:
11914 case OMP_CLAUSE_TO_DECLARE
:
11915 case OMP_CLAUSE_LINK
:
11916 case OMP_CLAUSE_USE_DEVICE_PTR
:
11917 case OMP_CLAUSE_IS_DEVICE_PTR
:
11918 case OMP_CLAUSE__LOOPTEMP_
:
11919 case OMP_CLAUSE__REDUCTEMP_
:
11920 case OMP_CLAUSE__SIMDUID_
:
11921 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11924 case OMP_CLAUSE_INDEPENDENT
:
11925 case OMP_CLAUSE_NOWAIT
:
11926 case OMP_CLAUSE_DEFAULT
:
11927 case OMP_CLAUSE_UNTIED
:
11928 case OMP_CLAUSE_MERGEABLE
:
11929 case OMP_CLAUSE_PROC_BIND
:
11930 case OMP_CLAUSE_INBRANCH
:
11931 case OMP_CLAUSE_NOTINBRANCH
:
11932 case OMP_CLAUSE_FOR
:
11933 case OMP_CLAUSE_PARALLEL
:
11934 case OMP_CLAUSE_SECTIONS
:
11935 case OMP_CLAUSE_TASKGROUP
:
11936 case OMP_CLAUSE_NOGROUP
:
11937 case OMP_CLAUSE_THREADS
:
11938 case OMP_CLAUSE_SIMD
:
11939 case OMP_CLAUSE_DEFAULTMAP
:
11940 case OMP_CLAUSE_AUTO
:
11941 case OMP_CLAUSE_SEQ
:
11942 case OMP_CLAUSE_TILE
:
11943 case OMP_CLAUSE__SIMT_
:
11944 case OMP_CLAUSE_IF_PRESENT
:
11945 case OMP_CLAUSE_FINALIZE
:
11946 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11948 case OMP_CLAUSE_LASTPRIVATE
:
11949 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11950 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11951 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11953 case OMP_CLAUSE_COLLAPSE
:
11956 for (i
= 0; i
< 3; i
++)
11957 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11958 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11961 case OMP_CLAUSE_LINEAR
:
11962 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11963 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11964 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11965 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11967 case OMP_CLAUSE_ALIGNED
:
11968 case OMP_CLAUSE_FROM
:
11969 case OMP_CLAUSE_TO
:
11970 case OMP_CLAUSE_MAP
:
11971 case OMP_CLAUSE__CACHE_
:
11972 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11973 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11974 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11976 case OMP_CLAUSE_REDUCTION
:
11977 case OMP_CLAUSE_TASK_REDUCTION
:
11978 case OMP_CLAUSE_IN_REDUCTION
:
11981 for (i
= 0; i
< 5; i
++)
11982 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11983 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11987 gcc_unreachable ();
11995 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11996 But, we only want to walk once. */
11997 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11998 for (i
= 0; i
< len
; ++i
)
11999 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12000 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
12004 /* If this is a TYPE_DECL, walk into the fields of the type that it's
12005 defining. We only want to walk into these fields of a type in this
12006 case and not in the general case of a mere reference to the type.
12008 The criterion is as follows: if the field can be an expression, it
12009 must be walked only here. This should be in keeping with the fields
12010 that are directly gimplified in gimplify_type_sizes in order for the
12011 mark/copy-if-shared/unmark machinery of the gimplifier to work with
12012 variable-sized types.
12014 Note that DECLs get walked as part of processing the BIND_EXPR. */
12015 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
12017 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
12018 if (TREE_CODE (*type_p
) == ERROR_MARK
)
12021 /* Call the function for the type. See if it returns anything or
12022 doesn't want us to continue. If we are to continue, walk both
12023 the normal fields and those for the declaration case. */
12024 result
= (*func
) (type_p
, &walk_subtrees
, data
);
12025 if (result
|| !walk_subtrees
)
12028 /* But do not walk a pointed-to type since it may itself need to
12029 be walked in the declaration case if it isn't anonymous. */
12030 if (!POINTER_TYPE_P (*type_p
))
12032 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
12037 /* If this is a record type, also walk the fields. */
12038 if (RECORD_OR_UNION_TYPE_P (*type_p
))
12042 for (field
= TYPE_FIELDS (*type_p
); field
;
12043 field
= DECL_CHAIN (field
))
12045 /* We'd like to look at the type of the field, but we can
12046 easily get infinite recursion. So assume it's pointed
12047 to elsewhere in the tree. Also, ignore things that
12049 if (TREE_CODE (field
) != FIELD_DECL
)
12052 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
12053 WALK_SUBTREE (DECL_SIZE (field
));
12054 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
12055 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
12056 WALK_SUBTREE (DECL_QUALIFIER (field
));
12060 /* Same for scalar types. */
12061 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
12062 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
12063 || TREE_CODE (*type_p
) == INTEGER_TYPE
12064 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
12065 || TREE_CODE (*type_p
) == REAL_TYPE
)
12067 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
12068 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12071 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12072 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12077 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12081 /* Walk over all the sub-trees of this operand. */
12082 len
= TREE_OPERAND_LENGTH (*tp
);
12084 /* Go through the subtrees. We need to do this in forward order so
12085 that the scope of a FOR_EXPR is handled properly. */
12088 for (i
= 0; i
< len
- 1; ++i
)
12089 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12090 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12093 /* If this is a type, walk the needed fields in the type. */
12094 else if (TYPE_P (*tp
))
12095 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12099 /* We didn't find what we were looking for. */
12102 #undef WALK_SUBTREE_TAIL
12104 #undef WALK_SUBTREE
12106 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12109 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12114 hash_set
<tree
> pset
;
12115 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12121 tree_block (tree t
)
12123 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12125 if (IS_EXPR_CODE_CLASS (c
))
12126 return LOCATION_BLOCK (t
->exp
.locus
);
12127 gcc_unreachable ();
12132 tree_set_block (tree t
, tree b
)
12134 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12136 if (IS_EXPR_CODE_CLASS (c
))
12138 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12141 gcc_unreachable ();
12144 /* Create a nameless artificial label and put it in the current
12145 function context. The label has a location of LOC. Returns the
12146 newly created label. */
12149 create_artificial_label (location_t loc
)
12151 tree lab
= build_decl (loc
,
12152 LABEL_DECL
, NULL_TREE
, void_type_node
);
12154 DECL_ARTIFICIAL (lab
) = 1;
12155 DECL_IGNORED_P (lab
) = 1;
12156 DECL_CONTEXT (lab
) = current_function_decl
;
12160 /* Given a tree, try to return a useful variable name that we can use
12161 to prefix a temporary that is being assigned the value of the tree.
12162 I.E. given <temp> = &A, return A. */
12167 tree stripped_decl
;
12170 STRIP_NOPS (stripped_decl
);
12171 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12172 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12173 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12175 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12178 return IDENTIFIER_POINTER (name
);
12182 switch (TREE_CODE (stripped_decl
))
12185 return get_name (TREE_OPERAND (stripped_decl
, 0));
12192 /* Return true if TYPE has a variable argument list. */
12195 stdarg_p (const_tree fntype
)
12197 function_args_iterator args_iter
;
12198 tree n
= NULL_TREE
, t
;
12203 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12208 return n
!= NULL_TREE
&& n
!= void_type_node
;
12211 /* Return true if TYPE has a prototype. */
12214 prototype_p (const_tree fntype
)
12218 gcc_assert (fntype
!= NULL_TREE
);
12220 t
= TYPE_ARG_TYPES (fntype
);
12221 return (t
!= NULL_TREE
);
12224 /* If BLOCK is inlined from an __attribute__((__artificial__))
12225 routine, return pointer to location from where it has been
12228 block_nonartificial_location (tree block
)
12230 location_t
*ret
= NULL
;
12232 while (block
&& TREE_CODE (block
) == BLOCK
12233 && BLOCK_ABSTRACT_ORIGIN (block
))
12235 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12236 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12238 /* If AO is an artificial inline, point RET to the
12239 call site locus at which it has been inlined and continue
12240 the loop, in case AO's caller is also an artificial
12242 if (DECL_DECLARED_INLINE_P (ao
)
12243 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12244 ret
= &BLOCK_SOURCE_LOCATION (block
);
12248 else if (TREE_CODE (ao
) != BLOCK
)
12251 block
= BLOCK_SUPERCONTEXT (block
);
12257 /* If EXP is inlined from an __attribute__((__artificial__))
12258 function, return the location of the original call expression. */
12261 tree_nonartificial_location (tree exp
)
12263 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12268 return EXPR_LOCATION (exp
);
12272 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12275 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12278 cl_option_hasher::hash (tree x
)
12280 const_tree
const t
= x
;
12284 hashval_t hash
= 0;
12286 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12288 p
= (const char *)TREE_OPTIMIZATION (t
);
12289 len
= sizeof (struct cl_optimization
);
12292 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12293 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12296 gcc_unreachable ();
12298 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12300 for (i
= 0; i
< len
; i
++)
12302 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12307 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12308 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12312 cl_option_hasher::equal (tree x
, tree y
)
12314 const_tree
const xt
= x
;
12315 const_tree
const yt
= y
;
12317 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12320 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12321 return cl_optimization_option_eq (TREE_OPTIMIZATION (xt
),
12322 TREE_OPTIMIZATION (yt
));
12323 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12324 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12325 TREE_TARGET_OPTION (yt
));
12327 gcc_unreachable ();
12330 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12333 build_optimization_node (struct gcc_options
*opts
)
12337 /* Use the cache of optimization nodes. */
12339 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12342 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12346 /* Insert this one into the hash table. */
12347 t
= cl_optimization_node
;
12350 /* Make a new node for next time round. */
12351 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12357 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12360 build_target_option_node (struct gcc_options
*opts
)
12364 /* Use the cache of optimization nodes. */
12366 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12369 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12373 /* Insert this one into the hash table. */
12374 t
= cl_target_option_node
;
12377 /* Make a new node for next time round. */
12378 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12384 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12385 so that they aren't saved during PCH writing. */
12388 prepare_target_option_nodes_for_pch (void)
12390 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12391 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12392 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12393 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12396 /* Determine the "ultimate origin" of a block. */
12399 block_ultimate_origin (const_tree block
)
12401 tree origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12403 if (origin
== NULL_TREE
)
12407 gcc_checking_assert ((DECL_P (origin
)
12408 && DECL_ORIGIN (origin
) == origin
)
12409 || BLOCK_ORIGIN (origin
) == origin
);
12414 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12418 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12420 /* Do not strip casts into or out of differing address spaces. */
12421 if (POINTER_TYPE_P (outer_type
)
12422 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12424 if (!POINTER_TYPE_P (inner_type
)
12425 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12426 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12429 else if (POINTER_TYPE_P (inner_type
)
12430 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12432 /* We already know that outer_type is not a pointer with
12433 a non-generic address space. */
12437 /* Use precision rather then machine mode when we can, which gives
12438 the correct answer even for submode (bit-field) types. */
12439 if ((INTEGRAL_TYPE_P (outer_type
)
12440 || POINTER_TYPE_P (outer_type
)
12441 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12442 && (INTEGRAL_TYPE_P (inner_type
)
12443 || POINTER_TYPE_P (inner_type
)
12444 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12445 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12447 /* Otherwise fall back on comparing machine modes (e.g. for
12448 aggregate types, floats). */
12449 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12452 /* Return true iff conversion in EXP generates no instruction. Mark
12453 it inline so that we fully inline into the stripping functions even
12454 though we have two uses of this function. */
12457 tree_nop_conversion (const_tree exp
)
12459 tree outer_type
, inner_type
;
12461 if (location_wrapper_p (exp
))
12463 if (!CONVERT_EXPR_P (exp
)
12464 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12466 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12469 outer_type
= TREE_TYPE (exp
);
12470 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12475 return tree_nop_conversion_p (outer_type
, inner_type
);
12478 /* Return true iff conversion in EXP generates no instruction. Don't
12479 consider conversions changing the signedness. */
12482 tree_sign_nop_conversion (const_tree exp
)
12484 tree outer_type
, inner_type
;
12486 if (!tree_nop_conversion (exp
))
12489 outer_type
= TREE_TYPE (exp
);
12490 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12492 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12493 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12496 /* Strip conversions from EXP according to tree_nop_conversion and
12497 return the resulting expression. */
12500 tree_strip_nop_conversions (tree exp
)
12502 while (tree_nop_conversion (exp
))
12503 exp
= TREE_OPERAND (exp
, 0);
12507 /* Strip conversions from EXP according to tree_sign_nop_conversion
12508 and return the resulting expression. */
12511 tree_strip_sign_nop_conversions (tree exp
)
12513 while (tree_sign_nop_conversion (exp
))
12514 exp
= TREE_OPERAND (exp
, 0);
12518 /* Avoid any floating point extensions from EXP. */
12520 strip_float_extensions (tree exp
)
12522 tree sub
, expt
, subt
;
12524 /* For floating point constant look up the narrowest type that can hold
12525 it properly and handle it like (type)(narrowest_type)constant.
12526 This way we can optimize for instance a=a*2.0 where "a" is float
12527 but 2.0 is double constant. */
12528 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12530 REAL_VALUE_TYPE orig
;
12533 orig
= TREE_REAL_CST (exp
);
12534 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12535 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12536 type
= float_type_node
;
12537 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12538 > TYPE_PRECISION (double_type_node
)
12539 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12540 type
= double_type_node
;
12542 return build_real_truncate (type
, orig
);
12545 if (!CONVERT_EXPR_P (exp
))
12548 sub
= TREE_OPERAND (exp
, 0);
12549 subt
= TREE_TYPE (sub
);
12550 expt
= TREE_TYPE (exp
);
12552 if (!FLOAT_TYPE_P (subt
))
12555 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12558 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12561 return strip_float_extensions (sub
);
12564 /* Strip out all handled components that produce invariant
12568 strip_invariant_refs (const_tree op
)
12570 while (handled_component_p (op
))
12572 switch (TREE_CODE (op
))
12575 case ARRAY_RANGE_REF
:
12576 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12577 || TREE_OPERAND (op
, 2) != NULL_TREE
12578 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12582 case COMPONENT_REF
:
12583 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12589 op
= TREE_OPERAND (op
, 0);
12595 static GTY(()) tree gcc_eh_personality_decl
;
12597 /* Return the GCC personality function decl. */
12600 lhd_gcc_personality (void)
12602 if (!gcc_eh_personality_decl
)
12603 gcc_eh_personality_decl
= build_personality_function ("gcc");
12604 return gcc_eh_personality_decl
;
12607 /* TARGET is a call target of GIMPLE call statement
12608 (obtained by gimple_call_fn). Return true if it is
12609 OBJ_TYPE_REF representing an virtual call of C++ method.
12610 (As opposed to OBJ_TYPE_REF representing objc calls
12611 through a cast where middle-end devirtualization machinery
12615 virtual_method_call_p (const_tree target
)
12617 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12619 tree t
= TREE_TYPE (target
);
12620 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12622 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12624 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12625 /* If we do not have BINFO associated, it means that type was built
12626 without devirtualization enabled. Do not consider this a virtual
12628 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12633 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12636 obj_type_ref_class (const_tree ref
)
12638 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12639 ref
= TREE_TYPE (ref
);
12640 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12641 ref
= TREE_TYPE (ref
);
12642 /* We look for type THIS points to. ObjC also builds
12643 OBJ_TYPE_REF with non-method calls, Their first parameter
12644 ID however also corresponds to class type. */
12645 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12646 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12647 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12648 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12649 return TREE_TYPE (ref
);
12652 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12655 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12658 tree base_binfo
, b
;
12660 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12661 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12662 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12664 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12669 /* Try to find a base info of BINFO that would have its field decl at offset
12670 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12671 found, return, otherwise return NULL_TREE. */
12674 get_binfo_at_offset (tree binfo
, poly_int64 offset
, tree expected_type
)
12676 tree type
= BINFO_TYPE (binfo
);
12680 HOST_WIDE_INT pos
, size
;
12684 if (types_same_for_odr (type
, expected_type
))
12686 if (maybe_lt (offset
, 0))
12689 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12691 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12694 pos
= int_bit_position (fld
);
12695 size
= tree_to_uhwi (DECL_SIZE (fld
));
12696 if (known_in_range_p (offset
, pos
, size
))
12699 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12702 /* Offset 0 indicates the primary base, whose vtable contents are
12703 represented in the binfo for the derived class. */
12704 else if (maybe_ne (offset
, 0))
12706 tree found_binfo
= NULL
, base_binfo
;
12707 /* Offsets in BINFO are in bytes relative to the whole structure
12708 while POS is in bits relative to the containing field. */
12709 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12712 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12713 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12714 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12716 found_binfo
= base_binfo
;
12720 binfo
= found_binfo
;
12722 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12726 type
= TREE_TYPE (fld
);
12731 /* Returns true if X is a typedef decl. */
12734 is_typedef_decl (const_tree x
)
12736 return (x
&& TREE_CODE (x
) == TYPE_DECL
12737 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12740 /* Returns true iff TYPE is a type variant created for a typedef. */
12743 typedef_variant_p (const_tree type
)
12745 return is_typedef_decl (TYPE_NAME (type
));
12748 /* A class to handle converting a string that might contain
12749 control characters, (eg newline, form-feed, etc), into one
12750 in which contains escape sequences instead. */
12752 class escaped_string
12755 escaped_string () { m_owned
= false; m_str
= NULL
; };
12756 ~escaped_string () { if (m_owned
) free (m_str
); }
12757 operator const char *() const { return (const char *) m_str
; }
12758 void escape (const char *);
12764 /* PR 84195: Replace control characters in "unescaped" with their
12765 escaped equivalents. Allow newlines if -fmessage-length has
12766 been set to a non-zero value. This is done here, rather than
12767 where the attribute is recorded as the message length can
12768 change between these two locations. */
12771 escaped_string::escape (const char *unescaped
)
12774 size_t i
, new_i
, len
;
12779 m_str
= const_cast<char *> (unescaped
);
12782 if (unescaped
== NULL
|| *unescaped
== 0)
12785 len
= strlen (unescaped
);
12789 for (i
= 0; i
< len
; i
++)
12791 char c
= unescaped
[i
];
12796 escaped
[new_i
++] = c
;
12800 if (c
!= '\n' || !pp_is_wrapping_line (global_dc
->printer
))
12802 if (escaped
== NULL
)
12804 /* We only allocate space for a new string if we
12805 actually encounter a control character that
12806 needs replacing. */
12807 escaped
= (char *) xmalloc (len
* 2 + 1);
12808 strncpy (escaped
, unescaped
, i
);
12812 escaped
[new_i
++] = '\\';
12816 case '\a': escaped
[new_i
++] = 'a'; break;
12817 case '\b': escaped
[new_i
++] = 'b'; break;
12818 case '\f': escaped
[new_i
++] = 'f'; break;
12819 case '\n': escaped
[new_i
++] = 'n'; break;
12820 case '\r': escaped
[new_i
++] = 'r'; break;
12821 case '\t': escaped
[new_i
++] = 't'; break;
12822 case '\v': escaped
[new_i
++] = 'v'; break;
12823 default: escaped
[new_i
++] = '?'; break;
12827 escaped
[new_i
++] = c
;
12832 escaped
[new_i
] = 0;
12838 /* Warn about a use of an identifier which was marked deprecated. Returns
12839 whether a warning was given. */
12842 warn_deprecated_use (tree node
, tree attr
)
12844 escaped_string msg
;
12846 if (node
== 0 || !warn_deprecated_decl
)
12852 attr
= DECL_ATTRIBUTES (node
);
12853 else if (TYPE_P (node
))
12855 tree decl
= TYPE_STUB_DECL (node
);
12857 attr
= lookup_attribute ("deprecated",
12858 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12863 attr
= lookup_attribute ("deprecated", attr
);
12866 msg
.escape (TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
))));
12871 auto_diagnostic_group d
;
12873 w
= warning (OPT_Wdeprecated_declarations
,
12874 "%qD is deprecated: %s", node
, (const char *) msg
);
12876 w
= warning (OPT_Wdeprecated_declarations
,
12877 "%qD is deprecated", node
);
12879 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12881 else if (TYPE_P (node
))
12883 tree what
= NULL_TREE
;
12884 tree decl
= TYPE_STUB_DECL (node
);
12886 if (TYPE_NAME (node
))
12888 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12889 what
= TYPE_NAME (node
);
12890 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12891 && DECL_NAME (TYPE_NAME (node
)))
12892 what
= DECL_NAME (TYPE_NAME (node
));
12895 auto_diagnostic_group d
;
12899 w
= warning (OPT_Wdeprecated_declarations
,
12900 "%qE is deprecated: %s", what
, (const char *) msg
);
12902 w
= warning (OPT_Wdeprecated_declarations
,
12903 "%qE is deprecated", what
);
12908 w
= warning (OPT_Wdeprecated_declarations
,
12909 "type is deprecated: %s", (const char *) msg
);
12911 w
= warning (OPT_Wdeprecated_declarations
,
12912 "type is deprecated");
12916 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12922 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12923 somewhere in it. */
12926 contains_bitfld_component_ref_p (const_tree ref
)
12928 while (handled_component_p (ref
))
12930 if (TREE_CODE (ref
) == COMPONENT_REF
12931 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12933 ref
= TREE_OPERAND (ref
, 0);
12939 /* Try to determine whether a TRY_CATCH expression can fall through.
12940 This is a subroutine of block_may_fallthru. */
12943 try_catch_may_fallthru (const_tree stmt
)
12945 tree_stmt_iterator i
;
12947 /* If the TRY block can fall through, the whole TRY_CATCH can
12949 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12952 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12953 switch (TREE_CODE (tsi_stmt (i
)))
12956 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12957 catch expression and a body. The whole TRY_CATCH may fall
12958 through iff any of the catch bodies falls through. */
12959 for (; !tsi_end_p (i
); tsi_next (&i
))
12961 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12966 case EH_FILTER_EXPR
:
12967 /* The exception filter expression only matters if there is an
12968 exception. If the exception does not match EH_FILTER_TYPES,
12969 we will execute EH_FILTER_FAILURE, and we will fall through
12970 if that falls through. If the exception does match
12971 EH_FILTER_TYPES, the stack unwinder will continue up the
12972 stack, so we will not fall through. We don't know whether we
12973 will throw an exception which matches EH_FILTER_TYPES or not,
12974 so we just ignore EH_FILTER_TYPES and assume that we might
12975 throw an exception which doesn't match. */
12976 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12979 /* This case represents statements to be executed when an
12980 exception occurs. Those statements are implicitly followed
12981 by a RESX statement to resume execution after the exception.
12982 So in this case the TRY_CATCH never falls through. */
12987 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12988 need not be 100% accurate; simply be conservative and return true if we
12989 don't know. This is used only to avoid stupidly generating extra code.
12990 If we're wrong, we'll just delete the extra code later. */
12993 block_may_fallthru (const_tree block
)
12995 /* This CONST_CAST is okay because expr_last returns its argument
12996 unmodified and we assign it to a const_tree. */
12997 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12999 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
13003 /* Easy cases. If the last statement of the block implies
13004 control transfer, then we can't fall through. */
13008 /* If there is a default: label or case labels cover all possible
13009 SWITCH_COND values, then the SWITCH_EXPR will transfer control
13010 to some case label in all cases and all we care is whether the
13011 SWITCH_BODY falls through. */
13012 if (SWITCH_ALL_CASES_P (stmt
))
13013 return block_may_fallthru (SWITCH_BODY (stmt
));
13017 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
13019 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
13022 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
13024 case TRY_CATCH_EXPR
:
13025 return try_catch_may_fallthru (stmt
);
13027 case TRY_FINALLY_EXPR
:
13028 /* The finally clause is always executed after the try clause,
13029 so if it does not fall through, then the try-finally will not
13030 fall through. Otherwise, if the try clause does not fall
13031 through, then when the finally clause falls through it will
13032 resume execution wherever the try clause was going. So the
13033 whole try-finally will only fall through if both the try
13034 clause and the finally clause fall through. */
13035 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
13036 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
13039 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
13040 stmt
= TREE_OPERAND (stmt
, 1);
13046 /* Functions that do not return do not fall through. */
13047 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
13049 case CLEANUP_POINT_EXPR
:
13050 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
13053 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
13059 return lang_hooks
.block_may_fallthru (stmt
);
13063 /* True if we are using EH to handle cleanups. */
13064 static bool using_eh_for_cleanups_flag
= false;
13066 /* This routine is called from front ends to indicate eh should be used for
13069 using_eh_for_cleanups (void)
13071 using_eh_for_cleanups_flag
= true;
13074 /* Query whether EH is used for cleanups. */
13076 using_eh_for_cleanups_p (void)
13078 return using_eh_for_cleanups_flag
;
13081 /* Wrapper for tree_code_name to ensure that tree code is valid */
13083 get_tree_code_name (enum tree_code code
)
13085 const char *invalid
= "<invalid tree code>";
13087 if (code
>= MAX_TREE_CODES
)
13090 return tree_code_name
[code
];
13093 /* Drops the TREE_OVERFLOW flag from T. */
13096 drop_tree_overflow (tree t
)
13098 gcc_checking_assert (TREE_OVERFLOW (t
));
13100 /* For tree codes with a sharing machinery re-build the result. */
13101 if (poly_int_tree_p (t
))
13102 return wide_int_to_tree (TREE_TYPE (t
), wi::to_poly_wide (t
));
13104 /* For VECTOR_CST, remove the overflow bits from the encoded elements
13105 and canonicalize the result. */
13106 if (TREE_CODE (t
) == VECTOR_CST
)
13108 tree_vector_builder builder
;
13109 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
13110 unsigned int count
= builder
.encoded_nelts ();
13111 for (unsigned int i
= 0; i
< count
; ++i
)
13113 tree elt
= VECTOR_CST_ELT (t
, i
);
13114 if (TREE_OVERFLOW (elt
))
13115 elt
= drop_tree_overflow (elt
);
13116 builder
.quick_push (elt
);
13118 return builder
.build ();
13121 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13122 and drop the flag. */
13124 TREE_OVERFLOW (t
) = 0;
13126 /* For constants that contain nested constants, drop the flag
13127 from those as well. */
13128 if (TREE_CODE (t
) == COMPLEX_CST
)
13130 if (TREE_OVERFLOW (TREE_REALPART (t
)))
13131 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
13132 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
13133 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
13139 /* Given a memory reference expression T, return its base address.
13140 The base address of a memory reference expression is the main
13141 object being referenced. For instance, the base address for
13142 'array[i].fld[j]' is 'array'. You can think of this as stripping
13143 away the offset part from a memory address.
13145 This function calls handled_component_p to strip away all the inner
13146 parts of the memory reference until it reaches the base object. */
13149 get_base_address (tree t
)
13151 while (handled_component_p (t
))
13152 t
= TREE_OPERAND (t
, 0);
13154 if ((TREE_CODE (t
) == MEM_REF
13155 || TREE_CODE (t
) == TARGET_MEM_REF
)
13156 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13157 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13159 /* ??? Either the alias oracle or all callers need to properly deal
13160 with WITH_SIZE_EXPRs before we can look through those. */
13161 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13167 /* Return a tree of sizetype representing the size, in bytes, of the element
13168 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13171 array_ref_element_size (tree exp
)
13173 tree aligned_size
= TREE_OPERAND (exp
, 3);
13174 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13175 location_t loc
= EXPR_LOCATION (exp
);
13177 /* If a size was specified in the ARRAY_REF, it's the size measured
13178 in alignment units of the element type. So multiply by that value. */
13181 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13182 sizetype from another type of the same width and signedness. */
13183 if (TREE_TYPE (aligned_size
) != sizetype
)
13184 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13185 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13186 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13189 /* Otherwise, take the size from that of the element type. Substitute
13190 any PLACEHOLDER_EXPR that we have. */
13192 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13195 /* Return a tree representing the lower bound of the array mentioned in
13196 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13199 array_ref_low_bound (tree exp
)
13201 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13203 /* If a lower bound is specified in EXP, use it. */
13204 if (TREE_OPERAND (exp
, 2))
13205 return TREE_OPERAND (exp
, 2);
13207 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13208 substituting for a PLACEHOLDER_EXPR as needed. */
13209 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13210 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13212 /* Otherwise, return a zero of the appropriate type. */
13213 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13216 /* Return a tree representing the upper bound of the array mentioned in
13217 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13220 array_ref_up_bound (tree exp
)
13222 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13224 /* If there is a domain type and it has an upper bound, use it, substituting
13225 for a PLACEHOLDER_EXPR as needed. */
13226 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13227 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13229 /* Otherwise fail. */
13233 /* Returns true if REF is an array reference or a component reference
13234 to an array at the end of a structure.
13235 If this is the case, the array may be allocated larger
13236 than its upper bound implies. */
13239 array_at_struct_end_p (tree ref
)
13243 if (TREE_CODE (ref
) == ARRAY_REF
13244 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13246 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
13247 ref
= TREE_OPERAND (ref
, 0);
13249 else if (TREE_CODE (ref
) == COMPONENT_REF
13250 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
13251 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
13255 if (TREE_CODE (ref
) == STRING_CST
)
13258 tree ref_to_array
= ref
;
13259 while (handled_component_p (ref
))
13261 /* If the reference chain contains a component reference to a
13262 non-union type and there follows another field the reference
13263 is not at the end of a structure. */
13264 if (TREE_CODE (ref
) == COMPONENT_REF
)
13266 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13268 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13269 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13270 nextf
= DECL_CHAIN (nextf
);
13275 /* If we have a multi-dimensional array we do not consider
13276 a non-innermost dimension as flex array if the whole
13277 multi-dimensional array is at struct end.
13278 Same for an array of aggregates with a trailing array
13280 else if (TREE_CODE (ref
) == ARRAY_REF
)
13282 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
13284 /* If we view an underlying object as sth else then what we
13285 gathered up to now is what we have to rely on. */
13286 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
13289 gcc_unreachable ();
13291 ref
= TREE_OPERAND (ref
, 0);
13294 /* The array now is at struct end. Treat flexible arrays as
13295 always subject to extend, even into just padding constrained by
13296 an underlying decl. */
13297 if (! TYPE_SIZE (atype
)
13298 || ! TYPE_DOMAIN (atype
)
13299 || ! TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13302 if (TREE_CODE (ref
) == MEM_REF
13303 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13304 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13306 /* If the reference is based on a declared entity, the size of the array
13307 is constrained by its given domain. (Do not trust commons PR/69368). */
13309 && !(flag_unconstrained_commons
13310 && VAR_P (ref
) && DECL_COMMON (ref
))
13311 && DECL_SIZE_UNIT (ref
)
13312 && TREE_CODE (DECL_SIZE_UNIT (ref
)) == INTEGER_CST
)
13314 /* Check whether the array domain covers all of the available
13317 if (TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (atype
))) != INTEGER_CST
13318 || TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
13319 || TREE_CODE (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
))) != INTEGER_CST
)
13321 if (! get_addr_base_and_unit_offset (ref_to_array
, &offset
))
13324 /* If at least one extra element fits it is a flexarray. */
13325 if (known_le ((wi::to_offset (TYPE_MAX_VALUE (TYPE_DOMAIN (atype
)))
13326 - wi::to_offset (TYPE_MIN_VALUE (TYPE_DOMAIN (atype
)))
13328 * wi::to_offset (TYPE_SIZE_UNIT (TREE_TYPE (atype
))),
13329 wi::to_offset (DECL_SIZE_UNIT (ref
)) - offset
))
13338 /* Return a tree representing the offset, in bytes, of the field referenced
13339 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13342 component_ref_field_offset (tree exp
)
13344 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13345 tree field
= TREE_OPERAND (exp
, 1);
13346 location_t loc
= EXPR_LOCATION (exp
);
13348 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13349 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13351 if (aligned_offset
)
13353 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13354 sizetype from another type of the same width and signedness. */
13355 if (TREE_TYPE (aligned_offset
) != sizetype
)
13356 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13357 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13358 size_int (DECL_OFFSET_ALIGN (field
)
13362 /* Otherwise, take the offset from that of the field. Substitute
13363 any PLACEHOLDER_EXPR that we have. */
13365 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13368 /* Return the machine mode of T. For vectors, returns the mode of the
13369 inner type. The main use case is to feed the result to HONOR_NANS,
13370 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13373 element_mode (const_tree t
)
13377 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13379 return TYPE_MODE (t
);
13382 /* Vector types need to re-check the target flags each time we report
13383 the machine mode. We need to do this because attribute target can
13384 change the result of vector_mode_supported_p and have_regs_of_mode
13385 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
13386 change on a per-function basis. */
13387 /* ??? Possibly a better solution is to run through all the types
13388 referenced by a function and re-compute the TYPE_MODE once, rather
13389 than make the TYPE_MODE macro call a function. */
13392 vector_type_mode (const_tree t
)
13396 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
13398 mode
= t
->type_common
.mode
;
13399 if (VECTOR_MODE_P (mode
)
13400 && (!targetm
.vector_mode_supported_p (mode
)
13401 || !have_regs_of_mode
[mode
]))
13403 scalar_int_mode innermode
;
13405 /* For integers, try mapping it to a same-sized scalar mode. */
13406 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
13408 poly_int64 size
= (TYPE_VECTOR_SUBPARTS (t
)
13409 * GET_MODE_BITSIZE (innermode
));
13410 scalar_int_mode mode
;
13411 if (int_mode_for_size (size
, 0).exists (&mode
)
13412 && have_regs_of_mode
[mode
])
13422 /* Verify that basic properties of T match TV and thus T can be a variant of
13423 TV. TV should be the more specified variant (i.e. the main variant). */
13426 verify_type_variant (const_tree t
, tree tv
)
13428 /* Type variant can differ by:
13430 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13431 ENCODE_QUAL_ADDR_SPACE.
13432 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13433 in this case some values may not be set in the variant types
13434 (see TYPE_COMPLETE_P checks).
13435 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13436 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13437 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13438 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13439 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13440 this is necessary to make it possible to merge types form different TUs
13441 - arrays, pointers and references may have TREE_TYPE that is a variant
13442 of TREE_TYPE of their main variants.
13443 - aggregates may have new TYPE_FIELDS list that list variants of
13444 the main variant TYPE_FIELDS.
13445 - vector types may differ by TYPE_VECTOR_OPAQUE
13448 /* Convenience macro for matching individual fields. */
13449 #define verify_variant_match(flag) \
13451 if (flag (tv) != flag (t)) \
13453 error ("type variant differs by %s", #flag); \
13459 /* tree_base checks. */
13461 verify_variant_match (TREE_CODE
);
13462 /* FIXME: Ada builds non-artificial variants of artificial types. */
13463 if (TYPE_ARTIFICIAL (tv
) && 0)
13464 verify_variant_match (TYPE_ARTIFICIAL
);
13465 if (POINTER_TYPE_P (tv
))
13466 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13467 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13468 verify_variant_match (TYPE_UNSIGNED
);
13469 verify_variant_match (TYPE_PACKED
);
13470 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13471 verify_variant_match (TYPE_REF_IS_RVALUE
);
13472 if (AGGREGATE_TYPE_P (t
))
13473 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13475 verify_variant_match (TYPE_SATURATING
);
13476 /* FIXME: This check trigger during libstdc++ build. */
13477 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13478 verify_variant_match (TYPE_FINAL_P
);
13480 /* tree_type_common checks. */
13482 if (COMPLETE_TYPE_P (t
))
13484 verify_variant_match (TYPE_MODE
);
13485 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13486 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13487 verify_variant_match (TYPE_SIZE
);
13488 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13489 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13490 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
13492 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
13493 TYPE_SIZE_UNIT (tv
), 0));
13494 error ("type variant has different TYPE_SIZE_UNIT");
13496 error ("type variant's TYPE_SIZE_UNIT");
13497 debug_tree (TYPE_SIZE_UNIT (tv
));
13498 error ("type's TYPE_SIZE_UNIT");
13499 debug_tree (TYPE_SIZE_UNIT (t
));
13503 verify_variant_match (TYPE_PRECISION
);
13504 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13505 if (RECORD_OR_UNION_TYPE_P (t
))
13506 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13507 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13508 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13509 /* During LTO we merge variant lists from diferent translation units
13510 that may differ BY TYPE_CONTEXT that in turn may point
13511 to TRANSLATION_UNIT_DECL.
13512 Ada also builds variants of types with different TYPE_CONTEXT. */
13513 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13514 verify_variant_match (TYPE_CONTEXT
);
13515 verify_variant_match (TYPE_STRING_FLAG
);
13516 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13518 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13523 /* tree_type_non_common checks. */
13525 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13526 and dangle the pointer from time to time. */
13527 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13528 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13529 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13531 error ("type variant has different TYPE_VFIELD");
13535 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13536 || TREE_CODE (t
) == INTEGER_TYPE
13537 || TREE_CODE (t
) == BOOLEAN_TYPE
13538 || TREE_CODE (t
) == REAL_TYPE
13539 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13541 verify_variant_match (TYPE_MAX_VALUE
);
13542 verify_variant_match (TYPE_MIN_VALUE
);
13544 if (TREE_CODE (t
) == METHOD_TYPE
)
13545 verify_variant_match (TYPE_METHOD_BASETYPE
);
13546 if (TREE_CODE (t
) == OFFSET_TYPE
)
13547 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13548 if (TREE_CODE (t
) == ARRAY_TYPE
)
13549 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13550 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13551 or even type's main variant. This is needed to make bootstrap pass
13552 and the bug seems new in GCC 5.
13553 C++ FE should be updated to make this consistent and we should check
13554 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13555 is a match with main variant.
13557 Also disable the check for Java for now because of parser hack that builds
13558 first an dummy BINFO and then sometimes replace it by real BINFO in some
13560 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13561 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13562 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13563 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13564 at LTO time only. */
13565 && (in_lto_p
&& odr_type_p (t
)))
13567 error ("type variant has different TYPE_BINFO");
13569 error ("type variant's TYPE_BINFO");
13570 debug_tree (TYPE_BINFO (tv
));
13571 error ("type's TYPE_BINFO");
13572 debug_tree (TYPE_BINFO (t
));
13576 /* Check various uses of TYPE_VALUES_RAW. */
13577 if (TREE_CODE (t
) == ENUMERAL_TYPE
13578 && TYPE_VALUES (t
))
13579 verify_variant_match (TYPE_VALUES
);
13580 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13581 verify_variant_match (TYPE_DOMAIN
);
13582 /* Permit incomplete variants of complete type. While FEs may complete
13583 all variants, this does not happen for C++ templates in all cases. */
13584 else if (RECORD_OR_UNION_TYPE_P (t
)
13585 && COMPLETE_TYPE_P (t
)
13586 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13590 /* Fortran builds qualified variants as new records with items of
13591 qualified type. Verify that they looks same. */
13592 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13594 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13595 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13596 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13597 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13598 /* FIXME: gfc_nonrestricted_type builds all types as variants
13599 with exception of pointer types. It deeply copies the type
13600 which means that we may end up with a variant type
13601 referring non-variant pointer. We may change it to
13602 produce types as variants, too, like
13603 objc_get_protocol_qualified_type does. */
13604 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13605 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13606 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13610 error ("type variant has different TYPE_FIELDS");
13612 error ("first mismatch is field");
13614 error ("and field");
13619 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13620 verify_variant_match (TYPE_ARG_TYPES
);
13621 /* For C++ the qualified variant of array type is really an array type
13622 of qualified TREE_TYPE.
13623 objc builds variants of pointer where pointer to type is a variant, too
13624 in objc_get_protocol_qualified_type. */
13625 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13626 && ((TREE_CODE (t
) != ARRAY_TYPE
13627 && !POINTER_TYPE_P (t
))
13628 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13629 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13631 error ("type variant has different TREE_TYPE");
13633 error ("type variant's TREE_TYPE");
13634 debug_tree (TREE_TYPE (tv
));
13635 error ("type's TREE_TYPE");
13636 debug_tree (TREE_TYPE (t
));
13639 if (type_with_alias_set_p (t
)
13640 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13642 error ("type is not compatible with its variant");
13644 error ("type variant's TREE_TYPE");
13645 debug_tree (TREE_TYPE (tv
));
13646 error ("type's TREE_TYPE");
13647 debug_tree (TREE_TYPE (t
));
13651 #undef verify_variant_match
13655 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13656 the middle-end types_compatible_p function. It needs to avoid
13657 claiming types are different for types that should be treated
13658 the same with respect to TBAA. Canonical types are also used
13659 for IL consistency checks via the useless_type_conversion_p
13660 predicate which does not handle all type kinds itself but falls
13661 back to pointer-comparison of TYPE_CANONICAL for aggregates
13664 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13665 type calculation because we need to allow inter-operability between signed
13666 and unsigned variants. */
13669 type_with_interoperable_signedness (const_tree type
)
13671 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13672 signed char and unsigned char. Similarly fortran FE builds
13673 C_SIZE_T as signed type, while C defines it unsigned. */
13675 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13677 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13678 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13681 /* Return true iff T1 and T2 are structurally identical for what
13683 This function is used both by lto.c canonical type merging and by the
13684 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13685 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13686 only for LTO because only in these cases TYPE_CANONICAL equivalence
13687 correspond to one defined by gimple_canonical_types_compatible_p. */
13690 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13691 bool trust_type_canonical
)
13693 /* Type variants should be same as the main variant. When not doing sanity
13694 checking to verify this fact, go to main variants and save some work. */
13695 if (trust_type_canonical
)
13697 t1
= TYPE_MAIN_VARIANT (t1
);
13698 t2
= TYPE_MAIN_VARIANT (t2
);
13701 /* Check first for the obvious case of pointer identity. */
13705 /* Check that we have two types to compare. */
13706 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13709 /* We consider complete types always compatible with incomplete type.
13710 This does not make sense for canonical type calculation and thus we
13711 need to ensure that we are never called on it.
13713 FIXME: For more correctness the function probably should have three modes
13714 1) mode assuming that types are complete mathcing their structure
13715 2) mode allowing incomplete types but producing equivalence classes
13716 and thus ignoring all info from complete types
13717 3) mode allowing incomplete types to match complete but checking
13718 compatibility between complete types.
13720 1 and 2 can be used for canonical type calculation. 3 is the real
13721 definition of type compatibility that can be used i.e. for warnings during
13722 declaration merging. */
13724 gcc_assert (!trust_type_canonical
13725 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13726 /* If the types have been previously registered and found equal
13729 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13730 && trust_type_canonical
)
13732 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13733 they are always NULL, but they are set to non-NULL for types
13734 constructed by build_pointer_type and variants. In this case the
13735 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13736 all pointers are considered equal. Be sure to not return false
13738 gcc_checking_assert (canonical_type_used_p (t1
)
13739 && canonical_type_used_p (t2
));
13740 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13743 /* Can't be the same type if the types don't have the same code. */
13744 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13745 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13748 /* Qualifiers do not matter for canonical type comparison purposes. */
13750 /* Void types and nullptr types are always the same. */
13751 if (TREE_CODE (t1
) == VOID_TYPE
13752 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13755 /* Can't be the same type if they have different mode. */
13756 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13759 /* Non-aggregate types can be handled cheaply. */
13760 if (INTEGRAL_TYPE_P (t1
)
13761 || SCALAR_FLOAT_TYPE_P (t1
)
13762 || FIXED_POINT_TYPE_P (t1
)
13763 || TREE_CODE (t1
) == VECTOR_TYPE
13764 || TREE_CODE (t1
) == COMPLEX_TYPE
13765 || TREE_CODE (t1
) == OFFSET_TYPE
13766 || POINTER_TYPE_P (t1
))
13768 /* Can't be the same type if they have different recision. */
13769 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13772 /* In some cases the signed and unsigned types are required to be
13774 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13775 && !type_with_interoperable_signedness (t1
))
13778 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13779 interoperable with "signed char". Unless all frontends are revisited
13780 to agree on these types, we must ignore the flag completely. */
13782 /* Fortran standard define C_PTR type that is compatible with every
13783 C pointer. For this reason we need to glob all pointers into one.
13784 Still pointers in different address spaces are not compatible. */
13785 if (POINTER_TYPE_P (t1
))
13787 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13788 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13792 /* Tail-recurse to components. */
13793 if (TREE_CODE (t1
) == VECTOR_TYPE
13794 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13795 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13797 trust_type_canonical
);
13802 /* Do type-specific comparisons. */
13803 switch (TREE_CODE (t1
))
13806 /* Array types are the same if the element types are the same and
13807 the number of elements are the same. */
13808 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13809 trust_type_canonical
)
13810 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13811 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13812 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13816 tree i1
= TYPE_DOMAIN (t1
);
13817 tree i2
= TYPE_DOMAIN (t2
);
13819 /* For an incomplete external array, the type domain can be
13820 NULL_TREE. Check this condition also. */
13821 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13823 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13827 tree min1
= TYPE_MIN_VALUE (i1
);
13828 tree min2
= TYPE_MIN_VALUE (i2
);
13829 tree max1
= TYPE_MAX_VALUE (i1
);
13830 tree max2
= TYPE_MAX_VALUE (i2
);
13832 /* The minimum/maximum values have to be the same. */
13835 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13836 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13837 || operand_equal_p (min1
, min2
, 0))))
13840 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13841 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13842 || operand_equal_p (max1
, max2
, 0)))))
13850 case FUNCTION_TYPE
:
13851 /* Function types are the same if the return type and arguments types
13853 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13854 trust_type_canonical
))
13857 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13861 tree parms1
, parms2
;
13863 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13865 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13867 if (!gimple_canonical_types_compatible_p
13868 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13869 trust_type_canonical
))
13873 if (parms1
|| parms2
)
13881 case QUAL_UNION_TYPE
:
13885 /* Don't try to compare variants of an incomplete type, before
13886 TYPE_FIELDS has been copied around. */
13887 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13891 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13894 /* For aggregate types, all the fields must be the same. */
13895 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13897 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13899 /* Skip non-fields and zero-sized fields. */
13900 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13902 && integer_zerop (DECL_SIZE (f1
)))))
13903 f1
= TREE_CHAIN (f1
);
13904 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13906 && integer_zerop (DECL_SIZE (f2
)))))
13907 f2
= TREE_CHAIN (f2
);
13910 /* The fields must have the same name, offset and type. */
13911 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13912 || !gimple_compare_field_offset (f1
, f2
)
13913 || !gimple_canonical_types_compatible_p
13914 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13915 trust_type_canonical
))
13919 /* If one aggregate has more fields than the other, they
13920 are not the same. */
13928 /* Consider all types with language specific trees in them mutually
13929 compatible. This is executed only from verify_type and false
13930 positives can be tolerated. */
13931 gcc_assert (!in_lto_p
);
13936 /* Verify type T. */
13939 verify_type (const_tree t
)
13941 bool error_found
= false;
13942 tree mv
= TYPE_MAIN_VARIANT (t
);
13945 error ("Main variant is not defined");
13946 error_found
= true;
13948 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13950 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13952 error_found
= true;
13954 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13955 error_found
= true;
13957 tree ct
= TYPE_CANONICAL (t
);
13960 else if (TYPE_CANONICAL (t
) != ct
)
13962 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13964 error_found
= true;
13966 /* Method and function types can not be used to address memory and thus
13967 TYPE_CANONICAL really matters only for determining useless conversions.
13969 FIXME: C++ FE produce declarations of builtin functions that are not
13970 compatible with main variants. */
13971 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13974 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13975 with variably sized arrays because their sizes possibly
13976 gimplified to different variables. */
13977 && !variably_modified_type_p (ct
, NULL
)
13978 && !gimple_canonical_types_compatible_p (t
, ct
, false)
13979 && COMPLETE_TYPE_P (t
))
13981 error ("TYPE_CANONICAL is not compatible");
13983 error_found
= true;
13986 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13987 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13989 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13991 error_found
= true;
13993 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13995 error ("TYPE_CANONICAL of main variant is not main variant");
13997 debug_tree (TYPE_MAIN_VARIANT (ct
));
13998 error_found
= true;
14002 /* Check various uses of TYPE_MIN_VALUE_RAW. */
14003 if (RECORD_OR_UNION_TYPE_P (t
))
14005 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
14006 and danagle the pointer from time to time. */
14007 if (TYPE_VFIELD (t
)
14008 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
14009 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
14011 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
14012 debug_tree (TYPE_VFIELD (t
));
14013 error_found
= true;
14016 else if (TREE_CODE (t
) == POINTER_TYPE
)
14018 if (TYPE_NEXT_PTR_TO (t
)
14019 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
14021 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
14022 debug_tree (TYPE_NEXT_PTR_TO (t
));
14023 error_found
= true;
14026 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
14028 if (TYPE_NEXT_REF_TO (t
)
14029 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
14031 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
14032 debug_tree (TYPE_NEXT_REF_TO (t
));
14033 error_found
= true;
14036 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14037 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14039 /* FIXME: The following check should pass:
14040 useless_type_conversion_p (const_cast <tree> (t),
14041 TREE_TYPE (TYPE_MIN_VALUE (t))
14042 but does not for C sizetypes in LTO. */
14045 /* Check various uses of TYPE_MAXVAL_RAW. */
14046 if (RECORD_OR_UNION_TYPE_P (t
))
14048 if (!TYPE_BINFO (t
))
14050 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
14052 error ("TYPE_BINFO is not TREE_BINFO");
14053 debug_tree (TYPE_BINFO (t
));
14054 error_found
= true;
14056 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
14058 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
14059 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
14060 error_found
= true;
14063 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14065 if (TYPE_METHOD_BASETYPE (t
)
14066 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
14067 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
14069 error ("TYPE_METHOD_BASETYPE is not record nor union");
14070 debug_tree (TYPE_METHOD_BASETYPE (t
));
14071 error_found
= true;
14074 else if (TREE_CODE (t
) == OFFSET_TYPE
)
14076 if (TYPE_OFFSET_BASETYPE (t
)
14077 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
14078 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
14080 error ("TYPE_OFFSET_BASETYPE is not record nor union");
14081 debug_tree (TYPE_OFFSET_BASETYPE (t
));
14082 error_found
= true;
14085 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
14086 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
14088 /* FIXME: The following check should pass:
14089 useless_type_conversion_p (const_cast <tree> (t),
14090 TREE_TYPE (TYPE_MAX_VALUE (t))
14091 but does not for C sizetypes in LTO. */
14093 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14095 if (TYPE_ARRAY_MAX_SIZE (t
)
14096 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
14098 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
14099 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
14100 error_found
= true;
14103 else if (TYPE_MAX_VALUE_RAW (t
))
14105 error ("TYPE_MAX_VALUE_RAW non-NULL");
14106 debug_tree (TYPE_MAX_VALUE_RAW (t
));
14107 error_found
= true;
14110 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
14112 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
14113 debug_tree (TYPE_LANG_SLOT_1 (t
));
14114 error_found
= true;
14117 /* Check various uses of TYPE_VALUES_RAW. */
14118 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
14119 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
14121 tree value
= TREE_VALUE (l
);
14122 tree name
= TREE_PURPOSE (l
);
14124 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
14125 CONST_DECL of ENUMERAL TYPE. */
14126 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
14128 error ("Enum value is not CONST_DECL or INTEGER_CST");
14129 debug_tree (value
);
14131 error_found
= true;
14133 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
14134 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
14136 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
14137 debug_tree (value
);
14139 error_found
= true;
14141 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
14143 error ("Enum value name is not IDENTIFIER_NODE");
14144 debug_tree (value
);
14146 error_found
= true;
14149 else if (TREE_CODE (t
) == ARRAY_TYPE
)
14151 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
14153 error ("Array TYPE_DOMAIN is not integer type");
14154 debug_tree (TYPE_DOMAIN (t
));
14155 error_found
= true;
14158 else if (RECORD_OR_UNION_TYPE_P (t
))
14160 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
14162 error ("TYPE_FIELDS defined in incomplete type");
14163 error_found
= true;
14165 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
14167 /* TODO: verify properties of decls. */
14168 if (TREE_CODE (fld
) == FIELD_DECL
)
14170 else if (TREE_CODE (fld
) == TYPE_DECL
)
14172 else if (TREE_CODE (fld
) == CONST_DECL
)
14174 else if (VAR_P (fld
))
14176 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
14178 else if (TREE_CODE (fld
) == USING_DECL
)
14180 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
14184 error ("Wrong tree in TYPE_FIELDS list");
14186 error_found
= true;
14190 else if (TREE_CODE (t
) == INTEGER_TYPE
14191 || TREE_CODE (t
) == BOOLEAN_TYPE
14192 || TREE_CODE (t
) == OFFSET_TYPE
14193 || TREE_CODE (t
) == REFERENCE_TYPE
14194 || TREE_CODE (t
) == NULLPTR_TYPE
14195 || TREE_CODE (t
) == POINTER_TYPE
)
14197 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14199 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14200 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14201 error_found
= true;
14203 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14205 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14206 debug_tree (TYPE_CACHED_VALUES (t
));
14207 error_found
= true;
14209 /* Verify just enough of cache to ensure that no one copied it to new type.
14210 All copying should go by copy_node that should clear it. */
14211 else if (TYPE_CACHED_VALUES_P (t
))
14214 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14215 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14216 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14218 error ("wrong TYPE_CACHED_VALUES entry");
14219 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14220 error_found
= true;
14225 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14226 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14228 /* C++ FE uses TREE_PURPOSE to store initial values. */
14229 if (TREE_PURPOSE (l
) && in_lto_p
)
14231 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14233 error_found
= true;
14235 if (!TYPE_P (TREE_VALUE (l
)))
14237 error ("Wrong entry in TYPE_ARG_TYPES list");
14239 error_found
= true;
14242 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14244 error ("TYPE_VALUES_RAW field is non-NULL");
14245 debug_tree (TYPE_VALUES_RAW (t
));
14246 error_found
= true;
14248 if (TREE_CODE (t
) != INTEGER_TYPE
14249 && TREE_CODE (t
) != BOOLEAN_TYPE
14250 && TREE_CODE (t
) != OFFSET_TYPE
14251 && TREE_CODE (t
) != REFERENCE_TYPE
14252 && TREE_CODE (t
) != NULLPTR_TYPE
14253 && TREE_CODE (t
) != POINTER_TYPE
14254 && TYPE_CACHED_VALUES_P (t
))
14256 error ("TYPE_CACHED_VALUES_P is set while it should not");
14257 error_found
= true;
14259 if (TYPE_STRING_FLAG (t
)
14260 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14262 error ("TYPE_STRING_FLAG is set on wrong type code");
14263 error_found
= true;
14266 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14267 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14269 if (TREE_CODE (t
) == METHOD_TYPE
14270 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14272 error ("TYPE_METHOD_BASETYPE is not main variant");
14273 error_found
= true;
14278 debug_tree (const_cast <tree
> (t
));
14279 internal_error ("verify_type failed");
14284 /* Return 1 if ARG interpreted as signed in its precision is known to be
14285 always positive or 2 if ARG is known to be always negative, or 3 if
14286 ARG may be positive or negative. */
14289 get_range_pos_neg (tree arg
)
14291 if (arg
== error_mark_node
)
14294 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14296 if (TREE_CODE (arg
) == INTEGER_CST
)
14298 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
14304 while (CONVERT_EXPR_P (arg
)
14305 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
14306 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
14308 arg
= TREE_OPERAND (arg
, 0);
14309 /* Narrower value zero extended into wider type
14310 will always result in positive values. */
14311 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
14312 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
14314 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
14319 if (TREE_CODE (arg
) != SSA_NAME
)
14321 wide_int arg_min
, arg_max
;
14322 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
14324 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
14325 if (is_gimple_assign (g
)
14326 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
14328 tree t
= gimple_assign_rhs1 (g
);
14329 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
14330 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
14332 if (TYPE_UNSIGNED (TREE_TYPE (t
))
14333 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
14335 prec
= TYPE_PRECISION (TREE_TYPE (t
));
14344 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
14346 /* For unsigned values, the "positive" range comes
14347 below the "negative" range. */
14348 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14350 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14355 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
14357 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
14366 /* Return true if ARG is marked with the nonnull attribute in the
14367 current function signature. */
14370 nonnull_arg_p (const_tree arg
)
14372 tree t
, attrs
, fntype
;
14373 unsigned HOST_WIDE_INT arg_num
;
14375 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14376 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14377 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14379 /* The static chain decl is always non null. */
14380 if (arg
== cfun
->static_chain_decl
)
14383 /* THIS argument of method is always non-NULL. */
14384 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14385 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14386 && flag_delete_null_pointer_checks
)
14389 /* Values passed by reference are always non-NULL. */
14390 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14391 && flag_delete_null_pointer_checks
)
14394 fntype
= TREE_TYPE (cfun
->decl
);
14395 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14397 attrs
= lookup_attribute ("nonnull", attrs
);
14399 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14400 if (attrs
== NULL_TREE
)
14403 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14404 if (TREE_VALUE (attrs
) == NULL_TREE
)
14407 /* Get the position number for ARG in the function signature. */
14408 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14410 t
= DECL_CHAIN (t
), arg_num
++)
14416 gcc_assert (t
== arg
);
14418 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14419 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14421 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14429 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14433 set_block (location_t loc
, tree block
)
14435 location_t pure_loc
= get_pure_location (loc
);
14436 source_range src_range
= get_range_from_loc (line_table
, loc
);
14437 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14441 set_source_range (tree expr
, location_t start
, location_t finish
)
14443 source_range src_range
;
14444 src_range
.m_start
= start
;
14445 src_range
.m_finish
= finish
;
14446 return set_source_range (expr
, src_range
);
14450 set_source_range (tree expr
, source_range src_range
)
14452 if (!EXPR_P (expr
))
14453 return UNKNOWN_LOCATION
;
14455 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14456 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14460 SET_EXPR_LOCATION (expr
, adhoc
);
14464 /* Return EXPR, potentially wrapped with a node expression LOC,
14465 if !CAN_HAVE_LOCATION_P (expr).
14467 NON_LVALUE_EXPR is used for wrapping constants, apart from STRING_CST.
14468 VIEW_CONVERT_EXPR is used for wrapping non-constants and STRING_CST.
14470 Wrapper nodes can be identified using location_wrapper_p. */
14473 maybe_wrap_with_location (tree expr
, location_t loc
)
14477 if (loc
== UNKNOWN_LOCATION
)
14479 if (CAN_HAVE_LOCATION_P (expr
))
14481 /* We should only be adding wrappers for constants and for decls,
14482 or for some exceptional tree nodes (e.g. BASELINK in the C++ FE). */
14483 gcc_assert (CONSTANT_CLASS_P (expr
)
14485 || EXCEPTIONAL_CLASS_P (expr
));
14487 /* For now, don't add wrappers to exceptional tree nodes, to minimize
14488 any impact of the wrapper nodes. */
14489 if (EXCEPTIONAL_CLASS_P (expr
))
14493 = (((CONSTANT_CLASS_P (expr
) && TREE_CODE (expr
) != STRING_CST
)
14494 || (TREE_CODE (expr
) == CONST_DECL
&& !TREE_STATIC (expr
)))
14495 ? NON_LVALUE_EXPR
: VIEW_CONVERT_EXPR
);
14496 tree wrapper
= build1_loc (loc
, code
, TREE_TYPE (expr
), expr
);
14497 /* Mark this node as being a wrapper. */
14498 EXPR_LOCATION_WRAPPER_P (wrapper
) = 1;
14502 /* Return the name of combined function FN, for debugging purposes. */
14505 combined_fn_name (combined_fn fn
)
14507 if (builtin_fn_p (fn
))
14509 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14510 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14513 return internal_fn_name (as_internal_fn (fn
));
14516 /* Return a bitmap with a bit set corresponding to each argument in
14517 a function call type FNTYPE declared with attribute nonnull,
14518 or null if none of the function's argument are nonnull. The caller
14519 must free the bitmap. */
14522 get_nonnull_args (const_tree fntype
)
14524 if (fntype
== NULL_TREE
)
14527 tree attrs
= TYPE_ATTRIBUTES (fntype
);
14531 bitmap argmap
= NULL
;
14533 /* A function declaration can specify multiple attribute nonnull,
14534 each with zero or more arguments. The loop below creates a bitmap
14535 representing a union of all the arguments. An empty (but non-null)
14536 bitmap means that all arguments have been declaraed nonnull. */
14537 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
14539 attrs
= lookup_attribute ("nonnull", attrs
);
14544 argmap
= BITMAP_ALLOC (NULL
);
14546 if (!TREE_VALUE (attrs
))
14548 /* Clear the bitmap in case a previous attribute nonnull
14549 set it and this one overrides it for all arguments. */
14550 bitmap_clear (argmap
);
14554 /* Iterate over the indices of the format arguments declared nonnull
14555 and set a bit for each. */
14556 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
14558 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
14559 bitmap_set_bit (argmap
, val
);
14566 /* Returns true if TYPE is a type where it and all of its subobjects
14567 (recursively) are of structure, union, or array type. */
14570 default_is_empty_type (tree type
)
14572 if (RECORD_OR_UNION_TYPE_P (type
))
14574 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
14575 if (TREE_CODE (field
) == FIELD_DECL
14576 && !DECL_PADDING_P (field
)
14577 && !default_is_empty_type (TREE_TYPE (field
)))
14581 else if (TREE_CODE (type
) == ARRAY_TYPE
)
14582 return (integer_minus_onep (array_type_nelts (type
))
14583 || TYPE_DOMAIN (type
) == NULL_TREE
14584 || default_is_empty_type (TREE_TYPE (type
)));
14588 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
14589 that shouldn't be passed via stack. */
14592 default_is_empty_record (const_tree type
)
14594 if (!abi_version_at_least (12))
14597 if (type
== error_mark_node
)
14600 if (TREE_ADDRESSABLE (type
))
14603 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
14606 /* Like int_size_in_bytes, but handle empty records specially. */
14609 arg_int_size_in_bytes (const_tree type
)
14611 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
14614 /* Like size_in_bytes, but handle empty records specially. */
14617 arg_size_in_bytes (const_tree type
)
14619 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
14622 /* Return true if an expression with CODE has to have the same result type as
14623 its first operand. */
14626 expr_type_first_operand_type_p (tree_code code
)
14639 case TRUNC_DIV_EXPR
:
14640 case CEIL_DIV_EXPR
:
14641 case FLOOR_DIV_EXPR
:
14642 case ROUND_DIV_EXPR
:
14643 case TRUNC_MOD_EXPR
:
14644 case CEIL_MOD_EXPR
:
14645 case FLOOR_MOD_EXPR
:
14646 case ROUND_MOD_EXPR
:
14648 case EXACT_DIV_EXPR
:
14666 /* Return a typenode for the "standard" C type with a given name. */
14668 get_typenode_from_name (const char *name
)
14670 if (name
== NULL
|| *name
== '\0')
14673 if (strcmp (name
, "char") == 0)
14674 return char_type_node
;
14675 if (strcmp (name
, "unsigned char") == 0)
14676 return unsigned_char_type_node
;
14677 if (strcmp (name
, "signed char") == 0)
14678 return signed_char_type_node
;
14680 if (strcmp (name
, "short int") == 0)
14681 return short_integer_type_node
;
14682 if (strcmp (name
, "short unsigned int") == 0)
14683 return short_unsigned_type_node
;
14685 if (strcmp (name
, "int") == 0)
14686 return integer_type_node
;
14687 if (strcmp (name
, "unsigned int") == 0)
14688 return unsigned_type_node
;
14690 if (strcmp (name
, "long int") == 0)
14691 return long_integer_type_node
;
14692 if (strcmp (name
, "long unsigned int") == 0)
14693 return long_unsigned_type_node
;
14695 if (strcmp (name
, "long long int") == 0)
14696 return long_long_integer_type_node
;
14697 if (strcmp (name
, "long long unsigned int") == 0)
14698 return long_long_unsigned_type_node
;
14700 gcc_unreachable ();
14703 /* List of pointer types used to declare builtins before we have seen their
14706 Keep the size up to date in tree.h ! */
14707 const builtin_structptr_type builtin_structptr_types
[6] =
14709 { fileptr_type_node
, ptr_type_node
, "FILE" },
14710 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14711 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14712 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14713 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14714 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14719 namespace selftest
{
14721 /* Selftests for tree. */
14723 /* Verify that integer constants are sane. */
14726 test_integer_constants ()
14728 ASSERT_TRUE (integer_type_node
!= NULL
);
14729 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14731 tree type
= integer_type_node
;
14733 tree zero
= build_zero_cst (type
);
14734 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14735 ASSERT_EQ (type
, TREE_TYPE (zero
));
14737 tree one
= build_int_cst (type
, 1);
14738 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14739 ASSERT_EQ (type
, TREE_TYPE (zero
));
14742 /* Verify identifiers. */
14745 test_identifiers ()
14747 tree identifier
= get_identifier ("foo");
14748 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14749 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14752 /* Verify LABEL_DECL. */
14757 tree identifier
= get_identifier ("err");
14758 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14759 identifier
, void_type_node
);
14760 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14761 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14764 /* Return a new VECTOR_CST node whose type is TYPE and whose values
14765 are given by VALS. */
14768 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
14770 gcc_assert (known_eq (vals
.length (), TYPE_VECTOR_SUBPARTS (type
)));
14771 tree_vector_builder
builder (type
, vals
.length (), 1);
14772 builder
.splice (vals
);
14773 return builder
.build ();
14776 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14779 check_vector_cst (vec
<tree
> expected
, tree actual
)
14781 ASSERT_KNOWN_EQ (expected
.length (),
14782 TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14783 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14784 ASSERT_EQ (wi::to_wide (expected
[i
]),
14785 wi::to_wide (vector_cst_elt (actual
, i
)));
14788 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14789 and that its elements match EXPECTED. */
14792 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14793 unsigned int npatterns
)
14795 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14796 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14797 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14798 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14799 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14800 check_vector_cst (expected
, actual
);
14803 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14804 and NPATTERNS background elements, and that its elements match
14808 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14809 unsigned int npatterns
)
14811 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14812 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14813 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14814 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14815 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14816 check_vector_cst (expected
, actual
);
14819 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14820 and that its elements match EXPECTED. */
14823 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14824 unsigned int npatterns
)
14826 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14827 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14828 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14829 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14830 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14831 check_vector_cst (expected
, actual
);
14834 /* Test the creation of VECTOR_CSTs. */
14837 test_vector_cst_patterns (ALONE_CXX_MEM_STAT_INFO
)
14839 auto_vec
<tree
, 8> elements (8);
14840 elements
.quick_grow (8);
14841 tree element_type
= build_nonstandard_integer_type (16, true);
14842 tree vector_type
= build_vector_type (element_type
, 8);
14844 /* Test a simple linear series with a base of 0 and a step of 1:
14845 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14846 for (unsigned int i
= 0; i
< 8; ++i
)
14847 elements
[i
] = build_int_cst (element_type
, i
);
14848 tree vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14849 check_vector_cst_stepped (elements
, vector
, 1);
14851 /* Try the same with the first element replaced by 100:
14852 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14853 elements
[0] = build_int_cst (element_type
, 100);
14854 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14855 check_vector_cst_stepped (elements
, vector
, 1);
14857 /* Try a series that wraps around.
14858 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14859 for (unsigned int i
= 1; i
< 8; ++i
)
14860 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14861 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14862 check_vector_cst_stepped (elements
, vector
, 1);
14864 /* Try a downward series:
14865 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14866 for (unsigned int i
= 1; i
< 8; ++i
)
14867 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14868 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14869 check_vector_cst_stepped (elements
, vector
, 1);
14871 /* Try two interleaved series with different bases and steps:
14872 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14873 elements
[1] = build_int_cst (element_type
, 53);
14874 for (unsigned int i
= 2; i
< 8; i
+= 2)
14876 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14877 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14879 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14880 check_vector_cst_stepped (elements
, vector
, 2);
14882 /* Try a duplicated value:
14883 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14884 for (unsigned int i
= 1; i
< 8; ++i
)
14885 elements
[i
] = elements
[0];
14886 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14887 check_vector_cst_duplicate (elements
, vector
, 1);
14889 /* Try an interleaved duplicated value:
14890 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14891 elements
[1] = build_int_cst (element_type
, 55);
14892 for (unsigned int i
= 2; i
< 8; ++i
)
14893 elements
[i
] = elements
[i
- 2];
14894 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14895 check_vector_cst_duplicate (elements
, vector
, 2);
14897 /* Try a duplicated value with 2 exceptions
14898 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14899 elements
[0] = build_int_cst (element_type
, 41);
14900 elements
[1] = build_int_cst (element_type
, 97);
14901 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14902 check_vector_cst_fill (elements
, vector
, 2);
14904 /* Try with and without a step
14905 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14906 for (unsigned int i
= 3; i
< 8; i
+= 2)
14907 elements
[i
] = build_int_cst (element_type
, i
* 7);
14908 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14909 check_vector_cst_stepped (elements
, vector
, 2);
14911 /* Try a fully-general constant:
14912 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14913 elements
[5] = build_int_cst (element_type
, 9990);
14914 vector
= build_vector (vector_type
, elements PASS_MEM_STAT
);
14915 check_vector_cst_fill (elements
, vector
, 4);
14918 /* Verify that STRIP_NOPS (NODE) is EXPECTED.
14919 Helper function for test_location_wrappers, to deal with STRIP_NOPS
14920 modifying its argument in-place. */
14923 check_strip_nops (tree node
, tree expected
)
14926 ASSERT_EQ (expected
, node
);
14929 /* Verify location wrappers. */
14932 test_location_wrappers ()
14934 location_t loc
= BUILTINS_LOCATION
;
14936 ASSERT_EQ (NULL_TREE
, maybe_wrap_with_location (NULL_TREE
, loc
));
14938 /* Wrapping a constant. */
14939 tree int_cst
= build_int_cst (integer_type_node
, 42);
14940 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_cst
));
14941 ASSERT_FALSE (location_wrapper_p (int_cst
));
14943 tree wrapped_int_cst
= maybe_wrap_with_location (int_cst
, loc
);
14944 ASSERT_TRUE (location_wrapper_p (wrapped_int_cst
));
14945 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_cst
));
14946 ASSERT_EQ (int_cst
, tree_strip_any_location_wrapper (wrapped_int_cst
));
14948 /* We shouldn't add wrapper nodes for UNKNOWN_LOCATION. */
14949 ASSERT_EQ (int_cst
, maybe_wrap_with_location (int_cst
, UNKNOWN_LOCATION
));
14951 /* We shouldn't add wrapper nodes for nodes that CAN_HAVE_LOCATION_P. */
14952 tree cast
= build1 (NOP_EXPR
, char_type_node
, int_cst
);
14953 ASSERT_TRUE (CAN_HAVE_LOCATION_P (cast
));
14954 ASSERT_EQ (cast
, maybe_wrap_with_location (cast
, loc
));
14956 /* Wrapping a STRING_CST. */
14957 tree string_cst
= build_string (4, "foo");
14958 ASSERT_FALSE (CAN_HAVE_LOCATION_P (string_cst
));
14959 ASSERT_FALSE (location_wrapper_p (string_cst
));
14961 tree wrapped_string_cst
= maybe_wrap_with_location (string_cst
, loc
);
14962 ASSERT_TRUE (location_wrapper_p (wrapped_string_cst
));
14963 ASSERT_EQ (VIEW_CONVERT_EXPR
, TREE_CODE (wrapped_string_cst
));
14964 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_string_cst
));
14965 ASSERT_EQ (string_cst
, tree_strip_any_location_wrapper (wrapped_string_cst
));
14968 /* Wrapping a variable. */
14969 tree int_var
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
14970 get_identifier ("some_int_var"),
14971 integer_type_node
);
14972 ASSERT_FALSE (CAN_HAVE_LOCATION_P (int_var
));
14973 ASSERT_FALSE (location_wrapper_p (int_var
));
14975 tree wrapped_int_var
= maybe_wrap_with_location (int_var
, loc
);
14976 ASSERT_TRUE (location_wrapper_p (wrapped_int_var
));
14977 ASSERT_EQ (loc
, EXPR_LOCATION (wrapped_int_var
));
14978 ASSERT_EQ (int_var
, tree_strip_any_location_wrapper (wrapped_int_var
));
14980 /* Verify that "reinterpret_cast<int>(some_int_var)" is not a location
14982 tree r_cast
= build1 (NON_LVALUE_EXPR
, integer_type_node
, int_var
);
14983 ASSERT_FALSE (location_wrapper_p (r_cast
));
14984 ASSERT_EQ (r_cast
, tree_strip_any_location_wrapper (r_cast
));
14986 /* Verify that STRIP_NOPS removes wrappers. */
14987 check_strip_nops (wrapped_int_cst
, int_cst
);
14988 check_strip_nops (wrapped_string_cst
, string_cst
);
14989 check_strip_nops (wrapped_int_var
, int_var
);
14992 /* Check that string escaping works correctly. */
14995 test_escaped_strings (void)
14998 escaped_string msg
;
15001 /* ASSERT_STREQ does not accept NULL as a valid test
15002 result, so we have to use ASSERT_EQ instead. */
15003 ASSERT_EQ (NULL
, (const char *) msg
);
15006 ASSERT_STREQ ("", (const char *) msg
);
15008 msg
.escape ("foobar");
15009 ASSERT_STREQ ("foobar", (const char *) msg
);
15011 /* Ensure that we have -fmessage-length set to 0. */
15012 saved_cutoff
= pp_line_cutoff (global_dc
->printer
);
15013 pp_line_cutoff (global_dc
->printer
) = 0;
15015 msg
.escape ("foo\nbar");
15016 ASSERT_STREQ ("foo\\nbar", (const char *) msg
);
15018 msg
.escape ("\a\b\f\n\r\t\v");
15019 ASSERT_STREQ ("\\a\\b\\f\\n\\r\\t\\v", (const char *) msg
);
15021 /* Now repeat the tests with -fmessage-length set to 5. */
15022 pp_line_cutoff (global_dc
->printer
) = 5;
15024 /* Note that the newline is not translated into an escape. */
15025 msg
.escape ("foo\nbar");
15026 ASSERT_STREQ ("foo\nbar", (const char *) msg
);
15028 msg
.escape ("\a\b\f\n\r\t\v");
15029 ASSERT_STREQ ("\\a\\b\\f\n\\r\\t\\v", (const char *) msg
);
15031 /* Restore the original message length setting. */
15032 pp_line_cutoff (global_dc
->printer
) = saved_cutoff
;
15035 /* Run all of the selftests within this file. */
15040 test_integer_constants ();
15041 test_identifiers ();
15043 test_vector_cst_patterns ();
15044 test_location_wrappers ();
15045 test_escaped_strings ();
15048 } // namespace selftest
15050 #endif /* CHECKING_P */
15052 #include "gt-tree.h"