1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2017 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 int tree_code_counts
[MAX_TREE_CODES
];
133 int tree_node_counts
[(int) all_kinds
];
134 int 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 /* Hash table for optimization flags and target option flags. Use the same
208 hash table for both sets of options. Nodes for building the current
209 optimization and target option nodes. The assumption is most of the time
210 the options created will already be in the hash table, so we avoid
211 allocating and freeing up a node repeatably. */
212 static GTY (()) tree cl_optimization_node
;
213 static GTY (()) tree cl_target_option_node
;
215 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
217 static hashval_t
hash (tree t
);
218 static bool equal (tree x
, tree y
);
221 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
223 /* General tree->tree mapping structure for use in hash tables. */
227 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
230 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
232 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
234 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
237 equal (tree_vec_map
*a
, tree_vec_map
*b
)
239 return a
->base
.from
== b
->base
.from
;
243 keep_cache_entry (tree_vec_map
*&m
)
245 return ggc_marked_p (m
->base
.from
);
250 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
252 static void set_type_quals (tree
, int);
253 static void print_type_hash_statistics (void);
254 static void print_debug_expr_statistics (void);
255 static void print_value_expr_statistics (void);
257 tree global_trees
[TI_MAX
];
258 tree integer_types
[itk_none
];
260 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
261 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
263 bool tree_contains_struct
[MAX_TREE_CODES
][64];
265 /* Number of operands for each OpenMP clause. */
266 unsigned const char omp_clause_num_ops
[] =
268 0, /* OMP_CLAUSE_ERROR */
269 1, /* OMP_CLAUSE_PRIVATE */
270 1, /* OMP_CLAUSE_SHARED */
271 1, /* OMP_CLAUSE_FIRSTPRIVATE */
272 2, /* OMP_CLAUSE_LASTPRIVATE */
273 5, /* OMP_CLAUSE_REDUCTION */
274 1, /* OMP_CLAUSE_COPYIN */
275 1, /* OMP_CLAUSE_COPYPRIVATE */
276 3, /* OMP_CLAUSE_LINEAR */
277 2, /* OMP_CLAUSE_ALIGNED */
278 1, /* OMP_CLAUSE_DEPEND */
279 1, /* OMP_CLAUSE_UNIFORM */
280 1, /* OMP_CLAUSE_TO_DECLARE */
281 1, /* OMP_CLAUSE_LINK */
282 2, /* OMP_CLAUSE_FROM */
283 2, /* OMP_CLAUSE_TO */
284 2, /* OMP_CLAUSE_MAP */
285 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
286 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
287 2, /* OMP_CLAUSE__CACHE_ */
288 2, /* OMP_CLAUSE_GANG */
289 1, /* OMP_CLAUSE_ASYNC */
290 1, /* OMP_CLAUSE_WAIT */
291 0, /* OMP_CLAUSE_AUTO */
292 0, /* OMP_CLAUSE_SEQ */
293 1, /* OMP_CLAUSE__LOOPTEMP_ */
294 1, /* OMP_CLAUSE_IF */
295 1, /* OMP_CLAUSE_NUM_THREADS */
296 1, /* OMP_CLAUSE_SCHEDULE */
297 0, /* OMP_CLAUSE_NOWAIT */
298 1, /* OMP_CLAUSE_ORDERED */
299 0, /* OMP_CLAUSE_DEFAULT */
300 3, /* OMP_CLAUSE_COLLAPSE */
301 0, /* OMP_CLAUSE_UNTIED */
302 1, /* OMP_CLAUSE_FINAL */
303 0, /* OMP_CLAUSE_MERGEABLE */
304 1, /* OMP_CLAUSE_DEVICE */
305 1, /* OMP_CLAUSE_DIST_SCHEDULE */
306 0, /* OMP_CLAUSE_INBRANCH */
307 0, /* OMP_CLAUSE_NOTINBRANCH */
308 1, /* OMP_CLAUSE_NUM_TEAMS */
309 1, /* OMP_CLAUSE_THREAD_LIMIT */
310 0, /* OMP_CLAUSE_PROC_BIND */
311 1, /* OMP_CLAUSE_SAFELEN */
312 1, /* OMP_CLAUSE_SIMDLEN */
313 0, /* OMP_CLAUSE_FOR */
314 0, /* OMP_CLAUSE_PARALLEL */
315 0, /* OMP_CLAUSE_SECTIONS */
316 0, /* OMP_CLAUSE_TASKGROUP */
317 1, /* OMP_CLAUSE_PRIORITY */
318 1, /* OMP_CLAUSE_GRAINSIZE */
319 1, /* OMP_CLAUSE_NUM_TASKS */
320 0, /* OMP_CLAUSE_NOGROUP */
321 0, /* OMP_CLAUSE_THREADS */
322 0, /* OMP_CLAUSE_SIMD */
323 1, /* OMP_CLAUSE_HINT */
324 0, /* OMP_CLAUSE_DEFALTMAP */
325 1, /* OMP_CLAUSE__SIMDUID_ */
326 0, /* OMP_CLAUSE__SIMT_ */
327 0, /* OMP_CLAUSE_INDEPENDENT */
328 1, /* OMP_CLAUSE_WORKER */
329 1, /* OMP_CLAUSE_VECTOR */
330 1, /* OMP_CLAUSE_NUM_GANGS */
331 1, /* OMP_CLAUSE_NUM_WORKERS */
332 1, /* OMP_CLAUSE_VECTOR_LENGTH */
333 3, /* OMP_CLAUSE_TILE */
334 2, /* OMP_CLAUSE__GRIDDIM_ */
337 const char * const omp_clause_code_name
[] =
409 /* Return the tree node structure used by tree code CODE. */
411 static inline enum tree_node_structure_enum
412 tree_node_structure_for_code (enum tree_code code
)
414 switch (TREE_CODE_CLASS (code
))
416 case tcc_declaration
:
421 return TS_FIELD_DECL
;
427 return TS_LABEL_DECL
;
429 return TS_RESULT_DECL
;
430 case DEBUG_EXPR_DECL
:
433 return TS_CONST_DECL
;
437 return TS_FUNCTION_DECL
;
438 case TRANSLATION_UNIT_DECL
:
439 return TS_TRANSLATION_UNIT_DECL
;
441 return TS_DECL_NON_COMMON
;
445 return TS_TYPE_NON_COMMON
;
454 default: /* tcc_constant and tcc_exceptional */
459 /* tcc_constant cases. */
460 case VOID_CST
: return TS_TYPED
;
461 case INTEGER_CST
: return TS_INT_CST
;
462 case REAL_CST
: return TS_REAL_CST
;
463 case FIXED_CST
: return TS_FIXED_CST
;
464 case COMPLEX_CST
: return TS_COMPLEX
;
465 case VECTOR_CST
: return TS_VECTOR
;
466 case STRING_CST
: return TS_STRING
;
467 /* tcc_exceptional cases. */
468 case ERROR_MARK
: return TS_COMMON
;
469 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
470 case TREE_LIST
: return TS_LIST
;
471 case TREE_VEC
: return TS_VEC
;
472 case SSA_NAME
: return TS_SSA_NAME
;
473 case PLACEHOLDER_EXPR
: return TS_COMMON
;
474 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
475 case BLOCK
: return TS_BLOCK
;
476 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
477 case TREE_BINFO
: return TS_BINFO
;
478 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
479 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
480 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
488 /* Initialize tree_contains_struct to describe the hierarchy of tree
492 initialize_tree_contains_struct (void)
496 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
499 enum tree_node_structure_enum ts_code
;
501 code
= (enum tree_code
) i
;
502 ts_code
= tree_node_structure_for_code (code
);
504 /* Mark the TS structure itself. */
505 tree_contains_struct
[code
][ts_code
] = 1;
507 /* Mark all the structures that TS is derived from. */
512 case TS_OPTIMIZATION
:
513 case TS_TARGET_OPTION
:
527 case TS_STATEMENT_LIST
:
528 MARK_TS_TYPED (code
);
532 case TS_DECL_MINIMAL
:
538 MARK_TS_COMMON (code
);
541 case TS_TYPE_WITH_LANG_SPECIFIC
:
542 MARK_TS_TYPE_COMMON (code
);
545 case TS_TYPE_NON_COMMON
:
546 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
550 MARK_TS_DECL_MINIMAL (code
);
555 MARK_TS_DECL_COMMON (code
);
558 case TS_DECL_NON_COMMON
:
559 MARK_TS_DECL_WITH_VIS (code
);
562 case TS_DECL_WITH_VIS
:
566 MARK_TS_DECL_WRTL (code
);
570 MARK_TS_DECL_COMMON (code
);
574 MARK_TS_DECL_WITH_VIS (code
);
578 case TS_FUNCTION_DECL
:
579 MARK_TS_DECL_NON_COMMON (code
);
582 case TS_TRANSLATION_UNIT_DECL
:
583 MARK_TS_DECL_COMMON (code
);
591 /* Basic consistency checks for attributes used in fold. */
592 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
593 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
594 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
601 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
602 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
603 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
606 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
607 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
608 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
615 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
616 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
617 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
618 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
619 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
620 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
621 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
622 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
623 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
624 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
625 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
626 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
627 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
628 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
629 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
630 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
631 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
640 /* Initialize the hash table of types. */
642 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
645 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
648 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
650 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
652 int_cst_node
= make_int_cst (1, 1);
654 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
656 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
657 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
659 /* Initialize the tree_contains_struct array. */
660 initialize_tree_contains_struct ();
661 lang_hooks
.init_ts ();
665 /* The name of the object as the assembler will see it (but before any
666 translations made by ASM_OUTPUT_LABELREF). Often this is the same
667 as DECL_NAME. It is an IDENTIFIER_NODE. */
669 decl_assembler_name (tree decl
)
671 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
672 lang_hooks
.set_decl_assembler_name (decl
);
673 return DECL_ASSEMBLER_NAME_RAW (decl
);
676 /* The DECL_ASSEMBLER_NAME_RAW of DECL is being explicitly set to NAME
677 (either of which may be NULL). Inform the FE, if this changes the
681 overwrite_decl_assembler_name (tree decl
, tree name
)
683 if (DECL_ASSEMBLER_NAME_RAW (decl
) != name
)
684 lang_hooks
.overwrite_decl_assembler_name (decl
, name
);
687 /* When the target supports COMDAT groups, this indicates which group the
688 DECL is associated with. This can be either an IDENTIFIER_NODE or a
689 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
691 decl_comdat_group (const_tree node
)
693 struct symtab_node
*snode
= symtab_node::get (node
);
696 return snode
->get_comdat_group ();
699 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
701 decl_comdat_group_id (const_tree node
)
703 struct symtab_node
*snode
= symtab_node::get (node
);
706 return snode
->get_comdat_group_id ();
709 /* When the target supports named section, return its name as IDENTIFIER_NODE
710 or NULL if it is in no section. */
712 decl_section_name (const_tree node
)
714 struct symtab_node
*snode
= symtab_node::get (node
);
717 return snode
->get_section ();
720 /* Set section name of NODE to VALUE (that is expected to be
723 set_decl_section_name (tree node
, const char *value
)
725 struct symtab_node
*snode
;
729 snode
= symtab_node::get (node
);
733 else if (VAR_P (node
))
734 snode
= varpool_node::get_create (node
);
736 snode
= cgraph_node::get_create (node
);
737 snode
->set_section (value
);
740 /* Return TLS model of a variable NODE. */
742 decl_tls_model (const_tree node
)
744 struct varpool_node
*snode
= varpool_node::get (node
);
746 return TLS_MODEL_NONE
;
747 return snode
->tls_model
;
750 /* Set TLS model of variable NODE to MODEL. */
752 set_decl_tls_model (tree node
, enum tls_model model
)
754 struct varpool_node
*vnode
;
756 if (model
== TLS_MODEL_NONE
)
758 vnode
= varpool_node::get (node
);
763 vnode
= varpool_node::get_create (node
);
764 vnode
->tls_model
= model
;
767 /* Compute the number of bytes occupied by a tree with code CODE.
768 This function cannot be used for nodes that have variable sizes,
769 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
771 tree_code_size (enum tree_code code
)
773 switch (TREE_CODE_CLASS (code
))
775 case tcc_declaration
: /* A decl node */
778 case FIELD_DECL
: return sizeof (tree_field_decl
);
779 case PARM_DECL
: return sizeof (tree_parm_decl
);
780 case VAR_DECL
: return sizeof (tree_var_decl
);
781 case LABEL_DECL
: return sizeof (tree_label_decl
);
782 case RESULT_DECL
: return sizeof (tree_result_decl
);
783 case CONST_DECL
: return sizeof (tree_const_decl
);
784 case TYPE_DECL
: return sizeof (tree_type_decl
);
785 case FUNCTION_DECL
: return sizeof (tree_function_decl
);
786 case DEBUG_EXPR_DECL
: return sizeof (tree_decl_with_rtl
);
787 case TRANSLATION_UNIT_DECL
: return sizeof (tree_translation_unit_decl
);
790 case NAMELIST_DECL
: return sizeof (tree_decl_non_common
);
792 gcc_checking_assert (code
>= NUM_TREE_CODES
);
793 return lang_hooks
.tree_size (code
);
796 case tcc_type
: /* a type node */
807 case FIXED_POINT_TYPE
:
813 case QUAL_UNION_TYPE
:
815 case POINTER_BOUNDS_TYPE
:
818 case LANG_TYPE
: return sizeof (tree_type_non_common
);
820 gcc_checking_assert (code
>= NUM_TREE_CODES
);
821 return lang_hooks
.tree_size (code
);
824 case tcc_reference
: /* a reference */
825 case tcc_expression
: /* an expression */
826 case tcc_statement
: /* an expression with side effects */
827 case tcc_comparison
: /* a comparison expression */
828 case tcc_unary
: /* a unary arithmetic expression */
829 case tcc_binary
: /* a binary arithmetic expression */
830 return (sizeof (struct tree_exp
)
831 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
833 case tcc_constant
: /* a constant */
836 case VOID_CST
: return sizeof (tree_typed
);
837 case INTEGER_CST
: gcc_unreachable ();
838 case REAL_CST
: return sizeof (tree_real_cst
);
839 case FIXED_CST
: return sizeof (tree_fixed_cst
);
840 case COMPLEX_CST
: return sizeof (tree_complex
);
841 case VECTOR_CST
: gcc_unreachable ();
842 case STRING_CST
: gcc_unreachable ();
844 gcc_checking_assert (code
>= NUM_TREE_CODES
);
845 return lang_hooks
.tree_size (code
);
848 case tcc_exceptional
: /* something random, like an identifier. */
851 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
852 case TREE_LIST
: return sizeof (tree_list
);
855 case PLACEHOLDER_EXPR
: return sizeof (tree_common
);
857 case TREE_VEC
: gcc_unreachable ();
858 case OMP_CLAUSE
: gcc_unreachable ();
860 case SSA_NAME
: return sizeof (tree_ssa_name
);
862 case STATEMENT_LIST
: return sizeof (tree_statement_list
);
863 case BLOCK
: return sizeof (struct tree_block
);
864 case CONSTRUCTOR
: return sizeof (tree_constructor
);
865 case OPTIMIZATION_NODE
: return sizeof (tree_optimization_option
);
866 case TARGET_OPTION_NODE
: return sizeof (tree_target_option
);
869 gcc_checking_assert (code
>= NUM_TREE_CODES
);
870 return lang_hooks
.tree_size (code
);
878 /* Compute the number of bytes occupied by NODE. This routine only
879 looks at TREE_CODE, except for those nodes that have variable sizes. */
881 tree_size (const_tree node
)
883 const enum tree_code code
= TREE_CODE (node
);
887 return (sizeof (struct tree_int_cst
)
888 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
891 return (offsetof (struct tree_binfo
, base_binfos
)
893 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
896 return (sizeof (struct tree_vec
)
897 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
900 return (sizeof (struct tree_vector
)
901 + (vector_cst_encoded_nelts (node
) - 1) * sizeof (tree
));
904 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
907 return (sizeof (struct tree_omp_clause
)
908 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
912 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
913 return (sizeof (struct tree_exp
)
914 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
916 return tree_code_size (code
);
920 /* Record interesting allocation statistics for a tree node with CODE
924 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
925 size_t length ATTRIBUTE_UNUSED
)
927 enum tree_code_class type
= TREE_CODE_CLASS (code
);
930 if (!GATHER_STATISTICS
)
935 case tcc_declaration
: /* A decl node */
939 case tcc_type
: /* a type node */
943 case tcc_statement
: /* an expression with side effects */
947 case tcc_reference
: /* a reference */
951 case tcc_expression
: /* an expression */
952 case tcc_comparison
: /* a comparison expression */
953 case tcc_unary
: /* a unary arithmetic expression */
954 case tcc_binary
: /* a binary arithmetic expression */
958 case tcc_constant
: /* a constant */
962 case tcc_exceptional
: /* something random, like an identifier. */
965 case IDENTIFIER_NODE
:
978 kind
= ssa_name_kind
;
990 kind
= omp_clause_kind
;
1007 tree_code_counts
[(int) code
]++;
1008 tree_node_counts
[(int) kind
]++;
1009 tree_node_sizes
[(int) kind
] += length
;
1012 /* Allocate and return a new UID from the DECL_UID namespace. */
1015 allocate_decl_uid (void)
1017 return next_decl_uid
++;
1020 /* Return a newly allocated node of code CODE. For decl and type
1021 nodes, some other fields are initialized. The rest of the node is
1022 initialized to zero. This function cannot be used for TREE_VEC,
1023 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1026 Achoo! I got a code in the node. */
1029 make_node (enum tree_code code MEM_STAT_DECL
)
1032 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1033 size_t length
= tree_code_size (code
);
1035 record_node_allocation_statistics (code
, length
);
1037 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1038 TREE_SET_CODE (t
, code
);
1043 TREE_SIDE_EFFECTS (t
) = 1;
1046 case tcc_declaration
:
1047 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1049 if (code
== FUNCTION_DECL
)
1051 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1052 SET_DECL_MODE (t
, FUNCTION_MODE
);
1055 SET_DECL_ALIGN (t
, 1);
1057 DECL_SOURCE_LOCATION (t
) = input_location
;
1058 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1059 DECL_UID (t
) = --next_debug_decl_uid
;
1062 DECL_UID (t
) = allocate_decl_uid ();
1063 SET_DECL_PT_UID (t
, -1);
1065 if (TREE_CODE (t
) == LABEL_DECL
)
1066 LABEL_DECL_UID (t
) = -1;
1071 TYPE_UID (t
) = next_type_uid
++;
1072 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1073 TYPE_USER_ALIGN (t
) = 0;
1074 TYPE_MAIN_VARIANT (t
) = t
;
1075 TYPE_CANONICAL (t
) = t
;
1077 /* Default to no attributes for type, but let target change that. */
1078 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1079 targetm
.set_default_type_attributes (t
);
1081 /* We have not yet computed the alias set for this type. */
1082 TYPE_ALIAS_SET (t
) = -1;
1086 TREE_CONSTANT (t
) = 1;
1089 case tcc_expression
:
1095 case PREDECREMENT_EXPR
:
1096 case PREINCREMENT_EXPR
:
1097 case POSTDECREMENT_EXPR
:
1098 case POSTINCREMENT_EXPR
:
1099 /* All of these have side-effects, no matter what their
1101 TREE_SIDE_EFFECTS (t
) = 1;
1109 case tcc_exceptional
:
1112 case TARGET_OPTION_NODE
:
1113 TREE_TARGET_OPTION(t
)
1114 = ggc_cleared_alloc
<struct cl_target_option
> ();
1117 case OPTIMIZATION_NODE
:
1118 TREE_OPTIMIZATION (t
)
1119 = ggc_cleared_alloc
<struct cl_optimization
> ();
1128 /* Other classes need no special treatment. */
1135 /* Free tree node. */
1138 free_node (tree node
)
1140 enum tree_code code
= TREE_CODE (node
);
1141 if (GATHER_STATISTICS
)
1143 tree_code_counts
[(int) TREE_CODE (node
)]--;
1144 tree_node_counts
[(int) t_kind
]--;
1145 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1147 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1148 vec_free (CONSTRUCTOR_ELTS (node
));
1149 else if (code
== BLOCK
)
1150 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1151 else if (code
== TREE_BINFO
)
1152 vec_free (BINFO_BASE_ACCESSES (node
));
1156 /* Return a new node with the same contents as NODE except that its
1157 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1160 copy_node (tree node MEM_STAT_DECL
)
1163 enum tree_code code
= TREE_CODE (node
);
1166 gcc_assert (code
!= STATEMENT_LIST
);
1168 length
= tree_size (node
);
1169 record_node_allocation_statistics (code
, length
);
1170 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1171 memcpy (t
, node
, length
);
1173 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1175 TREE_ASM_WRITTEN (t
) = 0;
1176 TREE_VISITED (t
) = 0;
1178 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1180 if (code
== DEBUG_EXPR_DECL
)
1181 DECL_UID (t
) = --next_debug_decl_uid
;
1184 DECL_UID (t
) = allocate_decl_uid ();
1185 if (DECL_PT_UID_SET_P (node
))
1186 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1188 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1189 && DECL_HAS_VALUE_EXPR_P (node
))
1191 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1192 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1194 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1197 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1198 t
->decl_with_vis
.symtab_node
= NULL
;
1200 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1202 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1203 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1205 if (TREE_CODE (node
) == FUNCTION_DECL
)
1207 DECL_STRUCT_FUNCTION (t
) = NULL
;
1208 t
->decl_with_vis
.symtab_node
= NULL
;
1211 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1213 TYPE_UID (t
) = next_type_uid
++;
1214 /* The following is so that the debug code for
1215 the copy is different from the original type.
1216 The two statements usually duplicate each other
1217 (because they clear fields of the same union),
1218 but the optimizer should catch that. */
1219 TYPE_SYMTAB_ADDRESS (t
) = 0;
1220 TYPE_SYMTAB_DIE (t
) = 0;
1222 /* Do not copy the values cache. */
1223 if (TYPE_CACHED_VALUES_P (t
))
1225 TYPE_CACHED_VALUES_P (t
) = 0;
1226 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1229 else if (code
== TARGET_OPTION_NODE
)
1231 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1232 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1233 sizeof (struct cl_target_option
));
1235 else if (code
== OPTIMIZATION_NODE
)
1237 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1238 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1239 sizeof (struct cl_optimization
));
1245 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1246 For example, this can copy a list made of TREE_LIST nodes. */
1249 copy_list (tree list
)
1257 head
= prev
= copy_node (list
);
1258 next
= TREE_CHAIN (list
);
1261 TREE_CHAIN (prev
) = copy_node (next
);
1262 prev
= TREE_CHAIN (prev
);
1263 next
= TREE_CHAIN (next
);
1269 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1270 INTEGER_CST with value CST and type TYPE. */
1273 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1275 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1276 /* We need extra HWIs if CST is an unsigned integer with its
1278 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1279 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1280 return cst
.get_len ();
1283 /* Return a new INTEGER_CST with value CST and type TYPE. */
1286 build_new_int_cst (tree type
, const wide_int
&cst
)
1288 unsigned int len
= cst
.get_len ();
1289 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1290 tree nt
= make_int_cst (len
, ext_len
);
1295 TREE_INT_CST_ELT (nt
, ext_len
)
1296 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1297 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1298 TREE_INT_CST_ELT (nt
, i
) = -1;
1300 else if (TYPE_UNSIGNED (type
)
1301 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1304 TREE_INT_CST_ELT (nt
, len
)
1305 = zext_hwi (cst
.elt (len
),
1306 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1309 for (unsigned int i
= 0; i
< len
; i
++)
1310 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1311 TREE_TYPE (nt
) = type
;
1315 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1318 build_int_cst (tree type
, HOST_WIDE_INT low
)
1320 /* Support legacy code. */
1322 type
= integer_type_node
;
1324 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1328 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1330 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1333 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1336 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1339 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1342 /* Constructs tree in type TYPE from with value given by CST. Signedness
1343 of CST is assumed to be the same as the signedness of TYPE. */
1346 double_int_to_tree (tree type
, double_int cst
)
1348 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1351 /* We force the wide_int CST to the range of the type TYPE by sign or
1352 zero extending it. OVERFLOWABLE indicates if we are interested in
1353 overflow of the value, when >0 we are only interested in signed
1354 overflow, for <0 we are interested in any overflow. OVERFLOWED
1355 indicates whether overflow has already occurred. CONST_OVERFLOWED
1356 indicates whether constant overflow has already occurred. We force
1357 T's value to be within range of T's type (by setting to 0 or 1 all
1358 the bits outside the type's range). We set TREE_OVERFLOWED if,
1359 OVERFLOWED is nonzero,
1360 or OVERFLOWABLE is >0 and signed overflow occurs
1361 or OVERFLOWABLE is <0 and any overflow occurs
1362 We return a new tree node for the extended wide_int. The node
1363 is shared if no overflow flags are set. */
1367 force_fit_type (tree type
, const wide_int_ref
&cst
,
1368 int overflowable
, bool overflowed
)
1370 signop sign
= TYPE_SIGN (type
);
1372 /* If we need to set overflow flags, return a new unshared node. */
1373 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1377 || (overflowable
> 0 && sign
== SIGNED
))
1379 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1380 tree t
= build_new_int_cst (type
, tmp
);
1381 TREE_OVERFLOW (t
) = 1;
1386 /* Else build a shared node. */
1387 return wide_int_to_tree (type
, cst
);
1390 /* These are the hash table functions for the hash table of INTEGER_CST
1391 nodes of a sizetype. */
1393 /* Return the hash code X, an INTEGER_CST. */
1396 int_cst_hasher::hash (tree x
)
1398 const_tree
const t
= x
;
1399 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1402 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1403 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1408 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1409 is the same as that given by *Y, which is the same. */
1412 int_cst_hasher::equal (tree x
, tree y
)
1414 const_tree
const xt
= x
;
1415 const_tree
const yt
= y
;
1417 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1418 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1419 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1422 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1423 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1429 /* Create an INT_CST node of TYPE and value CST.
1430 The returned node is always shared. For small integers we use a
1431 per-type vector cache, for larger ones we use a single hash table.
1432 The value is extended from its precision according to the sign of
1433 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1434 the upper bits and ensures that hashing and value equality based
1435 upon the underlying HOST_WIDE_INTs works without masking. */
1438 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1445 unsigned int prec
= TYPE_PRECISION (type
);
1446 signop sgn
= TYPE_SIGN (type
);
1448 /* Verify that everything is canonical. */
1449 int l
= pcst
.get_len ();
1452 if (pcst
.elt (l
- 1) == 0)
1453 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1454 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1455 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1458 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1459 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1463 /* We just need to store a single HOST_WIDE_INT. */
1465 if (TYPE_UNSIGNED (type
))
1466 hwi
= cst
.to_uhwi ();
1468 hwi
= cst
.to_shwi ();
1470 switch (TREE_CODE (type
))
1473 gcc_assert (hwi
== 0);
1477 case REFERENCE_TYPE
:
1478 case POINTER_BOUNDS_TYPE
:
1479 /* Cache NULL pointer and zero bounds. */
1488 /* Cache false or true. */
1490 if (IN_RANGE (hwi
, 0, 1))
1496 if (TYPE_SIGN (type
) == UNSIGNED
)
1499 limit
= INTEGER_SHARE_LIMIT
;
1500 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1505 /* Cache [-1, N). */
1506 limit
= INTEGER_SHARE_LIMIT
+ 1;
1507 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1521 /* Look for it in the type's vector of small shared ints. */
1522 if (!TYPE_CACHED_VALUES_P (type
))
1524 TYPE_CACHED_VALUES_P (type
) = 1;
1525 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1528 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1530 /* Make sure no one is clobbering the shared constant. */
1531 gcc_checking_assert (TREE_TYPE (t
) == type
1532 && TREE_INT_CST_NUNITS (t
) == 1
1533 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1534 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1535 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1538 /* Create a new shared int. */
1539 t
= build_new_int_cst (type
, cst
);
1540 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1545 /* Use the cache of larger shared ints, using int_cst_node as
1548 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1549 TREE_TYPE (int_cst_node
) = type
;
1551 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1555 /* Insert this one into the hash table. */
1558 /* Make a new node for next time round. */
1559 int_cst_node
= make_int_cst (1, 1);
1565 /* The value either hashes properly or we drop it on the floor
1566 for the gc to take care of. There will not be enough of them
1569 tree nt
= build_new_int_cst (type
, cst
);
1570 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1574 /* Insert this one into the hash table. */
1586 cache_integer_cst (tree t
)
1588 tree type
= TREE_TYPE (t
);
1591 int prec
= TYPE_PRECISION (type
);
1593 gcc_assert (!TREE_OVERFLOW (t
));
1595 switch (TREE_CODE (type
))
1598 gcc_assert (integer_zerop (t
));
1602 case REFERENCE_TYPE
:
1603 /* Cache NULL pointer. */
1604 if (integer_zerop (t
))
1612 /* Cache false or true. */
1614 if (wi::ltu_p (wi::to_wide (t
), 2))
1615 ix
= TREE_INT_CST_ELT (t
, 0);
1620 if (TYPE_UNSIGNED (type
))
1623 limit
= INTEGER_SHARE_LIMIT
;
1625 /* This is a little hokie, but if the prec is smaller than
1626 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1627 obvious test will not get the correct answer. */
1628 if (prec
< HOST_BITS_PER_WIDE_INT
)
1630 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1631 ix
= tree_to_uhwi (t
);
1633 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1634 ix
= tree_to_uhwi (t
);
1639 limit
= INTEGER_SHARE_LIMIT
+ 1;
1641 if (integer_minus_onep (t
))
1643 else if (!wi::neg_p (wi::to_wide (t
)))
1645 if (prec
< HOST_BITS_PER_WIDE_INT
)
1647 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1648 ix
= tree_to_shwi (t
) + 1;
1650 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1651 ix
= tree_to_shwi (t
) + 1;
1665 /* Look for it in the type's vector of small shared ints. */
1666 if (!TYPE_CACHED_VALUES_P (type
))
1668 TYPE_CACHED_VALUES_P (type
) = 1;
1669 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1672 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1673 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1677 /* Use the cache of larger shared ints. */
1678 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1679 /* If there is already an entry for the number verify it's the
1682 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1684 /* Otherwise insert this one into the hash table. */
1690 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1691 and the rest are zeros. */
1694 build_low_bits_mask (tree type
, unsigned bits
)
1696 gcc_assert (bits
<= TYPE_PRECISION (type
));
1698 return wide_int_to_tree (type
, wi::mask (bits
, false,
1699 TYPE_PRECISION (type
)));
1702 /* Checks that X is integer constant that can be expressed in (unsigned)
1703 HOST_WIDE_INT without loss of precision. */
1706 cst_and_fits_in_hwi (const_tree x
)
1708 return (TREE_CODE (x
) == INTEGER_CST
1709 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1712 /* Build a newly constructed VECTOR_CST with the given values of
1713 (VECTOR_CST_)LOG2_NPATTERNS and (VECTOR_CST_)NELTS_PER_PATTERN. */
1716 make_vector (unsigned log2_npatterns
,
1717 unsigned int nelts_per_pattern MEM_STAT_DECL
)
1719 gcc_assert (IN_RANGE (nelts_per_pattern
, 1, 3));
1721 unsigned npatterns
= 1 << log2_npatterns
;
1722 unsigned encoded_nelts
= npatterns
* nelts_per_pattern
;
1723 unsigned length
= (sizeof (struct tree_vector
)
1724 + (encoded_nelts
- 1) * sizeof (tree
));
1726 record_node_allocation_statistics (VECTOR_CST
, length
);
1728 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1730 TREE_SET_CODE (t
, VECTOR_CST
);
1731 TREE_CONSTANT (t
) = 1;
1732 VECTOR_CST_LOG2_NPATTERNS (t
) = log2_npatterns
;
1733 VECTOR_CST_NELTS_PER_PATTERN (t
) = nelts_per_pattern
;
1738 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1739 are given by VALS. */
1742 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
1744 gcc_assert (vals
.length () == TYPE_VECTOR_SUBPARTS (type
));
1745 tree_vector_builder
builder (type
, vals
.length (), 1);
1746 builder
.splice (vals
);
1747 return builder
.build ();
1750 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1751 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1754 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1756 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1757 unsigned HOST_WIDE_INT idx
;
1760 tree_vector_builder
vec (type
, nelts
, 1);
1761 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1763 if (TREE_CODE (value
) == VECTOR_CST
)
1764 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1765 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1767 vec
.quick_push (value
);
1769 while (vec
.length () < nelts
)
1770 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1772 return vec
.build ();
1775 /* Build a vector of type VECTYPE where all the elements are SCs. */
1777 build_vector_from_val (tree vectype
, tree sc
)
1779 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1781 if (sc
== error_mark_node
)
1784 /* Verify that the vector type is suitable for SC. Note that there
1785 is some inconsistency in the type-system with respect to restrict
1786 qualifications of pointers. Vector types always have a main-variant
1787 element type and the qualification is applied to the vector-type.
1788 So TREE_TYPE (vector-type) does not return a properly qualified
1789 vector element-type. */
1790 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1791 TREE_TYPE (vectype
)));
1793 if (CONSTANT_CLASS_P (sc
))
1795 tree_vector_builder
v (vectype
, 1, 1);
1801 vec
<constructor_elt
, va_gc
> *v
;
1802 vec_alloc (v
, nunits
);
1803 for (i
= 0; i
< nunits
; ++i
)
1804 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1805 return build_constructor (vectype
, v
);
1809 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1810 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1813 recompute_constructor_flags (tree c
)
1817 bool constant_p
= true;
1818 bool side_effects_p
= false;
1819 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1821 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1823 /* Mostly ctors will have elts that don't have side-effects, so
1824 the usual case is to scan all the elements. Hence a single
1825 loop for both const and side effects, rather than one loop
1826 each (with early outs). */
1827 if (!TREE_CONSTANT (val
))
1829 if (TREE_SIDE_EFFECTS (val
))
1830 side_effects_p
= true;
1833 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1834 TREE_CONSTANT (c
) = constant_p
;
1837 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1841 verify_constructor_flags (tree c
)
1845 bool constant_p
= TREE_CONSTANT (c
);
1846 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1847 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1849 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1851 if (constant_p
&& !TREE_CONSTANT (val
))
1852 internal_error ("non-constant element in constant CONSTRUCTOR");
1853 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1854 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1858 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1859 are in the vec pointed to by VALS. */
1861 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1863 tree c
= make_node (CONSTRUCTOR
);
1865 TREE_TYPE (c
) = type
;
1866 CONSTRUCTOR_ELTS (c
) = vals
;
1868 recompute_constructor_flags (c
);
1873 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1876 build_constructor_single (tree type
, tree index
, tree value
)
1878 vec
<constructor_elt
, va_gc
> *v
;
1879 constructor_elt elt
= {index
, value
};
1882 v
->quick_push (elt
);
1884 return build_constructor (type
, v
);
1888 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1889 are in a list pointed to by VALS. */
1891 build_constructor_from_list (tree type
, tree vals
)
1894 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1898 vec_alloc (v
, list_length (vals
));
1899 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1900 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1903 return build_constructor (type
, v
);
1906 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1907 of elements, provided as index/value pairs. */
1910 build_constructor_va (tree type
, int nelts
, ...)
1912 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1915 va_start (p
, nelts
);
1916 vec_alloc (v
, nelts
);
1919 tree index
= va_arg (p
, tree
);
1920 tree value
= va_arg (p
, tree
);
1921 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1924 return build_constructor (type
, v
);
1927 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1930 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1933 FIXED_VALUE_TYPE
*fp
;
1935 v
= make_node (FIXED_CST
);
1936 fp
= ggc_alloc
<fixed_value
> ();
1937 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1939 TREE_TYPE (v
) = type
;
1940 TREE_FIXED_CST_PTR (v
) = fp
;
1944 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1947 build_real (tree type
, REAL_VALUE_TYPE d
)
1950 REAL_VALUE_TYPE
*dp
;
1953 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1954 Consider doing it via real_convert now. */
1956 v
= make_node (REAL_CST
);
1957 dp
= ggc_alloc
<real_value
> ();
1958 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1960 TREE_TYPE (v
) = type
;
1961 TREE_REAL_CST_PTR (v
) = dp
;
1962 TREE_OVERFLOW (v
) = overflow
;
1966 /* Like build_real, but first truncate D to the type. */
1969 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1971 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1974 /* Return a new REAL_CST node whose type is TYPE
1975 and whose value is the integer value of the INTEGER_CST node I. */
1978 real_value_from_int_cst (const_tree type
, const_tree i
)
1982 /* Clear all bits of the real value type so that we can later do
1983 bitwise comparisons to see if two values are the same. */
1984 memset (&d
, 0, sizeof d
);
1986 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
1987 TYPE_SIGN (TREE_TYPE (i
)));
1991 /* Given a tree representing an integer constant I, return a tree
1992 representing the same value as a floating-point constant of type TYPE. */
1995 build_real_from_int_cst (tree type
, const_tree i
)
1998 int overflow
= TREE_OVERFLOW (i
);
2000 v
= build_real (type
, real_value_from_int_cst (type
, i
));
2002 TREE_OVERFLOW (v
) |= overflow
;
2006 /* Return a newly constructed STRING_CST node whose value is
2007 the LEN characters at STR.
2008 Note that for a C string literal, LEN should include the trailing NUL.
2009 The TREE_TYPE is not initialized. */
2012 build_string (int len
, const char *str
)
2017 /* Do not waste bytes provided by padding of struct tree_string. */
2018 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2020 record_node_allocation_statistics (STRING_CST
, length
);
2022 s
= (tree
) ggc_internal_alloc (length
);
2024 memset (s
, 0, sizeof (struct tree_typed
));
2025 TREE_SET_CODE (s
, STRING_CST
);
2026 TREE_CONSTANT (s
) = 1;
2027 TREE_STRING_LENGTH (s
) = len
;
2028 memcpy (s
->string
.str
, str
, len
);
2029 s
->string
.str
[len
] = '\0';
2034 /* Return a newly constructed COMPLEX_CST node whose value is
2035 specified by the real and imaginary parts REAL and IMAG.
2036 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2037 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2040 build_complex (tree type
, tree real
, tree imag
)
2042 tree t
= make_node (COMPLEX_CST
);
2044 TREE_REALPART (t
) = real
;
2045 TREE_IMAGPART (t
) = imag
;
2046 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2047 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2051 /* Build a complex (inf +- 0i), such as for the result of cproj.
2052 TYPE is the complex tree type of the result. If NEG is true, the
2053 imaginary zero is negative. */
2056 build_complex_inf (tree type
, bool neg
)
2058 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2062 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2063 build_real (TREE_TYPE (type
), rzero
));
2066 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2067 element is set to 1. In particular, this is 1 + i for complex types. */
2070 build_each_one_cst (tree type
)
2072 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2074 tree scalar
= build_one_cst (TREE_TYPE (type
));
2075 return build_complex (type
, scalar
, scalar
);
2078 return build_one_cst (type
);
2081 /* Return a constant of arithmetic type TYPE which is the
2082 multiplicative identity of the set TYPE. */
2085 build_one_cst (tree type
)
2087 switch (TREE_CODE (type
))
2089 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2090 case POINTER_TYPE
: case REFERENCE_TYPE
:
2092 return build_int_cst (type
, 1);
2095 return build_real (type
, dconst1
);
2097 case FIXED_POINT_TYPE
:
2098 /* We can only generate 1 for accum types. */
2099 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2100 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2104 tree scalar
= build_one_cst (TREE_TYPE (type
));
2106 return build_vector_from_val (type
, scalar
);
2110 return build_complex (type
,
2111 build_one_cst (TREE_TYPE (type
)),
2112 build_zero_cst (TREE_TYPE (type
)));
2119 /* Return an integer of type TYPE containing all 1's in as much precision as
2120 it contains, or a complex or vector whose subparts are such integers. */
2123 build_all_ones_cst (tree type
)
2125 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2127 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2128 return build_complex (type
, scalar
, scalar
);
2131 return build_minus_one_cst (type
);
2134 /* Return a constant of arithmetic type TYPE which is the
2135 opposite of the multiplicative identity of the set TYPE. */
2138 build_minus_one_cst (tree type
)
2140 switch (TREE_CODE (type
))
2142 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2143 case POINTER_TYPE
: case REFERENCE_TYPE
:
2145 return build_int_cst (type
, -1);
2148 return build_real (type
, dconstm1
);
2150 case FIXED_POINT_TYPE
:
2151 /* We can only generate 1 for accum types. */
2152 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2153 return build_fixed (type
,
2154 fixed_from_double_int (double_int_minus_one
,
2155 SCALAR_TYPE_MODE (type
)));
2159 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2161 return build_vector_from_val (type
, scalar
);
2165 return build_complex (type
,
2166 build_minus_one_cst (TREE_TYPE (type
)),
2167 build_zero_cst (TREE_TYPE (type
)));
2174 /* Build 0 constant of type TYPE. This is used by constructor folding
2175 and thus the constant should be represented in memory by
2179 build_zero_cst (tree type
)
2181 switch (TREE_CODE (type
))
2183 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2184 case POINTER_TYPE
: case REFERENCE_TYPE
:
2185 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2186 return build_int_cst (type
, 0);
2189 return build_real (type
, dconst0
);
2191 case FIXED_POINT_TYPE
:
2192 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2196 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2198 return build_vector_from_val (type
, scalar
);
2203 tree zero
= build_zero_cst (TREE_TYPE (type
));
2205 return build_complex (type
, zero
, zero
);
2209 if (!AGGREGATE_TYPE_P (type
))
2210 return fold_convert (type
, integer_zero_node
);
2211 return build_constructor (type
, NULL
);
2216 /* Build a BINFO with LEN language slots. */
2219 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2222 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2223 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2225 record_node_allocation_statistics (TREE_BINFO
, length
);
2227 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2229 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2231 TREE_SET_CODE (t
, TREE_BINFO
);
2233 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2238 /* Create a CASE_LABEL_EXPR tree node and return it. */
2241 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2243 tree t
= make_node (CASE_LABEL_EXPR
);
2245 TREE_TYPE (t
) = void_type_node
;
2246 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2248 CASE_LOW (t
) = low_value
;
2249 CASE_HIGH (t
) = high_value
;
2250 CASE_LABEL (t
) = label_decl
;
2251 CASE_CHAIN (t
) = NULL_TREE
;
2256 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2257 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2258 The latter determines the length of the HOST_WIDE_INT vector. */
2261 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2264 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2265 + sizeof (struct tree_int_cst
));
2268 record_node_allocation_statistics (INTEGER_CST
, length
);
2270 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2272 TREE_SET_CODE (t
, INTEGER_CST
);
2273 TREE_INT_CST_NUNITS (t
) = len
;
2274 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2275 /* to_offset can only be applied to trees that are offset_int-sized
2276 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2277 must be exactly the precision of offset_int and so LEN is correct. */
2278 if (ext_len
<= OFFSET_INT_ELTS
)
2279 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2281 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2283 TREE_CONSTANT (t
) = 1;
2288 /* Build a newly constructed TREE_VEC node of length LEN. */
2291 make_tree_vec (int len MEM_STAT_DECL
)
2294 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2296 record_node_allocation_statistics (TREE_VEC
, length
);
2298 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2300 TREE_SET_CODE (t
, TREE_VEC
);
2301 TREE_VEC_LENGTH (t
) = len
;
2306 /* Grow a TREE_VEC node to new length LEN. */
2309 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2311 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2313 int oldlen
= TREE_VEC_LENGTH (v
);
2314 gcc_assert (len
> oldlen
);
2316 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2317 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2319 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2321 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2323 TREE_VEC_LENGTH (v
) = len
;
2328 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2329 fixed, and scalar, complex or vector. */
2332 zerop (const_tree expr
)
2334 return (integer_zerop (expr
)
2335 || real_zerop (expr
)
2336 || fixed_zerop (expr
));
2339 /* Return 1 if EXPR is the integer constant zero or a complex constant
2343 integer_zerop (const_tree expr
)
2345 switch (TREE_CODE (expr
))
2348 return wi::to_wide (expr
) == 0;
2350 return (integer_zerop (TREE_REALPART (expr
))
2351 && integer_zerop (TREE_IMAGPART (expr
)));
2355 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2356 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2365 /* Return 1 if EXPR is the integer constant one or the corresponding
2366 complex constant. */
2369 integer_onep (const_tree expr
)
2371 switch (TREE_CODE (expr
))
2374 return wi::eq_p (wi::to_widest (expr
), 1);
2376 return (integer_onep (TREE_REALPART (expr
))
2377 && integer_zerop (TREE_IMAGPART (expr
)));
2381 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2382 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2391 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2392 return 1 if every piece is the integer constant one. */
2395 integer_each_onep (const_tree expr
)
2397 if (TREE_CODE (expr
) == COMPLEX_CST
)
2398 return (integer_onep (TREE_REALPART (expr
))
2399 && integer_onep (TREE_IMAGPART (expr
)));
2401 return integer_onep (expr
);
2404 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2405 it contains, or a complex or vector whose subparts are such integers. */
2408 integer_all_onesp (const_tree expr
)
2410 if (TREE_CODE (expr
) == COMPLEX_CST
2411 && integer_all_onesp (TREE_REALPART (expr
))
2412 && integer_all_onesp (TREE_IMAGPART (expr
)))
2415 else if (TREE_CODE (expr
) == VECTOR_CST
)
2418 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2419 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2424 else if (TREE_CODE (expr
) != INTEGER_CST
)
2427 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2428 == wi::to_wide (expr
));
2431 /* Return 1 if EXPR is the integer constant minus one. */
2434 integer_minus_onep (const_tree expr
)
2436 if (TREE_CODE (expr
) == COMPLEX_CST
)
2437 return (integer_all_onesp (TREE_REALPART (expr
))
2438 && integer_zerop (TREE_IMAGPART (expr
)));
2440 return integer_all_onesp (expr
);
2443 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2447 integer_pow2p (const_tree expr
)
2449 if (TREE_CODE (expr
) == COMPLEX_CST
2450 && integer_pow2p (TREE_REALPART (expr
))
2451 && integer_zerop (TREE_IMAGPART (expr
)))
2454 if (TREE_CODE (expr
) != INTEGER_CST
)
2457 return wi::popcount (wi::to_wide (expr
)) == 1;
2460 /* Return 1 if EXPR is an integer constant other than zero or a
2461 complex constant other than zero. */
2464 integer_nonzerop (const_tree expr
)
2466 return ((TREE_CODE (expr
) == INTEGER_CST
2467 && wi::to_wide (expr
) != 0)
2468 || (TREE_CODE (expr
) == COMPLEX_CST
2469 && (integer_nonzerop (TREE_REALPART (expr
))
2470 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2473 /* Return 1 if EXPR is the integer constant one. For vector,
2474 return 1 if every piece is the integer constant minus one
2475 (representing the value TRUE). */
2478 integer_truep (const_tree expr
)
2480 if (TREE_CODE (expr
) == VECTOR_CST
)
2481 return integer_all_onesp (expr
);
2482 return integer_onep (expr
);
2485 /* Return 1 if EXPR is the fixed-point constant zero. */
2488 fixed_zerop (const_tree expr
)
2490 return (TREE_CODE (expr
) == FIXED_CST
2491 && TREE_FIXED_CST (expr
).data
.is_zero ());
2494 /* Return the power of two represented by a tree node known to be a
2498 tree_log2 (const_tree expr
)
2500 if (TREE_CODE (expr
) == COMPLEX_CST
)
2501 return tree_log2 (TREE_REALPART (expr
));
2503 return wi::exact_log2 (wi::to_wide (expr
));
2506 /* Similar, but return the largest integer Y such that 2 ** Y is less
2507 than or equal to EXPR. */
2510 tree_floor_log2 (const_tree expr
)
2512 if (TREE_CODE (expr
) == COMPLEX_CST
)
2513 return tree_log2 (TREE_REALPART (expr
));
2515 return wi::floor_log2 (wi::to_wide (expr
));
2518 /* Return number of known trailing zero bits in EXPR, or, if the value of
2519 EXPR is known to be zero, the precision of it's type. */
2522 tree_ctz (const_tree expr
)
2524 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2525 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2528 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2529 switch (TREE_CODE (expr
))
2532 ret1
= wi::ctz (wi::to_wide (expr
));
2533 return MIN (ret1
, prec
);
2535 ret1
= wi::ctz (get_nonzero_bits (expr
));
2536 return MIN (ret1
, prec
);
2543 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2546 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2547 return MIN (ret1
, ret2
);
2548 case POINTER_PLUS_EXPR
:
2549 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2550 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2551 /* Second operand is sizetype, which could be in theory
2552 wider than pointer's precision. Make sure we never
2553 return more than prec. */
2554 ret2
= MIN (ret2
, prec
);
2555 return MIN (ret1
, ret2
);
2557 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2558 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2559 return MAX (ret1
, ret2
);
2561 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2562 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2563 return MIN (ret1
+ ret2
, prec
);
2565 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2566 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2567 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2569 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2570 return MIN (ret1
+ ret2
, prec
);
2574 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2575 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2577 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2578 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2583 case TRUNC_DIV_EXPR
:
2585 case FLOOR_DIV_EXPR
:
2586 case ROUND_DIV_EXPR
:
2587 case EXACT_DIV_EXPR
:
2588 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2589 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2591 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2594 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2602 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2603 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2605 return MIN (ret1
, prec
);
2607 return tree_ctz (TREE_OPERAND (expr
, 0));
2609 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2612 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2613 return MIN (ret1
, ret2
);
2615 return tree_ctz (TREE_OPERAND (expr
, 1));
2617 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2618 if (ret1
> BITS_PER_UNIT
)
2620 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2621 return MIN (ret1
, prec
);
2629 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2630 decimal float constants, so don't return 1 for them. */
2633 real_zerop (const_tree expr
)
2635 switch (TREE_CODE (expr
))
2638 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2639 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2641 return real_zerop (TREE_REALPART (expr
))
2642 && real_zerop (TREE_IMAGPART (expr
));
2646 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2647 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2656 /* Return 1 if EXPR is the real constant one in real or complex form.
2657 Trailing zeroes matter for decimal float constants, so don't return
2661 real_onep (const_tree expr
)
2663 switch (TREE_CODE (expr
))
2666 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2667 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2669 return real_onep (TREE_REALPART (expr
))
2670 && real_zerop (TREE_IMAGPART (expr
));
2674 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2675 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2684 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2685 matter for decimal float constants, so don't return 1 for them. */
2688 real_minus_onep (const_tree expr
)
2690 switch (TREE_CODE (expr
))
2693 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2694 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2696 return real_minus_onep (TREE_REALPART (expr
))
2697 && real_zerop (TREE_IMAGPART (expr
));
2701 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2702 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2711 /* Nonzero if EXP is a constant or a cast of a constant. */
2714 really_constant_p (const_tree exp
)
2716 /* This is not quite the same as STRIP_NOPS. It does more. */
2717 while (CONVERT_EXPR_P (exp
)
2718 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2719 exp
= TREE_OPERAND (exp
, 0);
2720 return TREE_CONSTANT (exp
);
2723 /* Return first list element whose TREE_VALUE is ELEM.
2724 Return 0 if ELEM is not in LIST. */
2727 value_member (tree elem
, tree list
)
2731 if (elem
== TREE_VALUE (list
))
2733 list
= TREE_CHAIN (list
);
2738 /* Return first list element whose TREE_PURPOSE is ELEM.
2739 Return 0 if ELEM is not in LIST. */
2742 purpose_member (const_tree elem
, tree list
)
2746 if (elem
== TREE_PURPOSE (list
))
2748 list
= TREE_CHAIN (list
);
2753 /* Return true if ELEM is in V. */
2756 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2760 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2766 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2770 chain_index (int idx
, tree chain
)
2772 for (; chain
&& idx
> 0; --idx
)
2773 chain
= TREE_CHAIN (chain
);
2777 /* Return nonzero if ELEM is part of the chain CHAIN. */
2780 chain_member (const_tree elem
, const_tree chain
)
2786 chain
= DECL_CHAIN (chain
);
2792 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2793 We expect a null pointer to mark the end of the chain.
2794 This is the Lisp primitive `length'. */
2797 list_length (const_tree t
)
2800 #ifdef ENABLE_TREE_CHECKING
2808 #ifdef ENABLE_TREE_CHECKING
2811 gcc_assert (p
!= q
);
2819 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2820 UNION_TYPE TYPE, or NULL_TREE if none. */
2823 first_field (const_tree type
)
2825 tree t
= TYPE_FIELDS (type
);
2826 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2831 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2832 by modifying the last node in chain 1 to point to chain 2.
2833 This is the Lisp primitive `nconc'. */
2836 chainon (tree op1
, tree op2
)
2845 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2847 TREE_CHAIN (t1
) = op2
;
2849 #ifdef ENABLE_TREE_CHECKING
2852 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2853 gcc_assert (t2
!= t1
);
2860 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2863 tree_last (tree chain
)
2867 while ((next
= TREE_CHAIN (chain
)))
2872 /* Reverse the order of elements in the chain T,
2873 and return the new head of the chain (old last element). */
2878 tree prev
= 0, decl
, next
;
2879 for (decl
= t
; decl
; decl
= next
)
2881 /* We shouldn't be using this function to reverse BLOCK chains; we
2882 have blocks_nreverse for that. */
2883 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2884 next
= TREE_CHAIN (decl
);
2885 TREE_CHAIN (decl
) = prev
;
2891 /* Return a newly created TREE_LIST node whose
2892 purpose and value fields are PARM and VALUE. */
2895 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
2897 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
2898 TREE_PURPOSE (t
) = parm
;
2899 TREE_VALUE (t
) = value
;
2903 /* Build a chain of TREE_LIST nodes from a vector. */
2906 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2908 tree ret
= NULL_TREE
;
2912 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2914 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
2915 pp
= &TREE_CHAIN (*pp
);
2920 /* Return a newly created TREE_LIST node whose
2921 purpose and value fields are PURPOSE and VALUE
2922 and whose TREE_CHAIN is CHAIN. */
2925 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2929 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2930 memset (node
, 0, sizeof (struct tree_common
));
2932 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2934 TREE_SET_CODE (node
, TREE_LIST
);
2935 TREE_CHAIN (node
) = chain
;
2936 TREE_PURPOSE (node
) = purpose
;
2937 TREE_VALUE (node
) = value
;
2941 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2945 ctor_to_vec (tree ctor
)
2947 vec
<tree
, va_gc
> *vec
;
2948 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2952 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2953 vec
->quick_push (val
);
2958 /* Return the size nominally occupied by an object of type TYPE
2959 when it resides in memory. The value is measured in units of bytes,
2960 and its data type is that normally used for type sizes
2961 (which is the first type created by make_signed_type or
2962 make_unsigned_type). */
2965 size_in_bytes_loc (location_t loc
, const_tree type
)
2969 if (type
== error_mark_node
)
2970 return integer_zero_node
;
2972 type
= TYPE_MAIN_VARIANT (type
);
2973 t
= TYPE_SIZE_UNIT (type
);
2977 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2978 return size_zero_node
;
2984 /* Return the size of TYPE (in bytes) as a wide integer
2985 or return -1 if the size can vary or is larger than an integer. */
2988 int_size_in_bytes (const_tree type
)
2992 if (type
== error_mark_node
)
2995 type
= TYPE_MAIN_VARIANT (type
);
2996 t
= TYPE_SIZE_UNIT (type
);
2998 if (t
&& tree_fits_uhwi_p (t
))
2999 return TREE_INT_CST_LOW (t
);
3004 /* Return the maximum size of TYPE (in bytes) as a wide integer
3005 or return -1 if the size can vary or is larger than an integer. */
3008 max_int_size_in_bytes (const_tree type
)
3010 HOST_WIDE_INT size
= -1;
3013 /* If this is an array type, check for a possible MAX_SIZE attached. */
3015 if (TREE_CODE (type
) == ARRAY_TYPE
)
3017 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3019 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3020 size
= tree_to_uhwi (size_tree
);
3023 /* If we still haven't been able to get a size, see if the language
3024 can compute a maximum size. */
3028 size_tree
= lang_hooks
.types
.max_size (type
);
3030 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3031 size
= tree_to_uhwi (size_tree
);
3037 /* Return the bit position of FIELD, in bits from the start of the record.
3038 This is a tree of type bitsizetype. */
3041 bit_position (const_tree field
)
3043 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3044 DECL_FIELD_BIT_OFFSET (field
));
3047 /* Return the byte position of FIELD, in bytes from the start of the record.
3048 This is a tree of type sizetype. */
3051 byte_position (const_tree field
)
3053 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3054 DECL_FIELD_BIT_OFFSET (field
));
3057 /* Likewise, but return as an integer. It must be representable in
3058 that way (since it could be a signed value, we don't have the
3059 option of returning -1 like int_size_in_byte can. */
3062 int_byte_position (const_tree field
)
3064 return tree_to_shwi (byte_position (field
));
3067 /* Return the strictest alignment, in bits, that T is known to have. */
3070 expr_align (const_tree t
)
3072 unsigned int align0
, align1
;
3074 switch (TREE_CODE (t
))
3076 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3077 /* If we have conversions, we know that the alignment of the
3078 object must meet each of the alignments of the types. */
3079 align0
= expr_align (TREE_OPERAND (t
, 0));
3080 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3081 return MAX (align0
, align1
);
3083 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3084 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3085 case CLEANUP_POINT_EXPR
:
3086 /* These don't change the alignment of an object. */
3087 return expr_align (TREE_OPERAND (t
, 0));
3090 /* The best we can do is say that the alignment is the least aligned
3092 align0
= expr_align (TREE_OPERAND (t
, 1));
3093 align1
= expr_align (TREE_OPERAND (t
, 2));
3094 return MIN (align0
, align1
);
3096 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3097 meaningfully, it's always 1. */
3098 case LABEL_DECL
: case CONST_DECL
:
3099 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3101 gcc_assert (DECL_ALIGN (t
) != 0);
3102 return DECL_ALIGN (t
);
3108 /* Otherwise take the alignment from that of the type. */
3109 return TYPE_ALIGN (TREE_TYPE (t
));
3112 /* Return, as a tree node, the number of elements for TYPE (which is an
3113 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3116 array_type_nelts (const_tree type
)
3118 tree index_type
, min
, max
;
3120 /* If they did it with unspecified bounds, then we should have already
3121 given an error about it before we got here. */
3122 if (! TYPE_DOMAIN (type
))
3123 return error_mark_node
;
3125 index_type
= TYPE_DOMAIN (type
);
3126 min
= TYPE_MIN_VALUE (index_type
);
3127 max
= TYPE_MAX_VALUE (index_type
);
3129 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3131 return error_mark_node
;
3133 return (integer_zerop (min
)
3135 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3138 /* If arg is static -- a reference to an object in static storage -- then
3139 return the object. This is not the same as the C meaning of `static'.
3140 If arg isn't static, return NULL. */
3145 switch (TREE_CODE (arg
))
3148 /* Nested functions are static, even though taking their address will
3149 involve a trampoline as we unnest the nested function and create
3150 the trampoline on the tree level. */
3154 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3155 && ! DECL_THREAD_LOCAL_P (arg
)
3156 && ! DECL_DLLIMPORT_P (arg
)
3160 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3164 return TREE_STATIC (arg
) ? arg
: NULL
;
3171 /* If the thing being referenced is not a field, then it is
3172 something language specific. */
3173 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3175 /* If we are referencing a bitfield, we can't evaluate an
3176 ADDR_EXPR at compile time and so it isn't a constant. */
3177 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3180 return staticp (TREE_OPERAND (arg
, 0));
3186 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3189 case ARRAY_RANGE_REF
:
3190 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3191 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3192 return staticp (TREE_OPERAND (arg
, 0));
3196 case COMPOUND_LITERAL_EXPR
:
3197 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3207 /* Return whether OP is a DECL whose address is function-invariant. */
3210 decl_address_invariant_p (const_tree op
)
3212 /* The conditions below are slightly less strict than the one in
3215 switch (TREE_CODE (op
))
3224 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3225 || DECL_THREAD_LOCAL_P (op
)
3226 || DECL_CONTEXT (op
) == current_function_decl
3227 || decl_function_context (op
) == current_function_decl
)
3232 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3233 || decl_function_context (op
) == current_function_decl
)
3244 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3247 decl_address_ip_invariant_p (const_tree op
)
3249 /* The conditions below are slightly less strict than the one in
3252 switch (TREE_CODE (op
))
3260 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3261 && !DECL_DLLIMPORT_P (op
))
3262 || DECL_THREAD_LOCAL_P (op
))
3267 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3279 /* Return true if T is function-invariant (internal function, does
3280 not handle arithmetic; that's handled in skip_simple_arithmetic and
3281 tree_invariant_p). */
3284 tree_invariant_p_1 (tree t
)
3288 if (TREE_CONSTANT (t
)
3289 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3292 switch (TREE_CODE (t
))
3298 op
= TREE_OPERAND (t
, 0);
3299 while (handled_component_p (op
))
3301 switch (TREE_CODE (op
))
3304 case ARRAY_RANGE_REF
:
3305 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3306 || TREE_OPERAND (op
, 2) != NULL_TREE
3307 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3312 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3318 op
= TREE_OPERAND (op
, 0);
3321 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3330 /* Return true if T is function-invariant. */
3333 tree_invariant_p (tree t
)
3335 tree inner
= skip_simple_arithmetic (t
);
3336 return tree_invariant_p_1 (inner
);
3339 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3340 Do this to any expression which may be used in more than one place,
3341 but must be evaluated only once.
3343 Normally, expand_expr would reevaluate the expression each time.
3344 Calling save_expr produces something that is evaluated and recorded
3345 the first time expand_expr is called on it. Subsequent calls to
3346 expand_expr just reuse the recorded value.
3348 The call to expand_expr that generates code that actually computes
3349 the value is the first call *at compile time*. Subsequent calls
3350 *at compile time* generate code to use the saved value.
3351 This produces correct result provided that *at run time* control
3352 always flows through the insns made by the first expand_expr
3353 before reaching the other places where the save_expr was evaluated.
3354 You, the caller of save_expr, must make sure this is so.
3356 Constants, and certain read-only nodes, are returned with no
3357 SAVE_EXPR because that is safe. Expressions containing placeholders
3358 are not touched; see tree.def for an explanation of what these
3362 save_expr (tree expr
)
3366 /* If the tree evaluates to a constant, then we don't want to hide that
3367 fact (i.e. this allows further folding, and direct checks for constants).
3368 However, a read-only object that has side effects cannot be bypassed.
3369 Since it is no problem to reevaluate literals, we just return the
3371 inner
= skip_simple_arithmetic (expr
);
3372 if (TREE_CODE (inner
) == ERROR_MARK
)
3375 if (tree_invariant_p_1 (inner
))
3378 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3379 it means that the size or offset of some field of an object depends on
3380 the value within another field.
3382 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3383 and some variable since it would then need to be both evaluated once and
3384 evaluated more than once. Front-ends must assure this case cannot
3385 happen by surrounding any such subexpressions in their own SAVE_EXPR
3386 and forcing evaluation at the proper time. */
3387 if (contains_placeholder_p (inner
))
3390 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3392 /* This expression might be placed ahead of a jump to ensure that the
3393 value was computed on both sides of the jump. So make sure it isn't
3394 eliminated as dead. */
3395 TREE_SIDE_EFFECTS (expr
) = 1;
3399 /* Look inside EXPR into any simple arithmetic operations. Return the
3400 outermost non-arithmetic or non-invariant node. */
3403 skip_simple_arithmetic (tree expr
)
3405 /* We don't care about whether this can be used as an lvalue in this
3407 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3408 expr
= TREE_OPERAND (expr
, 0);
3410 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3411 a constant, it will be more efficient to not make another SAVE_EXPR since
3412 it will allow better simplification and GCSE will be able to merge the
3413 computations if they actually occur. */
3416 if (UNARY_CLASS_P (expr
))
3417 expr
= TREE_OPERAND (expr
, 0);
3418 else if (BINARY_CLASS_P (expr
))
3420 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3421 expr
= TREE_OPERAND (expr
, 0);
3422 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3423 expr
= TREE_OPERAND (expr
, 1);
3434 /* Look inside EXPR into simple arithmetic operations involving constants.
3435 Return the outermost non-arithmetic or non-constant node. */
3438 skip_simple_constant_arithmetic (tree expr
)
3440 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3441 expr
= TREE_OPERAND (expr
, 0);
3445 if (UNARY_CLASS_P (expr
))
3446 expr
= TREE_OPERAND (expr
, 0);
3447 else if (BINARY_CLASS_P (expr
))
3449 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3450 expr
= TREE_OPERAND (expr
, 0);
3451 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3452 expr
= TREE_OPERAND (expr
, 1);
3463 /* Return which tree structure is used by T. */
3465 enum tree_node_structure_enum
3466 tree_node_structure (const_tree t
)
3468 const enum tree_code code
= TREE_CODE (t
);
3469 return tree_node_structure_for_code (code
);
3472 /* Set various status flags when building a CALL_EXPR object T. */
3475 process_call_operands (tree t
)
3477 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3478 bool read_only
= false;
3479 int i
= call_expr_flags (t
);
3481 /* Calls have side-effects, except those to const or pure functions. */
3482 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3483 side_effects
= true;
3484 /* Propagate TREE_READONLY of arguments for const functions. */
3488 if (!side_effects
|| read_only
)
3489 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3491 tree op
= TREE_OPERAND (t
, i
);
3492 if (op
&& TREE_SIDE_EFFECTS (op
))
3493 side_effects
= true;
3494 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3498 TREE_SIDE_EFFECTS (t
) = side_effects
;
3499 TREE_READONLY (t
) = read_only
;
3502 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3503 size or offset that depends on a field within a record. */
3506 contains_placeholder_p (const_tree exp
)
3508 enum tree_code code
;
3513 code
= TREE_CODE (exp
);
3514 if (code
== PLACEHOLDER_EXPR
)
3517 switch (TREE_CODE_CLASS (code
))
3520 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3521 position computations since they will be converted into a
3522 WITH_RECORD_EXPR involving the reference, which will assume
3523 here will be valid. */
3524 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3526 case tcc_exceptional
:
3527 if (code
== TREE_LIST
)
3528 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3529 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3534 case tcc_comparison
:
3535 case tcc_expression
:
3539 /* Ignoring the first operand isn't quite right, but works best. */
3540 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3543 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3544 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3545 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3548 /* The save_expr function never wraps anything containing
3549 a PLACEHOLDER_EXPR. */
3556 switch (TREE_CODE_LENGTH (code
))
3559 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3561 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3562 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3573 const_call_expr_arg_iterator iter
;
3574 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3575 if (CONTAINS_PLACEHOLDER_P (arg
))
3589 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3590 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3594 type_contains_placeholder_1 (const_tree type
)
3596 /* If the size contains a placeholder or the parent type (component type in
3597 the case of arrays) type involves a placeholder, this type does. */
3598 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3599 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3600 || (!POINTER_TYPE_P (type
)
3602 && type_contains_placeholder_p (TREE_TYPE (type
))))
3605 /* Now do type-specific checks. Note that the last part of the check above
3606 greatly limits what we have to do below. */
3607 switch (TREE_CODE (type
))
3610 case POINTER_BOUNDS_TYPE
:
3616 case REFERENCE_TYPE
:
3625 case FIXED_POINT_TYPE
:
3626 /* Here we just check the bounds. */
3627 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3628 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3631 /* We have already checked the component type above, so just check
3632 the domain type. Flexible array members have a null domain. */
3633 return TYPE_DOMAIN (type
) ?
3634 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3638 case QUAL_UNION_TYPE
:
3642 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3643 if (TREE_CODE (field
) == FIELD_DECL
3644 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3645 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3646 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3647 || type_contains_placeholder_p (TREE_TYPE (field
))))
3658 /* Wrapper around above function used to cache its result. */
3661 type_contains_placeholder_p (tree type
)
3665 /* If the contains_placeholder_bits field has been initialized,
3666 then we know the answer. */
3667 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3668 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3670 /* Indicate that we've seen this type node, and the answer is false.
3671 This is what we want to return if we run into recursion via fields. */
3672 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3674 /* Compute the real value. */
3675 result
= type_contains_placeholder_1 (type
);
3677 /* Store the real value. */
3678 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3683 /* Push tree EXP onto vector QUEUE if it is not already present. */
3686 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3691 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3692 if (simple_cst_equal (iter
, exp
) == 1)
3696 queue
->safe_push (exp
);
3699 /* Given a tree EXP, find all occurrences of references to fields
3700 in a PLACEHOLDER_EXPR and place them in vector REFS without
3701 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3702 we assume here that EXP contains only arithmetic expressions
3703 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3707 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3709 enum tree_code code
= TREE_CODE (exp
);
3713 /* We handle TREE_LIST and COMPONENT_REF separately. */
3714 if (code
== TREE_LIST
)
3716 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3717 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3719 else if (code
== COMPONENT_REF
)
3721 for (inner
= TREE_OPERAND (exp
, 0);
3722 REFERENCE_CLASS_P (inner
);
3723 inner
= TREE_OPERAND (inner
, 0))
3726 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3727 push_without_duplicates (exp
, refs
);
3729 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3732 switch (TREE_CODE_CLASS (code
))
3737 case tcc_declaration
:
3738 /* Variables allocated to static storage can stay. */
3739 if (!TREE_STATIC (exp
))
3740 push_without_duplicates (exp
, refs
);
3743 case tcc_expression
:
3744 /* This is the pattern built in ada/make_aligning_type. */
3745 if (code
== ADDR_EXPR
3746 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3748 push_without_duplicates (exp
, refs
);
3754 case tcc_exceptional
:
3757 case tcc_comparison
:
3759 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3760 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3764 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3765 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3773 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3774 return a tree with all occurrences of references to F in a
3775 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3776 CONST_DECLs. Note that we assume here that EXP contains only
3777 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3778 occurring only in their argument list. */
3781 substitute_in_expr (tree exp
, tree f
, tree r
)
3783 enum tree_code code
= TREE_CODE (exp
);
3784 tree op0
, op1
, op2
, op3
;
3787 /* We handle TREE_LIST and COMPONENT_REF separately. */
3788 if (code
== TREE_LIST
)
3790 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3791 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3792 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3795 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3797 else if (code
== COMPONENT_REF
)
3801 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3802 and it is the right field, replace it with R. */
3803 for (inner
= TREE_OPERAND (exp
, 0);
3804 REFERENCE_CLASS_P (inner
);
3805 inner
= TREE_OPERAND (inner
, 0))
3809 op1
= TREE_OPERAND (exp
, 1);
3811 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3814 /* If this expression hasn't been completed let, leave it alone. */
3815 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3818 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3819 if (op0
== TREE_OPERAND (exp
, 0))
3823 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3826 switch (TREE_CODE_CLASS (code
))
3831 case tcc_declaration
:
3837 case tcc_expression
:
3843 case tcc_exceptional
:
3846 case tcc_comparison
:
3848 switch (TREE_CODE_LENGTH (code
))
3854 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3855 if (op0
== TREE_OPERAND (exp
, 0))
3858 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3862 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3863 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3865 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3868 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3872 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3873 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3874 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3876 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3877 && op2
== TREE_OPERAND (exp
, 2))
3880 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3884 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3885 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3886 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3887 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3889 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3890 && op2
== TREE_OPERAND (exp
, 2)
3891 && op3
== TREE_OPERAND (exp
, 3))
3895 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3907 new_tree
= NULL_TREE
;
3909 /* If we are trying to replace F with a constant or with another
3910 instance of one of the arguments of the call, inline back
3911 functions which do nothing else than computing a value from
3912 the arguments they are passed. This makes it possible to
3913 fold partially or entirely the replacement expression. */
3914 if (code
== CALL_EXPR
)
3916 bool maybe_inline
= false;
3917 if (CONSTANT_CLASS_P (r
))
3918 maybe_inline
= true;
3920 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3921 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
3923 maybe_inline
= true;
3928 tree t
= maybe_inline_call_in_expr (exp
);
3930 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3934 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3936 tree op
= TREE_OPERAND (exp
, i
);
3937 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3941 new_tree
= copy_node (exp
);
3942 TREE_OPERAND (new_tree
, i
) = new_op
;
3948 new_tree
= fold (new_tree
);
3949 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3950 process_call_operands (new_tree
);
3961 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3963 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3964 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3969 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3970 for it within OBJ, a tree that is an object or a chain of references. */
3973 substitute_placeholder_in_expr (tree exp
, tree obj
)
3975 enum tree_code code
= TREE_CODE (exp
);
3976 tree op0
, op1
, op2
, op3
;
3979 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3980 in the chain of OBJ. */
3981 if (code
== PLACEHOLDER_EXPR
)
3983 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3986 for (elt
= obj
; elt
!= 0;
3987 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3988 || TREE_CODE (elt
) == COND_EXPR
)
3989 ? TREE_OPERAND (elt
, 1)
3990 : (REFERENCE_CLASS_P (elt
)
3991 || UNARY_CLASS_P (elt
)
3992 || BINARY_CLASS_P (elt
)
3993 || VL_EXP_CLASS_P (elt
)
3994 || EXPRESSION_CLASS_P (elt
))
3995 ? TREE_OPERAND (elt
, 0) : 0))
3996 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3999 for (elt
= obj
; elt
!= 0;
4000 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
4001 || TREE_CODE (elt
) == COND_EXPR
)
4002 ? TREE_OPERAND (elt
, 1)
4003 : (REFERENCE_CLASS_P (elt
)
4004 || UNARY_CLASS_P (elt
)
4005 || BINARY_CLASS_P (elt
)
4006 || VL_EXP_CLASS_P (elt
)
4007 || EXPRESSION_CLASS_P (elt
))
4008 ? TREE_OPERAND (elt
, 0) : 0))
4009 if (POINTER_TYPE_P (TREE_TYPE (elt
))
4010 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
4012 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4014 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4015 survives until RTL generation, there will be an error. */
4019 /* TREE_LIST is special because we need to look at TREE_VALUE
4020 and TREE_CHAIN, not TREE_OPERANDS. */
4021 else if (code
== TREE_LIST
)
4023 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4024 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4025 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4028 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4031 switch (TREE_CODE_CLASS (code
))
4034 case tcc_declaration
:
4037 case tcc_exceptional
:
4040 case tcc_comparison
:
4041 case tcc_expression
:
4044 switch (TREE_CODE_LENGTH (code
))
4050 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4051 if (op0
== TREE_OPERAND (exp
, 0))
4054 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4058 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4059 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4061 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4064 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4068 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4069 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4070 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4072 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4073 && op2
== TREE_OPERAND (exp
, 2))
4076 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4080 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4081 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4082 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4083 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4085 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4086 && op2
== TREE_OPERAND (exp
, 2)
4087 && op3
== TREE_OPERAND (exp
, 3))
4091 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4103 new_tree
= NULL_TREE
;
4105 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4107 tree op
= TREE_OPERAND (exp
, i
);
4108 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4112 new_tree
= copy_node (exp
);
4113 TREE_OPERAND (new_tree
, i
) = new_op
;
4119 new_tree
= fold (new_tree
);
4120 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4121 process_call_operands (new_tree
);
4132 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4134 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4135 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4141 /* Subroutine of stabilize_reference; this is called for subtrees of
4142 references. Any expression with side-effects must be put in a SAVE_EXPR
4143 to ensure that it is only evaluated once.
4145 We don't put SAVE_EXPR nodes around everything, because assigning very
4146 simple expressions to temporaries causes us to miss good opportunities
4147 for optimizations. Among other things, the opportunity to fold in the
4148 addition of a constant into an addressing mode often gets lost, e.g.
4149 "y[i+1] += x;". In general, we take the approach that we should not make
4150 an assignment unless we are forced into it - i.e., that any non-side effect
4151 operator should be allowed, and that cse should take care of coalescing
4152 multiple utterances of the same expression should that prove fruitful. */
4155 stabilize_reference_1 (tree e
)
4158 enum tree_code code
= TREE_CODE (e
);
4160 /* We cannot ignore const expressions because it might be a reference
4161 to a const array but whose index contains side-effects. But we can
4162 ignore things that are actual constant or that already have been
4163 handled by this function. */
4165 if (tree_invariant_p (e
))
4168 switch (TREE_CODE_CLASS (code
))
4170 case tcc_exceptional
:
4172 case tcc_declaration
:
4173 case tcc_comparison
:
4175 case tcc_expression
:
4178 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4179 so that it will only be evaluated once. */
4180 /* The reference (r) and comparison (<) classes could be handled as
4181 below, but it is generally faster to only evaluate them once. */
4182 if (TREE_SIDE_EFFECTS (e
))
4183 return save_expr (e
);
4187 /* Constants need no processing. In fact, we should never reach
4192 /* Division is slow and tends to be compiled with jumps,
4193 especially the division by powers of 2 that is often
4194 found inside of an array reference. So do it just once. */
4195 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4196 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4197 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4198 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4199 return save_expr (e
);
4200 /* Recursively stabilize each operand. */
4201 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4202 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4206 /* Recursively stabilize each operand. */
4207 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4214 TREE_TYPE (result
) = TREE_TYPE (e
);
4215 TREE_READONLY (result
) = TREE_READONLY (e
);
4216 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4217 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4222 /* Stabilize a reference so that we can use it any number of times
4223 without causing its operands to be evaluated more than once.
4224 Returns the stabilized reference. This works by means of save_expr,
4225 so see the caveats in the comments about save_expr.
4227 Also allows conversion expressions whose operands are references.
4228 Any other kind of expression is returned unchanged. */
4231 stabilize_reference (tree ref
)
4234 enum tree_code code
= TREE_CODE (ref
);
4241 /* No action is needed in this case. */
4246 case FIX_TRUNC_EXPR
:
4247 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4251 result
= build_nt (INDIRECT_REF
,
4252 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4256 result
= build_nt (COMPONENT_REF
,
4257 stabilize_reference (TREE_OPERAND (ref
, 0)),
4258 TREE_OPERAND (ref
, 1), NULL_TREE
);
4262 result
= build_nt (BIT_FIELD_REF
,
4263 stabilize_reference (TREE_OPERAND (ref
, 0)),
4264 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4265 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4269 result
= build_nt (ARRAY_REF
,
4270 stabilize_reference (TREE_OPERAND (ref
, 0)),
4271 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4272 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4275 case ARRAY_RANGE_REF
:
4276 result
= build_nt (ARRAY_RANGE_REF
,
4277 stabilize_reference (TREE_OPERAND (ref
, 0)),
4278 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4279 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4283 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4284 it wouldn't be ignored. This matters when dealing with
4286 return stabilize_reference_1 (ref
);
4288 /* If arg isn't a kind of lvalue we recognize, make no change.
4289 Caller should recognize the error for an invalid lvalue. */
4294 return error_mark_node
;
4297 TREE_TYPE (result
) = TREE_TYPE (ref
);
4298 TREE_READONLY (result
) = TREE_READONLY (ref
);
4299 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4300 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4305 /* Low-level constructors for expressions. */
4307 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4308 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4311 recompute_tree_invariant_for_addr_expr (tree t
)
4314 bool tc
= true, se
= false;
4316 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4318 /* We started out assuming this address is both invariant and constant, but
4319 does not have side effects. Now go down any handled components and see if
4320 any of them involve offsets that are either non-constant or non-invariant.
4321 Also check for side-effects.
4323 ??? Note that this code makes no attempt to deal with the case where
4324 taking the address of something causes a copy due to misalignment. */
4326 #define UPDATE_FLAGS(NODE) \
4327 do { tree _node = (NODE); \
4328 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4329 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4331 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4332 node
= TREE_OPERAND (node
, 0))
4334 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4335 array reference (probably made temporarily by the G++ front end),
4336 so ignore all the operands. */
4337 if ((TREE_CODE (node
) == ARRAY_REF
4338 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4339 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4341 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4342 if (TREE_OPERAND (node
, 2))
4343 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4344 if (TREE_OPERAND (node
, 3))
4345 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4347 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4348 FIELD_DECL, apparently. The G++ front end can put something else
4349 there, at least temporarily. */
4350 else if (TREE_CODE (node
) == COMPONENT_REF
4351 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4353 if (TREE_OPERAND (node
, 2))
4354 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4358 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4360 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4361 the address, since &(*a)->b is a form of addition. If it's a constant, the
4362 address is constant too. If it's a decl, its address is constant if the
4363 decl is static. Everything else is not constant and, furthermore,
4364 taking the address of a volatile variable is not volatile. */
4365 if (TREE_CODE (node
) == INDIRECT_REF
4366 || TREE_CODE (node
) == MEM_REF
)
4367 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4368 else if (CONSTANT_CLASS_P (node
))
4370 else if (DECL_P (node
))
4371 tc
&= (staticp (node
) != NULL_TREE
);
4375 se
|= TREE_SIDE_EFFECTS (node
);
4379 TREE_CONSTANT (t
) = tc
;
4380 TREE_SIDE_EFFECTS (t
) = se
;
4384 /* Build an expression of code CODE, data type TYPE, and operands as
4385 specified. Expressions and reference nodes can be created this way.
4386 Constants, decls, types and misc nodes cannot be.
4388 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4389 enough for all extant tree codes. */
4392 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4396 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4398 t
= make_node (code PASS_MEM_STAT
);
4405 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4407 int length
= sizeof (struct tree_exp
);
4410 record_node_allocation_statistics (code
, length
);
4412 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4414 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4416 memset (t
, 0, sizeof (struct tree_common
));
4418 TREE_SET_CODE (t
, code
);
4420 TREE_TYPE (t
) = type
;
4421 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4422 TREE_OPERAND (t
, 0) = node
;
4423 if (node
&& !TYPE_P (node
))
4425 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4426 TREE_READONLY (t
) = TREE_READONLY (node
);
4429 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4430 TREE_SIDE_EFFECTS (t
) = 1;
4434 /* All of these have side-effects, no matter what their
4436 TREE_SIDE_EFFECTS (t
) = 1;
4437 TREE_READONLY (t
) = 0;
4441 /* Whether a dereference is readonly has nothing to do with whether
4442 its operand is readonly. */
4443 TREE_READONLY (t
) = 0;
4448 recompute_tree_invariant_for_addr_expr (t
);
4452 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4453 && node
&& !TYPE_P (node
)
4454 && TREE_CONSTANT (node
))
4455 TREE_CONSTANT (t
) = 1;
4456 if (TREE_CODE_CLASS (code
) == tcc_reference
4457 && node
&& TREE_THIS_VOLATILE (node
))
4458 TREE_THIS_VOLATILE (t
) = 1;
4465 #define PROCESS_ARG(N) \
4467 TREE_OPERAND (t, N) = arg##N; \
4468 if (arg##N &&!TYPE_P (arg##N)) \
4470 if (TREE_SIDE_EFFECTS (arg##N)) \
4472 if (!TREE_READONLY (arg##N) \
4473 && !CONSTANT_CLASS_P (arg##N)) \
4474 (void) (read_only = 0); \
4475 if (!TREE_CONSTANT (arg##N)) \
4476 (void) (constant = 0); \
4481 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4483 bool constant
, read_only
, side_effects
, div_by_zero
;
4486 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4488 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4489 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4490 /* When sizetype precision doesn't match that of pointers
4491 we need to be able to build explicit extensions or truncations
4492 of the offset argument. */
4493 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4494 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4495 && TREE_CODE (arg1
) == INTEGER_CST
);
4497 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4498 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4499 && ptrofftype_p (TREE_TYPE (arg1
)));
4501 t
= make_node (code PASS_MEM_STAT
);
4504 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4505 result based on those same flags for the arguments. But if the
4506 arguments aren't really even `tree' expressions, we shouldn't be trying
4509 /* Expressions without side effects may be constant if their
4510 arguments are as well. */
4511 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4512 || TREE_CODE_CLASS (code
) == tcc_binary
);
4514 side_effects
= TREE_SIDE_EFFECTS (t
);
4518 case TRUNC_DIV_EXPR
:
4520 case FLOOR_DIV_EXPR
:
4521 case ROUND_DIV_EXPR
:
4522 case EXACT_DIV_EXPR
:
4524 case FLOOR_MOD_EXPR
:
4525 case ROUND_MOD_EXPR
:
4526 case TRUNC_MOD_EXPR
:
4527 div_by_zero
= integer_zerop (arg1
);
4530 div_by_zero
= false;
4536 TREE_SIDE_EFFECTS (t
) = side_effects
;
4537 if (code
== MEM_REF
)
4539 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4541 tree o
= TREE_OPERAND (arg0
, 0);
4542 TREE_READONLY (t
) = TREE_READONLY (o
);
4543 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4548 TREE_READONLY (t
) = read_only
;
4549 /* Don't mark X / 0 as constant. */
4550 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4551 TREE_THIS_VOLATILE (t
)
4552 = (TREE_CODE_CLASS (code
) == tcc_reference
4553 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4561 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4562 tree arg2 MEM_STAT_DECL
)
4564 bool constant
, read_only
, side_effects
;
4567 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4568 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4570 t
= make_node (code PASS_MEM_STAT
);
4575 /* As a special exception, if COND_EXPR has NULL branches, we
4576 assume that it is a gimple statement and always consider
4577 it to have side effects. */
4578 if (code
== COND_EXPR
4579 && tt
== void_type_node
4580 && arg1
== NULL_TREE
4581 && arg2
== NULL_TREE
)
4582 side_effects
= true;
4584 side_effects
= TREE_SIDE_EFFECTS (t
);
4590 if (code
== COND_EXPR
)
4591 TREE_READONLY (t
) = read_only
;
4593 TREE_SIDE_EFFECTS (t
) = side_effects
;
4594 TREE_THIS_VOLATILE (t
)
4595 = (TREE_CODE_CLASS (code
) == tcc_reference
4596 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4602 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4603 tree arg2
, tree arg3 MEM_STAT_DECL
)
4605 bool constant
, read_only
, side_effects
;
4608 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4610 t
= make_node (code PASS_MEM_STAT
);
4613 side_effects
= TREE_SIDE_EFFECTS (t
);
4620 TREE_SIDE_EFFECTS (t
) = side_effects
;
4621 TREE_THIS_VOLATILE (t
)
4622 = (TREE_CODE_CLASS (code
) == tcc_reference
4623 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4629 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4630 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4632 bool constant
, read_only
, side_effects
;
4635 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4637 t
= make_node (code PASS_MEM_STAT
);
4640 side_effects
= TREE_SIDE_EFFECTS (t
);
4648 TREE_SIDE_EFFECTS (t
) = side_effects
;
4649 if (code
== TARGET_MEM_REF
)
4651 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4653 tree o
= TREE_OPERAND (arg0
, 0);
4654 TREE_READONLY (t
) = TREE_READONLY (o
);
4655 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4659 TREE_THIS_VOLATILE (t
)
4660 = (TREE_CODE_CLASS (code
) == tcc_reference
4661 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4666 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4667 on the pointer PTR. */
4670 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4672 HOST_WIDE_INT offset
= 0;
4673 tree ptype
= TREE_TYPE (ptr
);
4675 /* For convenience allow addresses that collapse to a simple base
4677 if (TREE_CODE (ptr
) == ADDR_EXPR
4678 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4679 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4681 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4683 if (TREE_CODE (ptr
) == MEM_REF
)
4685 offset
+= mem_ref_offset (ptr
).to_short_addr ();
4686 ptr
= TREE_OPERAND (ptr
, 0);
4689 ptr
= build_fold_addr_expr (ptr
);
4690 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4692 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4693 ptr
, build_int_cst (ptype
, offset
));
4694 SET_EXPR_LOCATION (tem
, loc
);
4698 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4701 mem_ref_offset (const_tree t
)
4703 return offset_int::from (wi::to_wide (TREE_OPERAND (t
, 1)), SIGNED
);
4706 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4707 offsetted by OFFSET units. */
4710 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4712 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4713 build_fold_addr_expr (base
),
4714 build_int_cst (ptr_type_node
, offset
));
4715 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4716 recompute_tree_invariant_for_addr_expr (addr
);
4720 /* Similar except don't specify the TREE_TYPE
4721 and leave the TREE_SIDE_EFFECTS as 0.
4722 It is permissible for arguments to be null,
4723 or even garbage if their values do not matter. */
4726 build_nt (enum tree_code code
, ...)
4733 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4737 t
= make_node (code
);
4738 length
= TREE_CODE_LENGTH (code
);
4740 for (i
= 0; i
< length
; i
++)
4741 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4747 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4751 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4756 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4757 CALL_EXPR_FN (ret
) = fn
;
4758 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4759 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4760 CALL_EXPR_ARG (ret
, ix
) = t
;
4764 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4765 We do NOT enter this node in any sort of symbol table.
4767 LOC is the location of the decl.
4769 layout_decl is used to set up the decl's storage layout.
4770 Other slots are initialized to 0 or null pointers. */
4773 build_decl (location_t loc
, enum tree_code code
, tree name
,
4774 tree type MEM_STAT_DECL
)
4778 t
= make_node (code PASS_MEM_STAT
);
4779 DECL_SOURCE_LOCATION (t
) = loc
;
4781 /* if (type == error_mark_node)
4782 type = integer_type_node; */
4783 /* That is not done, deliberately, so that having error_mark_node
4784 as the type can suppress useless errors in the use of this variable. */
4786 DECL_NAME (t
) = name
;
4787 TREE_TYPE (t
) = type
;
4789 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4795 /* Builds and returns function declaration with NAME and TYPE. */
4798 build_fn_decl (const char *name
, tree type
)
4800 tree id
= get_identifier (name
);
4801 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4803 DECL_EXTERNAL (decl
) = 1;
4804 TREE_PUBLIC (decl
) = 1;
4805 DECL_ARTIFICIAL (decl
) = 1;
4806 TREE_NOTHROW (decl
) = 1;
4811 vec
<tree
, va_gc
> *all_translation_units
;
4813 /* Builds a new translation-unit decl with name NAME, queues it in the
4814 global list of translation-unit decls and returns it. */
4817 build_translation_unit_decl (tree name
)
4819 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4821 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4822 vec_safe_push (all_translation_units
, tu
);
4827 /* BLOCK nodes are used to represent the structure of binding contours
4828 and declarations, once those contours have been exited and their contents
4829 compiled. This information is used for outputting debugging info. */
4832 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4834 tree block
= make_node (BLOCK
);
4836 BLOCK_VARS (block
) = vars
;
4837 BLOCK_SUBBLOCKS (block
) = subblocks
;
4838 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4839 BLOCK_CHAIN (block
) = chain
;
4844 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4846 LOC is the location to use in tree T. */
4849 protected_set_expr_location (tree t
, location_t loc
)
4851 if (CAN_HAVE_LOCATION_P (t
))
4852 SET_EXPR_LOCATION (t
, loc
);
4855 /* Reset the expression *EXPR_P, a size or position.
4857 ??? We could reset all non-constant sizes or positions. But it's cheap
4858 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4860 We need to reset self-referential sizes or positions because they cannot
4861 be gimplified and thus can contain a CALL_EXPR after the gimplification
4862 is finished, which will run afoul of LTO streaming. And they need to be
4863 reset to something essentially dummy but not constant, so as to preserve
4864 the properties of the object they are attached to. */
4867 free_lang_data_in_one_sizepos (tree
*expr_p
)
4869 tree expr
= *expr_p
;
4870 if (CONTAINS_PLACEHOLDER_P (expr
))
4871 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4875 /* Reset all the fields in a binfo node BINFO. We only keep
4876 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4879 free_lang_data_in_binfo (tree binfo
)
4884 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4886 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4887 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4888 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4889 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4891 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4892 free_lang_data_in_binfo (t
);
4896 /* Reset all language specific information still present in TYPE. */
4899 free_lang_data_in_type (tree type
)
4901 gcc_assert (TYPE_P (type
));
4903 /* Give the FE a chance to remove its own data first. */
4904 lang_hooks
.free_lang_data (type
);
4906 TREE_LANG_FLAG_0 (type
) = 0;
4907 TREE_LANG_FLAG_1 (type
) = 0;
4908 TREE_LANG_FLAG_2 (type
) = 0;
4909 TREE_LANG_FLAG_3 (type
) = 0;
4910 TREE_LANG_FLAG_4 (type
) = 0;
4911 TREE_LANG_FLAG_5 (type
) = 0;
4912 TREE_LANG_FLAG_6 (type
) = 0;
4914 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4916 /* Remove the const and volatile qualifiers from arguments. The
4917 C++ front end removes them, but the C front end does not,
4918 leading to false ODR violation errors when merging two
4919 instances of the same function signature compiled by
4920 different front ends. */
4921 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4923 tree arg_type
= TREE_VALUE (p
);
4925 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4927 int quals
= TYPE_QUALS (arg_type
)
4929 & ~TYPE_QUAL_VOLATILE
;
4930 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4931 free_lang_data_in_type (TREE_VALUE (p
));
4933 /* C++ FE uses TREE_PURPOSE to store initial values. */
4934 TREE_PURPOSE (p
) = NULL
;
4937 else if (TREE_CODE (type
) == METHOD_TYPE
)
4938 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4939 /* C++ FE uses TREE_PURPOSE to store initial values. */
4940 TREE_PURPOSE (p
) = NULL
;
4941 else if (RECORD_OR_UNION_TYPE_P (type
))
4943 /* Remove members that are not FIELD_DECLs (and maybe
4944 TYPE_DECLs) from the field list of an aggregate. These occur
4946 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
4947 if (TREE_CODE (member
) == FIELD_DECL
4948 || (TREE_CODE (member
) == TYPE_DECL
4949 && !DECL_IGNORED_P (member
)
4950 && debug_info_level
> DINFO_LEVEL_TERSE
4951 && !is_redundant_typedef (member
)))
4952 prev
= &DECL_CHAIN (member
);
4954 *prev
= DECL_CHAIN (member
);
4956 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
4957 and danagle the pointer from time to time. */
4958 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
4959 TYPE_VFIELD (type
) = NULL_TREE
;
4961 if (TYPE_BINFO (type
))
4963 free_lang_data_in_binfo (TYPE_BINFO (type
));
4964 /* We need to preserve link to bases and virtual table for all
4965 polymorphic types to make devirtualization machinery working.
4966 Debug output cares only about bases, but output also
4967 virtual table pointers so merging of -fdevirtualize and
4968 -fno-devirtualize units is easier. */
4969 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
4970 || !flag_devirtualize
)
4971 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
4972 && !BINFO_VTABLE (TYPE_BINFO (type
)))
4973 || debug_info_level
!= DINFO_LEVEL_NONE
))
4974 TYPE_BINFO (type
) = NULL
;
4977 else if (INTEGRAL_TYPE_P (type
)
4978 || SCALAR_FLOAT_TYPE_P (type
)
4979 || FIXED_POINT_TYPE_P (type
))
4981 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4982 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4985 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4987 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4988 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4990 if (TYPE_CONTEXT (type
)
4991 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4993 tree ctx
= TYPE_CONTEXT (type
);
4996 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4998 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4999 TYPE_CONTEXT (type
) = ctx
;
5004 /* Return true if DECL may need an assembler name to be set. */
5007 need_assembler_name_p (tree decl
)
5009 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5010 Rule merging. This makes type_odr_p to return true on those types during
5011 LTO and by comparing the mangled name, we can say what types are intended
5012 to be equivalent across compilation unit.
5014 We do not store names of type_in_anonymous_namespace_p.
5016 Record, union and enumeration type have linkage that allows use
5017 to check type_in_anonymous_namespace_p. We do not mangle compound types
5018 that always can be compared structurally.
5020 Similarly for builtin types, we compare properties of their main variant.
5021 A special case are integer types where mangling do make differences
5022 between char/signed char/unsigned char etc. Storing name for these makes
5023 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5024 See cp/mangle.c:write_builtin_type for details. */
5026 if (flag_lto_odr_type_mering
5027 && TREE_CODE (decl
) == TYPE_DECL
5029 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5030 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5031 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5032 && (type_with_linkage_p (TREE_TYPE (decl
))
5033 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5034 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5035 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5036 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5037 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5040 /* If DECL already has its assembler name set, it does not need a
5042 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5043 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5046 /* Abstract decls do not need an assembler name. */
5047 if (DECL_ABSTRACT_P (decl
))
5050 /* For VAR_DECLs, only static, public and external symbols need an
5053 && !TREE_STATIC (decl
)
5054 && !TREE_PUBLIC (decl
)
5055 && !DECL_EXTERNAL (decl
))
5058 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5060 /* Do not set assembler name on builtins. Allow RTL expansion to
5061 decide whether to expand inline or via a regular call. */
5062 if (DECL_BUILT_IN (decl
)
5063 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5066 /* Functions represented in the callgraph need an assembler name. */
5067 if (cgraph_node::get (decl
) != NULL
)
5070 /* Unused and not public functions don't need an assembler name. */
5071 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5079 /* Reset all language specific information still present in symbol
5083 free_lang_data_in_decl (tree decl
)
5085 gcc_assert (DECL_P (decl
));
5087 /* Give the FE a chance to remove its own data first. */
5088 lang_hooks
.free_lang_data (decl
);
5090 TREE_LANG_FLAG_0 (decl
) = 0;
5091 TREE_LANG_FLAG_1 (decl
) = 0;
5092 TREE_LANG_FLAG_2 (decl
) = 0;
5093 TREE_LANG_FLAG_3 (decl
) = 0;
5094 TREE_LANG_FLAG_4 (decl
) = 0;
5095 TREE_LANG_FLAG_5 (decl
) = 0;
5096 TREE_LANG_FLAG_6 (decl
) = 0;
5098 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5099 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5100 if (TREE_CODE (decl
) == FIELD_DECL
)
5102 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5103 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5104 DECL_QUALIFIER (decl
) = NULL_TREE
;
5107 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5109 struct cgraph_node
*node
;
5110 if (!(node
= cgraph_node::get (decl
))
5111 || (!node
->definition
&& !node
->clones
))
5114 node
->release_body ();
5117 release_function_body (decl
);
5118 DECL_ARGUMENTS (decl
) = NULL
;
5119 DECL_RESULT (decl
) = NULL
;
5120 DECL_INITIAL (decl
) = error_mark_node
;
5123 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5127 /* If DECL has a gimple body, then the context for its
5128 arguments must be DECL. Otherwise, it doesn't really
5129 matter, as we will not be emitting any code for DECL. In
5130 general, there may be other instances of DECL created by
5131 the front end and since PARM_DECLs are generally shared,
5132 their DECL_CONTEXT changes as the replicas of DECL are
5133 created. The only time where DECL_CONTEXT is important
5134 is for the FUNCTION_DECLs that have a gimple body (since
5135 the PARM_DECL will be used in the function's body). */
5136 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5137 DECL_CONTEXT (t
) = decl
;
5138 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5139 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5140 = target_option_default_node
;
5141 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5142 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5143 = optimization_default_node
;
5146 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5147 At this point, it is not needed anymore. */
5148 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5150 /* Clear the abstract origin if it refers to a method.
5151 Otherwise dwarf2out.c will ICE as we splice functions out of
5152 TYPE_FIELDS and thus the origin will not be output
5154 if (DECL_ABSTRACT_ORIGIN (decl
)
5155 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5156 && RECORD_OR_UNION_TYPE_P
5157 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5158 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5160 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5161 DECL_VINDEX referring to itself into a vtable slot number as it
5162 should. Happens with functions that are copied and then forgotten
5163 about. Just clear it, it won't matter anymore. */
5164 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5165 DECL_VINDEX (decl
) = NULL_TREE
;
5167 else if (VAR_P (decl
))
5169 if ((DECL_EXTERNAL (decl
)
5170 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5171 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5172 DECL_INITIAL (decl
) = NULL_TREE
;
5174 else if (TREE_CODE (decl
) == TYPE_DECL
)
5176 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5177 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5178 DECL_INITIAL (decl
) = NULL_TREE
;
5180 else if (TREE_CODE (decl
) == FIELD_DECL
)
5181 DECL_INITIAL (decl
) = NULL_TREE
;
5182 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5183 && DECL_INITIAL (decl
)
5184 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5186 /* Strip builtins from the translation-unit BLOCK. We still have targets
5187 without builtin_decl_explicit support and also builtins are shared
5188 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5189 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5193 if (TREE_CODE (var
) == FUNCTION_DECL
5194 && DECL_BUILT_IN (var
))
5195 *nextp
= TREE_CHAIN (var
);
5197 nextp
= &TREE_CHAIN (var
);
5203 /* Data used when collecting DECLs and TYPEs for language data removal. */
5205 struct free_lang_data_d
5207 free_lang_data_d () : decls (100), types (100) {}
5209 /* Worklist to avoid excessive recursion. */
5210 auto_vec
<tree
> worklist
;
5212 /* Set of traversed objects. Used to avoid duplicate visits. */
5213 hash_set
<tree
> pset
;
5215 /* Array of symbols to process with free_lang_data_in_decl. */
5216 auto_vec
<tree
> decls
;
5218 /* Array of types to process with free_lang_data_in_type. */
5219 auto_vec
<tree
> types
;
5223 /* Save all language fields needed to generate proper debug information
5224 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5227 save_debug_info_for_decl (tree t
)
5229 /*struct saved_debug_info_d *sdi;*/
5231 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5233 /* FIXME. Partial implementation for saving debug info removed. */
5237 /* Save all language fields needed to generate proper debug information
5238 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5241 save_debug_info_for_type (tree t
)
5243 /*struct saved_debug_info_d *sdi;*/
5245 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5247 /* FIXME. Partial implementation for saving debug info removed. */
5251 /* Add type or decl T to one of the list of tree nodes that need their
5252 language data removed. The lists are held inside FLD. */
5255 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5259 fld
->decls
.safe_push (t
);
5260 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5261 save_debug_info_for_decl (t
);
5263 else if (TYPE_P (t
))
5265 fld
->types
.safe_push (t
);
5266 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5267 save_debug_info_for_type (t
);
5273 /* Push tree node T into FLD->WORKLIST. */
5276 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5278 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5279 fld
->worklist
.safe_push ((t
));
5283 /* Operand callback helper for free_lang_data_in_node. *TP is the
5284 subtree operand being considered. */
5287 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5290 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5292 if (TREE_CODE (t
) == TREE_LIST
)
5295 /* Language specific nodes will be removed, so there is no need
5296 to gather anything under them. */
5297 if (is_lang_specific (t
))
5305 /* Note that walk_tree does not traverse every possible field in
5306 decls, so we have to do our own traversals here. */
5307 add_tree_to_fld_list (t
, fld
);
5309 fld_worklist_push (DECL_NAME (t
), fld
);
5310 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5311 fld_worklist_push (DECL_SIZE (t
), fld
);
5312 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5314 /* We are going to remove everything under DECL_INITIAL for
5315 TYPE_DECLs. No point walking them. */
5316 if (TREE_CODE (t
) != TYPE_DECL
)
5317 fld_worklist_push (DECL_INITIAL (t
), fld
);
5319 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5320 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5322 if (TREE_CODE (t
) == FUNCTION_DECL
)
5324 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5325 fld_worklist_push (DECL_RESULT (t
), fld
);
5327 else if (TREE_CODE (t
) == TYPE_DECL
)
5329 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5331 else if (TREE_CODE (t
) == FIELD_DECL
)
5333 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5334 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5335 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5336 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5339 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5340 && DECL_HAS_VALUE_EXPR_P (t
))
5341 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5343 if (TREE_CODE (t
) != FIELD_DECL
5344 && TREE_CODE (t
) != TYPE_DECL
)
5345 fld_worklist_push (TREE_CHAIN (t
), fld
);
5348 else if (TYPE_P (t
))
5350 /* Note that walk_tree does not traverse every possible field in
5351 types, so we have to do our own traversals here. */
5352 add_tree_to_fld_list (t
, fld
);
5354 if (!RECORD_OR_UNION_TYPE_P (t
))
5355 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5356 fld_worklist_push (TYPE_SIZE (t
), fld
);
5357 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5358 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5359 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5360 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5361 fld_worklist_push (TYPE_NAME (t
), fld
);
5362 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5363 them and thus do not and want not to reach unused pointer types
5365 if (!POINTER_TYPE_P (t
))
5366 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5367 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5368 if (!RECORD_OR_UNION_TYPE_P (t
))
5369 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5370 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5371 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5372 do not and want not to reach unused variants this way. */
5373 if (TYPE_CONTEXT (t
))
5375 tree ctx
= TYPE_CONTEXT (t
);
5376 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5377 So push that instead. */
5378 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5379 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5380 fld_worklist_push (ctx
, fld
);
5382 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5383 and want not to reach unused types this way. */
5385 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5389 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5390 fld_worklist_push (TREE_TYPE (tem
), fld
);
5391 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5393 if (RECORD_OR_UNION_TYPE_P (t
))
5396 /* Push all TYPE_FIELDS - there can be interleaving interesting
5397 and non-interesting things. */
5398 tem
= TYPE_FIELDS (t
);
5401 if (TREE_CODE (tem
) == FIELD_DECL
5402 || (TREE_CODE (tem
) == TYPE_DECL
5403 && !DECL_IGNORED_P (tem
)
5404 && debug_info_level
> DINFO_LEVEL_TERSE
5405 && !is_redundant_typedef (tem
)))
5406 fld_worklist_push (tem
, fld
);
5407 tem
= TREE_CHAIN (tem
);
5411 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5414 else if (TREE_CODE (t
) == BLOCK
)
5417 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5418 fld_worklist_push (tem
, fld
);
5419 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5420 fld_worklist_push (tem
, fld
);
5421 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5424 if (TREE_CODE (t
) != IDENTIFIER_NODE
5425 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5426 fld_worklist_push (TREE_TYPE (t
), fld
);
5432 /* Find decls and types in T. */
5435 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5439 if (!fld
->pset
.contains (t
))
5440 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5441 if (fld
->worklist
.is_empty ())
5443 t
= fld
->worklist
.pop ();
5447 /* Translate all the types in LIST with the corresponding runtime
5451 get_eh_types_for_runtime (tree list
)
5455 if (list
== NULL_TREE
)
5458 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5460 list
= TREE_CHAIN (list
);
5463 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5464 TREE_CHAIN (prev
) = n
;
5465 prev
= TREE_CHAIN (prev
);
5466 list
= TREE_CHAIN (list
);
5473 /* Find decls and types referenced in EH region R and store them in
5474 FLD->DECLS and FLD->TYPES. */
5477 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5488 /* The types referenced in each catch must first be changed to the
5489 EH types used at runtime. This removes references to FE types
5491 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5493 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5494 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5499 case ERT_ALLOWED_EXCEPTIONS
:
5500 r
->u
.allowed
.type_list
5501 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5502 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5505 case ERT_MUST_NOT_THROW
:
5506 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5507 find_decls_types_r
, fld
, &fld
->pset
);
5513 /* Find decls and types referenced in cgraph node N and store them in
5514 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5515 look for *every* kind of DECL and TYPE node reachable from N,
5516 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5517 NAMESPACE_DECLs, etc). */
5520 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5523 struct function
*fn
;
5527 find_decls_types (n
->decl
, fld
);
5529 if (!gimple_has_body_p (n
->decl
))
5532 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5534 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5536 /* Traverse locals. */
5537 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5538 find_decls_types (t
, fld
);
5540 /* Traverse EH regions in FN. */
5543 FOR_ALL_EH_REGION_FN (r
, fn
)
5544 find_decls_types_in_eh_region (r
, fld
);
5547 /* Traverse every statement in FN. */
5548 FOR_EACH_BB_FN (bb
, fn
)
5551 gimple_stmt_iterator si
;
5554 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5556 gphi
*phi
= psi
.phi ();
5558 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5560 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5561 find_decls_types (*arg_p
, fld
);
5565 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5567 gimple
*stmt
= gsi_stmt (si
);
5569 if (is_gimple_call (stmt
))
5570 find_decls_types (gimple_call_fntype (stmt
), fld
);
5572 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5574 tree arg
= gimple_op (stmt
, i
);
5575 find_decls_types (arg
, fld
);
5582 /* Find decls and types referenced in varpool node N and store them in
5583 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5584 look for *every* kind of DECL and TYPE node reachable from N,
5585 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5586 NAMESPACE_DECLs, etc). */
5589 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5591 find_decls_types (v
->decl
, fld
);
5594 /* If T needs an assembler name, have one created for it. */
5597 assign_assembler_name_if_needed (tree t
)
5599 if (need_assembler_name_p (t
))
5601 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5602 diagnostics that use input_location to show locus
5603 information. The problem here is that, at this point,
5604 input_location is generally anchored to the end of the file
5605 (since the parser is long gone), so we don't have a good
5606 position to pin it to.
5608 To alleviate this problem, this uses the location of T's
5609 declaration. Examples of this are
5610 testsuite/g++.dg/template/cond2.C and
5611 testsuite/g++.dg/template/pr35240.C. */
5612 location_t saved_location
= input_location
;
5613 input_location
= DECL_SOURCE_LOCATION (t
);
5615 decl_assembler_name (t
);
5617 input_location
= saved_location
;
5622 /* Free language specific information for every operand and expression
5623 in every node of the call graph. This process operates in three stages:
5625 1- Every callgraph node and varpool node is traversed looking for
5626 decls and types embedded in them. This is a more exhaustive
5627 search than that done by find_referenced_vars, because it will
5628 also collect individual fields, decls embedded in types, etc.
5630 2- All the decls found are sent to free_lang_data_in_decl.
5632 3- All the types found are sent to free_lang_data_in_type.
5634 The ordering between decls and types is important because
5635 free_lang_data_in_decl sets assembler names, which includes
5636 mangling. So types cannot be freed up until assembler names have
5640 free_lang_data_in_cgraph (void)
5642 struct cgraph_node
*n
;
5644 struct free_lang_data_d fld
;
5649 /* Find decls and types in the body of every function in the callgraph. */
5650 FOR_EACH_FUNCTION (n
)
5651 find_decls_types_in_node (n
, &fld
);
5653 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5654 find_decls_types (p
->decl
, &fld
);
5656 /* Find decls and types in every varpool symbol. */
5657 FOR_EACH_VARIABLE (v
)
5658 find_decls_types_in_var (v
, &fld
);
5660 /* Set the assembler name on every decl found. We need to do this
5661 now because free_lang_data_in_decl will invalidate data needed
5662 for mangling. This breaks mangling on interdependent decls. */
5663 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5664 assign_assembler_name_if_needed (t
);
5666 /* Traverse every decl found freeing its language data. */
5667 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5668 free_lang_data_in_decl (t
);
5670 /* Traverse every type found freeing its language data. */
5671 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5672 free_lang_data_in_type (t
);
5675 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5681 /* Free resources that are used by FE but are not needed once they are done. */
5684 free_lang_data (void)
5688 /* If we are the LTO frontend we have freed lang-specific data already. */
5690 || (!flag_generate_lto
&& !flag_generate_offload
))
5693 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5694 if (vec_safe_is_empty (all_translation_units
))
5695 build_translation_unit_decl (NULL_TREE
);
5697 /* Allocate and assign alias sets to the standard integer types
5698 while the slots are still in the way the frontends generated them. */
5699 for (i
= 0; i
< itk_none
; ++i
)
5700 if (integer_types
[i
])
5701 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5703 /* Traverse the IL resetting language specific information for
5704 operands, expressions, etc. */
5705 free_lang_data_in_cgraph ();
5707 /* Create gimple variants for common types. */
5708 for (unsigned i
= 0;
5709 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5711 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5713 /* Reset some langhooks. Do not reset types_compatible_p, it may
5714 still be used indirectly via the get_alias_set langhook. */
5715 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5716 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5717 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5719 /* We do not want the default decl_assembler_name implementation,
5720 rather if we have fixed everything we want a wrapper around it
5721 asserting that all non-local symbols already got their assembler
5722 name and only produce assembler names for local symbols. Or rather
5723 make sure we never call decl_assembler_name on local symbols and
5724 devise a separate, middle-end private scheme for it. */
5726 /* Reset diagnostic machinery. */
5727 tree_diagnostics_defaults (global_dc
);
5735 const pass_data pass_data_ipa_free_lang_data
=
5737 SIMPLE_IPA_PASS
, /* type */
5738 "*free_lang_data", /* name */
5739 OPTGROUP_NONE
, /* optinfo_flags */
5740 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5741 0, /* properties_required */
5742 0, /* properties_provided */
5743 0, /* properties_destroyed */
5744 0, /* todo_flags_start */
5745 0, /* todo_flags_finish */
5748 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5751 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5752 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5755 /* opt_pass methods: */
5756 virtual unsigned int execute (function
*) { return free_lang_data (); }
5758 }; // class pass_ipa_free_lang_data
5762 simple_ipa_opt_pass
*
5763 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5765 return new pass_ipa_free_lang_data (ctxt
);
5768 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5769 of the various TYPE_QUAL values. */
5772 set_type_quals (tree type
, int type_quals
)
5774 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5775 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5776 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5777 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5778 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5781 /* Returns true iff CAND and BASE have equivalent language-specific
5785 check_lang_type (const_tree cand
, const_tree base
)
5787 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5789 /* type_hash_eq currently only applies to these types. */
5790 if (TREE_CODE (cand
) != FUNCTION_TYPE
5791 && TREE_CODE (cand
) != METHOD_TYPE
)
5793 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5796 /* Returns true iff unqualified CAND and BASE are equivalent. */
5799 check_base_type (const_tree cand
, const_tree base
)
5801 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5802 /* Apparently this is needed for Objective-C. */
5803 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5804 /* Check alignment. */
5805 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5806 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5807 TYPE_ATTRIBUTES (base
)));
5810 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5813 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5815 return (TYPE_QUALS (cand
) == type_quals
5816 && check_base_type (cand
, base
)
5817 && check_lang_type (cand
, base
));
5820 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5823 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5825 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5826 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5827 /* Apparently this is needed for Objective-C. */
5828 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5829 /* Check alignment. */
5830 && TYPE_ALIGN (cand
) == align
5831 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5832 TYPE_ATTRIBUTES (base
))
5833 && check_lang_type (cand
, base
));
5836 /* This function checks to see if TYPE matches the size one of the built-in
5837 atomic types, and returns that core atomic type. */
5840 find_atomic_core_type (tree type
)
5842 tree base_atomic_type
;
5844 /* Only handle complete types. */
5845 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
5848 switch (tree_to_uhwi (TYPE_SIZE (type
)))
5851 base_atomic_type
= atomicQI_type_node
;
5855 base_atomic_type
= atomicHI_type_node
;
5859 base_atomic_type
= atomicSI_type_node
;
5863 base_atomic_type
= atomicDI_type_node
;
5867 base_atomic_type
= atomicTI_type_node
;
5871 base_atomic_type
= NULL_TREE
;
5874 return base_atomic_type
;
5877 /* Return a version of the TYPE, qualified as indicated by the
5878 TYPE_QUALS, if one exists. If no qualified version exists yet,
5879 return NULL_TREE. */
5882 get_qualified_type (tree type
, int type_quals
)
5886 if (TYPE_QUALS (type
) == type_quals
)
5889 /* Search the chain of variants to see if there is already one there just
5890 like the one we need to have. If so, use that existing one. We must
5891 preserve the TYPE_NAME, since there is code that depends on this. */
5892 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5893 if (check_qualified_type (t
, type
, type_quals
))
5899 /* Like get_qualified_type, but creates the type if it does not
5900 exist. This function never returns NULL_TREE. */
5903 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
5907 /* See if we already have the appropriate qualified variant. */
5908 t
= get_qualified_type (type
, type_quals
);
5910 /* If not, build it. */
5913 t
= build_variant_type_copy (type PASS_MEM_STAT
);
5914 set_type_quals (t
, type_quals
);
5916 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
5918 /* See if this object can map to a basic atomic type. */
5919 tree atomic_type
= find_atomic_core_type (type
);
5922 /* Ensure the alignment of this type is compatible with
5923 the required alignment of the atomic type. */
5924 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
5925 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
5929 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5930 /* Propagate structural equality. */
5931 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5932 else if (TYPE_CANONICAL (type
) != type
)
5933 /* Build the underlying canonical type, since it is different
5936 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
5937 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
5940 /* T is its own canonical type. */
5941 TYPE_CANONICAL (t
) = t
;
5948 /* Create a variant of type T with alignment ALIGN. */
5951 build_aligned_type (tree type
, unsigned int align
)
5955 if (TYPE_PACKED (type
)
5956 || TYPE_ALIGN (type
) == align
)
5959 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5960 if (check_aligned_type (t
, type
, align
))
5963 t
= build_variant_type_copy (type
);
5964 SET_TYPE_ALIGN (t
, align
);
5965 TYPE_USER_ALIGN (t
) = 1;
5970 /* Create a new distinct copy of TYPE. The new type is made its own
5971 MAIN_VARIANT. If TYPE requires structural equality checks, the
5972 resulting type requires structural equality checks; otherwise, its
5973 TYPE_CANONICAL points to itself. */
5976 build_distinct_type_copy (tree type MEM_STAT_DECL
)
5978 tree t
= copy_node (type PASS_MEM_STAT
);
5980 TYPE_POINTER_TO (t
) = 0;
5981 TYPE_REFERENCE_TO (t
) = 0;
5983 /* Set the canonical type either to a new equivalence class, or
5984 propagate the need for structural equality checks. */
5985 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5986 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5988 TYPE_CANONICAL (t
) = t
;
5990 /* Make it its own variant. */
5991 TYPE_MAIN_VARIANT (t
) = t
;
5992 TYPE_NEXT_VARIANT (t
) = 0;
5994 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5995 whose TREE_TYPE is not t. This can also happen in the Ada
5996 frontend when using subtypes. */
6001 /* Create a new variant of TYPE, equivalent but distinct. This is so
6002 the caller can modify it. TYPE_CANONICAL for the return type will
6003 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6004 are considered equal by the language itself (or that both types
6005 require structural equality checks). */
6008 build_variant_type_copy (tree type MEM_STAT_DECL
)
6010 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6012 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
6014 /* Since we're building a variant, assume that it is a non-semantic
6015 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6016 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6017 /* Type variants have no alias set defined. */
6018 TYPE_ALIAS_SET (t
) = -1;
6020 /* Add the new type to the chain of variants of TYPE. */
6021 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6022 TYPE_NEXT_VARIANT (m
) = t
;
6023 TYPE_MAIN_VARIANT (t
) = m
;
6028 /* Return true if the from tree in both tree maps are equal. */
6031 tree_map_base_eq (const void *va
, const void *vb
)
6033 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6034 *const b
= (const struct tree_map_base
*) vb
;
6035 return (a
->from
== b
->from
);
6038 /* Hash a from tree in a tree_base_map. */
6041 tree_map_base_hash (const void *item
)
6043 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6046 /* Return true if this tree map structure is marked for garbage collection
6047 purposes. We simply return true if the from tree is marked, so that this
6048 structure goes away when the from tree goes away. */
6051 tree_map_base_marked_p (const void *p
)
6053 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6056 /* Hash a from tree in a tree_map. */
6059 tree_map_hash (const void *item
)
6061 return (((const struct tree_map
*) item
)->hash
);
6064 /* Hash a from tree in a tree_decl_map. */
6067 tree_decl_map_hash (const void *item
)
6069 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6072 /* Return the initialization priority for DECL. */
6075 decl_init_priority_lookup (tree decl
)
6077 symtab_node
*snode
= symtab_node::get (decl
);
6080 return DEFAULT_INIT_PRIORITY
;
6082 snode
->get_init_priority ();
6085 /* Return the finalization priority for DECL. */
6088 decl_fini_priority_lookup (tree decl
)
6090 cgraph_node
*node
= cgraph_node::get (decl
);
6093 return DEFAULT_INIT_PRIORITY
;
6095 node
->get_fini_priority ();
6098 /* Set the initialization priority for DECL to PRIORITY. */
6101 decl_init_priority_insert (tree decl
, priority_type priority
)
6103 struct symtab_node
*snode
;
6105 if (priority
== DEFAULT_INIT_PRIORITY
)
6107 snode
= symtab_node::get (decl
);
6111 else if (VAR_P (decl
))
6112 snode
= varpool_node::get_create (decl
);
6114 snode
= cgraph_node::get_create (decl
);
6115 snode
->set_init_priority (priority
);
6118 /* Set the finalization priority for DECL to PRIORITY. */
6121 decl_fini_priority_insert (tree decl
, priority_type priority
)
6123 struct cgraph_node
*node
;
6125 if (priority
== DEFAULT_INIT_PRIORITY
)
6127 node
= cgraph_node::get (decl
);
6132 node
= cgraph_node::get_create (decl
);
6133 node
->set_fini_priority (priority
);
6136 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6139 print_debug_expr_statistics (void)
6141 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6142 (long) debug_expr_for_decl
->size (),
6143 (long) debug_expr_for_decl
->elements (),
6144 debug_expr_for_decl
->collisions ());
6147 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6150 print_value_expr_statistics (void)
6152 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6153 (long) value_expr_for_decl
->size (),
6154 (long) value_expr_for_decl
->elements (),
6155 value_expr_for_decl
->collisions ());
6158 /* Lookup a debug expression for FROM, and return it if we find one. */
6161 decl_debug_expr_lookup (tree from
)
6163 struct tree_decl_map
*h
, in
;
6164 in
.base
.from
= from
;
6166 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6172 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6175 decl_debug_expr_insert (tree from
, tree to
)
6177 struct tree_decl_map
*h
;
6179 h
= ggc_alloc
<tree_decl_map
> ();
6180 h
->base
.from
= from
;
6182 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6185 /* Lookup a value expression for FROM, and return it if we find one. */
6188 decl_value_expr_lookup (tree from
)
6190 struct tree_decl_map
*h
, in
;
6191 in
.base
.from
= from
;
6193 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6199 /* Insert a mapping FROM->TO in the value expression hashtable. */
6202 decl_value_expr_insert (tree from
, tree to
)
6204 struct tree_decl_map
*h
;
6206 h
= ggc_alloc
<tree_decl_map
> ();
6207 h
->base
.from
= from
;
6209 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6212 /* Lookup a vector of debug arguments for FROM, and return it if we
6216 decl_debug_args_lookup (tree from
)
6218 struct tree_vec_map
*h
, in
;
6220 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6222 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6223 in
.base
.from
= from
;
6224 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6230 /* Insert a mapping FROM->empty vector of debug arguments in the value
6231 expression hashtable. */
6234 decl_debug_args_insert (tree from
)
6236 struct tree_vec_map
*h
;
6239 if (DECL_HAS_DEBUG_ARGS_P (from
))
6240 return decl_debug_args_lookup (from
);
6241 if (debug_args_for_decl
== NULL
)
6242 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6243 h
= ggc_alloc
<tree_vec_map
> ();
6244 h
->base
.from
= from
;
6246 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6248 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6252 /* Hashing of types so that we don't make duplicates.
6253 The entry point is `type_hash_canon'. */
6255 /* Generate the default hash code for TYPE. This is designed for
6256 speed, rather than maximum entropy. */
6259 type_hash_canon_hash (tree type
)
6261 inchash::hash hstate
;
6263 hstate
.add_int (TREE_CODE (type
));
6265 if (TREE_TYPE (type
))
6266 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6268 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6269 /* Just the identifier is adequate to distinguish. */
6270 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6272 switch (TREE_CODE (type
))
6275 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6278 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6279 if (TREE_VALUE (t
) != error_mark_node
)
6280 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6284 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6289 if (TYPE_DOMAIN (type
))
6290 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6291 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6293 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6294 hstate
.add_object (typeless
);
6301 tree t
= TYPE_MAX_VALUE (type
);
6303 t
= TYPE_MIN_VALUE (type
);
6304 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6305 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6310 case FIXED_POINT_TYPE
:
6312 unsigned prec
= TYPE_PRECISION (type
);
6313 hstate
.add_object (prec
);
6319 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
6320 hstate
.add_object (nunits
);
6328 return hstate
.end ();
6331 /* These are the Hashtable callback functions. */
6333 /* Returns true iff the types are equivalent. */
6336 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6338 /* First test the things that are the same for all types. */
6339 if (a
->hash
!= b
->hash
6340 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6341 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6342 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6343 TYPE_ATTRIBUTES (b
->type
))
6344 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6345 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6348 /* Be careful about comparing arrays before and after the element type
6349 has been completed; don't compare TYPE_ALIGN unless both types are
6351 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6352 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6353 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6356 switch (TREE_CODE (a
->type
))
6361 case REFERENCE_TYPE
:
6366 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6369 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6370 && !(TYPE_VALUES (a
->type
)
6371 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6372 && TYPE_VALUES (b
->type
)
6373 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6374 && type_list_equal (TYPE_VALUES (a
->type
),
6375 TYPE_VALUES (b
->type
))))
6383 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6385 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6386 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6387 TYPE_MAX_VALUE (b
->type
)))
6388 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6389 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6390 TYPE_MIN_VALUE (b
->type
))));
6392 case FIXED_POINT_TYPE
:
6393 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6396 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6399 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6400 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6401 || (TYPE_ARG_TYPES (a
->type
)
6402 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6403 && TYPE_ARG_TYPES (b
->type
)
6404 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6405 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6406 TYPE_ARG_TYPES (b
->type
)))))
6410 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6411 where the flag should be inherited from the element type
6412 and can change after ARRAY_TYPEs are created; on non-aggregates
6413 compare it and hash it, scalars will never have that flag set
6414 and we need to differentiate between arrays created by different
6415 front-ends or middle-end created arrays. */
6416 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6417 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6418 || (TYPE_TYPELESS_STORAGE (a
->type
)
6419 == TYPE_TYPELESS_STORAGE (b
->type
))));
6423 case QUAL_UNION_TYPE
:
6424 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6425 || (TYPE_FIELDS (a
->type
)
6426 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6427 && TYPE_FIELDS (b
->type
)
6428 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6429 && type_list_equal (TYPE_FIELDS (a
->type
),
6430 TYPE_FIELDS (b
->type
))));
6433 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6434 || (TYPE_ARG_TYPES (a
->type
)
6435 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6436 && TYPE_ARG_TYPES (b
->type
)
6437 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6438 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6439 TYPE_ARG_TYPES (b
->type
))))
6447 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6448 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6453 /* Given TYPE, and HASHCODE its hash code, return the canonical
6454 object for an identical type if one already exists.
6455 Otherwise, return TYPE, and record it as the canonical object.
6457 To use this function, first create a type of the sort you want.
6458 Then compute its hash code from the fields of the type that
6459 make it different from other similar types.
6460 Then call this function and use the value. */
6463 type_hash_canon (unsigned int hashcode
, tree type
)
6468 /* The hash table only contains main variants, so ensure that's what we're
6470 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6472 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6473 must call that routine before comparing TYPE_ALIGNs. */
6479 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6482 tree t1
= ((type_hash
*) *loc
)->type
;
6483 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6484 if (TYPE_UID (type
) + 1 == next_type_uid
)
6486 /* Free also min/max values and the cache for integer
6487 types. This can't be done in free_node, as LTO frees
6488 those on its own. */
6489 if (TREE_CODE (type
) == INTEGER_TYPE
)
6491 if (TYPE_MIN_VALUE (type
)
6492 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6494 /* Zero is always in TYPE_CACHED_VALUES. */
6495 if (! TYPE_UNSIGNED (type
))
6496 int_cst_hash_table
->remove_elt (TYPE_MIN_VALUE (type
));
6497 ggc_free (TYPE_MIN_VALUE (type
));
6499 if (TYPE_MAX_VALUE (type
)
6500 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6502 int_cst_hash_table
->remove_elt (TYPE_MAX_VALUE (type
));
6503 ggc_free (TYPE_MAX_VALUE (type
));
6505 if (TYPE_CACHED_VALUES_P (type
))
6506 ggc_free (TYPE_CACHED_VALUES (type
));
6513 struct type_hash
*h
;
6515 h
= ggc_alloc
<type_hash
> ();
6525 print_type_hash_statistics (void)
6527 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6528 (long) type_hash_table
->size (),
6529 (long) type_hash_table
->elements (),
6530 type_hash_table
->collisions ());
6533 /* Given two lists of types
6534 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6535 return 1 if the lists contain the same types in the same order.
6536 Also, the TREE_PURPOSEs must match. */
6539 type_list_equal (const_tree l1
, const_tree l2
)
6543 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6544 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6545 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6546 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6547 && (TREE_TYPE (TREE_PURPOSE (t1
))
6548 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6554 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6555 given by TYPE. If the argument list accepts variable arguments,
6556 then this function counts only the ordinary arguments. */
6559 type_num_arguments (const_tree type
)
6564 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6565 /* If the function does not take a variable number of arguments,
6566 the last element in the list will have type `void'. */
6567 if (VOID_TYPE_P (TREE_VALUE (t
)))
6575 /* Nonzero if integer constants T1 and T2
6576 represent the same constant value. */
6579 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6584 if (t1
== 0 || t2
== 0)
6587 if (TREE_CODE (t1
) == INTEGER_CST
6588 && TREE_CODE (t2
) == INTEGER_CST
6589 && wi::to_widest (t1
) == wi::to_widest (t2
))
6595 /* Return true if T is an INTEGER_CST whose numerical value (extended
6596 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6599 tree_fits_shwi_p (const_tree t
)
6601 return (t
!= NULL_TREE
6602 && TREE_CODE (t
) == INTEGER_CST
6603 && wi::fits_shwi_p (wi::to_widest (t
)));
6606 /* Return true if T is an INTEGER_CST whose numerical value (extended
6607 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6610 tree_fits_uhwi_p (const_tree t
)
6612 return (t
!= NULL_TREE
6613 && TREE_CODE (t
) == INTEGER_CST
6614 && wi::fits_uhwi_p (wi::to_widest (t
)));
6617 /* T is an INTEGER_CST whose numerical value (extended according to
6618 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6622 tree_to_shwi (const_tree t
)
6624 gcc_assert (tree_fits_shwi_p (t
));
6625 return TREE_INT_CST_LOW (t
);
6628 /* T is an INTEGER_CST whose numerical value (extended according to
6629 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6632 unsigned HOST_WIDE_INT
6633 tree_to_uhwi (const_tree t
)
6635 gcc_assert (tree_fits_uhwi_p (t
));
6636 return TREE_INT_CST_LOW (t
);
6639 /* Return the most significant (sign) bit of T. */
6642 tree_int_cst_sign_bit (const_tree t
)
6644 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6646 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6649 /* Return an indication of the sign of the integer constant T.
6650 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6651 Note that -1 will never be returned if T's type is unsigned. */
6654 tree_int_cst_sgn (const_tree t
)
6656 if (wi::to_wide (t
) == 0)
6658 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6660 else if (wi::neg_p (wi::to_wide (t
)))
6666 /* Return the minimum number of bits needed to represent VALUE in a
6667 signed or unsigned type, UNSIGNEDP says which. */
6670 tree_int_cst_min_precision (tree value
, signop sgn
)
6672 /* If the value is negative, compute its negative minus 1. The latter
6673 adjustment is because the absolute value of the largest negative value
6674 is one larger than the largest positive value. This is equivalent to
6675 a bit-wise negation, so use that operation instead. */
6677 if (tree_int_cst_sgn (value
) < 0)
6678 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6680 /* Return the number of bits needed, taking into account the fact
6681 that we need one more bit for a signed than unsigned type.
6682 If value is 0 or -1, the minimum precision is 1 no matter
6683 whether unsignedp is true or false. */
6685 if (integer_zerop (value
))
6688 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6691 /* Return truthvalue of whether T1 is the same tree structure as T2.
6692 Return 1 if they are the same.
6693 Return 0 if they are understandably different.
6694 Return -1 if either contains tree structure not understood by
6698 simple_cst_equal (const_tree t1
, const_tree t2
)
6700 enum tree_code code1
, code2
;
6706 if (t1
== 0 || t2
== 0)
6709 code1
= TREE_CODE (t1
);
6710 code2
= TREE_CODE (t2
);
6712 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6714 if (CONVERT_EXPR_CODE_P (code2
)
6715 || code2
== NON_LVALUE_EXPR
)
6716 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6718 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6721 else if (CONVERT_EXPR_CODE_P (code2
)
6722 || code2
== NON_LVALUE_EXPR
)
6723 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6731 return wi::to_widest (t1
) == wi::to_widest (t2
);
6734 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6737 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6740 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6741 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6742 TREE_STRING_LENGTH (t1
)));
6746 unsigned HOST_WIDE_INT idx
;
6747 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6748 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6750 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6753 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6754 /* ??? Should we handle also fields here? */
6755 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6761 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6764 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6767 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6770 const_tree arg1
, arg2
;
6771 const_call_expr_arg_iterator iter1
, iter2
;
6772 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6773 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6775 arg1
= next_const_call_expr_arg (&iter1
),
6776 arg2
= next_const_call_expr_arg (&iter2
))
6778 cmp
= simple_cst_equal (arg1
, arg2
);
6782 return arg1
== arg2
;
6786 /* Special case: if either target is an unallocated VAR_DECL,
6787 it means that it's going to be unified with whatever the
6788 TARGET_EXPR is really supposed to initialize, so treat it
6789 as being equivalent to anything. */
6790 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6791 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6792 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6793 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6794 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6795 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6798 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6803 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6805 case WITH_CLEANUP_EXPR
:
6806 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6810 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6813 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6814 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6828 /* This general rule works for most tree codes. All exceptions should be
6829 handled above. If this is a language-specific tree code, we can't
6830 trust what might be in the operand, so say we don't know
6832 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6835 switch (TREE_CODE_CLASS (code1
))
6839 case tcc_comparison
:
6840 case tcc_expression
:
6844 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6846 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6858 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6859 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6860 than U, respectively. */
6863 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6865 if (tree_int_cst_sgn (t
) < 0)
6867 else if (!tree_fits_uhwi_p (t
))
6869 else if (TREE_INT_CST_LOW (t
) == u
)
6871 else if (TREE_INT_CST_LOW (t
) < u
)
6877 /* Return true if SIZE represents a constant size that is in bounds of
6878 what the middle-end and the backend accepts (covering not more than
6879 half of the address-space). */
6882 valid_constant_size_p (const_tree size
)
6884 if (! tree_fits_uhwi_p (size
)
6885 || TREE_OVERFLOW (size
)
6886 || tree_int_cst_sign_bit (size
) != 0)
6891 /* Return the precision of the type, or for a complex or vector type the
6892 precision of the type of its elements. */
6895 element_precision (const_tree type
)
6898 type
= TREE_TYPE (type
);
6899 enum tree_code code
= TREE_CODE (type
);
6900 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6901 type
= TREE_TYPE (type
);
6903 return TYPE_PRECISION (type
);
6906 /* Return true if CODE represents an associative tree code. Otherwise
6909 associative_tree_code (enum tree_code code
)
6928 /* Return true if CODE represents a commutative tree code. Otherwise
6931 commutative_tree_code (enum tree_code code
)
6937 case MULT_HIGHPART_EXPR
:
6945 case UNORDERED_EXPR
:
6949 case TRUTH_AND_EXPR
:
6950 case TRUTH_XOR_EXPR
:
6952 case WIDEN_MULT_EXPR
:
6953 case VEC_WIDEN_MULT_HI_EXPR
:
6954 case VEC_WIDEN_MULT_LO_EXPR
:
6955 case VEC_WIDEN_MULT_EVEN_EXPR
:
6956 case VEC_WIDEN_MULT_ODD_EXPR
:
6965 /* Return true if CODE represents a ternary tree code for which the
6966 first two operands are commutative. Otherwise return false. */
6968 commutative_ternary_tree_code (enum tree_code code
)
6972 case WIDEN_MULT_PLUS_EXPR
:
6973 case WIDEN_MULT_MINUS_EXPR
:
6984 /* Returns true if CODE can overflow. */
6987 operation_can_overflow (enum tree_code code
)
6995 /* Can overflow in various ways. */
6997 case TRUNC_DIV_EXPR
:
6998 case EXACT_DIV_EXPR
:
6999 case FLOOR_DIV_EXPR
:
7001 /* For INT_MIN / -1. */
7008 /* These operators cannot overflow. */
7013 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7014 ftrapv doesn't generate trapping insns for CODE. */
7017 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7019 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7021 /* We don't generate instructions that trap on overflow for complex or vector
7023 if (!INTEGRAL_TYPE_P (type
))
7026 if (!TYPE_OVERFLOW_TRAPS (type
))
7036 /* These operators can overflow, and -ftrapv generates trapping code for
7039 case TRUNC_DIV_EXPR
:
7040 case EXACT_DIV_EXPR
:
7041 case FLOOR_DIV_EXPR
:
7044 /* These operators can overflow, but -ftrapv does not generate trapping
7048 /* These operators cannot overflow. */
7056 /* Generate a hash value for an expression. This can be used iteratively
7057 by passing a previous result as the HSTATE argument.
7059 This function is intended to produce the same hash for expressions which
7060 would compare equal using operand_equal_p. */
7062 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7065 enum tree_code code
;
7066 enum tree_code_class tclass
;
7068 if (t
== NULL_TREE
|| t
== error_mark_node
)
7070 hstate
.merge_hash (0);
7074 if (!(flags
& OEP_ADDRESS_OF
))
7077 code
= TREE_CODE (t
);
7081 /* Alas, constants aren't shared, so we can't rely on pointer
7084 hstate
.merge_hash (0);
7087 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7088 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7089 hstate
.add_hwi (TREE_INT_CST_ELT (t
, i
));
7094 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7097 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7098 hstate
.merge_hash (val2
);
7103 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7104 hstate
.merge_hash (val2
);
7108 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7109 TREE_STRING_LENGTH (t
));
7112 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7113 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7118 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7119 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7123 /* We can just compare by pointer. */
7124 hstate
.add_hwi (SSA_NAME_VERSION (t
));
7126 case PLACEHOLDER_EXPR
:
7127 /* The node itself doesn't matter. */
7134 /* A list of expressions, for a CALL_EXPR or as the elements of a
7136 for (; t
; t
= TREE_CHAIN (t
))
7137 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7141 unsigned HOST_WIDE_INT idx
;
7143 flags
&= ~OEP_ADDRESS_OF
;
7144 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7146 inchash::add_expr (field
, hstate
, flags
);
7147 inchash::add_expr (value
, hstate
, flags
);
7151 case STATEMENT_LIST
:
7153 tree_stmt_iterator i
;
7154 for (i
= tsi_start (CONST_CAST_TREE (t
));
7155 !tsi_end_p (i
); tsi_next (&i
))
7156 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7160 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7161 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7164 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7165 Otherwise nodes that compare equal according to operand_equal_p might
7166 get different hash codes. However, don't do this for machine specific
7167 or front end builtins, since the function code is overloaded in those
7169 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7170 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7172 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7173 code
= TREE_CODE (t
);
7177 tclass
= TREE_CODE_CLASS (code
);
7179 if (tclass
== tcc_declaration
)
7181 /* DECL's have a unique ID */
7182 hstate
.add_hwi (DECL_UID (t
));
7184 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7186 /* For comparisons that can be swapped, use the lower
7188 enum tree_code ccode
= swap_tree_comparison (code
);
7191 hstate
.add_object (ccode
);
7192 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7193 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7195 else if (CONVERT_EXPR_CODE_P (code
))
7197 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7199 enum tree_code ccode
= NOP_EXPR
;
7200 hstate
.add_object (ccode
);
7202 /* Don't hash the type, that can lead to having nodes which
7203 compare equal according to operand_equal_p, but which
7204 have different hash codes. Make sure to include signedness
7205 in the hash computation. */
7206 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7207 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7209 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7210 else if (code
== MEM_REF
7211 && (flags
& OEP_ADDRESS_OF
) != 0
7212 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7213 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7214 && integer_zerop (TREE_OPERAND (t
, 1)))
7215 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7217 /* Don't ICE on FE specific trees, or their arguments etc.
7218 during operand_equal_p hash verification. */
7219 else if (!IS_EXPR_CODE_CLASS (tclass
))
7220 gcc_assert (flags
& OEP_HASH_CHECK
);
7223 unsigned int sflags
= flags
;
7225 hstate
.add_object (code
);
7230 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7231 flags
|= OEP_ADDRESS_OF
;
7237 case TARGET_MEM_REF
:
7238 flags
&= ~OEP_ADDRESS_OF
;
7243 case ARRAY_RANGE_REF
:
7246 sflags
&= ~OEP_ADDRESS_OF
;
7250 flags
&= ~OEP_ADDRESS_OF
;
7254 case WIDEN_MULT_PLUS_EXPR
:
7255 case WIDEN_MULT_MINUS_EXPR
:
7257 /* The multiplication operands are commutative. */
7258 inchash::hash one
, two
;
7259 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7260 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7261 hstate
.add_commutative (one
, two
);
7262 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7267 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7268 hstate
.add_int (CALL_EXPR_IFN (t
));
7272 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7273 Usually different TARGET_EXPRs just should use
7274 different temporaries in their slots. */
7275 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7282 /* Don't hash the type, that can lead to having nodes which
7283 compare equal according to operand_equal_p, but which
7284 have different hash codes. */
7285 if (code
== NON_LVALUE_EXPR
)
7287 /* Make sure to include signness in the hash computation. */
7288 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7289 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7292 else if (commutative_tree_code (code
))
7294 /* It's a commutative expression. We want to hash it the same
7295 however it appears. We do this by first hashing both operands
7296 and then rehashing based on the order of their independent
7298 inchash::hash one
, two
;
7299 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7300 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7301 hstate
.add_commutative (one
, two
);
7304 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7305 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7306 i
== 0 ? flags
: sflags
);
7314 /* Constructors for pointer, array and function types.
7315 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7316 constructed by language-dependent code, not here.) */
7318 /* Construct, lay out and return the type of pointers to TO_TYPE with
7319 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7320 reference all of memory. If such a type has already been
7321 constructed, reuse it. */
7324 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7328 bool could_alias
= can_alias_all
;
7330 if (to_type
== error_mark_node
)
7331 return error_mark_node
;
7333 /* If the pointed-to type has the may_alias attribute set, force
7334 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7335 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7336 can_alias_all
= true;
7338 /* In some cases, languages will have things that aren't a POINTER_TYPE
7339 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7340 In that case, return that type without regard to the rest of our
7343 ??? This is a kludge, but consistent with the way this function has
7344 always operated and there doesn't seem to be a good way to avoid this
7346 if (TYPE_POINTER_TO (to_type
) != 0
7347 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7348 return TYPE_POINTER_TO (to_type
);
7350 /* First, if we already have a type for pointers to TO_TYPE and it's
7351 the proper mode, use it. */
7352 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7353 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7356 t
= make_node (POINTER_TYPE
);
7358 TREE_TYPE (t
) = to_type
;
7359 SET_TYPE_MODE (t
, mode
);
7360 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7361 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7362 TYPE_POINTER_TO (to_type
) = t
;
7364 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7365 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7366 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7367 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7369 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7372 /* Lay out the type. This function has many callers that are concerned
7373 with expression-construction, and this simplifies them all. */
7379 /* By default build pointers in ptr_mode. */
7382 build_pointer_type (tree to_type
)
7384 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7385 : TYPE_ADDR_SPACE (to_type
);
7386 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7387 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7390 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7393 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7397 bool could_alias
= can_alias_all
;
7399 if (to_type
== error_mark_node
)
7400 return error_mark_node
;
7402 /* If the pointed-to type has the may_alias attribute set, force
7403 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7404 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7405 can_alias_all
= true;
7407 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7408 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7409 In that case, return that type without regard to the rest of our
7412 ??? This is a kludge, but consistent with the way this function has
7413 always operated and there doesn't seem to be a good way to avoid this
7415 if (TYPE_REFERENCE_TO (to_type
) != 0
7416 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7417 return TYPE_REFERENCE_TO (to_type
);
7419 /* First, if we already have a type for pointers to TO_TYPE and it's
7420 the proper mode, use it. */
7421 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7422 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7425 t
= make_node (REFERENCE_TYPE
);
7427 TREE_TYPE (t
) = to_type
;
7428 SET_TYPE_MODE (t
, mode
);
7429 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7430 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7431 TYPE_REFERENCE_TO (to_type
) = t
;
7433 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7434 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7435 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7436 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7438 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7447 /* Build the node for the type of references-to-TO_TYPE by default
7451 build_reference_type (tree to_type
)
7453 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7454 : TYPE_ADDR_SPACE (to_type
);
7455 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7456 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7459 #define MAX_INT_CACHED_PREC \
7460 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7461 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7463 /* Builds a signed or unsigned integer type of precision PRECISION.
7464 Used for C bitfields whose precision does not match that of
7465 built-in target types. */
7467 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7473 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7475 if (precision
<= MAX_INT_CACHED_PREC
)
7477 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7482 itype
= make_node (INTEGER_TYPE
);
7483 TYPE_PRECISION (itype
) = precision
;
7486 fixup_unsigned_type (itype
);
7488 fixup_signed_type (itype
);
7492 inchash::hash hstate
;
7493 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
7494 ret
= type_hash_canon (hstate
.end (), itype
);
7495 if (precision
<= MAX_INT_CACHED_PREC
)
7496 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7501 #define MAX_BOOL_CACHED_PREC \
7502 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7503 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7505 /* Builds a boolean type of precision PRECISION.
7506 Used for boolean vectors to choose proper vector element size. */
7508 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7512 if (precision
<= MAX_BOOL_CACHED_PREC
)
7514 type
= nonstandard_boolean_type_cache
[precision
];
7519 type
= make_node (BOOLEAN_TYPE
);
7520 TYPE_PRECISION (type
) = precision
;
7521 fixup_signed_type (type
);
7523 if (precision
<= MAX_INT_CACHED_PREC
)
7524 nonstandard_boolean_type_cache
[precision
] = type
;
7529 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7530 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7531 is true, reuse such a type that has already been constructed. */
7534 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7536 tree itype
= make_node (INTEGER_TYPE
);
7538 TREE_TYPE (itype
) = type
;
7540 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7541 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7543 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7544 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7545 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7546 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7547 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7548 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7549 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7554 if ((TYPE_MIN_VALUE (itype
)
7555 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7556 || (TYPE_MAX_VALUE (itype
)
7557 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7559 /* Since we cannot reliably merge this type, we need to compare it using
7560 structural equality checks. */
7561 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7565 hashval_t hash
= type_hash_canon_hash (itype
);
7566 itype
= type_hash_canon (hash
, itype
);
7571 /* Wrapper around build_range_type_1 with SHARED set to true. */
7574 build_range_type (tree type
, tree lowval
, tree highval
)
7576 return build_range_type_1 (type
, lowval
, highval
, true);
7579 /* Wrapper around build_range_type_1 with SHARED set to false. */
7582 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7584 return build_range_type_1 (type
, lowval
, highval
, false);
7587 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7588 MAXVAL should be the maximum value in the domain
7589 (one less than the length of the array).
7591 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7592 We don't enforce this limit, that is up to caller (e.g. language front end).
7593 The limit exists because the result is a signed type and we don't handle
7594 sizes that use more than one HOST_WIDE_INT. */
7597 build_index_type (tree maxval
)
7599 return build_range_type (sizetype
, size_zero_node
, maxval
);
7602 /* Return true if the debug information for TYPE, a subtype, should be emitted
7603 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7604 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7605 debug info and doesn't reflect the source code. */
7608 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7610 tree base_type
= TREE_TYPE (type
), low
, high
;
7612 /* Subrange types have a base type which is an integral type. */
7613 if (!INTEGRAL_TYPE_P (base_type
))
7616 /* Get the real bounds of the subtype. */
7617 if (lang_hooks
.types
.get_subrange_bounds
)
7618 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7621 low
= TYPE_MIN_VALUE (type
);
7622 high
= TYPE_MAX_VALUE (type
);
7625 /* If the type and its base type have the same representation and the same
7626 name, then the type is not a subrange but a copy of the base type. */
7627 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7628 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7629 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7630 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7631 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7632 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7642 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7643 and number of elements specified by the range of values of INDEX_TYPE.
7644 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7645 If SHARED is true, reuse such a type that has already been constructed. */
7648 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7653 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7655 error ("arrays of functions are not meaningful");
7656 elt_type
= integer_type_node
;
7659 t
= make_node (ARRAY_TYPE
);
7660 TREE_TYPE (t
) = elt_type
;
7661 TYPE_DOMAIN (t
) = index_type
;
7662 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7663 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7666 /* If the element type is incomplete at this point we get marked for
7667 structural equality. Do not record these types in the canonical
7669 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7674 hashval_t hash
= type_hash_canon_hash (t
);
7675 t
= type_hash_canon (hash
, t
);
7678 if (TYPE_CANONICAL (t
) == t
)
7680 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7681 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7683 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7684 else if (TYPE_CANONICAL (elt_type
) != elt_type
7685 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7687 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7689 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7690 typeless_storage
, shared
);
7696 /* Wrapper around build_array_type_1 with SHARED set to true. */
7699 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7701 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7704 /* Wrapper around build_array_type_1 with SHARED set to false. */
7707 build_nonshared_array_type (tree elt_type
, tree index_type
)
7709 return build_array_type_1 (elt_type
, index_type
, false, false);
7712 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7716 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7718 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7721 /* Recursively examines the array elements of TYPE, until a non-array
7722 element type is found. */
7725 strip_array_types (tree type
)
7727 while (TREE_CODE (type
) == ARRAY_TYPE
)
7728 type
= TREE_TYPE (type
);
7733 /* Computes the canonical argument types from the argument type list
7736 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7737 on entry to this function, or if any of the ARGTYPES are
7740 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7741 true on entry to this function, or if any of the ARGTYPES are
7744 Returns a canonical argument list, which may be ARGTYPES when the
7745 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7746 true) or would not differ from ARGTYPES. */
7749 maybe_canonicalize_argtypes (tree argtypes
,
7750 bool *any_structural_p
,
7751 bool *any_noncanonical_p
)
7754 bool any_noncanonical_argtypes_p
= false;
7756 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7758 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7759 /* Fail gracefully by stating that the type is structural. */
7760 *any_structural_p
= true;
7761 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7762 *any_structural_p
= true;
7763 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7764 || TREE_PURPOSE (arg
))
7765 /* If the argument has a default argument, we consider it
7766 non-canonical even though the type itself is canonical.
7767 That way, different variants of function and method types
7768 with default arguments will all point to the variant with
7769 no defaults as their canonical type. */
7770 any_noncanonical_argtypes_p
= true;
7773 if (*any_structural_p
)
7776 if (any_noncanonical_argtypes_p
)
7778 /* Build the canonical list of argument types. */
7779 tree canon_argtypes
= NULL_TREE
;
7780 bool is_void
= false;
7782 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7784 if (arg
== void_list_node
)
7787 canon_argtypes
= tree_cons (NULL_TREE
,
7788 TYPE_CANONICAL (TREE_VALUE (arg
)),
7792 canon_argtypes
= nreverse (canon_argtypes
);
7794 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7796 /* There is a non-canonical type. */
7797 *any_noncanonical_p
= true;
7798 return canon_argtypes
;
7801 /* The canonical argument types are the same as ARGTYPES. */
7805 /* Construct, lay out and return
7806 the type of functions returning type VALUE_TYPE
7807 given arguments of types ARG_TYPES.
7808 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7809 are data type nodes for the arguments of the function.
7810 If such a type has already been constructed, reuse it. */
7813 build_function_type (tree value_type
, tree arg_types
)
7816 inchash::hash hstate
;
7817 bool any_structural_p
, any_noncanonical_p
;
7818 tree canon_argtypes
;
7820 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7822 error ("function return type cannot be function");
7823 value_type
= integer_type_node
;
7826 /* Make a node of the sort we want. */
7827 t
= make_node (FUNCTION_TYPE
);
7828 TREE_TYPE (t
) = value_type
;
7829 TYPE_ARG_TYPES (t
) = arg_types
;
7831 /* If we already have such a type, use the old one. */
7832 hashval_t hash
= type_hash_canon_hash (t
);
7833 t
= type_hash_canon (hash
, t
);
7835 /* Set up the canonical type. */
7836 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7837 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7838 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7840 &any_noncanonical_p
);
7841 if (any_structural_p
)
7842 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7843 else if (any_noncanonical_p
)
7844 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7847 if (!COMPLETE_TYPE_P (t
))
7852 /* Build a function type. The RETURN_TYPE is the type returned by the
7853 function. If VAARGS is set, no void_type_node is appended to the
7854 list. ARGP must be always be terminated be a NULL_TREE. */
7857 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7861 t
= va_arg (argp
, tree
);
7862 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7863 args
= tree_cons (NULL_TREE
, t
, args
);
7868 if (args
!= NULL_TREE
)
7869 args
= nreverse (args
);
7870 gcc_assert (last
!= void_list_node
);
7872 else if (args
== NULL_TREE
)
7873 args
= void_list_node
;
7877 args
= nreverse (args
);
7878 TREE_CHAIN (last
) = void_list_node
;
7880 args
= build_function_type (return_type
, args
);
7885 /* Build a function type. The RETURN_TYPE is the type returned by the
7886 function. If additional arguments are provided, they are
7887 additional argument types. The list of argument types must always
7888 be terminated by NULL_TREE. */
7891 build_function_type_list (tree return_type
, ...)
7896 va_start (p
, return_type
);
7897 args
= build_function_type_list_1 (false, return_type
, p
);
7902 /* Build a variable argument function type. The RETURN_TYPE is the
7903 type returned by the function. If additional arguments are provided,
7904 they are additional argument types. The list of argument types must
7905 always be terminated by NULL_TREE. */
7908 build_varargs_function_type_list (tree return_type
, ...)
7913 va_start (p
, return_type
);
7914 args
= build_function_type_list_1 (true, return_type
, p
);
7920 /* Build a function type. RETURN_TYPE is the type returned by the
7921 function; VAARGS indicates whether the function takes varargs. The
7922 function takes N named arguments, the types of which are provided in
7926 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7930 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7932 for (i
= n
- 1; i
>= 0; i
--)
7933 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7935 return build_function_type (return_type
, t
);
7938 /* Build a function type. RETURN_TYPE is the type returned by the
7939 function. The function takes N named arguments, the types of which
7940 are provided in ARG_TYPES. */
7943 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7945 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7948 /* Build a variable argument function type. RETURN_TYPE is the type
7949 returned by the function. The function takes N named arguments, the
7950 types of which are provided in ARG_TYPES. */
7953 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7955 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7958 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7959 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7960 for the method. An implicit additional parameter (of type
7961 pointer-to-BASETYPE) is added to the ARGTYPES. */
7964 build_method_type_directly (tree basetype
,
7970 bool any_structural_p
, any_noncanonical_p
;
7971 tree canon_argtypes
;
7973 /* Make a node of the sort we want. */
7974 t
= make_node (METHOD_TYPE
);
7976 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7977 TREE_TYPE (t
) = rettype
;
7978 ptype
= build_pointer_type (basetype
);
7980 /* The actual arglist for this function includes a "hidden" argument
7981 which is "this". Put it into the list of argument types. */
7982 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7983 TYPE_ARG_TYPES (t
) = argtypes
;
7985 /* If we already have such a type, use the old one. */
7986 hashval_t hash
= type_hash_canon_hash (t
);
7987 t
= type_hash_canon (hash
, t
);
7989 /* Set up the canonical type. */
7991 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7992 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7994 = (TYPE_CANONICAL (basetype
) != basetype
7995 || TYPE_CANONICAL (rettype
) != rettype
);
7996 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7998 &any_noncanonical_p
);
7999 if (any_structural_p
)
8000 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8001 else if (any_noncanonical_p
)
8003 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8004 TYPE_CANONICAL (rettype
),
8006 if (!COMPLETE_TYPE_P (t
))
8012 /* Construct, lay out and return the type of methods belonging to class
8013 BASETYPE and whose arguments and values are described by TYPE.
8014 If that type exists already, reuse it.
8015 TYPE must be a FUNCTION_TYPE node. */
8018 build_method_type (tree basetype
, tree type
)
8020 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8022 return build_method_type_directly (basetype
,
8024 TYPE_ARG_TYPES (type
));
8027 /* Construct, lay out and return the type of offsets to a value
8028 of type TYPE, within an object of type BASETYPE.
8029 If a suitable offset type exists already, reuse it. */
8032 build_offset_type (tree basetype
, tree type
)
8036 /* Make a node of the sort we want. */
8037 t
= make_node (OFFSET_TYPE
);
8039 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8040 TREE_TYPE (t
) = type
;
8042 /* If we already have such a type, use the old one. */
8043 hashval_t hash
= type_hash_canon_hash (t
);
8044 t
= type_hash_canon (hash
, t
);
8046 if (!COMPLETE_TYPE_P (t
))
8049 if (TYPE_CANONICAL (t
) == t
)
8051 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8052 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8053 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8054 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8055 || TYPE_CANONICAL (type
) != type
)
8057 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8058 TYPE_CANONICAL (type
));
8064 /* Create a complex type whose components are COMPONENT_TYPE.
8066 If NAMED is true, the type is given a TYPE_NAME. We do not always
8067 do so because this creates a DECL node and thus make the DECL_UIDs
8068 dependent on the type canonicalization hashtable, which is GC-ed,
8069 so the DECL_UIDs would not be stable wrt garbage collection. */
8072 build_complex_type (tree component_type
, bool named
)
8074 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8075 || SCALAR_FLOAT_TYPE_P (component_type
)
8076 || FIXED_POINT_TYPE_P (component_type
));
8078 /* Make a node of the sort we want. */
8079 tree probe
= make_node (COMPLEX_TYPE
);
8081 TREE_TYPE (probe
) = TYPE_MAIN_VARIANT (component_type
);
8083 /* If we already have such a type, use the old one. */
8084 hashval_t hash
= type_hash_canon_hash (probe
);
8085 tree t
= type_hash_canon (hash
, probe
);
8089 /* We created a new type. The hash insertion will have laid
8090 out the type. We need to check the canonicalization and
8091 maybe set the name. */
8092 gcc_checking_assert (COMPLETE_TYPE_P (t
)
8094 && TYPE_CANONICAL (t
) == t
);
8096 if (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (t
)))
8097 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8098 else if (TYPE_CANONICAL (TREE_TYPE (t
)) != TREE_TYPE (t
))
8100 = build_complex_type (TYPE_CANONICAL (TREE_TYPE (t
)), named
);
8102 /* We need to create a name, since complex is a fundamental type. */
8105 const char *name
= NULL
;
8107 if (TREE_TYPE (t
) == char_type_node
)
8108 name
= "complex char";
8109 else if (TREE_TYPE (t
) == signed_char_type_node
)
8110 name
= "complex signed char";
8111 else if (TREE_TYPE (t
) == unsigned_char_type_node
)
8112 name
= "complex unsigned char";
8113 else if (TREE_TYPE (t
) == short_integer_type_node
)
8114 name
= "complex short int";
8115 else if (TREE_TYPE (t
) == short_unsigned_type_node
)
8116 name
= "complex short unsigned int";
8117 else if (TREE_TYPE (t
) == integer_type_node
)
8118 name
= "complex int";
8119 else if (TREE_TYPE (t
) == unsigned_type_node
)
8120 name
= "complex unsigned int";
8121 else if (TREE_TYPE (t
) == long_integer_type_node
)
8122 name
= "complex long int";
8123 else if (TREE_TYPE (t
) == long_unsigned_type_node
)
8124 name
= "complex long unsigned int";
8125 else if (TREE_TYPE (t
) == long_long_integer_type_node
)
8126 name
= "complex long long int";
8127 else if (TREE_TYPE (t
) == long_long_unsigned_type_node
)
8128 name
= "complex long long unsigned int";
8131 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8132 get_identifier (name
), t
);
8136 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8139 /* If TYPE is a real or complex floating-point type and the target
8140 does not directly support arithmetic on TYPE then return the wider
8141 type to be used for arithmetic on TYPE. Otherwise, return
8145 excess_precision_type (tree type
)
8147 /* The target can give two different responses to the question of
8148 which excess precision mode it would like depending on whether we
8149 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8151 enum excess_precision_type requested_type
8152 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8153 ? EXCESS_PRECISION_TYPE_FAST
8154 : EXCESS_PRECISION_TYPE_STANDARD
);
8156 enum flt_eval_method target_flt_eval_method
8157 = targetm
.c
.excess_precision (requested_type
);
8159 /* The target should not ask for unpredictable float evaluation (though
8160 it might advertise that implicitly the evaluation is unpredictable,
8161 but we don't care about that here, it will have been reported
8162 elsewhere). If it does ask for unpredictable evaluation, we have
8163 nothing to do here. */
8164 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8166 /* Nothing to do. The target has asked for all types we know about
8167 to be computed with their native precision and range. */
8168 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8171 /* The target will promote this type in a target-dependent way, so excess
8172 precision ought to leave it alone. */
8173 if (targetm
.promoted_type (type
) != NULL_TREE
)
8176 machine_mode float16_type_mode
= (float16_type_node
8177 ? TYPE_MODE (float16_type_node
)
8179 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8180 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8182 switch (TREE_CODE (type
))
8186 machine_mode type_mode
= TYPE_MODE (type
);
8187 switch (target_flt_eval_method
)
8189 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8190 if (type_mode
== float16_type_mode
)
8191 return float_type_node
;
8193 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8194 if (type_mode
== float16_type_mode
8195 || type_mode
== float_type_mode
)
8196 return double_type_node
;
8198 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8199 if (type_mode
== float16_type_mode
8200 || type_mode
== float_type_mode
8201 || type_mode
== double_type_mode
)
8202 return long_double_type_node
;
8211 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8213 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8214 switch (target_flt_eval_method
)
8216 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8217 if (type_mode
== float16_type_mode
)
8218 return complex_float_type_node
;
8220 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8221 if (type_mode
== float16_type_mode
8222 || type_mode
== float_type_mode
)
8223 return complex_double_type_node
;
8225 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8226 if (type_mode
== float16_type_mode
8227 || type_mode
== float_type_mode
8228 || type_mode
== double_type_mode
)
8229 return complex_long_double_type_node
;
8243 /* Return OP, stripped of any conversions to wider types as much as is safe.
8244 Converting the value back to OP's type makes a value equivalent to OP.
8246 If FOR_TYPE is nonzero, we return a value which, if converted to
8247 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8249 OP must have integer, real or enumeral type. Pointers are not allowed!
8251 There are some cases where the obvious value we could return
8252 would regenerate to OP if converted to OP's type,
8253 but would not extend like OP to wider types.
8254 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8255 For example, if OP is (unsigned short)(signed char)-1,
8256 we avoid returning (signed char)-1 if FOR_TYPE is int,
8257 even though extending that to an unsigned short would regenerate OP,
8258 since the result of extending (signed char)-1 to (int)
8259 is different from (int) OP. */
8262 get_unwidened (tree op
, tree for_type
)
8264 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8265 tree type
= TREE_TYPE (op
);
8267 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8269 = (for_type
!= 0 && for_type
!= type
8270 && final_prec
> TYPE_PRECISION (type
)
8271 && TYPE_UNSIGNED (type
));
8274 while (CONVERT_EXPR_P (op
))
8278 /* TYPE_PRECISION on vector types has different meaning
8279 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8280 so avoid them here. */
8281 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8284 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8285 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8287 /* Truncations are many-one so cannot be removed.
8288 Unless we are later going to truncate down even farther. */
8290 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8293 /* See what's inside this conversion. If we decide to strip it,
8295 op
= TREE_OPERAND (op
, 0);
8297 /* If we have not stripped any zero-extensions (uns is 0),
8298 we can strip any kind of extension.
8299 If we have previously stripped a zero-extension,
8300 only zero-extensions can safely be stripped.
8301 Any extension can be stripped if the bits it would produce
8302 are all going to be discarded later by truncating to FOR_TYPE. */
8306 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8308 /* TYPE_UNSIGNED says whether this is a zero-extension.
8309 Let's avoid computing it if it does not affect WIN
8310 and if UNS will not be needed again. */
8312 || CONVERT_EXPR_P (op
))
8313 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8321 /* If we finally reach a constant see if it fits in sth smaller and
8322 in that case convert it. */
8323 if (TREE_CODE (win
) == INTEGER_CST
)
8325 tree wtype
= TREE_TYPE (win
);
8326 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8328 prec
= MAX (prec
, final_prec
);
8329 if (prec
< TYPE_PRECISION (wtype
))
8331 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8332 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8333 win
= fold_convert (t
, win
);
8340 /* Return OP or a simpler expression for a narrower value
8341 which can be sign-extended or zero-extended to give back OP.
8342 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8343 or 0 if the value should be sign-extended. */
8346 get_narrower (tree op
, int *unsignedp_ptr
)
8351 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8353 while (TREE_CODE (op
) == NOP_EXPR
)
8356 = (TYPE_PRECISION (TREE_TYPE (op
))
8357 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8359 /* Truncations are many-one so cannot be removed. */
8363 /* See what's inside this conversion. If we decide to strip it,
8368 op
= TREE_OPERAND (op
, 0);
8369 /* An extension: the outermost one can be stripped,
8370 but remember whether it is zero or sign extension. */
8372 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8373 /* Otherwise, if a sign extension has been stripped,
8374 only sign extensions can now be stripped;
8375 if a zero extension has been stripped, only zero-extensions. */
8376 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8380 else /* bitschange == 0 */
8382 /* A change in nominal type can always be stripped, but we must
8383 preserve the unsignedness. */
8385 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8387 op
= TREE_OPERAND (op
, 0);
8388 /* Keep trying to narrow, but don't assign op to win if it
8389 would turn an integral type into something else. */
8390 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8397 if (TREE_CODE (op
) == COMPONENT_REF
8398 /* Since type_for_size always gives an integer type. */
8399 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8400 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8401 /* Ensure field is laid out already. */
8402 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8403 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8405 unsigned HOST_WIDE_INT innerprec
8406 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8407 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8408 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8409 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8411 /* We can get this structure field in a narrower type that fits it,
8412 but the resulting extension to its nominal type (a fullword type)
8413 must satisfy the same conditions as for other extensions.
8415 Do this only for fields that are aligned (not bit-fields),
8416 because when bit-field insns will be used there is no
8417 advantage in doing this. */
8419 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8420 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8421 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8425 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8426 win
= fold_convert (type
, op
);
8430 *unsignedp_ptr
= uns
;
8434 /* Return true if integer constant C has a value that is permissible
8435 for TYPE, an integral type. */
8438 int_fits_type_p (const_tree c
, const_tree type
)
8440 tree type_low_bound
, type_high_bound
;
8441 bool ok_for_low_bound
, ok_for_high_bound
;
8442 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8444 /* Non-standard boolean types can have arbitrary precision but various
8445 transformations assume that they can only take values 0 and +/-1. */
8446 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8447 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8450 type_low_bound
= TYPE_MIN_VALUE (type
);
8451 type_high_bound
= TYPE_MAX_VALUE (type
);
8453 /* If at least one bound of the type is a constant integer, we can check
8454 ourselves and maybe make a decision. If no such decision is possible, but
8455 this type is a subtype, try checking against that. Otherwise, use
8456 fits_to_tree_p, which checks against the precision.
8458 Compute the status for each possibly constant bound, and return if we see
8459 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8460 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8461 for "constant known to fit". */
8463 /* Check if c >= type_low_bound. */
8464 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8466 if (tree_int_cst_lt (c
, type_low_bound
))
8468 ok_for_low_bound
= true;
8471 ok_for_low_bound
= false;
8473 /* Check if c <= type_high_bound. */
8474 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8476 if (tree_int_cst_lt (type_high_bound
, c
))
8478 ok_for_high_bound
= true;
8481 ok_for_high_bound
= false;
8483 /* If the constant fits both bounds, the result is known. */
8484 if (ok_for_low_bound
&& ok_for_high_bound
)
8487 /* Perform some generic filtering which may allow making a decision
8488 even if the bounds are not constant. First, negative integers
8489 never fit in unsigned types, */
8490 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8493 /* Second, narrower types always fit in wider ones. */
8494 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8497 /* Third, unsigned integers with top bit set never fit signed types. */
8498 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8500 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8501 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8503 /* When a tree_cst is converted to a wide-int, the precision
8504 is taken from the type. However, if the precision of the
8505 mode underneath the type is smaller than that, it is
8506 possible that the value will not fit. The test below
8507 fails if any bit is set between the sign bit of the
8508 underlying mode and the top bit of the type. */
8509 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8512 else if (wi::neg_p (wi::to_wide (c
)))
8516 /* If we haven't been able to decide at this point, there nothing more we
8517 can check ourselves here. Look at the base type if we have one and it
8518 has the same precision. */
8519 if (TREE_CODE (type
) == INTEGER_TYPE
8520 && TREE_TYPE (type
) != 0
8521 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8523 type
= TREE_TYPE (type
);
8527 /* Or to fits_to_tree_p, if nothing else. */
8528 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8531 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8532 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8533 represented (assuming two's-complement arithmetic) within the bit
8534 precision of the type are returned instead. */
8537 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8539 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8540 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8541 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8544 if (TYPE_UNSIGNED (type
))
8545 mpz_set_ui (min
, 0);
8548 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8549 wi::to_mpz (mn
, min
, SIGNED
);
8553 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8554 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8555 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8558 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8559 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8563 /* Return true if VAR is an automatic variable defined in function FN. */
8566 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8568 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8569 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8570 || TREE_CODE (var
) == PARM_DECL
)
8571 && ! TREE_STATIC (var
))
8572 || TREE_CODE (var
) == LABEL_DECL
8573 || TREE_CODE (var
) == RESULT_DECL
));
8576 /* Subprogram of following function. Called by walk_tree.
8578 Return *TP if it is an automatic variable or parameter of the
8579 function passed in as DATA. */
8582 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8584 tree fn
= (tree
) data
;
8589 else if (DECL_P (*tp
)
8590 && auto_var_in_fn_p (*tp
, fn
))
8596 /* Returns true if T is, contains, or refers to a type with variable
8597 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8598 arguments, but not the return type. If FN is nonzero, only return
8599 true if a modifier of the type or position of FN is a variable or
8600 parameter inside FN.
8602 This concept is more general than that of C99 'variably modified types':
8603 in C99, a struct type is never variably modified because a VLA may not
8604 appear as a structure member. However, in GNU C code like:
8606 struct S { int i[f()]; };
8608 is valid, and other languages may define similar constructs. */
8611 variably_modified_type_p (tree type
, tree fn
)
8615 /* Test if T is either variable (if FN is zero) or an expression containing
8616 a variable in FN. If TYPE isn't gimplified, return true also if
8617 gimplify_one_sizepos would gimplify the expression into a local
8619 #define RETURN_TRUE_IF_VAR(T) \
8620 do { tree _t = (T); \
8621 if (_t != NULL_TREE \
8622 && _t != error_mark_node \
8623 && TREE_CODE (_t) != INTEGER_CST \
8624 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8626 || (!TYPE_SIZES_GIMPLIFIED (type) \
8627 && !is_gimple_sizepos (_t)) \
8628 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8629 return true; } while (0)
8631 if (type
== error_mark_node
)
8634 /* If TYPE itself has variable size, it is variably modified. */
8635 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8636 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8638 switch (TREE_CODE (type
))
8641 case REFERENCE_TYPE
:
8643 /* Ada can have pointer types refering to themselves indirectly. */
8644 if (TREE_VISITED (type
))
8646 TREE_VISITED (type
) = true;
8647 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8649 TREE_VISITED (type
) = false;
8652 TREE_VISITED (type
) = false;
8657 /* If TYPE is a function type, it is variably modified if the
8658 return type is variably modified. */
8659 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8665 case FIXED_POINT_TYPE
:
8668 /* Scalar types are variably modified if their end points
8670 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8671 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8676 case QUAL_UNION_TYPE
:
8677 /* We can't see if any of the fields are variably-modified by the
8678 definition we normally use, since that would produce infinite
8679 recursion via pointers. */
8680 /* This is variably modified if some field's type is. */
8681 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8682 if (TREE_CODE (t
) == FIELD_DECL
)
8684 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8685 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8686 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8688 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8689 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8694 /* Do not call ourselves to avoid infinite recursion. This is
8695 variably modified if the element type is. */
8696 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8697 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8704 /* The current language may have other cases to check, but in general,
8705 all other types are not variably modified. */
8706 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8708 #undef RETURN_TRUE_IF_VAR
8711 /* Given a DECL or TYPE, return the scope in which it was declared, or
8712 NULL_TREE if there is no containing scope. */
8715 get_containing_scope (const_tree t
)
8717 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8720 /* Returns the ultimate TRANSLATION_UNIT_DECL context of DECL or NULL. */
8723 get_ultimate_context (const_tree decl
)
8725 while (decl
&& TREE_CODE (decl
) != TRANSLATION_UNIT_DECL
)
8727 if (TREE_CODE (decl
) == BLOCK
)
8728 decl
= BLOCK_SUPERCONTEXT (decl
);
8730 decl
= get_containing_scope (decl
);
8735 /* Return the innermost context enclosing DECL that is
8736 a FUNCTION_DECL, or zero if none. */
8739 decl_function_context (const_tree decl
)
8743 if (TREE_CODE (decl
) == ERROR_MARK
)
8746 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8747 where we look up the function at runtime. Such functions always take
8748 a first argument of type 'pointer to real context'.
8750 C++ should really be fixed to use DECL_CONTEXT for the real context,
8751 and use something else for the "virtual context". */
8752 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8755 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8757 context
= DECL_CONTEXT (decl
);
8759 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8761 if (TREE_CODE (context
) == BLOCK
)
8762 context
= BLOCK_SUPERCONTEXT (context
);
8764 context
= get_containing_scope (context
);
8770 /* Return the innermost context enclosing DECL that is
8771 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8772 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8775 decl_type_context (const_tree decl
)
8777 tree context
= DECL_CONTEXT (decl
);
8780 switch (TREE_CODE (context
))
8782 case NAMESPACE_DECL
:
8783 case TRANSLATION_UNIT_DECL
:
8788 case QUAL_UNION_TYPE
:
8793 context
= DECL_CONTEXT (context
);
8797 context
= BLOCK_SUPERCONTEXT (context
);
8807 /* CALL is a CALL_EXPR. Return the declaration for the function
8808 called, or NULL_TREE if the called function cannot be
8812 get_callee_fndecl (const_tree call
)
8816 if (call
== error_mark_node
)
8817 return error_mark_node
;
8819 /* It's invalid to call this function with anything but a
8821 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8823 /* The first operand to the CALL is the address of the function
8825 addr
= CALL_EXPR_FN (call
);
8827 /* If there is no function, return early. */
8828 if (addr
== NULL_TREE
)
8833 /* If this is a readonly function pointer, extract its initial value. */
8834 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8835 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8836 && DECL_INITIAL (addr
))
8837 addr
= DECL_INITIAL (addr
);
8839 /* If the address is just `&f' for some function `f', then we know
8840 that `f' is being called. */
8841 if (TREE_CODE (addr
) == ADDR_EXPR
8842 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8843 return TREE_OPERAND (addr
, 0);
8845 /* We couldn't figure out what was being called. */
8849 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8850 return the associated function code, otherwise return CFN_LAST. */
8853 get_call_combined_fn (const_tree call
)
8855 /* It's invalid to call this function with anything but a CALL_EXPR. */
8856 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8858 if (!CALL_EXPR_FN (call
))
8859 return as_combined_fn (CALL_EXPR_IFN (call
));
8861 tree fndecl
= get_callee_fndecl (call
);
8862 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8863 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
8868 #define TREE_MEM_USAGE_SPACES 40
8870 /* Print debugging information about tree nodes generated during the compile,
8871 and any language-specific information. */
8874 dump_tree_statistics (void)
8876 if (GATHER_STATISTICS
)
8879 int total_nodes
, total_bytes
;
8880 fprintf (stderr
, "\nKind Nodes Bytes\n");
8881 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8882 total_nodes
= total_bytes
= 0;
8883 for (i
= 0; i
< (int) all_kinds
; i
++)
8885 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8886 tree_node_counts
[i
], tree_node_sizes
[i
]);
8887 total_nodes
+= tree_node_counts
[i
];
8888 total_bytes
+= tree_node_sizes
[i
];
8890 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8891 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8892 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8893 fprintf (stderr
, "Code Nodes\n");
8894 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8895 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8896 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8897 tree_code_counts
[i
]);
8898 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8899 fprintf (stderr
, "\n");
8900 ssanames_print_statistics ();
8901 fprintf (stderr
, "\n");
8902 phinodes_print_statistics ();
8903 fprintf (stderr
, "\n");
8906 fprintf (stderr
, "(No per-node statistics)\n");
8908 print_type_hash_statistics ();
8909 print_debug_expr_statistics ();
8910 print_value_expr_statistics ();
8911 lang_hooks
.print_statistics ();
8914 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8916 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8919 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
8921 /* This relies on the raw feedback's top 4 bits being zero. */
8922 #define FEEDBACK(X) ((X) * 0x04c11db7)
8923 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8924 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8925 static const unsigned syndromes
[16] =
8927 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
8928 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
8929 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
8930 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
8935 value
<<= (32 - bytes
* 8);
8936 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
8938 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
8940 chksum
= (chksum
<< 4) ^ feedback
;
8946 /* Generate a crc32 of a string. */
8949 crc32_string (unsigned chksum
, const char *string
)
8952 chksum
= crc32_byte (chksum
, *string
);
8957 /* P is a string that will be used in a symbol. Mask out any characters
8958 that are not valid in that context. */
8961 clean_symbol_name (char *p
)
8965 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8968 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8975 /* For anonymous aggregate types, we need some sort of name to
8976 hold on to. In practice, this should not appear, but it should
8977 not be harmful if it does. */
8979 anon_aggrname_p(const_tree id_node
)
8981 #ifndef NO_DOT_IN_LABEL
8982 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
8983 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8984 #else /* NO_DOT_IN_LABEL */
8985 #ifndef NO_DOLLAR_IN_LABEL
8986 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
8987 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8988 #else /* NO_DOLLAR_IN_LABEL */
8989 #define ANON_AGGRNAME_PREFIX "__anon_"
8990 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
8991 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
8992 #endif /* NO_DOLLAR_IN_LABEL */
8993 #endif /* NO_DOT_IN_LABEL */
8996 /* Return a format for an anonymous aggregate name. */
8998 anon_aggrname_format()
9000 #ifndef NO_DOT_IN_LABEL
9002 #else /* NO_DOT_IN_LABEL */
9003 #ifndef NO_DOLLAR_IN_LABEL
9005 #else /* NO_DOLLAR_IN_LABEL */
9007 #endif /* NO_DOLLAR_IN_LABEL */
9008 #endif /* NO_DOT_IN_LABEL */
9011 /* Generate a name for a special-purpose function.
9012 The generated name may need to be unique across the whole link.
9013 Changes to this function may also require corresponding changes to
9014 xstrdup_mask_random.
9015 TYPE is some string to identify the purpose of this function to the
9016 linker or collect2; it must start with an uppercase letter,
9018 I - for constructors
9020 N - for C++ anonymous namespaces
9021 F - for DWARF unwind frame information. */
9024 get_file_function_name (const char *type
)
9030 /* If we already have a name we know to be unique, just use that. */
9031 if (first_global_object_name
)
9032 p
= q
= ASTRDUP (first_global_object_name
);
9033 /* If the target is handling the constructors/destructors, they
9034 will be local to this file and the name is only necessary for
9036 We also assign sub_I and sub_D sufixes to constructors called from
9037 the global static constructors. These are always local. */
9038 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9039 || (strncmp (type
, "sub_", 4) == 0
9040 && (type
[4] == 'I' || type
[4] == 'D')))
9042 const char *file
= main_input_filename
;
9044 file
= LOCATION_FILE (input_location
);
9045 /* Just use the file's basename, because the full pathname
9046 might be quite long. */
9047 p
= q
= ASTRDUP (lbasename (file
));
9051 /* Otherwise, the name must be unique across the entire link.
9052 We don't have anything that we know to be unique to this translation
9053 unit, so use what we do have and throw in some randomness. */
9055 const char *name
= weak_global_object_name
;
9056 const char *file
= main_input_filename
;
9061 file
= LOCATION_FILE (input_location
);
9063 len
= strlen (file
);
9064 q
= (char *) alloca (9 + 19 + len
+ 1);
9065 memcpy (q
, file
, len
+ 1);
9067 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9068 crc32_string (0, name
), get_random_seed (false));
9073 clean_symbol_name (q
);
9074 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9077 /* Set up the name of the file-level functions we may need.
9078 Use a global object (which is already required to be unique over
9079 the program) rather than the file name (which imposes extra
9081 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9083 return get_identifier (buf
);
9086 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9088 /* Complain that the tree code of NODE does not match the expected 0
9089 terminated list of trailing codes. The trailing code list can be
9090 empty, for a more vague error message. FILE, LINE, and FUNCTION
9091 are of the caller. */
9094 tree_check_failed (const_tree node
, const char *file
,
9095 int line
, const char *function
, ...)
9099 unsigned length
= 0;
9100 enum tree_code code
;
9102 va_start (args
, function
);
9103 while ((code
= (enum tree_code
) va_arg (args
, int)))
9104 length
+= 4 + strlen (get_tree_code_name (code
));
9109 va_start (args
, function
);
9110 length
+= strlen ("expected ");
9111 buffer
= tmp
= (char *) alloca (length
);
9113 while ((code
= (enum tree_code
) va_arg (args
, int)))
9115 const char *prefix
= length
? " or " : "expected ";
9117 strcpy (tmp
+ length
, prefix
);
9118 length
+= strlen (prefix
);
9119 strcpy (tmp
+ length
, get_tree_code_name (code
));
9120 length
+= strlen (get_tree_code_name (code
));
9125 buffer
= "unexpected node";
9127 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9128 buffer
, get_tree_code_name (TREE_CODE (node
)),
9129 function
, trim_filename (file
), line
);
9132 /* Complain that the tree code of NODE does match the expected 0
9133 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9137 tree_not_check_failed (const_tree node
, const char *file
,
9138 int line
, const char *function
, ...)
9142 unsigned length
= 0;
9143 enum tree_code code
;
9145 va_start (args
, function
);
9146 while ((code
= (enum tree_code
) va_arg (args
, int)))
9147 length
+= 4 + strlen (get_tree_code_name (code
));
9149 va_start (args
, function
);
9150 buffer
= (char *) alloca (length
);
9152 while ((code
= (enum tree_code
) va_arg (args
, int)))
9156 strcpy (buffer
+ length
, " or ");
9159 strcpy (buffer
+ length
, get_tree_code_name (code
));
9160 length
+= strlen (get_tree_code_name (code
));
9164 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9165 buffer
, get_tree_code_name (TREE_CODE (node
)),
9166 function
, trim_filename (file
), line
);
9169 /* Similar to tree_check_failed, except that we check for a class of tree
9170 code, given in CL. */
9173 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9174 const char *file
, int line
, const char *function
)
9177 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9178 TREE_CODE_CLASS_STRING (cl
),
9179 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9180 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9183 /* Similar to tree_check_failed, except that instead of specifying a
9184 dozen codes, use the knowledge that they're all sequential. */
9187 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9188 const char *function
, enum tree_code c1
,
9192 unsigned length
= 0;
9195 for (c
= c1
; c
<= c2
; ++c
)
9196 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9198 length
+= strlen ("expected ");
9199 buffer
= (char *) alloca (length
);
9202 for (c
= c1
; c
<= c2
; ++c
)
9204 const char *prefix
= length
? " or " : "expected ";
9206 strcpy (buffer
+ length
, prefix
);
9207 length
+= strlen (prefix
);
9208 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9209 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9212 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9213 buffer
, get_tree_code_name (TREE_CODE (node
)),
9214 function
, trim_filename (file
), line
);
9218 /* Similar to tree_check_failed, except that we check that a tree does
9219 not have the specified code, given in CL. */
9222 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9223 const char *file
, int line
, const char *function
)
9226 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9227 TREE_CODE_CLASS_STRING (cl
),
9228 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9229 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9233 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9236 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9237 const char *function
, enum omp_clause_code code
)
9239 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9240 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9241 function
, trim_filename (file
), line
);
9245 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9248 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9249 const char *function
, enum omp_clause_code c1
,
9250 enum omp_clause_code c2
)
9253 unsigned length
= 0;
9256 for (c
= c1
; c
<= c2
; ++c
)
9257 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9259 length
+= strlen ("expected ");
9260 buffer
= (char *) alloca (length
);
9263 for (c
= c1
; c
<= c2
; ++c
)
9265 const char *prefix
= length
? " or " : "expected ";
9267 strcpy (buffer
+ length
, prefix
);
9268 length
+= strlen (prefix
);
9269 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9270 length
+= strlen (omp_clause_code_name
[c
]);
9273 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9274 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9275 function
, trim_filename (file
), line
);
9279 #undef DEFTREESTRUCT
9280 #define DEFTREESTRUCT(VAL, NAME) NAME,
9282 static const char *ts_enum_names
[] = {
9283 #include "treestruct.def"
9285 #undef DEFTREESTRUCT
9287 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9289 /* Similar to tree_class_check_failed, except that we check for
9290 whether CODE contains the tree structure identified by EN. */
9293 tree_contains_struct_check_failed (const_tree node
,
9294 const enum tree_node_structure_enum en
,
9295 const char *file
, int line
,
9296 const char *function
)
9299 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9301 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9305 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9306 (dynamically sized) vector. */
9309 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9310 const char *function
)
9313 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9314 idx
+ 1, len
, function
, trim_filename (file
), line
);
9317 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9318 (dynamically sized) vector. */
9321 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9322 const char *function
)
9325 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9326 idx
+ 1, len
, function
, trim_filename (file
), line
);
9329 /* Similar to above, except that the check is for the bounds of the operand
9330 vector of an expression node EXP. */
9333 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9334 int line
, const char *function
)
9336 enum tree_code code
= TREE_CODE (exp
);
9338 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9339 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9340 function
, trim_filename (file
), line
);
9343 /* Similar to above, except that the check is for the number of
9344 operands of an OMP_CLAUSE node. */
9347 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9348 int line
, const char *function
)
9351 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9352 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9353 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9354 trim_filename (file
), line
);
9356 #endif /* ENABLE_TREE_CHECKING */
9358 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9359 and mapped to the machine mode MODE. Initialize its fields and build
9360 the information necessary for debugging output. */
9363 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9366 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9368 t
= make_node (VECTOR_TYPE
);
9369 TREE_TYPE (t
) = mv_innertype
;
9370 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9371 SET_TYPE_MODE (t
, mode
);
9373 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9374 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9375 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9376 || mode
!= VOIDmode
)
9377 && !VECTOR_BOOLEAN_TYPE_P (t
))
9379 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9383 hashval_t hash
= type_hash_canon_hash (t
);
9384 t
= type_hash_canon (hash
, t
);
9386 /* We have built a main variant, based on the main variant of the
9387 inner type. Use it to build the variant we return. */
9388 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9389 && TREE_TYPE (t
) != innertype
)
9390 return build_type_attribute_qual_variant (t
,
9391 TYPE_ATTRIBUTES (innertype
),
9392 TYPE_QUALS (innertype
));
9398 make_or_reuse_type (unsigned size
, int unsignedp
)
9402 if (size
== INT_TYPE_SIZE
)
9403 return unsignedp
? unsigned_type_node
: integer_type_node
;
9404 if (size
== CHAR_TYPE_SIZE
)
9405 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9406 if (size
== SHORT_TYPE_SIZE
)
9407 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9408 if (size
== LONG_TYPE_SIZE
)
9409 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9410 if (size
== LONG_LONG_TYPE_SIZE
)
9411 return (unsignedp
? long_long_unsigned_type_node
9412 : long_long_integer_type_node
);
9414 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9415 if (size
== int_n_data
[i
].bitsize
9416 && int_n_enabled_p
[i
])
9417 return (unsignedp
? int_n_trees
[i
].unsigned_type
9418 : int_n_trees
[i
].signed_type
);
9421 return make_unsigned_type (size
);
9423 return make_signed_type (size
);
9426 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9429 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9433 if (size
== SHORT_FRACT_TYPE_SIZE
)
9434 return unsignedp
? sat_unsigned_short_fract_type_node
9435 : sat_short_fract_type_node
;
9436 if (size
== FRACT_TYPE_SIZE
)
9437 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9438 if (size
== LONG_FRACT_TYPE_SIZE
)
9439 return unsignedp
? sat_unsigned_long_fract_type_node
9440 : sat_long_fract_type_node
;
9441 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9442 return unsignedp
? sat_unsigned_long_long_fract_type_node
9443 : sat_long_long_fract_type_node
;
9447 if (size
== SHORT_FRACT_TYPE_SIZE
)
9448 return unsignedp
? unsigned_short_fract_type_node
9449 : short_fract_type_node
;
9450 if (size
== FRACT_TYPE_SIZE
)
9451 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9452 if (size
== LONG_FRACT_TYPE_SIZE
)
9453 return unsignedp
? unsigned_long_fract_type_node
9454 : long_fract_type_node
;
9455 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9456 return unsignedp
? unsigned_long_long_fract_type_node
9457 : long_long_fract_type_node
;
9460 return make_fract_type (size
, unsignedp
, satp
);
9463 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9466 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9470 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9471 return unsignedp
? sat_unsigned_short_accum_type_node
9472 : sat_short_accum_type_node
;
9473 if (size
== ACCUM_TYPE_SIZE
)
9474 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9475 if (size
== LONG_ACCUM_TYPE_SIZE
)
9476 return unsignedp
? sat_unsigned_long_accum_type_node
9477 : sat_long_accum_type_node
;
9478 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9479 return unsignedp
? sat_unsigned_long_long_accum_type_node
9480 : sat_long_long_accum_type_node
;
9484 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9485 return unsignedp
? unsigned_short_accum_type_node
9486 : short_accum_type_node
;
9487 if (size
== ACCUM_TYPE_SIZE
)
9488 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9489 if (size
== LONG_ACCUM_TYPE_SIZE
)
9490 return unsignedp
? unsigned_long_accum_type_node
9491 : long_accum_type_node
;
9492 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9493 return unsignedp
? unsigned_long_long_accum_type_node
9494 : long_long_accum_type_node
;
9497 return make_accum_type (size
, unsignedp
, satp
);
9501 /* Create an atomic variant node for TYPE. This routine is called
9502 during initialization of data types to create the 5 basic atomic
9503 types. The generic build_variant_type function requires these to
9504 already be set up in order to function properly, so cannot be
9505 called from there. If ALIGN is non-zero, then ensure alignment is
9506 overridden to this value. */
9509 build_atomic_base (tree type
, unsigned int align
)
9513 /* Make sure its not already registered. */
9514 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9517 t
= build_variant_type_copy (type
);
9518 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9521 SET_TYPE_ALIGN (t
, align
);
9526 /* Information about the _FloatN and _FloatNx types. This must be in
9527 the same order as the corresponding TI_* enum values. */
9528 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9540 /* Create nodes for all integer types (and error_mark_node) using the sizes
9541 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9544 build_common_tree_nodes (bool signed_char
)
9548 error_mark_node
= make_node (ERROR_MARK
);
9549 TREE_TYPE (error_mark_node
) = error_mark_node
;
9551 initialize_sizetypes ();
9553 /* Define both `signed char' and `unsigned char'. */
9554 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9555 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9556 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9557 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9559 /* Define `char', which is like either `signed char' or `unsigned char'
9560 but not the same as either. */
9563 ? make_signed_type (CHAR_TYPE_SIZE
)
9564 : make_unsigned_type (CHAR_TYPE_SIZE
));
9565 TYPE_STRING_FLAG (char_type_node
) = 1;
9567 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9568 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9569 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9570 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9571 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9572 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9573 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9574 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9576 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9578 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9579 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9580 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9581 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9583 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9584 && int_n_enabled_p
[i
])
9586 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9587 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9591 /* Define a boolean type. This type only represents boolean values but
9592 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9593 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9594 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9595 TYPE_PRECISION (boolean_type_node
) = 1;
9596 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9598 /* Define what type to use for size_t. */
9599 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9600 size_type_node
= unsigned_type_node
;
9601 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9602 size_type_node
= long_unsigned_type_node
;
9603 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9604 size_type_node
= long_long_unsigned_type_node
;
9605 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9606 size_type_node
= short_unsigned_type_node
;
9611 size_type_node
= NULL_TREE
;
9612 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9613 if (int_n_enabled_p
[i
])
9616 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9618 if (strcmp (name
, SIZE_TYPE
) == 0)
9620 size_type_node
= int_n_trees
[i
].unsigned_type
;
9623 if (size_type_node
== NULL_TREE
)
9627 /* Define what type to use for ptrdiff_t. */
9628 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9629 ptrdiff_type_node
= integer_type_node
;
9630 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9631 ptrdiff_type_node
= long_integer_type_node
;
9632 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9633 ptrdiff_type_node
= long_long_integer_type_node
;
9634 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9635 ptrdiff_type_node
= short_integer_type_node
;
9638 ptrdiff_type_node
= NULL_TREE
;
9639 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9640 if (int_n_enabled_p
[i
])
9643 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9644 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9645 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9647 if (ptrdiff_type_node
== NULL_TREE
)
9651 /* Fill in the rest of the sized types. Reuse existing type nodes
9653 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9654 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9655 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9656 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9657 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9659 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9660 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9661 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9662 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9663 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9665 /* Don't call build_qualified type for atomics. That routine does
9666 special processing for atomics, and until they are initialized
9667 it's better not to make that call.
9669 Check to see if there is a target override for atomic types. */
9671 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9672 targetm
.atomic_align_for_mode (QImode
));
9673 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9674 targetm
.atomic_align_for_mode (HImode
));
9675 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9676 targetm
.atomic_align_for_mode (SImode
));
9677 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9678 targetm
.atomic_align_for_mode (DImode
));
9679 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9680 targetm
.atomic_align_for_mode (TImode
));
9682 access_public_node
= get_identifier ("public");
9683 access_protected_node
= get_identifier ("protected");
9684 access_private_node
= get_identifier ("private");
9686 /* Define these next since types below may used them. */
9687 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9688 integer_one_node
= build_int_cst (integer_type_node
, 1);
9689 integer_three_node
= build_int_cst (integer_type_node
, 3);
9690 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9692 size_zero_node
= size_int (0);
9693 size_one_node
= size_int (1);
9694 bitsize_zero_node
= bitsize_int (0);
9695 bitsize_one_node
= bitsize_int (1);
9696 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9698 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9699 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9701 void_type_node
= make_node (VOID_TYPE
);
9702 layout_type (void_type_node
);
9704 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9706 /* We are not going to have real types in C with less than byte alignment,
9707 so we might as well not have any types that claim to have it. */
9708 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9709 TYPE_USER_ALIGN (void_type_node
) = 0;
9711 void_node
= make_node (VOID_CST
);
9712 TREE_TYPE (void_node
) = void_type_node
;
9714 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9715 layout_type (TREE_TYPE (null_pointer_node
));
9717 ptr_type_node
= build_pointer_type (void_type_node
);
9719 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9720 for (unsigned i
= 0;
9721 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9723 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9725 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9727 float_type_node
= make_node (REAL_TYPE
);
9728 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9729 layout_type (float_type_node
);
9731 double_type_node
= make_node (REAL_TYPE
);
9732 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9733 layout_type (double_type_node
);
9735 long_double_type_node
= make_node (REAL_TYPE
);
9736 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9737 layout_type (long_double_type_node
);
9739 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9741 int n
= floatn_nx_types
[i
].n
;
9742 bool extended
= floatn_nx_types
[i
].extended
;
9743 scalar_float_mode mode
;
9744 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9746 int precision
= GET_MODE_PRECISION (mode
);
9747 /* Work around the rs6000 KFmode having precision 113 not
9749 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9750 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9751 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9753 gcc_assert (min_precision
== n
);
9754 if (precision
< min_precision
)
9755 precision
= min_precision
;
9756 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9757 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9758 layout_type (FLOATN_NX_TYPE_NODE (i
));
9759 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
9762 float_ptr_type_node
= build_pointer_type (float_type_node
);
9763 double_ptr_type_node
= build_pointer_type (double_type_node
);
9764 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9765 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9767 /* Fixed size integer types. */
9768 uint16_type_node
= make_or_reuse_type (16, 1);
9769 uint32_type_node
= make_or_reuse_type (32, 1);
9770 uint64_type_node
= make_or_reuse_type (64, 1);
9772 /* Decimal float types. */
9773 dfloat32_type_node
= make_node (REAL_TYPE
);
9774 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9775 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9776 layout_type (dfloat32_type_node
);
9777 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9779 dfloat64_type_node
= make_node (REAL_TYPE
);
9780 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9781 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9782 layout_type (dfloat64_type_node
);
9783 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9785 dfloat128_type_node
= make_node (REAL_TYPE
);
9786 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9787 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9788 layout_type (dfloat128_type_node
);
9789 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9791 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
9792 complex_float_type_node
= build_complex_type (float_type_node
, true);
9793 complex_double_type_node
= build_complex_type (double_type_node
, true);
9794 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
9797 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9799 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
9800 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
9801 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
9804 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9805 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9806 sat_ ## KIND ## _type_node = \
9807 make_sat_signed_ ## KIND ## _type (SIZE); \
9808 sat_unsigned_ ## KIND ## _type_node = \
9809 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9810 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9811 unsigned_ ## KIND ## _type_node = \
9812 make_unsigned_ ## KIND ## _type (SIZE);
9814 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9815 sat_ ## WIDTH ## KIND ## _type_node = \
9816 make_sat_signed_ ## KIND ## _type (SIZE); \
9817 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9818 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9819 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9820 unsigned_ ## WIDTH ## KIND ## _type_node = \
9821 make_unsigned_ ## KIND ## _type (SIZE);
9823 /* Make fixed-point type nodes based on four different widths. */
9824 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9825 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9826 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9827 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9828 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9830 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9831 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9832 NAME ## _type_node = \
9833 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9834 u ## NAME ## _type_node = \
9835 make_or_reuse_unsigned_ ## KIND ## _type \
9836 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9837 sat_ ## NAME ## _type_node = \
9838 make_or_reuse_sat_signed_ ## KIND ## _type \
9839 (GET_MODE_BITSIZE (MODE ## mode)); \
9840 sat_u ## NAME ## _type_node = \
9841 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9842 (GET_MODE_BITSIZE (U ## MODE ## mode));
9844 /* Fixed-point type and mode nodes. */
9845 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9846 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9847 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9848 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9849 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9850 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9851 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9852 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9853 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9854 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9855 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9858 tree t
= targetm
.build_builtin_va_list ();
9860 /* Many back-ends define record types without setting TYPE_NAME.
9861 If we copied the record type here, we'd keep the original
9862 record type without a name. This breaks name mangling. So,
9863 don't copy record types and let c_common_nodes_and_builtins()
9864 declare the type to be __builtin_va_list. */
9865 if (TREE_CODE (t
) != RECORD_TYPE
)
9866 t
= build_variant_type_copy (t
);
9868 va_list_type_node
= t
;
9872 /* Modify DECL for given flags.
9873 TM_PURE attribute is set only on types, so the function will modify
9874 DECL's type when ECF_TM_PURE is used. */
9877 set_call_expr_flags (tree decl
, int flags
)
9879 if (flags
& ECF_NOTHROW
)
9880 TREE_NOTHROW (decl
) = 1;
9881 if (flags
& ECF_CONST
)
9882 TREE_READONLY (decl
) = 1;
9883 if (flags
& ECF_PURE
)
9884 DECL_PURE_P (decl
) = 1;
9885 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9886 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9887 if (flags
& ECF_NOVOPS
)
9888 DECL_IS_NOVOPS (decl
) = 1;
9889 if (flags
& ECF_NORETURN
)
9890 TREE_THIS_VOLATILE (decl
) = 1;
9891 if (flags
& ECF_MALLOC
)
9892 DECL_IS_MALLOC (decl
) = 1;
9893 if (flags
& ECF_RETURNS_TWICE
)
9894 DECL_IS_RETURNS_TWICE (decl
) = 1;
9895 if (flags
& ECF_LEAF
)
9896 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9897 NULL
, DECL_ATTRIBUTES (decl
));
9898 if (flags
& ECF_COLD
)
9899 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
9900 NULL
, DECL_ATTRIBUTES (decl
));
9901 if (flags
& ECF_RET1
)
9902 DECL_ATTRIBUTES (decl
)
9903 = tree_cons (get_identifier ("fn spec"),
9904 build_tree_list (NULL_TREE
, build_string (1, "1")),
9905 DECL_ATTRIBUTES (decl
));
9906 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9907 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9908 /* Looping const or pure is implied by noreturn.
9909 There is currently no way to declare looping const or looping pure alone. */
9910 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9911 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9915 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9918 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9919 const char *library_name
, int ecf_flags
)
9923 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9924 library_name
, NULL_TREE
);
9925 set_call_expr_flags (decl
, ecf_flags
);
9927 set_builtin_decl (code
, decl
, true);
9930 /* Call this function after instantiating all builtins that the language
9931 front end cares about. This will build the rest of the builtins
9932 and internal functions that are relied upon by the tree optimizers and
9936 build_common_builtin_nodes (void)
9941 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
9942 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
9944 ftype
= build_function_type (void_type_node
, void_list_node
);
9945 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9946 local_define_builtin ("__builtin_unreachable", ftype
,
9947 BUILT_IN_UNREACHABLE
,
9948 "__builtin_unreachable",
9949 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9950 | ECF_CONST
| ECF_COLD
);
9951 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
9952 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
9954 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
9957 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9958 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9960 ftype
= build_function_type_list (ptr_type_node
,
9961 ptr_type_node
, const_ptr_type_node
,
9962 size_type_node
, NULL_TREE
);
9964 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9965 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9966 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9967 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9968 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9969 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9972 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9974 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9975 const_ptr_type_node
, size_type_node
,
9977 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9978 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9981 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9983 ftype
= build_function_type_list (ptr_type_node
,
9984 ptr_type_node
, integer_type_node
,
9985 size_type_node
, NULL_TREE
);
9986 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9987 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9990 /* If we're checking the stack, `alloca' can throw. */
9991 const int alloca_flags
9992 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
9994 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9996 ftype
= build_function_type_list (ptr_type_node
,
9997 size_type_node
, NULL_TREE
);
9998 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9999 "alloca", alloca_flags
);
10002 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10003 size_type_node
, NULL_TREE
);
10004 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10005 BUILT_IN_ALLOCA_WITH_ALIGN
,
10006 "__builtin_alloca_with_align",
10009 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10010 size_type_node
, size_type_node
, NULL_TREE
);
10011 local_define_builtin ("__builtin_alloca_with_align_and_max", ftype
,
10012 BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
,
10013 "__builtin_alloca_with_align_and_max",
10016 ftype
= build_function_type_list (void_type_node
,
10017 ptr_type_node
, ptr_type_node
,
10018 ptr_type_node
, NULL_TREE
);
10019 local_define_builtin ("__builtin_init_trampoline", ftype
,
10020 BUILT_IN_INIT_TRAMPOLINE
,
10021 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10022 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10023 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10024 "__builtin_init_heap_trampoline",
10025 ECF_NOTHROW
| ECF_LEAF
);
10026 local_define_builtin ("__builtin_init_descriptor", ftype
,
10027 BUILT_IN_INIT_DESCRIPTOR
,
10028 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10030 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10031 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10032 BUILT_IN_ADJUST_TRAMPOLINE
,
10033 "__builtin_adjust_trampoline",
10034 ECF_CONST
| ECF_NOTHROW
);
10035 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10036 BUILT_IN_ADJUST_DESCRIPTOR
,
10037 "__builtin_adjust_descriptor",
10038 ECF_CONST
| ECF_NOTHROW
);
10040 ftype
= build_function_type_list (void_type_node
,
10041 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10042 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10043 BUILT_IN_NONLOCAL_GOTO
,
10044 "__builtin_nonlocal_goto",
10045 ECF_NORETURN
| ECF_NOTHROW
);
10047 ftype
= build_function_type_list (void_type_node
,
10048 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10049 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10050 BUILT_IN_SETJMP_SETUP
,
10051 "__builtin_setjmp_setup", ECF_NOTHROW
);
10053 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10054 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10055 BUILT_IN_SETJMP_RECEIVER
,
10056 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10058 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10059 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10060 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10062 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10063 local_define_builtin ("__builtin_stack_restore", ftype
,
10064 BUILT_IN_STACK_RESTORE
,
10065 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10067 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10068 const_ptr_type_node
, size_type_node
,
10070 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10071 "__builtin_memcmp_eq",
10072 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10074 /* If there's a possibility that we might use the ARM EABI, build the
10075 alternate __cxa_end_cleanup node used to resume from C++. */
10076 if (targetm
.arm_eabi_unwinder
)
10078 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10079 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10080 BUILT_IN_CXA_END_CLEANUP
,
10081 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10084 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10085 local_define_builtin ("__builtin_unwind_resume", ftype
,
10086 BUILT_IN_UNWIND_RESUME
,
10087 ((targetm_common
.except_unwind_info (&global_options
)
10089 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10092 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10094 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10096 local_define_builtin ("__builtin_return_address", ftype
,
10097 BUILT_IN_RETURN_ADDRESS
,
10098 "__builtin_return_address",
10102 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10103 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10105 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10106 ptr_type_node
, NULL_TREE
);
10107 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10108 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10109 BUILT_IN_PROFILE_FUNC_ENTER
,
10110 "__cyg_profile_func_enter", 0);
10111 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10112 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10113 BUILT_IN_PROFILE_FUNC_EXIT
,
10114 "__cyg_profile_func_exit", 0);
10117 /* The exception object and filter values from the runtime. The argument
10118 must be zero before exception lowering, i.e. from the front end. After
10119 exception lowering, it will be the region number for the exception
10120 landing pad. These functions are PURE instead of CONST to prevent
10121 them from being hoisted past the exception edge that will initialize
10122 its value in the landing pad. */
10123 ftype
= build_function_type_list (ptr_type_node
,
10124 integer_type_node
, NULL_TREE
);
10125 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10126 /* Only use TM_PURE if we have TM language support. */
10127 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10128 ecf_flags
|= ECF_TM_PURE
;
10129 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10130 "__builtin_eh_pointer", ecf_flags
);
10132 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10133 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10134 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10135 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10137 ftype
= build_function_type_list (void_type_node
,
10138 integer_type_node
, integer_type_node
,
10140 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10141 BUILT_IN_EH_COPY_VALUES
,
10142 "__builtin_eh_copy_values", ECF_NOTHROW
);
10144 /* Complex multiplication and division. These are handled as builtins
10145 rather than optabs because emit_library_call_value doesn't support
10146 complex. Further, we can do slightly better with folding these
10147 beasties if the real and complex parts of the arguments are separate. */
10151 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10153 char mode_name_buf
[4], *q
;
10155 enum built_in_function mcode
, dcode
;
10156 tree type
, inner_type
;
10157 const char *prefix
= "__";
10159 if (targetm
.libfunc_gnu_prefix
)
10162 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10165 inner_type
= TREE_TYPE (type
);
10167 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10168 inner_type
, inner_type
, NULL_TREE
);
10170 mcode
= ((enum built_in_function
)
10171 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10172 dcode
= ((enum built_in_function
)
10173 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10175 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10179 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10181 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10182 built_in_names
[mcode
],
10183 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10185 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10187 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10188 built_in_names
[dcode
],
10189 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10193 init_internal_fns ();
10196 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10199 If we requested a pointer to a vector, build up the pointers that
10200 we stripped off while looking for the inner type. Similarly for
10201 return values from functions.
10203 The argument TYPE is the top of the chain, and BOTTOM is the
10204 new type which we will point to. */
10207 reconstruct_complex_type (tree type
, tree bottom
)
10211 if (TREE_CODE (type
) == POINTER_TYPE
)
10213 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10214 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10215 TYPE_REF_CAN_ALIAS_ALL (type
));
10217 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10219 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10220 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10221 TYPE_REF_CAN_ALIAS_ALL (type
));
10223 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10225 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10226 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10228 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10230 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10231 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10233 else if (TREE_CODE (type
) == METHOD_TYPE
)
10235 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10236 /* The build_method_type_directly() routine prepends 'this' to argument list,
10237 so we must compensate by getting rid of it. */
10239 = build_method_type_directly
10240 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10242 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10244 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10246 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10247 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10252 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10253 TYPE_QUALS (type
));
10256 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10259 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10262 unsigned int bitsize
;
10264 switch (GET_MODE_CLASS (mode
))
10266 case MODE_VECTOR_INT
:
10267 case MODE_VECTOR_FLOAT
:
10268 case MODE_VECTOR_FRACT
:
10269 case MODE_VECTOR_UFRACT
:
10270 case MODE_VECTOR_ACCUM
:
10271 case MODE_VECTOR_UACCUM
:
10272 nunits
= GET_MODE_NUNITS (mode
);
10276 /* Check that there are no leftover bits. */
10277 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10278 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10279 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10283 gcc_unreachable ();
10286 return make_vector_type (innertype
, nunits
, mode
);
10289 /* Similarly, but takes the inner type and number of units, which must be
10293 build_vector_type (tree innertype
, int nunits
)
10295 return make_vector_type (innertype
, nunits
, VOIDmode
);
10298 /* Build truth vector with specified length and number of units. */
10301 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10303 machine_mode mask_mode
10304 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10306 unsigned HOST_WIDE_INT vsize
;
10307 if (mask_mode
== BLKmode
)
10308 vsize
= vector_size
* BITS_PER_UNIT
;
10310 vsize
= GET_MODE_BITSIZE (mask_mode
);
10312 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10313 gcc_assert (esize
* nunits
== vsize
);
10315 tree bool_type
= build_nonstandard_boolean_type (esize
);
10317 return make_vector_type (bool_type
, nunits
, mask_mode
);
10320 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10323 build_same_sized_truth_vector_type (tree vectype
)
10325 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10328 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10331 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10333 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10336 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10339 build_opaque_vector_type (tree innertype
, int nunits
)
10341 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10343 /* We always build the non-opaque variant before the opaque one,
10344 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10345 cand
= TYPE_NEXT_VARIANT (t
);
10347 && TYPE_VECTOR_OPAQUE (cand
)
10348 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10350 /* Othewise build a variant type and make sure to queue it after
10351 the non-opaque type. */
10352 cand
= build_distinct_type_copy (t
);
10353 TYPE_VECTOR_OPAQUE (cand
) = true;
10354 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10355 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10356 TYPE_NEXT_VARIANT (t
) = cand
;
10357 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10361 /* Return the value of element I of VECTOR_CST T as a wide_int. */
10364 vector_cst_int_elt (const_tree t
, unsigned int i
)
10366 /* First handle elements that are directly encoded. */
10367 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10368 if (i
< encoded_nelts
)
10369 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, i
));
10371 /* Identify the pattern that contains element I and work out the index of
10372 the last encoded element for that pattern. */
10373 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10374 unsigned int pattern
= i
% npatterns
;
10375 unsigned int count
= i
/ npatterns
;
10376 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10378 /* If there are no steps, the final encoded value is the right one. */
10379 if (!VECTOR_CST_STEPPED_P (t
))
10380 return wi::to_wide (VECTOR_CST_ENCODED_ELT (t
, final_i
));
10382 /* Otherwise work out the value from the last two encoded elements. */
10383 tree v1
= VECTOR_CST_ENCODED_ELT (t
, final_i
- npatterns
);
10384 tree v2
= VECTOR_CST_ENCODED_ELT (t
, final_i
);
10385 wide_int diff
= wi::to_wide (v2
) - wi::to_wide (v1
);
10386 return wi::to_wide (v2
) + (count
- 2) * diff
;
10389 /* Return the value of element I of VECTOR_CST T. */
10392 vector_cst_elt (const_tree t
, unsigned int i
)
10394 /* First handle elements that are directly encoded. */
10395 unsigned int encoded_nelts
= vector_cst_encoded_nelts (t
);
10396 if (i
< encoded_nelts
)
10397 return VECTOR_CST_ENCODED_ELT (t
, i
);
10399 /* If there are no steps, the final encoded value is the right one. */
10400 if (!VECTOR_CST_STEPPED_P (t
))
10402 /* Identify the pattern that contains element I and work out the index of
10403 the last encoded element for that pattern. */
10404 unsigned int npatterns
= VECTOR_CST_NPATTERNS (t
);
10405 unsigned int pattern
= i
% npatterns
;
10406 unsigned int final_i
= encoded_nelts
- npatterns
+ pattern
;
10407 return VECTOR_CST_ENCODED_ELT (t
, final_i
);
10410 /* Otherwise work out the value from the last two encoded elements. */
10411 return wide_int_to_tree (TREE_TYPE (TREE_TYPE (t
)),
10412 vector_cst_int_elt (t
, i
));
10415 /* Given an initializer INIT, return TRUE if INIT is zero or some
10416 aggregate of zeros. Otherwise return FALSE. */
10418 initializer_zerop (const_tree init
)
10424 switch (TREE_CODE (init
))
10427 return integer_zerop (init
);
10430 /* ??? Note that this is not correct for C4X float formats. There,
10431 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10432 negative exponent. */
10433 return real_zerop (init
)
10434 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10437 return fixed_zerop (init
);
10440 return integer_zerop (init
)
10441 || (real_zerop (init
)
10442 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10443 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10448 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10449 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10456 unsigned HOST_WIDE_INT idx
;
10458 if (TREE_CLOBBER_P (init
))
10460 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10461 if (!initializer_zerop (elt
))
10470 /* We need to loop through all elements to handle cases like
10471 "\0" and "\0foobar". */
10472 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10473 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10484 /* Check if vector VEC consists of all the equal elements and
10485 that the number of elements corresponds to the type of VEC.
10486 The function returns first element of the vector
10487 or NULL_TREE if the vector is not uniform. */
10489 uniform_vector_p (const_tree vec
)
10494 if (vec
== NULL_TREE
)
10497 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10499 if (TREE_CODE (vec
) == VECTOR_CST
)
10501 first
= VECTOR_CST_ELT (vec
, 0);
10502 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10503 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10509 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10511 first
= error_mark_node
;
10513 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10520 if (!operand_equal_p (first
, t
, 0))
10523 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10532 /* Build an empty statement at location LOC. */
10535 build_empty_stmt (location_t loc
)
10537 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10538 SET_EXPR_LOCATION (t
, loc
);
10543 /* Build an OpenMP clause with code CODE. LOC is the location of the
10547 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10552 length
= omp_clause_num_ops
[code
];
10553 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10555 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10557 t
= (tree
) ggc_internal_alloc (size
);
10558 memset (t
, 0, size
);
10559 TREE_SET_CODE (t
, OMP_CLAUSE
);
10560 OMP_CLAUSE_SET_CODE (t
, code
);
10561 OMP_CLAUSE_LOCATION (t
) = loc
;
10566 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10567 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10568 Except for the CODE and operand count field, other storage for the
10569 object is initialized to zeros. */
10572 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10575 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10577 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10578 gcc_assert (len
>= 1);
10580 record_node_allocation_statistics (code
, length
);
10582 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10584 TREE_SET_CODE (t
, code
);
10586 /* Can't use TREE_OPERAND to store the length because if checking is
10587 enabled, it will try to check the length before we store it. :-P */
10588 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10593 /* Helper function for build_call_* functions; build a CALL_EXPR with
10594 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10595 the argument slots. */
10598 build_call_1 (tree return_type
, tree fn
, int nargs
)
10602 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10603 TREE_TYPE (t
) = return_type
;
10604 CALL_EXPR_FN (t
) = fn
;
10605 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10610 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10611 FN and a null static chain slot. NARGS is the number of call arguments
10612 which are specified as "..." arguments. */
10615 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10619 va_start (args
, nargs
);
10620 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10625 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10626 FN and a null static chain slot. NARGS is the number of call arguments
10627 which are specified as a va_list ARGS. */
10630 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10635 t
= build_call_1 (return_type
, fn
, nargs
);
10636 for (i
= 0; i
< nargs
; i
++)
10637 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10638 process_call_operands (t
);
10642 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10643 FN and a null static chain slot. NARGS is the number of call arguments
10644 which are specified as a tree array ARGS. */
10647 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10648 int nargs
, const tree
*args
)
10653 t
= build_call_1 (return_type
, fn
, nargs
);
10654 for (i
= 0; i
< nargs
; i
++)
10655 CALL_EXPR_ARG (t
, i
) = args
[i
];
10656 process_call_operands (t
);
10657 SET_EXPR_LOCATION (t
, loc
);
10661 /* Like build_call_array, but takes a vec. */
10664 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10669 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10670 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10671 CALL_EXPR_ARG (ret
, ix
) = t
;
10672 process_call_operands (ret
);
10676 /* Conveniently construct a function call expression. FNDECL names the
10677 function to be called and N arguments are passed in the array
10681 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10683 tree fntype
= TREE_TYPE (fndecl
);
10684 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10686 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10689 /* Conveniently construct a function call expression. FNDECL names the
10690 function to be called and the arguments are passed in the vector
10694 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10696 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10697 vec_safe_address (vec
));
10701 /* Conveniently construct a function call expression. FNDECL names the
10702 function to be called, N is the number of arguments, and the "..."
10703 parameters are the argument expressions. */
10706 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10709 tree
*argarray
= XALLOCAVEC (tree
, n
);
10713 for (i
= 0; i
< n
; i
++)
10714 argarray
[i
] = va_arg (ap
, tree
);
10716 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10719 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10720 varargs macros aren't supported by all bootstrap compilers. */
10723 build_call_expr (tree fndecl
, int n
, ...)
10726 tree
*argarray
= XALLOCAVEC (tree
, n
);
10730 for (i
= 0; i
< n
; i
++)
10731 argarray
[i
] = va_arg (ap
, tree
);
10733 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10736 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10737 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10738 It will get gimplified later into an ordinary internal function. */
10741 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10742 tree type
, int n
, const tree
*args
)
10744 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10745 for (int i
= 0; i
< n
; ++i
)
10746 CALL_EXPR_ARG (t
, i
) = args
[i
];
10747 SET_EXPR_LOCATION (t
, loc
);
10748 CALL_EXPR_IFN (t
) = ifn
;
10752 /* Build internal call expression. This is just like CALL_EXPR, except
10753 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10754 internal function. */
10757 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10758 tree type
, int n
, ...)
10761 tree
*argarray
= XALLOCAVEC (tree
, n
);
10765 for (i
= 0; i
< n
; i
++)
10766 argarray
[i
] = va_arg (ap
, tree
);
10768 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10771 /* Return a function call to FN, if the target is guaranteed to support it,
10774 N is the number of arguments, passed in the "...", and TYPE is the
10775 type of the return value. */
10778 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
10782 tree
*argarray
= XALLOCAVEC (tree
, n
);
10786 for (i
= 0; i
< n
; i
++)
10787 argarray
[i
] = va_arg (ap
, tree
);
10789 if (internal_fn_p (fn
))
10791 internal_fn ifn
= as_internal_fn (fn
);
10792 if (direct_internal_fn_p (ifn
))
10794 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
10795 if (!direct_internal_fn_supported_p (ifn
, types
,
10796 OPTIMIZE_FOR_BOTH
))
10799 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10803 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
10806 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10810 /* Return a function call to the appropriate builtin alloca variant.
10812 SIZE is the size to be allocated. ALIGN, if non-zero, is the requested
10813 alignment of the allocated area. MAX_SIZE, if non-negative, is an upper
10814 bound for SIZE in case it is not a fixed value. */
10817 build_alloca_call_expr (tree size
, unsigned int align
, HOST_WIDE_INT max_size
)
10821 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN_AND_MAX
);
10823 build_call_expr (t
, 3, size
, size_int (align
), size_int (max_size
));
10825 else if (align
> 0)
10827 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA_WITH_ALIGN
);
10828 return build_call_expr (t
, 2, size
, size_int (align
));
10832 tree t
= builtin_decl_explicit (BUILT_IN_ALLOCA
);
10833 return build_call_expr (t
, 1, size
);
10837 /* Create a new constant string literal and return a char* pointer to it.
10838 The STRING_CST value is the LEN characters at STR. */
10840 build_string_literal (int len
, const char *str
)
10842 tree t
, elem
, index
, type
;
10844 t
= build_string (len
, str
);
10845 elem
= build_type_variant (char_type_node
, 1, 0);
10846 index
= build_index_type (size_int (len
- 1));
10847 type
= build_array_type (elem
, index
);
10848 TREE_TYPE (t
) = type
;
10849 TREE_CONSTANT (t
) = 1;
10850 TREE_READONLY (t
) = 1;
10851 TREE_STATIC (t
) = 1;
10853 type
= build_pointer_type (elem
);
10854 t
= build1 (ADDR_EXPR
, type
,
10855 build4 (ARRAY_REF
, elem
,
10856 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10862 /* Return true if T (assumed to be a DECL) must be assigned a memory
10866 needs_to_live_in_memory (const_tree t
)
10868 return (TREE_ADDRESSABLE (t
)
10869 || is_global_var (t
)
10870 || (TREE_CODE (t
) == RESULT_DECL
10871 && !DECL_BY_REFERENCE (t
)
10872 && aggregate_value_p (t
, current_function_decl
)));
10875 /* Return value of a constant X and sign-extend it. */
10878 int_cst_value (const_tree x
)
10880 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10881 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10883 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10884 gcc_assert (cst_and_fits_in_hwi (x
));
10886 if (bits
< HOST_BITS_PER_WIDE_INT
)
10888 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10890 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
10892 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
10898 /* If TYPE is an integral or pointer type, return an integer type with
10899 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10900 if TYPE is already an integer type of signedness UNSIGNEDP. */
10903 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10905 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10908 if (TREE_CODE (type
) == VECTOR_TYPE
)
10910 tree inner
= TREE_TYPE (type
);
10911 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10914 if (inner
== inner2
)
10916 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10919 if (!INTEGRAL_TYPE_P (type
)
10920 && !POINTER_TYPE_P (type
)
10921 && TREE_CODE (type
) != OFFSET_TYPE
)
10924 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10927 /* If TYPE is an integral or pointer type, return an integer type with
10928 the same precision which is unsigned, or itself if TYPE is already an
10929 unsigned integer type. */
10932 unsigned_type_for (tree type
)
10934 return signed_or_unsigned_type_for (1, type
);
10937 /* If TYPE is an integral or pointer type, return an integer type with
10938 the same precision which is signed, or itself if TYPE is already a
10939 signed integer type. */
10942 signed_type_for (tree type
)
10944 return signed_or_unsigned_type_for (0, type
);
10947 /* If TYPE is a vector type, return a signed integer vector type with the
10948 same width and number of subparts. Otherwise return boolean_type_node. */
10951 truth_type_for (tree type
)
10953 if (TREE_CODE (type
) == VECTOR_TYPE
)
10955 if (VECTOR_BOOLEAN_TYPE_P (type
))
10957 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
10958 GET_MODE_SIZE (TYPE_MODE (type
)));
10961 return boolean_type_node
;
10964 /* Returns the largest value obtainable by casting something in INNER type to
10968 upper_bound_in_type (tree outer
, tree inner
)
10970 unsigned int det
= 0;
10971 unsigned oprec
= TYPE_PRECISION (outer
);
10972 unsigned iprec
= TYPE_PRECISION (inner
);
10975 /* Compute a unique number for every combination. */
10976 det
|= (oprec
> iprec
) ? 4 : 0;
10977 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10978 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10980 /* Determine the exponent to use. */
10985 /* oprec <= iprec, outer: signed, inner: don't care. */
10990 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10994 /* oprec > iprec, outer: signed, inner: signed. */
10998 /* oprec > iprec, outer: signed, inner: unsigned. */
11002 /* oprec > iprec, outer: unsigned, inner: signed. */
11006 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11010 gcc_unreachable ();
11013 return wide_int_to_tree (outer
,
11014 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11017 /* Returns the smallest value obtainable by casting something in INNER type to
11021 lower_bound_in_type (tree outer
, tree inner
)
11023 unsigned oprec
= TYPE_PRECISION (outer
);
11024 unsigned iprec
= TYPE_PRECISION (inner
);
11026 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11028 if (TYPE_UNSIGNED (outer
)
11029 /* If we are widening something of an unsigned type, OUTER type
11030 contains all values of INNER type. In particular, both INNER
11031 and OUTER types have zero in common. */
11032 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11033 return build_int_cst (outer
, 0);
11036 /* If we are widening a signed type to another signed type, we
11037 want to obtain -2^^(iprec-1). If we are keeping the
11038 precision or narrowing to a signed type, we want to obtain
11040 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11041 return wide_int_to_tree (outer
,
11042 wi::mask (prec
- 1, true,
11043 TYPE_PRECISION (outer
)));
11047 /* Return nonzero if two operands that are suitable for PHI nodes are
11048 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11049 SSA_NAME or invariant. Note that this is strictly an optimization.
11050 That is, callers of this function can directly call operand_equal_p
11051 and get the same result, only slower. */
11054 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11058 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11060 return operand_equal_p (arg0
, arg1
, 0);
11063 /* Returns number of zeros at the end of binary representation of X. */
11066 num_ending_zeros (const_tree x
)
11068 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
11072 #define WALK_SUBTREE(NODE) \
11075 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11081 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11082 be walked whenever a type is seen in the tree. Rest of operands and return
11083 value are as for walk_tree. */
11086 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11087 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11089 tree result
= NULL_TREE
;
11091 switch (TREE_CODE (type
))
11094 case REFERENCE_TYPE
:
11096 /* We have to worry about mutually recursive pointers. These can't
11097 be written in C. They can in Ada. It's pathological, but
11098 there's an ACATS test (c38102a) that checks it. Deal with this
11099 by checking if we're pointing to another pointer, that one
11100 points to another pointer, that one does too, and we have no htab.
11101 If so, get a hash table. We check three levels deep to avoid
11102 the cost of the hash table if we don't need one. */
11103 if (POINTER_TYPE_P (TREE_TYPE (type
))
11104 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11105 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11108 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11119 WALK_SUBTREE (TREE_TYPE (type
));
11123 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11125 /* Fall through. */
11127 case FUNCTION_TYPE
:
11128 WALK_SUBTREE (TREE_TYPE (type
));
11132 /* We never want to walk into default arguments. */
11133 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11134 WALK_SUBTREE (TREE_VALUE (arg
));
11139 /* Don't follow this nodes's type if a pointer for fear that
11140 we'll have infinite recursion. If we have a PSET, then we
11143 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11144 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11145 WALK_SUBTREE (TREE_TYPE (type
));
11146 WALK_SUBTREE (TYPE_DOMAIN (type
));
11150 WALK_SUBTREE (TREE_TYPE (type
));
11151 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11161 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11162 called with the DATA and the address of each sub-tree. If FUNC returns a
11163 non-NULL value, the traversal is stopped, and the value returned by FUNC
11164 is returned. If PSET is non-NULL it is used to record the nodes visited,
11165 and to avoid visiting a node more than once. */
11168 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11169 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11171 enum tree_code code
;
11175 #define WALK_SUBTREE_TAIL(NODE) \
11179 goto tail_recurse; \
11184 /* Skip empty subtrees. */
11188 /* Don't walk the same tree twice, if the user has requested
11189 that we avoid doing so. */
11190 if (pset
&& pset
->add (*tp
))
11193 /* Call the function. */
11195 result
= (*func
) (tp
, &walk_subtrees
, data
);
11197 /* If we found something, return it. */
11201 code
= TREE_CODE (*tp
);
11203 /* Even if we didn't, FUNC may have decided that there was nothing
11204 interesting below this point in the tree. */
11205 if (!walk_subtrees
)
11207 /* But we still need to check our siblings. */
11208 if (code
== TREE_LIST
)
11209 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11210 else if (code
== OMP_CLAUSE
)
11211 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11218 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11219 if (result
|| !walk_subtrees
)
11226 case IDENTIFIER_NODE
:
11233 case PLACEHOLDER_EXPR
:
11237 /* None of these have subtrees other than those already walked
11242 WALK_SUBTREE (TREE_VALUE (*tp
));
11243 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11248 int len
= TREE_VEC_LENGTH (*tp
);
11253 /* Walk all elements but the first. */
11255 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11257 /* Now walk the first one as a tail call. */
11258 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11262 WALK_SUBTREE (TREE_REALPART (*tp
));
11263 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11267 unsigned HOST_WIDE_INT idx
;
11268 constructor_elt
*ce
;
11270 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11272 WALK_SUBTREE (ce
->value
);
11277 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11282 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11284 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11285 into declarations that are just mentioned, rather than
11286 declared; they don't really belong to this part of the tree.
11287 And, we can see cycles: the initializer for a declaration
11288 can refer to the declaration itself. */
11289 WALK_SUBTREE (DECL_INITIAL (decl
));
11290 WALK_SUBTREE (DECL_SIZE (decl
));
11291 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11293 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11296 case STATEMENT_LIST
:
11298 tree_stmt_iterator i
;
11299 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11300 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11305 switch (OMP_CLAUSE_CODE (*tp
))
11307 case OMP_CLAUSE_GANG
:
11308 case OMP_CLAUSE__GRIDDIM_
:
11309 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11312 case OMP_CLAUSE_ASYNC
:
11313 case OMP_CLAUSE_WAIT
:
11314 case OMP_CLAUSE_WORKER
:
11315 case OMP_CLAUSE_VECTOR
:
11316 case OMP_CLAUSE_NUM_GANGS
:
11317 case OMP_CLAUSE_NUM_WORKERS
:
11318 case OMP_CLAUSE_VECTOR_LENGTH
:
11319 case OMP_CLAUSE_PRIVATE
:
11320 case OMP_CLAUSE_SHARED
:
11321 case OMP_CLAUSE_FIRSTPRIVATE
:
11322 case OMP_CLAUSE_COPYIN
:
11323 case OMP_CLAUSE_COPYPRIVATE
:
11324 case OMP_CLAUSE_FINAL
:
11325 case OMP_CLAUSE_IF
:
11326 case OMP_CLAUSE_NUM_THREADS
:
11327 case OMP_CLAUSE_SCHEDULE
:
11328 case OMP_CLAUSE_UNIFORM
:
11329 case OMP_CLAUSE_DEPEND
:
11330 case OMP_CLAUSE_NUM_TEAMS
:
11331 case OMP_CLAUSE_THREAD_LIMIT
:
11332 case OMP_CLAUSE_DEVICE
:
11333 case OMP_CLAUSE_DIST_SCHEDULE
:
11334 case OMP_CLAUSE_SAFELEN
:
11335 case OMP_CLAUSE_SIMDLEN
:
11336 case OMP_CLAUSE_ORDERED
:
11337 case OMP_CLAUSE_PRIORITY
:
11338 case OMP_CLAUSE_GRAINSIZE
:
11339 case OMP_CLAUSE_NUM_TASKS
:
11340 case OMP_CLAUSE_HINT
:
11341 case OMP_CLAUSE_TO_DECLARE
:
11342 case OMP_CLAUSE_LINK
:
11343 case OMP_CLAUSE_USE_DEVICE_PTR
:
11344 case OMP_CLAUSE_IS_DEVICE_PTR
:
11345 case OMP_CLAUSE__LOOPTEMP_
:
11346 case OMP_CLAUSE__SIMDUID_
:
11347 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11350 case OMP_CLAUSE_INDEPENDENT
:
11351 case OMP_CLAUSE_NOWAIT
:
11352 case OMP_CLAUSE_DEFAULT
:
11353 case OMP_CLAUSE_UNTIED
:
11354 case OMP_CLAUSE_MERGEABLE
:
11355 case OMP_CLAUSE_PROC_BIND
:
11356 case OMP_CLAUSE_INBRANCH
:
11357 case OMP_CLAUSE_NOTINBRANCH
:
11358 case OMP_CLAUSE_FOR
:
11359 case OMP_CLAUSE_PARALLEL
:
11360 case OMP_CLAUSE_SECTIONS
:
11361 case OMP_CLAUSE_TASKGROUP
:
11362 case OMP_CLAUSE_NOGROUP
:
11363 case OMP_CLAUSE_THREADS
:
11364 case OMP_CLAUSE_SIMD
:
11365 case OMP_CLAUSE_DEFAULTMAP
:
11366 case OMP_CLAUSE_AUTO
:
11367 case OMP_CLAUSE_SEQ
:
11368 case OMP_CLAUSE_TILE
:
11369 case OMP_CLAUSE__SIMT_
:
11370 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11372 case OMP_CLAUSE_LASTPRIVATE
:
11373 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11374 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11375 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11377 case OMP_CLAUSE_COLLAPSE
:
11380 for (i
= 0; i
< 3; i
++)
11381 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11382 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11385 case OMP_CLAUSE_LINEAR
:
11386 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11387 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11388 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11389 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11391 case OMP_CLAUSE_ALIGNED
:
11392 case OMP_CLAUSE_FROM
:
11393 case OMP_CLAUSE_TO
:
11394 case OMP_CLAUSE_MAP
:
11395 case OMP_CLAUSE__CACHE_
:
11396 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11397 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11398 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11400 case OMP_CLAUSE_REDUCTION
:
11403 for (i
= 0; i
< 5; i
++)
11404 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11405 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11409 gcc_unreachable ();
11417 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11418 But, we only want to walk once. */
11419 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11420 for (i
= 0; i
< len
; ++i
)
11421 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11422 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11426 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11427 defining. We only want to walk into these fields of a type in this
11428 case and not in the general case of a mere reference to the type.
11430 The criterion is as follows: if the field can be an expression, it
11431 must be walked only here. This should be in keeping with the fields
11432 that are directly gimplified in gimplify_type_sizes in order for the
11433 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11434 variable-sized types.
11436 Note that DECLs get walked as part of processing the BIND_EXPR. */
11437 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11439 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11440 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11443 /* Call the function for the type. See if it returns anything or
11444 doesn't want us to continue. If we are to continue, walk both
11445 the normal fields and those for the declaration case. */
11446 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11447 if (result
|| !walk_subtrees
)
11450 /* But do not walk a pointed-to type since it may itself need to
11451 be walked in the declaration case if it isn't anonymous. */
11452 if (!POINTER_TYPE_P (*type_p
))
11454 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11459 /* If this is a record type, also walk the fields. */
11460 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11464 for (field
= TYPE_FIELDS (*type_p
); field
;
11465 field
= DECL_CHAIN (field
))
11467 /* We'd like to look at the type of the field, but we can
11468 easily get infinite recursion. So assume it's pointed
11469 to elsewhere in the tree. Also, ignore things that
11471 if (TREE_CODE (field
) != FIELD_DECL
)
11474 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11475 WALK_SUBTREE (DECL_SIZE (field
));
11476 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11477 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11478 WALK_SUBTREE (DECL_QUALIFIER (field
));
11482 /* Same for scalar types. */
11483 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11484 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11485 || TREE_CODE (*type_p
) == INTEGER_TYPE
11486 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11487 || TREE_CODE (*type_p
) == REAL_TYPE
)
11489 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11490 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11493 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11494 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11499 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11503 /* Walk over all the sub-trees of this operand. */
11504 len
= TREE_OPERAND_LENGTH (*tp
);
11506 /* Go through the subtrees. We need to do this in forward order so
11507 that the scope of a FOR_EXPR is handled properly. */
11510 for (i
= 0; i
< len
- 1; ++i
)
11511 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11512 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11515 /* If this is a type, walk the needed fields in the type. */
11516 else if (TYPE_P (*tp
))
11517 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11521 /* We didn't find what we were looking for. */
11524 #undef WALK_SUBTREE_TAIL
11526 #undef WALK_SUBTREE
11528 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11531 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11536 hash_set
<tree
> pset
;
11537 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11543 tree_block (tree t
)
11545 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11547 if (IS_EXPR_CODE_CLASS (c
))
11548 return LOCATION_BLOCK (t
->exp
.locus
);
11549 gcc_unreachable ();
11554 tree_set_block (tree t
, tree b
)
11556 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11558 if (IS_EXPR_CODE_CLASS (c
))
11560 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11563 gcc_unreachable ();
11566 /* Create a nameless artificial label and put it in the current
11567 function context. The label has a location of LOC. Returns the
11568 newly created label. */
11571 create_artificial_label (location_t loc
)
11573 tree lab
= build_decl (loc
,
11574 LABEL_DECL
, NULL_TREE
, void_type_node
);
11576 DECL_ARTIFICIAL (lab
) = 1;
11577 DECL_IGNORED_P (lab
) = 1;
11578 DECL_CONTEXT (lab
) = current_function_decl
;
11582 /* Given a tree, try to return a useful variable name that we can use
11583 to prefix a temporary that is being assigned the value of the tree.
11584 I.E. given <temp> = &A, return A. */
11589 tree stripped_decl
;
11592 STRIP_NOPS (stripped_decl
);
11593 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11594 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11595 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11597 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11600 return IDENTIFIER_POINTER (name
);
11604 switch (TREE_CODE (stripped_decl
))
11607 return get_name (TREE_OPERAND (stripped_decl
, 0));
11614 /* Return true if TYPE has a variable argument list. */
11617 stdarg_p (const_tree fntype
)
11619 function_args_iterator args_iter
;
11620 tree n
= NULL_TREE
, t
;
11625 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11630 return n
!= NULL_TREE
&& n
!= void_type_node
;
11633 /* Return true if TYPE has a prototype. */
11636 prototype_p (const_tree fntype
)
11640 gcc_assert (fntype
!= NULL_TREE
);
11642 t
= TYPE_ARG_TYPES (fntype
);
11643 return (t
!= NULL_TREE
);
11646 /* If BLOCK is inlined from an __attribute__((__artificial__))
11647 routine, return pointer to location from where it has been
11650 block_nonartificial_location (tree block
)
11652 location_t
*ret
= NULL
;
11654 while (block
&& TREE_CODE (block
) == BLOCK
11655 && BLOCK_ABSTRACT_ORIGIN (block
))
11657 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11659 while (TREE_CODE (ao
) == BLOCK
11660 && BLOCK_ABSTRACT_ORIGIN (ao
)
11661 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11662 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11664 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11666 /* If AO is an artificial inline, point RET to the
11667 call site locus at which it has been inlined and continue
11668 the loop, in case AO's caller is also an artificial
11670 if (DECL_DECLARED_INLINE_P (ao
)
11671 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11672 ret
= &BLOCK_SOURCE_LOCATION (block
);
11676 else if (TREE_CODE (ao
) != BLOCK
)
11679 block
= BLOCK_SUPERCONTEXT (block
);
11685 /* If EXP is inlined from an __attribute__((__artificial__))
11686 function, return the location of the original call expression. */
11689 tree_nonartificial_location (tree exp
)
11691 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11696 return EXPR_LOCATION (exp
);
11700 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11703 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11706 cl_option_hasher::hash (tree x
)
11708 const_tree
const t
= x
;
11712 hashval_t hash
= 0;
11714 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11716 p
= (const char *)TREE_OPTIMIZATION (t
);
11717 len
= sizeof (struct cl_optimization
);
11720 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11721 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11724 gcc_unreachable ();
11726 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11728 for (i
= 0; i
< len
; i
++)
11730 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11735 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11736 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11740 cl_option_hasher::equal (tree x
, tree y
)
11742 const_tree
const xt
= x
;
11743 const_tree
const yt
= y
;
11748 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11751 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11753 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11754 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11755 len
= sizeof (struct cl_optimization
);
11758 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11760 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11761 TREE_TARGET_OPTION (yt
));
11765 gcc_unreachable ();
11767 return (memcmp (xp
, yp
, len
) == 0);
11770 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11773 build_optimization_node (struct gcc_options
*opts
)
11777 /* Use the cache of optimization nodes. */
11779 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11782 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11786 /* Insert this one into the hash table. */
11787 t
= cl_optimization_node
;
11790 /* Make a new node for next time round. */
11791 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11797 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11800 build_target_option_node (struct gcc_options
*opts
)
11804 /* Use the cache of optimization nodes. */
11806 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11809 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11813 /* Insert this one into the hash table. */
11814 t
= cl_target_option_node
;
11817 /* Make a new node for next time round. */
11818 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11824 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11825 so that they aren't saved during PCH writing. */
11828 prepare_target_option_nodes_for_pch (void)
11830 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11831 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11832 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11833 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11836 /* Determine the "ultimate origin" of a block. The block may be an inlined
11837 instance of an inlined instance of a block which is local to an inline
11838 function, so we have to trace all of the way back through the origin chain
11839 to find out what sort of node actually served as the original seed for the
11843 block_ultimate_origin (const_tree block
)
11845 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11847 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11848 we're trying to output the abstract instance of this function. */
11849 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11852 if (immediate_origin
== NULL_TREE
)
11857 tree lookahead
= immediate_origin
;
11861 ret_val
= lookahead
;
11862 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11863 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11865 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11867 /* The block's abstract origin chain may not be the *ultimate* origin of
11868 the block. It could lead to a DECL that has an abstract origin set.
11869 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11870 will give us if it has one). Note that DECL's abstract origins are
11871 supposed to be the most distant ancestor (or so decl_ultimate_origin
11872 claims), so we don't need to loop following the DECL origins. */
11873 if (DECL_P (ret_val
))
11874 return DECL_ORIGIN (ret_val
);
11880 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11884 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11886 /* Do not strip casts into or out of differing address spaces. */
11887 if (POINTER_TYPE_P (outer_type
)
11888 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
11890 if (!POINTER_TYPE_P (inner_type
)
11891 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
11892 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
11895 else if (POINTER_TYPE_P (inner_type
)
11896 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
11898 /* We already know that outer_type is not a pointer with
11899 a non-generic address space. */
11903 /* Use precision rather then machine mode when we can, which gives
11904 the correct answer even for submode (bit-field) types. */
11905 if ((INTEGRAL_TYPE_P (outer_type
)
11906 || POINTER_TYPE_P (outer_type
)
11907 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11908 && (INTEGRAL_TYPE_P (inner_type
)
11909 || POINTER_TYPE_P (inner_type
)
11910 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11911 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11913 /* Otherwise fall back on comparing machine modes (e.g. for
11914 aggregate types, floats). */
11915 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11918 /* Return true iff conversion in EXP generates no instruction. Mark
11919 it inline so that we fully inline into the stripping functions even
11920 though we have two uses of this function. */
11923 tree_nop_conversion (const_tree exp
)
11925 tree outer_type
, inner_type
;
11927 if (!CONVERT_EXPR_P (exp
)
11928 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11930 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11933 outer_type
= TREE_TYPE (exp
);
11934 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11939 return tree_nop_conversion_p (outer_type
, inner_type
);
11942 /* Return true iff conversion in EXP generates no instruction. Don't
11943 consider conversions changing the signedness. */
11946 tree_sign_nop_conversion (const_tree exp
)
11948 tree outer_type
, inner_type
;
11950 if (!tree_nop_conversion (exp
))
11953 outer_type
= TREE_TYPE (exp
);
11954 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11956 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11957 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11960 /* Strip conversions from EXP according to tree_nop_conversion and
11961 return the resulting expression. */
11964 tree_strip_nop_conversions (tree exp
)
11966 while (tree_nop_conversion (exp
))
11967 exp
= TREE_OPERAND (exp
, 0);
11971 /* Strip conversions from EXP according to tree_sign_nop_conversion
11972 and return the resulting expression. */
11975 tree_strip_sign_nop_conversions (tree exp
)
11977 while (tree_sign_nop_conversion (exp
))
11978 exp
= TREE_OPERAND (exp
, 0);
11982 /* Avoid any floating point extensions from EXP. */
11984 strip_float_extensions (tree exp
)
11986 tree sub
, expt
, subt
;
11988 /* For floating point constant look up the narrowest type that can hold
11989 it properly and handle it like (type)(narrowest_type)constant.
11990 This way we can optimize for instance a=a*2.0 where "a" is float
11991 but 2.0 is double constant. */
11992 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11994 REAL_VALUE_TYPE orig
;
11997 orig
= TREE_REAL_CST (exp
);
11998 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11999 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12000 type
= float_type_node
;
12001 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12002 > TYPE_PRECISION (double_type_node
)
12003 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12004 type
= double_type_node
;
12006 return build_real_truncate (type
, orig
);
12009 if (!CONVERT_EXPR_P (exp
))
12012 sub
= TREE_OPERAND (exp
, 0);
12013 subt
= TREE_TYPE (sub
);
12014 expt
= TREE_TYPE (exp
);
12016 if (!FLOAT_TYPE_P (subt
))
12019 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12022 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12025 return strip_float_extensions (sub
);
12028 /* Strip out all handled components that produce invariant
12032 strip_invariant_refs (const_tree op
)
12034 while (handled_component_p (op
))
12036 switch (TREE_CODE (op
))
12039 case ARRAY_RANGE_REF
:
12040 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12041 || TREE_OPERAND (op
, 2) != NULL_TREE
12042 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12046 case COMPONENT_REF
:
12047 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12053 op
= TREE_OPERAND (op
, 0);
12059 static GTY(()) tree gcc_eh_personality_decl
;
12061 /* Return the GCC personality function decl. */
12064 lhd_gcc_personality (void)
12066 if (!gcc_eh_personality_decl
)
12067 gcc_eh_personality_decl
= build_personality_function ("gcc");
12068 return gcc_eh_personality_decl
;
12071 /* TARGET is a call target of GIMPLE call statement
12072 (obtained by gimple_call_fn). Return true if it is
12073 OBJ_TYPE_REF representing an virtual call of C++ method.
12074 (As opposed to OBJ_TYPE_REF representing objc calls
12075 through a cast where middle-end devirtualization machinery
12079 virtual_method_call_p (const_tree target
)
12081 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12083 tree t
= TREE_TYPE (target
);
12084 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12086 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12088 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12089 /* If we do not have BINFO associated, it means that type was built
12090 without devirtualization enabled. Do not consider this a virtual
12092 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12097 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12100 obj_type_ref_class (const_tree ref
)
12102 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12103 ref
= TREE_TYPE (ref
);
12104 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12105 ref
= TREE_TYPE (ref
);
12106 /* We look for type THIS points to. ObjC also builds
12107 OBJ_TYPE_REF with non-method calls, Their first parameter
12108 ID however also corresponds to class type. */
12109 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12110 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12111 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12112 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12113 return TREE_TYPE (ref
);
12116 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12119 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12122 tree base_binfo
, b
;
12124 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12125 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12126 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12128 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12133 /* Try to find a base info of BINFO that would have its field decl at offset
12134 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12135 found, return, otherwise return NULL_TREE. */
12138 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12140 tree type
= BINFO_TYPE (binfo
);
12144 HOST_WIDE_INT pos
, size
;
12148 if (types_same_for_odr (type
, expected_type
))
12153 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12155 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12158 pos
= int_bit_position (fld
);
12159 size
= tree_to_uhwi (DECL_SIZE (fld
));
12160 if (pos
<= offset
&& (pos
+ size
) > offset
)
12163 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12166 /* Offset 0 indicates the primary base, whose vtable contents are
12167 represented in the binfo for the derived class. */
12168 else if (offset
!= 0)
12170 tree found_binfo
= NULL
, base_binfo
;
12171 /* Offsets in BINFO are in bytes relative to the whole structure
12172 while POS is in bits relative to the containing field. */
12173 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12176 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12177 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12178 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12180 found_binfo
= base_binfo
;
12184 binfo
= found_binfo
;
12186 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12190 type
= TREE_TYPE (fld
);
12195 /* Returns true if X is a typedef decl. */
12198 is_typedef_decl (const_tree x
)
12200 return (x
&& TREE_CODE (x
) == TYPE_DECL
12201 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12204 /* Returns true iff TYPE is a type variant created for a typedef. */
12207 typedef_variant_p (const_tree type
)
12209 return is_typedef_decl (TYPE_NAME (type
));
12212 /* Warn about a use of an identifier which was marked deprecated. */
12214 warn_deprecated_use (tree node
, tree attr
)
12218 if (node
== 0 || !warn_deprecated_decl
)
12224 attr
= DECL_ATTRIBUTES (node
);
12225 else if (TYPE_P (node
))
12227 tree decl
= TYPE_STUB_DECL (node
);
12229 attr
= lookup_attribute ("deprecated",
12230 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12235 attr
= lookup_attribute ("deprecated", attr
);
12238 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12246 w
= warning (OPT_Wdeprecated_declarations
,
12247 "%qD is deprecated: %s", node
, msg
);
12249 w
= warning (OPT_Wdeprecated_declarations
,
12250 "%qD is deprecated", node
);
12252 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12254 else if (TYPE_P (node
))
12256 tree what
= NULL_TREE
;
12257 tree decl
= TYPE_STUB_DECL (node
);
12259 if (TYPE_NAME (node
))
12261 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12262 what
= TYPE_NAME (node
);
12263 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12264 && DECL_NAME (TYPE_NAME (node
)))
12265 what
= DECL_NAME (TYPE_NAME (node
));
12273 w
= warning (OPT_Wdeprecated_declarations
,
12274 "%qE is deprecated: %s", what
, msg
);
12276 w
= warning (OPT_Wdeprecated_declarations
,
12277 "%qE is deprecated", what
);
12282 w
= warning (OPT_Wdeprecated_declarations
,
12283 "type is deprecated: %s", msg
);
12285 w
= warning (OPT_Wdeprecated_declarations
,
12286 "type is deprecated");
12289 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12296 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12299 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12304 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12307 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12313 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12314 somewhere in it. */
12317 contains_bitfld_component_ref_p (const_tree ref
)
12319 while (handled_component_p (ref
))
12321 if (TREE_CODE (ref
) == COMPONENT_REF
12322 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12324 ref
= TREE_OPERAND (ref
, 0);
12330 /* Try to determine whether a TRY_CATCH expression can fall through.
12331 This is a subroutine of block_may_fallthru. */
12334 try_catch_may_fallthru (const_tree stmt
)
12336 tree_stmt_iterator i
;
12338 /* If the TRY block can fall through, the whole TRY_CATCH can
12340 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12343 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12344 switch (TREE_CODE (tsi_stmt (i
)))
12347 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12348 catch expression and a body. The whole TRY_CATCH may fall
12349 through iff any of the catch bodies falls through. */
12350 for (; !tsi_end_p (i
); tsi_next (&i
))
12352 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12357 case EH_FILTER_EXPR
:
12358 /* The exception filter expression only matters if there is an
12359 exception. If the exception does not match EH_FILTER_TYPES,
12360 we will execute EH_FILTER_FAILURE, and we will fall through
12361 if that falls through. If the exception does match
12362 EH_FILTER_TYPES, the stack unwinder will continue up the
12363 stack, so we will not fall through. We don't know whether we
12364 will throw an exception which matches EH_FILTER_TYPES or not,
12365 so we just ignore EH_FILTER_TYPES and assume that we might
12366 throw an exception which doesn't match. */
12367 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12370 /* This case represents statements to be executed when an
12371 exception occurs. Those statements are implicitly followed
12372 by a RESX statement to resume execution after the exception.
12373 So in this case the TRY_CATCH never falls through. */
12378 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12379 need not be 100% accurate; simply be conservative and return true if we
12380 don't know. This is used only to avoid stupidly generating extra code.
12381 If we're wrong, we'll just delete the extra code later. */
12384 block_may_fallthru (const_tree block
)
12386 /* This CONST_CAST is okay because expr_last returns its argument
12387 unmodified and we assign it to a const_tree. */
12388 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12390 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12394 /* Easy cases. If the last statement of the block implies
12395 control transfer, then we can't fall through. */
12399 /* If there is a default: label or case labels cover all possible
12400 SWITCH_COND values, then the SWITCH_EXPR will transfer control
12401 to some case label in all cases and all we care is whether the
12402 SWITCH_BODY falls through. */
12403 if (SWITCH_ALL_CASES_P (stmt
))
12404 return block_may_fallthru (SWITCH_BODY (stmt
));
12408 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12410 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12413 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12415 case TRY_CATCH_EXPR
:
12416 return try_catch_may_fallthru (stmt
);
12418 case TRY_FINALLY_EXPR
:
12419 /* The finally clause is always executed after the try clause,
12420 so if it does not fall through, then the try-finally will not
12421 fall through. Otherwise, if the try clause does not fall
12422 through, then when the finally clause falls through it will
12423 resume execution wherever the try clause was going. So the
12424 whole try-finally will only fall through if both the try
12425 clause and the finally clause fall through. */
12426 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12427 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12430 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12431 stmt
= TREE_OPERAND (stmt
, 1);
12437 /* Functions that do not return do not fall through. */
12438 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12440 case CLEANUP_POINT_EXPR
:
12441 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12444 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12450 return lang_hooks
.block_may_fallthru (stmt
);
12454 /* True if we are using EH to handle cleanups. */
12455 static bool using_eh_for_cleanups_flag
= false;
12457 /* This routine is called from front ends to indicate eh should be used for
12460 using_eh_for_cleanups (void)
12462 using_eh_for_cleanups_flag
= true;
12465 /* Query whether EH is used for cleanups. */
12467 using_eh_for_cleanups_p (void)
12469 return using_eh_for_cleanups_flag
;
12472 /* Wrapper for tree_code_name to ensure that tree code is valid */
12474 get_tree_code_name (enum tree_code code
)
12476 const char *invalid
= "<invalid tree code>";
12478 if (code
>= MAX_TREE_CODES
)
12481 return tree_code_name
[code
];
12484 /* Drops the TREE_OVERFLOW flag from T. */
12487 drop_tree_overflow (tree t
)
12489 gcc_checking_assert (TREE_OVERFLOW (t
));
12491 /* For tree codes with a sharing machinery re-build the result. */
12492 if (TREE_CODE (t
) == INTEGER_CST
)
12493 return wide_int_to_tree (TREE_TYPE (t
), wi::to_wide (t
));
12495 /* For VECTOR_CST, remove the overflow bits from the encoded elements
12496 and canonicalize the result. */
12497 if (TREE_CODE (t
) == VECTOR_CST
)
12499 tree_vector_builder builder
;
12500 builder
.new_unary_operation (TREE_TYPE (t
), t
, true);
12501 unsigned int count
= builder
.encoded_nelts ();
12502 for (unsigned int i
= 0; i
< count
; ++i
)
12504 tree elt
= VECTOR_CST_ELT (t
, i
);
12505 if (TREE_OVERFLOW (elt
))
12506 elt
= drop_tree_overflow (elt
);
12507 builder
.quick_push (elt
);
12509 return builder
.build ();
12512 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12513 and drop the flag. */
12515 TREE_OVERFLOW (t
) = 0;
12517 /* For constants that contain nested constants, drop the flag
12518 from those as well. */
12519 if (TREE_CODE (t
) == COMPLEX_CST
)
12521 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12522 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12523 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12524 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12530 /* Given a memory reference expression T, return its base address.
12531 The base address of a memory reference expression is the main
12532 object being referenced. For instance, the base address for
12533 'array[i].fld[j]' is 'array'. You can think of this as stripping
12534 away the offset part from a memory address.
12536 This function calls handled_component_p to strip away all the inner
12537 parts of the memory reference until it reaches the base object. */
12540 get_base_address (tree t
)
12542 while (handled_component_p (t
))
12543 t
= TREE_OPERAND (t
, 0);
12545 if ((TREE_CODE (t
) == MEM_REF
12546 || TREE_CODE (t
) == TARGET_MEM_REF
)
12547 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12548 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12550 /* ??? Either the alias oracle or all callers need to properly deal
12551 with WITH_SIZE_EXPRs before we can look through those. */
12552 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12558 /* Return a tree of sizetype representing the size, in bytes, of the element
12559 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12562 array_ref_element_size (tree exp
)
12564 tree aligned_size
= TREE_OPERAND (exp
, 3);
12565 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12566 location_t loc
= EXPR_LOCATION (exp
);
12568 /* If a size was specified in the ARRAY_REF, it's the size measured
12569 in alignment units of the element type. So multiply by that value. */
12572 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12573 sizetype from another type of the same width and signedness. */
12574 if (TREE_TYPE (aligned_size
) != sizetype
)
12575 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12576 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12577 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12580 /* Otherwise, take the size from that of the element type. Substitute
12581 any PLACEHOLDER_EXPR that we have. */
12583 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12586 /* Return a tree representing the lower bound of the array mentioned in
12587 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12590 array_ref_low_bound (tree exp
)
12592 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12594 /* If a lower bound is specified in EXP, use it. */
12595 if (TREE_OPERAND (exp
, 2))
12596 return TREE_OPERAND (exp
, 2);
12598 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12599 substituting for a PLACEHOLDER_EXPR as needed. */
12600 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12601 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12603 /* Otherwise, return a zero of the appropriate type. */
12604 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12607 /* Return a tree representing the upper bound of the array mentioned in
12608 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12611 array_ref_up_bound (tree exp
)
12613 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12615 /* If there is a domain type and it has an upper bound, use it, substituting
12616 for a PLACEHOLDER_EXPR as needed. */
12617 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12618 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12620 /* Otherwise fail. */
12624 /* Returns true if REF is an array reference or a component reference
12625 to an array at the end of a structure.
12626 If this is the case, the array may be allocated larger
12627 than its upper bound implies. */
12630 array_at_struct_end_p (tree ref
)
12634 if (TREE_CODE (ref
) == ARRAY_REF
12635 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12637 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12638 ref
= TREE_OPERAND (ref
, 0);
12640 else if (TREE_CODE (ref
) == COMPONENT_REF
12641 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12642 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12646 if (TREE_CODE (ref
) == STRING_CST
)
12649 while (handled_component_p (ref
))
12651 /* If the reference chain contains a component reference to a
12652 non-union type and there follows another field the reference
12653 is not at the end of a structure. */
12654 if (TREE_CODE (ref
) == COMPONENT_REF
)
12656 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12658 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12659 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12660 nextf
= DECL_CHAIN (nextf
);
12665 /* If we have a multi-dimensional array we do not consider
12666 a non-innermost dimension as flex array if the whole
12667 multi-dimensional array is at struct end.
12668 Same for an array of aggregates with a trailing array
12670 else if (TREE_CODE (ref
) == ARRAY_REF
)
12672 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12674 /* If we view an underlying object as sth else then what we
12675 gathered up to now is what we have to rely on. */
12676 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12679 gcc_unreachable ();
12681 ref
= TREE_OPERAND (ref
, 0);
12684 /* The array now is at struct end. Treat flexible arrays as
12685 always subject to extend, even into just padding constrained by
12686 an underlying decl. */
12687 if (! TYPE_SIZE (atype
))
12692 if (TREE_CODE (ref
) == MEM_REF
12693 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12695 size
= TYPE_SIZE (TREE_TYPE (ref
));
12696 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12699 /* If the reference is based on a declared entity, the size of the array
12700 is constrained by its given domain. (Do not trust commons PR/69368). */
12702 /* Be sure the size of MEM_REF target match. For example:
12705 struct foo *str = (struct foo *)&buf;
12707 str->trailin_array[2] = 1;
12709 is valid because BUF allocate enough space. */
12711 && (!size
|| (DECL_SIZE (ref
) != NULL
12712 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
12713 && !(flag_unconstrained_commons
12714 && VAR_P (ref
) && DECL_COMMON (ref
)))
12720 /* Return a tree representing the offset, in bytes, of the field referenced
12721 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12724 component_ref_field_offset (tree exp
)
12726 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12727 tree field
= TREE_OPERAND (exp
, 1);
12728 location_t loc
= EXPR_LOCATION (exp
);
12730 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12731 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12733 if (aligned_offset
)
12735 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12736 sizetype from another type of the same width and signedness. */
12737 if (TREE_TYPE (aligned_offset
) != sizetype
)
12738 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12739 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12740 size_int (DECL_OFFSET_ALIGN (field
)
12744 /* Otherwise, take the offset from that of the field. Substitute
12745 any PLACEHOLDER_EXPR that we have. */
12747 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
12750 /* Return the machine mode of T. For vectors, returns the mode of the
12751 inner type. The main use case is to feed the result to HONOR_NANS,
12752 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12755 element_mode (const_tree t
)
12759 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12761 return TYPE_MODE (t
);
12764 /* Vector types need to re-check the target flags each time we report
12765 the machine mode. We need to do this because attribute target can
12766 change the result of vector_mode_supported_p and have_regs_of_mode
12767 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12768 change on a per-function basis. */
12769 /* ??? Possibly a better solution is to run through all the types
12770 referenced by a function and re-compute the TYPE_MODE once, rather
12771 than make the TYPE_MODE macro call a function. */
12774 vector_type_mode (const_tree t
)
12778 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
12780 mode
= t
->type_common
.mode
;
12781 if (VECTOR_MODE_P (mode
)
12782 && (!targetm
.vector_mode_supported_p (mode
)
12783 || !have_regs_of_mode
[mode
]))
12785 scalar_int_mode innermode
;
12787 /* For integers, try mapping it to a same-sized scalar mode. */
12788 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
12790 unsigned int size
= (TYPE_VECTOR_SUBPARTS (t
)
12791 * GET_MODE_BITSIZE (innermode
));
12792 scalar_int_mode mode
;
12793 if (int_mode_for_size (size
, 0).exists (&mode
)
12794 && have_regs_of_mode
[mode
])
12804 /* Verify that basic properties of T match TV and thus T can be a variant of
12805 TV. TV should be the more specified variant (i.e. the main variant). */
12808 verify_type_variant (const_tree t
, tree tv
)
12810 /* Type variant can differ by:
12812 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12813 ENCODE_QUAL_ADDR_SPACE.
12814 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12815 in this case some values may not be set in the variant types
12816 (see TYPE_COMPLETE_P checks).
12817 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12818 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12819 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12820 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12821 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12822 this is necessary to make it possible to merge types form different TUs
12823 - arrays, pointers and references may have TREE_TYPE that is a variant
12824 of TREE_TYPE of their main variants.
12825 - aggregates may have new TYPE_FIELDS list that list variants of
12826 the main variant TYPE_FIELDS.
12827 - vector types may differ by TYPE_VECTOR_OPAQUE
12830 /* Convenience macro for matching individual fields. */
12831 #define verify_variant_match(flag) \
12833 if (flag (tv) != flag (t)) \
12835 error ("type variant differs by " #flag "."); \
12841 /* tree_base checks. */
12843 verify_variant_match (TREE_CODE
);
12844 /* FIXME: Ada builds non-artificial variants of artificial types. */
12845 if (TYPE_ARTIFICIAL (tv
) && 0)
12846 verify_variant_match (TYPE_ARTIFICIAL
);
12847 if (POINTER_TYPE_P (tv
))
12848 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
12849 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12850 verify_variant_match (TYPE_UNSIGNED
);
12851 verify_variant_match (TYPE_PACKED
);
12852 if (TREE_CODE (t
) == REFERENCE_TYPE
)
12853 verify_variant_match (TYPE_REF_IS_RVALUE
);
12854 if (AGGREGATE_TYPE_P (t
))
12855 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
12857 verify_variant_match (TYPE_SATURATING
);
12858 /* FIXME: This check trigger during libstdc++ build. */
12859 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
12860 verify_variant_match (TYPE_FINAL_P
);
12862 /* tree_type_common checks. */
12864 if (COMPLETE_TYPE_P (t
))
12866 verify_variant_match (TYPE_MODE
);
12867 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
12868 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
12869 verify_variant_match (TYPE_SIZE
);
12870 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
12871 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
12872 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
12874 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
12875 TYPE_SIZE_UNIT (tv
), 0));
12876 error ("type variant has different TYPE_SIZE_UNIT");
12878 error ("type variant's TYPE_SIZE_UNIT");
12879 debug_tree (TYPE_SIZE_UNIT (tv
));
12880 error ("type's TYPE_SIZE_UNIT");
12881 debug_tree (TYPE_SIZE_UNIT (t
));
12885 verify_variant_match (TYPE_PRECISION
);
12886 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
12887 if (RECORD_OR_UNION_TYPE_P (t
))
12888 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
12889 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12890 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
12891 /* During LTO we merge variant lists from diferent translation units
12892 that may differ BY TYPE_CONTEXT that in turn may point
12893 to TRANSLATION_UNIT_DECL.
12894 Ada also builds variants of types with different TYPE_CONTEXT. */
12895 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
12896 verify_variant_match (TYPE_CONTEXT
);
12897 verify_variant_match (TYPE_STRING_FLAG
);
12898 if (TYPE_ALIAS_SET_KNOWN_P (t
))
12900 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
12905 /* tree_type_non_common checks. */
12907 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12908 and dangle the pointer from time to time. */
12909 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12910 && (in_lto_p
|| !TYPE_VFIELD (tv
)
12911 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
12913 error ("type variant has different TYPE_VFIELD");
12917 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
12918 || TREE_CODE (t
) == INTEGER_TYPE
12919 || TREE_CODE (t
) == BOOLEAN_TYPE
12920 || TREE_CODE (t
) == REAL_TYPE
12921 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12923 verify_variant_match (TYPE_MAX_VALUE
);
12924 verify_variant_match (TYPE_MIN_VALUE
);
12926 if (TREE_CODE (t
) == METHOD_TYPE
)
12927 verify_variant_match (TYPE_METHOD_BASETYPE
);
12928 if (TREE_CODE (t
) == OFFSET_TYPE
)
12929 verify_variant_match (TYPE_OFFSET_BASETYPE
);
12930 if (TREE_CODE (t
) == ARRAY_TYPE
)
12931 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
12932 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12933 or even type's main variant. This is needed to make bootstrap pass
12934 and the bug seems new in GCC 5.
12935 C++ FE should be updated to make this consistent and we should check
12936 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12937 is a match with main variant.
12939 Also disable the check for Java for now because of parser hack that builds
12940 first an dummy BINFO and then sometimes replace it by real BINFO in some
12942 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
12943 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
12944 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12945 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12946 at LTO time only. */
12947 && (in_lto_p
&& odr_type_p (t
)))
12949 error ("type variant has different TYPE_BINFO");
12951 error ("type variant's TYPE_BINFO");
12952 debug_tree (TYPE_BINFO (tv
));
12953 error ("type's TYPE_BINFO");
12954 debug_tree (TYPE_BINFO (t
));
12958 /* Check various uses of TYPE_VALUES_RAW. */
12959 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
12960 verify_variant_match (TYPE_VALUES
);
12961 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12962 verify_variant_match (TYPE_DOMAIN
);
12963 /* Permit incomplete variants of complete type. While FEs may complete
12964 all variants, this does not happen for C++ templates in all cases. */
12965 else if (RECORD_OR_UNION_TYPE_P (t
)
12966 && COMPLETE_TYPE_P (t
)
12967 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
12971 /* Fortran builds qualified variants as new records with items of
12972 qualified type. Verify that they looks same. */
12973 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
12975 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
12976 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
12977 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
12978 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
12979 /* FIXME: gfc_nonrestricted_type builds all types as variants
12980 with exception of pointer types. It deeply copies the type
12981 which means that we may end up with a variant type
12982 referring non-variant pointer. We may change it to
12983 produce types as variants, too, like
12984 objc_get_protocol_qualified_type does. */
12985 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
12986 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
12987 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
12991 error ("type variant has different TYPE_FIELDS");
12993 error ("first mismatch is field");
12995 error ("and field");
13000 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13001 verify_variant_match (TYPE_ARG_TYPES
);
13002 /* For C++ the qualified variant of array type is really an array type
13003 of qualified TREE_TYPE.
13004 objc builds variants of pointer where pointer to type is a variant, too
13005 in objc_get_protocol_qualified_type. */
13006 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13007 && ((TREE_CODE (t
) != ARRAY_TYPE
13008 && !POINTER_TYPE_P (t
))
13009 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13010 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13012 error ("type variant has different TREE_TYPE");
13014 error ("type variant's TREE_TYPE");
13015 debug_tree (TREE_TYPE (tv
));
13016 error ("type's TREE_TYPE");
13017 debug_tree (TREE_TYPE (t
));
13020 if (type_with_alias_set_p (t
)
13021 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13023 error ("type is not compatible with its variant");
13025 error ("type variant's TREE_TYPE");
13026 debug_tree (TREE_TYPE (tv
));
13027 error ("type's TREE_TYPE");
13028 debug_tree (TREE_TYPE (t
));
13032 #undef verify_variant_match
13036 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13037 the middle-end types_compatible_p function. It needs to avoid
13038 claiming types are different for types that should be treated
13039 the same with respect to TBAA. Canonical types are also used
13040 for IL consistency checks via the useless_type_conversion_p
13041 predicate which does not handle all type kinds itself but falls
13042 back to pointer-comparison of TYPE_CANONICAL for aggregates
13045 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13046 type calculation because we need to allow inter-operability between signed
13047 and unsigned variants. */
13050 type_with_interoperable_signedness (const_tree type
)
13052 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13053 signed char and unsigned char. Similarly fortran FE builds
13054 C_SIZE_T as signed type, while C defines it unsigned. */
13056 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13058 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13059 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13062 /* Return true iff T1 and T2 are structurally identical for what
13064 This function is used both by lto.c canonical type merging and by the
13065 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13066 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13067 only for LTO because only in these cases TYPE_CANONICAL equivalence
13068 correspond to one defined by gimple_canonical_types_compatible_p. */
13071 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13072 bool trust_type_canonical
)
13074 /* Type variants should be same as the main variant. When not doing sanity
13075 checking to verify this fact, go to main variants and save some work. */
13076 if (trust_type_canonical
)
13078 t1
= TYPE_MAIN_VARIANT (t1
);
13079 t2
= TYPE_MAIN_VARIANT (t2
);
13082 /* Check first for the obvious case of pointer identity. */
13086 /* Check that we have two types to compare. */
13087 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13090 /* We consider complete types always compatible with incomplete type.
13091 This does not make sense for canonical type calculation and thus we
13092 need to ensure that we are never called on it.
13094 FIXME: For more correctness the function probably should have three modes
13095 1) mode assuming that types are complete mathcing their structure
13096 2) mode allowing incomplete types but producing equivalence classes
13097 and thus ignoring all info from complete types
13098 3) mode allowing incomplete types to match complete but checking
13099 compatibility between complete types.
13101 1 and 2 can be used for canonical type calculation. 3 is the real
13102 definition of type compatibility that can be used i.e. for warnings during
13103 declaration merging. */
13105 gcc_assert (!trust_type_canonical
13106 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13107 /* If the types have been previously registered and found equal
13110 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13111 && trust_type_canonical
)
13113 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13114 they are always NULL, but they are set to non-NULL for types
13115 constructed by build_pointer_type and variants. In this case the
13116 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13117 all pointers are considered equal. Be sure to not return false
13119 gcc_checking_assert (canonical_type_used_p (t1
)
13120 && canonical_type_used_p (t2
));
13121 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13124 /* Can't be the same type if the types don't have the same code. */
13125 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13126 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13129 /* Qualifiers do not matter for canonical type comparison purposes. */
13131 /* Void types and nullptr types are always the same. */
13132 if (TREE_CODE (t1
) == VOID_TYPE
13133 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13136 /* Can't be the same type if they have different mode. */
13137 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13140 /* Non-aggregate types can be handled cheaply. */
13141 if (INTEGRAL_TYPE_P (t1
)
13142 || SCALAR_FLOAT_TYPE_P (t1
)
13143 || FIXED_POINT_TYPE_P (t1
)
13144 || TREE_CODE (t1
) == VECTOR_TYPE
13145 || TREE_CODE (t1
) == COMPLEX_TYPE
13146 || TREE_CODE (t1
) == OFFSET_TYPE
13147 || POINTER_TYPE_P (t1
))
13149 /* Can't be the same type if they have different recision. */
13150 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13153 /* In some cases the signed and unsigned types are required to be
13155 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13156 && !type_with_interoperable_signedness (t1
))
13159 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13160 interoperable with "signed char". Unless all frontends are revisited
13161 to agree on these types, we must ignore the flag completely. */
13163 /* Fortran standard define C_PTR type that is compatible with every
13164 C pointer. For this reason we need to glob all pointers into one.
13165 Still pointers in different address spaces are not compatible. */
13166 if (POINTER_TYPE_P (t1
))
13168 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13169 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13173 /* Tail-recurse to components. */
13174 if (TREE_CODE (t1
) == VECTOR_TYPE
13175 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13176 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13178 trust_type_canonical
);
13183 /* Do type-specific comparisons. */
13184 switch (TREE_CODE (t1
))
13187 /* Array types are the same if the element types are the same and
13188 the number of elements are the same. */
13189 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13190 trust_type_canonical
)
13191 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13192 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13193 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13197 tree i1
= TYPE_DOMAIN (t1
);
13198 tree i2
= TYPE_DOMAIN (t2
);
13200 /* For an incomplete external array, the type domain can be
13201 NULL_TREE. Check this condition also. */
13202 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13204 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13208 tree min1
= TYPE_MIN_VALUE (i1
);
13209 tree min2
= TYPE_MIN_VALUE (i2
);
13210 tree max1
= TYPE_MAX_VALUE (i1
);
13211 tree max2
= TYPE_MAX_VALUE (i2
);
13213 /* The minimum/maximum values have to be the same. */
13216 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13217 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13218 || operand_equal_p (min1
, min2
, 0))))
13221 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13222 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13223 || operand_equal_p (max1
, max2
, 0)))))
13231 case FUNCTION_TYPE
:
13232 /* Function types are the same if the return type and arguments types
13234 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13235 trust_type_canonical
))
13238 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13242 tree parms1
, parms2
;
13244 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13246 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13248 if (!gimple_canonical_types_compatible_p
13249 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13250 trust_type_canonical
))
13254 if (parms1
|| parms2
)
13262 case QUAL_UNION_TYPE
:
13266 /* Don't try to compare variants of an incomplete type, before
13267 TYPE_FIELDS has been copied around. */
13268 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13272 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13275 /* For aggregate types, all the fields must be the same. */
13276 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13278 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13280 /* Skip non-fields and zero-sized fields. */
13281 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13283 && integer_zerop (DECL_SIZE (f1
)))))
13284 f1
= TREE_CHAIN (f1
);
13285 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13287 && integer_zerop (DECL_SIZE (f2
)))))
13288 f2
= TREE_CHAIN (f2
);
13291 /* The fields must have the same name, offset and type. */
13292 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13293 || !gimple_compare_field_offset (f1
, f2
)
13294 || !gimple_canonical_types_compatible_p
13295 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13296 trust_type_canonical
))
13300 /* If one aggregate has more fields than the other, they
13301 are not the same. */
13309 /* Consider all types with language specific trees in them mutually
13310 compatible. This is executed only from verify_type and false
13311 positives can be tolerated. */
13312 gcc_assert (!in_lto_p
);
13317 /* Verify type T. */
13320 verify_type (const_tree t
)
13322 bool error_found
= false;
13323 tree mv
= TYPE_MAIN_VARIANT (t
);
13326 error ("Main variant is not defined");
13327 error_found
= true;
13329 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13331 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13333 error_found
= true;
13335 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13336 error_found
= true;
13338 tree ct
= TYPE_CANONICAL (t
);
13341 else if (TYPE_CANONICAL (t
) != ct
)
13343 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13345 error_found
= true;
13347 /* Method and function types can not be used to address memory and thus
13348 TYPE_CANONICAL really matters only for determining useless conversions.
13350 FIXME: C++ FE produce declarations of builtin functions that are not
13351 compatible with main variants. */
13352 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13355 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13356 with variably sized arrays because their sizes possibly
13357 gimplified to different variables. */
13358 && !variably_modified_type_p (ct
, NULL
)
13359 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13361 error ("TYPE_CANONICAL is not compatible");
13363 error_found
= true;
13366 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13367 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13369 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13371 error_found
= true;
13373 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13375 error ("TYPE_CANONICAL of main variant is not main variant");
13377 debug_tree (TYPE_MAIN_VARIANT (ct
));
13378 error_found
= true;
13382 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13383 if (RECORD_OR_UNION_TYPE_P (t
))
13385 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13386 and danagle the pointer from time to time. */
13387 if (TYPE_VFIELD (t
)
13388 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13389 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13391 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13392 debug_tree (TYPE_VFIELD (t
));
13393 error_found
= true;
13396 else if (TREE_CODE (t
) == POINTER_TYPE
)
13398 if (TYPE_NEXT_PTR_TO (t
)
13399 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13401 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13402 debug_tree (TYPE_NEXT_PTR_TO (t
));
13403 error_found
= true;
13406 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13408 if (TYPE_NEXT_REF_TO (t
)
13409 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13411 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13412 debug_tree (TYPE_NEXT_REF_TO (t
));
13413 error_found
= true;
13416 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13417 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13419 /* FIXME: The following check should pass:
13420 useless_type_conversion_p (const_cast <tree> (t),
13421 TREE_TYPE (TYPE_MIN_VALUE (t))
13422 but does not for C sizetypes in LTO. */
13425 /* Check various uses of TYPE_MAXVAL_RAW. */
13426 if (RECORD_OR_UNION_TYPE_P (t
))
13428 if (!TYPE_BINFO (t
))
13430 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13432 error ("TYPE_BINFO is not TREE_BINFO");
13433 debug_tree (TYPE_BINFO (t
));
13434 error_found
= true;
13436 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13438 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13439 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13440 error_found
= true;
13443 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13445 if (TYPE_METHOD_BASETYPE (t
)
13446 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13447 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13449 error ("TYPE_METHOD_BASETYPE is not record nor union");
13450 debug_tree (TYPE_METHOD_BASETYPE (t
));
13451 error_found
= true;
13454 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13456 if (TYPE_OFFSET_BASETYPE (t
)
13457 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13458 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13460 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13461 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13462 error_found
= true;
13465 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13466 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13468 /* FIXME: The following check should pass:
13469 useless_type_conversion_p (const_cast <tree> (t),
13470 TREE_TYPE (TYPE_MAX_VALUE (t))
13471 but does not for C sizetypes in LTO. */
13473 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13475 if (TYPE_ARRAY_MAX_SIZE (t
)
13476 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13478 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13479 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13480 error_found
= true;
13483 else if (TYPE_MAX_VALUE_RAW (t
))
13485 error ("TYPE_MAX_VALUE_RAW non-NULL");
13486 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13487 error_found
= true;
13490 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13492 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13493 debug_tree (TYPE_LANG_SLOT_1 (t
));
13494 error_found
= true;
13497 /* Check various uses of TYPE_VALUES_RAW. */
13498 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13499 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13501 tree value
= TREE_VALUE (l
);
13502 tree name
= TREE_PURPOSE (l
);
13504 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13505 CONST_DECL of ENUMERAL TYPE. */
13506 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13508 error ("Enum value is not CONST_DECL or INTEGER_CST");
13509 debug_tree (value
);
13511 error_found
= true;
13513 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13514 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13516 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13517 debug_tree (value
);
13519 error_found
= true;
13521 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13523 error ("Enum value name is not IDENTIFIER_NODE");
13524 debug_tree (value
);
13526 error_found
= true;
13529 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13531 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13533 error ("Array TYPE_DOMAIN is not integer type");
13534 debug_tree (TYPE_DOMAIN (t
));
13535 error_found
= true;
13538 else if (RECORD_OR_UNION_TYPE_P (t
))
13540 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13542 error ("TYPE_FIELDS defined in incomplete type");
13543 error_found
= true;
13545 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13547 /* TODO: verify properties of decls. */
13548 if (TREE_CODE (fld
) == FIELD_DECL
)
13550 else if (TREE_CODE (fld
) == TYPE_DECL
)
13552 else if (TREE_CODE (fld
) == CONST_DECL
)
13554 else if (VAR_P (fld
))
13556 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13558 else if (TREE_CODE (fld
) == USING_DECL
)
13560 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13564 error ("Wrong tree in TYPE_FIELDS list");
13566 error_found
= true;
13570 else if (TREE_CODE (t
) == INTEGER_TYPE
13571 || TREE_CODE (t
) == BOOLEAN_TYPE
13572 || TREE_CODE (t
) == OFFSET_TYPE
13573 || TREE_CODE (t
) == REFERENCE_TYPE
13574 || TREE_CODE (t
) == NULLPTR_TYPE
13575 || TREE_CODE (t
) == POINTER_TYPE
)
13577 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13579 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13580 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13581 error_found
= true;
13583 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13585 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13586 debug_tree (TYPE_CACHED_VALUES (t
));
13587 error_found
= true;
13589 /* Verify just enough of cache to ensure that no one copied it to new type.
13590 All copying should go by copy_node that should clear it. */
13591 else if (TYPE_CACHED_VALUES_P (t
))
13594 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13595 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13596 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13598 error ("wrong TYPE_CACHED_VALUES entry");
13599 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13600 error_found
= true;
13605 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13606 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13608 /* C++ FE uses TREE_PURPOSE to store initial values. */
13609 if (TREE_PURPOSE (l
) && in_lto_p
)
13611 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13613 error_found
= true;
13615 if (!TYPE_P (TREE_VALUE (l
)))
13617 error ("Wrong entry in TYPE_ARG_TYPES list");
13619 error_found
= true;
13622 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13624 error ("TYPE_VALUES_RAW field is non-NULL");
13625 debug_tree (TYPE_VALUES_RAW (t
));
13626 error_found
= true;
13628 if (TREE_CODE (t
) != INTEGER_TYPE
13629 && TREE_CODE (t
) != BOOLEAN_TYPE
13630 && TREE_CODE (t
) != OFFSET_TYPE
13631 && TREE_CODE (t
) != REFERENCE_TYPE
13632 && TREE_CODE (t
) != NULLPTR_TYPE
13633 && TREE_CODE (t
) != POINTER_TYPE
13634 && TYPE_CACHED_VALUES_P (t
))
13636 error ("TYPE_CACHED_VALUES_P is set while it should not");
13637 error_found
= true;
13639 if (TYPE_STRING_FLAG (t
)
13640 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13642 error ("TYPE_STRING_FLAG is set on wrong type code");
13643 error_found
= true;
13646 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13647 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13649 if (TREE_CODE (t
) == METHOD_TYPE
13650 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13652 error ("TYPE_METHOD_BASETYPE is not main variant");
13653 error_found
= true;
13658 debug_tree (const_cast <tree
> (t
));
13659 internal_error ("verify_type failed");
13664 /* Return 1 if ARG interpreted as signed in its precision is known to be
13665 always positive or 2 if ARG is known to be always negative, or 3 if
13666 ARG may be positive or negative. */
13669 get_range_pos_neg (tree arg
)
13671 if (arg
== error_mark_node
)
13674 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13676 if (TREE_CODE (arg
) == INTEGER_CST
)
13678 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
13684 while (CONVERT_EXPR_P (arg
)
13685 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13686 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13688 arg
= TREE_OPERAND (arg
, 0);
13689 /* Narrower value zero extended into wider type
13690 will always result in positive values. */
13691 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13692 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13694 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13699 if (TREE_CODE (arg
) != SSA_NAME
)
13701 wide_int arg_min
, arg_max
;
13702 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13704 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13705 if (is_gimple_assign (g
)
13706 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13708 tree t
= gimple_assign_rhs1 (g
);
13709 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13710 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13712 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13713 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13715 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13724 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13726 /* For unsigned values, the "positive" range comes
13727 below the "negative" range. */
13728 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13730 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13735 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13737 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13746 /* Return true if ARG is marked with the nonnull attribute in the
13747 current function signature. */
13750 nonnull_arg_p (const_tree arg
)
13752 tree t
, attrs
, fntype
;
13753 unsigned HOST_WIDE_INT arg_num
;
13755 gcc_assert (TREE_CODE (arg
) == PARM_DECL
13756 && (POINTER_TYPE_P (TREE_TYPE (arg
))
13757 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
13759 /* The static chain decl is always non null. */
13760 if (arg
== cfun
->static_chain_decl
)
13763 /* THIS argument of method is always non-NULL. */
13764 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
13765 && arg
== DECL_ARGUMENTS (cfun
->decl
)
13766 && flag_delete_null_pointer_checks
)
13769 /* Values passed by reference are always non-NULL. */
13770 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
13771 && flag_delete_null_pointer_checks
)
13774 fntype
= TREE_TYPE (cfun
->decl
);
13775 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
13777 attrs
= lookup_attribute ("nonnull", attrs
);
13779 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13780 if (attrs
== NULL_TREE
)
13783 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13784 if (TREE_VALUE (attrs
) == NULL_TREE
)
13787 /* Get the position number for ARG in the function signature. */
13788 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
13790 t
= DECL_CHAIN (t
), arg_num
++)
13796 gcc_assert (t
== arg
);
13798 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13799 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
13801 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
13809 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13813 set_block (location_t loc
, tree block
)
13815 location_t pure_loc
= get_pure_location (loc
);
13816 source_range src_range
= get_range_from_loc (line_table
, loc
);
13817 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
13821 set_source_range (tree expr
, location_t start
, location_t finish
)
13823 source_range src_range
;
13824 src_range
.m_start
= start
;
13825 src_range
.m_finish
= finish
;
13826 return set_source_range (expr
, src_range
);
13830 set_source_range (tree expr
, source_range src_range
)
13832 if (!EXPR_P (expr
))
13833 return UNKNOWN_LOCATION
;
13835 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
13836 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
13840 SET_EXPR_LOCATION (expr
, adhoc
);
13844 /* Return the name of combined function FN, for debugging purposes. */
13847 combined_fn_name (combined_fn fn
)
13849 if (builtin_fn_p (fn
))
13851 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
13852 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
13855 return internal_fn_name (as_internal_fn (fn
));
13858 /* Return a bitmap with a bit set corresponding to each argument in
13859 a function call type FNTYPE declared with attribute nonnull,
13860 or null if none of the function's argument are nonnull. The caller
13861 must free the bitmap. */
13864 get_nonnull_args (const_tree fntype
)
13866 if (fntype
== NULL_TREE
)
13869 tree attrs
= TYPE_ATTRIBUTES (fntype
);
13873 bitmap argmap
= NULL
;
13875 /* A function declaration can specify multiple attribute nonnull,
13876 each with zero or more arguments. The loop below creates a bitmap
13877 representing a union of all the arguments. An empty (but non-null)
13878 bitmap means that all arguments have been declaraed nonnull. */
13879 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
13881 attrs
= lookup_attribute ("nonnull", attrs
);
13886 argmap
= BITMAP_ALLOC (NULL
);
13888 if (!TREE_VALUE (attrs
))
13890 /* Clear the bitmap in case a previous attribute nonnull
13891 set it and this one overrides it for all arguments. */
13892 bitmap_clear (argmap
);
13896 /* Iterate over the indices of the format arguments declared nonnull
13897 and set a bit for each. */
13898 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
13900 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
13901 bitmap_set_bit (argmap
, val
);
13908 /* Returns true if TYPE is a type where it and all of its subobjects
13909 (recursively) are of structure, union, or array type. */
13912 default_is_empty_type (tree type
)
13914 if (RECORD_OR_UNION_TYPE_P (type
))
13916 for (tree field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
13917 if (TREE_CODE (field
) == FIELD_DECL
13918 && !DECL_PADDING_P (field
)
13919 && !default_is_empty_type (TREE_TYPE (field
)))
13923 else if (TREE_CODE (type
) == ARRAY_TYPE
)
13924 return (integer_minus_onep (array_type_nelts (type
))
13925 || TYPE_DOMAIN (type
) == NULL_TREE
13926 || default_is_empty_type (TREE_TYPE (type
)));
13930 /* Implement TARGET_EMPTY_RECORD_P. Return true if TYPE is an empty type
13931 that shouldn't be passed via stack. */
13934 default_is_empty_record (const_tree type
)
13936 if (!abi_version_at_least (12))
13939 if (type
== error_mark_node
)
13942 if (TREE_ADDRESSABLE (type
))
13945 return default_is_empty_type (TYPE_MAIN_VARIANT (type
));
13948 /* Like int_size_in_bytes, but handle empty records specially. */
13951 arg_int_size_in_bytes (const_tree type
)
13953 return TYPE_EMPTY_P (type
) ? 0 : int_size_in_bytes (type
);
13956 /* Like size_in_bytes, but handle empty records specially. */
13959 arg_size_in_bytes (const_tree type
)
13961 return TYPE_EMPTY_P (type
) ? size_zero_node
: size_in_bytes (type
);
13964 /* Return true if an expression with CODE has to have the same result type as
13965 its first operand. */
13968 expr_type_first_operand_type_p (tree_code code
)
13981 case TRUNC_DIV_EXPR
:
13982 case CEIL_DIV_EXPR
:
13983 case FLOOR_DIV_EXPR
:
13984 case ROUND_DIV_EXPR
:
13985 case TRUNC_MOD_EXPR
:
13986 case CEIL_MOD_EXPR
:
13987 case FLOOR_MOD_EXPR
:
13988 case ROUND_MOD_EXPR
:
13990 case EXACT_DIV_EXPR
:
14008 /* List of pointer types used to declare builtins before we have seen their
14011 Keep the size up to date in tree.h ! */
14012 const builtin_structptr_type builtin_structptr_types
[6] =
14014 { fileptr_type_node
, ptr_type_node
, "FILE" },
14015 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
14016 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
14017 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
14018 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
14019 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
14024 namespace selftest
{
14026 /* Selftests for tree. */
14028 /* Verify that integer constants are sane. */
14031 test_integer_constants ()
14033 ASSERT_TRUE (integer_type_node
!= NULL
);
14034 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14036 tree type
= integer_type_node
;
14038 tree zero
= build_zero_cst (type
);
14039 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14040 ASSERT_EQ (type
, TREE_TYPE (zero
));
14042 tree one
= build_int_cst (type
, 1);
14043 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14044 ASSERT_EQ (type
, TREE_TYPE (zero
));
14047 /* Verify identifiers. */
14050 test_identifiers ()
14052 tree identifier
= get_identifier ("foo");
14053 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14054 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14057 /* Verify LABEL_DECL. */
14062 tree identifier
= get_identifier ("err");
14063 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14064 identifier
, void_type_node
);
14065 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14066 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14069 /* Check that VECTOR_CST ACTUAL contains the elements in EXPECTED. */
14072 check_vector_cst (vec
<tree
> expected
, tree actual
)
14074 ASSERT_EQ (expected
.length (), TYPE_VECTOR_SUBPARTS (TREE_TYPE (actual
)));
14075 for (unsigned int i
= 0; i
< expected
.length (); ++i
)
14076 ASSERT_EQ (wi::to_wide (expected
[i
]),
14077 wi::to_wide (vector_cst_elt (actual
, i
)));
14080 /* Check that VECTOR_CST ACTUAL contains NPATTERNS duplicated elements,
14081 and that its elements match EXPECTED. */
14084 check_vector_cst_duplicate (vec
<tree
> expected
, tree actual
,
14085 unsigned int npatterns
)
14087 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14088 ASSERT_EQ (1, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14089 ASSERT_EQ (npatterns
, vector_cst_encoded_nelts (actual
));
14090 ASSERT_TRUE (VECTOR_CST_DUPLICATE_P (actual
));
14091 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14092 check_vector_cst (expected
, actual
);
14095 /* Check that VECTOR_CST ACTUAL contains NPATTERNS foreground elements
14096 and NPATTERNS background elements, and that its elements match
14100 check_vector_cst_fill (vec
<tree
> expected
, tree actual
,
14101 unsigned int npatterns
)
14103 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14104 ASSERT_EQ (2, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14105 ASSERT_EQ (2 * npatterns
, vector_cst_encoded_nelts (actual
));
14106 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14107 ASSERT_FALSE (VECTOR_CST_STEPPED_P (actual
));
14108 check_vector_cst (expected
, actual
);
14111 /* Check that VECTOR_CST ACTUAL contains NPATTERNS stepped patterns,
14112 and that its elements match EXPECTED. */
14115 check_vector_cst_stepped (vec
<tree
> expected
, tree actual
,
14116 unsigned int npatterns
)
14118 ASSERT_EQ (npatterns
, VECTOR_CST_NPATTERNS (actual
));
14119 ASSERT_EQ (3, VECTOR_CST_NELTS_PER_PATTERN (actual
));
14120 ASSERT_EQ (3 * npatterns
, vector_cst_encoded_nelts (actual
));
14121 ASSERT_FALSE (VECTOR_CST_DUPLICATE_P (actual
));
14122 ASSERT_TRUE (VECTOR_CST_STEPPED_P (actual
));
14123 check_vector_cst (expected
, actual
);
14126 /* Test the creation of VECTOR_CSTs. */
14129 test_vector_cst_patterns ()
14131 auto_vec
<tree
, 8> elements (8);
14132 elements
.quick_grow (8);
14133 tree element_type
= build_nonstandard_integer_type (16, true);
14134 tree vector_type
= build_vector_type (element_type
, 8);
14136 /* Test a simple linear series with a base of 0 and a step of 1:
14137 { 0, 1, 2, 3, 4, 5, 6, 7 }. */
14138 for (unsigned int i
= 0; i
< 8; ++i
)
14139 elements
[i
] = build_int_cst (element_type
, i
);
14140 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14142 /* Try the same with the first element replaced by 100:
14143 { 100, 1, 2, 3, 4, 5, 6, 7 }. */
14144 elements
[0] = build_int_cst (element_type
, 100);
14145 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14147 /* Try a series that wraps around.
14148 { 100, 65531, 65532, 65533, 65534, 65535, 0, 1 }. */
14149 for (unsigned int i
= 1; i
< 8; ++i
)
14150 elements
[i
] = build_int_cst (element_type
, (65530 + i
) & 0xffff);
14151 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14153 /* Try a downward series:
14154 { 100, 79, 78, 77, 76, 75, 75, 73 }. */
14155 for (unsigned int i
= 1; i
< 8; ++i
)
14156 elements
[i
] = build_int_cst (element_type
, 80 - i
);
14157 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 1);
14159 /* Try two interleaved series with different bases and steps:
14160 { 100, 53, 66, 206, 62, 212, 58, 218 }. */
14161 elements
[1] = build_int_cst (element_type
, 53);
14162 for (unsigned int i
= 2; i
< 8; i
+= 2)
14164 elements
[i
] = build_int_cst (element_type
, 70 - i
* 2);
14165 elements
[i
+ 1] = build_int_cst (element_type
, 200 + i
* 3);
14167 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14169 /* Try a duplicated value:
14170 { 100, 100, 100, 100, 100, 100, 100, 100 }. */
14171 for (unsigned int i
= 1; i
< 8; ++i
)
14172 elements
[i
] = elements
[0];
14173 check_vector_cst_duplicate (elements
,
14174 build_vector (vector_type
, elements
), 1);
14176 /* Try an interleaved duplicated value:
14177 { 100, 55, 100, 55, 100, 55, 100, 55 }. */
14178 elements
[1] = build_int_cst (element_type
, 55);
14179 for (unsigned int i
= 2; i
< 8; ++i
)
14180 elements
[i
] = elements
[i
- 2];
14181 check_vector_cst_duplicate (elements
,
14182 build_vector (vector_type
, elements
), 2);
14184 /* Try a duplicated value with 2 exceptions
14185 { 41, 97, 100, 55, 100, 55, 100, 55 }. */
14186 elements
[0] = build_int_cst (element_type
, 41);
14187 elements
[1] = build_int_cst (element_type
, 97);
14188 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 2);
14190 /* Try with and without a step
14191 { 41, 97, 100, 21, 100, 35, 100, 49 }. */
14192 for (unsigned int i
= 3; i
< 8; i
+= 2)
14193 elements
[i
] = build_int_cst (element_type
, i
* 7);
14194 check_vector_cst_stepped (elements
, build_vector (vector_type
, elements
), 2);
14196 /* Try a fully-general constant:
14197 { 41, 97, 100, 21, 100, 9990, 100, 49 }. */
14198 elements
[5] = build_int_cst (element_type
, 9990);
14199 check_vector_cst_fill (elements
, build_vector (vector_type
, elements
), 4);
14202 /* Run all of the selftests within this file. */
14207 test_integer_constants ();
14208 test_identifiers ();
14210 test_vector_cst_patterns ();
14213 } // namespace selftest
14215 #endif /* CHECKING_P */
14217 #include "gt-tree.h"