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"
70 /* Tree code classes. */
72 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
73 #define END_OF_BASE_TREE_CODES tcc_exceptional,
75 const enum tree_code_class tree_code_type
[] = {
76 #include "all-tree.def"
80 #undef END_OF_BASE_TREE_CODES
82 /* Table indexed by tree code giving number of expression
83 operands beyond the fixed part of the node structure.
84 Not used for types or decls. */
86 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
87 #define END_OF_BASE_TREE_CODES 0,
89 const unsigned char tree_code_length
[] = {
90 #include "all-tree.def"
94 #undef END_OF_BASE_TREE_CODES
96 /* Names of tree components.
97 Used for printing out the tree and error messages. */
98 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
99 #define END_OF_BASE_TREE_CODES "@dummy",
101 static const char *const tree_code_name
[] = {
102 #include "all-tree.def"
106 #undef END_OF_BASE_TREE_CODES
108 /* Each tree code class has an associated string representation.
109 These must correspond to the tree_code_class entries. */
111 const char *const tree_code_class_strings
[] =
126 /* obstack.[ch] explicitly declined to prototype this. */
127 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
129 /* Statistics-gathering stuff. */
131 static int tree_code_counts
[MAX_TREE_CODES
];
132 int tree_node_counts
[(int) all_kinds
];
133 int tree_node_sizes
[(int) all_kinds
];
135 /* Keep in sync with tree.h:enum tree_node_kind. */
136 static const char * const tree_node_kind_names
[] = {
155 /* Unique id for next decl created. */
156 static GTY(()) int next_decl_uid
;
157 /* Unique id for next type created. */
158 static GTY(()) unsigned next_type_uid
= 1;
159 /* Unique id for next debug decl created. Use negative numbers,
160 to catch erroneous uses. */
161 static GTY(()) int next_debug_decl_uid
;
163 /* Since we cannot rehash a type after it is in the table, we have to
164 keep the hash code. */
166 struct GTY((for_user
)) type_hash
{
171 /* Initial size of the hash table (rounded to next prime). */
172 #define TYPE_HASH_INITIAL_SIZE 1000
174 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
176 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
177 static bool equal (type_hash
*a
, type_hash
*b
);
180 keep_cache_entry (type_hash
*&t
)
182 return ggc_marked_p (t
->type
);
186 /* Now here is the hash table. When recording a type, it is added to
187 the slot whose index is the hash code. Note that the hash table is
188 used for several kinds of types (function types, array types and
189 array index range types, for now). While all these live in the
190 same table, they are completely independent, and the hash code is
191 computed differently for each of these. */
193 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
195 /* Hash table and temporary node for larger integer const values. */
196 static GTY (()) tree int_cst_node
;
198 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
200 static hashval_t
hash (tree t
);
201 static bool equal (tree x
, tree y
);
204 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
206 /* Hash table for optimization flags and target option flags. Use the same
207 hash table for both sets of options. Nodes for building the current
208 optimization and target option nodes. The assumption is most of the time
209 the options created will already be in the hash table, so we avoid
210 allocating and freeing up a node repeatably. */
211 static GTY (()) tree cl_optimization_node
;
212 static GTY (()) tree cl_target_option_node
;
214 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
216 static hashval_t
hash (tree t
);
217 static bool equal (tree x
, tree y
);
220 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
222 /* General tree->tree mapping structure for use in hash tables. */
226 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
229 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
231 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
233 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
236 equal (tree_vec_map
*a
, tree_vec_map
*b
)
238 return a
->base
.from
== b
->base
.from
;
242 keep_cache_entry (tree_vec_map
*&m
)
244 return ggc_marked_p (m
->base
.from
);
249 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
251 static void set_type_quals (tree
, int);
252 static void print_type_hash_statistics (void);
253 static void print_debug_expr_statistics (void);
254 static void print_value_expr_statistics (void);
256 tree global_trees
[TI_MAX
];
257 tree integer_types
[itk_none
];
259 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
260 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
262 bool tree_contains_struct
[MAX_TREE_CODES
][64];
264 /* Number of operands for each OpenMP clause. */
265 unsigned const char omp_clause_num_ops
[] =
267 0, /* OMP_CLAUSE_ERROR */
268 1, /* OMP_CLAUSE_PRIVATE */
269 1, /* OMP_CLAUSE_SHARED */
270 1, /* OMP_CLAUSE_FIRSTPRIVATE */
271 2, /* OMP_CLAUSE_LASTPRIVATE */
272 5, /* OMP_CLAUSE_REDUCTION */
273 1, /* OMP_CLAUSE_COPYIN */
274 1, /* OMP_CLAUSE_COPYPRIVATE */
275 3, /* OMP_CLAUSE_LINEAR */
276 2, /* OMP_CLAUSE_ALIGNED */
277 1, /* OMP_CLAUSE_DEPEND */
278 1, /* OMP_CLAUSE_UNIFORM */
279 1, /* OMP_CLAUSE_TO_DECLARE */
280 1, /* OMP_CLAUSE_LINK */
281 2, /* OMP_CLAUSE_FROM */
282 2, /* OMP_CLAUSE_TO */
283 2, /* OMP_CLAUSE_MAP */
284 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
285 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
286 2, /* OMP_CLAUSE__CACHE_ */
287 2, /* OMP_CLAUSE_GANG */
288 1, /* OMP_CLAUSE_ASYNC */
289 1, /* OMP_CLAUSE_WAIT */
290 0, /* OMP_CLAUSE_AUTO */
291 0, /* OMP_CLAUSE_SEQ */
292 1, /* OMP_CLAUSE__LOOPTEMP_ */
293 1, /* OMP_CLAUSE_IF */
294 1, /* OMP_CLAUSE_NUM_THREADS */
295 1, /* OMP_CLAUSE_SCHEDULE */
296 0, /* OMP_CLAUSE_NOWAIT */
297 1, /* OMP_CLAUSE_ORDERED */
298 0, /* OMP_CLAUSE_DEFAULT */
299 3, /* OMP_CLAUSE_COLLAPSE */
300 0, /* OMP_CLAUSE_UNTIED */
301 1, /* OMP_CLAUSE_FINAL */
302 0, /* OMP_CLAUSE_MERGEABLE */
303 1, /* OMP_CLAUSE_DEVICE */
304 1, /* OMP_CLAUSE_DIST_SCHEDULE */
305 0, /* OMP_CLAUSE_INBRANCH */
306 0, /* OMP_CLAUSE_NOTINBRANCH */
307 1, /* OMP_CLAUSE_NUM_TEAMS */
308 1, /* OMP_CLAUSE_THREAD_LIMIT */
309 0, /* OMP_CLAUSE_PROC_BIND */
310 1, /* OMP_CLAUSE_SAFELEN */
311 1, /* OMP_CLAUSE_SIMDLEN */
312 0, /* OMP_CLAUSE_FOR */
313 0, /* OMP_CLAUSE_PARALLEL */
314 0, /* OMP_CLAUSE_SECTIONS */
315 0, /* OMP_CLAUSE_TASKGROUP */
316 1, /* OMP_CLAUSE_PRIORITY */
317 1, /* OMP_CLAUSE_GRAINSIZE */
318 1, /* OMP_CLAUSE_NUM_TASKS */
319 0, /* OMP_CLAUSE_NOGROUP */
320 0, /* OMP_CLAUSE_THREADS */
321 0, /* OMP_CLAUSE_SIMD */
322 1, /* OMP_CLAUSE_HINT */
323 0, /* OMP_CLAUSE_DEFALTMAP */
324 1, /* OMP_CLAUSE__SIMDUID_ */
325 0, /* OMP_CLAUSE__SIMT_ */
326 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
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
[] =
410 /* Return the tree node structure used by tree code CODE. */
412 static inline enum tree_node_structure_enum
413 tree_node_structure_for_code (enum tree_code code
)
415 switch (TREE_CODE_CLASS (code
))
417 case tcc_declaration
:
422 return TS_FIELD_DECL
;
428 return TS_LABEL_DECL
;
430 return TS_RESULT_DECL
;
431 case DEBUG_EXPR_DECL
:
434 return TS_CONST_DECL
;
438 return TS_FUNCTION_DECL
;
439 case TRANSLATION_UNIT_DECL
:
440 return TS_TRANSLATION_UNIT_DECL
;
442 return TS_DECL_NON_COMMON
;
446 return TS_TYPE_NON_COMMON
;
455 default: /* tcc_constant and tcc_exceptional */
460 /* tcc_constant cases. */
461 case VOID_CST
: return TS_TYPED
;
462 case INTEGER_CST
: return TS_INT_CST
;
463 case REAL_CST
: return TS_REAL_CST
;
464 case FIXED_CST
: return TS_FIXED_CST
;
465 case COMPLEX_CST
: return TS_COMPLEX
;
466 case VECTOR_CST
: return TS_VECTOR
;
467 case STRING_CST
: return TS_STRING
;
468 /* tcc_exceptional cases. */
469 case ERROR_MARK
: return TS_COMMON
;
470 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
471 case TREE_LIST
: return TS_LIST
;
472 case TREE_VEC
: return TS_VEC
;
473 case SSA_NAME
: return TS_SSA_NAME
;
474 case PLACEHOLDER_EXPR
: return TS_COMMON
;
475 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
476 case BLOCK
: return TS_BLOCK
;
477 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
478 case TREE_BINFO
: return TS_BINFO
;
479 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
480 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
481 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
489 /* Initialize tree_contains_struct to describe the hierarchy of tree
493 initialize_tree_contains_struct (void)
497 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
500 enum tree_node_structure_enum ts_code
;
502 code
= (enum tree_code
) i
;
503 ts_code
= tree_node_structure_for_code (code
);
505 /* Mark the TS structure itself. */
506 tree_contains_struct
[code
][ts_code
] = 1;
508 /* Mark all the structures that TS is derived from. */
513 case TS_OPTIMIZATION
:
514 case TS_TARGET_OPTION
:
528 case TS_STATEMENT_LIST
:
529 MARK_TS_TYPED (code
);
533 case TS_DECL_MINIMAL
:
539 MARK_TS_COMMON (code
);
542 case TS_TYPE_WITH_LANG_SPECIFIC
:
543 MARK_TS_TYPE_COMMON (code
);
546 case TS_TYPE_NON_COMMON
:
547 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
551 MARK_TS_DECL_MINIMAL (code
);
556 MARK_TS_DECL_COMMON (code
);
559 case TS_DECL_NON_COMMON
:
560 MARK_TS_DECL_WITH_VIS (code
);
563 case TS_DECL_WITH_VIS
:
567 MARK_TS_DECL_WRTL (code
);
571 MARK_TS_DECL_COMMON (code
);
575 MARK_TS_DECL_WITH_VIS (code
);
579 case TS_FUNCTION_DECL
:
580 MARK_TS_DECL_NON_COMMON (code
);
583 case TS_TRANSLATION_UNIT_DECL
:
584 MARK_TS_DECL_COMMON (code
);
592 /* Basic consistency checks for attributes used in fold. */
593 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
594 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
595 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
601 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
602 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
603 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
604 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
606 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
607 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
608 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
609 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
615 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
616 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
617 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
618 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
619 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
620 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
621 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
622 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
623 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
624 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
625 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
626 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
627 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
628 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
629 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
630 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
631 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
632 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
641 /* Initialize the hash table of types. */
643 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
646 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
649 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
651 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
653 int_cst_node
= make_int_cst (1, 1);
655 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
657 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
658 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
660 /* Initialize the tree_contains_struct array. */
661 initialize_tree_contains_struct ();
662 lang_hooks
.init_ts ();
666 /* The name of the object as the assembler will see it (but before any
667 translations made by ASM_OUTPUT_LABELREF). Often this is the same
668 as DECL_NAME. It is an IDENTIFIER_NODE. */
670 decl_assembler_name (tree decl
)
672 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
673 lang_hooks
.set_decl_assembler_name (decl
);
674 return DECL_ASSEMBLER_NAME_RAW (decl
);
677 /* When the target supports COMDAT groups, this indicates which group the
678 DECL is associated with. This can be either an IDENTIFIER_NODE or a
679 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
681 decl_comdat_group (const_tree node
)
683 struct symtab_node
*snode
= symtab_node::get (node
);
686 return snode
->get_comdat_group ();
689 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
691 decl_comdat_group_id (const_tree node
)
693 struct symtab_node
*snode
= symtab_node::get (node
);
696 return snode
->get_comdat_group_id ();
699 /* When the target supports named section, return its name as IDENTIFIER_NODE
700 or NULL if it is in no section. */
702 decl_section_name (const_tree node
)
704 struct symtab_node
*snode
= symtab_node::get (node
);
707 return snode
->get_section ();
710 /* Set section name of NODE to VALUE (that is expected to be
713 set_decl_section_name (tree node
, const char *value
)
715 struct symtab_node
*snode
;
719 snode
= symtab_node::get (node
);
723 else if (VAR_P (node
))
724 snode
= varpool_node::get_create (node
);
726 snode
= cgraph_node::get_create (node
);
727 snode
->set_section (value
);
730 /* Return TLS model of a variable NODE. */
732 decl_tls_model (const_tree node
)
734 struct varpool_node
*snode
= varpool_node::get (node
);
736 return TLS_MODEL_NONE
;
737 return snode
->tls_model
;
740 /* Set TLS model of variable NODE to MODEL. */
742 set_decl_tls_model (tree node
, enum tls_model model
)
744 struct varpool_node
*vnode
;
746 if (model
== TLS_MODEL_NONE
)
748 vnode
= varpool_node::get (node
);
753 vnode
= varpool_node::get_create (node
);
754 vnode
->tls_model
= model
;
757 /* Compute the number of bytes occupied by a tree with code CODE.
758 This function cannot be used for nodes that have variable sizes,
759 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
761 tree_code_size (enum tree_code code
)
763 switch (TREE_CODE_CLASS (code
))
765 case tcc_declaration
: /* A decl node */
770 return sizeof (struct tree_field_decl
);
772 return sizeof (struct tree_parm_decl
);
774 return sizeof (struct tree_var_decl
);
776 return sizeof (struct tree_label_decl
);
778 return sizeof (struct tree_result_decl
);
780 return sizeof (struct tree_const_decl
);
782 return sizeof (struct tree_type_decl
);
784 return sizeof (struct tree_function_decl
);
785 case DEBUG_EXPR_DECL
:
786 return sizeof (struct tree_decl_with_rtl
);
787 case TRANSLATION_UNIT_DECL
:
788 return sizeof (struct tree_translation_unit_decl
);
792 return sizeof (struct tree_decl_non_common
);
794 return lang_hooks
.tree_size (code
);
798 case tcc_type
: /* a type node */
799 return sizeof (struct tree_type_non_common
);
801 case tcc_reference
: /* a reference */
802 case tcc_expression
: /* an expression */
803 case tcc_statement
: /* an expression with side effects */
804 case tcc_comparison
: /* a comparison expression */
805 case tcc_unary
: /* a unary arithmetic expression */
806 case tcc_binary
: /* a binary arithmetic expression */
807 return (sizeof (struct tree_exp
)
808 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
810 case tcc_constant
: /* a constant */
813 case VOID_CST
: return sizeof (struct tree_typed
);
814 case INTEGER_CST
: gcc_unreachable ();
815 case REAL_CST
: return sizeof (struct tree_real_cst
);
816 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
817 case COMPLEX_CST
: return sizeof (struct tree_complex
);
818 case VECTOR_CST
: return sizeof (struct tree_vector
);
819 case STRING_CST
: gcc_unreachable ();
821 return lang_hooks
.tree_size (code
);
824 case tcc_exceptional
: /* something random, like an identifier. */
827 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
828 case TREE_LIST
: return sizeof (struct tree_list
);
831 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
834 case OMP_CLAUSE
: gcc_unreachable ();
836 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
838 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
839 case BLOCK
: return sizeof (struct tree_block
);
840 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
841 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
842 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
845 return lang_hooks
.tree_size (code
);
853 /* Compute the number of bytes occupied by NODE. This routine only
854 looks at TREE_CODE, except for those nodes that have variable sizes. */
856 tree_size (const_tree node
)
858 const enum tree_code code
= TREE_CODE (node
);
862 return (sizeof (struct tree_int_cst
)
863 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
866 return (offsetof (struct tree_binfo
, base_binfos
)
868 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
871 return (sizeof (struct tree_vec
)
872 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
875 return (sizeof (struct tree_vector
)
876 + (VECTOR_CST_NELTS (node
) - 1) * sizeof (tree
));
879 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
882 return (sizeof (struct tree_omp_clause
)
883 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
887 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
888 return (sizeof (struct tree_exp
)
889 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
891 return tree_code_size (code
);
895 /* Record interesting allocation statistics for a tree node with CODE
899 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
900 size_t length ATTRIBUTE_UNUSED
)
902 enum tree_code_class type
= TREE_CODE_CLASS (code
);
905 if (!GATHER_STATISTICS
)
910 case tcc_declaration
: /* A decl node */
914 case tcc_type
: /* a type node */
918 case tcc_statement
: /* an expression with side effects */
922 case tcc_reference
: /* a reference */
926 case tcc_expression
: /* an expression */
927 case tcc_comparison
: /* a comparison expression */
928 case tcc_unary
: /* a unary arithmetic expression */
929 case tcc_binary
: /* a binary arithmetic expression */
933 case tcc_constant
: /* a constant */
937 case tcc_exceptional
: /* something random, like an identifier. */
940 case IDENTIFIER_NODE
:
953 kind
= ssa_name_kind
;
965 kind
= omp_clause_kind
;
982 tree_code_counts
[(int) code
]++;
983 tree_node_counts
[(int) kind
]++;
984 tree_node_sizes
[(int) kind
] += length
;
987 /* Allocate and return a new UID from the DECL_UID namespace. */
990 allocate_decl_uid (void)
992 return next_decl_uid
++;
995 /* Return a newly allocated node of code CODE. For decl and type
996 nodes, some other fields are initialized. The rest of the node is
997 initialized to zero. This function cannot be used for TREE_VEC,
998 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
1001 Achoo! I got a code in the node. */
1004 make_node (enum tree_code code MEM_STAT_DECL
)
1007 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1008 size_t length
= tree_code_size (code
);
1010 record_node_allocation_statistics (code
, length
);
1012 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1013 TREE_SET_CODE (t
, code
);
1018 TREE_SIDE_EFFECTS (t
) = 1;
1021 case tcc_declaration
:
1022 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1024 if (code
== FUNCTION_DECL
)
1026 SET_DECL_ALIGN (t
, FUNCTION_ALIGNMENT (FUNCTION_BOUNDARY
));
1027 SET_DECL_MODE (t
, FUNCTION_MODE
);
1030 SET_DECL_ALIGN (t
, 1);
1032 DECL_SOURCE_LOCATION (t
) = input_location
;
1033 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1034 DECL_UID (t
) = --next_debug_decl_uid
;
1037 DECL_UID (t
) = allocate_decl_uid ();
1038 SET_DECL_PT_UID (t
, -1);
1040 if (TREE_CODE (t
) == LABEL_DECL
)
1041 LABEL_DECL_UID (t
) = -1;
1046 TYPE_UID (t
) = next_type_uid
++;
1047 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1048 TYPE_USER_ALIGN (t
) = 0;
1049 TYPE_MAIN_VARIANT (t
) = t
;
1050 TYPE_CANONICAL (t
) = t
;
1052 /* Default to no attributes for type, but let target change that. */
1053 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1054 targetm
.set_default_type_attributes (t
);
1056 /* We have not yet computed the alias set for this type. */
1057 TYPE_ALIAS_SET (t
) = -1;
1061 TREE_CONSTANT (t
) = 1;
1064 case tcc_expression
:
1070 case PREDECREMENT_EXPR
:
1071 case PREINCREMENT_EXPR
:
1072 case POSTDECREMENT_EXPR
:
1073 case POSTINCREMENT_EXPR
:
1074 /* All of these have side-effects, no matter what their
1076 TREE_SIDE_EFFECTS (t
) = 1;
1084 case tcc_exceptional
:
1087 case TARGET_OPTION_NODE
:
1088 TREE_TARGET_OPTION(t
)
1089 = ggc_cleared_alloc
<struct cl_target_option
> ();
1092 case OPTIMIZATION_NODE
:
1093 TREE_OPTIMIZATION (t
)
1094 = ggc_cleared_alloc
<struct cl_optimization
> ();
1103 /* Other classes need no special treatment. */
1110 /* Free tree node. */
1113 free_node (tree node
)
1115 enum tree_code code
= TREE_CODE (node
);
1116 if (GATHER_STATISTICS
)
1118 tree_code_counts
[(int) TREE_CODE (node
)]--;
1119 tree_node_counts
[(int) t_kind
]--;
1120 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1122 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1123 vec_free (CONSTRUCTOR_ELTS (node
));
1124 else if (code
== BLOCK
)
1125 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1126 else if (code
== TREE_BINFO
)
1127 vec_free (BINFO_BASE_ACCESSES (node
));
1131 /* Return a new node with the same contents as NODE except that its
1132 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1135 copy_node (tree node MEM_STAT_DECL
)
1138 enum tree_code code
= TREE_CODE (node
);
1141 gcc_assert (code
!= STATEMENT_LIST
);
1143 length
= tree_size (node
);
1144 record_node_allocation_statistics (code
, length
);
1145 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1146 memcpy (t
, node
, length
);
1148 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1150 TREE_ASM_WRITTEN (t
) = 0;
1151 TREE_VISITED (t
) = 0;
1153 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1155 if (code
== DEBUG_EXPR_DECL
)
1156 DECL_UID (t
) = --next_debug_decl_uid
;
1159 DECL_UID (t
) = allocate_decl_uid ();
1160 if (DECL_PT_UID_SET_P (node
))
1161 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1163 if ((TREE_CODE (node
) == PARM_DECL
|| VAR_P (node
))
1164 && DECL_HAS_VALUE_EXPR_P (node
))
1166 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1167 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1169 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1172 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1173 t
->decl_with_vis
.symtab_node
= NULL
;
1175 if (VAR_P (node
) && DECL_HAS_INIT_PRIORITY_P (node
))
1177 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1178 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1180 if (TREE_CODE (node
) == FUNCTION_DECL
)
1182 DECL_STRUCT_FUNCTION (t
) = NULL
;
1183 t
->decl_with_vis
.symtab_node
= NULL
;
1186 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1188 TYPE_UID (t
) = next_type_uid
++;
1189 /* The following is so that the debug code for
1190 the copy is different from the original type.
1191 The two statements usually duplicate each other
1192 (because they clear fields of the same union),
1193 but the optimizer should catch that. */
1194 TYPE_SYMTAB_POINTER (t
) = 0;
1195 TYPE_SYMTAB_ADDRESS (t
) = 0;
1197 /* Do not copy the values cache. */
1198 if (TYPE_CACHED_VALUES_P (t
))
1200 TYPE_CACHED_VALUES_P (t
) = 0;
1201 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1204 else if (code
== TARGET_OPTION_NODE
)
1206 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1207 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1208 sizeof (struct cl_target_option
));
1210 else if (code
== OPTIMIZATION_NODE
)
1212 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1213 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1214 sizeof (struct cl_optimization
));
1220 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1221 For example, this can copy a list made of TREE_LIST nodes. */
1224 copy_list (tree list
)
1232 head
= prev
= copy_node (list
);
1233 next
= TREE_CHAIN (list
);
1236 TREE_CHAIN (prev
) = copy_node (next
);
1237 prev
= TREE_CHAIN (prev
);
1238 next
= TREE_CHAIN (next
);
1244 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1245 INTEGER_CST with value CST and type TYPE. */
1248 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1250 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1251 /* We need extra HWIs if CST is an unsigned integer with its
1253 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1254 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1255 return cst
.get_len ();
1258 /* Return a new INTEGER_CST with value CST and type TYPE. */
1261 build_new_int_cst (tree type
, const wide_int
&cst
)
1263 unsigned int len
= cst
.get_len ();
1264 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1265 tree nt
= make_int_cst (len
, ext_len
);
1270 TREE_INT_CST_ELT (nt
, ext_len
)
1271 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1272 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1273 TREE_INT_CST_ELT (nt
, i
) = -1;
1275 else if (TYPE_UNSIGNED (type
)
1276 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1279 TREE_INT_CST_ELT (nt
, len
)
1280 = zext_hwi (cst
.elt (len
),
1281 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1284 for (unsigned int i
= 0; i
< len
; i
++)
1285 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1286 TREE_TYPE (nt
) = type
;
1290 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1293 build_int_cst (tree type
, HOST_WIDE_INT low
)
1295 /* Support legacy code. */
1297 type
= integer_type_node
;
1299 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1303 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1305 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1308 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1311 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1314 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1317 /* Constructs tree in type TYPE from with value given by CST. Signedness
1318 of CST is assumed to be the same as the signedness of TYPE. */
1321 double_int_to_tree (tree type
, double_int cst
)
1323 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1326 /* We force the wide_int CST to the range of the type TYPE by sign or
1327 zero extending it. OVERFLOWABLE indicates if we are interested in
1328 overflow of the value, when >0 we are only interested in signed
1329 overflow, for <0 we are interested in any overflow. OVERFLOWED
1330 indicates whether overflow has already occurred. CONST_OVERFLOWED
1331 indicates whether constant overflow has already occurred. We force
1332 T's value to be within range of T's type (by setting to 0 or 1 all
1333 the bits outside the type's range). We set TREE_OVERFLOWED if,
1334 OVERFLOWED is nonzero,
1335 or OVERFLOWABLE is >0 and signed overflow occurs
1336 or OVERFLOWABLE is <0 and any overflow occurs
1337 We return a new tree node for the extended wide_int. The node
1338 is shared if no overflow flags are set. */
1342 force_fit_type (tree type
, const wide_int_ref
&cst
,
1343 int overflowable
, bool overflowed
)
1345 signop sign
= TYPE_SIGN (type
);
1347 /* If we need to set overflow flags, return a new unshared node. */
1348 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1352 || (overflowable
> 0 && sign
== SIGNED
))
1354 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1355 tree t
= build_new_int_cst (type
, tmp
);
1356 TREE_OVERFLOW (t
) = 1;
1361 /* Else build a shared node. */
1362 return wide_int_to_tree (type
, cst
);
1365 /* These are the hash table functions for the hash table of INTEGER_CST
1366 nodes of a sizetype. */
1368 /* Return the hash code X, an INTEGER_CST. */
1371 int_cst_hasher::hash (tree x
)
1373 const_tree
const t
= x
;
1374 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1377 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1378 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1383 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1384 is the same as that given by *Y, which is the same. */
1387 int_cst_hasher::equal (tree x
, tree y
)
1389 const_tree
const xt
= x
;
1390 const_tree
const yt
= y
;
1392 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1393 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1394 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1397 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1398 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1404 /* Create an INT_CST node of TYPE and value CST.
1405 The returned node is always shared. For small integers we use a
1406 per-type vector cache, for larger ones we use a single hash table.
1407 The value is extended from its precision according to the sign of
1408 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1409 the upper bits and ensures that hashing and value equality based
1410 upon the underlying HOST_WIDE_INTs works without masking. */
1413 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1420 unsigned int prec
= TYPE_PRECISION (type
);
1421 signop sgn
= TYPE_SIGN (type
);
1423 /* Verify that everything is canonical. */
1424 int l
= pcst
.get_len ();
1427 if (pcst
.elt (l
- 1) == 0)
1428 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1429 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1430 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1433 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1434 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1438 /* We just need to store a single HOST_WIDE_INT. */
1440 if (TYPE_UNSIGNED (type
))
1441 hwi
= cst
.to_uhwi ();
1443 hwi
= cst
.to_shwi ();
1445 switch (TREE_CODE (type
))
1448 gcc_assert (hwi
== 0);
1452 case REFERENCE_TYPE
:
1453 case POINTER_BOUNDS_TYPE
:
1454 /* Cache NULL pointer and zero bounds. */
1463 /* Cache false or true. */
1465 if (IN_RANGE (hwi
, 0, 1))
1471 if (TYPE_SIGN (type
) == UNSIGNED
)
1474 limit
= INTEGER_SHARE_LIMIT
;
1475 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1480 /* Cache [-1, N). */
1481 limit
= INTEGER_SHARE_LIMIT
+ 1;
1482 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1496 /* Look for it in the type's vector of small shared ints. */
1497 if (!TYPE_CACHED_VALUES_P (type
))
1499 TYPE_CACHED_VALUES_P (type
) = 1;
1500 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1503 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1505 /* Make sure no one is clobbering the shared constant. */
1506 gcc_checking_assert (TREE_TYPE (t
) == type
1507 && TREE_INT_CST_NUNITS (t
) == 1
1508 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1509 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1510 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1513 /* Create a new shared int. */
1514 t
= build_new_int_cst (type
, cst
);
1515 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1520 /* Use the cache of larger shared ints, using int_cst_node as
1523 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1524 TREE_TYPE (int_cst_node
) = type
;
1526 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1530 /* Insert this one into the hash table. */
1533 /* Make a new node for next time round. */
1534 int_cst_node
= make_int_cst (1, 1);
1540 /* The value either hashes properly or we drop it on the floor
1541 for the gc to take care of. There will not be enough of them
1544 tree nt
= build_new_int_cst (type
, cst
);
1545 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1549 /* Insert this one into the hash table. */
1559 cache_integer_cst (tree t
)
1561 tree type
= TREE_TYPE (t
);
1564 int prec
= TYPE_PRECISION (type
);
1566 gcc_assert (!TREE_OVERFLOW (t
));
1568 switch (TREE_CODE (type
))
1571 gcc_assert (integer_zerop (t
));
1575 case REFERENCE_TYPE
:
1576 /* Cache NULL pointer. */
1577 if (integer_zerop (t
))
1585 /* Cache false or true. */
1587 if (wi::ltu_p (wi::to_wide (t
), 2))
1588 ix
= TREE_INT_CST_ELT (t
, 0);
1593 if (TYPE_UNSIGNED (type
))
1596 limit
= INTEGER_SHARE_LIMIT
;
1598 /* This is a little hokie, but if the prec is smaller than
1599 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1600 obvious test will not get the correct answer. */
1601 if (prec
< HOST_BITS_PER_WIDE_INT
)
1603 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1604 ix
= tree_to_uhwi (t
);
1606 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1607 ix
= tree_to_uhwi (t
);
1612 limit
= INTEGER_SHARE_LIMIT
+ 1;
1614 if (integer_minus_onep (t
))
1616 else if (!wi::neg_p (wi::to_wide (t
)))
1618 if (prec
< HOST_BITS_PER_WIDE_INT
)
1620 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1621 ix
= tree_to_shwi (t
) + 1;
1623 else if (wi::ltu_p (wi::to_wide (t
), INTEGER_SHARE_LIMIT
))
1624 ix
= tree_to_shwi (t
) + 1;
1638 /* Look for it in the type's vector of small shared ints. */
1639 if (!TYPE_CACHED_VALUES_P (type
))
1641 TYPE_CACHED_VALUES_P (type
) = 1;
1642 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1645 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1646 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1650 /* Use the cache of larger shared ints. */
1651 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1652 /* If there is already an entry for the number verify it's the
1655 gcc_assert (wi::to_wide (tree (*slot
)) == wi::to_wide (t
));
1657 /* Otherwise insert this one into the hash table. */
1663 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1664 and the rest are zeros. */
1667 build_low_bits_mask (tree type
, unsigned bits
)
1669 gcc_assert (bits
<= TYPE_PRECISION (type
));
1671 return wide_int_to_tree (type
, wi::mask (bits
, false,
1672 TYPE_PRECISION (type
)));
1675 /* Checks that X is integer constant that can be expressed in (unsigned)
1676 HOST_WIDE_INT without loss of precision. */
1679 cst_and_fits_in_hwi (const_tree x
)
1681 return (TREE_CODE (x
) == INTEGER_CST
1682 && (tree_fits_shwi_p (x
) || tree_fits_uhwi_p (x
)));
1685 /* Build a newly constructed VECTOR_CST node of length LEN. */
1688 make_vector (unsigned len MEM_STAT_DECL
)
1691 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1693 record_node_allocation_statistics (VECTOR_CST
, length
);
1695 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1697 TREE_SET_CODE (t
, VECTOR_CST
);
1698 TREE_CONSTANT (t
) = 1;
1699 VECTOR_CST_NELTS (t
) = len
;
1704 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1705 are given by VALS. */
1708 build_vector (tree type
, vec
<tree
> vals MEM_STAT_DECL
)
1710 unsigned int nelts
= vals
.length ();
1711 gcc_assert (nelts
== TYPE_VECTOR_SUBPARTS (type
));
1714 tree v
= make_vector (nelts
);
1715 TREE_TYPE (v
) = type
;
1717 /* Iterate through elements and check for overflow. */
1718 for (cnt
= 0; cnt
< nelts
; ++cnt
)
1720 tree value
= vals
[cnt
];
1722 VECTOR_CST_ELT (v
, cnt
) = value
;
1724 /* Don't crash if we get an address constant. */
1725 if (!CONSTANT_CLASS_P (value
))
1728 over
|= TREE_OVERFLOW (value
);
1731 TREE_OVERFLOW (v
) = over
;
1735 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1736 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1739 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1741 unsigned int nelts
= TYPE_VECTOR_SUBPARTS (type
);
1742 unsigned HOST_WIDE_INT idx
;
1745 auto_vec
<tree
, 32> vec (nelts
);
1746 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1748 if (TREE_CODE (value
) == VECTOR_CST
)
1749 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1750 vec
.quick_push (VECTOR_CST_ELT (value
, i
));
1752 vec
.quick_push (value
);
1754 while (vec
.length () < nelts
)
1755 vec
.quick_push (build_zero_cst (TREE_TYPE (type
)));
1757 return build_vector (type
, vec
);
1760 /* Build a vector of type VECTYPE where all the elements are SCs. */
1762 build_vector_from_val (tree vectype
, tree sc
)
1764 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1766 if (sc
== error_mark_node
)
1769 /* Verify that the vector type is suitable for SC. Note that there
1770 is some inconsistency in the type-system with respect to restrict
1771 qualifications of pointers. Vector types always have a main-variant
1772 element type and the qualification is applied to the vector-type.
1773 So TREE_TYPE (vector-type) does not return a properly qualified
1774 vector element-type. */
1775 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1776 TREE_TYPE (vectype
)));
1778 if (CONSTANT_CLASS_P (sc
))
1780 auto_vec
<tree
, 32> v (nunits
);
1781 for (i
= 0; i
< nunits
; ++i
)
1783 return build_vector (vectype
, v
);
1787 vec
<constructor_elt
, va_gc
> *v
;
1788 vec_alloc (v
, nunits
);
1789 for (i
= 0; i
< nunits
; ++i
)
1790 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1791 return build_constructor (vectype
, v
);
1795 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1796 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1799 recompute_constructor_flags (tree c
)
1803 bool constant_p
= true;
1804 bool side_effects_p
= false;
1805 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1807 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1809 /* Mostly ctors will have elts that don't have side-effects, so
1810 the usual case is to scan all the elements. Hence a single
1811 loop for both const and side effects, rather than one loop
1812 each (with early outs). */
1813 if (!TREE_CONSTANT (val
))
1815 if (TREE_SIDE_EFFECTS (val
))
1816 side_effects_p
= true;
1819 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1820 TREE_CONSTANT (c
) = constant_p
;
1823 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1827 verify_constructor_flags (tree c
)
1831 bool constant_p
= TREE_CONSTANT (c
);
1832 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1833 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1835 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1837 if (constant_p
&& !TREE_CONSTANT (val
))
1838 internal_error ("non-constant element in constant CONSTRUCTOR");
1839 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1840 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1844 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1845 are in the vec pointed to by VALS. */
1847 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1849 tree c
= make_node (CONSTRUCTOR
);
1851 TREE_TYPE (c
) = type
;
1852 CONSTRUCTOR_ELTS (c
) = vals
;
1854 recompute_constructor_flags (c
);
1859 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1862 build_constructor_single (tree type
, tree index
, tree value
)
1864 vec
<constructor_elt
, va_gc
> *v
;
1865 constructor_elt elt
= {index
, value
};
1868 v
->quick_push (elt
);
1870 return build_constructor (type
, v
);
1874 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1875 are in a list pointed to by VALS. */
1877 build_constructor_from_list (tree type
, tree vals
)
1880 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1884 vec_alloc (v
, list_length (vals
));
1885 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1886 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1889 return build_constructor (type
, v
);
1892 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1893 of elements, provided as index/value pairs. */
1896 build_constructor_va (tree type
, int nelts
, ...)
1898 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1901 va_start (p
, nelts
);
1902 vec_alloc (v
, nelts
);
1905 tree index
= va_arg (p
, tree
);
1906 tree value
= va_arg (p
, tree
);
1907 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1910 return build_constructor (type
, v
);
1913 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1916 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1919 FIXED_VALUE_TYPE
*fp
;
1921 v
= make_node (FIXED_CST
);
1922 fp
= ggc_alloc
<fixed_value
> ();
1923 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1925 TREE_TYPE (v
) = type
;
1926 TREE_FIXED_CST_PTR (v
) = fp
;
1930 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1933 build_real (tree type
, REAL_VALUE_TYPE d
)
1936 REAL_VALUE_TYPE
*dp
;
1939 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1940 Consider doing it via real_convert now. */
1942 v
= make_node (REAL_CST
);
1943 dp
= ggc_alloc
<real_value
> ();
1944 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1946 TREE_TYPE (v
) = type
;
1947 TREE_REAL_CST_PTR (v
) = dp
;
1948 TREE_OVERFLOW (v
) = overflow
;
1952 /* Like build_real, but first truncate D to the type. */
1955 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1957 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1960 /* Return a new REAL_CST node whose type is TYPE
1961 and whose value is the integer value of the INTEGER_CST node I. */
1964 real_value_from_int_cst (const_tree type
, const_tree i
)
1968 /* Clear all bits of the real value type so that we can later do
1969 bitwise comparisons to see if two values are the same. */
1970 memset (&d
, 0, sizeof d
);
1972 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, wi::to_wide (i
),
1973 TYPE_SIGN (TREE_TYPE (i
)));
1977 /* Given a tree representing an integer constant I, return a tree
1978 representing the same value as a floating-point constant of type TYPE. */
1981 build_real_from_int_cst (tree type
, const_tree i
)
1984 int overflow
= TREE_OVERFLOW (i
);
1986 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1988 TREE_OVERFLOW (v
) |= overflow
;
1992 /* Return a newly constructed STRING_CST node whose value is
1993 the LEN characters at STR.
1994 Note that for a C string literal, LEN should include the trailing NUL.
1995 The TREE_TYPE is not initialized. */
1998 build_string (int len
, const char *str
)
2003 /* Do not waste bytes provided by padding of struct tree_string. */
2004 length
= len
+ offsetof (struct tree_string
, str
) + 1;
2006 record_node_allocation_statistics (STRING_CST
, length
);
2008 s
= (tree
) ggc_internal_alloc (length
);
2010 memset (s
, 0, sizeof (struct tree_typed
));
2011 TREE_SET_CODE (s
, STRING_CST
);
2012 TREE_CONSTANT (s
) = 1;
2013 TREE_STRING_LENGTH (s
) = len
;
2014 memcpy (s
->string
.str
, str
, len
);
2015 s
->string
.str
[len
] = '\0';
2020 /* Return a newly constructed COMPLEX_CST node whose value is
2021 specified by the real and imaginary parts REAL and IMAG.
2022 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2023 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2026 build_complex (tree type
, tree real
, tree imag
)
2028 tree t
= make_node (COMPLEX_CST
);
2030 TREE_REALPART (t
) = real
;
2031 TREE_IMAGPART (t
) = imag
;
2032 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2033 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2037 /* Build a complex (inf +- 0i), such as for the result of cproj.
2038 TYPE is the complex tree type of the result. If NEG is true, the
2039 imaginary zero is negative. */
2042 build_complex_inf (tree type
, bool neg
)
2044 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2048 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2049 build_real (TREE_TYPE (type
), rzero
));
2052 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2053 element is set to 1. In particular, this is 1 + i for complex types. */
2056 build_each_one_cst (tree type
)
2058 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2060 tree scalar
= build_one_cst (TREE_TYPE (type
));
2061 return build_complex (type
, scalar
, scalar
);
2064 return build_one_cst (type
);
2067 /* Return a constant of arithmetic type TYPE which is the
2068 multiplicative identity of the set TYPE. */
2071 build_one_cst (tree type
)
2073 switch (TREE_CODE (type
))
2075 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2076 case POINTER_TYPE
: case REFERENCE_TYPE
:
2078 return build_int_cst (type
, 1);
2081 return build_real (type
, dconst1
);
2083 case FIXED_POINT_TYPE
:
2084 /* We can only generate 1 for accum types. */
2085 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2086 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2090 tree scalar
= build_one_cst (TREE_TYPE (type
));
2092 return build_vector_from_val (type
, scalar
);
2096 return build_complex (type
,
2097 build_one_cst (TREE_TYPE (type
)),
2098 build_zero_cst (TREE_TYPE (type
)));
2105 /* Return an integer of type TYPE containing all 1's in as much precision as
2106 it contains, or a complex or vector whose subparts are such integers. */
2109 build_all_ones_cst (tree type
)
2111 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2113 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2114 return build_complex (type
, scalar
, scalar
);
2117 return build_minus_one_cst (type
);
2120 /* Return a constant of arithmetic type TYPE which is the
2121 opposite of the multiplicative identity of the set TYPE. */
2124 build_minus_one_cst (tree type
)
2126 switch (TREE_CODE (type
))
2128 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2129 case POINTER_TYPE
: case REFERENCE_TYPE
:
2131 return build_int_cst (type
, -1);
2134 return build_real (type
, dconstm1
);
2136 case FIXED_POINT_TYPE
:
2137 /* We can only generate 1 for accum types. */
2138 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2139 return build_fixed (type
,
2140 fixed_from_double_int (double_int_minus_one
,
2141 SCALAR_TYPE_MODE (type
)));
2145 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2147 return build_vector_from_val (type
, scalar
);
2151 return build_complex (type
,
2152 build_minus_one_cst (TREE_TYPE (type
)),
2153 build_zero_cst (TREE_TYPE (type
)));
2160 /* Build 0 constant of type TYPE. This is used by constructor folding
2161 and thus the constant should be represented in memory by
2165 build_zero_cst (tree type
)
2167 switch (TREE_CODE (type
))
2169 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2170 case POINTER_TYPE
: case REFERENCE_TYPE
:
2171 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2172 return build_int_cst (type
, 0);
2175 return build_real (type
, dconst0
);
2177 case FIXED_POINT_TYPE
:
2178 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2182 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2184 return build_vector_from_val (type
, scalar
);
2189 tree zero
= build_zero_cst (TREE_TYPE (type
));
2191 return build_complex (type
, zero
, zero
);
2195 if (!AGGREGATE_TYPE_P (type
))
2196 return fold_convert (type
, integer_zero_node
);
2197 return build_constructor (type
, NULL
);
2202 /* Build a BINFO with LEN language slots. */
2205 make_tree_binfo (unsigned base_binfos MEM_STAT_DECL
)
2208 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2209 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2211 record_node_allocation_statistics (TREE_BINFO
, length
);
2213 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2215 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2217 TREE_SET_CODE (t
, TREE_BINFO
);
2219 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2224 /* Create a CASE_LABEL_EXPR tree node and return it. */
2227 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2229 tree t
= make_node (CASE_LABEL_EXPR
);
2231 TREE_TYPE (t
) = void_type_node
;
2232 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2234 CASE_LOW (t
) = low_value
;
2235 CASE_HIGH (t
) = high_value
;
2236 CASE_LABEL (t
) = label_decl
;
2237 CASE_CHAIN (t
) = NULL_TREE
;
2242 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2243 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2244 The latter determines the length of the HOST_WIDE_INT vector. */
2247 make_int_cst (int len
, int ext_len MEM_STAT_DECL
)
2250 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2251 + sizeof (struct tree_int_cst
));
2254 record_node_allocation_statistics (INTEGER_CST
, length
);
2256 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2258 TREE_SET_CODE (t
, INTEGER_CST
);
2259 TREE_INT_CST_NUNITS (t
) = len
;
2260 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2261 /* to_offset can only be applied to trees that are offset_int-sized
2262 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2263 must be exactly the precision of offset_int and so LEN is correct. */
2264 if (ext_len
<= OFFSET_INT_ELTS
)
2265 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2267 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2269 TREE_CONSTANT (t
) = 1;
2274 /* Build a newly constructed TREE_VEC node of length LEN. */
2277 make_tree_vec (int len MEM_STAT_DECL
)
2280 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2282 record_node_allocation_statistics (TREE_VEC
, length
);
2284 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2286 TREE_SET_CODE (t
, TREE_VEC
);
2287 TREE_VEC_LENGTH (t
) = len
;
2292 /* Grow a TREE_VEC node to new length LEN. */
2295 grow_tree_vec (tree v
, int len MEM_STAT_DECL
)
2297 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2299 int oldlen
= TREE_VEC_LENGTH (v
);
2300 gcc_assert (len
> oldlen
);
2302 size_t oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2303 size_t length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2305 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2307 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2309 TREE_VEC_LENGTH (v
) = len
;
2314 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2315 fixed, and scalar, complex or vector. */
2318 zerop (const_tree expr
)
2320 return (integer_zerop (expr
)
2321 || real_zerop (expr
)
2322 || fixed_zerop (expr
));
2325 /* Return 1 if EXPR is the integer constant zero or a complex constant
2329 integer_zerop (const_tree expr
)
2331 switch (TREE_CODE (expr
))
2334 return wi::to_wide (expr
) == 0;
2336 return (integer_zerop (TREE_REALPART (expr
))
2337 && integer_zerop (TREE_IMAGPART (expr
)));
2341 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2342 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2351 /* Return 1 if EXPR is the integer constant one or the corresponding
2352 complex constant. */
2355 integer_onep (const_tree expr
)
2357 switch (TREE_CODE (expr
))
2360 return wi::eq_p (wi::to_widest (expr
), 1);
2362 return (integer_onep (TREE_REALPART (expr
))
2363 && integer_zerop (TREE_IMAGPART (expr
)));
2367 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2368 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2377 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2378 return 1 if every piece is the integer constant one. */
2381 integer_each_onep (const_tree expr
)
2383 if (TREE_CODE (expr
) == COMPLEX_CST
)
2384 return (integer_onep (TREE_REALPART (expr
))
2385 && integer_onep (TREE_IMAGPART (expr
)));
2387 return integer_onep (expr
);
2390 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2391 it contains, or a complex or vector whose subparts are such integers. */
2394 integer_all_onesp (const_tree expr
)
2396 if (TREE_CODE (expr
) == COMPLEX_CST
2397 && integer_all_onesp (TREE_REALPART (expr
))
2398 && integer_all_onesp (TREE_IMAGPART (expr
)))
2401 else if (TREE_CODE (expr
) == VECTOR_CST
)
2404 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2405 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2410 else if (TREE_CODE (expr
) != INTEGER_CST
)
2413 return (wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
)
2414 == wi::to_wide (expr
));
2417 /* Return 1 if EXPR is the integer constant minus one. */
2420 integer_minus_onep (const_tree expr
)
2422 if (TREE_CODE (expr
) == COMPLEX_CST
)
2423 return (integer_all_onesp (TREE_REALPART (expr
))
2424 && integer_zerop (TREE_IMAGPART (expr
)));
2426 return integer_all_onesp (expr
);
2429 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2433 integer_pow2p (const_tree expr
)
2435 if (TREE_CODE (expr
) == COMPLEX_CST
2436 && integer_pow2p (TREE_REALPART (expr
))
2437 && integer_zerop (TREE_IMAGPART (expr
)))
2440 if (TREE_CODE (expr
) != INTEGER_CST
)
2443 return wi::popcount (wi::to_wide (expr
)) == 1;
2446 /* Return 1 if EXPR is an integer constant other than zero or a
2447 complex constant other than zero. */
2450 integer_nonzerop (const_tree expr
)
2452 return ((TREE_CODE (expr
) == INTEGER_CST
2453 && wi::to_wide (expr
) != 0)
2454 || (TREE_CODE (expr
) == COMPLEX_CST
2455 && (integer_nonzerop (TREE_REALPART (expr
))
2456 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2459 /* Return 1 if EXPR is the integer constant one. For vector,
2460 return 1 if every piece is the integer constant minus one
2461 (representing the value TRUE). */
2464 integer_truep (const_tree expr
)
2466 if (TREE_CODE (expr
) == VECTOR_CST
)
2467 return integer_all_onesp (expr
);
2468 return integer_onep (expr
);
2471 /* Return 1 if EXPR is the fixed-point constant zero. */
2474 fixed_zerop (const_tree expr
)
2476 return (TREE_CODE (expr
) == FIXED_CST
2477 && TREE_FIXED_CST (expr
).data
.is_zero ());
2480 /* Return the power of two represented by a tree node known to be a
2484 tree_log2 (const_tree expr
)
2486 if (TREE_CODE (expr
) == COMPLEX_CST
)
2487 return tree_log2 (TREE_REALPART (expr
));
2489 return wi::exact_log2 (wi::to_wide (expr
));
2492 /* Similar, but return the largest integer Y such that 2 ** Y is less
2493 than or equal to EXPR. */
2496 tree_floor_log2 (const_tree expr
)
2498 if (TREE_CODE (expr
) == COMPLEX_CST
)
2499 return tree_log2 (TREE_REALPART (expr
));
2501 return wi::floor_log2 (wi::to_wide (expr
));
2504 /* Return number of known trailing zero bits in EXPR, or, if the value of
2505 EXPR is known to be zero, the precision of it's type. */
2508 tree_ctz (const_tree expr
)
2510 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2511 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2514 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2515 switch (TREE_CODE (expr
))
2518 ret1
= wi::ctz (wi::to_wide (expr
));
2519 return MIN (ret1
, prec
);
2521 ret1
= wi::ctz (get_nonzero_bits (expr
));
2522 return MIN (ret1
, prec
);
2529 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2532 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2533 return MIN (ret1
, ret2
);
2534 case POINTER_PLUS_EXPR
:
2535 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2536 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2537 /* Second operand is sizetype, which could be in theory
2538 wider than pointer's precision. Make sure we never
2539 return more than prec. */
2540 ret2
= MIN (ret2
, prec
);
2541 return MIN (ret1
, ret2
);
2543 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2544 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2545 return MAX (ret1
, ret2
);
2547 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2548 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2549 return MIN (ret1
+ ret2
, prec
);
2551 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2552 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2553 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2555 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2556 return MIN (ret1
+ ret2
, prec
);
2560 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2561 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2563 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2564 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2569 case TRUNC_DIV_EXPR
:
2571 case FLOOR_DIV_EXPR
:
2572 case ROUND_DIV_EXPR
:
2573 case EXACT_DIV_EXPR
:
2574 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2575 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2577 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2580 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2588 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2589 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2591 return MIN (ret1
, prec
);
2593 return tree_ctz (TREE_OPERAND (expr
, 0));
2595 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2598 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2599 return MIN (ret1
, ret2
);
2601 return tree_ctz (TREE_OPERAND (expr
, 1));
2603 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2604 if (ret1
> BITS_PER_UNIT
)
2606 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2607 return MIN (ret1
, prec
);
2615 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2616 decimal float constants, so don't return 1 for them. */
2619 real_zerop (const_tree expr
)
2621 switch (TREE_CODE (expr
))
2624 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2625 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2627 return real_zerop (TREE_REALPART (expr
))
2628 && real_zerop (TREE_IMAGPART (expr
));
2632 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2633 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2642 /* Return 1 if EXPR is the real constant one in real or complex form.
2643 Trailing zeroes matter for decimal float constants, so don't return
2647 real_onep (const_tree expr
)
2649 switch (TREE_CODE (expr
))
2652 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2653 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2655 return real_onep (TREE_REALPART (expr
))
2656 && real_zerop (TREE_IMAGPART (expr
));
2660 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2661 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2670 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2671 matter for decimal float constants, so don't return 1 for them. */
2674 real_minus_onep (const_tree expr
)
2676 switch (TREE_CODE (expr
))
2679 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2680 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2682 return real_minus_onep (TREE_REALPART (expr
))
2683 && real_zerop (TREE_IMAGPART (expr
));
2687 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2688 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2697 /* Nonzero if EXP is a constant or a cast of a constant. */
2700 really_constant_p (const_tree exp
)
2702 /* This is not quite the same as STRIP_NOPS. It does more. */
2703 while (CONVERT_EXPR_P (exp
)
2704 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2705 exp
= TREE_OPERAND (exp
, 0);
2706 return TREE_CONSTANT (exp
);
2709 /* Return first list element whose TREE_VALUE is ELEM.
2710 Return 0 if ELEM is not in LIST. */
2713 value_member (tree elem
, tree list
)
2717 if (elem
== TREE_VALUE (list
))
2719 list
= TREE_CHAIN (list
);
2724 /* Return first list element whose TREE_PURPOSE is ELEM.
2725 Return 0 if ELEM is not in LIST. */
2728 purpose_member (const_tree elem
, tree list
)
2732 if (elem
== TREE_PURPOSE (list
))
2734 list
= TREE_CHAIN (list
);
2739 /* Return true if ELEM is in V. */
2742 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2746 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2752 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2756 chain_index (int idx
, tree chain
)
2758 for (; chain
&& idx
> 0; --idx
)
2759 chain
= TREE_CHAIN (chain
);
2763 /* Return nonzero if ELEM is part of the chain CHAIN. */
2766 chain_member (const_tree elem
, const_tree chain
)
2772 chain
= DECL_CHAIN (chain
);
2778 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2779 We expect a null pointer to mark the end of the chain.
2780 This is the Lisp primitive `length'. */
2783 list_length (const_tree t
)
2786 #ifdef ENABLE_TREE_CHECKING
2794 #ifdef ENABLE_TREE_CHECKING
2797 gcc_assert (p
!= q
);
2805 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2806 UNION_TYPE TYPE, or NULL_TREE if none. */
2809 first_field (const_tree type
)
2811 tree t
= TYPE_FIELDS (type
);
2812 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2817 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2818 by modifying the last node in chain 1 to point to chain 2.
2819 This is the Lisp primitive `nconc'. */
2822 chainon (tree op1
, tree op2
)
2831 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2833 TREE_CHAIN (t1
) = op2
;
2835 #ifdef ENABLE_TREE_CHECKING
2838 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2839 gcc_assert (t2
!= t1
);
2846 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2849 tree_last (tree chain
)
2853 while ((next
= TREE_CHAIN (chain
)))
2858 /* Reverse the order of elements in the chain T,
2859 and return the new head of the chain (old last element). */
2864 tree prev
= 0, decl
, next
;
2865 for (decl
= t
; decl
; decl
= next
)
2867 /* We shouldn't be using this function to reverse BLOCK chains; we
2868 have blocks_nreverse for that. */
2869 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2870 next
= TREE_CHAIN (decl
);
2871 TREE_CHAIN (decl
) = prev
;
2877 /* Return a newly created TREE_LIST node whose
2878 purpose and value fields are PARM and VALUE. */
2881 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
2883 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
2884 TREE_PURPOSE (t
) = parm
;
2885 TREE_VALUE (t
) = value
;
2889 /* Build a chain of TREE_LIST nodes from a vector. */
2892 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2894 tree ret
= NULL_TREE
;
2898 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2900 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
2901 pp
= &TREE_CHAIN (*pp
);
2906 /* Return a newly created TREE_LIST node whose
2907 purpose and value fields are PURPOSE and VALUE
2908 and whose TREE_CHAIN is CHAIN. */
2911 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2915 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2916 memset (node
, 0, sizeof (struct tree_common
));
2918 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2920 TREE_SET_CODE (node
, TREE_LIST
);
2921 TREE_CHAIN (node
) = chain
;
2922 TREE_PURPOSE (node
) = purpose
;
2923 TREE_VALUE (node
) = value
;
2927 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2931 ctor_to_vec (tree ctor
)
2933 vec
<tree
, va_gc
> *vec
;
2934 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2938 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2939 vec
->quick_push (val
);
2944 /* Return the size nominally occupied by an object of type TYPE
2945 when it resides in memory. The value is measured in units of bytes,
2946 and its data type is that normally used for type sizes
2947 (which is the first type created by make_signed_type or
2948 make_unsigned_type). */
2951 size_in_bytes_loc (location_t loc
, const_tree type
)
2955 if (type
== error_mark_node
)
2956 return integer_zero_node
;
2958 type
= TYPE_MAIN_VARIANT (type
);
2959 t
= TYPE_SIZE_UNIT (type
);
2963 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2964 return size_zero_node
;
2970 /* Return the size of TYPE (in bytes) as a wide integer
2971 or return -1 if the size can vary or is larger than an integer. */
2974 int_size_in_bytes (const_tree type
)
2978 if (type
== error_mark_node
)
2981 type
= TYPE_MAIN_VARIANT (type
);
2982 t
= TYPE_SIZE_UNIT (type
);
2984 if (t
&& tree_fits_uhwi_p (t
))
2985 return TREE_INT_CST_LOW (t
);
2990 /* Return the maximum size of TYPE (in bytes) as a wide integer
2991 or return -1 if the size can vary or is larger than an integer. */
2994 max_int_size_in_bytes (const_tree type
)
2996 HOST_WIDE_INT size
= -1;
2999 /* If this is an array type, check for a possible MAX_SIZE attached. */
3001 if (TREE_CODE (type
) == ARRAY_TYPE
)
3003 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3005 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3006 size
= tree_to_uhwi (size_tree
);
3009 /* If we still haven't been able to get a size, see if the language
3010 can compute a maximum size. */
3014 size_tree
= lang_hooks
.types
.max_size (type
);
3016 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3017 size
= tree_to_uhwi (size_tree
);
3023 /* Return the bit position of FIELD, in bits from the start of the record.
3024 This is a tree of type bitsizetype. */
3027 bit_position (const_tree field
)
3029 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3030 DECL_FIELD_BIT_OFFSET (field
));
3033 /* Return the byte position of FIELD, in bytes from the start of the record.
3034 This is a tree of type sizetype. */
3037 byte_position (const_tree field
)
3039 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3040 DECL_FIELD_BIT_OFFSET (field
));
3043 /* Likewise, but return as an integer. It must be representable in
3044 that way (since it could be a signed value, we don't have the
3045 option of returning -1 like int_size_in_byte can. */
3048 int_byte_position (const_tree field
)
3050 return tree_to_shwi (byte_position (field
));
3053 /* Return the strictest alignment, in bits, that T is known to have. */
3056 expr_align (const_tree t
)
3058 unsigned int align0
, align1
;
3060 switch (TREE_CODE (t
))
3062 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3063 /* If we have conversions, we know that the alignment of the
3064 object must meet each of the alignments of the types. */
3065 align0
= expr_align (TREE_OPERAND (t
, 0));
3066 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3067 return MAX (align0
, align1
);
3069 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3070 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3071 case CLEANUP_POINT_EXPR
:
3072 /* These don't change the alignment of an object. */
3073 return expr_align (TREE_OPERAND (t
, 0));
3076 /* The best we can do is say that the alignment is the least aligned
3078 align0
= expr_align (TREE_OPERAND (t
, 1));
3079 align1
= expr_align (TREE_OPERAND (t
, 2));
3080 return MIN (align0
, align1
);
3082 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3083 meaningfully, it's always 1. */
3084 case LABEL_DECL
: case CONST_DECL
:
3085 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3087 gcc_assert (DECL_ALIGN (t
) != 0);
3088 return DECL_ALIGN (t
);
3094 /* Otherwise take the alignment from that of the type. */
3095 return TYPE_ALIGN (TREE_TYPE (t
));
3098 /* Return, as a tree node, the number of elements for TYPE (which is an
3099 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3102 array_type_nelts (const_tree type
)
3104 tree index_type
, min
, max
;
3106 /* If they did it with unspecified bounds, then we should have already
3107 given an error about it before we got here. */
3108 if (! TYPE_DOMAIN (type
))
3109 return error_mark_node
;
3111 index_type
= TYPE_DOMAIN (type
);
3112 min
= TYPE_MIN_VALUE (index_type
);
3113 max
= TYPE_MAX_VALUE (index_type
);
3115 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3117 return error_mark_node
;
3119 return (integer_zerop (min
)
3121 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3124 /* If arg is static -- a reference to an object in static storage -- then
3125 return the object. This is not the same as the C meaning of `static'.
3126 If arg isn't static, return NULL. */
3131 switch (TREE_CODE (arg
))
3134 /* Nested functions are static, even though taking their address will
3135 involve a trampoline as we unnest the nested function and create
3136 the trampoline on the tree level. */
3140 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3141 && ! DECL_THREAD_LOCAL_P (arg
)
3142 && ! DECL_DLLIMPORT_P (arg
)
3146 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3150 return TREE_STATIC (arg
) ? arg
: NULL
;
3157 /* If the thing being referenced is not a field, then it is
3158 something language specific. */
3159 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3161 /* If we are referencing a bitfield, we can't evaluate an
3162 ADDR_EXPR at compile time and so it isn't a constant. */
3163 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3166 return staticp (TREE_OPERAND (arg
, 0));
3172 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3175 case ARRAY_RANGE_REF
:
3176 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3177 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3178 return staticp (TREE_OPERAND (arg
, 0));
3182 case COMPOUND_LITERAL_EXPR
:
3183 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3193 /* Return whether OP is a DECL whose address is function-invariant. */
3196 decl_address_invariant_p (const_tree op
)
3198 /* The conditions below are slightly less strict than the one in
3201 switch (TREE_CODE (op
))
3210 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3211 || DECL_THREAD_LOCAL_P (op
)
3212 || DECL_CONTEXT (op
) == current_function_decl
3213 || decl_function_context (op
) == current_function_decl
)
3218 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3219 || decl_function_context (op
) == current_function_decl
)
3230 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3233 decl_address_ip_invariant_p (const_tree op
)
3235 /* The conditions below are slightly less strict than the one in
3238 switch (TREE_CODE (op
))
3246 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3247 && !DECL_DLLIMPORT_P (op
))
3248 || DECL_THREAD_LOCAL_P (op
))
3253 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3265 /* Return true if T is function-invariant (internal function, does
3266 not handle arithmetic; that's handled in skip_simple_arithmetic and
3267 tree_invariant_p). */
3270 tree_invariant_p_1 (tree t
)
3274 if (TREE_CONSTANT (t
)
3275 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3278 switch (TREE_CODE (t
))
3284 op
= TREE_OPERAND (t
, 0);
3285 while (handled_component_p (op
))
3287 switch (TREE_CODE (op
))
3290 case ARRAY_RANGE_REF
:
3291 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3292 || TREE_OPERAND (op
, 2) != NULL_TREE
3293 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3298 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3304 op
= TREE_OPERAND (op
, 0);
3307 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3316 /* Return true if T is function-invariant. */
3319 tree_invariant_p (tree t
)
3321 tree inner
= skip_simple_arithmetic (t
);
3322 return tree_invariant_p_1 (inner
);
3325 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3326 Do this to any expression which may be used in more than one place,
3327 but must be evaluated only once.
3329 Normally, expand_expr would reevaluate the expression each time.
3330 Calling save_expr produces something that is evaluated and recorded
3331 the first time expand_expr is called on it. Subsequent calls to
3332 expand_expr just reuse the recorded value.
3334 The call to expand_expr that generates code that actually computes
3335 the value is the first call *at compile time*. Subsequent calls
3336 *at compile time* generate code to use the saved value.
3337 This produces correct result provided that *at run time* control
3338 always flows through the insns made by the first expand_expr
3339 before reaching the other places where the save_expr was evaluated.
3340 You, the caller of save_expr, must make sure this is so.
3342 Constants, and certain read-only nodes, are returned with no
3343 SAVE_EXPR because that is safe. Expressions containing placeholders
3344 are not touched; see tree.def for an explanation of what these
3348 save_expr (tree expr
)
3352 /* If the tree evaluates to a constant, then we don't want to hide that
3353 fact (i.e. this allows further folding, and direct checks for constants).
3354 However, a read-only object that has side effects cannot be bypassed.
3355 Since it is no problem to reevaluate literals, we just return the
3357 inner
= skip_simple_arithmetic (expr
);
3358 if (TREE_CODE (inner
) == ERROR_MARK
)
3361 if (tree_invariant_p_1 (inner
))
3364 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3365 it means that the size or offset of some field of an object depends on
3366 the value within another field.
3368 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3369 and some variable since it would then need to be both evaluated once and
3370 evaluated more than once. Front-ends must assure this case cannot
3371 happen by surrounding any such subexpressions in their own SAVE_EXPR
3372 and forcing evaluation at the proper time. */
3373 if (contains_placeholder_p (inner
))
3376 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3378 /* This expression might be placed ahead of a jump to ensure that the
3379 value was computed on both sides of the jump. So make sure it isn't
3380 eliminated as dead. */
3381 TREE_SIDE_EFFECTS (expr
) = 1;
3385 /* Look inside EXPR into any simple arithmetic operations. Return the
3386 outermost non-arithmetic or non-invariant node. */
3389 skip_simple_arithmetic (tree expr
)
3391 /* We don't care about whether this can be used as an lvalue in this
3393 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3394 expr
= TREE_OPERAND (expr
, 0);
3396 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3397 a constant, it will be more efficient to not make another SAVE_EXPR since
3398 it will allow better simplification and GCSE will be able to merge the
3399 computations if they actually occur. */
3402 if (UNARY_CLASS_P (expr
))
3403 expr
= TREE_OPERAND (expr
, 0);
3404 else if (BINARY_CLASS_P (expr
))
3406 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3407 expr
= TREE_OPERAND (expr
, 0);
3408 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3409 expr
= TREE_OPERAND (expr
, 1);
3420 /* Look inside EXPR into simple arithmetic operations involving constants.
3421 Return the outermost non-arithmetic or non-constant node. */
3424 skip_simple_constant_arithmetic (tree expr
)
3426 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3427 expr
= TREE_OPERAND (expr
, 0);
3431 if (UNARY_CLASS_P (expr
))
3432 expr
= TREE_OPERAND (expr
, 0);
3433 else if (BINARY_CLASS_P (expr
))
3435 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3436 expr
= TREE_OPERAND (expr
, 0);
3437 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3438 expr
= TREE_OPERAND (expr
, 1);
3449 /* Return which tree structure is used by T. */
3451 enum tree_node_structure_enum
3452 tree_node_structure (const_tree t
)
3454 const enum tree_code code
= TREE_CODE (t
);
3455 return tree_node_structure_for_code (code
);
3458 /* Set various status flags when building a CALL_EXPR object T. */
3461 process_call_operands (tree t
)
3463 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3464 bool read_only
= false;
3465 int i
= call_expr_flags (t
);
3467 /* Calls have side-effects, except those to const or pure functions. */
3468 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3469 side_effects
= true;
3470 /* Propagate TREE_READONLY of arguments for const functions. */
3474 if (!side_effects
|| read_only
)
3475 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3477 tree op
= TREE_OPERAND (t
, i
);
3478 if (op
&& TREE_SIDE_EFFECTS (op
))
3479 side_effects
= true;
3480 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3484 TREE_SIDE_EFFECTS (t
) = side_effects
;
3485 TREE_READONLY (t
) = read_only
;
3488 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3489 size or offset that depends on a field within a record. */
3492 contains_placeholder_p (const_tree exp
)
3494 enum tree_code code
;
3499 code
= TREE_CODE (exp
);
3500 if (code
== PLACEHOLDER_EXPR
)
3503 switch (TREE_CODE_CLASS (code
))
3506 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3507 position computations since they will be converted into a
3508 WITH_RECORD_EXPR involving the reference, which will assume
3509 here will be valid. */
3510 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3512 case tcc_exceptional
:
3513 if (code
== TREE_LIST
)
3514 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3515 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3520 case tcc_comparison
:
3521 case tcc_expression
:
3525 /* Ignoring the first operand isn't quite right, but works best. */
3526 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3529 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3530 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3531 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3534 /* The save_expr function never wraps anything containing
3535 a PLACEHOLDER_EXPR. */
3542 switch (TREE_CODE_LENGTH (code
))
3545 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3547 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3548 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3559 const_call_expr_arg_iterator iter
;
3560 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3561 if (CONTAINS_PLACEHOLDER_P (arg
))
3575 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3576 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3580 type_contains_placeholder_1 (const_tree type
)
3582 /* If the size contains a placeholder or the parent type (component type in
3583 the case of arrays) type involves a placeholder, this type does. */
3584 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3585 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3586 || (!POINTER_TYPE_P (type
)
3588 && type_contains_placeholder_p (TREE_TYPE (type
))))
3591 /* Now do type-specific checks. Note that the last part of the check above
3592 greatly limits what we have to do below. */
3593 switch (TREE_CODE (type
))
3596 case POINTER_BOUNDS_TYPE
:
3602 case REFERENCE_TYPE
:
3611 case FIXED_POINT_TYPE
:
3612 /* Here we just check the bounds. */
3613 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3614 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3617 /* We have already checked the component type above, so just check
3618 the domain type. Flexible array members have a null domain. */
3619 return TYPE_DOMAIN (type
) ?
3620 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3624 case QUAL_UNION_TYPE
:
3628 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3629 if (TREE_CODE (field
) == FIELD_DECL
3630 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3631 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3632 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3633 || type_contains_placeholder_p (TREE_TYPE (field
))))
3644 /* Wrapper around above function used to cache its result. */
3647 type_contains_placeholder_p (tree type
)
3651 /* If the contains_placeholder_bits field has been initialized,
3652 then we know the answer. */
3653 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3654 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3656 /* Indicate that we've seen this type node, and the answer is false.
3657 This is what we want to return if we run into recursion via fields. */
3658 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3660 /* Compute the real value. */
3661 result
= type_contains_placeholder_1 (type
);
3663 /* Store the real value. */
3664 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3669 /* Push tree EXP onto vector QUEUE if it is not already present. */
3672 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3677 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3678 if (simple_cst_equal (iter
, exp
) == 1)
3682 queue
->safe_push (exp
);
3685 /* Given a tree EXP, find all occurrences of references to fields
3686 in a PLACEHOLDER_EXPR and place them in vector REFS without
3687 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3688 we assume here that EXP contains only arithmetic expressions
3689 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3693 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3695 enum tree_code code
= TREE_CODE (exp
);
3699 /* We handle TREE_LIST and COMPONENT_REF separately. */
3700 if (code
== TREE_LIST
)
3702 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3703 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3705 else if (code
== COMPONENT_REF
)
3707 for (inner
= TREE_OPERAND (exp
, 0);
3708 REFERENCE_CLASS_P (inner
);
3709 inner
= TREE_OPERAND (inner
, 0))
3712 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3713 push_without_duplicates (exp
, refs
);
3715 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3718 switch (TREE_CODE_CLASS (code
))
3723 case tcc_declaration
:
3724 /* Variables allocated to static storage can stay. */
3725 if (!TREE_STATIC (exp
))
3726 push_without_duplicates (exp
, refs
);
3729 case tcc_expression
:
3730 /* This is the pattern built in ada/make_aligning_type. */
3731 if (code
== ADDR_EXPR
3732 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3734 push_without_duplicates (exp
, refs
);
3740 case tcc_exceptional
:
3743 case tcc_comparison
:
3745 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3746 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3750 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3751 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3759 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3760 return a tree with all occurrences of references to F in a
3761 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3762 CONST_DECLs. Note that we assume here that EXP contains only
3763 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3764 occurring only in their argument list. */
3767 substitute_in_expr (tree exp
, tree f
, tree r
)
3769 enum tree_code code
= TREE_CODE (exp
);
3770 tree op0
, op1
, op2
, op3
;
3773 /* We handle TREE_LIST and COMPONENT_REF separately. */
3774 if (code
== TREE_LIST
)
3776 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3777 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3778 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3781 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3783 else if (code
== COMPONENT_REF
)
3787 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3788 and it is the right field, replace it with R. */
3789 for (inner
= TREE_OPERAND (exp
, 0);
3790 REFERENCE_CLASS_P (inner
);
3791 inner
= TREE_OPERAND (inner
, 0))
3795 op1
= TREE_OPERAND (exp
, 1);
3797 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3800 /* If this expression hasn't been completed let, leave it alone. */
3801 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3804 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3805 if (op0
== TREE_OPERAND (exp
, 0))
3809 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3812 switch (TREE_CODE_CLASS (code
))
3817 case tcc_declaration
:
3823 case tcc_expression
:
3829 case tcc_exceptional
:
3832 case tcc_comparison
:
3834 switch (TREE_CODE_LENGTH (code
))
3840 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3841 if (op0
== TREE_OPERAND (exp
, 0))
3844 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3848 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3849 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3851 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3854 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3858 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3859 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3860 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3862 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3863 && op2
== TREE_OPERAND (exp
, 2))
3866 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3870 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3871 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3872 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3873 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3875 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3876 && op2
== TREE_OPERAND (exp
, 2)
3877 && op3
== TREE_OPERAND (exp
, 3))
3881 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3893 new_tree
= NULL_TREE
;
3895 /* If we are trying to replace F with a constant or with another
3896 instance of one of the arguments of the call, inline back
3897 functions which do nothing else than computing a value from
3898 the arguments they are passed. This makes it possible to
3899 fold partially or entirely the replacement expression. */
3900 if (code
== CALL_EXPR
)
3902 bool maybe_inline
= false;
3903 if (CONSTANT_CLASS_P (r
))
3904 maybe_inline
= true;
3906 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3907 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
3909 maybe_inline
= true;
3914 tree t
= maybe_inline_call_in_expr (exp
);
3916 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3920 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3922 tree op
= TREE_OPERAND (exp
, i
);
3923 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3927 new_tree
= copy_node (exp
);
3928 TREE_OPERAND (new_tree
, i
) = new_op
;
3934 new_tree
= fold (new_tree
);
3935 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3936 process_call_operands (new_tree
);
3947 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3949 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3950 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3955 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3956 for it within OBJ, a tree that is an object or a chain of references. */
3959 substitute_placeholder_in_expr (tree exp
, tree obj
)
3961 enum tree_code code
= TREE_CODE (exp
);
3962 tree op0
, op1
, op2
, op3
;
3965 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3966 in the chain of OBJ. */
3967 if (code
== PLACEHOLDER_EXPR
)
3969 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3972 for (elt
= obj
; elt
!= 0;
3973 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3974 || TREE_CODE (elt
) == COND_EXPR
)
3975 ? TREE_OPERAND (elt
, 1)
3976 : (REFERENCE_CLASS_P (elt
)
3977 || UNARY_CLASS_P (elt
)
3978 || BINARY_CLASS_P (elt
)
3979 || VL_EXP_CLASS_P (elt
)
3980 || EXPRESSION_CLASS_P (elt
))
3981 ? TREE_OPERAND (elt
, 0) : 0))
3982 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3985 for (elt
= obj
; elt
!= 0;
3986 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3987 || TREE_CODE (elt
) == COND_EXPR
)
3988 ? TREE_OPERAND (elt
, 1)
3989 : (REFERENCE_CLASS_P (elt
)
3990 || UNARY_CLASS_P (elt
)
3991 || BINARY_CLASS_P (elt
)
3992 || VL_EXP_CLASS_P (elt
)
3993 || EXPRESSION_CLASS_P (elt
))
3994 ? TREE_OPERAND (elt
, 0) : 0))
3995 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3996 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3998 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
4000 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4001 survives until RTL generation, there will be an error. */
4005 /* TREE_LIST is special because we need to look at TREE_VALUE
4006 and TREE_CHAIN, not TREE_OPERANDS. */
4007 else if (code
== TREE_LIST
)
4009 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4010 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4011 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4014 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4017 switch (TREE_CODE_CLASS (code
))
4020 case tcc_declaration
:
4023 case tcc_exceptional
:
4026 case tcc_comparison
:
4027 case tcc_expression
:
4030 switch (TREE_CODE_LENGTH (code
))
4036 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4037 if (op0
== TREE_OPERAND (exp
, 0))
4040 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4044 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4045 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4047 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4050 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4054 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4055 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4056 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4058 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4059 && op2
== TREE_OPERAND (exp
, 2))
4062 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4066 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4067 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4068 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4069 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4071 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4072 && op2
== TREE_OPERAND (exp
, 2)
4073 && op3
== TREE_OPERAND (exp
, 3))
4077 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4089 new_tree
= NULL_TREE
;
4091 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4093 tree op
= TREE_OPERAND (exp
, i
);
4094 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4098 new_tree
= copy_node (exp
);
4099 TREE_OPERAND (new_tree
, i
) = new_op
;
4105 new_tree
= fold (new_tree
);
4106 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4107 process_call_operands (new_tree
);
4118 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4120 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4121 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4127 /* Subroutine of stabilize_reference; this is called for subtrees of
4128 references. Any expression with side-effects must be put in a SAVE_EXPR
4129 to ensure that it is only evaluated once.
4131 We don't put SAVE_EXPR nodes around everything, because assigning very
4132 simple expressions to temporaries causes us to miss good opportunities
4133 for optimizations. Among other things, the opportunity to fold in the
4134 addition of a constant into an addressing mode often gets lost, e.g.
4135 "y[i+1] += x;". In general, we take the approach that we should not make
4136 an assignment unless we are forced into it - i.e., that any non-side effect
4137 operator should be allowed, and that cse should take care of coalescing
4138 multiple utterances of the same expression should that prove fruitful. */
4141 stabilize_reference_1 (tree e
)
4144 enum tree_code code
= TREE_CODE (e
);
4146 /* We cannot ignore const expressions because it might be a reference
4147 to a const array but whose index contains side-effects. But we can
4148 ignore things that are actual constant or that already have been
4149 handled by this function. */
4151 if (tree_invariant_p (e
))
4154 switch (TREE_CODE_CLASS (code
))
4156 case tcc_exceptional
:
4158 case tcc_declaration
:
4159 case tcc_comparison
:
4161 case tcc_expression
:
4164 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4165 so that it will only be evaluated once. */
4166 /* The reference (r) and comparison (<) classes could be handled as
4167 below, but it is generally faster to only evaluate them once. */
4168 if (TREE_SIDE_EFFECTS (e
))
4169 return save_expr (e
);
4173 /* Constants need no processing. In fact, we should never reach
4178 /* Division is slow and tends to be compiled with jumps,
4179 especially the division by powers of 2 that is often
4180 found inside of an array reference. So do it just once. */
4181 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4182 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4183 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4184 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4185 return save_expr (e
);
4186 /* Recursively stabilize each operand. */
4187 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4188 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4192 /* Recursively stabilize each operand. */
4193 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4200 TREE_TYPE (result
) = TREE_TYPE (e
);
4201 TREE_READONLY (result
) = TREE_READONLY (e
);
4202 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4203 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4208 /* Stabilize a reference so that we can use it any number of times
4209 without causing its operands to be evaluated more than once.
4210 Returns the stabilized reference. This works by means of save_expr,
4211 so see the caveats in the comments about save_expr.
4213 Also allows conversion expressions whose operands are references.
4214 Any other kind of expression is returned unchanged. */
4217 stabilize_reference (tree ref
)
4220 enum tree_code code
= TREE_CODE (ref
);
4227 /* No action is needed in this case. */
4232 case FIX_TRUNC_EXPR
:
4233 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4237 result
= build_nt (INDIRECT_REF
,
4238 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4242 result
= build_nt (COMPONENT_REF
,
4243 stabilize_reference (TREE_OPERAND (ref
, 0)),
4244 TREE_OPERAND (ref
, 1), NULL_TREE
);
4248 result
= build_nt (BIT_FIELD_REF
,
4249 stabilize_reference (TREE_OPERAND (ref
, 0)),
4250 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4251 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4255 result
= build_nt (ARRAY_REF
,
4256 stabilize_reference (TREE_OPERAND (ref
, 0)),
4257 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4258 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4261 case ARRAY_RANGE_REF
:
4262 result
= build_nt (ARRAY_RANGE_REF
,
4263 stabilize_reference (TREE_OPERAND (ref
, 0)),
4264 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4265 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4269 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4270 it wouldn't be ignored. This matters when dealing with
4272 return stabilize_reference_1 (ref
);
4274 /* If arg isn't a kind of lvalue we recognize, make no change.
4275 Caller should recognize the error for an invalid lvalue. */
4280 return error_mark_node
;
4283 TREE_TYPE (result
) = TREE_TYPE (ref
);
4284 TREE_READONLY (result
) = TREE_READONLY (ref
);
4285 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4286 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4291 /* Low-level constructors for expressions. */
4293 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4294 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4297 recompute_tree_invariant_for_addr_expr (tree t
)
4300 bool tc
= true, se
= false;
4302 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4304 /* We started out assuming this address is both invariant and constant, but
4305 does not have side effects. Now go down any handled components and see if
4306 any of them involve offsets that are either non-constant or non-invariant.
4307 Also check for side-effects.
4309 ??? Note that this code makes no attempt to deal with the case where
4310 taking the address of something causes a copy due to misalignment. */
4312 #define UPDATE_FLAGS(NODE) \
4313 do { tree _node = (NODE); \
4314 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4315 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4317 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4318 node
= TREE_OPERAND (node
, 0))
4320 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4321 array reference (probably made temporarily by the G++ front end),
4322 so ignore all the operands. */
4323 if ((TREE_CODE (node
) == ARRAY_REF
4324 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4325 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4327 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4328 if (TREE_OPERAND (node
, 2))
4329 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4330 if (TREE_OPERAND (node
, 3))
4331 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4333 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4334 FIELD_DECL, apparently. The G++ front end can put something else
4335 there, at least temporarily. */
4336 else if (TREE_CODE (node
) == COMPONENT_REF
4337 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4339 if (TREE_OPERAND (node
, 2))
4340 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4344 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4346 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4347 the address, since &(*a)->b is a form of addition. If it's a constant, the
4348 address is constant too. If it's a decl, its address is constant if the
4349 decl is static. Everything else is not constant and, furthermore,
4350 taking the address of a volatile variable is not volatile. */
4351 if (TREE_CODE (node
) == INDIRECT_REF
4352 || TREE_CODE (node
) == MEM_REF
)
4353 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4354 else if (CONSTANT_CLASS_P (node
))
4356 else if (DECL_P (node
))
4357 tc
&= (staticp (node
) != NULL_TREE
);
4361 se
|= TREE_SIDE_EFFECTS (node
);
4365 TREE_CONSTANT (t
) = tc
;
4366 TREE_SIDE_EFFECTS (t
) = se
;
4370 /* Build an expression of code CODE, data type TYPE, and operands as
4371 specified. Expressions and reference nodes can be created this way.
4372 Constants, decls, types and misc nodes cannot be.
4374 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4375 enough for all extant tree codes. */
4378 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4382 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4384 t
= make_node (code PASS_MEM_STAT
);
4391 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4393 int length
= sizeof (struct tree_exp
);
4396 record_node_allocation_statistics (code
, length
);
4398 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4400 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4402 memset (t
, 0, sizeof (struct tree_common
));
4404 TREE_SET_CODE (t
, code
);
4406 TREE_TYPE (t
) = type
;
4407 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4408 TREE_OPERAND (t
, 0) = node
;
4409 if (node
&& !TYPE_P (node
))
4411 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4412 TREE_READONLY (t
) = TREE_READONLY (node
);
4415 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4416 TREE_SIDE_EFFECTS (t
) = 1;
4420 /* All of these have side-effects, no matter what their
4422 TREE_SIDE_EFFECTS (t
) = 1;
4423 TREE_READONLY (t
) = 0;
4427 /* Whether a dereference is readonly has nothing to do with whether
4428 its operand is readonly. */
4429 TREE_READONLY (t
) = 0;
4434 recompute_tree_invariant_for_addr_expr (t
);
4438 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4439 && node
&& !TYPE_P (node
)
4440 && TREE_CONSTANT (node
))
4441 TREE_CONSTANT (t
) = 1;
4442 if (TREE_CODE_CLASS (code
) == tcc_reference
4443 && node
&& TREE_THIS_VOLATILE (node
))
4444 TREE_THIS_VOLATILE (t
) = 1;
4451 #define PROCESS_ARG(N) \
4453 TREE_OPERAND (t, N) = arg##N; \
4454 if (arg##N &&!TYPE_P (arg##N)) \
4456 if (TREE_SIDE_EFFECTS (arg##N)) \
4458 if (!TREE_READONLY (arg##N) \
4459 && !CONSTANT_CLASS_P (arg##N)) \
4460 (void) (read_only = 0); \
4461 if (!TREE_CONSTANT (arg##N)) \
4462 (void) (constant = 0); \
4467 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4469 bool constant
, read_only
, side_effects
, div_by_zero
;
4472 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4474 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4475 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4476 /* When sizetype precision doesn't match that of pointers
4477 we need to be able to build explicit extensions or truncations
4478 of the offset argument. */
4479 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4480 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4481 && TREE_CODE (arg1
) == INTEGER_CST
);
4483 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4484 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4485 && ptrofftype_p (TREE_TYPE (arg1
)));
4487 t
= make_node (code PASS_MEM_STAT
);
4490 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4491 result based on those same flags for the arguments. But if the
4492 arguments aren't really even `tree' expressions, we shouldn't be trying
4495 /* Expressions without side effects may be constant if their
4496 arguments are as well. */
4497 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4498 || TREE_CODE_CLASS (code
) == tcc_binary
);
4500 side_effects
= TREE_SIDE_EFFECTS (t
);
4504 case TRUNC_DIV_EXPR
:
4506 case FLOOR_DIV_EXPR
:
4507 case ROUND_DIV_EXPR
:
4508 case EXACT_DIV_EXPR
:
4510 case FLOOR_MOD_EXPR
:
4511 case ROUND_MOD_EXPR
:
4512 case TRUNC_MOD_EXPR
:
4513 div_by_zero
= integer_zerop (arg1
);
4516 div_by_zero
= false;
4522 TREE_SIDE_EFFECTS (t
) = side_effects
;
4523 if (code
== MEM_REF
)
4525 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4527 tree o
= TREE_OPERAND (arg0
, 0);
4528 TREE_READONLY (t
) = TREE_READONLY (o
);
4529 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4534 TREE_READONLY (t
) = read_only
;
4535 /* Don't mark X / 0 as constant. */
4536 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4537 TREE_THIS_VOLATILE (t
)
4538 = (TREE_CODE_CLASS (code
) == tcc_reference
4539 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4547 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4548 tree arg2 MEM_STAT_DECL
)
4550 bool constant
, read_only
, side_effects
;
4553 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4554 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4556 t
= make_node (code PASS_MEM_STAT
);
4561 /* As a special exception, if COND_EXPR has NULL branches, we
4562 assume that it is a gimple statement and always consider
4563 it to have side effects. */
4564 if (code
== COND_EXPR
4565 && tt
== void_type_node
4566 && arg1
== NULL_TREE
4567 && arg2
== NULL_TREE
)
4568 side_effects
= true;
4570 side_effects
= TREE_SIDE_EFFECTS (t
);
4576 if (code
== COND_EXPR
)
4577 TREE_READONLY (t
) = read_only
;
4579 TREE_SIDE_EFFECTS (t
) = side_effects
;
4580 TREE_THIS_VOLATILE (t
)
4581 = (TREE_CODE_CLASS (code
) == tcc_reference
4582 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4588 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4589 tree arg2
, tree arg3 MEM_STAT_DECL
)
4591 bool constant
, read_only
, side_effects
;
4594 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4596 t
= make_node (code PASS_MEM_STAT
);
4599 side_effects
= TREE_SIDE_EFFECTS (t
);
4606 TREE_SIDE_EFFECTS (t
) = side_effects
;
4607 TREE_THIS_VOLATILE (t
)
4608 = (TREE_CODE_CLASS (code
) == tcc_reference
4609 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4615 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4616 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4618 bool constant
, read_only
, side_effects
;
4621 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4623 t
= make_node (code PASS_MEM_STAT
);
4626 side_effects
= TREE_SIDE_EFFECTS (t
);
4634 TREE_SIDE_EFFECTS (t
) = side_effects
;
4635 if (code
== TARGET_MEM_REF
)
4637 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4639 tree o
= TREE_OPERAND (arg0
, 0);
4640 TREE_READONLY (t
) = TREE_READONLY (o
);
4641 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4645 TREE_THIS_VOLATILE (t
)
4646 = (TREE_CODE_CLASS (code
) == tcc_reference
4647 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4652 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4653 on the pointer PTR. */
4656 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4658 HOST_WIDE_INT offset
= 0;
4659 tree ptype
= TREE_TYPE (ptr
);
4661 /* For convenience allow addresses that collapse to a simple base
4663 if (TREE_CODE (ptr
) == ADDR_EXPR
4664 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4665 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4667 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4669 ptr
= build_fold_addr_expr (ptr
);
4670 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4672 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4673 ptr
, build_int_cst (ptype
, offset
));
4674 SET_EXPR_LOCATION (tem
, loc
);
4678 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4681 mem_ref_offset (const_tree t
)
4683 return offset_int::from (wi::to_wide (TREE_OPERAND (t
, 1)), SIGNED
);
4686 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4687 offsetted by OFFSET units. */
4690 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4692 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4693 build_fold_addr_expr (base
),
4694 build_int_cst (ptr_type_node
, offset
));
4695 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4696 recompute_tree_invariant_for_addr_expr (addr
);
4700 /* Similar except don't specify the TREE_TYPE
4701 and leave the TREE_SIDE_EFFECTS as 0.
4702 It is permissible for arguments to be null,
4703 or even garbage if their values do not matter. */
4706 build_nt (enum tree_code code
, ...)
4713 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4717 t
= make_node (code
);
4718 length
= TREE_CODE_LENGTH (code
);
4720 for (i
= 0; i
< length
; i
++)
4721 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4727 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4731 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4736 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4737 CALL_EXPR_FN (ret
) = fn
;
4738 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4739 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4740 CALL_EXPR_ARG (ret
, ix
) = t
;
4744 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4745 We do NOT enter this node in any sort of symbol table.
4747 LOC is the location of the decl.
4749 layout_decl is used to set up the decl's storage layout.
4750 Other slots are initialized to 0 or null pointers. */
4753 build_decl (location_t loc
, enum tree_code code
, tree name
,
4754 tree type MEM_STAT_DECL
)
4758 t
= make_node (code PASS_MEM_STAT
);
4759 DECL_SOURCE_LOCATION (t
) = loc
;
4761 /* if (type == error_mark_node)
4762 type = integer_type_node; */
4763 /* That is not done, deliberately, so that having error_mark_node
4764 as the type can suppress useless errors in the use of this variable. */
4766 DECL_NAME (t
) = name
;
4767 TREE_TYPE (t
) = type
;
4769 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4775 /* Builds and returns function declaration with NAME and TYPE. */
4778 build_fn_decl (const char *name
, tree type
)
4780 tree id
= get_identifier (name
);
4781 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4783 DECL_EXTERNAL (decl
) = 1;
4784 TREE_PUBLIC (decl
) = 1;
4785 DECL_ARTIFICIAL (decl
) = 1;
4786 TREE_NOTHROW (decl
) = 1;
4791 vec
<tree
, va_gc
> *all_translation_units
;
4793 /* Builds a new translation-unit decl with name NAME, queues it in the
4794 global list of translation-unit decls and returns it. */
4797 build_translation_unit_decl (tree name
)
4799 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4801 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4802 vec_safe_push (all_translation_units
, tu
);
4807 /* BLOCK nodes are used to represent the structure of binding contours
4808 and declarations, once those contours have been exited and their contents
4809 compiled. This information is used for outputting debugging info. */
4812 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4814 tree block
= make_node (BLOCK
);
4816 BLOCK_VARS (block
) = vars
;
4817 BLOCK_SUBBLOCKS (block
) = subblocks
;
4818 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4819 BLOCK_CHAIN (block
) = chain
;
4824 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4826 LOC is the location to use in tree T. */
4829 protected_set_expr_location (tree t
, location_t loc
)
4831 if (CAN_HAVE_LOCATION_P (t
))
4832 SET_EXPR_LOCATION (t
, loc
);
4835 /* Reset the expression *EXPR_P, a size or position.
4837 ??? We could reset all non-constant sizes or positions. But it's cheap
4838 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4840 We need to reset self-referential sizes or positions because they cannot
4841 be gimplified and thus can contain a CALL_EXPR after the gimplification
4842 is finished, which will run afoul of LTO streaming. And they need to be
4843 reset to something essentially dummy but not constant, so as to preserve
4844 the properties of the object they are attached to. */
4847 free_lang_data_in_one_sizepos (tree
*expr_p
)
4849 tree expr
= *expr_p
;
4850 if (CONTAINS_PLACEHOLDER_P (expr
))
4851 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4855 /* Reset all the fields in a binfo node BINFO. We only keep
4856 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4859 free_lang_data_in_binfo (tree binfo
)
4864 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4866 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4867 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4868 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4869 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4871 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4872 free_lang_data_in_binfo (t
);
4876 /* Reset all language specific information still present in TYPE. */
4879 free_lang_data_in_type (tree type
)
4881 gcc_assert (TYPE_P (type
));
4883 /* Give the FE a chance to remove its own data first. */
4884 lang_hooks
.free_lang_data (type
);
4886 TREE_LANG_FLAG_0 (type
) = 0;
4887 TREE_LANG_FLAG_1 (type
) = 0;
4888 TREE_LANG_FLAG_2 (type
) = 0;
4889 TREE_LANG_FLAG_3 (type
) = 0;
4890 TREE_LANG_FLAG_4 (type
) = 0;
4891 TREE_LANG_FLAG_5 (type
) = 0;
4892 TREE_LANG_FLAG_6 (type
) = 0;
4894 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4896 /* Remove the const and volatile qualifiers from arguments. The
4897 C++ front end removes them, but the C front end does not,
4898 leading to false ODR violation errors when merging two
4899 instances of the same function signature compiled by
4900 different front ends. */
4901 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4903 tree arg_type
= TREE_VALUE (p
);
4905 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4907 int quals
= TYPE_QUALS (arg_type
)
4909 & ~TYPE_QUAL_VOLATILE
;
4910 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4911 free_lang_data_in_type (TREE_VALUE (p
));
4913 /* C++ FE uses TREE_PURPOSE to store initial values. */
4914 TREE_PURPOSE (p
) = NULL
;
4917 else if (TREE_CODE (type
) == METHOD_TYPE
)
4918 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4919 /* C++ FE uses TREE_PURPOSE to store initial values. */
4920 TREE_PURPOSE (p
) = NULL
;
4921 else if (RECORD_OR_UNION_TYPE_P (type
))
4923 /* Remove members that are not FIELD_DECLs (and maybe
4924 TYPE_DECLs) from the field list of an aggregate. These occur
4926 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
4927 if (TREE_CODE (member
) == FIELD_DECL
4928 || (TREE_CODE (member
) == TYPE_DECL
4929 && !DECL_IGNORED_P (member
)
4930 && debug_info_level
> DINFO_LEVEL_TERSE
4931 && !is_redundant_typedef (member
)))
4932 prev
= &DECL_CHAIN (member
);
4934 *prev
= DECL_CHAIN (member
);
4936 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
4937 and danagle the pointer from time to time. */
4938 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
4939 TYPE_VFIELD (type
) = NULL_TREE
;
4941 if (TYPE_BINFO (type
))
4943 free_lang_data_in_binfo (TYPE_BINFO (type
));
4944 /* We need to preserve link to bases and virtual table for all
4945 polymorphic types to make devirtualization machinery working.
4946 Debug output cares only about bases, but output also
4947 virtual table pointers so merging of -fdevirtualize and
4948 -fno-devirtualize units is easier. */
4949 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
4950 || !flag_devirtualize
)
4951 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
4952 && !BINFO_VTABLE (TYPE_BINFO (type
)))
4953 || debug_info_level
!= DINFO_LEVEL_NONE
))
4954 TYPE_BINFO (type
) = NULL
;
4957 else if (INTEGRAL_TYPE_P (type
)
4958 || SCALAR_FLOAT_TYPE_P (type
)
4959 || FIXED_POINT_TYPE_P (type
))
4961 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4962 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4965 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4967 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4968 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4970 if (TYPE_CONTEXT (type
)
4971 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4973 tree ctx
= TYPE_CONTEXT (type
);
4976 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4978 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4979 TYPE_CONTEXT (type
) = ctx
;
4984 /* Return true if DECL may need an assembler name to be set. */
4987 need_assembler_name_p (tree decl
)
4989 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
4990 Rule merging. This makes type_odr_p to return true on those types during
4991 LTO and by comparing the mangled name, we can say what types are intended
4992 to be equivalent across compilation unit.
4994 We do not store names of type_in_anonymous_namespace_p.
4996 Record, union and enumeration type have linkage that allows use
4997 to check type_in_anonymous_namespace_p. We do not mangle compound types
4998 that always can be compared structurally.
5000 Similarly for builtin types, we compare properties of their main variant.
5001 A special case are integer types where mangling do make differences
5002 between char/signed char/unsigned char etc. Storing name for these makes
5003 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5004 See cp/mangle.c:write_builtin_type for details. */
5006 if (flag_lto_odr_type_mering
5007 && TREE_CODE (decl
) == TYPE_DECL
5009 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5010 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5011 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5012 && (type_with_linkage_p (TREE_TYPE (decl
))
5013 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5014 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5015 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5016 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5017 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5020 /* If DECL already has its assembler name set, it does not need a
5022 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5023 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5026 /* Abstract decls do not need an assembler name. */
5027 if (DECL_ABSTRACT_P (decl
))
5030 /* For VAR_DECLs, only static, public and external symbols need an
5033 && !TREE_STATIC (decl
)
5034 && !TREE_PUBLIC (decl
)
5035 && !DECL_EXTERNAL (decl
))
5038 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5040 /* Do not set assembler name on builtins. Allow RTL expansion to
5041 decide whether to expand inline or via a regular call. */
5042 if (DECL_BUILT_IN (decl
)
5043 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5046 /* Functions represented in the callgraph need an assembler name. */
5047 if (cgraph_node::get (decl
) != NULL
)
5050 /* Unused and not public functions don't need an assembler name. */
5051 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5059 /* Reset all language specific information still present in symbol
5063 free_lang_data_in_decl (tree decl
)
5065 gcc_assert (DECL_P (decl
));
5067 /* Give the FE a chance to remove its own data first. */
5068 lang_hooks
.free_lang_data (decl
);
5070 TREE_LANG_FLAG_0 (decl
) = 0;
5071 TREE_LANG_FLAG_1 (decl
) = 0;
5072 TREE_LANG_FLAG_2 (decl
) = 0;
5073 TREE_LANG_FLAG_3 (decl
) = 0;
5074 TREE_LANG_FLAG_4 (decl
) = 0;
5075 TREE_LANG_FLAG_5 (decl
) = 0;
5076 TREE_LANG_FLAG_6 (decl
) = 0;
5078 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5079 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5080 if (TREE_CODE (decl
) == FIELD_DECL
)
5082 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5083 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5084 DECL_QUALIFIER (decl
) = NULL_TREE
;
5087 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5089 struct cgraph_node
*node
;
5090 if (!(node
= cgraph_node::get (decl
))
5091 || (!node
->definition
&& !node
->clones
))
5094 node
->release_body ();
5097 release_function_body (decl
);
5098 DECL_ARGUMENTS (decl
) = NULL
;
5099 DECL_RESULT (decl
) = NULL
;
5100 DECL_INITIAL (decl
) = error_mark_node
;
5103 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5107 /* If DECL has a gimple body, then the context for its
5108 arguments must be DECL. Otherwise, it doesn't really
5109 matter, as we will not be emitting any code for DECL. In
5110 general, there may be other instances of DECL created by
5111 the front end and since PARM_DECLs are generally shared,
5112 their DECL_CONTEXT changes as the replicas of DECL are
5113 created. The only time where DECL_CONTEXT is important
5114 is for the FUNCTION_DECLs that have a gimple body (since
5115 the PARM_DECL will be used in the function's body). */
5116 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5117 DECL_CONTEXT (t
) = decl
;
5118 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5119 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5120 = target_option_default_node
;
5121 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5122 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5123 = optimization_default_node
;
5126 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5127 At this point, it is not needed anymore. */
5128 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5130 /* Clear the abstract origin if it refers to a method.
5131 Otherwise dwarf2out.c will ICE as we splice functions out of
5132 TYPE_FIELDS and thus the origin will not be output
5134 if (DECL_ABSTRACT_ORIGIN (decl
)
5135 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5136 && RECORD_OR_UNION_TYPE_P
5137 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5138 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5140 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5141 DECL_VINDEX referring to itself into a vtable slot number as it
5142 should. Happens with functions that are copied and then forgotten
5143 about. Just clear it, it won't matter anymore. */
5144 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5145 DECL_VINDEX (decl
) = NULL_TREE
;
5147 else if (VAR_P (decl
))
5149 if ((DECL_EXTERNAL (decl
)
5150 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5151 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5152 DECL_INITIAL (decl
) = NULL_TREE
;
5154 else if (TREE_CODE (decl
) == TYPE_DECL
)
5156 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5157 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5158 DECL_INITIAL (decl
) = NULL_TREE
;
5160 else if (TREE_CODE (decl
) == FIELD_DECL
)
5161 DECL_INITIAL (decl
) = NULL_TREE
;
5162 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5163 && DECL_INITIAL (decl
)
5164 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5166 /* Strip builtins from the translation-unit BLOCK. We still have targets
5167 without builtin_decl_explicit support and also builtins are shared
5168 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5169 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5173 if (TREE_CODE (var
) == FUNCTION_DECL
5174 && DECL_BUILT_IN (var
))
5175 *nextp
= TREE_CHAIN (var
);
5177 nextp
= &TREE_CHAIN (var
);
5183 /* Data used when collecting DECLs and TYPEs for language data removal. */
5185 struct free_lang_data_d
5187 free_lang_data_d () : decls (100), types (100) {}
5189 /* Worklist to avoid excessive recursion. */
5190 auto_vec
<tree
> worklist
;
5192 /* Set of traversed objects. Used to avoid duplicate visits. */
5193 hash_set
<tree
> pset
;
5195 /* Array of symbols to process with free_lang_data_in_decl. */
5196 auto_vec
<tree
> decls
;
5198 /* Array of types to process with free_lang_data_in_type. */
5199 auto_vec
<tree
> types
;
5203 /* Save all language fields needed to generate proper debug information
5204 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5207 save_debug_info_for_decl (tree t
)
5209 /*struct saved_debug_info_d *sdi;*/
5211 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5213 /* FIXME. Partial implementation for saving debug info removed. */
5217 /* Save all language fields needed to generate proper debug information
5218 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5221 save_debug_info_for_type (tree t
)
5223 /*struct saved_debug_info_d *sdi;*/
5225 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5227 /* FIXME. Partial implementation for saving debug info removed. */
5231 /* Add type or decl T to one of the list of tree nodes that need their
5232 language data removed. The lists are held inside FLD. */
5235 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5239 fld
->decls
.safe_push (t
);
5240 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5241 save_debug_info_for_decl (t
);
5243 else if (TYPE_P (t
))
5245 fld
->types
.safe_push (t
);
5246 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5247 save_debug_info_for_type (t
);
5253 /* Push tree node T into FLD->WORKLIST. */
5256 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5258 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5259 fld
->worklist
.safe_push ((t
));
5263 /* Operand callback helper for free_lang_data_in_node. *TP is the
5264 subtree operand being considered. */
5267 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5270 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5272 if (TREE_CODE (t
) == TREE_LIST
)
5275 /* Language specific nodes will be removed, so there is no need
5276 to gather anything under them. */
5277 if (is_lang_specific (t
))
5285 /* Note that walk_tree does not traverse every possible field in
5286 decls, so we have to do our own traversals here. */
5287 add_tree_to_fld_list (t
, fld
);
5289 fld_worklist_push (DECL_NAME (t
), fld
);
5290 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5291 fld_worklist_push (DECL_SIZE (t
), fld
);
5292 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5294 /* We are going to remove everything under DECL_INITIAL for
5295 TYPE_DECLs. No point walking them. */
5296 if (TREE_CODE (t
) != TYPE_DECL
)
5297 fld_worklist_push (DECL_INITIAL (t
), fld
);
5299 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5300 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5302 if (TREE_CODE (t
) == FUNCTION_DECL
)
5304 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5305 fld_worklist_push (DECL_RESULT (t
), fld
);
5307 else if (TREE_CODE (t
) == TYPE_DECL
)
5309 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5311 else if (TREE_CODE (t
) == FIELD_DECL
)
5313 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5314 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5315 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5316 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5319 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5320 && DECL_HAS_VALUE_EXPR_P (t
))
5321 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5323 if (TREE_CODE (t
) != FIELD_DECL
5324 && TREE_CODE (t
) != TYPE_DECL
)
5325 fld_worklist_push (TREE_CHAIN (t
), fld
);
5328 else if (TYPE_P (t
))
5330 /* Note that walk_tree does not traverse every possible field in
5331 types, so we have to do our own traversals here. */
5332 add_tree_to_fld_list (t
, fld
);
5334 if (!RECORD_OR_UNION_TYPE_P (t
))
5335 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5336 fld_worklist_push (TYPE_SIZE (t
), fld
);
5337 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5338 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5339 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5340 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5341 fld_worklist_push (TYPE_NAME (t
), fld
);
5342 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5343 them and thus do not and want not to reach unused pointer types
5345 if (!POINTER_TYPE_P (t
))
5346 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5347 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5348 if (!RECORD_OR_UNION_TYPE_P (t
))
5349 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5350 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5351 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5352 do not and want not to reach unused variants this way. */
5353 if (TYPE_CONTEXT (t
))
5355 tree ctx
= TYPE_CONTEXT (t
);
5356 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5357 So push that instead. */
5358 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5359 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5360 fld_worklist_push (ctx
, fld
);
5362 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5363 and want not to reach unused types this way. */
5365 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5369 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5370 fld_worklist_push (TREE_TYPE (tem
), fld
);
5371 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5373 if (RECORD_OR_UNION_TYPE_P (t
))
5376 /* Push all TYPE_FIELDS - there can be interleaving interesting
5377 and non-interesting things. */
5378 tem
= TYPE_FIELDS (t
);
5381 if (TREE_CODE (tem
) == FIELD_DECL
5382 || (TREE_CODE (tem
) == TYPE_DECL
5383 && !DECL_IGNORED_P (tem
)
5384 && debug_info_level
> DINFO_LEVEL_TERSE
5385 && !is_redundant_typedef (tem
)))
5386 fld_worklist_push (tem
, fld
);
5387 tem
= TREE_CHAIN (tem
);
5391 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5394 else if (TREE_CODE (t
) == BLOCK
)
5397 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5398 fld_worklist_push (tem
, fld
);
5399 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5400 fld_worklist_push (tem
, fld
);
5401 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5404 if (TREE_CODE (t
) != IDENTIFIER_NODE
5405 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5406 fld_worklist_push (TREE_TYPE (t
), fld
);
5412 /* Find decls and types in T. */
5415 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5419 if (!fld
->pset
.contains (t
))
5420 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5421 if (fld
->worklist
.is_empty ())
5423 t
= fld
->worklist
.pop ();
5427 /* Translate all the types in LIST with the corresponding runtime
5431 get_eh_types_for_runtime (tree list
)
5435 if (list
== NULL_TREE
)
5438 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5440 list
= TREE_CHAIN (list
);
5443 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5444 TREE_CHAIN (prev
) = n
;
5445 prev
= TREE_CHAIN (prev
);
5446 list
= TREE_CHAIN (list
);
5453 /* Find decls and types referenced in EH region R and store them in
5454 FLD->DECLS and FLD->TYPES. */
5457 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5468 /* The types referenced in each catch must first be changed to the
5469 EH types used at runtime. This removes references to FE types
5471 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5473 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5474 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5479 case ERT_ALLOWED_EXCEPTIONS
:
5480 r
->u
.allowed
.type_list
5481 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5482 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5485 case ERT_MUST_NOT_THROW
:
5486 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5487 find_decls_types_r
, fld
, &fld
->pset
);
5493 /* Find decls and types referenced in cgraph node N and store them in
5494 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5495 look for *every* kind of DECL and TYPE node reachable from N,
5496 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5497 NAMESPACE_DECLs, etc). */
5500 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5503 struct function
*fn
;
5507 find_decls_types (n
->decl
, fld
);
5509 if (!gimple_has_body_p (n
->decl
))
5512 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5514 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5516 /* Traverse locals. */
5517 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5518 find_decls_types (t
, fld
);
5520 /* Traverse EH regions in FN. */
5523 FOR_ALL_EH_REGION_FN (r
, fn
)
5524 find_decls_types_in_eh_region (r
, fld
);
5527 /* Traverse every statement in FN. */
5528 FOR_EACH_BB_FN (bb
, fn
)
5531 gimple_stmt_iterator si
;
5534 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5536 gphi
*phi
= psi
.phi ();
5538 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5540 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5541 find_decls_types (*arg_p
, fld
);
5545 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5547 gimple
*stmt
= gsi_stmt (si
);
5549 if (is_gimple_call (stmt
))
5550 find_decls_types (gimple_call_fntype (stmt
), fld
);
5552 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5554 tree arg
= gimple_op (stmt
, i
);
5555 find_decls_types (arg
, fld
);
5562 /* Find decls and types referenced in varpool node N and store them in
5563 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5564 look for *every* kind of DECL and TYPE node reachable from N,
5565 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5566 NAMESPACE_DECLs, etc). */
5569 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5571 find_decls_types (v
->decl
, fld
);
5574 /* If T needs an assembler name, have one created for it. */
5577 assign_assembler_name_if_needed (tree t
)
5579 if (need_assembler_name_p (t
))
5581 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5582 diagnostics that use input_location to show locus
5583 information. The problem here is that, at this point,
5584 input_location is generally anchored to the end of the file
5585 (since the parser is long gone), so we don't have a good
5586 position to pin it to.
5588 To alleviate this problem, this uses the location of T's
5589 declaration. Examples of this are
5590 testsuite/g++.dg/template/cond2.C and
5591 testsuite/g++.dg/template/pr35240.C. */
5592 location_t saved_location
= input_location
;
5593 input_location
= DECL_SOURCE_LOCATION (t
);
5595 decl_assembler_name (t
);
5597 input_location
= saved_location
;
5602 /* Free language specific information for every operand and expression
5603 in every node of the call graph. This process operates in three stages:
5605 1- Every callgraph node and varpool node is traversed looking for
5606 decls and types embedded in them. This is a more exhaustive
5607 search than that done by find_referenced_vars, because it will
5608 also collect individual fields, decls embedded in types, etc.
5610 2- All the decls found are sent to free_lang_data_in_decl.
5612 3- All the types found are sent to free_lang_data_in_type.
5614 The ordering between decls and types is important because
5615 free_lang_data_in_decl sets assembler names, which includes
5616 mangling. So types cannot be freed up until assembler names have
5620 free_lang_data_in_cgraph (void)
5622 struct cgraph_node
*n
;
5624 struct free_lang_data_d fld
;
5629 /* Find decls and types in the body of every function in the callgraph. */
5630 FOR_EACH_FUNCTION (n
)
5631 find_decls_types_in_node (n
, &fld
);
5633 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5634 find_decls_types (p
->decl
, &fld
);
5636 /* Find decls and types in every varpool symbol. */
5637 FOR_EACH_VARIABLE (v
)
5638 find_decls_types_in_var (v
, &fld
);
5640 /* Set the assembler name on every decl found. We need to do this
5641 now because free_lang_data_in_decl will invalidate data needed
5642 for mangling. This breaks mangling on interdependent decls. */
5643 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5644 assign_assembler_name_if_needed (t
);
5646 /* Traverse every decl found freeing its language data. */
5647 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5648 free_lang_data_in_decl (t
);
5650 /* Traverse every type found freeing its language data. */
5651 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5652 free_lang_data_in_type (t
);
5655 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5661 /* Free resources that are used by FE but are not needed once they are done. */
5664 free_lang_data (void)
5668 /* If we are the LTO frontend we have freed lang-specific data already. */
5670 || (!flag_generate_lto
&& !flag_generate_offload
))
5673 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5674 if (vec_safe_is_empty (all_translation_units
))
5675 build_translation_unit_decl (NULL_TREE
);
5677 /* Allocate and assign alias sets to the standard integer types
5678 while the slots are still in the way the frontends generated them. */
5679 for (i
= 0; i
< itk_none
; ++i
)
5680 if (integer_types
[i
])
5681 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5683 /* Traverse the IL resetting language specific information for
5684 operands, expressions, etc. */
5685 free_lang_data_in_cgraph ();
5687 /* Create gimple variants for common types. */
5688 for (unsigned i
= 0;
5689 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5691 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5693 /* Reset some langhooks. Do not reset types_compatible_p, it may
5694 still be used indirectly via the get_alias_set langhook. */
5695 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5696 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5697 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5699 /* We do not want the default decl_assembler_name implementation,
5700 rather if we have fixed everything we want a wrapper around it
5701 asserting that all non-local symbols already got their assembler
5702 name and only produce assembler names for local symbols. Or rather
5703 make sure we never call decl_assembler_name on local symbols and
5704 devise a separate, middle-end private scheme for it. */
5706 /* Reset diagnostic machinery. */
5707 tree_diagnostics_defaults (global_dc
);
5715 const pass_data pass_data_ipa_free_lang_data
=
5717 SIMPLE_IPA_PASS
, /* type */
5718 "*free_lang_data", /* name */
5719 OPTGROUP_NONE
, /* optinfo_flags */
5720 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5721 0, /* properties_required */
5722 0, /* properties_provided */
5723 0, /* properties_destroyed */
5724 0, /* todo_flags_start */
5725 0, /* todo_flags_finish */
5728 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5731 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5732 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5735 /* opt_pass methods: */
5736 virtual unsigned int execute (function
*) { return free_lang_data (); }
5738 }; // class pass_ipa_free_lang_data
5742 simple_ipa_opt_pass
*
5743 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5745 return new pass_ipa_free_lang_data (ctxt
);
5748 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5749 of the various TYPE_QUAL values. */
5752 set_type_quals (tree type
, int type_quals
)
5754 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5755 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5756 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5757 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5758 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5761 /* Returns true iff CAND and BASE have equivalent language-specific
5765 check_lang_type (const_tree cand
, const_tree base
)
5767 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5769 /* type_hash_eq currently only applies to these types. */
5770 if (TREE_CODE (cand
) != FUNCTION_TYPE
5771 && TREE_CODE (cand
) != METHOD_TYPE
)
5773 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5776 /* Returns true iff unqualified CAND and BASE are equivalent. */
5779 check_base_type (const_tree cand
, const_tree base
)
5781 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5782 /* Apparently this is needed for Objective-C. */
5783 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5784 /* Check alignment. */
5785 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5786 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5787 TYPE_ATTRIBUTES (base
)));
5790 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5793 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5795 return (TYPE_QUALS (cand
) == type_quals
5796 && check_base_type (cand
, base
)
5797 && check_lang_type (cand
, base
));
5800 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5803 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5805 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5806 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5807 /* Apparently this is needed for Objective-C. */
5808 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5809 /* Check alignment. */
5810 && TYPE_ALIGN (cand
) == align
5811 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5812 TYPE_ATTRIBUTES (base
))
5813 && check_lang_type (cand
, base
));
5816 /* This function checks to see if TYPE matches the size one of the built-in
5817 atomic types, and returns that core atomic type. */
5820 find_atomic_core_type (tree type
)
5822 tree base_atomic_type
;
5824 /* Only handle complete types. */
5825 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
5828 switch (tree_to_uhwi (TYPE_SIZE (type
)))
5831 base_atomic_type
= atomicQI_type_node
;
5835 base_atomic_type
= atomicHI_type_node
;
5839 base_atomic_type
= atomicSI_type_node
;
5843 base_atomic_type
= atomicDI_type_node
;
5847 base_atomic_type
= atomicTI_type_node
;
5851 base_atomic_type
= NULL_TREE
;
5854 return base_atomic_type
;
5857 /* Return a version of the TYPE, qualified as indicated by the
5858 TYPE_QUALS, if one exists. If no qualified version exists yet,
5859 return NULL_TREE. */
5862 get_qualified_type (tree type
, int type_quals
)
5866 if (TYPE_QUALS (type
) == type_quals
)
5869 /* Search the chain of variants to see if there is already one there just
5870 like the one we need to have. If so, use that existing one. We must
5871 preserve the TYPE_NAME, since there is code that depends on this. */
5872 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5873 if (check_qualified_type (t
, type
, type_quals
))
5879 /* Like get_qualified_type, but creates the type if it does not
5880 exist. This function never returns NULL_TREE. */
5883 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
5887 /* See if we already have the appropriate qualified variant. */
5888 t
= get_qualified_type (type
, type_quals
);
5890 /* If not, build it. */
5893 t
= build_variant_type_copy (type PASS_MEM_STAT
);
5894 set_type_quals (t
, type_quals
);
5896 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
5898 /* See if this object can map to a basic atomic type. */
5899 tree atomic_type
= find_atomic_core_type (type
);
5902 /* Ensure the alignment of this type is compatible with
5903 the required alignment of the atomic type. */
5904 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
5905 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
5909 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5910 /* Propagate structural equality. */
5911 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5912 else if (TYPE_CANONICAL (type
) != type
)
5913 /* Build the underlying canonical type, since it is different
5916 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
5917 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
5920 /* T is its own canonical type. */
5921 TYPE_CANONICAL (t
) = t
;
5928 /* Create a variant of type T with alignment ALIGN. */
5931 build_aligned_type (tree type
, unsigned int align
)
5935 if (TYPE_PACKED (type
)
5936 || TYPE_ALIGN (type
) == align
)
5939 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5940 if (check_aligned_type (t
, type
, align
))
5943 t
= build_variant_type_copy (type
);
5944 SET_TYPE_ALIGN (t
, align
);
5945 TYPE_USER_ALIGN (t
) = 1;
5950 /* Create a new distinct copy of TYPE. The new type is made its own
5951 MAIN_VARIANT. If TYPE requires structural equality checks, the
5952 resulting type requires structural equality checks; otherwise, its
5953 TYPE_CANONICAL points to itself. */
5956 build_distinct_type_copy (tree type MEM_STAT_DECL
)
5958 tree t
= copy_node (type PASS_MEM_STAT
);
5960 TYPE_POINTER_TO (t
) = 0;
5961 TYPE_REFERENCE_TO (t
) = 0;
5963 /* Set the canonical type either to a new equivalence class, or
5964 propagate the need for structural equality checks. */
5965 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5966 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5968 TYPE_CANONICAL (t
) = t
;
5970 /* Make it its own variant. */
5971 TYPE_MAIN_VARIANT (t
) = t
;
5972 TYPE_NEXT_VARIANT (t
) = 0;
5974 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5975 whose TREE_TYPE is not t. This can also happen in the Ada
5976 frontend when using subtypes. */
5981 /* Create a new variant of TYPE, equivalent but distinct. This is so
5982 the caller can modify it. TYPE_CANONICAL for the return type will
5983 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5984 are considered equal by the language itself (or that both types
5985 require structural equality checks). */
5988 build_variant_type_copy (tree type MEM_STAT_DECL
)
5990 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5992 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
5994 /* Since we're building a variant, assume that it is a non-semantic
5995 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5996 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5997 /* Type variants have no alias set defined. */
5998 TYPE_ALIAS_SET (t
) = -1;
6000 /* Add the new type to the chain of variants of TYPE. */
6001 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6002 TYPE_NEXT_VARIANT (m
) = t
;
6003 TYPE_MAIN_VARIANT (t
) = m
;
6008 /* Return true if the from tree in both tree maps are equal. */
6011 tree_map_base_eq (const void *va
, const void *vb
)
6013 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6014 *const b
= (const struct tree_map_base
*) vb
;
6015 return (a
->from
== b
->from
);
6018 /* Hash a from tree in a tree_base_map. */
6021 tree_map_base_hash (const void *item
)
6023 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6026 /* Return true if this tree map structure is marked for garbage collection
6027 purposes. We simply return true if the from tree is marked, so that this
6028 structure goes away when the from tree goes away. */
6031 tree_map_base_marked_p (const void *p
)
6033 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6036 /* Hash a from tree in a tree_map. */
6039 tree_map_hash (const void *item
)
6041 return (((const struct tree_map
*) item
)->hash
);
6044 /* Hash a from tree in a tree_decl_map. */
6047 tree_decl_map_hash (const void *item
)
6049 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6052 /* Return the initialization priority for DECL. */
6055 decl_init_priority_lookup (tree decl
)
6057 symtab_node
*snode
= symtab_node::get (decl
);
6060 return DEFAULT_INIT_PRIORITY
;
6062 snode
->get_init_priority ();
6065 /* Return the finalization priority for DECL. */
6068 decl_fini_priority_lookup (tree decl
)
6070 cgraph_node
*node
= cgraph_node::get (decl
);
6073 return DEFAULT_INIT_PRIORITY
;
6075 node
->get_fini_priority ();
6078 /* Set the initialization priority for DECL to PRIORITY. */
6081 decl_init_priority_insert (tree decl
, priority_type priority
)
6083 struct symtab_node
*snode
;
6085 if (priority
== DEFAULT_INIT_PRIORITY
)
6087 snode
= symtab_node::get (decl
);
6091 else if (VAR_P (decl
))
6092 snode
= varpool_node::get_create (decl
);
6094 snode
= cgraph_node::get_create (decl
);
6095 snode
->set_init_priority (priority
);
6098 /* Set the finalization priority for DECL to PRIORITY. */
6101 decl_fini_priority_insert (tree decl
, priority_type priority
)
6103 struct cgraph_node
*node
;
6105 if (priority
== DEFAULT_INIT_PRIORITY
)
6107 node
= cgraph_node::get (decl
);
6112 node
= cgraph_node::get_create (decl
);
6113 node
->set_fini_priority (priority
);
6116 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6119 print_debug_expr_statistics (void)
6121 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6122 (long) debug_expr_for_decl
->size (),
6123 (long) debug_expr_for_decl
->elements (),
6124 debug_expr_for_decl
->collisions ());
6127 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6130 print_value_expr_statistics (void)
6132 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6133 (long) value_expr_for_decl
->size (),
6134 (long) value_expr_for_decl
->elements (),
6135 value_expr_for_decl
->collisions ());
6138 /* Lookup a debug expression for FROM, and return it if we find one. */
6141 decl_debug_expr_lookup (tree from
)
6143 struct tree_decl_map
*h
, in
;
6144 in
.base
.from
= from
;
6146 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6152 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6155 decl_debug_expr_insert (tree from
, tree to
)
6157 struct tree_decl_map
*h
;
6159 h
= ggc_alloc
<tree_decl_map
> ();
6160 h
->base
.from
= from
;
6162 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6165 /* Lookup a value expression for FROM, and return it if we find one. */
6168 decl_value_expr_lookup (tree from
)
6170 struct tree_decl_map
*h
, in
;
6171 in
.base
.from
= from
;
6173 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6179 /* Insert a mapping FROM->TO in the value expression hashtable. */
6182 decl_value_expr_insert (tree from
, tree to
)
6184 struct tree_decl_map
*h
;
6186 h
= ggc_alloc
<tree_decl_map
> ();
6187 h
->base
.from
= from
;
6189 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6192 /* Lookup a vector of debug arguments for FROM, and return it if we
6196 decl_debug_args_lookup (tree from
)
6198 struct tree_vec_map
*h
, in
;
6200 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6202 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6203 in
.base
.from
= from
;
6204 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6210 /* Insert a mapping FROM->empty vector of debug arguments in the value
6211 expression hashtable. */
6214 decl_debug_args_insert (tree from
)
6216 struct tree_vec_map
*h
;
6219 if (DECL_HAS_DEBUG_ARGS_P (from
))
6220 return decl_debug_args_lookup (from
);
6221 if (debug_args_for_decl
== NULL
)
6222 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6223 h
= ggc_alloc
<tree_vec_map
> ();
6224 h
->base
.from
= from
;
6226 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6228 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6232 /* Hashing of types so that we don't make duplicates.
6233 The entry point is `type_hash_canon'. */
6235 /* Generate the default hash code for TYPE. This is designed for
6236 speed, rather than maximum entropy. */
6239 type_hash_canon_hash (tree type
)
6241 inchash::hash hstate
;
6243 hstate
.add_int (TREE_CODE (type
));
6245 if (TREE_TYPE (type
))
6246 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6248 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6249 /* Just the identifier is adequate to distinguish. */
6250 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6252 switch (TREE_CODE (type
))
6255 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6258 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6259 if (TREE_VALUE (t
) != error_mark_node
)
6260 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6264 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6269 if (TYPE_DOMAIN (type
))
6270 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6271 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6273 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6274 hstate
.add_object (typeless
);
6281 tree t
= TYPE_MAX_VALUE (type
);
6283 t
= TYPE_MIN_VALUE (type
);
6284 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6285 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6290 case FIXED_POINT_TYPE
:
6292 unsigned prec
= TYPE_PRECISION (type
);
6293 hstate
.add_object (prec
);
6299 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
6300 hstate
.add_object (nunits
);
6308 return hstate
.end ();
6311 /* These are the Hashtable callback functions. */
6313 /* Returns true iff the types are equivalent. */
6316 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6318 /* First test the things that are the same for all types. */
6319 if (a
->hash
!= b
->hash
6320 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6321 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6322 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6323 TYPE_ATTRIBUTES (b
->type
))
6324 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6325 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6328 /* Be careful about comparing arrays before and after the element type
6329 has been completed; don't compare TYPE_ALIGN unless both types are
6331 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6332 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6333 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6336 switch (TREE_CODE (a
->type
))
6341 case REFERENCE_TYPE
:
6346 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6349 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6350 && !(TYPE_VALUES (a
->type
)
6351 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6352 && TYPE_VALUES (b
->type
)
6353 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6354 && type_list_equal (TYPE_VALUES (a
->type
),
6355 TYPE_VALUES (b
->type
))))
6363 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6365 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6366 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6367 TYPE_MAX_VALUE (b
->type
)))
6368 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6369 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6370 TYPE_MIN_VALUE (b
->type
))));
6372 case FIXED_POINT_TYPE
:
6373 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6376 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6379 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6380 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6381 || (TYPE_ARG_TYPES (a
->type
)
6382 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6383 && TYPE_ARG_TYPES (b
->type
)
6384 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6385 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6386 TYPE_ARG_TYPES (b
->type
)))))
6390 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6391 where the flag should be inherited from the element type
6392 and can change after ARRAY_TYPEs are created; on non-aggregates
6393 compare it and hash it, scalars will never have that flag set
6394 and we need to differentiate between arrays created by different
6395 front-ends or middle-end created arrays. */
6396 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6397 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6398 || (TYPE_TYPELESS_STORAGE (a
->type
)
6399 == TYPE_TYPELESS_STORAGE (b
->type
))));
6403 case QUAL_UNION_TYPE
:
6404 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6405 || (TYPE_FIELDS (a
->type
)
6406 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6407 && TYPE_FIELDS (b
->type
)
6408 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6409 && type_list_equal (TYPE_FIELDS (a
->type
),
6410 TYPE_FIELDS (b
->type
))));
6413 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6414 || (TYPE_ARG_TYPES (a
->type
)
6415 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6416 && TYPE_ARG_TYPES (b
->type
)
6417 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6418 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6419 TYPE_ARG_TYPES (b
->type
))))
6427 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6428 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6433 /* Given TYPE, and HASHCODE its hash code, return the canonical
6434 object for an identical type if one already exists.
6435 Otherwise, return TYPE, and record it as the canonical object.
6437 To use this function, first create a type of the sort you want.
6438 Then compute its hash code from the fields of the type that
6439 make it different from other similar types.
6440 Then call this function and use the value. */
6443 type_hash_canon (unsigned int hashcode
, tree type
)
6448 /* The hash table only contains main variants, so ensure that's what we're
6450 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6452 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6453 must call that routine before comparing TYPE_ALIGNs. */
6459 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6462 tree t1
= ((type_hash
*) *loc
)->type
;
6463 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6464 if (TYPE_UID (type
) + 1 == next_type_uid
)
6466 /* Free also min/max values and the cache for integer
6467 types. This can't be done in free_node, as LTO frees
6468 those on its own. */
6469 if (TREE_CODE (type
) == INTEGER_TYPE
)
6471 if (TYPE_MIN_VALUE (type
)
6472 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6473 ggc_free (TYPE_MIN_VALUE (type
));
6474 if (TYPE_MAX_VALUE (type
)
6475 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6476 ggc_free (TYPE_MAX_VALUE (type
));
6477 if (TYPE_CACHED_VALUES_P (type
))
6478 ggc_free (TYPE_CACHED_VALUES (type
));
6485 struct type_hash
*h
;
6487 h
= ggc_alloc
<type_hash
> ();
6497 print_type_hash_statistics (void)
6499 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6500 (long) type_hash_table
->size (),
6501 (long) type_hash_table
->elements (),
6502 type_hash_table
->collisions ());
6505 /* Given two lists of types
6506 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6507 return 1 if the lists contain the same types in the same order.
6508 Also, the TREE_PURPOSEs must match. */
6511 type_list_equal (const_tree l1
, const_tree l2
)
6515 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6516 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6517 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6518 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6519 && (TREE_TYPE (TREE_PURPOSE (t1
))
6520 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6526 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6527 given by TYPE. If the argument list accepts variable arguments,
6528 then this function counts only the ordinary arguments. */
6531 type_num_arguments (const_tree type
)
6536 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6537 /* If the function does not take a variable number of arguments,
6538 the last element in the list will have type `void'. */
6539 if (VOID_TYPE_P (TREE_VALUE (t
)))
6547 /* Nonzero if integer constants T1 and T2
6548 represent the same constant value. */
6551 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6556 if (t1
== 0 || t2
== 0)
6559 if (TREE_CODE (t1
) == INTEGER_CST
6560 && TREE_CODE (t2
) == INTEGER_CST
6561 && wi::to_widest (t1
) == wi::to_widest (t2
))
6567 /* Return true if T is an INTEGER_CST whose numerical value (extended
6568 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6571 tree_fits_shwi_p (const_tree t
)
6573 return (t
!= NULL_TREE
6574 && TREE_CODE (t
) == INTEGER_CST
6575 && wi::fits_shwi_p (wi::to_widest (t
)));
6578 /* Return true if T is an INTEGER_CST whose numerical value (extended
6579 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6582 tree_fits_uhwi_p (const_tree t
)
6584 return (t
!= NULL_TREE
6585 && TREE_CODE (t
) == INTEGER_CST
6586 && wi::fits_uhwi_p (wi::to_widest (t
)));
6589 /* T is an INTEGER_CST whose numerical value (extended according to
6590 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6594 tree_to_shwi (const_tree t
)
6596 gcc_assert (tree_fits_shwi_p (t
));
6597 return TREE_INT_CST_LOW (t
);
6600 /* T is an INTEGER_CST whose numerical value (extended according to
6601 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6604 unsigned HOST_WIDE_INT
6605 tree_to_uhwi (const_tree t
)
6607 gcc_assert (tree_fits_uhwi_p (t
));
6608 return TREE_INT_CST_LOW (t
);
6611 /* Return the most significant (sign) bit of T. */
6614 tree_int_cst_sign_bit (const_tree t
)
6616 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6618 return wi::extract_uhwi (wi::to_wide (t
), bitno
, 1);
6621 /* Return an indication of the sign of the integer constant T.
6622 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6623 Note that -1 will never be returned if T's type is unsigned. */
6626 tree_int_cst_sgn (const_tree t
)
6628 if (wi::to_wide (t
) == 0)
6630 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6632 else if (wi::neg_p (wi::to_wide (t
)))
6638 /* Return the minimum number of bits needed to represent VALUE in a
6639 signed or unsigned type, UNSIGNEDP says which. */
6642 tree_int_cst_min_precision (tree value
, signop sgn
)
6644 /* If the value is negative, compute its negative minus 1. The latter
6645 adjustment is because the absolute value of the largest negative value
6646 is one larger than the largest positive value. This is equivalent to
6647 a bit-wise negation, so use that operation instead. */
6649 if (tree_int_cst_sgn (value
) < 0)
6650 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6652 /* Return the number of bits needed, taking into account the fact
6653 that we need one more bit for a signed than unsigned type.
6654 If value is 0 or -1, the minimum precision is 1 no matter
6655 whether unsignedp is true or false. */
6657 if (integer_zerop (value
))
6660 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6663 /* Return truthvalue of whether T1 is the same tree structure as T2.
6664 Return 1 if they are the same.
6665 Return 0 if they are understandably different.
6666 Return -1 if either contains tree structure not understood by
6670 simple_cst_equal (const_tree t1
, const_tree t2
)
6672 enum tree_code code1
, code2
;
6678 if (t1
== 0 || t2
== 0)
6681 code1
= TREE_CODE (t1
);
6682 code2
= TREE_CODE (t2
);
6684 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6686 if (CONVERT_EXPR_CODE_P (code2
)
6687 || code2
== NON_LVALUE_EXPR
)
6688 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6690 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6693 else if (CONVERT_EXPR_CODE_P (code2
)
6694 || code2
== NON_LVALUE_EXPR
)
6695 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6703 return wi::to_widest (t1
) == wi::to_widest (t2
);
6706 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6709 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6712 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6713 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6714 TREE_STRING_LENGTH (t1
)));
6718 unsigned HOST_WIDE_INT idx
;
6719 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6720 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6722 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6725 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6726 /* ??? Should we handle also fields here? */
6727 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6733 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6736 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6739 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6742 const_tree arg1
, arg2
;
6743 const_call_expr_arg_iterator iter1
, iter2
;
6744 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6745 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6747 arg1
= next_const_call_expr_arg (&iter1
),
6748 arg2
= next_const_call_expr_arg (&iter2
))
6750 cmp
= simple_cst_equal (arg1
, arg2
);
6754 return arg1
== arg2
;
6758 /* Special case: if either target is an unallocated VAR_DECL,
6759 it means that it's going to be unified with whatever the
6760 TARGET_EXPR is really supposed to initialize, so treat it
6761 as being equivalent to anything. */
6762 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6763 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6764 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6765 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6766 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6767 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6770 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6775 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6777 case WITH_CLEANUP_EXPR
:
6778 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6782 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6785 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6786 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6800 /* This general rule works for most tree codes. All exceptions should be
6801 handled above. If this is a language-specific tree code, we can't
6802 trust what might be in the operand, so say we don't know
6804 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6807 switch (TREE_CODE_CLASS (code1
))
6811 case tcc_comparison
:
6812 case tcc_expression
:
6816 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6818 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6830 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6831 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6832 than U, respectively. */
6835 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6837 if (tree_int_cst_sgn (t
) < 0)
6839 else if (!tree_fits_uhwi_p (t
))
6841 else if (TREE_INT_CST_LOW (t
) == u
)
6843 else if (TREE_INT_CST_LOW (t
) < u
)
6849 /* Return true if SIZE represents a constant size that is in bounds of
6850 what the middle-end and the backend accepts (covering not more than
6851 half of the address-space). */
6854 valid_constant_size_p (const_tree size
)
6856 if (! tree_fits_uhwi_p (size
)
6857 || TREE_OVERFLOW (size
)
6858 || tree_int_cst_sign_bit (size
) != 0)
6863 /* Return the precision of the type, or for a complex or vector type the
6864 precision of the type of its elements. */
6867 element_precision (const_tree type
)
6870 type
= TREE_TYPE (type
);
6871 enum tree_code code
= TREE_CODE (type
);
6872 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6873 type
= TREE_TYPE (type
);
6875 return TYPE_PRECISION (type
);
6878 /* Return true if CODE represents an associative tree code. Otherwise
6881 associative_tree_code (enum tree_code code
)
6900 /* Return true if CODE represents a commutative tree code. Otherwise
6903 commutative_tree_code (enum tree_code code
)
6909 case MULT_HIGHPART_EXPR
:
6917 case UNORDERED_EXPR
:
6921 case TRUTH_AND_EXPR
:
6922 case TRUTH_XOR_EXPR
:
6924 case WIDEN_MULT_EXPR
:
6925 case VEC_WIDEN_MULT_HI_EXPR
:
6926 case VEC_WIDEN_MULT_LO_EXPR
:
6927 case VEC_WIDEN_MULT_EVEN_EXPR
:
6928 case VEC_WIDEN_MULT_ODD_EXPR
:
6937 /* Return true if CODE represents a ternary tree code for which the
6938 first two operands are commutative. Otherwise return false. */
6940 commutative_ternary_tree_code (enum tree_code code
)
6944 case WIDEN_MULT_PLUS_EXPR
:
6945 case WIDEN_MULT_MINUS_EXPR
:
6956 /* Returns true if CODE can overflow. */
6959 operation_can_overflow (enum tree_code code
)
6967 /* Can overflow in various ways. */
6969 case TRUNC_DIV_EXPR
:
6970 case EXACT_DIV_EXPR
:
6971 case FLOOR_DIV_EXPR
:
6973 /* For INT_MIN / -1. */
6980 /* These operators cannot overflow. */
6985 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6986 ftrapv doesn't generate trapping insns for CODE. */
6989 operation_no_trapping_overflow (tree type
, enum tree_code code
)
6991 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
6993 /* We don't generate instructions that trap on overflow for complex or vector
6995 if (!INTEGRAL_TYPE_P (type
))
6998 if (!TYPE_OVERFLOW_TRAPS (type
))
7008 /* These operators can overflow, and -ftrapv generates trapping code for
7011 case TRUNC_DIV_EXPR
:
7012 case EXACT_DIV_EXPR
:
7013 case FLOOR_DIV_EXPR
:
7016 /* These operators can overflow, but -ftrapv does not generate trapping
7020 /* These operators cannot overflow. */
7028 /* Generate a hash value for an expression. This can be used iteratively
7029 by passing a previous result as the HSTATE argument.
7031 This function is intended to produce the same hash for expressions which
7032 would compare equal using operand_equal_p. */
7034 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7037 enum tree_code code
;
7038 enum tree_code_class tclass
;
7040 if (t
== NULL_TREE
|| t
== error_mark_node
)
7042 hstate
.merge_hash (0);
7046 if (!(flags
& OEP_ADDRESS_OF
))
7049 code
= TREE_CODE (t
);
7053 /* Alas, constants aren't shared, so we can't rely on pointer
7056 hstate
.merge_hash (0);
7059 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7060 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7061 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7066 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7069 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7070 hstate
.merge_hash (val2
);
7075 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7076 hstate
.merge_hash (val2
);
7080 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7081 TREE_STRING_LENGTH (t
));
7084 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7085 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7090 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7091 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7095 /* We can just compare by pointer. */
7096 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7098 case PLACEHOLDER_EXPR
:
7099 /* The node itself doesn't matter. */
7106 /* A list of expressions, for a CALL_EXPR or as the elements of a
7108 for (; t
; t
= TREE_CHAIN (t
))
7109 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7113 unsigned HOST_WIDE_INT idx
;
7115 flags
&= ~OEP_ADDRESS_OF
;
7116 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7118 inchash::add_expr (field
, hstate
, flags
);
7119 inchash::add_expr (value
, hstate
, flags
);
7123 case STATEMENT_LIST
:
7125 tree_stmt_iterator i
;
7126 for (i
= tsi_start (CONST_CAST_TREE (t
));
7127 !tsi_end_p (i
); tsi_next (&i
))
7128 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7132 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7133 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7136 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7137 Otherwise nodes that compare equal according to operand_equal_p might
7138 get different hash codes. However, don't do this for machine specific
7139 or front end builtins, since the function code is overloaded in those
7141 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7142 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7144 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7145 code
= TREE_CODE (t
);
7149 tclass
= TREE_CODE_CLASS (code
);
7151 if (tclass
== tcc_declaration
)
7153 /* DECL's have a unique ID */
7154 hstate
.add_wide_int (DECL_UID (t
));
7156 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7158 /* For comparisons that can be swapped, use the lower
7160 enum tree_code ccode
= swap_tree_comparison (code
);
7163 hstate
.add_object (ccode
);
7164 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7165 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7167 else if (CONVERT_EXPR_CODE_P (code
))
7169 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7171 enum tree_code ccode
= NOP_EXPR
;
7172 hstate
.add_object (ccode
);
7174 /* Don't hash the type, that can lead to having nodes which
7175 compare equal according to operand_equal_p, but which
7176 have different hash codes. Make sure to include signedness
7177 in the hash computation. */
7178 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7179 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7181 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7182 else if (code
== MEM_REF
7183 && (flags
& OEP_ADDRESS_OF
) != 0
7184 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7185 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7186 && integer_zerop (TREE_OPERAND (t
, 1)))
7187 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7189 /* Don't ICE on FE specific trees, or their arguments etc.
7190 during operand_equal_p hash verification. */
7191 else if (!IS_EXPR_CODE_CLASS (tclass
))
7192 gcc_assert (flags
& OEP_HASH_CHECK
);
7195 unsigned int sflags
= flags
;
7197 hstate
.add_object (code
);
7202 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7203 flags
|= OEP_ADDRESS_OF
;
7209 case TARGET_MEM_REF
:
7210 flags
&= ~OEP_ADDRESS_OF
;
7215 case ARRAY_RANGE_REF
:
7218 sflags
&= ~OEP_ADDRESS_OF
;
7222 flags
&= ~OEP_ADDRESS_OF
;
7226 case WIDEN_MULT_PLUS_EXPR
:
7227 case WIDEN_MULT_MINUS_EXPR
:
7229 /* The multiplication operands are commutative. */
7230 inchash::hash one
, two
;
7231 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7232 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7233 hstate
.add_commutative (one
, two
);
7234 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7239 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7240 hstate
.add_int (CALL_EXPR_IFN (t
));
7244 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7245 Usually different TARGET_EXPRs just should use
7246 different temporaries in their slots. */
7247 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7254 /* Don't hash the type, that can lead to having nodes which
7255 compare equal according to operand_equal_p, but which
7256 have different hash codes. */
7257 if (code
== NON_LVALUE_EXPR
)
7259 /* Make sure to include signness in the hash computation. */
7260 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7261 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7264 else if (commutative_tree_code (code
))
7266 /* It's a commutative expression. We want to hash it the same
7267 however it appears. We do this by first hashing both operands
7268 and then rehashing based on the order of their independent
7270 inchash::hash one
, two
;
7271 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7272 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7273 hstate
.add_commutative (one
, two
);
7276 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7277 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7278 i
== 0 ? flags
: sflags
);
7286 /* Constructors for pointer, array and function types.
7287 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7288 constructed by language-dependent code, not here.) */
7290 /* Construct, lay out and return the type of pointers to TO_TYPE with
7291 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7292 reference all of memory. If such a type has already been
7293 constructed, reuse it. */
7296 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7300 bool could_alias
= can_alias_all
;
7302 if (to_type
== error_mark_node
)
7303 return error_mark_node
;
7305 /* If the pointed-to type has the may_alias attribute set, force
7306 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7307 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7308 can_alias_all
= true;
7310 /* In some cases, languages will have things that aren't a POINTER_TYPE
7311 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7312 In that case, return that type without regard to the rest of our
7315 ??? This is a kludge, but consistent with the way this function has
7316 always operated and there doesn't seem to be a good way to avoid this
7318 if (TYPE_POINTER_TO (to_type
) != 0
7319 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7320 return TYPE_POINTER_TO (to_type
);
7322 /* First, if we already have a type for pointers to TO_TYPE and it's
7323 the proper mode, use it. */
7324 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7325 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7328 t
= make_node (POINTER_TYPE
);
7330 TREE_TYPE (t
) = to_type
;
7331 SET_TYPE_MODE (t
, mode
);
7332 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7333 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7334 TYPE_POINTER_TO (to_type
) = t
;
7336 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7337 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7338 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7339 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7341 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7344 /* Lay out the type. This function has many callers that are concerned
7345 with expression-construction, and this simplifies them all. */
7351 /* By default build pointers in ptr_mode. */
7354 build_pointer_type (tree to_type
)
7356 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7357 : TYPE_ADDR_SPACE (to_type
);
7358 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7359 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7362 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7365 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7369 bool could_alias
= can_alias_all
;
7371 if (to_type
== error_mark_node
)
7372 return error_mark_node
;
7374 /* If the pointed-to type has the may_alias attribute set, force
7375 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7376 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7377 can_alias_all
= true;
7379 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7380 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7381 In that case, return that type without regard to the rest of our
7384 ??? This is a kludge, but consistent with the way this function has
7385 always operated and there doesn't seem to be a good way to avoid this
7387 if (TYPE_REFERENCE_TO (to_type
) != 0
7388 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7389 return TYPE_REFERENCE_TO (to_type
);
7391 /* First, if we already have a type for pointers to TO_TYPE and it's
7392 the proper mode, use it. */
7393 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7394 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7397 t
= make_node (REFERENCE_TYPE
);
7399 TREE_TYPE (t
) = to_type
;
7400 SET_TYPE_MODE (t
, mode
);
7401 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7402 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7403 TYPE_REFERENCE_TO (to_type
) = t
;
7405 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7406 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7407 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7408 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7410 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7419 /* Build the node for the type of references-to-TO_TYPE by default
7423 build_reference_type (tree to_type
)
7425 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7426 : TYPE_ADDR_SPACE (to_type
);
7427 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7428 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7431 #define MAX_INT_CACHED_PREC \
7432 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7433 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7435 /* Builds a signed or unsigned integer type of precision PRECISION.
7436 Used for C bitfields whose precision does not match that of
7437 built-in target types. */
7439 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7445 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7447 if (precision
<= MAX_INT_CACHED_PREC
)
7449 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7454 itype
= make_node (INTEGER_TYPE
);
7455 TYPE_PRECISION (itype
) = precision
;
7458 fixup_unsigned_type (itype
);
7460 fixup_signed_type (itype
);
7463 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7464 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7465 if (precision
<= MAX_INT_CACHED_PREC
)
7466 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7471 #define MAX_BOOL_CACHED_PREC \
7472 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7473 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7475 /* Builds a boolean type of precision PRECISION.
7476 Used for boolean vectors to choose proper vector element size. */
7478 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7482 if (precision
<= MAX_BOOL_CACHED_PREC
)
7484 type
= nonstandard_boolean_type_cache
[precision
];
7489 type
= make_node (BOOLEAN_TYPE
);
7490 TYPE_PRECISION (type
) = precision
;
7491 fixup_signed_type (type
);
7493 if (precision
<= MAX_INT_CACHED_PREC
)
7494 nonstandard_boolean_type_cache
[precision
] = type
;
7499 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7500 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7501 is true, reuse such a type that has already been constructed. */
7504 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7506 tree itype
= make_node (INTEGER_TYPE
);
7508 TREE_TYPE (itype
) = type
;
7510 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7511 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7513 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7514 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7515 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7516 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7517 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7518 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7519 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7524 if ((TYPE_MIN_VALUE (itype
)
7525 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7526 || (TYPE_MAX_VALUE (itype
)
7527 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7529 /* Since we cannot reliably merge this type, we need to compare it using
7530 structural equality checks. */
7531 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7535 hashval_t hash
= type_hash_canon_hash (itype
);
7536 itype
= type_hash_canon (hash
, itype
);
7541 /* Wrapper around build_range_type_1 with SHARED set to true. */
7544 build_range_type (tree type
, tree lowval
, tree highval
)
7546 return build_range_type_1 (type
, lowval
, highval
, true);
7549 /* Wrapper around build_range_type_1 with SHARED set to false. */
7552 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7554 return build_range_type_1 (type
, lowval
, highval
, false);
7557 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7558 MAXVAL should be the maximum value in the domain
7559 (one less than the length of the array).
7561 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7562 We don't enforce this limit, that is up to caller (e.g. language front end).
7563 The limit exists because the result is a signed type and we don't handle
7564 sizes that use more than one HOST_WIDE_INT. */
7567 build_index_type (tree maxval
)
7569 return build_range_type (sizetype
, size_zero_node
, maxval
);
7572 /* Return true if the debug information for TYPE, a subtype, should be emitted
7573 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7574 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7575 debug info and doesn't reflect the source code. */
7578 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7580 tree base_type
= TREE_TYPE (type
), low
, high
;
7582 /* Subrange types have a base type which is an integral type. */
7583 if (!INTEGRAL_TYPE_P (base_type
))
7586 /* Get the real bounds of the subtype. */
7587 if (lang_hooks
.types
.get_subrange_bounds
)
7588 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7591 low
= TYPE_MIN_VALUE (type
);
7592 high
= TYPE_MAX_VALUE (type
);
7595 /* If the type and its base type have the same representation and the same
7596 name, then the type is not a subrange but a copy of the base type. */
7597 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7598 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7599 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7600 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7601 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7602 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7612 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7613 and number of elements specified by the range of values of INDEX_TYPE.
7614 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7615 If SHARED is true, reuse such a type that has already been constructed. */
7618 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7623 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7625 error ("arrays of functions are not meaningful");
7626 elt_type
= integer_type_node
;
7629 t
= make_node (ARRAY_TYPE
);
7630 TREE_TYPE (t
) = elt_type
;
7631 TYPE_DOMAIN (t
) = index_type
;
7632 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7633 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7636 /* If the element type is incomplete at this point we get marked for
7637 structural equality. Do not record these types in the canonical
7639 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7644 hashval_t hash
= type_hash_canon_hash (t
);
7645 t
= type_hash_canon (hash
, t
);
7648 if (TYPE_CANONICAL (t
) == t
)
7650 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7651 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7653 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7654 else if (TYPE_CANONICAL (elt_type
) != elt_type
7655 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7657 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7659 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7660 typeless_storage
, shared
);
7666 /* Wrapper around build_array_type_1 with SHARED set to true. */
7669 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7671 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7674 /* Wrapper around build_array_type_1 with SHARED set to false. */
7677 build_nonshared_array_type (tree elt_type
, tree index_type
)
7679 return build_array_type_1 (elt_type
, index_type
, false, false);
7682 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7686 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7688 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7691 /* Recursively examines the array elements of TYPE, until a non-array
7692 element type is found. */
7695 strip_array_types (tree type
)
7697 while (TREE_CODE (type
) == ARRAY_TYPE
)
7698 type
= TREE_TYPE (type
);
7703 /* Computes the canonical argument types from the argument type list
7706 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7707 on entry to this function, or if any of the ARGTYPES are
7710 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7711 true on entry to this function, or if any of the ARGTYPES are
7714 Returns a canonical argument list, which may be ARGTYPES when the
7715 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7716 true) or would not differ from ARGTYPES. */
7719 maybe_canonicalize_argtypes (tree argtypes
,
7720 bool *any_structural_p
,
7721 bool *any_noncanonical_p
)
7724 bool any_noncanonical_argtypes_p
= false;
7726 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7728 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7729 /* Fail gracefully by stating that the type is structural. */
7730 *any_structural_p
= true;
7731 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7732 *any_structural_p
= true;
7733 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7734 || TREE_PURPOSE (arg
))
7735 /* If the argument has a default argument, we consider it
7736 non-canonical even though the type itself is canonical.
7737 That way, different variants of function and method types
7738 with default arguments will all point to the variant with
7739 no defaults as their canonical type. */
7740 any_noncanonical_argtypes_p
= true;
7743 if (*any_structural_p
)
7746 if (any_noncanonical_argtypes_p
)
7748 /* Build the canonical list of argument types. */
7749 tree canon_argtypes
= NULL_TREE
;
7750 bool is_void
= false;
7752 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7754 if (arg
== void_list_node
)
7757 canon_argtypes
= tree_cons (NULL_TREE
,
7758 TYPE_CANONICAL (TREE_VALUE (arg
)),
7762 canon_argtypes
= nreverse (canon_argtypes
);
7764 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7766 /* There is a non-canonical type. */
7767 *any_noncanonical_p
= true;
7768 return canon_argtypes
;
7771 /* The canonical argument types are the same as ARGTYPES. */
7775 /* Construct, lay out and return
7776 the type of functions returning type VALUE_TYPE
7777 given arguments of types ARG_TYPES.
7778 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7779 are data type nodes for the arguments of the function.
7780 If such a type has already been constructed, reuse it. */
7783 build_function_type (tree value_type
, tree arg_types
)
7786 inchash::hash hstate
;
7787 bool any_structural_p
, any_noncanonical_p
;
7788 tree canon_argtypes
;
7790 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7792 error ("function return type cannot be function");
7793 value_type
= integer_type_node
;
7796 /* Make a node of the sort we want. */
7797 t
= make_node (FUNCTION_TYPE
);
7798 TREE_TYPE (t
) = value_type
;
7799 TYPE_ARG_TYPES (t
) = arg_types
;
7801 /* If we already have such a type, use the old one. */
7802 hashval_t hash
= type_hash_canon_hash (t
);
7803 t
= type_hash_canon (hash
, t
);
7805 /* Set up the canonical type. */
7806 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7807 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7808 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7810 &any_noncanonical_p
);
7811 if (any_structural_p
)
7812 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7813 else if (any_noncanonical_p
)
7814 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7817 if (!COMPLETE_TYPE_P (t
))
7822 /* Build a function type. The RETURN_TYPE is the type returned by the
7823 function. If VAARGS is set, no void_type_node is appended to the
7824 list. ARGP must be always be terminated be a NULL_TREE. */
7827 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7831 t
= va_arg (argp
, tree
);
7832 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7833 args
= tree_cons (NULL_TREE
, t
, args
);
7838 if (args
!= NULL_TREE
)
7839 args
= nreverse (args
);
7840 gcc_assert (last
!= void_list_node
);
7842 else if (args
== NULL_TREE
)
7843 args
= void_list_node
;
7847 args
= nreverse (args
);
7848 TREE_CHAIN (last
) = void_list_node
;
7850 args
= build_function_type (return_type
, args
);
7855 /* Build a function type. The RETURN_TYPE is the type returned by the
7856 function. If additional arguments are provided, they are
7857 additional argument types. The list of argument types must always
7858 be terminated by NULL_TREE. */
7861 build_function_type_list (tree return_type
, ...)
7866 va_start (p
, return_type
);
7867 args
= build_function_type_list_1 (false, return_type
, p
);
7872 /* Build a variable argument function type. The RETURN_TYPE is the
7873 type returned by the function. If additional arguments are provided,
7874 they are additional argument types. The list of argument types must
7875 always be terminated by NULL_TREE. */
7878 build_varargs_function_type_list (tree return_type
, ...)
7883 va_start (p
, return_type
);
7884 args
= build_function_type_list_1 (true, return_type
, p
);
7890 /* Build a function type. RETURN_TYPE is the type returned by the
7891 function; VAARGS indicates whether the function takes varargs. The
7892 function takes N named arguments, the types of which are provided in
7896 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7900 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7902 for (i
= n
- 1; i
>= 0; i
--)
7903 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7905 return build_function_type (return_type
, t
);
7908 /* Build a function type. RETURN_TYPE is the type returned by the
7909 function. The function takes N named arguments, the types of which
7910 are provided in ARG_TYPES. */
7913 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7915 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7918 /* Build a variable argument function type. RETURN_TYPE is the type
7919 returned by the function. The function takes N named arguments, the
7920 types of which are provided in ARG_TYPES. */
7923 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7925 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7928 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7929 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7930 for the method. An implicit additional parameter (of type
7931 pointer-to-BASETYPE) is added to the ARGTYPES. */
7934 build_method_type_directly (tree basetype
,
7940 bool any_structural_p
, any_noncanonical_p
;
7941 tree canon_argtypes
;
7943 /* Make a node of the sort we want. */
7944 t
= make_node (METHOD_TYPE
);
7946 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7947 TREE_TYPE (t
) = rettype
;
7948 ptype
= build_pointer_type (basetype
);
7950 /* The actual arglist for this function includes a "hidden" argument
7951 which is "this". Put it into the list of argument types. */
7952 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7953 TYPE_ARG_TYPES (t
) = argtypes
;
7955 /* If we already have such a type, use the old one. */
7956 hashval_t hash
= type_hash_canon_hash (t
);
7957 t
= type_hash_canon (hash
, t
);
7959 /* Set up the canonical type. */
7961 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7962 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7964 = (TYPE_CANONICAL (basetype
) != basetype
7965 || TYPE_CANONICAL (rettype
) != rettype
);
7966 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7968 &any_noncanonical_p
);
7969 if (any_structural_p
)
7970 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7971 else if (any_noncanonical_p
)
7973 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7974 TYPE_CANONICAL (rettype
),
7976 if (!COMPLETE_TYPE_P (t
))
7982 /* Construct, lay out and return the type of methods belonging to class
7983 BASETYPE and whose arguments and values are described by TYPE.
7984 If that type exists already, reuse it.
7985 TYPE must be a FUNCTION_TYPE node. */
7988 build_method_type (tree basetype
, tree type
)
7990 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7992 return build_method_type_directly (basetype
,
7994 TYPE_ARG_TYPES (type
));
7997 /* Construct, lay out and return the type of offsets to a value
7998 of type TYPE, within an object of type BASETYPE.
7999 If a suitable offset type exists already, reuse it. */
8002 build_offset_type (tree basetype
, tree type
)
8006 /* Make a node of the sort we want. */
8007 t
= make_node (OFFSET_TYPE
);
8009 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8010 TREE_TYPE (t
) = type
;
8012 /* If we already have such a type, use the old one. */
8013 hashval_t hash
= type_hash_canon_hash (t
);
8014 t
= type_hash_canon (hash
, t
);
8016 if (!COMPLETE_TYPE_P (t
))
8019 if (TYPE_CANONICAL (t
) == t
)
8021 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8022 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8023 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8024 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8025 || TYPE_CANONICAL (type
) != type
)
8027 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8028 TYPE_CANONICAL (type
));
8034 /* Create a complex type whose components are COMPONENT_TYPE.
8036 If NAMED is true, the type is given a TYPE_NAME. We do not always
8037 do so because this creates a DECL node and thus make the DECL_UIDs
8038 dependent on the type canonicalization hashtable, which is GC-ed,
8039 so the DECL_UIDs would not be stable wrt garbage collection. */
8042 build_complex_type (tree component_type
, bool named
)
8046 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8047 || SCALAR_FLOAT_TYPE_P (component_type
)
8048 || FIXED_POINT_TYPE_P (component_type
));
8050 /* Make a node of the sort we want. */
8051 t
= make_node (COMPLEX_TYPE
);
8053 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8055 /* If we already have such a type, use the old one. */
8056 hashval_t hash
= type_hash_canon_hash (t
);
8057 t
= type_hash_canon (hash
, t
);
8059 if (!COMPLETE_TYPE_P (t
))
8062 if (TYPE_CANONICAL (t
) == t
)
8064 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8065 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8066 else if (TYPE_CANONICAL (component_type
) != component_type
)
8068 = build_complex_type (TYPE_CANONICAL (component_type
), named
);
8071 /* We need to create a name, since complex is a fundamental type. */
8072 if (!TYPE_NAME (t
) && named
)
8075 if (component_type
== char_type_node
)
8076 name
= "complex char";
8077 else if (component_type
== signed_char_type_node
)
8078 name
= "complex signed char";
8079 else if (component_type
== unsigned_char_type_node
)
8080 name
= "complex unsigned char";
8081 else if (component_type
== short_integer_type_node
)
8082 name
= "complex short int";
8083 else if (component_type
== short_unsigned_type_node
)
8084 name
= "complex short unsigned int";
8085 else if (component_type
== integer_type_node
)
8086 name
= "complex int";
8087 else if (component_type
== unsigned_type_node
)
8088 name
= "complex unsigned int";
8089 else if (component_type
== long_integer_type_node
)
8090 name
= "complex long int";
8091 else if (component_type
== long_unsigned_type_node
)
8092 name
= "complex long unsigned int";
8093 else if (component_type
== long_long_integer_type_node
)
8094 name
= "complex long long int";
8095 else if (component_type
== long_long_unsigned_type_node
)
8096 name
= "complex long long unsigned int";
8101 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8102 get_identifier (name
), t
);
8105 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8108 /* If TYPE is a real or complex floating-point type and the target
8109 does not directly support arithmetic on TYPE then return the wider
8110 type to be used for arithmetic on TYPE. Otherwise, return
8114 excess_precision_type (tree type
)
8116 /* The target can give two different responses to the question of
8117 which excess precision mode it would like depending on whether we
8118 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8120 enum excess_precision_type requested_type
8121 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8122 ? EXCESS_PRECISION_TYPE_FAST
8123 : EXCESS_PRECISION_TYPE_STANDARD
);
8125 enum flt_eval_method target_flt_eval_method
8126 = targetm
.c
.excess_precision (requested_type
);
8128 /* The target should not ask for unpredictable float evaluation (though
8129 it might advertise that implicitly the evaluation is unpredictable,
8130 but we don't care about that here, it will have been reported
8131 elsewhere). If it does ask for unpredictable evaluation, we have
8132 nothing to do here. */
8133 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8135 /* Nothing to do. The target has asked for all types we know about
8136 to be computed with their native precision and range. */
8137 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8140 /* The target will promote this type in a target-dependent way, so excess
8141 precision ought to leave it alone. */
8142 if (targetm
.promoted_type (type
) != NULL_TREE
)
8145 machine_mode float16_type_mode
= (float16_type_node
8146 ? TYPE_MODE (float16_type_node
)
8148 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8149 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8151 switch (TREE_CODE (type
))
8155 machine_mode type_mode
= TYPE_MODE (type
);
8156 switch (target_flt_eval_method
)
8158 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8159 if (type_mode
== float16_type_mode
)
8160 return float_type_node
;
8162 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8163 if (type_mode
== float16_type_mode
8164 || type_mode
== float_type_mode
)
8165 return double_type_node
;
8167 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8168 if (type_mode
== float16_type_mode
8169 || type_mode
== float_type_mode
8170 || type_mode
== double_type_mode
)
8171 return long_double_type_node
;
8180 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8182 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8183 switch (target_flt_eval_method
)
8185 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8186 if (type_mode
== float16_type_mode
)
8187 return complex_float_type_node
;
8189 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8190 if (type_mode
== float16_type_mode
8191 || type_mode
== float_type_mode
)
8192 return complex_double_type_node
;
8194 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8195 if (type_mode
== float16_type_mode
8196 || type_mode
== float_type_mode
8197 || type_mode
== double_type_mode
)
8198 return complex_long_double_type_node
;
8212 /* Return OP, stripped of any conversions to wider types as much as is safe.
8213 Converting the value back to OP's type makes a value equivalent to OP.
8215 If FOR_TYPE is nonzero, we return a value which, if converted to
8216 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8218 OP must have integer, real or enumeral type. Pointers are not allowed!
8220 There are some cases where the obvious value we could return
8221 would regenerate to OP if converted to OP's type,
8222 but would not extend like OP to wider types.
8223 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8224 For example, if OP is (unsigned short)(signed char)-1,
8225 we avoid returning (signed char)-1 if FOR_TYPE is int,
8226 even though extending that to an unsigned short would regenerate OP,
8227 since the result of extending (signed char)-1 to (int)
8228 is different from (int) OP. */
8231 get_unwidened (tree op
, tree for_type
)
8233 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8234 tree type
= TREE_TYPE (op
);
8236 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8238 = (for_type
!= 0 && for_type
!= type
8239 && final_prec
> TYPE_PRECISION (type
)
8240 && TYPE_UNSIGNED (type
));
8243 while (CONVERT_EXPR_P (op
))
8247 /* TYPE_PRECISION on vector types has different meaning
8248 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8249 so avoid them here. */
8250 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8253 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8254 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8256 /* Truncations are many-one so cannot be removed.
8257 Unless we are later going to truncate down even farther. */
8259 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8262 /* See what's inside this conversion. If we decide to strip it,
8264 op
= TREE_OPERAND (op
, 0);
8266 /* If we have not stripped any zero-extensions (uns is 0),
8267 we can strip any kind of extension.
8268 If we have previously stripped a zero-extension,
8269 only zero-extensions can safely be stripped.
8270 Any extension can be stripped if the bits it would produce
8271 are all going to be discarded later by truncating to FOR_TYPE. */
8275 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8277 /* TYPE_UNSIGNED says whether this is a zero-extension.
8278 Let's avoid computing it if it does not affect WIN
8279 and if UNS will not be needed again. */
8281 || CONVERT_EXPR_P (op
))
8282 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8290 /* If we finally reach a constant see if it fits in sth smaller and
8291 in that case convert it. */
8292 if (TREE_CODE (win
) == INTEGER_CST
)
8294 tree wtype
= TREE_TYPE (win
);
8295 unsigned prec
= wi::min_precision (wi::to_wide (win
), TYPE_SIGN (wtype
));
8297 prec
= MAX (prec
, final_prec
);
8298 if (prec
< TYPE_PRECISION (wtype
))
8300 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8301 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8302 win
= fold_convert (t
, win
);
8309 /* Return OP or a simpler expression for a narrower value
8310 which can be sign-extended or zero-extended to give back OP.
8311 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8312 or 0 if the value should be sign-extended. */
8315 get_narrower (tree op
, int *unsignedp_ptr
)
8320 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8322 while (TREE_CODE (op
) == NOP_EXPR
)
8325 = (TYPE_PRECISION (TREE_TYPE (op
))
8326 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8328 /* Truncations are many-one so cannot be removed. */
8332 /* See what's inside this conversion. If we decide to strip it,
8337 op
= TREE_OPERAND (op
, 0);
8338 /* An extension: the outermost one can be stripped,
8339 but remember whether it is zero or sign extension. */
8341 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8342 /* Otherwise, if a sign extension has been stripped,
8343 only sign extensions can now be stripped;
8344 if a zero extension has been stripped, only zero-extensions. */
8345 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8349 else /* bitschange == 0 */
8351 /* A change in nominal type can always be stripped, but we must
8352 preserve the unsignedness. */
8354 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8356 op
= TREE_OPERAND (op
, 0);
8357 /* Keep trying to narrow, but don't assign op to win if it
8358 would turn an integral type into something else. */
8359 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8366 if (TREE_CODE (op
) == COMPONENT_REF
8367 /* Since type_for_size always gives an integer type. */
8368 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8369 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8370 /* Ensure field is laid out already. */
8371 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8372 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8374 unsigned HOST_WIDE_INT innerprec
8375 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8376 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8377 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8378 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8380 /* We can get this structure field in a narrower type that fits it,
8381 but the resulting extension to its nominal type (a fullword type)
8382 must satisfy the same conditions as for other extensions.
8384 Do this only for fields that are aligned (not bit-fields),
8385 because when bit-field insns will be used there is no
8386 advantage in doing this. */
8388 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8389 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8390 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8394 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8395 win
= fold_convert (type
, op
);
8399 *unsignedp_ptr
= uns
;
8403 /* Return true if integer constant C has a value that is permissible
8404 for TYPE, an integral type. */
8407 int_fits_type_p (const_tree c
, const_tree type
)
8409 tree type_low_bound
, type_high_bound
;
8410 bool ok_for_low_bound
, ok_for_high_bound
;
8411 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8413 /* Non-standard boolean types can have arbitrary precision but various
8414 transformations assume that they can only take values 0 and +/-1. */
8415 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8416 return wi::fits_to_boolean_p (wi::to_wide (c
), type
);
8419 type_low_bound
= TYPE_MIN_VALUE (type
);
8420 type_high_bound
= TYPE_MAX_VALUE (type
);
8422 /* If at least one bound of the type is a constant integer, we can check
8423 ourselves and maybe make a decision. If no such decision is possible, but
8424 this type is a subtype, try checking against that. Otherwise, use
8425 fits_to_tree_p, which checks against the precision.
8427 Compute the status for each possibly constant bound, and return if we see
8428 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8429 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8430 for "constant known to fit". */
8432 /* Check if c >= type_low_bound. */
8433 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8435 if (tree_int_cst_lt (c
, type_low_bound
))
8437 ok_for_low_bound
= true;
8440 ok_for_low_bound
= false;
8442 /* Check if c <= type_high_bound. */
8443 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8445 if (tree_int_cst_lt (type_high_bound
, c
))
8447 ok_for_high_bound
= true;
8450 ok_for_high_bound
= false;
8452 /* If the constant fits both bounds, the result is known. */
8453 if (ok_for_low_bound
&& ok_for_high_bound
)
8456 /* Perform some generic filtering which may allow making a decision
8457 even if the bounds are not constant. First, negative integers
8458 never fit in unsigned types, */
8459 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (wi::to_wide (c
)))
8462 /* Second, narrower types always fit in wider ones. */
8463 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8466 /* Third, unsigned integers with top bit set never fit signed types. */
8467 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8469 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8470 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8472 /* When a tree_cst is converted to a wide-int, the precision
8473 is taken from the type. However, if the precision of the
8474 mode underneath the type is smaller than that, it is
8475 possible that the value will not fit. The test below
8476 fails if any bit is set between the sign bit of the
8477 underlying mode and the top bit of the type. */
8478 if (wi::zext (wi::to_wide (c
), prec
- 1) != wi::to_wide (c
))
8481 else if (wi::neg_p (wi::to_wide (c
)))
8485 /* If we haven't been able to decide at this point, there nothing more we
8486 can check ourselves here. Look at the base type if we have one and it
8487 has the same precision. */
8488 if (TREE_CODE (type
) == INTEGER_TYPE
8489 && TREE_TYPE (type
) != 0
8490 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8492 type
= TREE_TYPE (type
);
8496 /* Or to fits_to_tree_p, if nothing else. */
8497 return wi::fits_to_tree_p (wi::to_wide (c
), type
);
8500 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8501 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8502 represented (assuming two's-complement arithmetic) within the bit
8503 precision of the type are returned instead. */
8506 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8508 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8509 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8510 wi::to_mpz (wi::to_wide (TYPE_MIN_VALUE (type
)), min
, TYPE_SIGN (type
));
8513 if (TYPE_UNSIGNED (type
))
8514 mpz_set_ui (min
, 0);
8517 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8518 wi::to_mpz (mn
, min
, SIGNED
);
8522 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8523 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8524 wi::to_mpz (wi::to_wide (TYPE_MAX_VALUE (type
)), max
, TYPE_SIGN (type
));
8527 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8528 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8532 /* Return true if VAR is an automatic variable defined in function FN. */
8535 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8537 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8538 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8539 || TREE_CODE (var
) == PARM_DECL
)
8540 && ! TREE_STATIC (var
))
8541 || TREE_CODE (var
) == LABEL_DECL
8542 || TREE_CODE (var
) == RESULT_DECL
));
8545 /* Subprogram of following function. Called by walk_tree.
8547 Return *TP if it is an automatic variable or parameter of the
8548 function passed in as DATA. */
8551 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8553 tree fn
= (tree
) data
;
8558 else if (DECL_P (*tp
)
8559 && auto_var_in_fn_p (*tp
, fn
))
8565 /* Returns true if T is, contains, or refers to a type with variable
8566 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8567 arguments, but not the return type. If FN is nonzero, only return
8568 true if a modifier of the type or position of FN is a variable or
8569 parameter inside FN.
8571 This concept is more general than that of C99 'variably modified types':
8572 in C99, a struct type is never variably modified because a VLA may not
8573 appear as a structure member. However, in GNU C code like:
8575 struct S { int i[f()]; };
8577 is valid, and other languages may define similar constructs. */
8580 variably_modified_type_p (tree type
, tree fn
)
8584 /* Test if T is either variable (if FN is zero) or an expression containing
8585 a variable in FN. If TYPE isn't gimplified, return true also if
8586 gimplify_one_sizepos would gimplify the expression into a local
8588 #define RETURN_TRUE_IF_VAR(T) \
8589 do { tree _t = (T); \
8590 if (_t != NULL_TREE \
8591 && _t != error_mark_node \
8592 && TREE_CODE (_t) != INTEGER_CST \
8593 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8595 || (!TYPE_SIZES_GIMPLIFIED (type) \
8596 && !is_gimple_sizepos (_t)) \
8597 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8598 return true; } while (0)
8600 if (type
== error_mark_node
)
8603 /* If TYPE itself has variable size, it is variably modified. */
8604 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8605 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8607 switch (TREE_CODE (type
))
8610 case REFERENCE_TYPE
:
8612 /* Ada can have pointer types refering to themselves indirectly. */
8613 if (TREE_VISITED (type
))
8615 TREE_VISITED (type
) = true;
8616 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8618 TREE_VISITED (type
) = false;
8621 TREE_VISITED (type
) = false;
8626 /* If TYPE is a function type, it is variably modified if the
8627 return type is variably modified. */
8628 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8634 case FIXED_POINT_TYPE
:
8637 /* Scalar types are variably modified if their end points
8639 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8640 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8645 case QUAL_UNION_TYPE
:
8646 /* We can't see if any of the fields are variably-modified by the
8647 definition we normally use, since that would produce infinite
8648 recursion via pointers. */
8649 /* This is variably modified if some field's type is. */
8650 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8651 if (TREE_CODE (t
) == FIELD_DECL
)
8653 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8654 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8655 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8657 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8658 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8663 /* Do not call ourselves to avoid infinite recursion. This is
8664 variably modified if the element type is. */
8665 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8666 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8673 /* The current language may have other cases to check, but in general,
8674 all other types are not variably modified. */
8675 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8677 #undef RETURN_TRUE_IF_VAR
8680 /* Given a DECL or TYPE, return the scope in which it was declared, or
8681 NULL_TREE if there is no containing scope. */
8684 get_containing_scope (const_tree t
)
8686 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8689 /* Return the innermost context enclosing DECL that is
8690 a FUNCTION_DECL, or zero if none. */
8693 decl_function_context (const_tree decl
)
8697 if (TREE_CODE (decl
) == ERROR_MARK
)
8700 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8701 where we look up the function at runtime. Such functions always take
8702 a first argument of type 'pointer to real context'.
8704 C++ should really be fixed to use DECL_CONTEXT for the real context,
8705 and use something else for the "virtual context". */
8706 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8709 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8711 context
= DECL_CONTEXT (decl
);
8713 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8715 if (TREE_CODE (context
) == BLOCK
)
8716 context
= BLOCK_SUPERCONTEXT (context
);
8718 context
= get_containing_scope (context
);
8724 /* Return the innermost context enclosing DECL that is
8725 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8726 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8729 decl_type_context (const_tree decl
)
8731 tree context
= DECL_CONTEXT (decl
);
8734 switch (TREE_CODE (context
))
8736 case NAMESPACE_DECL
:
8737 case TRANSLATION_UNIT_DECL
:
8742 case QUAL_UNION_TYPE
:
8747 context
= DECL_CONTEXT (context
);
8751 context
= BLOCK_SUPERCONTEXT (context
);
8761 /* CALL is a CALL_EXPR. Return the declaration for the function
8762 called, or NULL_TREE if the called function cannot be
8766 get_callee_fndecl (const_tree call
)
8770 if (call
== error_mark_node
)
8771 return error_mark_node
;
8773 /* It's invalid to call this function with anything but a
8775 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8777 /* The first operand to the CALL is the address of the function
8779 addr
= CALL_EXPR_FN (call
);
8781 /* If there is no function, return early. */
8782 if (addr
== NULL_TREE
)
8787 /* If this is a readonly function pointer, extract its initial value. */
8788 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8789 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8790 && DECL_INITIAL (addr
))
8791 addr
= DECL_INITIAL (addr
);
8793 /* If the address is just `&f' for some function `f', then we know
8794 that `f' is being called. */
8795 if (TREE_CODE (addr
) == ADDR_EXPR
8796 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8797 return TREE_OPERAND (addr
, 0);
8799 /* We couldn't figure out what was being called. */
8803 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8804 return the associated function code, otherwise return CFN_LAST. */
8807 get_call_combined_fn (const_tree call
)
8809 /* It's invalid to call this function with anything but a CALL_EXPR. */
8810 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8812 if (!CALL_EXPR_FN (call
))
8813 return as_combined_fn (CALL_EXPR_IFN (call
));
8815 tree fndecl
= get_callee_fndecl (call
);
8816 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8817 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
8822 #define TREE_MEM_USAGE_SPACES 40
8824 /* Print debugging information about tree nodes generated during the compile,
8825 and any language-specific information. */
8828 dump_tree_statistics (void)
8830 if (GATHER_STATISTICS
)
8833 int total_nodes
, total_bytes
;
8834 fprintf (stderr
, "\nKind Nodes Bytes\n");
8835 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8836 total_nodes
= total_bytes
= 0;
8837 for (i
= 0; i
< (int) all_kinds
; i
++)
8839 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8840 tree_node_counts
[i
], tree_node_sizes
[i
]);
8841 total_nodes
+= tree_node_counts
[i
];
8842 total_bytes
+= tree_node_sizes
[i
];
8844 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8845 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8846 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8847 fprintf (stderr
, "Code Nodes\n");
8848 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8849 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8850 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8851 tree_code_counts
[i
]);
8852 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8853 fprintf (stderr
, "\n");
8854 ssanames_print_statistics ();
8855 fprintf (stderr
, "\n");
8856 phinodes_print_statistics ();
8857 fprintf (stderr
, "\n");
8860 fprintf (stderr
, "(No per-node statistics)\n");
8862 print_type_hash_statistics ();
8863 print_debug_expr_statistics ();
8864 print_value_expr_statistics ();
8865 lang_hooks
.print_statistics ();
8868 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8870 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8873 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
8875 /* This relies on the raw feedback's top 4 bits being zero. */
8876 #define FEEDBACK(X) ((X) * 0x04c11db7)
8877 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8878 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8879 static const unsigned syndromes
[16] =
8881 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
8882 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
8883 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
8884 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
8889 value
<<= (32 - bytes
* 8);
8890 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
8892 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
8894 chksum
= (chksum
<< 4) ^ feedback
;
8900 /* Generate a crc32 of a string. */
8903 crc32_string (unsigned chksum
, const char *string
)
8906 chksum
= crc32_byte (chksum
, *string
);
8911 /* P is a string that will be used in a symbol. Mask out any characters
8912 that are not valid in that context. */
8915 clean_symbol_name (char *p
)
8919 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8922 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8929 /* For anonymous aggregate types, we need some sort of name to
8930 hold on to. In practice, this should not appear, but it should
8931 not be harmful if it does. */
8933 anon_aggrname_p(const_tree id_node
)
8935 #ifndef NO_DOT_IN_LABEL
8936 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
8937 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8938 #else /* NO_DOT_IN_LABEL */
8939 #ifndef NO_DOLLAR_IN_LABEL
8940 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
8941 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8942 #else /* NO_DOLLAR_IN_LABEL */
8943 #define ANON_AGGRNAME_PREFIX "__anon_"
8944 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
8945 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
8946 #endif /* NO_DOLLAR_IN_LABEL */
8947 #endif /* NO_DOT_IN_LABEL */
8950 /* Return a format for an anonymous aggregate name. */
8952 anon_aggrname_format()
8954 #ifndef NO_DOT_IN_LABEL
8956 #else /* NO_DOT_IN_LABEL */
8957 #ifndef NO_DOLLAR_IN_LABEL
8959 #else /* NO_DOLLAR_IN_LABEL */
8961 #endif /* NO_DOLLAR_IN_LABEL */
8962 #endif /* NO_DOT_IN_LABEL */
8965 /* Generate a name for a special-purpose function.
8966 The generated name may need to be unique across the whole link.
8967 Changes to this function may also require corresponding changes to
8968 xstrdup_mask_random.
8969 TYPE is some string to identify the purpose of this function to the
8970 linker or collect2; it must start with an uppercase letter,
8972 I - for constructors
8974 N - for C++ anonymous namespaces
8975 F - for DWARF unwind frame information. */
8978 get_file_function_name (const char *type
)
8984 /* If we already have a name we know to be unique, just use that. */
8985 if (first_global_object_name
)
8986 p
= q
= ASTRDUP (first_global_object_name
);
8987 /* If the target is handling the constructors/destructors, they
8988 will be local to this file and the name is only necessary for
8990 We also assign sub_I and sub_D sufixes to constructors called from
8991 the global static constructors. These are always local. */
8992 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8993 || (strncmp (type
, "sub_", 4) == 0
8994 && (type
[4] == 'I' || type
[4] == 'D')))
8996 const char *file
= main_input_filename
;
8998 file
= LOCATION_FILE (input_location
);
8999 /* Just use the file's basename, because the full pathname
9000 might be quite long. */
9001 p
= q
= ASTRDUP (lbasename (file
));
9005 /* Otherwise, the name must be unique across the entire link.
9006 We don't have anything that we know to be unique to this translation
9007 unit, so use what we do have and throw in some randomness. */
9009 const char *name
= weak_global_object_name
;
9010 const char *file
= main_input_filename
;
9015 file
= LOCATION_FILE (input_location
);
9017 len
= strlen (file
);
9018 q
= (char *) alloca (9 + 19 + len
+ 1);
9019 memcpy (q
, file
, len
+ 1);
9021 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9022 crc32_string (0, name
), get_random_seed (false));
9027 clean_symbol_name (q
);
9028 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9031 /* Set up the name of the file-level functions we may need.
9032 Use a global object (which is already required to be unique over
9033 the program) rather than the file name (which imposes extra
9035 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9037 return get_identifier (buf
);
9040 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9042 /* Complain that the tree code of NODE does not match the expected 0
9043 terminated list of trailing codes. The trailing code list can be
9044 empty, for a more vague error message. FILE, LINE, and FUNCTION
9045 are of the caller. */
9048 tree_check_failed (const_tree node
, const char *file
,
9049 int line
, const char *function
, ...)
9053 unsigned length
= 0;
9054 enum tree_code code
;
9056 va_start (args
, function
);
9057 while ((code
= (enum tree_code
) va_arg (args
, int)))
9058 length
+= 4 + strlen (get_tree_code_name (code
));
9063 va_start (args
, function
);
9064 length
+= strlen ("expected ");
9065 buffer
= tmp
= (char *) alloca (length
);
9067 while ((code
= (enum tree_code
) va_arg (args
, int)))
9069 const char *prefix
= length
? " or " : "expected ";
9071 strcpy (tmp
+ length
, prefix
);
9072 length
+= strlen (prefix
);
9073 strcpy (tmp
+ length
, get_tree_code_name (code
));
9074 length
+= strlen (get_tree_code_name (code
));
9079 buffer
= "unexpected node";
9081 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9082 buffer
, get_tree_code_name (TREE_CODE (node
)),
9083 function
, trim_filename (file
), line
);
9086 /* Complain that the tree code of NODE does match the expected 0
9087 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9091 tree_not_check_failed (const_tree node
, const char *file
,
9092 int line
, const char *function
, ...)
9096 unsigned length
= 0;
9097 enum tree_code code
;
9099 va_start (args
, function
);
9100 while ((code
= (enum tree_code
) va_arg (args
, int)))
9101 length
+= 4 + strlen (get_tree_code_name (code
));
9103 va_start (args
, function
);
9104 buffer
= (char *) alloca (length
);
9106 while ((code
= (enum tree_code
) va_arg (args
, int)))
9110 strcpy (buffer
+ length
, " or ");
9113 strcpy (buffer
+ length
, get_tree_code_name (code
));
9114 length
+= strlen (get_tree_code_name (code
));
9118 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9119 buffer
, get_tree_code_name (TREE_CODE (node
)),
9120 function
, trim_filename (file
), line
);
9123 /* Similar to tree_check_failed, except that we check for a class of tree
9124 code, given in CL. */
9127 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9128 const char *file
, int line
, const char *function
)
9131 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9132 TREE_CODE_CLASS_STRING (cl
),
9133 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9134 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9137 /* Similar to tree_check_failed, except that instead of specifying a
9138 dozen codes, use the knowledge that they're all sequential. */
9141 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9142 const char *function
, enum tree_code c1
,
9146 unsigned length
= 0;
9149 for (c
= c1
; c
<= c2
; ++c
)
9150 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9152 length
+= strlen ("expected ");
9153 buffer
= (char *) alloca (length
);
9156 for (c
= c1
; c
<= c2
; ++c
)
9158 const char *prefix
= length
? " or " : "expected ";
9160 strcpy (buffer
+ length
, prefix
);
9161 length
+= strlen (prefix
);
9162 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9163 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9166 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9167 buffer
, get_tree_code_name (TREE_CODE (node
)),
9168 function
, trim_filename (file
), line
);
9172 /* Similar to tree_check_failed, except that we check that a tree does
9173 not have the specified code, given in CL. */
9176 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9177 const char *file
, int line
, const char *function
)
9180 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9181 TREE_CODE_CLASS_STRING (cl
),
9182 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9183 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9187 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9190 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9191 const char *function
, enum omp_clause_code code
)
9193 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9194 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9195 function
, trim_filename (file
), line
);
9199 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9202 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9203 const char *function
, enum omp_clause_code c1
,
9204 enum omp_clause_code c2
)
9207 unsigned length
= 0;
9210 for (c
= c1
; c
<= c2
; ++c
)
9211 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9213 length
+= strlen ("expected ");
9214 buffer
= (char *) alloca (length
);
9217 for (c
= c1
; c
<= c2
; ++c
)
9219 const char *prefix
= length
? " or " : "expected ";
9221 strcpy (buffer
+ length
, prefix
);
9222 length
+= strlen (prefix
);
9223 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9224 length
+= strlen (omp_clause_code_name
[c
]);
9227 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9228 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9229 function
, trim_filename (file
), line
);
9233 #undef DEFTREESTRUCT
9234 #define DEFTREESTRUCT(VAL, NAME) NAME,
9236 static const char *ts_enum_names
[] = {
9237 #include "treestruct.def"
9239 #undef DEFTREESTRUCT
9241 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9243 /* Similar to tree_class_check_failed, except that we check for
9244 whether CODE contains the tree structure identified by EN. */
9247 tree_contains_struct_check_failed (const_tree node
,
9248 const enum tree_node_structure_enum en
,
9249 const char *file
, int line
,
9250 const char *function
)
9253 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9255 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9259 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9260 (dynamically sized) vector. */
9263 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9264 const char *function
)
9267 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9268 idx
+ 1, len
, function
, trim_filename (file
), line
);
9271 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9272 (dynamically sized) vector. */
9275 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9276 const char *function
)
9279 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9280 idx
+ 1, len
, function
, trim_filename (file
), line
);
9283 /* Similar to above, except that the check is for the bounds of the operand
9284 vector of an expression node EXP. */
9287 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9288 int line
, const char *function
)
9290 enum tree_code code
= TREE_CODE (exp
);
9292 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9293 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9294 function
, trim_filename (file
), line
);
9297 /* Similar to above, except that the check is for the number of
9298 operands of an OMP_CLAUSE node. */
9301 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9302 int line
, const char *function
)
9305 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9306 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9307 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9308 trim_filename (file
), line
);
9310 #endif /* ENABLE_TREE_CHECKING */
9312 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9313 and mapped to the machine mode MODE. Initialize its fields and build
9314 the information necessary for debugging output. */
9317 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9320 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9322 t
= make_node (VECTOR_TYPE
);
9323 TREE_TYPE (t
) = mv_innertype
;
9324 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9325 SET_TYPE_MODE (t
, mode
);
9327 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9328 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9329 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9330 || mode
!= VOIDmode
)
9331 && !VECTOR_BOOLEAN_TYPE_P (t
))
9333 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9337 hashval_t hash
= type_hash_canon_hash (t
);
9338 t
= type_hash_canon (hash
, t
);
9340 /* We have built a main variant, based on the main variant of the
9341 inner type. Use it to build the variant we return. */
9342 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9343 && TREE_TYPE (t
) != innertype
)
9344 return build_type_attribute_qual_variant (t
,
9345 TYPE_ATTRIBUTES (innertype
),
9346 TYPE_QUALS (innertype
));
9352 make_or_reuse_type (unsigned size
, int unsignedp
)
9356 if (size
== INT_TYPE_SIZE
)
9357 return unsignedp
? unsigned_type_node
: integer_type_node
;
9358 if (size
== CHAR_TYPE_SIZE
)
9359 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9360 if (size
== SHORT_TYPE_SIZE
)
9361 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9362 if (size
== LONG_TYPE_SIZE
)
9363 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9364 if (size
== LONG_LONG_TYPE_SIZE
)
9365 return (unsignedp
? long_long_unsigned_type_node
9366 : long_long_integer_type_node
);
9368 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9369 if (size
== int_n_data
[i
].bitsize
9370 && int_n_enabled_p
[i
])
9371 return (unsignedp
? int_n_trees
[i
].unsigned_type
9372 : int_n_trees
[i
].signed_type
);
9375 return make_unsigned_type (size
);
9377 return make_signed_type (size
);
9380 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9383 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9387 if (size
== SHORT_FRACT_TYPE_SIZE
)
9388 return unsignedp
? sat_unsigned_short_fract_type_node
9389 : sat_short_fract_type_node
;
9390 if (size
== FRACT_TYPE_SIZE
)
9391 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9392 if (size
== LONG_FRACT_TYPE_SIZE
)
9393 return unsignedp
? sat_unsigned_long_fract_type_node
9394 : sat_long_fract_type_node
;
9395 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9396 return unsignedp
? sat_unsigned_long_long_fract_type_node
9397 : sat_long_long_fract_type_node
;
9401 if (size
== SHORT_FRACT_TYPE_SIZE
)
9402 return unsignedp
? unsigned_short_fract_type_node
9403 : short_fract_type_node
;
9404 if (size
== FRACT_TYPE_SIZE
)
9405 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9406 if (size
== LONG_FRACT_TYPE_SIZE
)
9407 return unsignedp
? unsigned_long_fract_type_node
9408 : long_fract_type_node
;
9409 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9410 return unsignedp
? unsigned_long_long_fract_type_node
9411 : long_long_fract_type_node
;
9414 return make_fract_type (size
, unsignedp
, satp
);
9417 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9420 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9424 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9425 return unsignedp
? sat_unsigned_short_accum_type_node
9426 : sat_short_accum_type_node
;
9427 if (size
== ACCUM_TYPE_SIZE
)
9428 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9429 if (size
== LONG_ACCUM_TYPE_SIZE
)
9430 return unsignedp
? sat_unsigned_long_accum_type_node
9431 : sat_long_accum_type_node
;
9432 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9433 return unsignedp
? sat_unsigned_long_long_accum_type_node
9434 : sat_long_long_accum_type_node
;
9438 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9439 return unsignedp
? unsigned_short_accum_type_node
9440 : short_accum_type_node
;
9441 if (size
== ACCUM_TYPE_SIZE
)
9442 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9443 if (size
== LONG_ACCUM_TYPE_SIZE
)
9444 return unsignedp
? unsigned_long_accum_type_node
9445 : long_accum_type_node
;
9446 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9447 return unsignedp
? unsigned_long_long_accum_type_node
9448 : long_long_accum_type_node
;
9451 return make_accum_type (size
, unsignedp
, satp
);
9455 /* Create an atomic variant node for TYPE. This routine is called
9456 during initialization of data types to create the 5 basic atomic
9457 types. The generic build_variant_type function requires these to
9458 already be set up in order to function properly, so cannot be
9459 called from there. If ALIGN is non-zero, then ensure alignment is
9460 overridden to this value. */
9463 build_atomic_base (tree type
, unsigned int align
)
9467 /* Make sure its not already registered. */
9468 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9471 t
= build_variant_type_copy (type
);
9472 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9475 SET_TYPE_ALIGN (t
, align
);
9480 /* Information about the _FloatN and _FloatNx types. This must be in
9481 the same order as the corresponding TI_* enum values. */
9482 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9494 /* Create nodes for all integer types (and error_mark_node) using the sizes
9495 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9498 build_common_tree_nodes (bool signed_char
)
9502 error_mark_node
= make_node (ERROR_MARK
);
9503 TREE_TYPE (error_mark_node
) = error_mark_node
;
9505 initialize_sizetypes ();
9507 /* Define both `signed char' and `unsigned char'. */
9508 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9509 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9510 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9511 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9513 /* Define `char', which is like either `signed char' or `unsigned char'
9514 but not the same as either. */
9517 ? make_signed_type (CHAR_TYPE_SIZE
)
9518 : make_unsigned_type (CHAR_TYPE_SIZE
));
9519 TYPE_STRING_FLAG (char_type_node
) = 1;
9521 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9522 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9523 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9524 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9525 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9526 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9527 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9528 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9530 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9532 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9533 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9534 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9535 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9537 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9538 && int_n_enabled_p
[i
])
9540 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9541 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9545 /* Define a boolean type. This type only represents boolean values but
9546 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9547 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9548 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9549 TYPE_PRECISION (boolean_type_node
) = 1;
9550 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9552 /* Define what type to use for size_t. */
9553 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9554 size_type_node
= unsigned_type_node
;
9555 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9556 size_type_node
= long_unsigned_type_node
;
9557 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9558 size_type_node
= long_long_unsigned_type_node
;
9559 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9560 size_type_node
= short_unsigned_type_node
;
9565 size_type_node
= NULL_TREE
;
9566 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9567 if (int_n_enabled_p
[i
])
9570 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9572 if (strcmp (name
, SIZE_TYPE
) == 0)
9574 size_type_node
= int_n_trees
[i
].unsigned_type
;
9577 if (size_type_node
== NULL_TREE
)
9581 /* Define what type to use for ptrdiff_t. */
9582 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9583 ptrdiff_type_node
= integer_type_node
;
9584 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9585 ptrdiff_type_node
= long_integer_type_node
;
9586 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9587 ptrdiff_type_node
= long_long_integer_type_node
;
9588 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9589 ptrdiff_type_node
= short_integer_type_node
;
9592 ptrdiff_type_node
= NULL_TREE
;
9593 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9594 if (int_n_enabled_p
[i
])
9597 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9598 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9599 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9601 if (ptrdiff_type_node
== NULL_TREE
)
9605 /* Fill in the rest of the sized types. Reuse existing type nodes
9607 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9608 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9609 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9610 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9611 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9613 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9614 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9615 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9616 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9617 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9619 /* Don't call build_qualified type for atomics. That routine does
9620 special processing for atomics, and until they are initialized
9621 it's better not to make that call.
9623 Check to see if there is a target override for atomic types. */
9625 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9626 targetm
.atomic_align_for_mode (QImode
));
9627 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9628 targetm
.atomic_align_for_mode (HImode
));
9629 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9630 targetm
.atomic_align_for_mode (SImode
));
9631 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9632 targetm
.atomic_align_for_mode (DImode
));
9633 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9634 targetm
.atomic_align_for_mode (TImode
));
9636 access_public_node
= get_identifier ("public");
9637 access_protected_node
= get_identifier ("protected");
9638 access_private_node
= get_identifier ("private");
9640 /* Define these next since types below may used them. */
9641 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9642 integer_one_node
= build_int_cst (integer_type_node
, 1);
9643 integer_three_node
= build_int_cst (integer_type_node
, 3);
9644 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9646 size_zero_node
= size_int (0);
9647 size_one_node
= size_int (1);
9648 bitsize_zero_node
= bitsize_int (0);
9649 bitsize_one_node
= bitsize_int (1);
9650 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9652 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9653 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9655 void_type_node
= make_node (VOID_TYPE
);
9656 layout_type (void_type_node
);
9658 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9660 /* We are not going to have real types in C with less than byte alignment,
9661 so we might as well not have any types that claim to have it. */
9662 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9663 TYPE_USER_ALIGN (void_type_node
) = 0;
9665 void_node
= make_node (VOID_CST
);
9666 TREE_TYPE (void_node
) = void_type_node
;
9668 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9669 layout_type (TREE_TYPE (null_pointer_node
));
9671 ptr_type_node
= build_pointer_type (void_type_node
);
9673 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9674 for (unsigned i
= 0;
9675 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9677 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9679 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9681 float_type_node
= make_node (REAL_TYPE
);
9682 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9683 layout_type (float_type_node
);
9685 double_type_node
= make_node (REAL_TYPE
);
9686 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9687 layout_type (double_type_node
);
9689 long_double_type_node
= make_node (REAL_TYPE
);
9690 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9691 layout_type (long_double_type_node
);
9693 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9695 int n
= floatn_nx_types
[i
].n
;
9696 bool extended
= floatn_nx_types
[i
].extended
;
9697 scalar_float_mode mode
;
9698 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9700 int precision
= GET_MODE_PRECISION (mode
);
9701 /* Work around the rs6000 KFmode having precision 113 not
9703 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9704 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9705 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9707 gcc_assert (min_precision
== n
);
9708 if (precision
< min_precision
)
9709 precision
= min_precision
;
9710 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9711 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9712 layout_type (FLOATN_NX_TYPE_NODE (i
));
9713 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
9716 float_ptr_type_node
= build_pointer_type (float_type_node
);
9717 double_ptr_type_node
= build_pointer_type (double_type_node
);
9718 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9719 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9721 /* Fixed size integer types. */
9722 uint16_type_node
= make_or_reuse_type (16, 1);
9723 uint32_type_node
= make_or_reuse_type (32, 1);
9724 uint64_type_node
= make_or_reuse_type (64, 1);
9726 /* Decimal float types. */
9727 dfloat32_type_node
= make_node (REAL_TYPE
);
9728 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9729 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9730 layout_type (dfloat32_type_node
);
9731 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9733 dfloat64_type_node
= make_node (REAL_TYPE
);
9734 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9735 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9736 layout_type (dfloat64_type_node
);
9737 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9739 dfloat128_type_node
= make_node (REAL_TYPE
);
9740 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9741 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9742 layout_type (dfloat128_type_node
);
9743 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9745 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
9746 complex_float_type_node
= build_complex_type (float_type_node
, true);
9747 complex_double_type_node
= build_complex_type (double_type_node
, true);
9748 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
9751 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9753 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
9754 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
9755 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
9758 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9759 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9760 sat_ ## KIND ## _type_node = \
9761 make_sat_signed_ ## KIND ## _type (SIZE); \
9762 sat_unsigned_ ## KIND ## _type_node = \
9763 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9764 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9765 unsigned_ ## KIND ## _type_node = \
9766 make_unsigned_ ## KIND ## _type (SIZE);
9768 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9769 sat_ ## WIDTH ## KIND ## _type_node = \
9770 make_sat_signed_ ## KIND ## _type (SIZE); \
9771 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9772 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9773 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9774 unsigned_ ## WIDTH ## KIND ## _type_node = \
9775 make_unsigned_ ## KIND ## _type (SIZE);
9777 /* Make fixed-point type nodes based on four different widths. */
9778 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9779 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9780 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9781 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9782 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9784 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9785 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9786 NAME ## _type_node = \
9787 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9788 u ## NAME ## _type_node = \
9789 make_or_reuse_unsigned_ ## KIND ## _type \
9790 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9791 sat_ ## NAME ## _type_node = \
9792 make_or_reuse_sat_signed_ ## KIND ## _type \
9793 (GET_MODE_BITSIZE (MODE ## mode)); \
9794 sat_u ## NAME ## _type_node = \
9795 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9796 (GET_MODE_BITSIZE (U ## MODE ## mode));
9798 /* Fixed-point type and mode nodes. */
9799 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9800 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9801 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9802 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9803 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9804 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9805 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9806 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9807 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9808 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9809 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9812 tree t
= targetm
.build_builtin_va_list ();
9814 /* Many back-ends define record types without setting TYPE_NAME.
9815 If we copied the record type here, we'd keep the original
9816 record type without a name. This breaks name mangling. So,
9817 don't copy record types and let c_common_nodes_and_builtins()
9818 declare the type to be __builtin_va_list. */
9819 if (TREE_CODE (t
) != RECORD_TYPE
)
9820 t
= build_variant_type_copy (t
);
9822 va_list_type_node
= t
;
9826 /* Modify DECL for given flags.
9827 TM_PURE attribute is set only on types, so the function will modify
9828 DECL's type when ECF_TM_PURE is used. */
9831 set_call_expr_flags (tree decl
, int flags
)
9833 if (flags
& ECF_NOTHROW
)
9834 TREE_NOTHROW (decl
) = 1;
9835 if (flags
& ECF_CONST
)
9836 TREE_READONLY (decl
) = 1;
9837 if (flags
& ECF_PURE
)
9838 DECL_PURE_P (decl
) = 1;
9839 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9840 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9841 if (flags
& ECF_NOVOPS
)
9842 DECL_IS_NOVOPS (decl
) = 1;
9843 if (flags
& ECF_NORETURN
)
9844 TREE_THIS_VOLATILE (decl
) = 1;
9845 if (flags
& ECF_MALLOC
)
9846 DECL_IS_MALLOC (decl
) = 1;
9847 if (flags
& ECF_RETURNS_TWICE
)
9848 DECL_IS_RETURNS_TWICE (decl
) = 1;
9849 if (flags
& ECF_LEAF
)
9850 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9851 NULL
, DECL_ATTRIBUTES (decl
));
9852 if (flags
& ECF_COLD
)
9853 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
9854 NULL
, DECL_ATTRIBUTES (decl
));
9855 if (flags
& ECF_RET1
)
9856 DECL_ATTRIBUTES (decl
)
9857 = tree_cons (get_identifier ("fn spec"),
9858 build_tree_list (NULL_TREE
, build_string (1, "1")),
9859 DECL_ATTRIBUTES (decl
));
9860 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9861 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9862 /* Looping const or pure is implied by noreturn.
9863 There is currently no way to declare looping const or looping pure alone. */
9864 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9865 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9869 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9872 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9873 const char *library_name
, int ecf_flags
)
9877 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9878 library_name
, NULL_TREE
);
9879 set_call_expr_flags (decl
, ecf_flags
);
9881 set_builtin_decl (code
, decl
, true);
9884 /* Call this function after instantiating all builtins that the language
9885 front end cares about. This will build the rest of the builtins
9886 and internal functions that are relied upon by the tree optimizers and
9890 build_common_builtin_nodes (void)
9895 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
9896 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
9898 ftype
= build_function_type (void_type_node
, void_list_node
);
9899 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9900 local_define_builtin ("__builtin_unreachable", ftype
,
9901 BUILT_IN_UNREACHABLE
,
9902 "__builtin_unreachable",
9903 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9904 | ECF_CONST
| ECF_COLD
);
9905 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
9906 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
9908 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
9911 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9912 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9914 ftype
= build_function_type_list (ptr_type_node
,
9915 ptr_type_node
, const_ptr_type_node
,
9916 size_type_node
, NULL_TREE
);
9918 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9919 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9920 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9921 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9922 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9923 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9926 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9928 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9929 const_ptr_type_node
, size_type_node
,
9931 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9932 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9935 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9937 ftype
= build_function_type_list (ptr_type_node
,
9938 ptr_type_node
, integer_type_node
,
9939 size_type_node
, NULL_TREE
);
9940 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9941 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9944 /* If we're checking the stack, `alloca' can throw. */
9945 const int alloca_flags
9946 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
9948 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9950 ftype
= build_function_type_list (ptr_type_node
,
9951 size_type_node
, NULL_TREE
);
9952 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9953 "alloca", alloca_flags
);
9956 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9957 size_type_node
, NULL_TREE
);
9958 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9959 BUILT_IN_ALLOCA_WITH_ALIGN
,
9960 "__builtin_alloca_with_align",
9963 ftype
= build_function_type_list (void_type_node
,
9964 ptr_type_node
, ptr_type_node
,
9965 ptr_type_node
, NULL_TREE
);
9966 local_define_builtin ("__builtin_init_trampoline", ftype
,
9967 BUILT_IN_INIT_TRAMPOLINE
,
9968 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9969 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9970 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9971 "__builtin_init_heap_trampoline",
9972 ECF_NOTHROW
| ECF_LEAF
);
9973 local_define_builtin ("__builtin_init_descriptor", ftype
,
9974 BUILT_IN_INIT_DESCRIPTOR
,
9975 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
9977 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9978 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9979 BUILT_IN_ADJUST_TRAMPOLINE
,
9980 "__builtin_adjust_trampoline",
9981 ECF_CONST
| ECF_NOTHROW
);
9982 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
9983 BUILT_IN_ADJUST_DESCRIPTOR
,
9984 "__builtin_adjust_descriptor",
9985 ECF_CONST
| ECF_NOTHROW
);
9987 ftype
= build_function_type_list (void_type_node
,
9988 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9989 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9990 BUILT_IN_NONLOCAL_GOTO
,
9991 "__builtin_nonlocal_goto",
9992 ECF_NORETURN
| ECF_NOTHROW
);
9994 ftype
= build_function_type_list (void_type_node
,
9995 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9996 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9997 BUILT_IN_SETJMP_SETUP
,
9998 "__builtin_setjmp_setup", ECF_NOTHROW
);
10000 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10001 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10002 BUILT_IN_SETJMP_RECEIVER
,
10003 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10005 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10006 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10007 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10009 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10010 local_define_builtin ("__builtin_stack_restore", ftype
,
10011 BUILT_IN_STACK_RESTORE
,
10012 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10014 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10015 const_ptr_type_node
, size_type_node
,
10017 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10018 "__builtin_memcmp_eq",
10019 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10021 /* If there's a possibility that we might use the ARM EABI, build the
10022 alternate __cxa_end_cleanup node used to resume from C++. */
10023 if (targetm
.arm_eabi_unwinder
)
10025 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10026 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10027 BUILT_IN_CXA_END_CLEANUP
,
10028 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10031 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10032 local_define_builtin ("__builtin_unwind_resume", ftype
,
10033 BUILT_IN_UNWIND_RESUME
,
10034 ((targetm_common
.except_unwind_info (&global_options
)
10036 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10039 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10041 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10043 local_define_builtin ("__builtin_return_address", ftype
,
10044 BUILT_IN_RETURN_ADDRESS
,
10045 "__builtin_return_address",
10049 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10050 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10052 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10053 ptr_type_node
, NULL_TREE
);
10054 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10055 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10056 BUILT_IN_PROFILE_FUNC_ENTER
,
10057 "__cyg_profile_func_enter", 0);
10058 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10059 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10060 BUILT_IN_PROFILE_FUNC_EXIT
,
10061 "__cyg_profile_func_exit", 0);
10064 /* The exception object and filter values from the runtime. The argument
10065 must be zero before exception lowering, i.e. from the front end. After
10066 exception lowering, it will be the region number for the exception
10067 landing pad. These functions are PURE instead of CONST to prevent
10068 them from being hoisted past the exception edge that will initialize
10069 its value in the landing pad. */
10070 ftype
= build_function_type_list (ptr_type_node
,
10071 integer_type_node
, NULL_TREE
);
10072 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10073 /* Only use TM_PURE if we have TM language support. */
10074 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10075 ecf_flags
|= ECF_TM_PURE
;
10076 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10077 "__builtin_eh_pointer", ecf_flags
);
10079 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10080 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10081 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10082 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10084 ftype
= build_function_type_list (void_type_node
,
10085 integer_type_node
, integer_type_node
,
10087 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10088 BUILT_IN_EH_COPY_VALUES
,
10089 "__builtin_eh_copy_values", ECF_NOTHROW
);
10091 /* Complex multiplication and division. These are handled as builtins
10092 rather than optabs because emit_library_call_value doesn't support
10093 complex. Further, we can do slightly better with folding these
10094 beasties if the real and complex parts of the arguments are separate. */
10098 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10100 char mode_name_buf
[4], *q
;
10102 enum built_in_function mcode
, dcode
;
10103 tree type
, inner_type
;
10104 const char *prefix
= "__";
10106 if (targetm
.libfunc_gnu_prefix
)
10109 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10112 inner_type
= TREE_TYPE (type
);
10114 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10115 inner_type
, inner_type
, NULL_TREE
);
10117 mcode
= ((enum built_in_function
)
10118 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10119 dcode
= ((enum built_in_function
)
10120 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10122 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10126 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10128 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10129 built_in_names
[mcode
],
10130 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10132 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10134 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10135 built_in_names
[dcode
],
10136 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10140 init_internal_fns ();
10143 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10146 If we requested a pointer to a vector, build up the pointers that
10147 we stripped off while looking for the inner type. Similarly for
10148 return values from functions.
10150 The argument TYPE is the top of the chain, and BOTTOM is the
10151 new type which we will point to. */
10154 reconstruct_complex_type (tree type
, tree bottom
)
10158 if (TREE_CODE (type
) == POINTER_TYPE
)
10160 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10161 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10162 TYPE_REF_CAN_ALIAS_ALL (type
));
10164 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10166 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10167 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10168 TYPE_REF_CAN_ALIAS_ALL (type
));
10170 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10172 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10173 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10175 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10177 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10178 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10180 else if (TREE_CODE (type
) == METHOD_TYPE
)
10182 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10183 /* The build_method_type_directly() routine prepends 'this' to argument list,
10184 so we must compensate by getting rid of it. */
10186 = build_method_type_directly
10187 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10189 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10191 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10193 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10194 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10199 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10200 TYPE_QUALS (type
));
10203 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10206 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10209 unsigned int bitsize
;
10211 switch (GET_MODE_CLASS (mode
))
10213 case MODE_VECTOR_INT
:
10214 case MODE_VECTOR_FLOAT
:
10215 case MODE_VECTOR_FRACT
:
10216 case MODE_VECTOR_UFRACT
:
10217 case MODE_VECTOR_ACCUM
:
10218 case MODE_VECTOR_UACCUM
:
10219 nunits
= GET_MODE_NUNITS (mode
);
10223 /* Check that there are no leftover bits. */
10224 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10225 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10226 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10230 gcc_unreachable ();
10233 return make_vector_type (innertype
, nunits
, mode
);
10236 /* Similarly, but takes the inner type and number of units, which must be
10240 build_vector_type (tree innertype
, int nunits
)
10242 return make_vector_type (innertype
, nunits
, VOIDmode
);
10245 /* Build truth vector with specified length and number of units. */
10248 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10250 machine_mode mask_mode
10251 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10253 unsigned HOST_WIDE_INT vsize
;
10254 if (mask_mode
== BLKmode
)
10255 vsize
= vector_size
* BITS_PER_UNIT
;
10257 vsize
= GET_MODE_BITSIZE (mask_mode
);
10259 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10260 gcc_assert (esize
* nunits
== vsize
);
10262 tree bool_type
= build_nonstandard_boolean_type (esize
);
10264 return make_vector_type (bool_type
, nunits
, mask_mode
);
10267 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10270 build_same_sized_truth_vector_type (tree vectype
)
10272 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10275 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10278 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10280 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10283 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10286 build_opaque_vector_type (tree innertype
, int nunits
)
10288 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10290 /* We always build the non-opaque variant before the opaque one,
10291 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10292 cand
= TYPE_NEXT_VARIANT (t
);
10294 && TYPE_VECTOR_OPAQUE (cand
)
10295 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10297 /* Othewise build a variant type and make sure to queue it after
10298 the non-opaque type. */
10299 cand
= build_distinct_type_copy (t
);
10300 TYPE_VECTOR_OPAQUE (cand
) = true;
10301 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10302 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10303 TYPE_NEXT_VARIANT (t
) = cand
;
10304 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10309 /* Given an initializer INIT, return TRUE if INIT is zero or some
10310 aggregate of zeros. Otherwise return FALSE. */
10312 initializer_zerop (const_tree init
)
10318 switch (TREE_CODE (init
))
10321 return integer_zerop (init
);
10324 /* ??? Note that this is not correct for C4X float formats. There,
10325 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10326 negative exponent. */
10327 return real_zerop (init
)
10328 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10331 return fixed_zerop (init
);
10334 return integer_zerop (init
)
10335 || (real_zerop (init
)
10336 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10337 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10342 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10343 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10350 unsigned HOST_WIDE_INT idx
;
10352 if (TREE_CLOBBER_P (init
))
10354 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10355 if (!initializer_zerop (elt
))
10364 /* We need to loop through all elements to handle cases like
10365 "\0" and "\0foobar". */
10366 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10367 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10378 /* Check if vector VEC consists of all the equal elements and
10379 that the number of elements corresponds to the type of VEC.
10380 The function returns first element of the vector
10381 or NULL_TREE if the vector is not uniform. */
10383 uniform_vector_p (const_tree vec
)
10388 if (vec
== NULL_TREE
)
10391 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10393 if (TREE_CODE (vec
) == VECTOR_CST
)
10395 first
= VECTOR_CST_ELT (vec
, 0);
10396 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10397 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10403 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10405 first
= error_mark_node
;
10407 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10414 if (!operand_equal_p (first
, t
, 0))
10417 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10426 /* Build an empty statement at location LOC. */
10429 build_empty_stmt (location_t loc
)
10431 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10432 SET_EXPR_LOCATION (t
, loc
);
10437 /* Build an OpenMP clause with code CODE. LOC is the location of the
10441 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10446 length
= omp_clause_num_ops
[code
];
10447 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10449 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10451 t
= (tree
) ggc_internal_alloc (size
);
10452 memset (t
, 0, size
);
10453 TREE_SET_CODE (t
, OMP_CLAUSE
);
10454 OMP_CLAUSE_SET_CODE (t
, code
);
10455 OMP_CLAUSE_LOCATION (t
) = loc
;
10460 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10461 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10462 Except for the CODE and operand count field, other storage for the
10463 object is initialized to zeros. */
10466 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10469 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10471 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10472 gcc_assert (len
>= 1);
10474 record_node_allocation_statistics (code
, length
);
10476 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10478 TREE_SET_CODE (t
, code
);
10480 /* Can't use TREE_OPERAND to store the length because if checking is
10481 enabled, it will try to check the length before we store it. :-P */
10482 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10487 /* Helper function for build_call_* functions; build a CALL_EXPR with
10488 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10489 the argument slots. */
10492 build_call_1 (tree return_type
, tree fn
, int nargs
)
10496 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10497 TREE_TYPE (t
) = return_type
;
10498 CALL_EXPR_FN (t
) = fn
;
10499 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10504 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10505 FN and a null static chain slot. NARGS is the number of call arguments
10506 which are specified as "..." arguments. */
10509 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10513 va_start (args
, nargs
);
10514 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10519 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10520 FN and a null static chain slot. NARGS is the number of call arguments
10521 which are specified as a va_list ARGS. */
10524 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10529 t
= build_call_1 (return_type
, fn
, nargs
);
10530 for (i
= 0; i
< nargs
; i
++)
10531 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10532 process_call_operands (t
);
10536 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10537 FN and a null static chain slot. NARGS is the number of call arguments
10538 which are specified as a tree array ARGS. */
10541 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10542 int nargs
, const tree
*args
)
10547 t
= build_call_1 (return_type
, fn
, nargs
);
10548 for (i
= 0; i
< nargs
; i
++)
10549 CALL_EXPR_ARG (t
, i
) = args
[i
];
10550 process_call_operands (t
);
10551 SET_EXPR_LOCATION (t
, loc
);
10555 /* Like build_call_array, but takes a vec. */
10558 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10563 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10564 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10565 CALL_EXPR_ARG (ret
, ix
) = t
;
10566 process_call_operands (ret
);
10570 /* Conveniently construct a function call expression. FNDECL names the
10571 function to be called and N arguments are passed in the array
10575 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10577 tree fntype
= TREE_TYPE (fndecl
);
10578 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10580 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10583 /* Conveniently construct a function call expression. FNDECL names the
10584 function to be called and the arguments are passed in the vector
10588 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10590 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10591 vec_safe_address (vec
));
10595 /* Conveniently construct a function call expression. FNDECL names the
10596 function to be called, N is the number of arguments, and the "..."
10597 parameters are the argument expressions. */
10600 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10603 tree
*argarray
= XALLOCAVEC (tree
, n
);
10607 for (i
= 0; i
< n
; i
++)
10608 argarray
[i
] = va_arg (ap
, tree
);
10610 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10613 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10614 varargs macros aren't supported by all bootstrap compilers. */
10617 build_call_expr (tree fndecl
, int n
, ...)
10620 tree
*argarray
= XALLOCAVEC (tree
, n
);
10624 for (i
= 0; i
< n
; i
++)
10625 argarray
[i
] = va_arg (ap
, tree
);
10627 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10630 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10631 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10632 It will get gimplified later into an ordinary internal function. */
10635 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10636 tree type
, int n
, const tree
*args
)
10638 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10639 for (int i
= 0; i
< n
; ++i
)
10640 CALL_EXPR_ARG (t
, i
) = args
[i
];
10641 SET_EXPR_LOCATION (t
, loc
);
10642 CALL_EXPR_IFN (t
) = ifn
;
10646 /* Build internal call expression. This is just like CALL_EXPR, except
10647 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10648 internal function. */
10651 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10652 tree type
, int n
, ...)
10655 tree
*argarray
= XALLOCAVEC (tree
, n
);
10659 for (i
= 0; i
< n
; i
++)
10660 argarray
[i
] = va_arg (ap
, tree
);
10662 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10665 /* Return a function call to FN, if the target is guaranteed to support it,
10668 N is the number of arguments, passed in the "...", and TYPE is the
10669 type of the return value. */
10672 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
10676 tree
*argarray
= XALLOCAVEC (tree
, n
);
10680 for (i
= 0; i
< n
; i
++)
10681 argarray
[i
] = va_arg (ap
, tree
);
10683 if (internal_fn_p (fn
))
10685 internal_fn ifn
= as_internal_fn (fn
);
10686 if (direct_internal_fn_p (ifn
))
10688 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
10689 if (!direct_internal_fn_supported_p (ifn
, types
,
10690 OPTIMIZE_FOR_BOTH
))
10693 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10697 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
10700 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10704 /* Create a new constant string literal and return a char* pointer to it.
10705 The STRING_CST value is the LEN characters at STR. */
10707 build_string_literal (int len
, const char *str
)
10709 tree t
, elem
, index
, type
;
10711 t
= build_string (len
, str
);
10712 elem
= build_type_variant (char_type_node
, 1, 0);
10713 index
= build_index_type (size_int (len
- 1));
10714 type
= build_array_type (elem
, index
);
10715 TREE_TYPE (t
) = type
;
10716 TREE_CONSTANT (t
) = 1;
10717 TREE_READONLY (t
) = 1;
10718 TREE_STATIC (t
) = 1;
10720 type
= build_pointer_type (elem
);
10721 t
= build1 (ADDR_EXPR
, type
,
10722 build4 (ARRAY_REF
, elem
,
10723 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10729 /* Return true if T (assumed to be a DECL) must be assigned a memory
10733 needs_to_live_in_memory (const_tree t
)
10735 return (TREE_ADDRESSABLE (t
)
10736 || is_global_var (t
)
10737 || (TREE_CODE (t
) == RESULT_DECL
10738 && !DECL_BY_REFERENCE (t
)
10739 && aggregate_value_p (t
, current_function_decl
)));
10742 /* Return value of a constant X and sign-extend it. */
10745 int_cst_value (const_tree x
)
10747 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10748 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10750 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10751 gcc_assert (cst_and_fits_in_hwi (x
));
10753 if (bits
< HOST_BITS_PER_WIDE_INT
)
10755 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10757 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
10759 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
10765 /* If TYPE is an integral or pointer type, return an integer type with
10766 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10767 if TYPE is already an integer type of signedness UNSIGNEDP. */
10770 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10772 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10775 if (TREE_CODE (type
) == VECTOR_TYPE
)
10777 tree inner
= TREE_TYPE (type
);
10778 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10781 if (inner
== inner2
)
10783 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10786 if (!INTEGRAL_TYPE_P (type
)
10787 && !POINTER_TYPE_P (type
)
10788 && TREE_CODE (type
) != OFFSET_TYPE
)
10791 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10794 /* If TYPE is an integral or pointer type, return an integer type with
10795 the same precision which is unsigned, or itself if TYPE is already an
10796 unsigned integer type. */
10799 unsigned_type_for (tree type
)
10801 return signed_or_unsigned_type_for (1, type
);
10804 /* If TYPE is an integral or pointer type, return an integer type with
10805 the same precision which is signed, or itself if TYPE is already a
10806 signed integer type. */
10809 signed_type_for (tree type
)
10811 return signed_or_unsigned_type_for (0, type
);
10814 /* If TYPE is a vector type, return a signed integer vector type with the
10815 same width and number of subparts. Otherwise return boolean_type_node. */
10818 truth_type_for (tree type
)
10820 if (TREE_CODE (type
) == VECTOR_TYPE
)
10822 if (VECTOR_BOOLEAN_TYPE_P (type
))
10824 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
10825 GET_MODE_SIZE (TYPE_MODE (type
)));
10828 return boolean_type_node
;
10831 /* Returns the largest value obtainable by casting something in INNER type to
10835 upper_bound_in_type (tree outer
, tree inner
)
10837 unsigned int det
= 0;
10838 unsigned oprec
= TYPE_PRECISION (outer
);
10839 unsigned iprec
= TYPE_PRECISION (inner
);
10842 /* Compute a unique number for every combination. */
10843 det
|= (oprec
> iprec
) ? 4 : 0;
10844 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10845 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10847 /* Determine the exponent to use. */
10852 /* oprec <= iprec, outer: signed, inner: don't care. */
10857 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10861 /* oprec > iprec, outer: signed, inner: signed. */
10865 /* oprec > iprec, outer: signed, inner: unsigned. */
10869 /* oprec > iprec, outer: unsigned, inner: signed. */
10873 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10877 gcc_unreachable ();
10880 return wide_int_to_tree (outer
,
10881 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10884 /* Returns the smallest value obtainable by casting something in INNER type to
10888 lower_bound_in_type (tree outer
, tree inner
)
10890 unsigned oprec
= TYPE_PRECISION (outer
);
10891 unsigned iprec
= TYPE_PRECISION (inner
);
10893 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10895 if (TYPE_UNSIGNED (outer
)
10896 /* If we are widening something of an unsigned type, OUTER type
10897 contains all values of INNER type. In particular, both INNER
10898 and OUTER types have zero in common. */
10899 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10900 return build_int_cst (outer
, 0);
10903 /* If we are widening a signed type to another signed type, we
10904 want to obtain -2^^(iprec-1). If we are keeping the
10905 precision or narrowing to a signed type, we want to obtain
10907 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10908 return wide_int_to_tree (outer
,
10909 wi::mask (prec
- 1, true,
10910 TYPE_PRECISION (outer
)));
10914 /* Return nonzero if two operands that are suitable for PHI nodes are
10915 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10916 SSA_NAME or invariant. Note that this is strictly an optimization.
10917 That is, callers of this function can directly call operand_equal_p
10918 and get the same result, only slower. */
10921 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10925 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10927 return operand_equal_p (arg0
, arg1
, 0);
10930 /* Returns number of zeros at the end of binary representation of X. */
10933 num_ending_zeros (const_tree x
)
10935 return build_int_cst (TREE_TYPE (x
), wi::ctz (wi::to_wide (x
)));
10939 #define WALK_SUBTREE(NODE) \
10942 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10948 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10949 be walked whenever a type is seen in the tree. Rest of operands and return
10950 value are as for walk_tree. */
10953 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10954 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10956 tree result
= NULL_TREE
;
10958 switch (TREE_CODE (type
))
10961 case REFERENCE_TYPE
:
10963 /* We have to worry about mutually recursive pointers. These can't
10964 be written in C. They can in Ada. It's pathological, but
10965 there's an ACATS test (c38102a) that checks it. Deal with this
10966 by checking if we're pointing to another pointer, that one
10967 points to another pointer, that one does too, and we have no htab.
10968 If so, get a hash table. We check three levels deep to avoid
10969 the cost of the hash table if we don't need one. */
10970 if (POINTER_TYPE_P (TREE_TYPE (type
))
10971 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10972 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10975 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10986 WALK_SUBTREE (TREE_TYPE (type
));
10990 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10992 /* Fall through. */
10994 case FUNCTION_TYPE
:
10995 WALK_SUBTREE (TREE_TYPE (type
));
10999 /* We never want to walk into default arguments. */
11000 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11001 WALK_SUBTREE (TREE_VALUE (arg
));
11006 /* Don't follow this nodes's type if a pointer for fear that
11007 we'll have infinite recursion. If we have a PSET, then we
11010 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11011 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11012 WALK_SUBTREE (TREE_TYPE (type
));
11013 WALK_SUBTREE (TYPE_DOMAIN (type
));
11017 WALK_SUBTREE (TREE_TYPE (type
));
11018 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11028 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11029 called with the DATA and the address of each sub-tree. If FUNC returns a
11030 non-NULL value, the traversal is stopped, and the value returned by FUNC
11031 is returned. If PSET is non-NULL it is used to record the nodes visited,
11032 and to avoid visiting a node more than once. */
11035 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11036 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11038 enum tree_code code
;
11042 #define WALK_SUBTREE_TAIL(NODE) \
11046 goto tail_recurse; \
11051 /* Skip empty subtrees. */
11055 /* Don't walk the same tree twice, if the user has requested
11056 that we avoid doing so. */
11057 if (pset
&& pset
->add (*tp
))
11060 /* Call the function. */
11062 result
= (*func
) (tp
, &walk_subtrees
, data
);
11064 /* If we found something, return it. */
11068 code
= TREE_CODE (*tp
);
11070 /* Even if we didn't, FUNC may have decided that there was nothing
11071 interesting below this point in the tree. */
11072 if (!walk_subtrees
)
11074 /* But we still need to check our siblings. */
11075 if (code
== TREE_LIST
)
11076 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11077 else if (code
== OMP_CLAUSE
)
11078 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11085 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11086 if (result
|| !walk_subtrees
)
11093 case IDENTIFIER_NODE
:
11100 case PLACEHOLDER_EXPR
:
11104 /* None of these have subtrees other than those already walked
11109 WALK_SUBTREE (TREE_VALUE (*tp
));
11110 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11115 int len
= TREE_VEC_LENGTH (*tp
);
11120 /* Walk all elements but the first. */
11122 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11124 /* Now walk the first one as a tail call. */
11125 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11129 WALK_SUBTREE (TREE_REALPART (*tp
));
11130 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11134 unsigned HOST_WIDE_INT idx
;
11135 constructor_elt
*ce
;
11137 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11139 WALK_SUBTREE (ce
->value
);
11144 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11149 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11151 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11152 into declarations that are just mentioned, rather than
11153 declared; they don't really belong to this part of the tree.
11154 And, we can see cycles: the initializer for a declaration
11155 can refer to the declaration itself. */
11156 WALK_SUBTREE (DECL_INITIAL (decl
));
11157 WALK_SUBTREE (DECL_SIZE (decl
));
11158 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11160 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11163 case STATEMENT_LIST
:
11165 tree_stmt_iterator i
;
11166 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11167 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11172 switch (OMP_CLAUSE_CODE (*tp
))
11174 case OMP_CLAUSE_GANG
:
11175 case OMP_CLAUSE__GRIDDIM_
:
11176 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11179 case OMP_CLAUSE_ASYNC
:
11180 case OMP_CLAUSE_WAIT
:
11181 case OMP_CLAUSE_WORKER
:
11182 case OMP_CLAUSE_VECTOR
:
11183 case OMP_CLAUSE_NUM_GANGS
:
11184 case OMP_CLAUSE_NUM_WORKERS
:
11185 case OMP_CLAUSE_VECTOR_LENGTH
:
11186 case OMP_CLAUSE_PRIVATE
:
11187 case OMP_CLAUSE_SHARED
:
11188 case OMP_CLAUSE_FIRSTPRIVATE
:
11189 case OMP_CLAUSE_COPYIN
:
11190 case OMP_CLAUSE_COPYPRIVATE
:
11191 case OMP_CLAUSE_FINAL
:
11192 case OMP_CLAUSE_IF
:
11193 case OMP_CLAUSE_NUM_THREADS
:
11194 case OMP_CLAUSE_SCHEDULE
:
11195 case OMP_CLAUSE_UNIFORM
:
11196 case OMP_CLAUSE_DEPEND
:
11197 case OMP_CLAUSE_NUM_TEAMS
:
11198 case OMP_CLAUSE_THREAD_LIMIT
:
11199 case OMP_CLAUSE_DEVICE
:
11200 case OMP_CLAUSE_DIST_SCHEDULE
:
11201 case OMP_CLAUSE_SAFELEN
:
11202 case OMP_CLAUSE_SIMDLEN
:
11203 case OMP_CLAUSE_ORDERED
:
11204 case OMP_CLAUSE_PRIORITY
:
11205 case OMP_CLAUSE_GRAINSIZE
:
11206 case OMP_CLAUSE_NUM_TASKS
:
11207 case OMP_CLAUSE_HINT
:
11208 case OMP_CLAUSE_TO_DECLARE
:
11209 case OMP_CLAUSE_LINK
:
11210 case OMP_CLAUSE_USE_DEVICE_PTR
:
11211 case OMP_CLAUSE_IS_DEVICE_PTR
:
11212 case OMP_CLAUSE__LOOPTEMP_
:
11213 case OMP_CLAUSE__SIMDUID_
:
11214 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11215 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11218 case OMP_CLAUSE_INDEPENDENT
:
11219 case OMP_CLAUSE_NOWAIT
:
11220 case OMP_CLAUSE_DEFAULT
:
11221 case OMP_CLAUSE_UNTIED
:
11222 case OMP_CLAUSE_MERGEABLE
:
11223 case OMP_CLAUSE_PROC_BIND
:
11224 case OMP_CLAUSE_INBRANCH
:
11225 case OMP_CLAUSE_NOTINBRANCH
:
11226 case OMP_CLAUSE_FOR
:
11227 case OMP_CLAUSE_PARALLEL
:
11228 case OMP_CLAUSE_SECTIONS
:
11229 case OMP_CLAUSE_TASKGROUP
:
11230 case OMP_CLAUSE_NOGROUP
:
11231 case OMP_CLAUSE_THREADS
:
11232 case OMP_CLAUSE_SIMD
:
11233 case OMP_CLAUSE_DEFAULTMAP
:
11234 case OMP_CLAUSE_AUTO
:
11235 case OMP_CLAUSE_SEQ
:
11236 case OMP_CLAUSE_TILE
:
11237 case OMP_CLAUSE__SIMT_
:
11238 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11240 case OMP_CLAUSE_LASTPRIVATE
:
11241 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11242 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11243 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11245 case OMP_CLAUSE_COLLAPSE
:
11248 for (i
= 0; i
< 3; i
++)
11249 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11250 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11253 case OMP_CLAUSE_LINEAR
:
11254 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11255 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11256 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11257 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11259 case OMP_CLAUSE_ALIGNED
:
11260 case OMP_CLAUSE_FROM
:
11261 case OMP_CLAUSE_TO
:
11262 case OMP_CLAUSE_MAP
:
11263 case OMP_CLAUSE__CACHE_
:
11264 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11265 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11266 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11268 case OMP_CLAUSE_REDUCTION
:
11271 for (i
= 0; i
< 5; i
++)
11272 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11273 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11277 gcc_unreachable ();
11285 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11286 But, we only want to walk once. */
11287 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11288 for (i
= 0; i
< len
; ++i
)
11289 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11290 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11294 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11295 defining. We only want to walk into these fields of a type in this
11296 case and not in the general case of a mere reference to the type.
11298 The criterion is as follows: if the field can be an expression, it
11299 must be walked only here. This should be in keeping with the fields
11300 that are directly gimplified in gimplify_type_sizes in order for the
11301 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11302 variable-sized types.
11304 Note that DECLs get walked as part of processing the BIND_EXPR. */
11305 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11307 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11308 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11311 /* Call the function for the type. See if it returns anything or
11312 doesn't want us to continue. If we are to continue, walk both
11313 the normal fields and those for the declaration case. */
11314 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11315 if (result
|| !walk_subtrees
)
11318 /* But do not walk a pointed-to type since it may itself need to
11319 be walked in the declaration case if it isn't anonymous. */
11320 if (!POINTER_TYPE_P (*type_p
))
11322 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11327 /* If this is a record type, also walk the fields. */
11328 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11332 for (field
= TYPE_FIELDS (*type_p
); field
;
11333 field
= DECL_CHAIN (field
))
11335 /* We'd like to look at the type of the field, but we can
11336 easily get infinite recursion. So assume it's pointed
11337 to elsewhere in the tree. Also, ignore things that
11339 if (TREE_CODE (field
) != FIELD_DECL
)
11342 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11343 WALK_SUBTREE (DECL_SIZE (field
));
11344 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11345 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11346 WALK_SUBTREE (DECL_QUALIFIER (field
));
11350 /* Same for scalar types. */
11351 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11352 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11353 || TREE_CODE (*type_p
) == INTEGER_TYPE
11354 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11355 || TREE_CODE (*type_p
) == REAL_TYPE
)
11357 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11358 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11361 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11362 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11367 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11371 /* Walk over all the sub-trees of this operand. */
11372 len
= TREE_OPERAND_LENGTH (*tp
);
11374 /* Go through the subtrees. We need to do this in forward order so
11375 that the scope of a FOR_EXPR is handled properly. */
11378 for (i
= 0; i
< len
- 1; ++i
)
11379 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11380 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11383 /* If this is a type, walk the needed fields in the type. */
11384 else if (TYPE_P (*tp
))
11385 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11389 /* We didn't find what we were looking for. */
11392 #undef WALK_SUBTREE_TAIL
11394 #undef WALK_SUBTREE
11396 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11399 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11404 hash_set
<tree
> pset
;
11405 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11411 tree_block (tree t
)
11413 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11415 if (IS_EXPR_CODE_CLASS (c
))
11416 return LOCATION_BLOCK (t
->exp
.locus
);
11417 gcc_unreachable ();
11422 tree_set_block (tree t
, tree b
)
11424 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11426 if (IS_EXPR_CODE_CLASS (c
))
11428 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11431 gcc_unreachable ();
11434 /* Create a nameless artificial label and put it in the current
11435 function context. The label has a location of LOC. Returns the
11436 newly created label. */
11439 create_artificial_label (location_t loc
)
11441 tree lab
= build_decl (loc
,
11442 LABEL_DECL
, NULL_TREE
, void_type_node
);
11444 DECL_ARTIFICIAL (lab
) = 1;
11445 DECL_IGNORED_P (lab
) = 1;
11446 DECL_CONTEXT (lab
) = current_function_decl
;
11450 /* Given a tree, try to return a useful variable name that we can use
11451 to prefix a temporary that is being assigned the value of the tree.
11452 I.E. given <temp> = &A, return A. */
11457 tree stripped_decl
;
11460 STRIP_NOPS (stripped_decl
);
11461 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11462 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11463 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11465 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11468 return IDENTIFIER_POINTER (name
);
11472 switch (TREE_CODE (stripped_decl
))
11475 return get_name (TREE_OPERAND (stripped_decl
, 0));
11482 /* Return true if TYPE has a variable argument list. */
11485 stdarg_p (const_tree fntype
)
11487 function_args_iterator args_iter
;
11488 tree n
= NULL_TREE
, t
;
11493 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11498 return n
!= NULL_TREE
&& n
!= void_type_node
;
11501 /* Return true if TYPE has a prototype. */
11504 prototype_p (const_tree fntype
)
11508 gcc_assert (fntype
!= NULL_TREE
);
11510 t
= TYPE_ARG_TYPES (fntype
);
11511 return (t
!= NULL_TREE
);
11514 /* If BLOCK is inlined from an __attribute__((__artificial__))
11515 routine, return pointer to location from where it has been
11518 block_nonartificial_location (tree block
)
11520 location_t
*ret
= NULL
;
11522 while (block
&& TREE_CODE (block
) == BLOCK
11523 && BLOCK_ABSTRACT_ORIGIN (block
))
11525 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11527 while (TREE_CODE (ao
) == BLOCK
11528 && BLOCK_ABSTRACT_ORIGIN (ao
)
11529 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11530 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11532 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11534 /* If AO is an artificial inline, point RET to the
11535 call site locus at which it has been inlined and continue
11536 the loop, in case AO's caller is also an artificial
11538 if (DECL_DECLARED_INLINE_P (ao
)
11539 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11540 ret
= &BLOCK_SOURCE_LOCATION (block
);
11544 else if (TREE_CODE (ao
) != BLOCK
)
11547 block
= BLOCK_SUPERCONTEXT (block
);
11553 /* If EXP is inlined from an __attribute__((__artificial__))
11554 function, return the location of the original call expression. */
11557 tree_nonartificial_location (tree exp
)
11559 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11564 return EXPR_LOCATION (exp
);
11568 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11571 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11574 cl_option_hasher::hash (tree x
)
11576 const_tree
const t
= x
;
11580 hashval_t hash
= 0;
11582 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11584 p
= (const char *)TREE_OPTIMIZATION (t
);
11585 len
= sizeof (struct cl_optimization
);
11588 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11589 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11592 gcc_unreachable ();
11594 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11596 for (i
= 0; i
< len
; i
++)
11598 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11603 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11604 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11608 cl_option_hasher::equal (tree x
, tree y
)
11610 const_tree
const xt
= x
;
11611 const_tree
const yt
= y
;
11616 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11619 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11621 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11622 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11623 len
= sizeof (struct cl_optimization
);
11626 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11628 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11629 TREE_TARGET_OPTION (yt
));
11633 gcc_unreachable ();
11635 return (memcmp (xp
, yp
, len
) == 0);
11638 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11641 build_optimization_node (struct gcc_options
*opts
)
11645 /* Use the cache of optimization nodes. */
11647 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11650 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11654 /* Insert this one into the hash table. */
11655 t
= cl_optimization_node
;
11658 /* Make a new node for next time round. */
11659 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11665 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11668 build_target_option_node (struct gcc_options
*opts
)
11672 /* Use the cache of optimization nodes. */
11674 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11677 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11681 /* Insert this one into the hash table. */
11682 t
= cl_target_option_node
;
11685 /* Make a new node for next time round. */
11686 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11692 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11693 so that they aren't saved during PCH writing. */
11696 prepare_target_option_nodes_for_pch (void)
11698 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11699 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11700 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11701 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11704 /* Determine the "ultimate origin" of a block. The block may be an inlined
11705 instance of an inlined instance of a block which is local to an inline
11706 function, so we have to trace all of the way back through the origin chain
11707 to find out what sort of node actually served as the original seed for the
11711 block_ultimate_origin (const_tree block
)
11713 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11715 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11716 we're trying to output the abstract instance of this function. */
11717 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11720 if (immediate_origin
== NULL_TREE
)
11725 tree lookahead
= immediate_origin
;
11729 ret_val
= lookahead
;
11730 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11731 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11733 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11735 /* The block's abstract origin chain may not be the *ultimate* origin of
11736 the block. It could lead to a DECL that has an abstract origin set.
11737 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11738 will give us if it has one). Note that DECL's abstract origins are
11739 supposed to be the most distant ancestor (or so decl_ultimate_origin
11740 claims), so we don't need to loop following the DECL origins. */
11741 if (DECL_P (ret_val
))
11742 return DECL_ORIGIN (ret_val
);
11748 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11752 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11754 /* Do not strip casts into or out of differing address spaces. */
11755 if (POINTER_TYPE_P (outer_type
)
11756 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
11758 if (!POINTER_TYPE_P (inner_type
)
11759 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
11760 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
11763 else if (POINTER_TYPE_P (inner_type
)
11764 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
11766 /* We already know that outer_type is not a pointer with
11767 a non-generic address space. */
11771 /* Use precision rather then machine mode when we can, which gives
11772 the correct answer even for submode (bit-field) types. */
11773 if ((INTEGRAL_TYPE_P (outer_type
)
11774 || POINTER_TYPE_P (outer_type
)
11775 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11776 && (INTEGRAL_TYPE_P (inner_type
)
11777 || POINTER_TYPE_P (inner_type
)
11778 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11779 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11781 /* Otherwise fall back on comparing machine modes (e.g. for
11782 aggregate types, floats). */
11783 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11786 /* Return true iff conversion in EXP generates no instruction. Mark
11787 it inline so that we fully inline into the stripping functions even
11788 though we have two uses of this function. */
11791 tree_nop_conversion (const_tree exp
)
11793 tree outer_type
, inner_type
;
11795 if (!CONVERT_EXPR_P (exp
)
11796 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11798 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11801 outer_type
= TREE_TYPE (exp
);
11802 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11807 return tree_nop_conversion_p (outer_type
, inner_type
);
11810 /* Return true iff conversion in EXP generates no instruction. Don't
11811 consider conversions changing the signedness. */
11814 tree_sign_nop_conversion (const_tree exp
)
11816 tree outer_type
, inner_type
;
11818 if (!tree_nop_conversion (exp
))
11821 outer_type
= TREE_TYPE (exp
);
11822 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11824 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11825 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11828 /* Strip conversions from EXP according to tree_nop_conversion and
11829 return the resulting expression. */
11832 tree_strip_nop_conversions (tree exp
)
11834 while (tree_nop_conversion (exp
))
11835 exp
= TREE_OPERAND (exp
, 0);
11839 /* Strip conversions from EXP according to tree_sign_nop_conversion
11840 and return the resulting expression. */
11843 tree_strip_sign_nop_conversions (tree exp
)
11845 while (tree_sign_nop_conversion (exp
))
11846 exp
= TREE_OPERAND (exp
, 0);
11850 /* Avoid any floating point extensions from EXP. */
11852 strip_float_extensions (tree exp
)
11854 tree sub
, expt
, subt
;
11856 /* For floating point constant look up the narrowest type that can hold
11857 it properly and handle it like (type)(narrowest_type)constant.
11858 This way we can optimize for instance a=a*2.0 where "a" is float
11859 but 2.0 is double constant. */
11860 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11862 REAL_VALUE_TYPE orig
;
11865 orig
= TREE_REAL_CST (exp
);
11866 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11867 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11868 type
= float_type_node
;
11869 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11870 > TYPE_PRECISION (double_type_node
)
11871 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11872 type
= double_type_node
;
11874 return build_real_truncate (type
, orig
);
11877 if (!CONVERT_EXPR_P (exp
))
11880 sub
= TREE_OPERAND (exp
, 0);
11881 subt
= TREE_TYPE (sub
);
11882 expt
= TREE_TYPE (exp
);
11884 if (!FLOAT_TYPE_P (subt
))
11887 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11890 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11893 return strip_float_extensions (sub
);
11896 /* Strip out all handled components that produce invariant
11900 strip_invariant_refs (const_tree op
)
11902 while (handled_component_p (op
))
11904 switch (TREE_CODE (op
))
11907 case ARRAY_RANGE_REF
:
11908 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11909 || TREE_OPERAND (op
, 2) != NULL_TREE
11910 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11914 case COMPONENT_REF
:
11915 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11921 op
= TREE_OPERAND (op
, 0);
11927 static GTY(()) tree gcc_eh_personality_decl
;
11929 /* Return the GCC personality function decl. */
11932 lhd_gcc_personality (void)
11934 if (!gcc_eh_personality_decl
)
11935 gcc_eh_personality_decl
= build_personality_function ("gcc");
11936 return gcc_eh_personality_decl
;
11939 /* TARGET is a call target of GIMPLE call statement
11940 (obtained by gimple_call_fn). Return true if it is
11941 OBJ_TYPE_REF representing an virtual call of C++ method.
11942 (As opposed to OBJ_TYPE_REF representing objc calls
11943 through a cast where middle-end devirtualization machinery
11947 virtual_method_call_p (const_tree target
)
11949 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11951 tree t
= TREE_TYPE (target
);
11952 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
11954 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11956 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
11957 /* If we do not have BINFO associated, it means that type was built
11958 without devirtualization enabled. Do not consider this a virtual
11960 if (!TYPE_BINFO (obj_type_ref_class (target
)))
11965 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11968 obj_type_ref_class (const_tree ref
)
11970 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11971 ref
= TREE_TYPE (ref
);
11972 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11973 ref
= TREE_TYPE (ref
);
11974 /* We look for type THIS points to. ObjC also builds
11975 OBJ_TYPE_REF with non-method calls, Their first parameter
11976 ID however also corresponds to class type. */
11977 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11978 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11979 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11980 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11981 return TREE_TYPE (ref
);
11984 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
11987 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
11990 tree base_binfo
, b
;
11992 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11993 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
11994 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
11996 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12001 /* Try to find a base info of BINFO that would have its field decl at offset
12002 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12003 found, return, otherwise return NULL_TREE. */
12006 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12008 tree type
= BINFO_TYPE (binfo
);
12012 HOST_WIDE_INT pos
, size
;
12016 if (types_same_for_odr (type
, expected_type
))
12021 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12023 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12026 pos
= int_bit_position (fld
);
12027 size
= tree_to_uhwi (DECL_SIZE (fld
));
12028 if (pos
<= offset
&& (pos
+ size
) > offset
)
12031 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12034 /* Offset 0 indicates the primary base, whose vtable contents are
12035 represented in the binfo for the derived class. */
12036 else if (offset
!= 0)
12038 tree found_binfo
= NULL
, base_binfo
;
12039 /* Offsets in BINFO are in bytes relative to the whole structure
12040 while POS is in bits relative to the containing field. */
12041 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12044 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12045 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12046 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12048 found_binfo
= base_binfo
;
12052 binfo
= found_binfo
;
12054 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12058 type
= TREE_TYPE (fld
);
12063 /* Returns true if X is a typedef decl. */
12066 is_typedef_decl (const_tree x
)
12068 return (x
&& TREE_CODE (x
) == TYPE_DECL
12069 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12072 /* Returns true iff TYPE is a type variant created for a typedef. */
12075 typedef_variant_p (const_tree type
)
12077 return is_typedef_decl (TYPE_NAME (type
));
12080 /* Warn about a use of an identifier which was marked deprecated. */
12082 warn_deprecated_use (tree node
, tree attr
)
12086 if (node
== 0 || !warn_deprecated_decl
)
12092 attr
= DECL_ATTRIBUTES (node
);
12093 else if (TYPE_P (node
))
12095 tree decl
= TYPE_STUB_DECL (node
);
12097 attr
= lookup_attribute ("deprecated",
12098 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12103 attr
= lookup_attribute ("deprecated", attr
);
12106 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12114 w
= warning (OPT_Wdeprecated_declarations
,
12115 "%qD is deprecated: %s", node
, msg
);
12117 w
= warning (OPT_Wdeprecated_declarations
,
12118 "%qD is deprecated", node
);
12120 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12122 else if (TYPE_P (node
))
12124 tree what
= NULL_TREE
;
12125 tree decl
= TYPE_STUB_DECL (node
);
12127 if (TYPE_NAME (node
))
12129 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12130 what
= TYPE_NAME (node
);
12131 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12132 && DECL_NAME (TYPE_NAME (node
)))
12133 what
= DECL_NAME (TYPE_NAME (node
));
12141 w
= warning (OPT_Wdeprecated_declarations
,
12142 "%qE is deprecated: %s", what
, msg
);
12144 w
= warning (OPT_Wdeprecated_declarations
,
12145 "%qE is deprecated", what
);
12150 w
= warning (OPT_Wdeprecated_declarations
,
12151 "type is deprecated: %s", msg
);
12153 w
= warning (OPT_Wdeprecated_declarations
,
12154 "type is deprecated");
12157 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12164 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12167 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12172 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12175 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12181 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12182 somewhere in it. */
12185 contains_bitfld_component_ref_p (const_tree ref
)
12187 while (handled_component_p (ref
))
12189 if (TREE_CODE (ref
) == COMPONENT_REF
12190 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12192 ref
= TREE_OPERAND (ref
, 0);
12198 /* Try to determine whether a TRY_CATCH expression can fall through.
12199 This is a subroutine of block_may_fallthru. */
12202 try_catch_may_fallthru (const_tree stmt
)
12204 tree_stmt_iterator i
;
12206 /* If the TRY block can fall through, the whole TRY_CATCH can
12208 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12211 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12212 switch (TREE_CODE (tsi_stmt (i
)))
12215 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12216 catch expression and a body. The whole TRY_CATCH may fall
12217 through iff any of the catch bodies falls through. */
12218 for (; !tsi_end_p (i
); tsi_next (&i
))
12220 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12225 case EH_FILTER_EXPR
:
12226 /* The exception filter expression only matters if there is an
12227 exception. If the exception does not match EH_FILTER_TYPES,
12228 we will execute EH_FILTER_FAILURE, and we will fall through
12229 if that falls through. If the exception does match
12230 EH_FILTER_TYPES, the stack unwinder will continue up the
12231 stack, so we will not fall through. We don't know whether we
12232 will throw an exception which matches EH_FILTER_TYPES or not,
12233 so we just ignore EH_FILTER_TYPES and assume that we might
12234 throw an exception which doesn't match. */
12235 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12238 /* This case represents statements to be executed when an
12239 exception occurs. Those statements are implicitly followed
12240 by a RESX statement to resume execution after the exception.
12241 So in this case the TRY_CATCH never falls through. */
12246 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12247 need not be 100% accurate; simply be conservative and return true if we
12248 don't know. This is used only to avoid stupidly generating extra code.
12249 If we're wrong, we'll just delete the extra code later. */
12252 block_may_fallthru (const_tree block
)
12254 /* This CONST_CAST is okay because expr_last returns its argument
12255 unmodified and we assign it to a const_tree. */
12256 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12258 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12262 /* Easy cases. If the last statement of the block implies
12263 control transfer, then we can't fall through. */
12267 /* If SWITCH_LABELS is set, this is lowered, and represents a
12268 branch to a selected label and hence can not fall through.
12269 Otherwise SWITCH_BODY is set, and the switch can fall
12271 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12274 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12276 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12279 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12281 case TRY_CATCH_EXPR
:
12282 return try_catch_may_fallthru (stmt
);
12284 case TRY_FINALLY_EXPR
:
12285 /* The finally clause is always executed after the try clause,
12286 so if it does not fall through, then the try-finally will not
12287 fall through. Otherwise, if the try clause does not fall
12288 through, then when the finally clause falls through it will
12289 resume execution wherever the try clause was going. So the
12290 whole try-finally will only fall through if both the try
12291 clause and the finally clause fall through. */
12292 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12293 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12296 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12297 stmt
= TREE_OPERAND (stmt
, 1);
12303 /* Functions that do not return do not fall through. */
12304 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12306 case CLEANUP_POINT_EXPR
:
12307 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12310 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12316 return lang_hooks
.block_may_fallthru (stmt
);
12320 /* True if we are using EH to handle cleanups. */
12321 static bool using_eh_for_cleanups_flag
= false;
12323 /* This routine is called from front ends to indicate eh should be used for
12326 using_eh_for_cleanups (void)
12328 using_eh_for_cleanups_flag
= true;
12331 /* Query whether EH is used for cleanups. */
12333 using_eh_for_cleanups_p (void)
12335 return using_eh_for_cleanups_flag
;
12338 /* Wrapper for tree_code_name to ensure that tree code is valid */
12340 get_tree_code_name (enum tree_code code
)
12342 const char *invalid
= "<invalid tree code>";
12344 if (code
>= MAX_TREE_CODES
)
12347 return tree_code_name
[code
];
12350 /* Drops the TREE_OVERFLOW flag from T. */
12353 drop_tree_overflow (tree t
)
12355 gcc_checking_assert (TREE_OVERFLOW (t
));
12357 /* For tree codes with a sharing machinery re-build the result. */
12358 if (TREE_CODE (t
) == INTEGER_CST
)
12359 return wide_int_to_tree (TREE_TYPE (t
), wi::to_wide (t
));
12361 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12362 and drop the flag. */
12364 TREE_OVERFLOW (t
) = 0;
12366 /* For constants that contain nested constants, drop the flag
12367 from those as well. */
12368 if (TREE_CODE (t
) == COMPLEX_CST
)
12370 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12371 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12372 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12373 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12375 if (TREE_CODE (t
) == VECTOR_CST
)
12377 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
12379 tree
& elt
= VECTOR_CST_ELT (t
, i
);
12380 if (TREE_OVERFLOW (elt
))
12381 elt
= drop_tree_overflow (elt
);
12387 /* Given a memory reference expression T, return its base address.
12388 The base address of a memory reference expression is the main
12389 object being referenced. For instance, the base address for
12390 'array[i].fld[j]' is 'array'. You can think of this as stripping
12391 away the offset part from a memory address.
12393 This function calls handled_component_p to strip away all the inner
12394 parts of the memory reference until it reaches the base object. */
12397 get_base_address (tree t
)
12399 while (handled_component_p (t
))
12400 t
= TREE_OPERAND (t
, 0);
12402 if ((TREE_CODE (t
) == MEM_REF
12403 || TREE_CODE (t
) == TARGET_MEM_REF
)
12404 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12405 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12407 /* ??? Either the alias oracle or all callers need to properly deal
12408 with WITH_SIZE_EXPRs before we can look through those. */
12409 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12415 /* Return a tree of sizetype representing the size, in bytes, of the element
12416 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12419 array_ref_element_size (tree exp
)
12421 tree aligned_size
= TREE_OPERAND (exp
, 3);
12422 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12423 location_t loc
= EXPR_LOCATION (exp
);
12425 /* If a size was specified in the ARRAY_REF, it's the size measured
12426 in alignment units of the element type. So multiply by that value. */
12429 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12430 sizetype from another type of the same width and signedness. */
12431 if (TREE_TYPE (aligned_size
) != sizetype
)
12432 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12433 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12434 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12437 /* Otherwise, take the size from that of the element type. Substitute
12438 any PLACEHOLDER_EXPR that we have. */
12440 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12443 /* Return a tree representing the lower bound of the array mentioned in
12444 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12447 array_ref_low_bound (tree exp
)
12449 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12451 /* If a lower bound is specified in EXP, use it. */
12452 if (TREE_OPERAND (exp
, 2))
12453 return TREE_OPERAND (exp
, 2);
12455 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12456 substituting for a PLACEHOLDER_EXPR as needed. */
12457 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12458 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12460 /* Otherwise, return a zero of the appropriate type. */
12461 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12464 /* Return a tree representing the upper bound of the array mentioned in
12465 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12468 array_ref_up_bound (tree exp
)
12470 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12472 /* If there is a domain type and it has an upper bound, use it, substituting
12473 for a PLACEHOLDER_EXPR as needed. */
12474 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12475 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12477 /* Otherwise fail. */
12481 /* Returns true if REF is an array reference or a component reference
12482 to an array at the end of a structure.
12483 If this is the case, the array may be allocated larger
12484 than its upper bound implies. */
12487 array_at_struct_end_p (tree ref
)
12491 if (TREE_CODE (ref
) == ARRAY_REF
12492 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12494 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12495 ref
= TREE_OPERAND (ref
, 0);
12497 else if (TREE_CODE (ref
) == COMPONENT_REF
12498 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12499 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12503 while (handled_component_p (ref
))
12505 /* If the reference chain contains a component reference to a
12506 non-union type and there follows another field the reference
12507 is not at the end of a structure. */
12508 if (TREE_CODE (ref
) == COMPONENT_REF
)
12510 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12512 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12513 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12514 nextf
= DECL_CHAIN (nextf
);
12519 /* If we have a multi-dimensional array we do not consider
12520 a non-innermost dimension as flex array if the whole
12521 multi-dimensional array is at struct end.
12522 Same for an array of aggregates with a trailing array
12524 else if (TREE_CODE (ref
) == ARRAY_REF
)
12526 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12528 /* If we view an underlying object as sth else then what we
12529 gathered up to now is what we have to rely on. */
12530 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12533 gcc_unreachable ();
12535 ref
= TREE_OPERAND (ref
, 0);
12538 /* The array now is at struct end. Treat flexible arrays as
12539 always subject to extend, even into just padding constrained by
12540 an underlying decl. */
12541 if (! TYPE_SIZE (atype
))
12546 if (TREE_CODE (ref
) == MEM_REF
12547 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12549 size
= TYPE_SIZE (TREE_TYPE (ref
));
12550 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12553 /* If the reference is based on a declared entity, the size of the array
12554 is constrained by its given domain. (Do not trust commons PR/69368). */
12556 /* Be sure the size of MEM_REF target match. For example:
12559 struct foo *str = (struct foo *)&buf;
12561 str->trailin_array[2] = 1;
12563 is valid because BUF allocate enough space. */
12565 && (!size
|| (DECL_SIZE (ref
) != NULL
12566 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
12567 && !(flag_unconstrained_commons
12568 && VAR_P (ref
) && DECL_COMMON (ref
)))
12574 /* Return a tree representing the offset, in bytes, of the field referenced
12575 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12578 component_ref_field_offset (tree exp
)
12580 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12581 tree field
= TREE_OPERAND (exp
, 1);
12582 location_t loc
= EXPR_LOCATION (exp
);
12584 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12585 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12587 if (aligned_offset
)
12589 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12590 sizetype from another type of the same width and signedness. */
12591 if (TREE_TYPE (aligned_offset
) != sizetype
)
12592 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12593 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12594 size_int (DECL_OFFSET_ALIGN (field
)
12598 /* Otherwise, take the offset from that of the field. Substitute
12599 any PLACEHOLDER_EXPR that we have. */
12601 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
12604 /* Return the machine mode of T. For vectors, returns the mode of the
12605 inner type. The main use case is to feed the result to HONOR_NANS,
12606 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12609 element_mode (const_tree t
)
12613 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12615 return TYPE_MODE (t
);
12618 /* Vector types need to re-check the target flags each time we report
12619 the machine mode. We need to do this because attribute target can
12620 change the result of vector_mode_supported_p and have_regs_of_mode
12621 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12622 change on a per-function basis. */
12623 /* ??? Possibly a better solution is to run through all the types
12624 referenced by a function and re-compute the TYPE_MODE once, rather
12625 than make the TYPE_MODE macro call a function. */
12628 vector_type_mode (const_tree t
)
12632 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
12634 mode
= t
->type_common
.mode
;
12635 if (VECTOR_MODE_P (mode
)
12636 && (!targetm
.vector_mode_supported_p (mode
)
12637 || !have_regs_of_mode
[mode
]))
12639 scalar_int_mode innermode
;
12641 /* For integers, try mapping it to a same-sized scalar mode. */
12642 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
12644 unsigned int size
= (TYPE_VECTOR_SUBPARTS (t
)
12645 * GET_MODE_BITSIZE (innermode
));
12646 scalar_int_mode mode
;
12647 if (int_mode_for_size (size
, 0).exists (&mode
)
12648 && have_regs_of_mode
[mode
])
12658 /* Verify that basic properties of T match TV and thus T can be a variant of
12659 TV. TV should be the more specified variant (i.e. the main variant). */
12662 verify_type_variant (const_tree t
, tree tv
)
12664 /* Type variant can differ by:
12666 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12667 ENCODE_QUAL_ADDR_SPACE.
12668 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12669 in this case some values may not be set in the variant types
12670 (see TYPE_COMPLETE_P checks).
12671 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12672 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12673 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12674 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12675 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12676 this is necessary to make it possible to merge types form different TUs
12677 - arrays, pointers and references may have TREE_TYPE that is a variant
12678 of TREE_TYPE of their main variants.
12679 - aggregates may have new TYPE_FIELDS list that list variants of
12680 the main variant TYPE_FIELDS.
12681 - vector types may differ by TYPE_VECTOR_OPAQUE
12684 /* Convenience macro for matching individual fields. */
12685 #define verify_variant_match(flag) \
12687 if (flag (tv) != flag (t)) \
12689 error ("type variant differs by " #flag "."); \
12695 /* tree_base checks. */
12697 verify_variant_match (TREE_CODE
);
12698 /* FIXME: Ada builds non-artificial variants of artificial types. */
12699 if (TYPE_ARTIFICIAL (tv
) && 0)
12700 verify_variant_match (TYPE_ARTIFICIAL
);
12701 if (POINTER_TYPE_P (tv
))
12702 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
12703 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12704 verify_variant_match (TYPE_UNSIGNED
);
12705 verify_variant_match (TYPE_PACKED
);
12706 if (TREE_CODE (t
) == REFERENCE_TYPE
)
12707 verify_variant_match (TYPE_REF_IS_RVALUE
);
12708 if (AGGREGATE_TYPE_P (t
))
12709 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
12711 verify_variant_match (TYPE_SATURATING
);
12712 /* FIXME: This check trigger during libstdc++ build. */
12713 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
12714 verify_variant_match (TYPE_FINAL_P
);
12716 /* tree_type_common checks. */
12718 if (COMPLETE_TYPE_P (t
))
12720 verify_variant_match (TYPE_MODE
);
12721 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
12722 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
12723 verify_variant_match (TYPE_SIZE
);
12724 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
12725 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
12726 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
12728 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
12729 TYPE_SIZE_UNIT (tv
), 0));
12730 error ("type variant has different TYPE_SIZE_UNIT");
12732 error ("type variant's TYPE_SIZE_UNIT");
12733 debug_tree (TYPE_SIZE_UNIT (tv
));
12734 error ("type's TYPE_SIZE_UNIT");
12735 debug_tree (TYPE_SIZE_UNIT (t
));
12739 verify_variant_match (TYPE_PRECISION
);
12740 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
12741 if (RECORD_OR_UNION_TYPE_P (t
))
12742 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
12743 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12744 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
12745 /* During LTO we merge variant lists from diferent translation units
12746 that may differ BY TYPE_CONTEXT that in turn may point
12747 to TRANSLATION_UNIT_DECL.
12748 Ada also builds variants of types with different TYPE_CONTEXT. */
12749 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
12750 verify_variant_match (TYPE_CONTEXT
);
12751 verify_variant_match (TYPE_STRING_FLAG
);
12752 if (TYPE_ALIAS_SET_KNOWN_P (t
))
12754 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
12759 /* tree_type_non_common checks. */
12761 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12762 and dangle the pointer from time to time. */
12763 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12764 && (in_lto_p
|| !TYPE_VFIELD (tv
)
12765 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
12767 error ("type variant has different TYPE_VFIELD");
12771 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
12772 || TREE_CODE (t
) == INTEGER_TYPE
12773 || TREE_CODE (t
) == BOOLEAN_TYPE
12774 || TREE_CODE (t
) == REAL_TYPE
12775 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12777 verify_variant_match (TYPE_MAX_VALUE
);
12778 verify_variant_match (TYPE_MIN_VALUE
);
12780 if (TREE_CODE (t
) == METHOD_TYPE
)
12781 verify_variant_match (TYPE_METHOD_BASETYPE
);
12782 if (TREE_CODE (t
) == OFFSET_TYPE
)
12783 verify_variant_match (TYPE_OFFSET_BASETYPE
);
12784 if (TREE_CODE (t
) == ARRAY_TYPE
)
12785 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
12786 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12787 or even type's main variant. This is needed to make bootstrap pass
12788 and the bug seems new in GCC 5.
12789 C++ FE should be updated to make this consistent and we should check
12790 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12791 is a match with main variant.
12793 Also disable the check for Java for now because of parser hack that builds
12794 first an dummy BINFO and then sometimes replace it by real BINFO in some
12796 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
12797 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
12798 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12799 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12800 at LTO time only. */
12801 && (in_lto_p
&& odr_type_p (t
)))
12803 error ("type variant has different TYPE_BINFO");
12805 error ("type variant's TYPE_BINFO");
12806 debug_tree (TYPE_BINFO (tv
));
12807 error ("type's TYPE_BINFO");
12808 debug_tree (TYPE_BINFO (t
));
12812 /* Check various uses of TYPE_VALUES_RAW. */
12813 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
12814 verify_variant_match (TYPE_VALUES
);
12815 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12816 verify_variant_match (TYPE_DOMAIN
);
12817 /* Permit incomplete variants of complete type. While FEs may complete
12818 all variants, this does not happen for C++ templates in all cases. */
12819 else if (RECORD_OR_UNION_TYPE_P (t
)
12820 && COMPLETE_TYPE_P (t
)
12821 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
12825 /* Fortran builds qualified variants as new records with items of
12826 qualified type. Verify that they looks same. */
12827 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
12829 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
12830 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
12831 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
12832 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
12833 /* FIXME: gfc_nonrestricted_type builds all types as variants
12834 with exception of pointer types. It deeply copies the type
12835 which means that we may end up with a variant type
12836 referring non-variant pointer. We may change it to
12837 produce types as variants, too, like
12838 objc_get_protocol_qualified_type does. */
12839 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
12840 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
12841 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
12845 error ("type variant has different TYPE_FIELDS");
12847 error ("first mismatch is field");
12849 error ("and field");
12854 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
12855 verify_variant_match (TYPE_ARG_TYPES
);
12856 /* For C++ the qualified variant of array type is really an array type
12857 of qualified TREE_TYPE.
12858 objc builds variants of pointer where pointer to type is a variant, too
12859 in objc_get_protocol_qualified_type. */
12860 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
12861 && ((TREE_CODE (t
) != ARRAY_TYPE
12862 && !POINTER_TYPE_P (t
))
12863 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
12864 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
12866 error ("type variant has different TREE_TYPE");
12868 error ("type variant's TREE_TYPE");
12869 debug_tree (TREE_TYPE (tv
));
12870 error ("type's TREE_TYPE");
12871 debug_tree (TREE_TYPE (t
));
12874 if (type_with_alias_set_p (t
)
12875 && !gimple_canonical_types_compatible_p (t
, tv
, false))
12877 error ("type is not compatible with its variant");
12879 error ("type variant's TREE_TYPE");
12880 debug_tree (TREE_TYPE (tv
));
12881 error ("type's TREE_TYPE");
12882 debug_tree (TREE_TYPE (t
));
12886 #undef verify_variant_match
12890 /* The TYPE_CANONICAL merging machinery. It should closely resemble
12891 the middle-end types_compatible_p function. It needs to avoid
12892 claiming types are different for types that should be treated
12893 the same with respect to TBAA. Canonical types are also used
12894 for IL consistency checks via the useless_type_conversion_p
12895 predicate which does not handle all type kinds itself but falls
12896 back to pointer-comparison of TYPE_CANONICAL for aggregates
12899 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
12900 type calculation because we need to allow inter-operability between signed
12901 and unsigned variants. */
12904 type_with_interoperable_signedness (const_tree type
)
12906 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
12907 signed char and unsigned char. Similarly fortran FE builds
12908 C_SIZE_T as signed type, while C defines it unsigned. */
12910 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
12912 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
12913 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
12916 /* Return true iff T1 and T2 are structurally identical for what
12918 This function is used both by lto.c canonical type merging and by the
12919 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
12920 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
12921 only for LTO because only in these cases TYPE_CANONICAL equivalence
12922 correspond to one defined by gimple_canonical_types_compatible_p. */
12925 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
12926 bool trust_type_canonical
)
12928 /* Type variants should be same as the main variant. When not doing sanity
12929 checking to verify this fact, go to main variants and save some work. */
12930 if (trust_type_canonical
)
12932 t1
= TYPE_MAIN_VARIANT (t1
);
12933 t2
= TYPE_MAIN_VARIANT (t2
);
12936 /* Check first for the obvious case of pointer identity. */
12940 /* Check that we have two types to compare. */
12941 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
12944 /* We consider complete types always compatible with incomplete type.
12945 This does not make sense for canonical type calculation and thus we
12946 need to ensure that we are never called on it.
12948 FIXME: For more correctness the function probably should have three modes
12949 1) mode assuming that types are complete mathcing their structure
12950 2) mode allowing incomplete types but producing equivalence classes
12951 and thus ignoring all info from complete types
12952 3) mode allowing incomplete types to match complete but checking
12953 compatibility between complete types.
12955 1 and 2 can be used for canonical type calculation. 3 is the real
12956 definition of type compatibility that can be used i.e. for warnings during
12957 declaration merging. */
12959 gcc_assert (!trust_type_canonical
12960 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
12961 /* If the types have been previously registered and found equal
12964 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
12965 && trust_type_canonical
)
12967 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
12968 they are always NULL, but they are set to non-NULL for types
12969 constructed by build_pointer_type and variants. In this case the
12970 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
12971 all pointers are considered equal. Be sure to not return false
12973 gcc_checking_assert (canonical_type_used_p (t1
)
12974 && canonical_type_used_p (t2
));
12975 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
12978 /* Can't be the same type if the types don't have the same code. */
12979 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
12980 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
12983 /* Qualifiers do not matter for canonical type comparison purposes. */
12985 /* Void types and nullptr types are always the same. */
12986 if (TREE_CODE (t1
) == VOID_TYPE
12987 || TREE_CODE (t1
) == NULLPTR_TYPE
)
12990 /* Can't be the same type if they have different mode. */
12991 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
12994 /* Non-aggregate types can be handled cheaply. */
12995 if (INTEGRAL_TYPE_P (t1
)
12996 || SCALAR_FLOAT_TYPE_P (t1
)
12997 || FIXED_POINT_TYPE_P (t1
)
12998 || TREE_CODE (t1
) == VECTOR_TYPE
12999 || TREE_CODE (t1
) == COMPLEX_TYPE
13000 || TREE_CODE (t1
) == OFFSET_TYPE
13001 || POINTER_TYPE_P (t1
))
13003 /* Can't be the same type if they have different recision. */
13004 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13007 /* In some cases the signed and unsigned types are required to be
13009 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13010 && !type_with_interoperable_signedness (t1
))
13013 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13014 interoperable with "signed char". Unless all frontends are revisited
13015 to agree on these types, we must ignore the flag completely. */
13017 /* Fortran standard define C_PTR type that is compatible with every
13018 C pointer. For this reason we need to glob all pointers into one.
13019 Still pointers in different address spaces are not compatible. */
13020 if (POINTER_TYPE_P (t1
))
13022 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13023 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13027 /* Tail-recurse to components. */
13028 if (TREE_CODE (t1
) == VECTOR_TYPE
13029 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13030 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13032 trust_type_canonical
);
13037 /* Do type-specific comparisons. */
13038 switch (TREE_CODE (t1
))
13041 /* Array types are the same if the element types are the same and
13042 the number of elements are the same. */
13043 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13044 trust_type_canonical
)
13045 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13046 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13047 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13051 tree i1
= TYPE_DOMAIN (t1
);
13052 tree i2
= TYPE_DOMAIN (t2
);
13054 /* For an incomplete external array, the type domain can be
13055 NULL_TREE. Check this condition also. */
13056 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13058 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13062 tree min1
= TYPE_MIN_VALUE (i1
);
13063 tree min2
= TYPE_MIN_VALUE (i2
);
13064 tree max1
= TYPE_MAX_VALUE (i1
);
13065 tree max2
= TYPE_MAX_VALUE (i2
);
13067 /* The minimum/maximum values have to be the same. */
13070 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13071 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13072 || operand_equal_p (min1
, min2
, 0))))
13075 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13076 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13077 || operand_equal_p (max1
, max2
, 0)))))
13085 case FUNCTION_TYPE
:
13086 /* Function types are the same if the return type and arguments types
13088 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13089 trust_type_canonical
))
13092 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13096 tree parms1
, parms2
;
13098 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13100 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13102 if (!gimple_canonical_types_compatible_p
13103 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13104 trust_type_canonical
))
13108 if (parms1
|| parms2
)
13116 case QUAL_UNION_TYPE
:
13120 /* Don't try to compare variants of an incomplete type, before
13121 TYPE_FIELDS has been copied around. */
13122 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13126 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13129 /* For aggregate types, all the fields must be the same. */
13130 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13132 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13134 /* Skip non-fields and zero-sized fields. */
13135 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13137 && integer_zerop (DECL_SIZE (f1
)))))
13138 f1
= TREE_CHAIN (f1
);
13139 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13141 && integer_zerop (DECL_SIZE (f2
)))))
13142 f2
= TREE_CHAIN (f2
);
13145 /* The fields must have the same name, offset and type. */
13146 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13147 || !gimple_compare_field_offset (f1
, f2
)
13148 || !gimple_canonical_types_compatible_p
13149 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13150 trust_type_canonical
))
13154 /* If one aggregate has more fields than the other, they
13155 are not the same. */
13163 /* Consider all types with language specific trees in them mutually
13164 compatible. This is executed only from verify_type and false
13165 positives can be tolerated. */
13166 gcc_assert (!in_lto_p
);
13171 /* Verify type T. */
13174 verify_type (const_tree t
)
13176 bool error_found
= false;
13177 tree mv
= TYPE_MAIN_VARIANT (t
);
13180 error ("Main variant is not defined");
13181 error_found
= true;
13183 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13185 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13187 error_found
= true;
13189 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13190 error_found
= true;
13192 tree ct
= TYPE_CANONICAL (t
);
13195 else if (TYPE_CANONICAL (t
) != ct
)
13197 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13199 error_found
= true;
13201 /* Method and function types can not be used to address memory and thus
13202 TYPE_CANONICAL really matters only for determining useless conversions.
13204 FIXME: C++ FE produce declarations of builtin functions that are not
13205 compatible with main variants. */
13206 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13209 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13210 with variably sized arrays because their sizes possibly
13211 gimplified to different variables. */
13212 && !variably_modified_type_p (ct
, NULL
)
13213 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13215 error ("TYPE_CANONICAL is not compatible");
13217 error_found
= true;
13220 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13221 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13223 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13225 error_found
= true;
13227 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13229 error ("TYPE_CANONICAL of main variant is not main variant");
13231 debug_tree (TYPE_MAIN_VARIANT (ct
));
13232 error_found
= true;
13236 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13237 if (RECORD_OR_UNION_TYPE_P (t
))
13239 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13240 and danagle the pointer from time to time. */
13241 if (TYPE_VFIELD (t
)
13242 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13243 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13245 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13246 debug_tree (TYPE_VFIELD (t
));
13247 error_found
= true;
13250 else if (TREE_CODE (t
) == POINTER_TYPE
)
13252 if (TYPE_NEXT_PTR_TO (t
)
13253 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13255 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13256 debug_tree (TYPE_NEXT_PTR_TO (t
));
13257 error_found
= true;
13260 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13262 if (TYPE_NEXT_REF_TO (t
)
13263 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13265 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13266 debug_tree (TYPE_NEXT_REF_TO (t
));
13267 error_found
= true;
13270 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13271 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13273 /* FIXME: The following check should pass:
13274 useless_type_conversion_p (const_cast <tree> (t),
13275 TREE_TYPE (TYPE_MIN_VALUE (t))
13276 but does not for C sizetypes in LTO. */
13279 /* Check various uses of TYPE_MAXVAL_RAW. */
13280 if (RECORD_OR_UNION_TYPE_P (t
))
13282 if (!TYPE_BINFO (t
))
13284 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13286 error ("TYPE_BINFO is not TREE_BINFO");
13287 debug_tree (TYPE_BINFO (t
));
13288 error_found
= true;
13290 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13292 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13293 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13294 error_found
= true;
13297 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13299 if (TYPE_METHOD_BASETYPE (t
)
13300 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13301 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13303 error ("TYPE_METHOD_BASETYPE is not record nor union");
13304 debug_tree (TYPE_METHOD_BASETYPE (t
));
13305 error_found
= true;
13308 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13310 if (TYPE_OFFSET_BASETYPE (t
)
13311 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13312 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13314 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13315 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13316 error_found
= true;
13319 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13320 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13322 /* FIXME: The following check should pass:
13323 useless_type_conversion_p (const_cast <tree> (t),
13324 TREE_TYPE (TYPE_MAX_VALUE (t))
13325 but does not for C sizetypes in LTO. */
13327 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13329 if (TYPE_ARRAY_MAX_SIZE (t
)
13330 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13332 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13333 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13334 error_found
= true;
13337 else if (TYPE_MAX_VALUE_RAW (t
))
13339 error ("TYPE_MAX_VALUE_RAW non-NULL");
13340 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13341 error_found
= true;
13344 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13346 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13347 debug_tree (TYPE_LANG_SLOT_1 (t
));
13348 error_found
= true;
13351 /* Check various uses of TYPE_VALUES_RAW. */
13352 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13353 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13355 tree value
= TREE_VALUE (l
);
13356 tree name
= TREE_PURPOSE (l
);
13358 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13359 CONST_DECL of ENUMERAL TYPE. */
13360 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13362 error ("Enum value is not CONST_DECL or INTEGER_CST");
13363 debug_tree (value
);
13365 error_found
= true;
13367 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13368 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13370 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13371 debug_tree (value
);
13373 error_found
= true;
13375 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13377 error ("Enum value name is not IDENTIFIER_NODE");
13378 debug_tree (value
);
13380 error_found
= true;
13383 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13385 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13387 error ("Array TYPE_DOMAIN is not integer type");
13388 debug_tree (TYPE_DOMAIN (t
));
13389 error_found
= true;
13392 else if (RECORD_OR_UNION_TYPE_P (t
))
13394 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13396 error ("TYPE_FIELDS defined in incomplete type");
13397 error_found
= true;
13399 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13401 /* TODO: verify properties of decls. */
13402 if (TREE_CODE (fld
) == FIELD_DECL
)
13404 else if (TREE_CODE (fld
) == TYPE_DECL
)
13406 else if (TREE_CODE (fld
) == CONST_DECL
)
13408 else if (VAR_P (fld
))
13410 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13412 else if (TREE_CODE (fld
) == USING_DECL
)
13414 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13418 error ("Wrong tree in TYPE_FIELDS list");
13420 error_found
= true;
13424 else if (TREE_CODE (t
) == INTEGER_TYPE
13425 || TREE_CODE (t
) == BOOLEAN_TYPE
13426 || TREE_CODE (t
) == OFFSET_TYPE
13427 || TREE_CODE (t
) == REFERENCE_TYPE
13428 || TREE_CODE (t
) == NULLPTR_TYPE
13429 || TREE_CODE (t
) == POINTER_TYPE
)
13431 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13433 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13434 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13435 error_found
= true;
13437 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13439 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13440 debug_tree (TYPE_CACHED_VALUES (t
));
13441 error_found
= true;
13443 /* Verify just enough of cache to ensure that no one copied it to new type.
13444 All copying should go by copy_node that should clear it. */
13445 else if (TYPE_CACHED_VALUES_P (t
))
13448 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13449 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13450 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13452 error ("wrong TYPE_CACHED_VALUES entry");
13453 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13454 error_found
= true;
13459 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13460 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13462 /* C++ FE uses TREE_PURPOSE to store initial values. */
13463 if (TREE_PURPOSE (l
) && in_lto_p
)
13465 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13467 error_found
= true;
13469 if (!TYPE_P (TREE_VALUE (l
)))
13471 error ("Wrong entry in TYPE_ARG_TYPES list");
13473 error_found
= true;
13476 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13478 error ("TYPE_VALUES_RAW field is non-NULL");
13479 debug_tree (TYPE_VALUES_RAW (t
));
13480 error_found
= true;
13482 if (TREE_CODE (t
) != INTEGER_TYPE
13483 && TREE_CODE (t
) != BOOLEAN_TYPE
13484 && TREE_CODE (t
) != OFFSET_TYPE
13485 && TREE_CODE (t
) != REFERENCE_TYPE
13486 && TREE_CODE (t
) != NULLPTR_TYPE
13487 && TREE_CODE (t
) != POINTER_TYPE
13488 && TYPE_CACHED_VALUES_P (t
))
13490 error ("TYPE_CACHED_VALUES_P is set while it should not");
13491 error_found
= true;
13493 if (TYPE_STRING_FLAG (t
)
13494 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13496 error ("TYPE_STRING_FLAG is set on wrong type code");
13497 error_found
= true;
13500 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13501 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13503 if (TREE_CODE (t
) == METHOD_TYPE
13504 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13506 error ("TYPE_METHOD_BASETYPE is not main variant");
13507 error_found
= true;
13512 debug_tree (const_cast <tree
> (t
));
13513 internal_error ("verify_type failed");
13518 /* Return 1 if ARG interpreted as signed in its precision is known to be
13519 always positive or 2 if ARG is known to be always negative, or 3 if
13520 ARG may be positive or negative. */
13523 get_range_pos_neg (tree arg
)
13525 if (arg
== error_mark_node
)
13528 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13530 if (TREE_CODE (arg
) == INTEGER_CST
)
13532 wide_int w
= wi::sext (wi::to_wide (arg
), prec
);
13538 while (CONVERT_EXPR_P (arg
)
13539 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13540 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13542 arg
= TREE_OPERAND (arg
, 0);
13543 /* Narrower value zero extended into wider type
13544 will always result in positive values. */
13545 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13546 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13548 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13553 if (TREE_CODE (arg
) != SSA_NAME
)
13555 wide_int arg_min
, arg_max
;
13556 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13558 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13559 if (is_gimple_assign (g
)
13560 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13562 tree t
= gimple_assign_rhs1 (g
);
13563 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13564 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13566 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13567 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13569 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13578 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13580 /* For unsigned values, the "positive" range comes
13581 below the "negative" range. */
13582 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13584 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13589 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13591 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13600 /* Return true if ARG is marked with the nonnull attribute in the
13601 current function signature. */
13604 nonnull_arg_p (const_tree arg
)
13606 tree t
, attrs
, fntype
;
13607 unsigned HOST_WIDE_INT arg_num
;
13609 gcc_assert (TREE_CODE (arg
) == PARM_DECL
13610 && (POINTER_TYPE_P (TREE_TYPE (arg
))
13611 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
13613 /* The static chain decl is always non null. */
13614 if (arg
== cfun
->static_chain_decl
)
13617 /* THIS argument of method is always non-NULL. */
13618 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
13619 && arg
== DECL_ARGUMENTS (cfun
->decl
)
13620 && flag_delete_null_pointer_checks
)
13623 /* Values passed by reference are always non-NULL. */
13624 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
13625 && flag_delete_null_pointer_checks
)
13628 fntype
= TREE_TYPE (cfun
->decl
);
13629 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
13631 attrs
= lookup_attribute ("nonnull", attrs
);
13633 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13634 if (attrs
== NULL_TREE
)
13637 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13638 if (TREE_VALUE (attrs
) == NULL_TREE
)
13641 /* Get the position number for ARG in the function signature. */
13642 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
13644 t
= DECL_CHAIN (t
), arg_num
++)
13650 gcc_assert (t
== arg
);
13652 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13653 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
13655 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
13663 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13667 set_block (location_t loc
, tree block
)
13669 location_t pure_loc
= get_pure_location (loc
);
13670 source_range src_range
= get_range_from_loc (line_table
, loc
);
13671 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
13675 set_source_range (tree expr
, location_t start
, location_t finish
)
13677 source_range src_range
;
13678 src_range
.m_start
= start
;
13679 src_range
.m_finish
= finish
;
13680 return set_source_range (expr
, src_range
);
13684 set_source_range (tree expr
, source_range src_range
)
13686 if (!EXPR_P (expr
))
13687 return UNKNOWN_LOCATION
;
13689 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
13690 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
13694 SET_EXPR_LOCATION (expr
, adhoc
);
13698 /* Return the name of combined function FN, for debugging purposes. */
13701 combined_fn_name (combined_fn fn
)
13703 if (builtin_fn_p (fn
))
13705 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
13706 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
13709 return internal_fn_name (as_internal_fn (fn
));
13712 /* Return a bitmap with a bit set corresponding to each argument in
13713 a function call type FNTYPE declared with attribute nonnull,
13714 or null if none of the function's argument are nonnull. The caller
13715 must free the bitmap. */
13718 get_nonnull_args (const_tree fntype
)
13720 if (fntype
== NULL_TREE
)
13723 tree attrs
= TYPE_ATTRIBUTES (fntype
);
13727 bitmap argmap
= NULL
;
13729 /* A function declaration can specify multiple attribute nonnull,
13730 each with zero or more arguments. The loop below creates a bitmap
13731 representing a union of all the arguments. An empty (but non-null)
13732 bitmap means that all arguments have been declaraed nonnull. */
13733 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
13735 attrs
= lookup_attribute ("nonnull", attrs
);
13740 argmap
= BITMAP_ALLOC (NULL
);
13742 if (!TREE_VALUE (attrs
))
13744 /* Clear the bitmap in case a previous attribute nonnull
13745 set it and this one overrides it for all arguments. */
13746 bitmap_clear (argmap
);
13750 /* Iterate over the indices of the format arguments declared nonnull
13751 and set a bit for each. */
13752 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
13754 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
13755 bitmap_set_bit (argmap
, val
);
13762 /* List of pointer types used to declare builtins before we have seen their
13765 Keep the size up to date in tree.h ! */
13766 const builtin_structptr_type builtin_structptr_types
[6] =
13768 { fileptr_type_node
, ptr_type_node
, "FILE" },
13769 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
13770 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
13771 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
13772 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
13773 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
13778 namespace selftest
{
13780 /* Selftests for tree. */
13782 /* Verify that integer constants are sane. */
13785 test_integer_constants ()
13787 ASSERT_TRUE (integer_type_node
!= NULL
);
13788 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
13790 tree type
= integer_type_node
;
13792 tree zero
= build_zero_cst (type
);
13793 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
13794 ASSERT_EQ (type
, TREE_TYPE (zero
));
13796 tree one
= build_int_cst (type
, 1);
13797 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
13798 ASSERT_EQ (type
, TREE_TYPE (zero
));
13801 /* Verify identifiers. */
13804 test_identifiers ()
13806 tree identifier
= get_identifier ("foo");
13807 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
13808 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
13811 /* Verify LABEL_DECL. */
13816 tree identifier
= get_identifier ("err");
13817 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
13818 identifier
, void_type_node
);
13819 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
13820 ASSERT_FALSE (FORCED_LABEL (label_decl
));
13823 /* Run all of the selftests within this file. */
13828 test_integer_constants ();
13829 test_identifiers ();
13833 } // namespace selftest
13835 #endif /* CHECKING_P */
13837 #include "gt-tree.h"