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 unsigned char 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_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
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 (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 (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 (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 (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::eq_p (tree (*slot
), 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
, 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::eq_p (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
) == expr
;
2416 /* Return 1 if EXPR is the integer constant minus one. */
2419 integer_minus_onep (const_tree expr
)
2421 if (TREE_CODE (expr
) == COMPLEX_CST
)
2422 return (integer_all_onesp (TREE_REALPART (expr
))
2423 && integer_zerop (TREE_IMAGPART (expr
)));
2425 return integer_all_onesp (expr
);
2428 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2432 integer_pow2p (const_tree expr
)
2434 if (TREE_CODE (expr
) == COMPLEX_CST
2435 && integer_pow2p (TREE_REALPART (expr
))
2436 && integer_zerop (TREE_IMAGPART (expr
)))
2439 if (TREE_CODE (expr
) != INTEGER_CST
)
2442 return wi::popcount (expr
) == 1;
2445 /* Return 1 if EXPR is an integer constant other than zero or a
2446 complex constant other than zero. */
2449 integer_nonzerop (const_tree expr
)
2451 return ((TREE_CODE (expr
) == INTEGER_CST
2452 && !wi::eq_p (expr
, 0))
2453 || (TREE_CODE (expr
) == COMPLEX_CST
2454 && (integer_nonzerop (TREE_REALPART (expr
))
2455 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2458 /* Return 1 if EXPR is the integer constant one. For vector,
2459 return 1 if every piece is the integer constant minus one
2460 (representing the value TRUE). */
2463 integer_truep (const_tree expr
)
2465 if (TREE_CODE (expr
) == VECTOR_CST
)
2466 return integer_all_onesp (expr
);
2467 return integer_onep (expr
);
2470 /* Return 1 if EXPR is the fixed-point constant zero. */
2473 fixed_zerop (const_tree expr
)
2475 return (TREE_CODE (expr
) == FIXED_CST
2476 && TREE_FIXED_CST (expr
).data
.is_zero ());
2479 /* Return the power of two represented by a tree node known to be a
2483 tree_log2 (const_tree expr
)
2485 if (TREE_CODE (expr
) == COMPLEX_CST
)
2486 return tree_log2 (TREE_REALPART (expr
));
2488 return wi::exact_log2 (expr
);
2491 /* Similar, but return the largest integer Y such that 2 ** Y is less
2492 than or equal to EXPR. */
2495 tree_floor_log2 (const_tree expr
)
2497 if (TREE_CODE (expr
) == COMPLEX_CST
)
2498 return tree_log2 (TREE_REALPART (expr
));
2500 return wi::floor_log2 (expr
);
2503 /* Return number of known trailing zero bits in EXPR, or, if the value of
2504 EXPR is known to be zero, the precision of it's type. */
2507 tree_ctz (const_tree expr
)
2509 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2510 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2513 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2514 switch (TREE_CODE (expr
))
2517 ret1
= wi::ctz (expr
);
2518 return MIN (ret1
, prec
);
2520 ret1
= wi::ctz (get_nonzero_bits (expr
));
2521 return MIN (ret1
, prec
);
2528 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2531 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2532 return MIN (ret1
, ret2
);
2533 case POINTER_PLUS_EXPR
:
2534 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2535 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2536 /* Second operand is sizetype, which could be in theory
2537 wider than pointer's precision. Make sure we never
2538 return more than prec. */
2539 ret2
= MIN (ret2
, prec
);
2540 return MIN (ret1
, ret2
);
2542 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2543 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2544 return MAX (ret1
, ret2
);
2546 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2547 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2548 return MIN (ret1
+ ret2
, prec
);
2550 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2551 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2552 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2554 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2555 return MIN (ret1
+ ret2
, prec
);
2559 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2560 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2562 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2563 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2568 case TRUNC_DIV_EXPR
:
2570 case FLOOR_DIV_EXPR
:
2571 case ROUND_DIV_EXPR
:
2572 case EXACT_DIV_EXPR
:
2573 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2574 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2576 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2579 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2587 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2588 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2590 return MIN (ret1
, prec
);
2592 return tree_ctz (TREE_OPERAND (expr
, 0));
2594 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2597 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2598 return MIN (ret1
, ret2
);
2600 return tree_ctz (TREE_OPERAND (expr
, 1));
2602 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2603 if (ret1
> BITS_PER_UNIT
)
2605 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2606 return MIN (ret1
, prec
);
2614 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2615 decimal float constants, so don't return 1 for them. */
2618 real_zerop (const_tree expr
)
2620 switch (TREE_CODE (expr
))
2623 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2624 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2626 return real_zerop (TREE_REALPART (expr
))
2627 && real_zerop (TREE_IMAGPART (expr
));
2631 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2632 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2641 /* Return 1 if EXPR is the real constant one in real or complex form.
2642 Trailing zeroes matter for decimal float constants, so don't return
2646 real_onep (const_tree expr
)
2648 switch (TREE_CODE (expr
))
2651 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2652 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2654 return real_onep (TREE_REALPART (expr
))
2655 && real_zerop (TREE_IMAGPART (expr
));
2659 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2660 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2669 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2670 matter for decimal float constants, so don't return 1 for them. */
2673 real_minus_onep (const_tree expr
)
2675 switch (TREE_CODE (expr
))
2678 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2679 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2681 return real_minus_onep (TREE_REALPART (expr
))
2682 && real_zerop (TREE_IMAGPART (expr
));
2686 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2687 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2696 /* Nonzero if EXP is a constant or a cast of a constant. */
2699 really_constant_p (const_tree exp
)
2701 /* This is not quite the same as STRIP_NOPS. It does more. */
2702 while (CONVERT_EXPR_P (exp
)
2703 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2704 exp
= TREE_OPERAND (exp
, 0);
2705 return TREE_CONSTANT (exp
);
2708 /* Return first list element whose TREE_VALUE is ELEM.
2709 Return 0 if ELEM is not in LIST. */
2712 value_member (tree elem
, tree list
)
2716 if (elem
== TREE_VALUE (list
))
2718 list
= TREE_CHAIN (list
);
2723 /* Return first list element whose TREE_PURPOSE is ELEM.
2724 Return 0 if ELEM is not in LIST. */
2727 purpose_member (const_tree elem
, tree list
)
2731 if (elem
== TREE_PURPOSE (list
))
2733 list
= TREE_CHAIN (list
);
2738 /* Return true if ELEM is in V. */
2741 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2745 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2751 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2755 chain_index (int idx
, tree chain
)
2757 for (; chain
&& idx
> 0; --idx
)
2758 chain
= TREE_CHAIN (chain
);
2762 /* Return nonzero if ELEM is part of the chain CHAIN. */
2765 chain_member (const_tree elem
, const_tree chain
)
2771 chain
= DECL_CHAIN (chain
);
2777 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2778 We expect a null pointer to mark the end of the chain.
2779 This is the Lisp primitive `length'. */
2782 list_length (const_tree t
)
2785 #ifdef ENABLE_TREE_CHECKING
2793 #ifdef ENABLE_TREE_CHECKING
2796 gcc_assert (p
!= q
);
2804 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2805 UNION_TYPE TYPE, or NULL_TREE if none. */
2808 first_field (const_tree type
)
2810 tree t
= TYPE_FIELDS (type
);
2811 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2816 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2817 by modifying the last node in chain 1 to point to chain 2.
2818 This is the Lisp primitive `nconc'. */
2821 chainon (tree op1
, tree op2
)
2830 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2832 TREE_CHAIN (t1
) = op2
;
2834 #ifdef ENABLE_TREE_CHECKING
2837 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2838 gcc_assert (t2
!= t1
);
2845 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2848 tree_last (tree chain
)
2852 while ((next
= TREE_CHAIN (chain
)))
2857 /* Reverse the order of elements in the chain T,
2858 and return the new head of the chain (old last element). */
2863 tree prev
= 0, decl
, next
;
2864 for (decl
= t
; decl
; decl
= next
)
2866 /* We shouldn't be using this function to reverse BLOCK chains; we
2867 have blocks_nreverse for that. */
2868 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2869 next
= TREE_CHAIN (decl
);
2870 TREE_CHAIN (decl
) = prev
;
2876 /* Return a newly created TREE_LIST node whose
2877 purpose and value fields are PARM and VALUE. */
2880 build_tree_list (tree parm
, tree value MEM_STAT_DECL
)
2882 tree t
= make_node (TREE_LIST PASS_MEM_STAT
);
2883 TREE_PURPOSE (t
) = parm
;
2884 TREE_VALUE (t
) = value
;
2888 /* Build a chain of TREE_LIST nodes from a vector. */
2891 build_tree_list_vec (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2893 tree ret
= NULL_TREE
;
2897 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2899 *pp
= build_tree_list (NULL
, t PASS_MEM_STAT
);
2900 pp
= &TREE_CHAIN (*pp
);
2905 /* Return a newly created TREE_LIST node whose
2906 purpose and value fields are PURPOSE and VALUE
2907 and whose TREE_CHAIN is CHAIN. */
2910 tree_cons (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2914 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2915 memset (node
, 0, sizeof (struct tree_common
));
2917 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2919 TREE_SET_CODE (node
, TREE_LIST
);
2920 TREE_CHAIN (node
) = chain
;
2921 TREE_PURPOSE (node
) = purpose
;
2922 TREE_VALUE (node
) = value
;
2926 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2930 ctor_to_vec (tree ctor
)
2932 vec
<tree
, va_gc
> *vec
;
2933 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2937 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2938 vec
->quick_push (val
);
2943 /* Return the size nominally occupied by an object of type TYPE
2944 when it resides in memory. The value is measured in units of bytes,
2945 and its data type is that normally used for type sizes
2946 (which is the first type created by make_signed_type or
2947 make_unsigned_type). */
2950 size_in_bytes_loc (location_t loc
, const_tree type
)
2954 if (type
== error_mark_node
)
2955 return integer_zero_node
;
2957 type
= TYPE_MAIN_VARIANT (type
);
2958 t
= TYPE_SIZE_UNIT (type
);
2962 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2963 return size_zero_node
;
2969 /* Return the size of TYPE (in bytes) as a wide integer
2970 or return -1 if the size can vary or is larger than an integer. */
2973 int_size_in_bytes (const_tree type
)
2977 if (type
== error_mark_node
)
2980 type
= TYPE_MAIN_VARIANT (type
);
2981 t
= TYPE_SIZE_UNIT (type
);
2983 if (t
&& tree_fits_uhwi_p (t
))
2984 return TREE_INT_CST_LOW (t
);
2989 /* Return the maximum size of TYPE (in bytes) as a wide integer
2990 or return -1 if the size can vary or is larger than an integer. */
2993 max_int_size_in_bytes (const_tree type
)
2995 HOST_WIDE_INT size
= -1;
2998 /* If this is an array type, check for a possible MAX_SIZE attached. */
3000 if (TREE_CODE (type
) == ARRAY_TYPE
)
3002 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
3004 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3005 size
= tree_to_uhwi (size_tree
);
3008 /* If we still haven't been able to get a size, see if the language
3009 can compute a maximum size. */
3013 size_tree
= lang_hooks
.types
.max_size (type
);
3015 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3016 size
= tree_to_uhwi (size_tree
);
3022 /* Return the bit position of FIELD, in bits from the start of the record.
3023 This is a tree of type bitsizetype. */
3026 bit_position (const_tree field
)
3028 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3029 DECL_FIELD_BIT_OFFSET (field
));
3032 /* Return the byte position of FIELD, in bytes from the start of the record.
3033 This is a tree of type sizetype. */
3036 byte_position (const_tree field
)
3038 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3039 DECL_FIELD_BIT_OFFSET (field
));
3042 /* Likewise, but return as an integer. It must be representable in
3043 that way (since it could be a signed value, we don't have the
3044 option of returning -1 like int_size_in_byte can. */
3047 int_byte_position (const_tree field
)
3049 return tree_to_shwi (byte_position (field
));
3052 /* Return the strictest alignment, in bits, that T is known to have. */
3055 expr_align (const_tree t
)
3057 unsigned int align0
, align1
;
3059 switch (TREE_CODE (t
))
3061 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3062 /* If we have conversions, we know that the alignment of the
3063 object must meet each of the alignments of the types. */
3064 align0
= expr_align (TREE_OPERAND (t
, 0));
3065 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3066 return MAX (align0
, align1
);
3068 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3069 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3070 case CLEANUP_POINT_EXPR
:
3071 /* These don't change the alignment of an object. */
3072 return expr_align (TREE_OPERAND (t
, 0));
3075 /* The best we can do is say that the alignment is the least aligned
3077 align0
= expr_align (TREE_OPERAND (t
, 1));
3078 align1
= expr_align (TREE_OPERAND (t
, 2));
3079 return MIN (align0
, align1
);
3081 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3082 meaningfully, it's always 1. */
3083 case LABEL_DECL
: case CONST_DECL
:
3084 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3086 gcc_assert (DECL_ALIGN (t
) != 0);
3087 return DECL_ALIGN (t
);
3093 /* Otherwise take the alignment from that of the type. */
3094 return TYPE_ALIGN (TREE_TYPE (t
));
3097 /* Return, as a tree node, the number of elements for TYPE (which is an
3098 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3101 array_type_nelts (const_tree type
)
3103 tree index_type
, min
, max
;
3105 /* If they did it with unspecified bounds, then we should have already
3106 given an error about it before we got here. */
3107 if (! TYPE_DOMAIN (type
))
3108 return error_mark_node
;
3110 index_type
= TYPE_DOMAIN (type
);
3111 min
= TYPE_MIN_VALUE (index_type
);
3112 max
= TYPE_MAX_VALUE (index_type
);
3114 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3116 return error_mark_node
;
3118 return (integer_zerop (min
)
3120 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3123 /* If arg is static -- a reference to an object in static storage -- then
3124 return the object. This is not the same as the C meaning of `static'.
3125 If arg isn't static, return NULL. */
3130 switch (TREE_CODE (arg
))
3133 /* Nested functions are static, even though taking their address will
3134 involve a trampoline as we unnest the nested function and create
3135 the trampoline on the tree level. */
3139 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3140 && ! DECL_THREAD_LOCAL_P (arg
)
3141 && ! DECL_DLLIMPORT_P (arg
)
3145 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3149 return TREE_STATIC (arg
) ? arg
: NULL
;
3156 /* If the thing being referenced is not a field, then it is
3157 something language specific. */
3158 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3160 /* If we are referencing a bitfield, we can't evaluate an
3161 ADDR_EXPR at compile time and so it isn't a constant. */
3162 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3165 return staticp (TREE_OPERAND (arg
, 0));
3171 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3174 case ARRAY_RANGE_REF
:
3175 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3176 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3177 return staticp (TREE_OPERAND (arg
, 0));
3181 case COMPOUND_LITERAL_EXPR
:
3182 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3192 /* Return whether OP is a DECL whose address is function-invariant. */
3195 decl_address_invariant_p (const_tree op
)
3197 /* The conditions below are slightly less strict than the one in
3200 switch (TREE_CODE (op
))
3209 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3210 || DECL_THREAD_LOCAL_P (op
)
3211 || DECL_CONTEXT (op
) == current_function_decl
3212 || decl_function_context (op
) == current_function_decl
)
3217 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3218 || decl_function_context (op
) == current_function_decl
)
3229 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3232 decl_address_ip_invariant_p (const_tree op
)
3234 /* The conditions below are slightly less strict than the one in
3237 switch (TREE_CODE (op
))
3245 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3246 && !DECL_DLLIMPORT_P (op
))
3247 || DECL_THREAD_LOCAL_P (op
))
3252 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3264 /* Return true if T is function-invariant (internal function, does
3265 not handle arithmetic; that's handled in skip_simple_arithmetic and
3266 tree_invariant_p). */
3269 tree_invariant_p_1 (tree t
)
3273 if (TREE_CONSTANT (t
)
3274 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3277 switch (TREE_CODE (t
))
3283 op
= TREE_OPERAND (t
, 0);
3284 while (handled_component_p (op
))
3286 switch (TREE_CODE (op
))
3289 case ARRAY_RANGE_REF
:
3290 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3291 || TREE_OPERAND (op
, 2) != NULL_TREE
3292 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3297 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3303 op
= TREE_OPERAND (op
, 0);
3306 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3315 /* Return true if T is function-invariant. */
3318 tree_invariant_p (tree t
)
3320 tree inner
= skip_simple_arithmetic (t
);
3321 return tree_invariant_p_1 (inner
);
3324 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3325 Do this to any expression which may be used in more than one place,
3326 but must be evaluated only once.
3328 Normally, expand_expr would reevaluate the expression each time.
3329 Calling save_expr produces something that is evaluated and recorded
3330 the first time expand_expr is called on it. Subsequent calls to
3331 expand_expr just reuse the recorded value.
3333 The call to expand_expr that generates code that actually computes
3334 the value is the first call *at compile time*. Subsequent calls
3335 *at compile time* generate code to use the saved value.
3336 This produces correct result provided that *at run time* control
3337 always flows through the insns made by the first expand_expr
3338 before reaching the other places where the save_expr was evaluated.
3339 You, the caller of save_expr, must make sure this is so.
3341 Constants, and certain read-only nodes, are returned with no
3342 SAVE_EXPR because that is safe. Expressions containing placeholders
3343 are not touched; see tree.def for an explanation of what these
3347 save_expr (tree expr
)
3351 /* If the tree evaluates to a constant, then we don't want to hide that
3352 fact (i.e. this allows further folding, and direct checks for constants).
3353 However, a read-only object that has side effects cannot be bypassed.
3354 Since it is no problem to reevaluate literals, we just return the
3356 inner
= skip_simple_arithmetic (expr
);
3357 if (TREE_CODE (inner
) == ERROR_MARK
)
3360 if (tree_invariant_p_1 (inner
))
3363 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3364 it means that the size or offset of some field of an object depends on
3365 the value within another field.
3367 Note that it must not be the case that EXPR contains both a PLACEHOLDER_EXPR
3368 and some variable since it would then need to be both evaluated once and
3369 evaluated more than once. Front-ends must assure this case cannot
3370 happen by surrounding any such subexpressions in their own SAVE_EXPR
3371 and forcing evaluation at the proper time. */
3372 if (contains_placeholder_p (inner
))
3375 expr
= build1_loc (EXPR_LOCATION (expr
), SAVE_EXPR
, TREE_TYPE (expr
), expr
);
3377 /* This expression might be placed ahead of a jump to ensure that the
3378 value was computed on both sides of the jump. So make sure it isn't
3379 eliminated as dead. */
3380 TREE_SIDE_EFFECTS (expr
) = 1;
3384 /* Look inside EXPR into any simple arithmetic operations. Return the
3385 outermost non-arithmetic or non-invariant node. */
3388 skip_simple_arithmetic (tree expr
)
3390 /* We don't care about whether this can be used as an lvalue in this
3392 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3393 expr
= TREE_OPERAND (expr
, 0);
3395 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3396 a constant, it will be more efficient to not make another SAVE_EXPR since
3397 it will allow better simplification and GCSE will be able to merge the
3398 computations if they actually occur. */
3401 if (UNARY_CLASS_P (expr
))
3402 expr
= TREE_OPERAND (expr
, 0);
3403 else if (BINARY_CLASS_P (expr
))
3405 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3406 expr
= TREE_OPERAND (expr
, 0);
3407 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3408 expr
= TREE_OPERAND (expr
, 1);
3419 /* Look inside EXPR into simple arithmetic operations involving constants.
3420 Return the outermost non-arithmetic or non-constant node. */
3423 skip_simple_constant_arithmetic (tree expr
)
3425 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3426 expr
= TREE_OPERAND (expr
, 0);
3430 if (UNARY_CLASS_P (expr
))
3431 expr
= TREE_OPERAND (expr
, 0);
3432 else if (BINARY_CLASS_P (expr
))
3434 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3435 expr
= TREE_OPERAND (expr
, 0);
3436 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3437 expr
= TREE_OPERAND (expr
, 1);
3448 /* Return which tree structure is used by T. */
3450 enum tree_node_structure_enum
3451 tree_node_structure (const_tree t
)
3453 const enum tree_code code
= TREE_CODE (t
);
3454 return tree_node_structure_for_code (code
);
3457 /* Set various status flags when building a CALL_EXPR object T. */
3460 process_call_operands (tree t
)
3462 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3463 bool read_only
= false;
3464 int i
= call_expr_flags (t
);
3466 /* Calls have side-effects, except those to const or pure functions. */
3467 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3468 side_effects
= true;
3469 /* Propagate TREE_READONLY of arguments for const functions. */
3473 if (!side_effects
|| read_only
)
3474 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3476 tree op
= TREE_OPERAND (t
, i
);
3477 if (op
&& TREE_SIDE_EFFECTS (op
))
3478 side_effects
= true;
3479 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3483 TREE_SIDE_EFFECTS (t
) = side_effects
;
3484 TREE_READONLY (t
) = read_only
;
3487 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3488 size or offset that depends on a field within a record. */
3491 contains_placeholder_p (const_tree exp
)
3493 enum tree_code code
;
3498 code
= TREE_CODE (exp
);
3499 if (code
== PLACEHOLDER_EXPR
)
3502 switch (TREE_CODE_CLASS (code
))
3505 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3506 position computations since they will be converted into a
3507 WITH_RECORD_EXPR involving the reference, which will assume
3508 here will be valid. */
3509 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3511 case tcc_exceptional
:
3512 if (code
== TREE_LIST
)
3513 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3514 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3519 case tcc_comparison
:
3520 case tcc_expression
:
3524 /* Ignoring the first operand isn't quite right, but works best. */
3525 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3528 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3529 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3530 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3533 /* The save_expr function never wraps anything containing
3534 a PLACEHOLDER_EXPR. */
3541 switch (TREE_CODE_LENGTH (code
))
3544 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3546 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3547 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3558 const_call_expr_arg_iterator iter
;
3559 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3560 if (CONTAINS_PLACEHOLDER_P (arg
))
3574 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3575 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3579 type_contains_placeholder_1 (const_tree type
)
3581 /* If the size contains a placeholder or the parent type (component type in
3582 the case of arrays) type involves a placeholder, this type does. */
3583 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3584 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3585 || (!POINTER_TYPE_P (type
)
3587 && type_contains_placeholder_p (TREE_TYPE (type
))))
3590 /* Now do type-specific checks. Note that the last part of the check above
3591 greatly limits what we have to do below. */
3592 switch (TREE_CODE (type
))
3595 case POINTER_BOUNDS_TYPE
:
3601 case REFERENCE_TYPE
:
3610 case FIXED_POINT_TYPE
:
3611 /* Here we just check the bounds. */
3612 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3613 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3616 /* We have already checked the component type above, so just check
3617 the domain type. Flexible array members have a null domain. */
3618 return TYPE_DOMAIN (type
) ?
3619 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3623 case QUAL_UNION_TYPE
:
3627 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3628 if (TREE_CODE (field
) == FIELD_DECL
3629 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3630 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3631 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3632 || type_contains_placeholder_p (TREE_TYPE (field
))))
3643 /* Wrapper around above function used to cache its result. */
3646 type_contains_placeholder_p (tree type
)
3650 /* If the contains_placeholder_bits field has been initialized,
3651 then we know the answer. */
3652 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3653 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3655 /* Indicate that we've seen this type node, and the answer is false.
3656 This is what we want to return if we run into recursion via fields. */
3657 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3659 /* Compute the real value. */
3660 result
= type_contains_placeholder_1 (type
);
3662 /* Store the real value. */
3663 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3668 /* Push tree EXP onto vector QUEUE if it is not already present. */
3671 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3676 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3677 if (simple_cst_equal (iter
, exp
) == 1)
3681 queue
->safe_push (exp
);
3684 /* Given a tree EXP, find all occurrences of references to fields
3685 in a PLACEHOLDER_EXPR and place them in vector REFS without
3686 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3687 we assume here that EXP contains only arithmetic expressions
3688 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3692 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3694 enum tree_code code
= TREE_CODE (exp
);
3698 /* We handle TREE_LIST and COMPONENT_REF separately. */
3699 if (code
== TREE_LIST
)
3701 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3702 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3704 else if (code
== COMPONENT_REF
)
3706 for (inner
= TREE_OPERAND (exp
, 0);
3707 REFERENCE_CLASS_P (inner
);
3708 inner
= TREE_OPERAND (inner
, 0))
3711 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3712 push_without_duplicates (exp
, refs
);
3714 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3717 switch (TREE_CODE_CLASS (code
))
3722 case tcc_declaration
:
3723 /* Variables allocated to static storage can stay. */
3724 if (!TREE_STATIC (exp
))
3725 push_without_duplicates (exp
, refs
);
3728 case tcc_expression
:
3729 /* This is the pattern built in ada/make_aligning_type. */
3730 if (code
== ADDR_EXPR
3731 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3733 push_without_duplicates (exp
, refs
);
3739 case tcc_exceptional
:
3742 case tcc_comparison
:
3744 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3745 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3749 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3750 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3758 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3759 return a tree with all occurrences of references to F in a
3760 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3761 CONST_DECLs. Note that we assume here that EXP contains only
3762 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3763 occurring only in their argument list. */
3766 substitute_in_expr (tree exp
, tree f
, tree r
)
3768 enum tree_code code
= TREE_CODE (exp
);
3769 tree op0
, op1
, op2
, op3
;
3772 /* We handle TREE_LIST and COMPONENT_REF separately. */
3773 if (code
== TREE_LIST
)
3775 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3776 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3777 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3780 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3782 else if (code
== COMPONENT_REF
)
3786 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3787 and it is the right field, replace it with R. */
3788 for (inner
= TREE_OPERAND (exp
, 0);
3789 REFERENCE_CLASS_P (inner
);
3790 inner
= TREE_OPERAND (inner
, 0))
3794 op1
= TREE_OPERAND (exp
, 1);
3796 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3799 /* If this expression hasn't been completed let, leave it alone. */
3800 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3803 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3804 if (op0
== TREE_OPERAND (exp
, 0))
3808 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3811 switch (TREE_CODE_CLASS (code
))
3816 case tcc_declaration
:
3822 case tcc_expression
:
3828 case tcc_exceptional
:
3831 case tcc_comparison
:
3833 switch (TREE_CODE_LENGTH (code
))
3839 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3840 if (op0
== TREE_OPERAND (exp
, 0))
3843 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3847 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3848 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3850 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3853 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3857 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3858 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3859 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3861 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3862 && op2
== TREE_OPERAND (exp
, 2))
3865 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3869 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3870 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3871 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3872 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3874 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3875 && op2
== TREE_OPERAND (exp
, 2)
3876 && op3
== TREE_OPERAND (exp
, 3))
3880 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3892 new_tree
= NULL_TREE
;
3894 /* If we are trying to replace F with a constant or with another
3895 instance of one of the arguments of the call, inline back
3896 functions which do nothing else than computing a value from
3897 the arguments they are passed. This makes it possible to
3898 fold partially or entirely the replacement expression. */
3899 if (code
== CALL_EXPR
)
3901 bool maybe_inline
= false;
3902 if (CONSTANT_CLASS_P (r
))
3903 maybe_inline
= true;
3905 for (i
= 3; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3906 if (operand_equal_p (TREE_OPERAND (exp
, i
), r
, 0))
3908 maybe_inline
= true;
3913 tree t
= maybe_inline_call_in_expr (exp
);
3915 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3919 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3921 tree op
= TREE_OPERAND (exp
, i
);
3922 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3926 new_tree
= copy_node (exp
);
3927 TREE_OPERAND (new_tree
, i
) = new_op
;
3933 new_tree
= fold (new_tree
);
3934 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3935 process_call_operands (new_tree
);
3946 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3948 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3949 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3954 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3955 for it within OBJ, a tree that is an object or a chain of references. */
3958 substitute_placeholder_in_expr (tree exp
, tree obj
)
3960 enum tree_code code
= TREE_CODE (exp
);
3961 tree op0
, op1
, op2
, op3
;
3964 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3965 in the chain of OBJ. */
3966 if (code
== PLACEHOLDER_EXPR
)
3968 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3971 for (elt
= obj
; elt
!= 0;
3972 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3973 || TREE_CODE (elt
) == COND_EXPR
)
3974 ? TREE_OPERAND (elt
, 1)
3975 : (REFERENCE_CLASS_P (elt
)
3976 || UNARY_CLASS_P (elt
)
3977 || BINARY_CLASS_P (elt
)
3978 || VL_EXP_CLASS_P (elt
)
3979 || EXPRESSION_CLASS_P (elt
))
3980 ? TREE_OPERAND (elt
, 0) : 0))
3981 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3984 for (elt
= obj
; elt
!= 0;
3985 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3986 || TREE_CODE (elt
) == COND_EXPR
)
3987 ? TREE_OPERAND (elt
, 1)
3988 : (REFERENCE_CLASS_P (elt
)
3989 || UNARY_CLASS_P (elt
)
3990 || BINARY_CLASS_P (elt
)
3991 || VL_EXP_CLASS_P (elt
)
3992 || EXPRESSION_CLASS_P (elt
))
3993 ? TREE_OPERAND (elt
, 0) : 0))
3994 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3995 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3997 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3999 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
4000 survives until RTL generation, there will be an error. */
4004 /* TREE_LIST is special because we need to look at TREE_VALUE
4005 and TREE_CHAIN, not TREE_OPERANDS. */
4006 else if (code
== TREE_LIST
)
4008 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
4009 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
4010 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
4013 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
4016 switch (TREE_CODE_CLASS (code
))
4019 case tcc_declaration
:
4022 case tcc_exceptional
:
4025 case tcc_comparison
:
4026 case tcc_expression
:
4029 switch (TREE_CODE_LENGTH (code
))
4035 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4036 if (op0
== TREE_OPERAND (exp
, 0))
4039 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4043 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4044 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4046 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4049 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4053 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4054 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4055 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4057 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4058 && op2
== TREE_OPERAND (exp
, 2))
4061 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4065 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4066 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4067 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4068 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4070 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4071 && op2
== TREE_OPERAND (exp
, 2)
4072 && op3
== TREE_OPERAND (exp
, 3))
4076 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4088 new_tree
= NULL_TREE
;
4090 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4092 tree op
= TREE_OPERAND (exp
, i
);
4093 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4097 new_tree
= copy_node (exp
);
4098 TREE_OPERAND (new_tree
, i
) = new_op
;
4104 new_tree
= fold (new_tree
);
4105 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4106 process_call_operands (new_tree
);
4117 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4119 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4120 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4126 /* Subroutine of stabilize_reference; this is called for subtrees of
4127 references. Any expression with side-effects must be put in a SAVE_EXPR
4128 to ensure that it is only evaluated once.
4130 We don't put SAVE_EXPR nodes around everything, because assigning very
4131 simple expressions to temporaries causes us to miss good opportunities
4132 for optimizations. Among other things, the opportunity to fold in the
4133 addition of a constant into an addressing mode often gets lost, e.g.
4134 "y[i+1] += x;". In general, we take the approach that we should not make
4135 an assignment unless we are forced into it - i.e., that any non-side effect
4136 operator should be allowed, and that cse should take care of coalescing
4137 multiple utterances of the same expression should that prove fruitful. */
4140 stabilize_reference_1 (tree e
)
4143 enum tree_code code
= TREE_CODE (e
);
4145 /* We cannot ignore const expressions because it might be a reference
4146 to a const array but whose index contains side-effects. But we can
4147 ignore things that are actual constant or that already have been
4148 handled by this function. */
4150 if (tree_invariant_p (e
))
4153 switch (TREE_CODE_CLASS (code
))
4155 case tcc_exceptional
:
4157 case tcc_declaration
:
4158 case tcc_comparison
:
4160 case tcc_expression
:
4163 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4164 so that it will only be evaluated once. */
4165 /* The reference (r) and comparison (<) classes could be handled as
4166 below, but it is generally faster to only evaluate them once. */
4167 if (TREE_SIDE_EFFECTS (e
))
4168 return save_expr (e
);
4172 /* Constants need no processing. In fact, we should never reach
4177 /* Division is slow and tends to be compiled with jumps,
4178 especially the division by powers of 2 that is often
4179 found inside of an array reference. So do it just once. */
4180 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4181 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4182 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4183 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4184 return save_expr (e
);
4185 /* Recursively stabilize each operand. */
4186 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4187 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4191 /* Recursively stabilize each operand. */
4192 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4199 TREE_TYPE (result
) = TREE_TYPE (e
);
4200 TREE_READONLY (result
) = TREE_READONLY (e
);
4201 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4202 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4207 /* Stabilize a reference so that we can use it any number of times
4208 without causing its operands to be evaluated more than once.
4209 Returns the stabilized reference. This works by means of save_expr,
4210 so see the caveats in the comments about save_expr.
4212 Also allows conversion expressions whose operands are references.
4213 Any other kind of expression is returned unchanged. */
4216 stabilize_reference (tree ref
)
4219 enum tree_code code
= TREE_CODE (ref
);
4226 /* No action is needed in this case. */
4231 case FIX_TRUNC_EXPR
:
4232 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4236 result
= build_nt (INDIRECT_REF
,
4237 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4241 result
= build_nt (COMPONENT_REF
,
4242 stabilize_reference (TREE_OPERAND (ref
, 0)),
4243 TREE_OPERAND (ref
, 1), NULL_TREE
);
4247 result
= build_nt (BIT_FIELD_REF
,
4248 stabilize_reference (TREE_OPERAND (ref
, 0)),
4249 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4250 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4254 result
= build_nt (ARRAY_REF
,
4255 stabilize_reference (TREE_OPERAND (ref
, 0)),
4256 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4257 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4260 case ARRAY_RANGE_REF
:
4261 result
= build_nt (ARRAY_RANGE_REF
,
4262 stabilize_reference (TREE_OPERAND (ref
, 0)),
4263 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4264 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4268 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4269 it wouldn't be ignored. This matters when dealing with
4271 return stabilize_reference_1 (ref
);
4273 /* If arg isn't a kind of lvalue we recognize, make no change.
4274 Caller should recognize the error for an invalid lvalue. */
4279 return error_mark_node
;
4282 TREE_TYPE (result
) = TREE_TYPE (ref
);
4283 TREE_READONLY (result
) = TREE_READONLY (ref
);
4284 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4285 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4290 /* Low-level constructors for expressions. */
4292 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4293 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4296 recompute_tree_invariant_for_addr_expr (tree t
)
4299 bool tc
= true, se
= false;
4301 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4303 /* We started out assuming this address is both invariant and constant, but
4304 does not have side effects. Now go down any handled components and see if
4305 any of them involve offsets that are either non-constant or non-invariant.
4306 Also check for side-effects.
4308 ??? Note that this code makes no attempt to deal with the case where
4309 taking the address of something causes a copy due to misalignment. */
4311 #define UPDATE_FLAGS(NODE) \
4312 do { tree _node = (NODE); \
4313 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4314 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4316 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4317 node
= TREE_OPERAND (node
, 0))
4319 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4320 array reference (probably made temporarily by the G++ front end),
4321 so ignore all the operands. */
4322 if ((TREE_CODE (node
) == ARRAY_REF
4323 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4324 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4326 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4327 if (TREE_OPERAND (node
, 2))
4328 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4329 if (TREE_OPERAND (node
, 3))
4330 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4332 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4333 FIELD_DECL, apparently. The G++ front end can put something else
4334 there, at least temporarily. */
4335 else if (TREE_CODE (node
) == COMPONENT_REF
4336 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4338 if (TREE_OPERAND (node
, 2))
4339 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4343 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4345 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4346 the address, since &(*a)->b is a form of addition. If it's a constant, the
4347 address is constant too. If it's a decl, its address is constant if the
4348 decl is static. Everything else is not constant and, furthermore,
4349 taking the address of a volatile variable is not volatile. */
4350 if (TREE_CODE (node
) == INDIRECT_REF
4351 || TREE_CODE (node
) == MEM_REF
)
4352 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4353 else if (CONSTANT_CLASS_P (node
))
4355 else if (DECL_P (node
))
4356 tc
&= (staticp (node
) != NULL_TREE
);
4360 se
|= TREE_SIDE_EFFECTS (node
);
4364 TREE_CONSTANT (t
) = tc
;
4365 TREE_SIDE_EFFECTS (t
) = se
;
4369 /* Build an expression of code CODE, data type TYPE, and operands as
4370 specified. Expressions and reference nodes can be created this way.
4371 Constants, decls, types and misc nodes cannot be.
4373 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4374 enough for all extant tree codes. */
4377 build0 (enum tree_code code
, tree tt MEM_STAT_DECL
)
4381 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4383 t
= make_node (code PASS_MEM_STAT
);
4390 build1 (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4392 int length
= sizeof (struct tree_exp
);
4395 record_node_allocation_statistics (code
, length
);
4397 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4399 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4401 memset (t
, 0, sizeof (struct tree_common
));
4403 TREE_SET_CODE (t
, code
);
4405 TREE_TYPE (t
) = type
;
4406 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4407 TREE_OPERAND (t
, 0) = node
;
4408 if (node
&& !TYPE_P (node
))
4410 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4411 TREE_READONLY (t
) = TREE_READONLY (node
);
4414 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4415 TREE_SIDE_EFFECTS (t
) = 1;
4419 /* All of these have side-effects, no matter what their
4421 TREE_SIDE_EFFECTS (t
) = 1;
4422 TREE_READONLY (t
) = 0;
4426 /* Whether a dereference is readonly has nothing to do with whether
4427 its operand is readonly. */
4428 TREE_READONLY (t
) = 0;
4433 recompute_tree_invariant_for_addr_expr (t
);
4437 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4438 && node
&& !TYPE_P (node
)
4439 && TREE_CONSTANT (node
))
4440 TREE_CONSTANT (t
) = 1;
4441 if (TREE_CODE_CLASS (code
) == tcc_reference
4442 && node
&& TREE_THIS_VOLATILE (node
))
4443 TREE_THIS_VOLATILE (t
) = 1;
4450 #define PROCESS_ARG(N) \
4452 TREE_OPERAND (t, N) = arg##N; \
4453 if (arg##N &&!TYPE_P (arg##N)) \
4455 if (TREE_SIDE_EFFECTS (arg##N)) \
4457 if (!TREE_READONLY (arg##N) \
4458 && !CONSTANT_CLASS_P (arg##N)) \
4459 (void) (read_only = 0); \
4460 if (!TREE_CONSTANT (arg##N)) \
4461 (void) (constant = 0); \
4466 build2 (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4468 bool constant
, read_only
, side_effects
, div_by_zero
;
4471 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4473 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4474 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4475 /* When sizetype precision doesn't match that of pointers
4476 we need to be able to build explicit extensions or truncations
4477 of the offset argument. */
4478 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4479 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4480 && TREE_CODE (arg1
) == INTEGER_CST
);
4482 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4483 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4484 && ptrofftype_p (TREE_TYPE (arg1
)));
4486 t
= make_node (code PASS_MEM_STAT
);
4489 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4490 result based on those same flags for the arguments. But if the
4491 arguments aren't really even `tree' expressions, we shouldn't be trying
4494 /* Expressions without side effects may be constant if their
4495 arguments are as well. */
4496 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4497 || TREE_CODE_CLASS (code
) == tcc_binary
);
4499 side_effects
= TREE_SIDE_EFFECTS (t
);
4503 case TRUNC_DIV_EXPR
:
4505 case FLOOR_DIV_EXPR
:
4506 case ROUND_DIV_EXPR
:
4507 case EXACT_DIV_EXPR
:
4509 case FLOOR_MOD_EXPR
:
4510 case ROUND_MOD_EXPR
:
4511 case TRUNC_MOD_EXPR
:
4512 div_by_zero
= integer_zerop (arg1
);
4515 div_by_zero
= false;
4521 TREE_SIDE_EFFECTS (t
) = side_effects
;
4522 if (code
== MEM_REF
)
4524 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4526 tree o
= TREE_OPERAND (arg0
, 0);
4527 TREE_READONLY (t
) = TREE_READONLY (o
);
4528 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4533 TREE_READONLY (t
) = read_only
;
4534 /* Don't mark X / 0 as constant. */
4535 TREE_CONSTANT (t
) = constant
&& !div_by_zero
;
4536 TREE_THIS_VOLATILE (t
)
4537 = (TREE_CODE_CLASS (code
) == tcc_reference
4538 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4546 build3 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4547 tree arg2 MEM_STAT_DECL
)
4549 bool constant
, read_only
, side_effects
;
4552 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4553 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4555 t
= make_node (code PASS_MEM_STAT
);
4560 /* As a special exception, if COND_EXPR has NULL branches, we
4561 assume that it is a gimple statement and always consider
4562 it to have side effects. */
4563 if (code
== COND_EXPR
4564 && tt
== void_type_node
4565 && arg1
== NULL_TREE
4566 && arg2
== NULL_TREE
)
4567 side_effects
= true;
4569 side_effects
= TREE_SIDE_EFFECTS (t
);
4575 if (code
== COND_EXPR
)
4576 TREE_READONLY (t
) = read_only
;
4578 TREE_SIDE_EFFECTS (t
) = side_effects
;
4579 TREE_THIS_VOLATILE (t
)
4580 = (TREE_CODE_CLASS (code
) == tcc_reference
4581 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4587 build4 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4588 tree arg2
, tree arg3 MEM_STAT_DECL
)
4590 bool constant
, read_only
, side_effects
;
4593 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4595 t
= make_node (code PASS_MEM_STAT
);
4598 side_effects
= TREE_SIDE_EFFECTS (t
);
4605 TREE_SIDE_EFFECTS (t
) = side_effects
;
4606 TREE_THIS_VOLATILE (t
)
4607 = (TREE_CODE_CLASS (code
) == tcc_reference
4608 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4614 build5 (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4615 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4617 bool constant
, read_only
, side_effects
;
4620 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4622 t
= make_node (code PASS_MEM_STAT
);
4625 side_effects
= TREE_SIDE_EFFECTS (t
);
4633 TREE_SIDE_EFFECTS (t
) = side_effects
;
4634 if (code
== TARGET_MEM_REF
)
4636 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4638 tree o
= TREE_OPERAND (arg0
, 0);
4639 TREE_READONLY (t
) = TREE_READONLY (o
);
4640 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4644 TREE_THIS_VOLATILE (t
)
4645 = (TREE_CODE_CLASS (code
) == tcc_reference
4646 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4651 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4652 on the pointer PTR. */
4655 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4657 HOST_WIDE_INT offset
= 0;
4658 tree ptype
= TREE_TYPE (ptr
);
4660 /* For convenience allow addresses that collapse to a simple base
4662 if (TREE_CODE (ptr
) == ADDR_EXPR
4663 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4664 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4666 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4668 ptr
= build_fold_addr_expr (ptr
);
4669 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4671 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4672 ptr
, build_int_cst (ptype
, offset
));
4673 SET_EXPR_LOCATION (tem
, loc
);
4677 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4680 mem_ref_offset (const_tree t
)
4682 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4685 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4686 offsetted by OFFSET units. */
4689 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4691 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4692 build_fold_addr_expr (base
),
4693 build_int_cst (ptr_type_node
, offset
));
4694 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4695 recompute_tree_invariant_for_addr_expr (addr
);
4699 /* Similar except don't specify the TREE_TYPE
4700 and leave the TREE_SIDE_EFFECTS as 0.
4701 It is permissible for arguments to be null,
4702 or even garbage if their values do not matter. */
4705 build_nt (enum tree_code code
, ...)
4712 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4716 t
= make_node (code
);
4717 length
= TREE_CODE_LENGTH (code
);
4719 for (i
= 0; i
< length
; i
++)
4720 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4726 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4730 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4735 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4736 CALL_EXPR_FN (ret
) = fn
;
4737 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4738 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4739 CALL_EXPR_ARG (ret
, ix
) = t
;
4743 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4744 We do NOT enter this node in any sort of symbol table.
4746 LOC is the location of the decl.
4748 layout_decl is used to set up the decl's storage layout.
4749 Other slots are initialized to 0 or null pointers. */
4752 build_decl (location_t loc
, enum tree_code code
, tree name
,
4753 tree type MEM_STAT_DECL
)
4757 t
= make_node (code PASS_MEM_STAT
);
4758 DECL_SOURCE_LOCATION (t
) = loc
;
4760 /* if (type == error_mark_node)
4761 type = integer_type_node; */
4762 /* That is not done, deliberately, so that having error_mark_node
4763 as the type can suppress useless errors in the use of this variable. */
4765 DECL_NAME (t
) = name
;
4766 TREE_TYPE (t
) = type
;
4768 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4774 /* Builds and returns function declaration with NAME and TYPE. */
4777 build_fn_decl (const char *name
, tree type
)
4779 tree id
= get_identifier (name
);
4780 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4782 DECL_EXTERNAL (decl
) = 1;
4783 TREE_PUBLIC (decl
) = 1;
4784 DECL_ARTIFICIAL (decl
) = 1;
4785 TREE_NOTHROW (decl
) = 1;
4790 vec
<tree
, va_gc
> *all_translation_units
;
4792 /* Builds a new translation-unit decl with name NAME, queues it in the
4793 global list of translation-unit decls and returns it. */
4796 build_translation_unit_decl (tree name
)
4798 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4800 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4801 vec_safe_push (all_translation_units
, tu
);
4806 /* BLOCK nodes are used to represent the structure of binding contours
4807 and declarations, once those contours have been exited and their contents
4808 compiled. This information is used for outputting debugging info. */
4811 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4813 tree block
= make_node (BLOCK
);
4815 BLOCK_VARS (block
) = vars
;
4816 BLOCK_SUBBLOCKS (block
) = subblocks
;
4817 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4818 BLOCK_CHAIN (block
) = chain
;
4823 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4825 LOC is the location to use in tree T. */
4828 protected_set_expr_location (tree t
, location_t loc
)
4830 if (CAN_HAVE_LOCATION_P (t
))
4831 SET_EXPR_LOCATION (t
, loc
);
4834 /* Reset the expression *EXPR_P, a size or position.
4836 ??? We could reset all non-constant sizes or positions. But it's cheap
4837 enough to not do so and refrain from adding workarounds to dwarf2out.c.
4839 We need to reset self-referential sizes or positions because they cannot
4840 be gimplified and thus can contain a CALL_EXPR after the gimplification
4841 is finished, which will run afoul of LTO streaming. And they need to be
4842 reset to something essentially dummy but not constant, so as to preserve
4843 the properties of the object they are attached to. */
4846 free_lang_data_in_one_sizepos (tree
*expr_p
)
4848 tree expr
= *expr_p
;
4849 if (CONTAINS_PLACEHOLDER_P (expr
))
4850 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
4854 /* Reset all the fields in a binfo node BINFO. We only keep
4855 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
4858 free_lang_data_in_binfo (tree binfo
)
4863 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
4865 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
4866 BINFO_BASE_ACCESSES (binfo
) = NULL
;
4867 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
4868 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
4870 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
4871 free_lang_data_in_binfo (t
);
4875 /* Reset all language specific information still present in TYPE. */
4878 free_lang_data_in_type (tree type
)
4880 gcc_assert (TYPE_P (type
));
4882 /* Give the FE a chance to remove its own data first. */
4883 lang_hooks
.free_lang_data (type
);
4885 TREE_LANG_FLAG_0 (type
) = 0;
4886 TREE_LANG_FLAG_1 (type
) = 0;
4887 TREE_LANG_FLAG_2 (type
) = 0;
4888 TREE_LANG_FLAG_3 (type
) = 0;
4889 TREE_LANG_FLAG_4 (type
) = 0;
4890 TREE_LANG_FLAG_5 (type
) = 0;
4891 TREE_LANG_FLAG_6 (type
) = 0;
4893 if (TREE_CODE (type
) == FUNCTION_TYPE
)
4895 /* Remove the const and volatile qualifiers from arguments. The
4896 C++ front end removes them, but the C front end does not,
4897 leading to false ODR violation errors when merging two
4898 instances of the same function signature compiled by
4899 different front ends. */
4900 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4902 tree arg_type
= TREE_VALUE (p
);
4904 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
4906 int quals
= TYPE_QUALS (arg_type
)
4908 & ~TYPE_QUAL_VOLATILE
;
4909 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
4910 free_lang_data_in_type (TREE_VALUE (p
));
4912 /* C++ FE uses TREE_PURPOSE to store initial values. */
4913 TREE_PURPOSE (p
) = NULL
;
4916 else if (TREE_CODE (type
) == METHOD_TYPE
)
4917 for (tree p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
4918 /* C++ FE uses TREE_PURPOSE to store initial values. */
4919 TREE_PURPOSE (p
) = NULL
;
4920 else if (RECORD_OR_UNION_TYPE_P (type
))
4922 /* Remove members that are not FIELD_DECLs (and maybe
4923 TYPE_DECLs) from the field list of an aggregate. These occur
4925 for (tree
*prev
= &TYPE_FIELDS (type
), member
; (member
= *prev
);)
4926 if (TREE_CODE (member
) == FIELD_DECL
4927 || (TREE_CODE (member
) == TYPE_DECL
4928 && !DECL_IGNORED_P (member
)
4929 && debug_info_level
> DINFO_LEVEL_TERSE
4930 && !is_redundant_typedef (member
)))
4931 prev
= &DECL_CHAIN (member
);
4933 *prev
= DECL_CHAIN (member
);
4935 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
4936 and danagle the pointer from time to time. */
4937 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
4938 TYPE_VFIELD (type
) = NULL_TREE
;
4940 if (TYPE_BINFO (type
))
4942 free_lang_data_in_binfo (TYPE_BINFO (type
));
4943 /* We need to preserve link to bases and virtual table for all
4944 polymorphic types to make devirtualization machinery working.
4945 Debug output cares only about bases, but output also
4946 virtual table pointers so merging of -fdevirtualize and
4947 -fno-devirtualize units is easier. */
4948 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
4949 || !flag_devirtualize
)
4950 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
4951 && !BINFO_VTABLE (TYPE_BINFO (type
)))
4952 || debug_info_level
!= DINFO_LEVEL_NONE
))
4953 TYPE_BINFO (type
) = NULL
;
4956 else if (INTEGRAL_TYPE_P (type
)
4957 || SCALAR_FLOAT_TYPE_P (type
)
4958 || FIXED_POINT_TYPE_P (type
))
4960 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
4961 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
4964 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
4966 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
4967 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
4969 if (TYPE_CONTEXT (type
)
4970 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
4972 tree ctx
= TYPE_CONTEXT (type
);
4975 ctx
= BLOCK_SUPERCONTEXT (ctx
);
4977 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
4978 TYPE_CONTEXT (type
) = ctx
;
4983 /* Return true if DECL may need an assembler name to be set. */
4986 need_assembler_name_p (tree decl
)
4988 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
4989 Rule merging. This makes type_odr_p to return true on those types during
4990 LTO and by comparing the mangled name, we can say what types are intended
4991 to be equivalent across compilation unit.
4993 We do not store names of type_in_anonymous_namespace_p.
4995 Record, union and enumeration type have linkage that allows use
4996 to check type_in_anonymous_namespace_p. We do not mangle compound types
4997 that always can be compared structurally.
4999 Similarly for builtin types, we compare properties of their main variant.
5000 A special case are integer types where mangling do make differences
5001 between char/signed char/unsigned char etc. Storing name for these makes
5002 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5003 See cp/mangle.c:write_builtin_type for details. */
5005 if (flag_lto_odr_type_mering
5006 && TREE_CODE (decl
) == TYPE_DECL
5008 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5009 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5010 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5011 && (type_with_linkage_p (TREE_TYPE (decl
))
5012 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5013 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5014 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5015 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5016 if (!VAR_OR_FUNCTION_DECL_P (decl
))
5019 /* If DECL already has its assembler name set, it does not need a
5021 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5022 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5025 /* Abstract decls do not need an assembler name. */
5026 if (DECL_ABSTRACT_P (decl
))
5029 /* For VAR_DECLs, only static, public and external symbols need an
5032 && !TREE_STATIC (decl
)
5033 && !TREE_PUBLIC (decl
)
5034 && !DECL_EXTERNAL (decl
))
5037 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5039 /* Do not set assembler name on builtins. Allow RTL expansion to
5040 decide whether to expand inline or via a regular call. */
5041 if (DECL_BUILT_IN (decl
)
5042 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5045 /* Functions represented in the callgraph need an assembler name. */
5046 if (cgraph_node::get (decl
) != NULL
)
5049 /* Unused and not public functions don't need an assembler name. */
5050 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5058 /* Reset all language specific information still present in symbol
5062 free_lang_data_in_decl (tree decl
)
5064 gcc_assert (DECL_P (decl
));
5066 /* Give the FE a chance to remove its own data first. */
5067 lang_hooks
.free_lang_data (decl
);
5069 TREE_LANG_FLAG_0 (decl
) = 0;
5070 TREE_LANG_FLAG_1 (decl
) = 0;
5071 TREE_LANG_FLAG_2 (decl
) = 0;
5072 TREE_LANG_FLAG_3 (decl
) = 0;
5073 TREE_LANG_FLAG_4 (decl
) = 0;
5074 TREE_LANG_FLAG_5 (decl
) = 0;
5075 TREE_LANG_FLAG_6 (decl
) = 0;
5077 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5078 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5079 if (TREE_CODE (decl
) == FIELD_DECL
)
5081 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5082 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5083 DECL_QUALIFIER (decl
) = NULL_TREE
;
5086 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5088 struct cgraph_node
*node
;
5089 if (!(node
= cgraph_node::get (decl
))
5090 || (!node
->definition
&& !node
->clones
))
5093 node
->release_body ();
5096 release_function_body (decl
);
5097 DECL_ARGUMENTS (decl
) = NULL
;
5098 DECL_RESULT (decl
) = NULL
;
5099 DECL_INITIAL (decl
) = error_mark_node
;
5102 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5106 /* If DECL has a gimple body, then the context for its
5107 arguments must be DECL. Otherwise, it doesn't really
5108 matter, as we will not be emitting any code for DECL. In
5109 general, there may be other instances of DECL created by
5110 the front end and since PARM_DECLs are generally shared,
5111 their DECL_CONTEXT changes as the replicas of DECL are
5112 created. The only time where DECL_CONTEXT is important
5113 is for the FUNCTION_DECLs that have a gimple body (since
5114 the PARM_DECL will be used in the function's body). */
5115 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5116 DECL_CONTEXT (t
) = decl
;
5117 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5118 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5119 = target_option_default_node
;
5120 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5121 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5122 = optimization_default_node
;
5125 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5126 At this point, it is not needed anymore. */
5127 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5129 /* Clear the abstract origin if it refers to a method.
5130 Otherwise dwarf2out.c will ICE as we splice functions out of
5131 TYPE_FIELDS and thus the origin will not be output
5133 if (DECL_ABSTRACT_ORIGIN (decl
)
5134 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5135 && RECORD_OR_UNION_TYPE_P
5136 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5137 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5139 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5140 DECL_VINDEX referring to itself into a vtable slot number as it
5141 should. Happens with functions that are copied and then forgotten
5142 about. Just clear it, it won't matter anymore. */
5143 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5144 DECL_VINDEX (decl
) = NULL_TREE
;
5146 else if (VAR_P (decl
))
5148 if ((DECL_EXTERNAL (decl
)
5149 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5150 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5151 DECL_INITIAL (decl
) = NULL_TREE
;
5153 else if (TREE_CODE (decl
) == TYPE_DECL
)
5155 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5156 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5157 DECL_INITIAL (decl
) = NULL_TREE
;
5159 else if (TREE_CODE (decl
) == FIELD_DECL
)
5160 DECL_INITIAL (decl
) = NULL_TREE
;
5161 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5162 && DECL_INITIAL (decl
)
5163 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5165 /* Strip builtins from the translation-unit BLOCK. We still have targets
5166 without builtin_decl_explicit support and also builtins are shared
5167 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5168 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5172 if (TREE_CODE (var
) == FUNCTION_DECL
5173 && DECL_BUILT_IN (var
))
5174 *nextp
= TREE_CHAIN (var
);
5176 nextp
= &TREE_CHAIN (var
);
5182 /* Data used when collecting DECLs and TYPEs for language data removal. */
5184 struct free_lang_data_d
5186 free_lang_data_d () : decls (100), types (100) {}
5188 /* Worklist to avoid excessive recursion. */
5189 auto_vec
<tree
> worklist
;
5191 /* Set of traversed objects. Used to avoid duplicate visits. */
5192 hash_set
<tree
> pset
;
5194 /* Array of symbols to process with free_lang_data_in_decl. */
5195 auto_vec
<tree
> decls
;
5197 /* Array of types to process with free_lang_data_in_type. */
5198 auto_vec
<tree
> types
;
5202 /* Save all language fields needed to generate proper debug information
5203 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5206 save_debug_info_for_decl (tree t
)
5208 /*struct saved_debug_info_d *sdi;*/
5210 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5212 /* FIXME. Partial implementation for saving debug info removed. */
5216 /* Save all language fields needed to generate proper debug information
5217 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5220 save_debug_info_for_type (tree t
)
5222 /*struct saved_debug_info_d *sdi;*/
5224 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5226 /* FIXME. Partial implementation for saving debug info removed. */
5230 /* Add type or decl T to one of the list of tree nodes that need their
5231 language data removed. The lists are held inside FLD. */
5234 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5238 fld
->decls
.safe_push (t
);
5239 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5240 save_debug_info_for_decl (t
);
5242 else if (TYPE_P (t
))
5244 fld
->types
.safe_push (t
);
5245 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5246 save_debug_info_for_type (t
);
5252 /* Push tree node T into FLD->WORKLIST. */
5255 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5257 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5258 fld
->worklist
.safe_push ((t
));
5262 /* Operand callback helper for free_lang_data_in_node. *TP is the
5263 subtree operand being considered. */
5266 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5269 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5271 if (TREE_CODE (t
) == TREE_LIST
)
5274 /* Language specific nodes will be removed, so there is no need
5275 to gather anything under them. */
5276 if (is_lang_specific (t
))
5284 /* Note that walk_tree does not traverse every possible field in
5285 decls, so we have to do our own traversals here. */
5286 add_tree_to_fld_list (t
, fld
);
5288 fld_worklist_push (DECL_NAME (t
), fld
);
5289 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5290 fld_worklist_push (DECL_SIZE (t
), fld
);
5291 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5293 /* We are going to remove everything under DECL_INITIAL for
5294 TYPE_DECLs. No point walking them. */
5295 if (TREE_CODE (t
) != TYPE_DECL
)
5296 fld_worklist_push (DECL_INITIAL (t
), fld
);
5298 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5299 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5301 if (TREE_CODE (t
) == FUNCTION_DECL
)
5303 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5304 fld_worklist_push (DECL_RESULT (t
), fld
);
5306 else if (TREE_CODE (t
) == TYPE_DECL
)
5308 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5310 else if (TREE_CODE (t
) == FIELD_DECL
)
5312 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5313 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5314 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5315 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5318 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5319 && DECL_HAS_VALUE_EXPR_P (t
))
5320 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5322 if (TREE_CODE (t
) != FIELD_DECL
5323 && TREE_CODE (t
) != TYPE_DECL
)
5324 fld_worklist_push (TREE_CHAIN (t
), fld
);
5327 else if (TYPE_P (t
))
5329 /* Note that walk_tree does not traverse every possible field in
5330 types, so we have to do our own traversals here. */
5331 add_tree_to_fld_list (t
, fld
);
5333 if (!RECORD_OR_UNION_TYPE_P (t
))
5334 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5335 fld_worklist_push (TYPE_SIZE (t
), fld
);
5336 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5337 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5338 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5339 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5340 fld_worklist_push (TYPE_NAME (t
), fld
);
5341 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5342 them and thus do not and want not to reach unused pointer types
5344 if (!POINTER_TYPE_P (t
))
5345 fld_worklist_push (TYPE_MIN_VALUE_RAW (t
), fld
);
5346 /* TYPE_MAX_VALUE_RAW is TYPE_BINFO for record types. */
5347 if (!RECORD_OR_UNION_TYPE_P (t
))
5348 fld_worklist_push (TYPE_MAX_VALUE_RAW (t
), fld
);
5349 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5350 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5351 do not and want not to reach unused variants this way. */
5352 if (TYPE_CONTEXT (t
))
5354 tree ctx
= TYPE_CONTEXT (t
);
5355 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5356 So push that instead. */
5357 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5358 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5359 fld_worklist_push (ctx
, fld
);
5361 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5362 and want not to reach unused types this way. */
5364 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5368 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5369 fld_worklist_push (TREE_TYPE (tem
), fld
);
5370 fld_worklist_push (BINFO_VIRTUALS (TYPE_BINFO (t
)), fld
);
5372 if (RECORD_OR_UNION_TYPE_P (t
))
5375 /* Push all TYPE_FIELDS - there can be interleaving interesting
5376 and non-interesting things. */
5377 tem
= TYPE_FIELDS (t
);
5380 if (TREE_CODE (tem
) == FIELD_DECL
5381 || (TREE_CODE (tem
) == TYPE_DECL
5382 && !DECL_IGNORED_P (tem
)
5383 && debug_info_level
> DINFO_LEVEL_TERSE
5384 && !is_redundant_typedef (tem
)))
5385 fld_worklist_push (tem
, fld
);
5386 tem
= TREE_CHAIN (tem
);
5390 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5393 else if (TREE_CODE (t
) == BLOCK
)
5396 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5397 fld_worklist_push (tem
, fld
);
5398 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5399 fld_worklist_push (tem
, fld
);
5400 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5403 if (TREE_CODE (t
) != IDENTIFIER_NODE
5404 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5405 fld_worklist_push (TREE_TYPE (t
), fld
);
5411 /* Find decls and types in T. */
5414 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5418 if (!fld
->pset
.contains (t
))
5419 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5420 if (fld
->worklist
.is_empty ())
5422 t
= fld
->worklist
.pop ();
5426 /* Translate all the types in LIST with the corresponding runtime
5430 get_eh_types_for_runtime (tree list
)
5434 if (list
== NULL_TREE
)
5437 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5439 list
= TREE_CHAIN (list
);
5442 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5443 TREE_CHAIN (prev
) = n
;
5444 prev
= TREE_CHAIN (prev
);
5445 list
= TREE_CHAIN (list
);
5452 /* Find decls and types referenced in EH region R and store them in
5453 FLD->DECLS and FLD->TYPES. */
5456 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5467 /* The types referenced in each catch must first be changed to the
5468 EH types used at runtime. This removes references to FE types
5470 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5472 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5473 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5478 case ERT_ALLOWED_EXCEPTIONS
:
5479 r
->u
.allowed
.type_list
5480 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5481 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5484 case ERT_MUST_NOT_THROW
:
5485 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5486 find_decls_types_r
, fld
, &fld
->pset
);
5492 /* Find decls and types referenced in cgraph node N and store them in
5493 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5494 look for *every* kind of DECL and TYPE node reachable from N,
5495 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5496 NAMESPACE_DECLs, etc). */
5499 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5502 struct function
*fn
;
5506 find_decls_types (n
->decl
, fld
);
5508 if (!gimple_has_body_p (n
->decl
))
5511 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5513 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5515 /* Traverse locals. */
5516 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5517 find_decls_types (t
, fld
);
5519 /* Traverse EH regions in FN. */
5522 FOR_ALL_EH_REGION_FN (r
, fn
)
5523 find_decls_types_in_eh_region (r
, fld
);
5526 /* Traverse every statement in FN. */
5527 FOR_EACH_BB_FN (bb
, fn
)
5530 gimple_stmt_iterator si
;
5533 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5535 gphi
*phi
= psi
.phi ();
5537 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5539 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5540 find_decls_types (*arg_p
, fld
);
5544 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5546 gimple
*stmt
= gsi_stmt (si
);
5548 if (is_gimple_call (stmt
))
5549 find_decls_types (gimple_call_fntype (stmt
), fld
);
5551 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5553 tree arg
= gimple_op (stmt
, i
);
5554 find_decls_types (arg
, fld
);
5561 /* Find decls and types referenced in varpool node N and store them in
5562 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5563 look for *every* kind of DECL and TYPE node reachable from N,
5564 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5565 NAMESPACE_DECLs, etc). */
5568 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5570 find_decls_types (v
->decl
, fld
);
5573 /* If T needs an assembler name, have one created for it. */
5576 assign_assembler_name_if_needed (tree t
)
5578 if (need_assembler_name_p (t
))
5580 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5581 diagnostics that use input_location to show locus
5582 information. The problem here is that, at this point,
5583 input_location is generally anchored to the end of the file
5584 (since the parser is long gone), so we don't have a good
5585 position to pin it to.
5587 To alleviate this problem, this uses the location of T's
5588 declaration. Examples of this are
5589 testsuite/g++.dg/template/cond2.C and
5590 testsuite/g++.dg/template/pr35240.C. */
5591 location_t saved_location
= input_location
;
5592 input_location
= DECL_SOURCE_LOCATION (t
);
5594 decl_assembler_name (t
);
5596 input_location
= saved_location
;
5601 /* Free language specific information for every operand and expression
5602 in every node of the call graph. This process operates in three stages:
5604 1- Every callgraph node and varpool node is traversed looking for
5605 decls and types embedded in them. This is a more exhaustive
5606 search than that done by find_referenced_vars, because it will
5607 also collect individual fields, decls embedded in types, etc.
5609 2- All the decls found are sent to free_lang_data_in_decl.
5611 3- All the types found are sent to free_lang_data_in_type.
5613 The ordering between decls and types is important because
5614 free_lang_data_in_decl sets assembler names, which includes
5615 mangling. So types cannot be freed up until assembler names have
5619 free_lang_data_in_cgraph (void)
5621 struct cgraph_node
*n
;
5623 struct free_lang_data_d fld
;
5628 /* Find decls and types in the body of every function in the callgraph. */
5629 FOR_EACH_FUNCTION (n
)
5630 find_decls_types_in_node (n
, &fld
);
5632 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5633 find_decls_types (p
->decl
, &fld
);
5635 /* Find decls and types in every varpool symbol. */
5636 FOR_EACH_VARIABLE (v
)
5637 find_decls_types_in_var (v
, &fld
);
5639 /* Set the assembler name on every decl found. We need to do this
5640 now because free_lang_data_in_decl will invalidate data needed
5641 for mangling. This breaks mangling on interdependent decls. */
5642 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5643 assign_assembler_name_if_needed (t
);
5645 /* Traverse every decl found freeing its language data. */
5646 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5647 free_lang_data_in_decl (t
);
5649 /* Traverse every type found freeing its language data. */
5650 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5651 free_lang_data_in_type (t
);
5654 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5660 /* Free resources that are used by FE but are not needed once they are done. */
5663 free_lang_data (void)
5667 /* If we are the LTO frontend we have freed lang-specific data already. */
5669 || (!flag_generate_lto
&& !flag_generate_offload
))
5672 /* Provide a dummy TRANSLATION_UNIT_DECL if the FE failed to provide one. */
5673 if (vec_safe_is_empty (all_translation_units
))
5674 build_translation_unit_decl (NULL_TREE
);
5676 /* Allocate and assign alias sets to the standard integer types
5677 while the slots are still in the way the frontends generated them. */
5678 for (i
= 0; i
< itk_none
; ++i
)
5679 if (integer_types
[i
])
5680 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
5682 /* Traverse the IL resetting language specific information for
5683 operands, expressions, etc. */
5684 free_lang_data_in_cgraph ();
5686 /* Create gimple variants for common types. */
5687 for (unsigned i
= 0;
5688 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
5690 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
5692 /* Reset some langhooks. Do not reset types_compatible_p, it may
5693 still be used indirectly via the get_alias_set langhook. */
5694 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
5695 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
5696 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
5698 /* We do not want the default decl_assembler_name implementation,
5699 rather if we have fixed everything we want a wrapper around it
5700 asserting that all non-local symbols already got their assembler
5701 name and only produce assembler names for local symbols. Or rather
5702 make sure we never call decl_assembler_name on local symbols and
5703 devise a separate, middle-end private scheme for it. */
5705 /* Reset diagnostic machinery. */
5706 tree_diagnostics_defaults (global_dc
);
5714 const pass_data pass_data_ipa_free_lang_data
=
5716 SIMPLE_IPA_PASS
, /* type */
5717 "*free_lang_data", /* name */
5718 OPTGROUP_NONE
, /* optinfo_flags */
5719 TV_IPA_FREE_LANG_DATA
, /* tv_id */
5720 0, /* properties_required */
5721 0, /* properties_provided */
5722 0, /* properties_destroyed */
5723 0, /* todo_flags_start */
5724 0, /* todo_flags_finish */
5727 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
5730 pass_ipa_free_lang_data (gcc::context
*ctxt
)
5731 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
5734 /* opt_pass methods: */
5735 virtual unsigned int execute (function
*) { return free_lang_data (); }
5737 }; // class pass_ipa_free_lang_data
5741 simple_ipa_opt_pass
*
5742 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
5744 return new pass_ipa_free_lang_data (ctxt
);
5747 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
5748 of the various TYPE_QUAL values. */
5751 set_type_quals (tree type
, int type_quals
)
5753 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
5754 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
5755 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
5756 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
5757 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
5760 /* Returns true iff CAND and BASE have equivalent language-specific
5764 check_lang_type (const_tree cand
, const_tree base
)
5766 if (lang_hooks
.types
.type_hash_eq
== NULL
)
5768 /* type_hash_eq currently only applies to these types. */
5769 if (TREE_CODE (cand
) != FUNCTION_TYPE
5770 && TREE_CODE (cand
) != METHOD_TYPE
)
5772 return lang_hooks
.types
.type_hash_eq (cand
, base
);
5775 /* Returns true iff unqualified CAND and BASE are equivalent. */
5778 check_base_type (const_tree cand
, const_tree base
)
5780 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
5781 /* Apparently this is needed for Objective-C. */
5782 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5783 /* Check alignment. */
5784 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
5785 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5786 TYPE_ATTRIBUTES (base
)));
5789 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
5792 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
5794 return (TYPE_QUALS (cand
) == type_quals
5795 && check_base_type (cand
, base
)
5796 && check_lang_type (cand
, base
));
5799 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
5802 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
5804 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
5805 && TYPE_NAME (cand
) == TYPE_NAME (base
)
5806 /* Apparently this is needed for Objective-C. */
5807 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
5808 /* Check alignment. */
5809 && TYPE_ALIGN (cand
) == align
5810 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
5811 TYPE_ATTRIBUTES (base
))
5812 && check_lang_type (cand
, base
));
5815 /* This function checks to see if TYPE matches the size one of the built-in
5816 atomic types, and returns that core atomic type. */
5819 find_atomic_core_type (tree type
)
5821 tree base_atomic_type
;
5823 /* Only handle complete types. */
5824 if (!tree_fits_uhwi_p (TYPE_SIZE (type
)))
5827 switch (tree_to_uhwi (TYPE_SIZE (type
)))
5830 base_atomic_type
= atomicQI_type_node
;
5834 base_atomic_type
= atomicHI_type_node
;
5838 base_atomic_type
= atomicSI_type_node
;
5842 base_atomic_type
= atomicDI_type_node
;
5846 base_atomic_type
= atomicTI_type_node
;
5850 base_atomic_type
= NULL_TREE
;
5853 return base_atomic_type
;
5856 /* Return a version of the TYPE, qualified as indicated by the
5857 TYPE_QUALS, if one exists. If no qualified version exists yet,
5858 return NULL_TREE. */
5861 get_qualified_type (tree type
, int type_quals
)
5865 if (TYPE_QUALS (type
) == type_quals
)
5868 /* Search the chain of variants to see if there is already one there just
5869 like the one we need to have. If so, use that existing one. We must
5870 preserve the TYPE_NAME, since there is code that depends on this. */
5871 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5872 if (check_qualified_type (t
, type
, type_quals
))
5878 /* Like get_qualified_type, but creates the type if it does not
5879 exist. This function never returns NULL_TREE. */
5882 build_qualified_type (tree type
, int type_quals MEM_STAT_DECL
)
5886 /* See if we already have the appropriate qualified variant. */
5887 t
= get_qualified_type (type
, type_quals
);
5889 /* If not, build it. */
5892 t
= build_variant_type_copy (type PASS_MEM_STAT
);
5893 set_type_quals (t
, type_quals
);
5895 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
5897 /* See if this object can map to a basic atomic type. */
5898 tree atomic_type
= find_atomic_core_type (type
);
5901 /* Ensure the alignment of this type is compatible with
5902 the required alignment of the atomic type. */
5903 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
5904 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
5908 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5909 /* Propagate structural equality. */
5910 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5911 else if (TYPE_CANONICAL (type
) != type
)
5912 /* Build the underlying canonical type, since it is different
5915 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
5916 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
5919 /* T is its own canonical type. */
5920 TYPE_CANONICAL (t
) = t
;
5927 /* Create a variant of type T with alignment ALIGN. */
5930 build_aligned_type (tree type
, unsigned int align
)
5934 if (TYPE_PACKED (type
)
5935 || TYPE_ALIGN (type
) == align
)
5938 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
5939 if (check_aligned_type (t
, type
, align
))
5942 t
= build_variant_type_copy (type
);
5943 SET_TYPE_ALIGN (t
, align
);
5944 TYPE_USER_ALIGN (t
) = 1;
5949 /* Create a new distinct copy of TYPE. The new type is made its own
5950 MAIN_VARIANT. If TYPE requires structural equality checks, the
5951 resulting type requires structural equality checks; otherwise, its
5952 TYPE_CANONICAL points to itself. */
5955 build_distinct_type_copy (tree type MEM_STAT_DECL
)
5957 tree t
= copy_node (type PASS_MEM_STAT
);
5959 TYPE_POINTER_TO (t
) = 0;
5960 TYPE_REFERENCE_TO (t
) = 0;
5962 /* Set the canonical type either to a new equivalence class, or
5963 propagate the need for structural equality checks. */
5964 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
5965 SET_TYPE_STRUCTURAL_EQUALITY (t
);
5967 TYPE_CANONICAL (t
) = t
;
5969 /* Make it its own variant. */
5970 TYPE_MAIN_VARIANT (t
) = t
;
5971 TYPE_NEXT_VARIANT (t
) = 0;
5973 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
5974 whose TREE_TYPE is not t. This can also happen in the Ada
5975 frontend when using subtypes. */
5980 /* Create a new variant of TYPE, equivalent but distinct. This is so
5981 the caller can modify it. TYPE_CANONICAL for the return type will
5982 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
5983 are considered equal by the language itself (or that both types
5984 require structural equality checks). */
5987 build_variant_type_copy (tree type MEM_STAT_DECL
)
5989 tree t
, m
= TYPE_MAIN_VARIANT (type
);
5991 t
= build_distinct_type_copy (type PASS_MEM_STAT
);
5993 /* Since we're building a variant, assume that it is a non-semantic
5994 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
5995 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
5996 /* Type variants have no alias set defined. */
5997 TYPE_ALIAS_SET (t
) = -1;
5999 /* Add the new type to the chain of variants of TYPE. */
6000 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6001 TYPE_NEXT_VARIANT (m
) = t
;
6002 TYPE_MAIN_VARIANT (t
) = m
;
6007 /* Return true if the from tree in both tree maps are equal. */
6010 tree_map_base_eq (const void *va
, const void *vb
)
6012 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6013 *const b
= (const struct tree_map_base
*) vb
;
6014 return (a
->from
== b
->from
);
6017 /* Hash a from tree in a tree_base_map. */
6020 tree_map_base_hash (const void *item
)
6022 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6025 /* Return true if this tree map structure is marked for garbage collection
6026 purposes. We simply return true if the from tree is marked, so that this
6027 structure goes away when the from tree goes away. */
6030 tree_map_base_marked_p (const void *p
)
6032 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6035 /* Hash a from tree in a tree_map. */
6038 tree_map_hash (const void *item
)
6040 return (((const struct tree_map
*) item
)->hash
);
6043 /* Hash a from tree in a tree_decl_map. */
6046 tree_decl_map_hash (const void *item
)
6048 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6051 /* Return the initialization priority for DECL. */
6054 decl_init_priority_lookup (tree decl
)
6056 symtab_node
*snode
= symtab_node::get (decl
);
6059 return DEFAULT_INIT_PRIORITY
;
6061 snode
->get_init_priority ();
6064 /* Return the finalization priority for DECL. */
6067 decl_fini_priority_lookup (tree decl
)
6069 cgraph_node
*node
= cgraph_node::get (decl
);
6072 return DEFAULT_INIT_PRIORITY
;
6074 node
->get_fini_priority ();
6077 /* Set the initialization priority for DECL to PRIORITY. */
6080 decl_init_priority_insert (tree decl
, priority_type priority
)
6082 struct symtab_node
*snode
;
6084 if (priority
== DEFAULT_INIT_PRIORITY
)
6086 snode
= symtab_node::get (decl
);
6090 else if (VAR_P (decl
))
6091 snode
= varpool_node::get_create (decl
);
6093 snode
= cgraph_node::get_create (decl
);
6094 snode
->set_init_priority (priority
);
6097 /* Set the finalization priority for DECL to PRIORITY. */
6100 decl_fini_priority_insert (tree decl
, priority_type priority
)
6102 struct cgraph_node
*node
;
6104 if (priority
== DEFAULT_INIT_PRIORITY
)
6106 node
= cgraph_node::get (decl
);
6111 node
= cgraph_node::get_create (decl
);
6112 node
->set_fini_priority (priority
);
6115 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6118 print_debug_expr_statistics (void)
6120 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6121 (long) debug_expr_for_decl
->size (),
6122 (long) debug_expr_for_decl
->elements (),
6123 debug_expr_for_decl
->collisions ());
6126 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6129 print_value_expr_statistics (void)
6131 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6132 (long) value_expr_for_decl
->size (),
6133 (long) value_expr_for_decl
->elements (),
6134 value_expr_for_decl
->collisions ());
6137 /* Lookup a debug expression for FROM, and return it if we find one. */
6140 decl_debug_expr_lookup (tree from
)
6142 struct tree_decl_map
*h
, in
;
6143 in
.base
.from
= from
;
6145 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6151 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6154 decl_debug_expr_insert (tree from
, tree to
)
6156 struct tree_decl_map
*h
;
6158 h
= ggc_alloc
<tree_decl_map
> ();
6159 h
->base
.from
= from
;
6161 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6164 /* Lookup a value expression for FROM, and return it if we find one. */
6167 decl_value_expr_lookup (tree from
)
6169 struct tree_decl_map
*h
, in
;
6170 in
.base
.from
= from
;
6172 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6178 /* Insert a mapping FROM->TO in the value expression hashtable. */
6181 decl_value_expr_insert (tree from
, tree to
)
6183 struct tree_decl_map
*h
;
6185 h
= ggc_alloc
<tree_decl_map
> ();
6186 h
->base
.from
= from
;
6188 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6191 /* Lookup a vector of debug arguments for FROM, and return it if we
6195 decl_debug_args_lookup (tree from
)
6197 struct tree_vec_map
*h
, in
;
6199 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6201 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6202 in
.base
.from
= from
;
6203 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6209 /* Insert a mapping FROM->empty vector of debug arguments in the value
6210 expression hashtable. */
6213 decl_debug_args_insert (tree from
)
6215 struct tree_vec_map
*h
;
6218 if (DECL_HAS_DEBUG_ARGS_P (from
))
6219 return decl_debug_args_lookup (from
);
6220 if (debug_args_for_decl
== NULL
)
6221 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6222 h
= ggc_alloc
<tree_vec_map
> ();
6223 h
->base
.from
= from
;
6225 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6227 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6231 /* Hashing of types so that we don't make duplicates.
6232 The entry point is `type_hash_canon'. */
6234 /* Generate the default hash code for TYPE. This is designed for
6235 speed, rather than maximum entropy. */
6238 type_hash_canon_hash (tree type
)
6240 inchash::hash hstate
;
6242 hstate
.add_int (TREE_CODE (type
));
6244 if (TREE_TYPE (type
))
6245 hstate
.add_object (TYPE_HASH (TREE_TYPE (type
)));
6247 for (tree t
= TYPE_ATTRIBUTES (type
); t
; t
= TREE_CHAIN (t
))
6248 /* Just the identifier is adequate to distinguish. */
6249 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (t
)));
6251 switch (TREE_CODE (type
))
6254 hstate
.add_object (TYPE_HASH (TYPE_METHOD_BASETYPE (type
)));
6257 for (tree t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6258 if (TREE_VALUE (t
) != error_mark_node
)
6259 hstate
.add_object (TYPE_HASH (TREE_VALUE (t
)));
6263 hstate
.add_object (TYPE_HASH (TYPE_OFFSET_BASETYPE (type
)));
6268 if (TYPE_DOMAIN (type
))
6269 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (type
)));
6270 if (!AGGREGATE_TYPE_P (TREE_TYPE (type
)))
6272 unsigned typeless
= TYPE_TYPELESS_STORAGE (type
);
6273 hstate
.add_object (typeless
);
6280 tree t
= TYPE_MAX_VALUE (type
);
6282 t
= TYPE_MIN_VALUE (type
);
6283 for (int i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
6284 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
6289 case FIXED_POINT_TYPE
:
6291 unsigned prec
= TYPE_PRECISION (type
);
6292 hstate
.add_object (prec
);
6298 unsigned nunits
= TYPE_VECTOR_SUBPARTS (type
);
6299 hstate
.add_object (nunits
);
6307 return hstate
.end ();
6310 /* These are the Hashtable callback functions. */
6312 /* Returns true iff the types are equivalent. */
6315 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6317 /* First test the things that are the same for all types. */
6318 if (a
->hash
!= b
->hash
6319 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6320 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6321 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6322 TYPE_ATTRIBUTES (b
->type
))
6323 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6324 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6327 /* Be careful about comparing arrays before and after the element type
6328 has been completed; don't compare TYPE_ALIGN unless both types are
6330 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6331 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6332 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
6335 switch (TREE_CODE (a
->type
))
6340 case REFERENCE_TYPE
:
6345 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
6348 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
6349 && !(TYPE_VALUES (a
->type
)
6350 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
6351 && TYPE_VALUES (b
->type
)
6352 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
6353 && type_list_equal (TYPE_VALUES (a
->type
),
6354 TYPE_VALUES (b
->type
))))
6362 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
6364 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
6365 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
6366 TYPE_MAX_VALUE (b
->type
)))
6367 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
6368 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
6369 TYPE_MIN_VALUE (b
->type
))));
6371 case FIXED_POINT_TYPE
:
6372 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
6375 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
6378 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
6379 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6380 || (TYPE_ARG_TYPES (a
->type
)
6381 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6382 && TYPE_ARG_TYPES (b
->type
)
6383 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6384 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6385 TYPE_ARG_TYPES (b
->type
)))))
6389 /* Don't compare TYPE_TYPELESS_STORAGE flag on aggregates,
6390 where the flag should be inherited from the element type
6391 and can change after ARRAY_TYPEs are created; on non-aggregates
6392 compare it and hash it, scalars will never have that flag set
6393 and we need to differentiate between arrays created by different
6394 front-ends or middle-end created arrays. */
6395 return (TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
)
6396 && (AGGREGATE_TYPE_P (TREE_TYPE (a
->type
))
6397 || (TYPE_TYPELESS_STORAGE (a
->type
)
6398 == TYPE_TYPELESS_STORAGE (b
->type
))));
6402 case QUAL_UNION_TYPE
:
6403 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
6404 || (TYPE_FIELDS (a
->type
)
6405 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
6406 && TYPE_FIELDS (b
->type
)
6407 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
6408 && type_list_equal (TYPE_FIELDS (a
->type
),
6409 TYPE_FIELDS (b
->type
))));
6412 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
6413 || (TYPE_ARG_TYPES (a
->type
)
6414 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
6415 && TYPE_ARG_TYPES (b
->type
)
6416 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
6417 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
6418 TYPE_ARG_TYPES (b
->type
))))
6426 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
6427 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
6432 /* Given TYPE, and HASHCODE its hash code, return the canonical
6433 object for an identical type if one already exists.
6434 Otherwise, return TYPE, and record it as the canonical object.
6436 To use this function, first create a type of the sort you want.
6437 Then compute its hash code from the fields of the type that
6438 make it different from other similar types.
6439 Then call this function and use the value. */
6442 type_hash_canon (unsigned int hashcode
, tree type
)
6447 /* The hash table only contains main variants, so ensure that's what we're
6449 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
6451 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
6452 must call that routine before comparing TYPE_ALIGNs. */
6458 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
6461 tree t1
= ((type_hash
*) *loc
)->type
;
6462 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
6463 if (TYPE_UID (type
) + 1 == next_type_uid
)
6465 /* Free also min/max values and the cache for integer
6466 types. This can't be done in free_node, as LTO frees
6467 those on its own. */
6468 if (TREE_CODE (type
) == INTEGER_TYPE
)
6470 if (TYPE_MIN_VALUE (type
)
6471 && TREE_TYPE (TYPE_MIN_VALUE (type
)) == type
)
6472 ggc_free (TYPE_MIN_VALUE (type
));
6473 if (TYPE_MAX_VALUE (type
)
6474 && TREE_TYPE (TYPE_MAX_VALUE (type
)) == type
)
6475 ggc_free (TYPE_MAX_VALUE (type
));
6476 if (TYPE_CACHED_VALUES_P (type
))
6477 ggc_free (TYPE_CACHED_VALUES (type
));
6484 struct type_hash
*h
;
6486 h
= ggc_alloc
<type_hash
> ();
6496 print_type_hash_statistics (void)
6498 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
6499 (long) type_hash_table
->size (),
6500 (long) type_hash_table
->elements (),
6501 type_hash_table
->collisions ());
6504 /* Given two lists of types
6505 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
6506 return 1 if the lists contain the same types in the same order.
6507 Also, the TREE_PURPOSEs must match. */
6510 type_list_equal (const_tree l1
, const_tree l2
)
6514 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
6515 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
6516 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
6517 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
6518 && (TREE_TYPE (TREE_PURPOSE (t1
))
6519 == TREE_TYPE (TREE_PURPOSE (t2
))))))
6525 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
6526 given by TYPE. If the argument list accepts variable arguments,
6527 then this function counts only the ordinary arguments. */
6530 type_num_arguments (const_tree type
)
6535 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
6536 /* If the function does not take a variable number of arguments,
6537 the last element in the list will have type `void'. */
6538 if (VOID_TYPE_P (TREE_VALUE (t
)))
6546 /* Nonzero if integer constants T1 and T2
6547 represent the same constant value. */
6550 tree_int_cst_equal (const_tree t1
, const_tree t2
)
6555 if (t1
== 0 || t2
== 0)
6558 if (TREE_CODE (t1
) == INTEGER_CST
6559 && TREE_CODE (t2
) == INTEGER_CST
6560 && wi::to_widest (t1
) == wi::to_widest (t2
))
6566 /* Return true if T is an INTEGER_CST whose numerical value (extended
6567 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
6570 tree_fits_shwi_p (const_tree t
)
6572 return (t
!= NULL_TREE
6573 && TREE_CODE (t
) == INTEGER_CST
6574 && wi::fits_shwi_p (wi::to_widest (t
)));
6577 /* Return true if T is an INTEGER_CST whose numerical value (extended
6578 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
6581 tree_fits_uhwi_p (const_tree t
)
6583 return (t
!= NULL_TREE
6584 && TREE_CODE (t
) == INTEGER_CST
6585 && wi::fits_uhwi_p (wi::to_widest (t
)));
6588 /* T is an INTEGER_CST whose numerical value (extended according to
6589 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
6593 tree_to_shwi (const_tree t
)
6595 gcc_assert (tree_fits_shwi_p (t
));
6596 return TREE_INT_CST_LOW (t
);
6599 /* T is an INTEGER_CST whose numerical value (extended according to
6600 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
6603 unsigned HOST_WIDE_INT
6604 tree_to_uhwi (const_tree t
)
6606 gcc_assert (tree_fits_uhwi_p (t
));
6607 return TREE_INT_CST_LOW (t
);
6610 /* Return the most significant (sign) bit of T. */
6613 tree_int_cst_sign_bit (const_tree t
)
6615 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
6617 return wi::extract_uhwi (t
, bitno
, 1);
6620 /* Return an indication of the sign of the integer constant T.
6621 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
6622 Note that -1 will never be returned if T's type is unsigned. */
6625 tree_int_cst_sgn (const_tree t
)
6627 if (wi::eq_p (t
, 0))
6629 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
6631 else if (wi::neg_p (t
))
6637 /* Return the minimum number of bits needed to represent VALUE in a
6638 signed or unsigned type, UNSIGNEDP says which. */
6641 tree_int_cst_min_precision (tree value
, signop sgn
)
6643 /* If the value is negative, compute its negative minus 1. The latter
6644 adjustment is because the absolute value of the largest negative value
6645 is one larger than the largest positive value. This is equivalent to
6646 a bit-wise negation, so use that operation instead. */
6648 if (tree_int_cst_sgn (value
) < 0)
6649 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
6651 /* Return the number of bits needed, taking into account the fact
6652 that we need one more bit for a signed than unsigned type.
6653 If value is 0 or -1, the minimum precision is 1 no matter
6654 whether unsignedp is true or false. */
6656 if (integer_zerop (value
))
6659 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
6662 /* Return truthvalue of whether T1 is the same tree structure as T2.
6663 Return 1 if they are the same.
6664 Return 0 if they are understandably different.
6665 Return -1 if either contains tree structure not understood by
6669 simple_cst_equal (const_tree t1
, const_tree t2
)
6671 enum tree_code code1
, code2
;
6677 if (t1
== 0 || t2
== 0)
6680 code1
= TREE_CODE (t1
);
6681 code2
= TREE_CODE (t2
);
6683 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
6685 if (CONVERT_EXPR_CODE_P (code2
)
6686 || code2
== NON_LVALUE_EXPR
)
6687 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6689 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
6692 else if (CONVERT_EXPR_CODE_P (code2
)
6693 || code2
== NON_LVALUE_EXPR
)
6694 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
6702 return wi::to_widest (t1
) == wi::to_widest (t2
);
6705 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
6708 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
6711 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
6712 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
6713 TREE_STRING_LENGTH (t1
)));
6717 unsigned HOST_WIDE_INT idx
;
6718 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
6719 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
6721 if (vec_safe_length (v1
) != vec_safe_length (v2
))
6724 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
6725 /* ??? Should we handle also fields here? */
6726 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
6732 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6735 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
6738 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
6741 const_tree arg1
, arg2
;
6742 const_call_expr_arg_iterator iter1
, iter2
;
6743 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
6744 arg2
= first_const_call_expr_arg (t2
, &iter2
);
6746 arg1
= next_const_call_expr_arg (&iter1
),
6747 arg2
= next_const_call_expr_arg (&iter2
))
6749 cmp
= simple_cst_equal (arg1
, arg2
);
6753 return arg1
== arg2
;
6757 /* Special case: if either target is an unallocated VAR_DECL,
6758 it means that it's going to be unified with whatever the
6759 TARGET_EXPR is really supposed to initialize, so treat it
6760 as being equivalent to anything. */
6761 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
6762 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
6763 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
6764 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
6765 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
6766 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
6769 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6774 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
6776 case WITH_CLEANUP_EXPR
:
6777 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6781 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
6784 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
6785 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
6799 /* This general rule works for most tree codes. All exceptions should be
6800 handled above. If this is a language-specific tree code, we can't
6801 trust what might be in the operand, so say we don't know
6803 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
6806 switch (TREE_CODE_CLASS (code1
))
6810 case tcc_comparison
:
6811 case tcc_expression
:
6815 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
6817 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
6829 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
6830 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
6831 than U, respectively. */
6834 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
6836 if (tree_int_cst_sgn (t
) < 0)
6838 else if (!tree_fits_uhwi_p (t
))
6840 else if (TREE_INT_CST_LOW (t
) == u
)
6842 else if (TREE_INT_CST_LOW (t
) < u
)
6848 /* Return true if SIZE represents a constant size that is in bounds of
6849 what the middle-end and the backend accepts (covering not more than
6850 half of the address-space). */
6853 valid_constant_size_p (const_tree size
)
6855 if (! tree_fits_uhwi_p (size
)
6856 || TREE_OVERFLOW (size
)
6857 || tree_int_cst_sign_bit (size
) != 0)
6862 /* Return the precision of the type, or for a complex or vector type the
6863 precision of the type of its elements. */
6866 element_precision (const_tree type
)
6869 type
= TREE_TYPE (type
);
6870 enum tree_code code
= TREE_CODE (type
);
6871 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
6872 type
= TREE_TYPE (type
);
6874 return TYPE_PRECISION (type
);
6877 /* Return true if CODE represents an associative tree code. Otherwise
6880 associative_tree_code (enum tree_code code
)
6899 /* Return true if CODE represents a commutative tree code. Otherwise
6902 commutative_tree_code (enum tree_code code
)
6908 case MULT_HIGHPART_EXPR
:
6916 case UNORDERED_EXPR
:
6920 case TRUTH_AND_EXPR
:
6921 case TRUTH_XOR_EXPR
:
6923 case WIDEN_MULT_EXPR
:
6924 case VEC_WIDEN_MULT_HI_EXPR
:
6925 case VEC_WIDEN_MULT_LO_EXPR
:
6926 case VEC_WIDEN_MULT_EVEN_EXPR
:
6927 case VEC_WIDEN_MULT_ODD_EXPR
:
6936 /* Return true if CODE represents a ternary tree code for which the
6937 first two operands are commutative. Otherwise return false. */
6939 commutative_ternary_tree_code (enum tree_code code
)
6943 case WIDEN_MULT_PLUS_EXPR
:
6944 case WIDEN_MULT_MINUS_EXPR
:
6955 /* Returns true if CODE can overflow. */
6958 operation_can_overflow (enum tree_code code
)
6966 /* Can overflow in various ways. */
6968 case TRUNC_DIV_EXPR
:
6969 case EXACT_DIV_EXPR
:
6970 case FLOOR_DIV_EXPR
:
6972 /* For INT_MIN / -1. */
6979 /* These operators cannot overflow. */
6984 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
6985 ftrapv doesn't generate trapping insns for CODE. */
6988 operation_no_trapping_overflow (tree type
, enum tree_code code
)
6990 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
6992 /* We don't generate instructions that trap on overflow for complex or vector
6994 if (!INTEGRAL_TYPE_P (type
))
6997 if (!TYPE_OVERFLOW_TRAPS (type
))
7007 /* These operators can overflow, and -ftrapv generates trapping code for
7010 case TRUNC_DIV_EXPR
:
7011 case EXACT_DIV_EXPR
:
7012 case FLOOR_DIV_EXPR
:
7015 /* These operators can overflow, but -ftrapv does not generate trapping
7019 /* These operators cannot overflow. */
7027 /* Generate a hash value for an expression. This can be used iteratively
7028 by passing a previous result as the HSTATE argument.
7030 This function is intended to produce the same hash for expressions which
7031 would compare equal using operand_equal_p. */
7033 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7036 enum tree_code code
;
7037 enum tree_code_class tclass
;
7039 if (t
== NULL_TREE
|| t
== error_mark_node
)
7041 hstate
.merge_hash (0);
7045 if (!(flags
& OEP_ADDRESS_OF
))
7048 code
= TREE_CODE (t
);
7052 /* Alas, constants aren't shared, so we can't rely on pointer
7055 hstate
.merge_hash (0);
7058 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7059 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7060 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7065 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7068 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7069 hstate
.merge_hash (val2
);
7074 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7075 hstate
.merge_hash (val2
);
7079 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7080 TREE_STRING_LENGTH (t
));
7083 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7084 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7089 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7090 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7094 /* We can just compare by pointer. */
7095 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7097 case PLACEHOLDER_EXPR
:
7098 /* The node itself doesn't matter. */
7105 /* A list of expressions, for a CALL_EXPR or as the elements of a
7107 for (; t
; t
= TREE_CHAIN (t
))
7108 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7112 unsigned HOST_WIDE_INT idx
;
7114 flags
&= ~OEP_ADDRESS_OF
;
7115 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7117 inchash::add_expr (field
, hstate
, flags
);
7118 inchash::add_expr (value
, hstate
, flags
);
7122 case STATEMENT_LIST
:
7124 tree_stmt_iterator i
;
7125 for (i
= tsi_start (CONST_CAST_TREE (t
));
7126 !tsi_end_p (i
); tsi_next (&i
))
7127 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7131 for (i
= 0; i
< TREE_VEC_LENGTH (t
); ++i
)
7132 inchash::add_expr (TREE_VEC_ELT (t
, i
), hstate
, flags
);
7135 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7136 Otherwise nodes that compare equal according to operand_equal_p might
7137 get different hash codes. However, don't do this for machine specific
7138 or front end builtins, since the function code is overloaded in those
7140 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7141 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7143 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7144 code
= TREE_CODE (t
);
7148 tclass
= TREE_CODE_CLASS (code
);
7150 if (tclass
== tcc_declaration
)
7152 /* DECL's have a unique ID */
7153 hstate
.add_wide_int (DECL_UID (t
));
7155 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7157 /* For comparisons that can be swapped, use the lower
7159 enum tree_code ccode
= swap_tree_comparison (code
);
7162 hstate
.add_object (ccode
);
7163 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7164 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7166 else if (CONVERT_EXPR_CODE_P (code
))
7168 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7170 enum tree_code ccode
= NOP_EXPR
;
7171 hstate
.add_object (ccode
);
7173 /* Don't hash the type, that can lead to having nodes which
7174 compare equal according to operand_equal_p, but which
7175 have different hash codes. Make sure to include signedness
7176 in the hash computation. */
7177 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7178 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7180 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7181 else if (code
== MEM_REF
7182 && (flags
& OEP_ADDRESS_OF
) != 0
7183 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7184 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7185 && integer_zerop (TREE_OPERAND (t
, 1)))
7186 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7188 /* Don't ICE on FE specific trees, or their arguments etc.
7189 during operand_equal_p hash verification. */
7190 else if (!IS_EXPR_CODE_CLASS (tclass
))
7191 gcc_assert (flags
& OEP_HASH_CHECK
);
7194 unsigned int sflags
= flags
;
7196 hstate
.add_object (code
);
7201 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7202 flags
|= OEP_ADDRESS_OF
;
7208 case TARGET_MEM_REF
:
7209 flags
&= ~OEP_ADDRESS_OF
;
7214 case ARRAY_RANGE_REF
:
7217 sflags
&= ~OEP_ADDRESS_OF
;
7221 flags
&= ~OEP_ADDRESS_OF
;
7225 case WIDEN_MULT_PLUS_EXPR
:
7226 case WIDEN_MULT_MINUS_EXPR
:
7228 /* The multiplication operands are commutative. */
7229 inchash::hash one
, two
;
7230 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7231 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7232 hstate
.add_commutative (one
, two
);
7233 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7238 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7239 hstate
.add_int (CALL_EXPR_IFN (t
));
7243 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7244 Usually different TARGET_EXPRs just should use
7245 different temporaries in their slots. */
7246 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7253 /* Don't hash the type, that can lead to having nodes which
7254 compare equal according to operand_equal_p, but which
7255 have different hash codes. */
7256 if (code
== NON_LVALUE_EXPR
)
7258 /* Make sure to include signness in the hash computation. */
7259 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7260 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7263 else if (commutative_tree_code (code
))
7265 /* It's a commutative expression. We want to hash it the same
7266 however it appears. We do this by first hashing both operands
7267 and then rehashing based on the order of their independent
7269 inchash::hash one
, two
;
7270 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7271 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7272 hstate
.add_commutative (one
, two
);
7275 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7276 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7277 i
== 0 ? flags
: sflags
);
7285 /* Constructors for pointer, array and function types.
7286 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
7287 constructed by language-dependent code, not here.) */
7289 /* Construct, lay out and return the type of pointers to TO_TYPE with
7290 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
7291 reference all of memory. If such a type has already been
7292 constructed, reuse it. */
7295 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
7299 bool could_alias
= can_alias_all
;
7301 if (to_type
== error_mark_node
)
7302 return error_mark_node
;
7304 /* If the pointed-to type has the may_alias attribute set, force
7305 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7306 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7307 can_alias_all
= true;
7309 /* In some cases, languages will have things that aren't a POINTER_TYPE
7310 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
7311 In that case, return that type without regard to the rest of our
7314 ??? This is a kludge, but consistent with the way this function has
7315 always operated and there doesn't seem to be a good way to avoid this
7317 if (TYPE_POINTER_TO (to_type
) != 0
7318 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
7319 return TYPE_POINTER_TO (to_type
);
7321 /* First, if we already have a type for pointers to TO_TYPE and it's
7322 the proper mode, use it. */
7323 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
7324 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7327 t
= make_node (POINTER_TYPE
);
7329 TREE_TYPE (t
) = to_type
;
7330 SET_TYPE_MODE (t
, mode
);
7331 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7332 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
7333 TYPE_POINTER_TO (to_type
) = t
;
7335 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7336 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7337 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7338 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7340 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
7343 /* Lay out the type. This function has many callers that are concerned
7344 with expression-construction, and this simplifies them all. */
7350 /* By default build pointers in ptr_mode. */
7353 build_pointer_type (tree to_type
)
7355 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7356 : TYPE_ADDR_SPACE (to_type
);
7357 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7358 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
7361 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
7364 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
7368 bool could_alias
= can_alias_all
;
7370 if (to_type
== error_mark_node
)
7371 return error_mark_node
;
7373 /* If the pointed-to type has the may_alias attribute set, force
7374 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
7375 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
7376 can_alias_all
= true;
7378 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
7379 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
7380 In that case, return that type without regard to the rest of our
7383 ??? This is a kludge, but consistent with the way this function has
7384 always operated and there doesn't seem to be a good way to avoid this
7386 if (TYPE_REFERENCE_TO (to_type
) != 0
7387 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
7388 return TYPE_REFERENCE_TO (to_type
);
7390 /* First, if we already have a type for pointers to TO_TYPE and it's
7391 the proper mode, use it. */
7392 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
7393 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
7396 t
= make_node (REFERENCE_TYPE
);
7398 TREE_TYPE (t
) = to_type
;
7399 SET_TYPE_MODE (t
, mode
);
7400 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
7401 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
7402 TYPE_REFERENCE_TO (to_type
) = t
;
7404 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
7405 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
7406 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7407 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
7409 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
7418 /* Build the node for the type of references-to-TO_TYPE by default
7422 build_reference_type (tree to_type
)
7424 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
7425 : TYPE_ADDR_SPACE (to_type
);
7426 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
7427 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
7430 #define MAX_INT_CACHED_PREC \
7431 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7432 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
7434 /* Builds a signed or unsigned integer type of precision PRECISION.
7435 Used for C bitfields whose precision does not match that of
7436 built-in target types. */
7438 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
7444 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
7446 if (precision
<= MAX_INT_CACHED_PREC
)
7448 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
7453 itype
= make_node (INTEGER_TYPE
);
7454 TYPE_PRECISION (itype
) = precision
;
7457 fixup_unsigned_type (itype
);
7459 fixup_signed_type (itype
);
7462 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
7463 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
7464 if (precision
<= MAX_INT_CACHED_PREC
)
7465 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
7470 #define MAX_BOOL_CACHED_PREC \
7471 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
7472 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
7474 /* Builds a boolean type of precision PRECISION.
7475 Used for boolean vectors to choose proper vector element size. */
7477 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
7481 if (precision
<= MAX_BOOL_CACHED_PREC
)
7483 type
= nonstandard_boolean_type_cache
[precision
];
7488 type
= make_node (BOOLEAN_TYPE
);
7489 TYPE_PRECISION (type
) = precision
;
7490 fixup_signed_type (type
);
7492 if (precision
<= MAX_INT_CACHED_PREC
)
7493 nonstandard_boolean_type_cache
[precision
] = type
;
7498 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
7499 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
7500 is true, reuse such a type that has already been constructed. */
7503 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
7505 tree itype
= make_node (INTEGER_TYPE
);
7507 TREE_TYPE (itype
) = type
;
7509 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
7510 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
7512 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
7513 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
7514 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
7515 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
7516 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
7517 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
7518 SET_TYPE_WARN_IF_NOT_ALIGN (itype
, TYPE_WARN_IF_NOT_ALIGN (type
));
7523 if ((TYPE_MIN_VALUE (itype
)
7524 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
7525 || (TYPE_MAX_VALUE (itype
)
7526 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
7528 /* Since we cannot reliably merge this type, we need to compare it using
7529 structural equality checks. */
7530 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
7534 hashval_t hash
= type_hash_canon_hash (itype
);
7535 itype
= type_hash_canon (hash
, itype
);
7540 /* Wrapper around build_range_type_1 with SHARED set to true. */
7543 build_range_type (tree type
, tree lowval
, tree highval
)
7545 return build_range_type_1 (type
, lowval
, highval
, true);
7548 /* Wrapper around build_range_type_1 with SHARED set to false. */
7551 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
7553 return build_range_type_1 (type
, lowval
, highval
, false);
7556 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
7557 MAXVAL should be the maximum value in the domain
7558 (one less than the length of the array).
7560 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
7561 We don't enforce this limit, that is up to caller (e.g. language front end).
7562 The limit exists because the result is a signed type and we don't handle
7563 sizes that use more than one HOST_WIDE_INT. */
7566 build_index_type (tree maxval
)
7568 return build_range_type (sizetype
, size_zero_node
, maxval
);
7571 /* Return true if the debug information for TYPE, a subtype, should be emitted
7572 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
7573 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
7574 debug info and doesn't reflect the source code. */
7577 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
7579 tree base_type
= TREE_TYPE (type
), low
, high
;
7581 /* Subrange types have a base type which is an integral type. */
7582 if (!INTEGRAL_TYPE_P (base_type
))
7585 /* Get the real bounds of the subtype. */
7586 if (lang_hooks
.types
.get_subrange_bounds
)
7587 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
7590 low
= TYPE_MIN_VALUE (type
);
7591 high
= TYPE_MAX_VALUE (type
);
7594 /* If the type and its base type have the same representation and the same
7595 name, then the type is not a subrange but a copy of the base type. */
7596 if ((TREE_CODE (base_type
) == INTEGER_TYPE
7597 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
7598 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
7599 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
7600 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
7601 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
7611 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
7612 and number of elements specified by the range of values of INDEX_TYPE.
7613 If TYPELESS_STORAGE is true, TYPE_TYPELESS_STORAGE flag is set on the type.
7614 If SHARED is true, reuse such a type that has already been constructed. */
7617 build_array_type_1 (tree elt_type
, tree index_type
, bool typeless_storage
,
7622 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
7624 error ("arrays of functions are not meaningful");
7625 elt_type
= integer_type_node
;
7628 t
= make_node (ARRAY_TYPE
);
7629 TREE_TYPE (t
) = elt_type
;
7630 TYPE_DOMAIN (t
) = index_type
;
7631 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
7632 TYPE_TYPELESS_STORAGE (t
) = typeless_storage
;
7635 /* If the element type is incomplete at this point we get marked for
7636 structural equality. Do not record these types in the canonical
7638 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
7643 hashval_t hash
= type_hash_canon_hash (t
);
7644 t
= type_hash_canon (hash
, t
);
7647 if (TYPE_CANONICAL (t
) == t
)
7649 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
7650 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
7652 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7653 else if (TYPE_CANONICAL (elt_type
) != elt_type
7654 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
7656 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
7658 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
7659 typeless_storage
, shared
);
7665 /* Wrapper around build_array_type_1 with SHARED set to true. */
7668 build_array_type (tree elt_type
, tree index_type
, bool typeless_storage
)
7670 return build_array_type_1 (elt_type
, index_type
, typeless_storage
, true);
7673 /* Wrapper around build_array_type_1 with SHARED set to false. */
7676 build_nonshared_array_type (tree elt_type
, tree index_type
)
7678 return build_array_type_1 (elt_type
, index_type
, false, false);
7681 /* Return a representation of ELT_TYPE[NELTS], using indices of type
7685 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
7687 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
7690 /* Recursively examines the array elements of TYPE, until a non-array
7691 element type is found. */
7694 strip_array_types (tree type
)
7696 while (TREE_CODE (type
) == ARRAY_TYPE
)
7697 type
= TREE_TYPE (type
);
7702 /* Computes the canonical argument types from the argument type list
7705 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
7706 on entry to this function, or if any of the ARGTYPES are
7709 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
7710 true on entry to this function, or if any of the ARGTYPES are
7713 Returns a canonical argument list, which may be ARGTYPES when the
7714 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
7715 true) or would not differ from ARGTYPES. */
7718 maybe_canonicalize_argtypes (tree argtypes
,
7719 bool *any_structural_p
,
7720 bool *any_noncanonical_p
)
7723 bool any_noncanonical_argtypes_p
= false;
7725 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
7727 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
7728 /* Fail gracefully by stating that the type is structural. */
7729 *any_structural_p
= true;
7730 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
7731 *any_structural_p
= true;
7732 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
7733 || TREE_PURPOSE (arg
))
7734 /* If the argument has a default argument, we consider it
7735 non-canonical even though the type itself is canonical.
7736 That way, different variants of function and method types
7737 with default arguments will all point to the variant with
7738 no defaults as their canonical type. */
7739 any_noncanonical_argtypes_p
= true;
7742 if (*any_structural_p
)
7745 if (any_noncanonical_argtypes_p
)
7747 /* Build the canonical list of argument types. */
7748 tree canon_argtypes
= NULL_TREE
;
7749 bool is_void
= false;
7751 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
7753 if (arg
== void_list_node
)
7756 canon_argtypes
= tree_cons (NULL_TREE
,
7757 TYPE_CANONICAL (TREE_VALUE (arg
)),
7761 canon_argtypes
= nreverse (canon_argtypes
);
7763 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
7765 /* There is a non-canonical type. */
7766 *any_noncanonical_p
= true;
7767 return canon_argtypes
;
7770 /* The canonical argument types are the same as ARGTYPES. */
7774 /* Construct, lay out and return
7775 the type of functions returning type VALUE_TYPE
7776 given arguments of types ARG_TYPES.
7777 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
7778 are data type nodes for the arguments of the function.
7779 If such a type has already been constructed, reuse it. */
7782 build_function_type (tree value_type
, tree arg_types
)
7785 inchash::hash hstate
;
7786 bool any_structural_p
, any_noncanonical_p
;
7787 tree canon_argtypes
;
7789 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
7791 error ("function return type cannot be function");
7792 value_type
= integer_type_node
;
7795 /* Make a node of the sort we want. */
7796 t
= make_node (FUNCTION_TYPE
);
7797 TREE_TYPE (t
) = value_type
;
7798 TYPE_ARG_TYPES (t
) = arg_types
;
7800 /* If we already have such a type, use the old one. */
7801 hashval_t hash
= type_hash_canon_hash (t
);
7802 t
= type_hash_canon (hash
, t
);
7804 /* Set up the canonical type. */
7805 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
7806 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
7807 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
7809 &any_noncanonical_p
);
7810 if (any_structural_p
)
7811 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7812 else if (any_noncanonical_p
)
7813 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
7816 if (!COMPLETE_TYPE_P (t
))
7821 /* Build a function type. The RETURN_TYPE is the type returned by the
7822 function. If VAARGS is set, no void_type_node is appended to the
7823 list. ARGP must be always be terminated be a NULL_TREE. */
7826 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
7830 t
= va_arg (argp
, tree
);
7831 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
7832 args
= tree_cons (NULL_TREE
, t
, args
);
7837 if (args
!= NULL_TREE
)
7838 args
= nreverse (args
);
7839 gcc_assert (last
!= void_list_node
);
7841 else if (args
== NULL_TREE
)
7842 args
= void_list_node
;
7846 args
= nreverse (args
);
7847 TREE_CHAIN (last
) = void_list_node
;
7849 args
= build_function_type (return_type
, args
);
7854 /* Build a function type. The RETURN_TYPE is the type returned by the
7855 function. If additional arguments are provided, they are
7856 additional argument types. The list of argument types must always
7857 be terminated by NULL_TREE. */
7860 build_function_type_list (tree return_type
, ...)
7865 va_start (p
, return_type
);
7866 args
= build_function_type_list_1 (false, return_type
, p
);
7871 /* Build a variable argument function type. The RETURN_TYPE is the
7872 type returned by the function. If additional arguments are provided,
7873 they are additional argument types. The list of argument types must
7874 always be terminated by NULL_TREE. */
7877 build_varargs_function_type_list (tree return_type
, ...)
7882 va_start (p
, return_type
);
7883 args
= build_function_type_list_1 (true, return_type
, p
);
7889 /* Build a function type. RETURN_TYPE is the type returned by the
7890 function; VAARGS indicates whether the function takes varargs. The
7891 function takes N named arguments, the types of which are provided in
7895 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
7899 tree t
= vaargs
? NULL_TREE
: void_list_node
;
7901 for (i
= n
- 1; i
>= 0; i
--)
7902 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
7904 return build_function_type (return_type
, t
);
7907 /* Build a function type. RETURN_TYPE is the type returned by the
7908 function. The function takes N named arguments, the types of which
7909 are provided in ARG_TYPES. */
7912 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7914 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
7917 /* Build a variable argument function type. RETURN_TYPE is the type
7918 returned by the function. The function takes N named arguments, the
7919 types of which are provided in ARG_TYPES. */
7922 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
7924 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
7927 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
7928 and ARGTYPES (a TREE_LIST) are the return type and arguments types
7929 for the method. An implicit additional parameter (of type
7930 pointer-to-BASETYPE) is added to the ARGTYPES. */
7933 build_method_type_directly (tree basetype
,
7939 bool any_structural_p
, any_noncanonical_p
;
7940 tree canon_argtypes
;
7942 /* Make a node of the sort we want. */
7943 t
= make_node (METHOD_TYPE
);
7945 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
7946 TREE_TYPE (t
) = rettype
;
7947 ptype
= build_pointer_type (basetype
);
7949 /* The actual arglist for this function includes a "hidden" argument
7950 which is "this". Put it into the list of argument types. */
7951 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
7952 TYPE_ARG_TYPES (t
) = argtypes
;
7954 /* If we already have such a type, use the old one. */
7955 hashval_t hash
= type_hash_canon_hash (t
);
7956 t
= type_hash_canon (hash
, t
);
7958 /* Set up the canonical type. */
7960 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
7961 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
7963 = (TYPE_CANONICAL (basetype
) != basetype
7964 || TYPE_CANONICAL (rettype
) != rettype
);
7965 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
7967 &any_noncanonical_p
);
7968 if (any_structural_p
)
7969 SET_TYPE_STRUCTURAL_EQUALITY (t
);
7970 else if (any_noncanonical_p
)
7972 = build_method_type_directly (TYPE_CANONICAL (basetype
),
7973 TYPE_CANONICAL (rettype
),
7975 if (!COMPLETE_TYPE_P (t
))
7981 /* Construct, lay out and return the type of methods belonging to class
7982 BASETYPE and whose arguments and values are described by TYPE.
7983 If that type exists already, reuse it.
7984 TYPE must be a FUNCTION_TYPE node. */
7987 build_method_type (tree basetype
, tree type
)
7989 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
7991 return build_method_type_directly (basetype
,
7993 TYPE_ARG_TYPES (type
));
7996 /* Construct, lay out and return the type of offsets to a value
7997 of type TYPE, within an object of type BASETYPE.
7998 If a suitable offset type exists already, reuse it. */
8001 build_offset_type (tree basetype
, tree type
)
8005 /* Make a node of the sort we want. */
8006 t
= make_node (OFFSET_TYPE
);
8008 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8009 TREE_TYPE (t
) = type
;
8011 /* If we already have such a type, use the old one. */
8012 hashval_t hash
= type_hash_canon_hash (t
);
8013 t
= type_hash_canon (hash
, t
);
8015 if (!COMPLETE_TYPE_P (t
))
8018 if (TYPE_CANONICAL (t
) == t
)
8020 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8021 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8022 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8023 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8024 || TYPE_CANONICAL (type
) != type
)
8026 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8027 TYPE_CANONICAL (type
));
8033 /* Create a complex type whose components are COMPONENT_TYPE.
8035 If NAMED is true, the type is given a TYPE_NAME. We do not always
8036 do so because this creates a DECL node and thus make the DECL_UIDs
8037 dependent on the type canonicalization hashtable, which is GC-ed,
8038 so the DECL_UIDs would not be stable wrt garbage collection. */
8041 build_complex_type (tree component_type
, bool named
)
8045 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8046 || SCALAR_FLOAT_TYPE_P (component_type
)
8047 || FIXED_POINT_TYPE_P (component_type
));
8049 /* Make a node of the sort we want. */
8050 t
= make_node (COMPLEX_TYPE
);
8052 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8054 /* If we already have such a type, use the old one. */
8055 hashval_t hash
= type_hash_canon_hash (t
);
8056 t
= type_hash_canon (hash
, t
);
8058 if (!COMPLETE_TYPE_P (t
))
8061 if (TYPE_CANONICAL (t
) == t
)
8063 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8064 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8065 else if (TYPE_CANONICAL (component_type
) != component_type
)
8067 = build_complex_type (TYPE_CANONICAL (component_type
), named
);
8070 /* We need to create a name, since complex is a fundamental type. */
8071 if (!TYPE_NAME (t
) && named
)
8074 if (component_type
== char_type_node
)
8075 name
= "complex char";
8076 else if (component_type
== signed_char_type_node
)
8077 name
= "complex signed char";
8078 else if (component_type
== unsigned_char_type_node
)
8079 name
= "complex unsigned char";
8080 else if (component_type
== short_integer_type_node
)
8081 name
= "complex short int";
8082 else if (component_type
== short_unsigned_type_node
)
8083 name
= "complex short unsigned int";
8084 else if (component_type
== integer_type_node
)
8085 name
= "complex int";
8086 else if (component_type
== unsigned_type_node
)
8087 name
= "complex unsigned int";
8088 else if (component_type
== long_integer_type_node
)
8089 name
= "complex long int";
8090 else if (component_type
== long_unsigned_type_node
)
8091 name
= "complex long unsigned int";
8092 else if (component_type
== long_long_integer_type_node
)
8093 name
= "complex long long int";
8094 else if (component_type
== long_long_unsigned_type_node
)
8095 name
= "complex long long unsigned int";
8100 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8101 get_identifier (name
), t
);
8104 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8107 /* If TYPE is a real or complex floating-point type and the target
8108 does not directly support arithmetic on TYPE then return the wider
8109 type to be used for arithmetic on TYPE. Otherwise, return
8113 excess_precision_type (tree type
)
8115 /* The target can give two different responses to the question of
8116 which excess precision mode it would like depending on whether we
8117 are in -fexcess-precision=standard or -fexcess-precision=fast. */
8119 enum excess_precision_type requested_type
8120 = (flag_excess_precision
== EXCESS_PRECISION_FAST
8121 ? EXCESS_PRECISION_TYPE_FAST
8122 : EXCESS_PRECISION_TYPE_STANDARD
);
8124 enum flt_eval_method target_flt_eval_method
8125 = targetm
.c
.excess_precision (requested_type
);
8127 /* The target should not ask for unpredictable float evaluation (though
8128 it might advertise that implicitly the evaluation is unpredictable,
8129 but we don't care about that here, it will have been reported
8130 elsewhere). If it does ask for unpredictable evaluation, we have
8131 nothing to do here. */
8132 gcc_assert (target_flt_eval_method
!= FLT_EVAL_METHOD_UNPREDICTABLE
);
8134 /* Nothing to do. The target has asked for all types we know about
8135 to be computed with their native precision and range. */
8136 if (target_flt_eval_method
== FLT_EVAL_METHOD_PROMOTE_TO_FLOAT16
)
8139 /* The target will promote this type in a target-dependent way, so excess
8140 precision ought to leave it alone. */
8141 if (targetm
.promoted_type (type
) != NULL_TREE
)
8144 machine_mode float16_type_mode
= (float16_type_node
8145 ? TYPE_MODE (float16_type_node
)
8147 machine_mode float_type_mode
= TYPE_MODE (float_type_node
);
8148 machine_mode double_type_mode
= TYPE_MODE (double_type_node
);
8150 switch (TREE_CODE (type
))
8154 machine_mode type_mode
= TYPE_MODE (type
);
8155 switch (target_flt_eval_method
)
8157 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8158 if (type_mode
== float16_type_mode
)
8159 return float_type_node
;
8161 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8162 if (type_mode
== float16_type_mode
8163 || type_mode
== float_type_mode
)
8164 return double_type_node
;
8166 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8167 if (type_mode
== float16_type_mode
8168 || type_mode
== float_type_mode
8169 || type_mode
== double_type_mode
)
8170 return long_double_type_node
;
8179 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8181 machine_mode type_mode
= TYPE_MODE (TREE_TYPE (type
));
8182 switch (target_flt_eval_method
)
8184 case FLT_EVAL_METHOD_PROMOTE_TO_FLOAT
:
8185 if (type_mode
== float16_type_mode
)
8186 return complex_float_type_node
;
8188 case FLT_EVAL_METHOD_PROMOTE_TO_DOUBLE
:
8189 if (type_mode
== float16_type_mode
8190 || type_mode
== float_type_mode
)
8191 return complex_double_type_node
;
8193 case FLT_EVAL_METHOD_PROMOTE_TO_LONG_DOUBLE
:
8194 if (type_mode
== float16_type_mode
8195 || type_mode
== float_type_mode
8196 || type_mode
== double_type_mode
)
8197 return complex_long_double_type_node
;
8211 /* Return OP, stripped of any conversions to wider types as much as is safe.
8212 Converting the value back to OP's type makes a value equivalent to OP.
8214 If FOR_TYPE is nonzero, we return a value which, if converted to
8215 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8217 OP must have integer, real or enumeral type. Pointers are not allowed!
8219 There are some cases where the obvious value we could return
8220 would regenerate to OP if converted to OP's type,
8221 but would not extend like OP to wider types.
8222 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8223 For example, if OP is (unsigned short)(signed char)-1,
8224 we avoid returning (signed char)-1 if FOR_TYPE is int,
8225 even though extending that to an unsigned short would regenerate OP,
8226 since the result of extending (signed char)-1 to (int)
8227 is different from (int) OP. */
8230 get_unwidened (tree op
, tree for_type
)
8232 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8233 tree type
= TREE_TYPE (op
);
8235 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8237 = (for_type
!= 0 && for_type
!= type
8238 && final_prec
> TYPE_PRECISION (type
)
8239 && TYPE_UNSIGNED (type
));
8242 while (CONVERT_EXPR_P (op
))
8246 /* TYPE_PRECISION on vector types has different meaning
8247 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8248 so avoid them here. */
8249 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8252 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8253 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8255 /* Truncations are many-one so cannot be removed.
8256 Unless we are later going to truncate down even farther. */
8258 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8261 /* See what's inside this conversion. If we decide to strip it,
8263 op
= TREE_OPERAND (op
, 0);
8265 /* If we have not stripped any zero-extensions (uns is 0),
8266 we can strip any kind of extension.
8267 If we have previously stripped a zero-extension,
8268 only zero-extensions can safely be stripped.
8269 Any extension can be stripped if the bits it would produce
8270 are all going to be discarded later by truncating to FOR_TYPE. */
8274 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8276 /* TYPE_UNSIGNED says whether this is a zero-extension.
8277 Let's avoid computing it if it does not affect WIN
8278 and if UNS will not be needed again. */
8280 || CONVERT_EXPR_P (op
))
8281 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8289 /* If we finally reach a constant see if it fits in sth smaller and
8290 in that case convert it. */
8291 if (TREE_CODE (win
) == INTEGER_CST
)
8293 tree wtype
= TREE_TYPE (win
);
8294 unsigned prec
= wi::min_precision (win
, TYPE_SIGN (wtype
));
8296 prec
= MAX (prec
, final_prec
);
8297 if (prec
< TYPE_PRECISION (wtype
))
8299 tree t
= lang_hooks
.types
.type_for_size (prec
, TYPE_UNSIGNED (wtype
));
8300 if (t
&& TYPE_PRECISION (t
) < TYPE_PRECISION (wtype
))
8301 win
= fold_convert (t
, win
);
8308 /* Return OP or a simpler expression for a narrower value
8309 which can be sign-extended or zero-extended to give back OP.
8310 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8311 or 0 if the value should be sign-extended. */
8314 get_narrower (tree op
, int *unsignedp_ptr
)
8319 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8321 while (TREE_CODE (op
) == NOP_EXPR
)
8324 = (TYPE_PRECISION (TREE_TYPE (op
))
8325 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8327 /* Truncations are many-one so cannot be removed. */
8331 /* See what's inside this conversion. If we decide to strip it,
8336 op
= TREE_OPERAND (op
, 0);
8337 /* An extension: the outermost one can be stripped,
8338 but remember whether it is zero or sign extension. */
8340 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8341 /* Otherwise, if a sign extension has been stripped,
8342 only sign extensions can now be stripped;
8343 if a zero extension has been stripped, only zero-extensions. */
8344 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
8348 else /* bitschange == 0 */
8350 /* A change in nominal type can always be stripped, but we must
8351 preserve the unsignedness. */
8353 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
8355 op
= TREE_OPERAND (op
, 0);
8356 /* Keep trying to narrow, but don't assign op to win if it
8357 would turn an integral type into something else. */
8358 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
8365 if (TREE_CODE (op
) == COMPONENT_REF
8366 /* Since type_for_size always gives an integer type. */
8367 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
8368 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
8369 /* Ensure field is laid out already. */
8370 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
8371 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
8373 unsigned HOST_WIDE_INT innerprec
8374 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
8375 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
8376 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
8377 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
8379 /* We can get this structure field in a narrower type that fits it,
8380 but the resulting extension to its nominal type (a fullword type)
8381 must satisfy the same conditions as for other extensions.
8383 Do this only for fields that are aligned (not bit-fields),
8384 because when bit-field insns will be used there is no
8385 advantage in doing this. */
8387 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
8388 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
8389 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
8393 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
8394 win
= fold_convert (type
, op
);
8398 *unsignedp_ptr
= uns
;
8402 /* Return true if integer constant C has a value that is permissible
8403 for TYPE, an integral type. */
8406 int_fits_type_p (const_tree c
, const_tree type
)
8408 tree type_low_bound
, type_high_bound
;
8409 bool ok_for_low_bound
, ok_for_high_bound
;
8410 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
8412 /* Non-standard boolean types can have arbitrary precision but various
8413 transformations assume that they can only take values 0 and +/-1. */
8414 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
8415 return wi::fits_to_boolean_p (c
, type
);
8418 type_low_bound
= TYPE_MIN_VALUE (type
);
8419 type_high_bound
= TYPE_MAX_VALUE (type
);
8421 /* If at least one bound of the type is a constant integer, we can check
8422 ourselves and maybe make a decision. If no such decision is possible, but
8423 this type is a subtype, try checking against that. Otherwise, use
8424 fits_to_tree_p, which checks against the precision.
8426 Compute the status for each possibly constant bound, and return if we see
8427 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
8428 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
8429 for "constant known to fit". */
8431 /* Check if c >= type_low_bound. */
8432 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
8434 if (tree_int_cst_lt (c
, type_low_bound
))
8436 ok_for_low_bound
= true;
8439 ok_for_low_bound
= false;
8441 /* Check if c <= type_high_bound. */
8442 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
8444 if (tree_int_cst_lt (type_high_bound
, c
))
8446 ok_for_high_bound
= true;
8449 ok_for_high_bound
= false;
8451 /* If the constant fits both bounds, the result is known. */
8452 if (ok_for_low_bound
&& ok_for_high_bound
)
8455 /* Perform some generic filtering which may allow making a decision
8456 even if the bounds are not constant. First, negative integers
8457 never fit in unsigned types, */
8458 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
8461 /* Second, narrower types always fit in wider ones. */
8462 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
8465 /* Third, unsigned integers with top bit set never fit signed types. */
8466 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
8468 int prec
= GET_MODE_PRECISION (SCALAR_INT_TYPE_MODE (TREE_TYPE (c
))) - 1;
8469 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
8471 /* When a tree_cst is converted to a wide-int, the precision
8472 is taken from the type. However, if the precision of the
8473 mode underneath the type is smaller than that, it is
8474 possible that the value will not fit. The test below
8475 fails if any bit is set between the sign bit of the
8476 underlying mode and the top bit of the type. */
8477 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
8480 else if (wi::neg_p (c
))
8484 /* If we haven't been able to decide at this point, there nothing more we
8485 can check ourselves here. Look at the base type if we have one and it
8486 has the same precision. */
8487 if (TREE_CODE (type
) == INTEGER_TYPE
8488 && TREE_TYPE (type
) != 0
8489 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
8491 type
= TREE_TYPE (type
);
8495 /* Or to fits_to_tree_p, if nothing else. */
8496 return wi::fits_to_tree_p (c
, type
);
8499 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
8500 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
8501 represented (assuming two's-complement arithmetic) within the bit
8502 precision of the type are returned instead. */
8505 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
8507 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
8508 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
8509 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
8512 if (TYPE_UNSIGNED (type
))
8513 mpz_set_ui (min
, 0);
8516 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
8517 wi::to_mpz (mn
, min
, SIGNED
);
8521 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
8522 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
8523 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
8526 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
8527 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
8531 /* Return true if VAR is an automatic variable defined in function FN. */
8534 auto_var_in_fn_p (const_tree var
, const_tree fn
)
8536 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
8537 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
8538 || TREE_CODE (var
) == PARM_DECL
)
8539 && ! TREE_STATIC (var
))
8540 || TREE_CODE (var
) == LABEL_DECL
8541 || TREE_CODE (var
) == RESULT_DECL
));
8544 /* Subprogram of following function. Called by walk_tree.
8546 Return *TP if it is an automatic variable or parameter of the
8547 function passed in as DATA. */
8550 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
8552 tree fn
= (tree
) data
;
8557 else if (DECL_P (*tp
)
8558 && auto_var_in_fn_p (*tp
, fn
))
8564 /* Returns true if T is, contains, or refers to a type with variable
8565 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
8566 arguments, but not the return type. If FN is nonzero, only return
8567 true if a modifier of the type or position of FN is a variable or
8568 parameter inside FN.
8570 This concept is more general than that of C99 'variably modified types':
8571 in C99, a struct type is never variably modified because a VLA may not
8572 appear as a structure member. However, in GNU C code like:
8574 struct S { int i[f()]; };
8576 is valid, and other languages may define similar constructs. */
8579 variably_modified_type_p (tree type
, tree fn
)
8583 /* Test if T is either variable (if FN is zero) or an expression containing
8584 a variable in FN. If TYPE isn't gimplified, return true also if
8585 gimplify_one_sizepos would gimplify the expression into a local
8587 #define RETURN_TRUE_IF_VAR(T) \
8588 do { tree _t = (T); \
8589 if (_t != NULL_TREE \
8590 && _t != error_mark_node \
8591 && TREE_CODE (_t) != INTEGER_CST \
8592 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
8594 || (!TYPE_SIZES_GIMPLIFIED (type) \
8595 && !is_gimple_sizepos (_t)) \
8596 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
8597 return true; } while (0)
8599 if (type
== error_mark_node
)
8602 /* If TYPE itself has variable size, it is variably modified. */
8603 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
8604 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
8606 switch (TREE_CODE (type
))
8609 case REFERENCE_TYPE
:
8611 /* Ada can have pointer types refering to themselves indirectly. */
8612 if (TREE_VISITED (type
))
8614 TREE_VISITED (type
) = true;
8615 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8617 TREE_VISITED (type
) = false;
8620 TREE_VISITED (type
) = false;
8625 /* If TYPE is a function type, it is variably modified if the
8626 return type is variably modified. */
8627 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
8633 case FIXED_POINT_TYPE
:
8636 /* Scalar types are variably modified if their end points
8638 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
8639 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
8644 case QUAL_UNION_TYPE
:
8645 /* We can't see if any of the fields are variably-modified by the
8646 definition we normally use, since that would produce infinite
8647 recursion via pointers. */
8648 /* This is variably modified if some field's type is. */
8649 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
8650 if (TREE_CODE (t
) == FIELD_DECL
)
8652 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
8653 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
8654 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
8656 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
8657 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
8662 /* Do not call ourselves to avoid infinite recursion. This is
8663 variably modified if the element type is. */
8664 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
8665 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
8672 /* The current language may have other cases to check, but in general,
8673 all other types are not variably modified. */
8674 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
8676 #undef RETURN_TRUE_IF_VAR
8679 /* Given a DECL or TYPE, return the scope in which it was declared, or
8680 NULL_TREE if there is no containing scope. */
8683 get_containing_scope (const_tree t
)
8685 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
8688 /* Return the innermost context enclosing DECL that is
8689 a FUNCTION_DECL, or zero if none. */
8692 decl_function_context (const_tree decl
)
8696 if (TREE_CODE (decl
) == ERROR_MARK
)
8699 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
8700 where we look up the function at runtime. Such functions always take
8701 a first argument of type 'pointer to real context'.
8703 C++ should really be fixed to use DECL_CONTEXT for the real context,
8704 and use something else for the "virtual context". */
8705 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
8708 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
8710 context
= DECL_CONTEXT (decl
);
8712 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
8714 if (TREE_CODE (context
) == BLOCK
)
8715 context
= BLOCK_SUPERCONTEXT (context
);
8717 context
= get_containing_scope (context
);
8723 /* Return the innermost context enclosing DECL that is
8724 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
8725 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
8728 decl_type_context (const_tree decl
)
8730 tree context
= DECL_CONTEXT (decl
);
8733 switch (TREE_CODE (context
))
8735 case NAMESPACE_DECL
:
8736 case TRANSLATION_UNIT_DECL
:
8741 case QUAL_UNION_TYPE
:
8746 context
= DECL_CONTEXT (context
);
8750 context
= BLOCK_SUPERCONTEXT (context
);
8760 /* CALL is a CALL_EXPR. Return the declaration for the function
8761 called, or NULL_TREE if the called function cannot be
8765 get_callee_fndecl (const_tree call
)
8769 if (call
== error_mark_node
)
8770 return error_mark_node
;
8772 /* It's invalid to call this function with anything but a
8774 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8776 /* The first operand to the CALL is the address of the function
8778 addr
= CALL_EXPR_FN (call
);
8780 /* If there is no function, return early. */
8781 if (addr
== NULL_TREE
)
8786 /* If this is a readonly function pointer, extract its initial value. */
8787 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
8788 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
8789 && DECL_INITIAL (addr
))
8790 addr
= DECL_INITIAL (addr
);
8792 /* If the address is just `&f' for some function `f', then we know
8793 that `f' is being called. */
8794 if (TREE_CODE (addr
) == ADDR_EXPR
8795 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
8796 return TREE_OPERAND (addr
, 0);
8798 /* We couldn't figure out what was being called. */
8802 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
8803 return the associated function code, otherwise return CFN_LAST. */
8806 get_call_combined_fn (const_tree call
)
8808 /* It's invalid to call this function with anything but a CALL_EXPR. */
8809 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
8811 if (!CALL_EXPR_FN (call
))
8812 return as_combined_fn (CALL_EXPR_IFN (call
));
8814 tree fndecl
= get_callee_fndecl (call
);
8815 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
8816 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
8821 #define TREE_MEM_USAGE_SPACES 40
8823 /* Print debugging information about tree nodes generated during the compile,
8824 and any language-specific information. */
8827 dump_tree_statistics (void)
8829 if (GATHER_STATISTICS
)
8832 int total_nodes
, total_bytes
;
8833 fprintf (stderr
, "\nKind Nodes Bytes\n");
8834 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8835 total_nodes
= total_bytes
= 0;
8836 for (i
= 0; i
< (int) all_kinds
; i
++)
8838 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
8839 tree_node_counts
[i
], tree_node_sizes
[i
]);
8840 total_nodes
+= tree_node_counts
[i
];
8841 total_bytes
+= tree_node_sizes
[i
];
8843 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8844 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
8845 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8846 fprintf (stderr
, "Code Nodes\n");
8847 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8848 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
8849 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
8850 tree_code_counts
[i
]);
8851 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
8852 fprintf (stderr
, "\n");
8853 ssanames_print_statistics ();
8854 fprintf (stderr
, "\n");
8855 phinodes_print_statistics ();
8856 fprintf (stderr
, "\n");
8859 fprintf (stderr
, "(No per-node statistics)\n");
8861 print_type_hash_statistics ();
8862 print_debug_expr_statistics ();
8863 print_value_expr_statistics ();
8864 lang_hooks
.print_statistics ();
8867 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
8869 /* Generate a crc32 of the low BYTES bytes of VALUE. */
8872 crc32_unsigned_n (unsigned chksum
, unsigned value
, unsigned bytes
)
8874 /* This relies on the raw feedback's top 4 bits being zero. */
8875 #define FEEDBACK(X) ((X) * 0x04c11db7)
8876 #define SYNDROME(X) (FEEDBACK ((X) & 1) ^ FEEDBACK ((X) & 2) \
8877 ^ FEEDBACK ((X) & 4) ^ FEEDBACK ((X) & 8))
8878 static const unsigned syndromes
[16] =
8880 SYNDROME(0x0), SYNDROME(0x1), SYNDROME(0x2), SYNDROME(0x3),
8881 SYNDROME(0x4), SYNDROME(0x5), SYNDROME(0x6), SYNDROME(0x7),
8882 SYNDROME(0x8), SYNDROME(0x9), SYNDROME(0xa), SYNDROME(0xb),
8883 SYNDROME(0xc), SYNDROME(0xd), SYNDROME(0xe), SYNDROME(0xf),
8888 value
<<= (32 - bytes
* 8);
8889 for (unsigned ix
= bytes
* 2; ix
--; value
<<= 4)
8891 unsigned feedback
= syndromes
[((value
^ chksum
) >> 28) & 0xf];
8893 chksum
= (chksum
<< 4) ^ feedback
;
8899 /* Generate a crc32 of a string. */
8902 crc32_string (unsigned chksum
, const char *string
)
8905 chksum
= crc32_byte (chksum
, *string
);
8910 /* P is a string that will be used in a symbol. Mask out any characters
8911 that are not valid in that context. */
8914 clean_symbol_name (char *p
)
8918 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
8921 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
8928 /* For anonymous aggregate types, we need some sort of name to
8929 hold on to. In practice, this should not appear, but it should
8930 not be harmful if it does. */
8932 anon_aggrname_p(const_tree id_node
)
8934 #ifndef NO_DOT_IN_LABEL
8935 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
8936 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8937 #else /* NO_DOT_IN_LABEL */
8938 #ifndef NO_DOLLAR_IN_LABEL
8939 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
8940 && IDENTIFIER_POINTER (id_node
)[1] == '_');
8941 #else /* NO_DOLLAR_IN_LABEL */
8942 #define ANON_AGGRNAME_PREFIX "__anon_"
8943 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
8944 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
8945 #endif /* NO_DOLLAR_IN_LABEL */
8946 #endif /* NO_DOT_IN_LABEL */
8949 /* Return a format for an anonymous aggregate name. */
8951 anon_aggrname_format()
8953 #ifndef NO_DOT_IN_LABEL
8955 #else /* NO_DOT_IN_LABEL */
8956 #ifndef NO_DOLLAR_IN_LABEL
8958 #else /* NO_DOLLAR_IN_LABEL */
8960 #endif /* NO_DOLLAR_IN_LABEL */
8961 #endif /* NO_DOT_IN_LABEL */
8964 /* Generate a name for a special-purpose function.
8965 The generated name may need to be unique across the whole link.
8966 Changes to this function may also require corresponding changes to
8967 xstrdup_mask_random.
8968 TYPE is some string to identify the purpose of this function to the
8969 linker or collect2; it must start with an uppercase letter,
8971 I - for constructors
8973 N - for C++ anonymous namespaces
8974 F - for DWARF unwind frame information. */
8977 get_file_function_name (const char *type
)
8983 /* If we already have a name we know to be unique, just use that. */
8984 if (first_global_object_name
)
8985 p
= q
= ASTRDUP (first_global_object_name
);
8986 /* If the target is handling the constructors/destructors, they
8987 will be local to this file and the name is only necessary for
8989 We also assign sub_I and sub_D sufixes to constructors called from
8990 the global static constructors. These are always local. */
8991 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
8992 || (strncmp (type
, "sub_", 4) == 0
8993 && (type
[4] == 'I' || type
[4] == 'D')))
8995 const char *file
= main_input_filename
;
8997 file
= LOCATION_FILE (input_location
);
8998 /* Just use the file's basename, because the full pathname
8999 might be quite long. */
9000 p
= q
= ASTRDUP (lbasename (file
));
9004 /* Otherwise, the name must be unique across the entire link.
9005 We don't have anything that we know to be unique to this translation
9006 unit, so use what we do have and throw in some randomness. */
9008 const char *name
= weak_global_object_name
;
9009 const char *file
= main_input_filename
;
9014 file
= LOCATION_FILE (input_location
);
9016 len
= strlen (file
);
9017 q
= (char *) alloca (9 + 19 + len
+ 1);
9018 memcpy (q
, file
, len
+ 1);
9020 snprintf (q
+ len
, 9 + 19 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9021 crc32_string (0, name
), get_random_seed (false));
9026 clean_symbol_name (q
);
9027 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9030 /* Set up the name of the file-level functions we may need.
9031 Use a global object (which is already required to be unique over
9032 the program) rather than the file name (which imposes extra
9034 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9036 return get_identifier (buf
);
9039 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9041 /* Complain that the tree code of NODE does not match the expected 0
9042 terminated list of trailing codes. The trailing code list can be
9043 empty, for a more vague error message. FILE, LINE, and FUNCTION
9044 are of the caller. */
9047 tree_check_failed (const_tree node
, const char *file
,
9048 int line
, const char *function
, ...)
9052 unsigned length
= 0;
9053 enum tree_code code
;
9055 va_start (args
, function
);
9056 while ((code
= (enum tree_code
) va_arg (args
, int)))
9057 length
+= 4 + strlen (get_tree_code_name (code
));
9062 va_start (args
, function
);
9063 length
+= strlen ("expected ");
9064 buffer
= tmp
= (char *) alloca (length
);
9066 while ((code
= (enum tree_code
) va_arg (args
, int)))
9068 const char *prefix
= length
? " or " : "expected ";
9070 strcpy (tmp
+ length
, prefix
);
9071 length
+= strlen (prefix
);
9072 strcpy (tmp
+ length
, get_tree_code_name (code
));
9073 length
+= strlen (get_tree_code_name (code
));
9078 buffer
= "unexpected node";
9080 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9081 buffer
, get_tree_code_name (TREE_CODE (node
)),
9082 function
, trim_filename (file
), line
);
9085 /* Complain that the tree code of NODE does match the expected 0
9086 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9090 tree_not_check_failed (const_tree node
, const char *file
,
9091 int line
, const char *function
, ...)
9095 unsigned length
= 0;
9096 enum tree_code code
;
9098 va_start (args
, function
);
9099 while ((code
= (enum tree_code
) va_arg (args
, int)))
9100 length
+= 4 + strlen (get_tree_code_name (code
));
9102 va_start (args
, function
);
9103 buffer
= (char *) alloca (length
);
9105 while ((code
= (enum tree_code
) va_arg (args
, int)))
9109 strcpy (buffer
+ length
, " or ");
9112 strcpy (buffer
+ length
, get_tree_code_name (code
));
9113 length
+= strlen (get_tree_code_name (code
));
9117 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9118 buffer
, get_tree_code_name (TREE_CODE (node
)),
9119 function
, trim_filename (file
), line
);
9122 /* Similar to tree_check_failed, except that we check for a class of tree
9123 code, given in CL. */
9126 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9127 const char *file
, int line
, const char *function
)
9130 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9131 TREE_CODE_CLASS_STRING (cl
),
9132 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9133 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9136 /* Similar to tree_check_failed, except that instead of specifying a
9137 dozen codes, use the knowledge that they're all sequential. */
9140 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9141 const char *function
, enum tree_code c1
,
9145 unsigned length
= 0;
9148 for (c
= c1
; c
<= c2
; ++c
)
9149 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9151 length
+= strlen ("expected ");
9152 buffer
= (char *) alloca (length
);
9155 for (c
= c1
; c
<= c2
; ++c
)
9157 const char *prefix
= length
? " or " : "expected ";
9159 strcpy (buffer
+ length
, prefix
);
9160 length
+= strlen (prefix
);
9161 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9162 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9165 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9166 buffer
, get_tree_code_name (TREE_CODE (node
)),
9167 function
, trim_filename (file
), line
);
9171 /* Similar to tree_check_failed, except that we check that a tree does
9172 not have the specified code, given in CL. */
9175 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9176 const char *file
, int line
, const char *function
)
9179 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9180 TREE_CODE_CLASS_STRING (cl
),
9181 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9182 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9186 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9189 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9190 const char *function
, enum omp_clause_code code
)
9192 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9193 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9194 function
, trim_filename (file
), line
);
9198 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9201 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9202 const char *function
, enum omp_clause_code c1
,
9203 enum omp_clause_code c2
)
9206 unsigned length
= 0;
9209 for (c
= c1
; c
<= c2
; ++c
)
9210 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9212 length
+= strlen ("expected ");
9213 buffer
= (char *) alloca (length
);
9216 for (c
= c1
; c
<= c2
; ++c
)
9218 const char *prefix
= length
? " or " : "expected ";
9220 strcpy (buffer
+ length
, prefix
);
9221 length
+= strlen (prefix
);
9222 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9223 length
+= strlen (omp_clause_code_name
[c
]);
9226 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9227 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9228 function
, trim_filename (file
), line
);
9232 #undef DEFTREESTRUCT
9233 #define DEFTREESTRUCT(VAL, NAME) NAME,
9235 static const char *ts_enum_names
[] = {
9236 #include "treestruct.def"
9238 #undef DEFTREESTRUCT
9240 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9242 /* Similar to tree_class_check_failed, except that we check for
9243 whether CODE contains the tree structure identified by EN. */
9246 tree_contains_struct_check_failed (const_tree node
,
9247 const enum tree_node_structure_enum en
,
9248 const char *file
, int line
,
9249 const char *function
)
9252 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9254 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9258 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9259 (dynamically sized) vector. */
9262 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9263 const char *function
)
9266 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9267 idx
+ 1, len
, function
, trim_filename (file
), line
);
9270 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9271 (dynamically sized) vector. */
9274 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9275 const char *function
)
9278 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9279 idx
+ 1, len
, function
, trim_filename (file
), line
);
9282 /* Similar to above, except that the check is for the bounds of the operand
9283 vector of an expression node EXP. */
9286 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9287 int line
, const char *function
)
9289 enum tree_code code
= TREE_CODE (exp
);
9291 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9292 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9293 function
, trim_filename (file
), line
);
9296 /* Similar to above, except that the check is for the number of
9297 operands of an OMP_CLAUSE node. */
9300 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9301 int line
, const char *function
)
9304 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9305 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9306 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9307 trim_filename (file
), line
);
9309 #endif /* ENABLE_TREE_CHECKING */
9311 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9312 and mapped to the machine mode MODE. Initialize its fields and build
9313 the information necessary for debugging output. */
9316 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9319 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9321 t
= make_node (VECTOR_TYPE
);
9322 TREE_TYPE (t
) = mv_innertype
;
9323 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9324 SET_TYPE_MODE (t
, mode
);
9326 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9327 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9328 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9329 || mode
!= VOIDmode
)
9330 && !VECTOR_BOOLEAN_TYPE_P (t
))
9332 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9336 hashval_t hash
= type_hash_canon_hash (t
);
9337 t
= type_hash_canon (hash
, t
);
9339 /* We have built a main variant, based on the main variant of the
9340 inner type. Use it to build the variant we return. */
9341 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
9342 && TREE_TYPE (t
) != innertype
)
9343 return build_type_attribute_qual_variant (t
,
9344 TYPE_ATTRIBUTES (innertype
),
9345 TYPE_QUALS (innertype
));
9351 make_or_reuse_type (unsigned size
, int unsignedp
)
9355 if (size
== INT_TYPE_SIZE
)
9356 return unsignedp
? unsigned_type_node
: integer_type_node
;
9357 if (size
== CHAR_TYPE_SIZE
)
9358 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
9359 if (size
== SHORT_TYPE_SIZE
)
9360 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
9361 if (size
== LONG_TYPE_SIZE
)
9362 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
9363 if (size
== LONG_LONG_TYPE_SIZE
)
9364 return (unsignedp
? long_long_unsigned_type_node
9365 : long_long_integer_type_node
);
9367 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9368 if (size
== int_n_data
[i
].bitsize
9369 && int_n_enabled_p
[i
])
9370 return (unsignedp
? int_n_trees
[i
].unsigned_type
9371 : int_n_trees
[i
].signed_type
);
9374 return make_unsigned_type (size
);
9376 return make_signed_type (size
);
9379 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
9382 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
9386 if (size
== SHORT_FRACT_TYPE_SIZE
)
9387 return unsignedp
? sat_unsigned_short_fract_type_node
9388 : sat_short_fract_type_node
;
9389 if (size
== FRACT_TYPE_SIZE
)
9390 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
9391 if (size
== LONG_FRACT_TYPE_SIZE
)
9392 return unsignedp
? sat_unsigned_long_fract_type_node
9393 : sat_long_fract_type_node
;
9394 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9395 return unsignedp
? sat_unsigned_long_long_fract_type_node
9396 : sat_long_long_fract_type_node
;
9400 if (size
== SHORT_FRACT_TYPE_SIZE
)
9401 return unsignedp
? unsigned_short_fract_type_node
9402 : short_fract_type_node
;
9403 if (size
== FRACT_TYPE_SIZE
)
9404 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
9405 if (size
== LONG_FRACT_TYPE_SIZE
)
9406 return unsignedp
? unsigned_long_fract_type_node
9407 : long_fract_type_node
;
9408 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
9409 return unsignedp
? unsigned_long_long_fract_type_node
9410 : long_long_fract_type_node
;
9413 return make_fract_type (size
, unsignedp
, satp
);
9416 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
9419 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
9423 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9424 return unsignedp
? sat_unsigned_short_accum_type_node
9425 : sat_short_accum_type_node
;
9426 if (size
== ACCUM_TYPE_SIZE
)
9427 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
9428 if (size
== LONG_ACCUM_TYPE_SIZE
)
9429 return unsignedp
? sat_unsigned_long_accum_type_node
9430 : sat_long_accum_type_node
;
9431 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9432 return unsignedp
? sat_unsigned_long_long_accum_type_node
9433 : sat_long_long_accum_type_node
;
9437 if (size
== SHORT_ACCUM_TYPE_SIZE
)
9438 return unsignedp
? unsigned_short_accum_type_node
9439 : short_accum_type_node
;
9440 if (size
== ACCUM_TYPE_SIZE
)
9441 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
9442 if (size
== LONG_ACCUM_TYPE_SIZE
)
9443 return unsignedp
? unsigned_long_accum_type_node
9444 : long_accum_type_node
;
9445 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
9446 return unsignedp
? unsigned_long_long_accum_type_node
9447 : long_long_accum_type_node
;
9450 return make_accum_type (size
, unsignedp
, satp
);
9454 /* Create an atomic variant node for TYPE. This routine is called
9455 during initialization of data types to create the 5 basic atomic
9456 types. The generic build_variant_type function requires these to
9457 already be set up in order to function properly, so cannot be
9458 called from there. If ALIGN is non-zero, then ensure alignment is
9459 overridden to this value. */
9462 build_atomic_base (tree type
, unsigned int align
)
9466 /* Make sure its not already registered. */
9467 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
9470 t
= build_variant_type_copy (type
);
9471 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
9474 SET_TYPE_ALIGN (t
, align
);
9479 /* Information about the _FloatN and _FloatNx types. This must be in
9480 the same order as the corresponding TI_* enum values. */
9481 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
9493 /* Create nodes for all integer types (and error_mark_node) using the sizes
9494 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
9497 build_common_tree_nodes (bool signed_char
)
9501 error_mark_node
= make_node (ERROR_MARK
);
9502 TREE_TYPE (error_mark_node
) = error_mark_node
;
9504 initialize_sizetypes ();
9506 /* Define both `signed char' and `unsigned char'. */
9507 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
9508 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
9509 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
9510 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
9512 /* Define `char', which is like either `signed char' or `unsigned char'
9513 but not the same as either. */
9516 ? make_signed_type (CHAR_TYPE_SIZE
)
9517 : make_unsigned_type (CHAR_TYPE_SIZE
));
9518 TYPE_STRING_FLAG (char_type_node
) = 1;
9520 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
9521 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
9522 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
9523 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
9524 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
9525 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
9526 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
9527 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
9529 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9531 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
9532 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
9533 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9534 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
9536 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
9537 && int_n_enabled_p
[i
])
9539 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
9540 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
9544 /* Define a boolean type. This type only represents boolean values but
9545 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
9546 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
9547 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
9548 TYPE_PRECISION (boolean_type_node
) = 1;
9549 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
9551 /* Define what type to use for size_t. */
9552 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
9553 size_type_node
= unsigned_type_node
;
9554 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
9555 size_type_node
= long_unsigned_type_node
;
9556 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
9557 size_type_node
= long_long_unsigned_type_node
;
9558 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
9559 size_type_node
= short_unsigned_type_node
;
9564 size_type_node
= NULL_TREE
;
9565 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9566 if (int_n_enabled_p
[i
])
9569 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
9571 if (strcmp (name
, SIZE_TYPE
) == 0)
9573 size_type_node
= int_n_trees
[i
].unsigned_type
;
9576 if (size_type_node
== NULL_TREE
)
9580 /* Define what type to use for ptrdiff_t. */
9581 if (strcmp (PTRDIFF_TYPE
, "int") == 0)
9582 ptrdiff_type_node
= integer_type_node
;
9583 else if (strcmp (PTRDIFF_TYPE
, "long int") == 0)
9584 ptrdiff_type_node
= long_integer_type_node
;
9585 else if (strcmp (PTRDIFF_TYPE
, "long long int") == 0)
9586 ptrdiff_type_node
= long_long_integer_type_node
;
9587 else if (strcmp (PTRDIFF_TYPE
, "short int") == 0)
9588 ptrdiff_type_node
= short_integer_type_node
;
9591 ptrdiff_type_node
= NULL_TREE
;
9592 for (int i
= 0; i
< NUM_INT_N_ENTS
; i
++)
9593 if (int_n_enabled_p
[i
])
9596 sprintf (name
, "__int%d", int_n_data
[i
].bitsize
);
9597 if (strcmp (name
, PTRDIFF_TYPE
) == 0)
9598 ptrdiff_type_node
= int_n_trees
[i
].signed_type
;
9600 if (ptrdiff_type_node
== NULL_TREE
)
9604 /* Fill in the rest of the sized types. Reuse existing type nodes
9606 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
9607 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
9608 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
9609 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
9610 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
9612 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
9613 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
9614 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
9615 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
9616 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
9618 /* Don't call build_qualified type for atomics. That routine does
9619 special processing for atomics, and until they are initialized
9620 it's better not to make that call.
9622 Check to see if there is a target override for atomic types. */
9624 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
9625 targetm
.atomic_align_for_mode (QImode
));
9626 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
9627 targetm
.atomic_align_for_mode (HImode
));
9628 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
9629 targetm
.atomic_align_for_mode (SImode
));
9630 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
9631 targetm
.atomic_align_for_mode (DImode
));
9632 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
9633 targetm
.atomic_align_for_mode (TImode
));
9635 access_public_node
= get_identifier ("public");
9636 access_protected_node
= get_identifier ("protected");
9637 access_private_node
= get_identifier ("private");
9639 /* Define these next since types below may used them. */
9640 integer_zero_node
= build_int_cst (integer_type_node
, 0);
9641 integer_one_node
= build_int_cst (integer_type_node
, 1);
9642 integer_three_node
= build_int_cst (integer_type_node
, 3);
9643 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
9645 size_zero_node
= size_int (0);
9646 size_one_node
= size_int (1);
9647 bitsize_zero_node
= bitsize_int (0);
9648 bitsize_one_node
= bitsize_int (1);
9649 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
9651 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
9652 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
9654 void_type_node
= make_node (VOID_TYPE
);
9655 layout_type (void_type_node
);
9657 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
9659 /* We are not going to have real types in C with less than byte alignment,
9660 so we might as well not have any types that claim to have it. */
9661 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
9662 TYPE_USER_ALIGN (void_type_node
) = 0;
9664 void_node
= make_node (VOID_CST
);
9665 TREE_TYPE (void_node
) = void_type_node
;
9667 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
9668 layout_type (TREE_TYPE (null_pointer_node
));
9670 ptr_type_node
= build_pointer_type (void_type_node
);
9672 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
9673 for (unsigned i
= 0;
9674 i
< sizeof (builtin_structptr_types
) / sizeof (builtin_structptr_type
);
9676 builtin_structptr_types
[i
].node
= builtin_structptr_types
[i
].base
;
9678 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
9680 float_type_node
= make_node (REAL_TYPE
);
9681 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
9682 layout_type (float_type_node
);
9684 double_type_node
= make_node (REAL_TYPE
);
9685 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
9686 layout_type (double_type_node
);
9688 long_double_type_node
= make_node (REAL_TYPE
);
9689 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
9690 layout_type (long_double_type_node
);
9692 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9694 int n
= floatn_nx_types
[i
].n
;
9695 bool extended
= floatn_nx_types
[i
].extended
;
9696 scalar_float_mode mode
;
9697 if (!targetm
.floatn_mode (n
, extended
).exists (&mode
))
9699 int precision
= GET_MODE_PRECISION (mode
);
9700 /* Work around the rs6000 KFmode having precision 113 not
9702 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
9703 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
9704 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
9706 gcc_assert (min_precision
== n
);
9707 if (precision
< min_precision
)
9708 precision
= min_precision
;
9709 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
9710 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
9711 layout_type (FLOATN_NX_TYPE_NODE (i
));
9712 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
9715 float_ptr_type_node
= build_pointer_type (float_type_node
);
9716 double_ptr_type_node
= build_pointer_type (double_type_node
);
9717 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
9718 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
9720 /* Fixed size integer types. */
9721 uint16_type_node
= make_or_reuse_type (16, 1);
9722 uint32_type_node
= make_or_reuse_type (32, 1);
9723 uint64_type_node
= make_or_reuse_type (64, 1);
9725 /* Decimal float types. */
9726 dfloat32_type_node
= make_node (REAL_TYPE
);
9727 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
9728 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
9729 layout_type (dfloat32_type_node
);
9730 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
9732 dfloat64_type_node
= make_node (REAL_TYPE
);
9733 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
9734 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
9735 layout_type (dfloat64_type_node
);
9736 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
9738 dfloat128_type_node
= make_node (REAL_TYPE
);
9739 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
9740 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
9741 layout_type (dfloat128_type_node
);
9742 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
9744 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
9745 complex_float_type_node
= build_complex_type (float_type_node
, true);
9746 complex_double_type_node
= build_complex_type (double_type_node
, true);
9747 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
9750 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
9752 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
9753 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
9754 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
9757 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
9758 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
9759 sat_ ## KIND ## _type_node = \
9760 make_sat_signed_ ## KIND ## _type (SIZE); \
9761 sat_unsigned_ ## KIND ## _type_node = \
9762 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9763 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9764 unsigned_ ## KIND ## _type_node = \
9765 make_unsigned_ ## KIND ## _type (SIZE);
9767 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
9768 sat_ ## WIDTH ## KIND ## _type_node = \
9769 make_sat_signed_ ## KIND ## _type (SIZE); \
9770 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
9771 make_sat_unsigned_ ## KIND ## _type (SIZE); \
9772 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
9773 unsigned_ ## WIDTH ## KIND ## _type_node = \
9774 make_unsigned_ ## KIND ## _type (SIZE);
9776 /* Make fixed-point type nodes based on four different widths. */
9777 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
9778 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
9779 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
9780 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
9781 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
9783 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
9784 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
9785 NAME ## _type_node = \
9786 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
9787 u ## NAME ## _type_node = \
9788 make_or_reuse_unsigned_ ## KIND ## _type \
9789 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
9790 sat_ ## NAME ## _type_node = \
9791 make_or_reuse_sat_signed_ ## KIND ## _type \
9792 (GET_MODE_BITSIZE (MODE ## mode)); \
9793 sat_u ## NAME ## _type_node = \
9794 make_or_reuse_sat_unsigned_ ## KIND ## _type \
9795 (GET_MODE_BITSIZE (U ## MODE ## mode));
9797 /* Fixed-point type and mode nodes. */
9798 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
9799 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
9800 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
9801 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
9802 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
9803 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
9804 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
9805 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
9806 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
9807 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
9808 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
9811 tree t
= targetm
.build_builtin_va_list ();
9813 /* Many back-ends define record types without setting TYPE_NAME.
9814 If we copied the record type here, we'd keep the original
9815 record type without a name. This breaks name mangling. So,
9816 don't copy record types and let c_common_nodes_and_builtins()
9817 declare the type to be __builtin_va_list. */
9818 if (TREE_CODE (t
) != RECORD_TYPE
)
9819 t
= build_variant_type_copy (t
);
9821 va_list_type_node
= t
;
9825 /* Modify DECL for given flags.
9826 TM_PURE attribute is set only on types, so the function will modify
9827 DECL's type when ECF_TM_PURE is used. */
9830 set_call_expr_flags (tree decl
, int flags
)
9832 if (flags
& ECF_NOTHROW
)
9833 TREE_NOTHROW (decl
) = 1;
9834 if (flags
& ECF_CONST
)
9835 TREE_READONLY (decl
) = 1;
9836 if (flags
& ECF_PURE
)
9837 DECL_PURE_P (decl
) = 1;
9838 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
9839 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
9840 if (flags
& ECF_NOVOPS
)
9841 DECL_IS_NOVOPS (decl
) = 1;
9842 if (flags
& ECF_NORETURN
)
9843 TREE_THIS_VOLATILE (decl
) = 1;
9844 if (flags
& ECF_MALLOC
)
9845 DECL_IS_MALLOC (decl
) = 1;
9846 if (flags
& ECF_RETURNS_TWICE
)
9847 DECL_IS_RETURNS_TWICE (decl
) = 1;
9848 if (flags
& ECF_LEAF
)
9849 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
9850 NULL
, DECL_ATTRIBUTES (decl
));
9851 if (flags
& ECF_COLD
)
9852 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("cold"),
9853 NULL
, DECL_ATTRIBUTES (decl
));
9854 if (flags
& ECF_RET1
)
9855 DECL_ATTRIBUTES (decl
)
9856 = tree_cons (get_identifier ("fn spec"),
9857 build_tree_list (NULL_TREE
, build_string (1, "1")),
9858 DECL_ATTRIBUTES (decl
));
9859 if ((flags
& ECF_TM_PURE
) && flag_tm
)
9860 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
9861 /* Looping const or pure is implied by noreturn.
9862 There is currently no way to declare looping const or looping pure alone. */
9863 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
9864 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
9868 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
9871 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
9872 const char *library_name
, int ecf_flags
)
9876 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
9877 library_name
, NULL_TREE
);
9878 set_call_expr_flags (decl
, ecf_flags
);
9880 set_builtin_decl (code
, decl
, true);
9883 /* Call this function after instantiating all builtins that the language
9884 front end cares about. This will build the rest of the builtins
9885 and internal functions that are relied upon by the tree optimizers and
9889 build_common_builtin_nodes (void)
9894 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
9895 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
9897 ftype
= build_function_type (void_type_node
, void_list_node
);
9898 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
9899 local_define_builtin ("__builtin_unreachable", ftype
,
9900 BUILT_IN_UNREACHABLE
,
9901 "__builtin_unreachable",
9902 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
9903 | ECF_CONST
| ECF_COLD
);
9904 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
9905 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
9907 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
| ECF_COLD
);
9910 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
9911 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9913 ftype
= build_function_type_list (ptr_type_node
,
9914 ptr_type_node
, const_ptr_type_node
,
9915 size_type_node
, NULL_TREE
);
9917 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
9918 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
9919 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9920 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
9921 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
9922 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9925 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
9927 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
9928 const_ptr_type_node
, size_type_node
,
9930 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
9931 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
9934 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
9936 ftype
= build_function_type_list (ptr_type_node
,
9937 ptr_type_node
, integer_type_node
,
9938 size_type_node
, NULL_TREE
);
9939 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
9940 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
9943 /* If we're checking the stack, `alloca' can throw. */
9944 const int alloca_flags
9945 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
9947 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
9949 ftype
= build_function_type_list (ptr_type_node
,
9950 size_type_node
, NULL_TREE
);
9951 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
9952 "alloca", alloca_flags
);
9955 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
9956 size_type_node
, NULL_TREE
);
9957 local_define_builtin ("__builtin_alloca_with_align", ftype
,
9958 BUILT_IN_ALLOCA_WITH_ALIGN
,
9959 "__builtin_alloca_with_align",
9962 ftype
= build_function_type_list (void_type_node
,
9963 ptr_type_node
, ptr_type_node
,
9964 ptr_type_node
, NULL_TREE
);
9965 local_define_builtin ("__builtin_init_trampoline", ftype
,
9966 BUILT_IN_INIT_TRAMPOLINE
,
9967 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
9968 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
9969 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
9970 "__builtin_init_heap_trampoline",
9971 ECF_NOTHROW
| ECF_LEAF
);
9972 local_define_builtin ("__builtin_init_descriptor", ftype
,
9973 BUILT_IN_INIT_DESCRIPTOR
,
9974 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
9976 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
9977 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
9978 BUILT_IN_ADJUST_TRAMPOLINE
,
9979 "__builtin_adjust_trampoline",
9980 ECF_CONST
| ECF_NOTHROW
);
9981 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
9982 BUILT_IN_ADJUST_DESCRIPTOR
,
9983 "__builtin_adjust_descriptor",
9984 ECF_CONST
| ECF_NOTHROW
);
9986 ftype
= build_function_type_list (void_type_node
,
9987 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9988 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
9989 BUILT_IN_NONLOCAL_GOTO
,
9990 "__builtin_nonlocal_goto",
9991 ECF_NORETURN
| ECF_NOTHROW
);
9993 ftype
= build_function_type_list (void_type_node
,
9994 ptr_type_node
, ptr_type_node
, NULL_TREE
);
9995 local_define_builtin ("__builtin_setjmp_setup", ftype
,
9996 BUILT_IN_SETJMP_SETUP
,
9997 "__builtin_setjmp_setup", ECF_NOTHROW
);
9999 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10000 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10001 BUILT_IN_SETJMP_RECEIVER
,
10002 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10004 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10005 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10006 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10008 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10009 local_define_builtin ("__builtin_stack_restore", ftype
,
10010 BUILT_IN_STACK_RESTORE
,
10011 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10013 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10014 const_ptr_type_node
, size_type_node
,
10016 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10017 "__builtin_memcmp_eq",
10018 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10020 /* If there's a possibility that we might use the ARM EABI, build the
10021 alternate __cxa_end_cleanup node used to resume from C++. */
10022 if (targetm
.arm_eabi_unwinder
)
10024 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10025 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10026 BUILT_IN_CXA_END_CLEANUP
,
10027 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10030 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10031 local_define_builtin ("__builtin_unwind_resume", ftype
,
10032 BUILT_IN_UNWIND_RESUME
,
10033 ((targetm_common
.except_unwind_info (&global_options
)
10035 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10038 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10040 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10042 local_define_builtin ("__builtin_return_address", ftype
,
10043 BUILT_IN_RETURN_ADDRESS
,
10044 "__builtin_return_address",
10048 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10049 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10051 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10052 ptr_type_node
, NULL_TREE
);
10053 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10054 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10055 BUILT_IN_PROFILE_FUNC_ENTER
,
10056 "__cyg_profile_func_enter", 0);
10057 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10058 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10059 BUILT_IN_PROFILE_FUNC_EXIT
,
10060 "__cyg_profile_func_exit", 0);
10063 /* The exception object and filter values from the runtime. The argument
10064 must be zero before exception lowering, i.e. from the front end. After
10065 exception lowering, it will be the region number for the exception
10066 landing pad. These functions are PURE instead of CONST to prevent
10067 them from being hoisted past the exception edge that will initialize
10068 its value in the landing pad. */
10069 ftype
= build_function_type_list (ptr_type_node
,
10070 integer_type_node
, NULL_TREE
);
10071 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10072 /* Only use TM_PURE if we have TM language support. */
10073 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10074 ecf_flags
|= ECF_TM_PURE
;
10075 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10076 "__builtin_eh_pointer", ecf_flags
);
10078 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10079 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10080 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10081 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10083 ftype
= build_function_type_list (void_type_node
,
10084 integer_type_node
, integer_type_node
,
10086 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10087 BUILT_IN_EH_COPY_VALUES
,
10088 "__builtin_eh_copy_values", ECF_NOTHROW
);
10090 /* Complex multiplication and division. These are handled as builtins
10091 rather than optabs because emit_library_call_value doesn't support
10092 complex. Further, we can do slightly better with folding these
10093 beasties if the real and complex parts of the arguments are separate. */
10097 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10099 char mode_name_buf
[4], *q
;
10101 enum built_in_function mcode
, dcode
;
10102 tree type
, inner_type
;
10103 const char *prefix
= "__";
10105 if (targetm
.libfunc_gnu_prefix
)
10108 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10111 inner_type
= TREE_TYPE (type
);
10113 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10114 inner_type
, inner_type
, NULL_TREE
);
10116 mcode
= ((enum built_in_function
)
10117 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10118 dcode
= ((enum built_in_function
)
10119 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10121 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10125 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10127 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10128 built_in_names
[mcode
],
10129 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10131 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10133 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10134 built_in_names
[dcode
],
10135 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10139 init_internal_fns ();
10142 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10145 If we requested a pointer to a vector, build up the pointers that
10146 we stripped off while looking for the inner type. Similarly for
10147 return values from functions.
10149 The argument TYPE is the top of the chain, and BOTTOM is the
10150 new type which we will point to. */
10153 reconstruct_complex_type (tree type
, tree bottom
)
10157 if (TREE_CODE (type
) == POINTER_TYPE
)
10159 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10160 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10161 TYPE_REF_CAN_ALIAS_ALL (type
));
10163 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10165 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10166 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10167 TYPE_REF_CAN_ALIAS_ALL (type
));
10169 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10171 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10172 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10174 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10176 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10177 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10179 else if (TREE_CODE (type
) == METHOD_TYPE
)
10181 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10182 /* The build_method_type_directly() routine prepends 'this' to argument list,
10183 so we must compensate by getting rid of it. */
10185 = build_method_type_directly
10186 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10188 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10190 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10192 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10193 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10198 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10199 TYPE_QUALS (type
));
10202 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10205 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10208 unsigned int bitsize
;
10210 switch (GET_MODE_CLASS (mode
))
10212 case MODE_VECTOR_INT
:
10213 case MODE_VECTOR_FLOAT
:
10214 case MODE_VECTOR_FRACT
:
10215 case MODE_VECTOR_UFRACT
:
10216 case MODE_VECTOR_ACCUM
:
10217 case MODE_VECTOR_UACCUM
:
10218 nunits
= GET_MODE_NUNITS (mode
);
10222 /* Check that there are no leftover bits. */
10223 bitsize
= GET_MODE_BITSIZE (as_a
<scalar_int_mode
> (mode
));
10224 gcc_assert (bitsize
% TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10225 nunits
= bitsize
/ TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10229 gcc_unreachable ();
10232 return make_vector_type (innertype
, nunits
, mode
);
10235 /* Similarly, but takes the inner type and number of units, which must be
10239 build_vector_type (tree innertype
, int nunits
)
10241 return make_vector_type (innertype
, nunits
, VOIDmode
);
10244 /* Build truth vector with specified length and number of units. */
10247 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10249 machine_mode mask_mode
10250 = targetm
.vectorize
.get_mask_mode (nunits
, vector_size
).else_blk ();
10252 unsigned HOST_WIDE_INT vsize
;
10253 if (mask_mode
== BLKmode
)
10254 vsize
= vector_size
* BITS_PER_UNIT
;
10256 vsize
= GET_MODE_BITSIZE (mask_mode
);
10258 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10259 gcc_assert (esize
* nunits
== vsize
);
10261 tree bool_type
= build_nonstandard_boolean_type (esize
);
10263 return make_vector_type (bool_type
, nunits
, mask_mode
);
10266 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10269 build_same_sized_truth_vector_type (tree vectype
)
10271 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10274 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10277 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10279 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10282 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10285 build_opaque_vector_type (tree innertype
, int nunits
)
10287 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10289 /* We always build the non-opaque variant before the opaque one,
10290 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10291 cand
= TYPE_NEXT_VARIANT (t
);
10293 && TYPE_VECTOR_OPAQUE (cand
)
10294 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10296 /* Othewise build a variant type and make sure to queue it after
10297 the non-opaque type. */
10298 cand
= build_distinct_type_copy (t
);
10299 TYPE_VECTOR_OPAQUE (cand
) = true;
10300 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10301 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10302 TYPE_NEXT_VARIANT (t
) = cand
;
10303 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10308 /* Given an initializer INIT, return TRUE if INIT is zero or some
10309 aggregate of zeros. Otherwise return FALSE. */
10311 initializer_zerop (const_tree init
)
10317 switch (TREE_CODE (init
))
10320 return integer_zerop (init
);
10323 /* ??? Note that this is not correct for C4X float formats. There,
10324 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10325 negative exponent. */
10326 return real_zerop (init
)
10327 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10330 return fixed_zerop (init
);
10333 return integer_zerop (init
)
10334 || (real_zerop (init
)
10335 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10336 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10341 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10342 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10349 unsigned HOST_WIDE_INT idx
;
10351 if (TREE_CLOBBER_P (init
))
10353 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10354 if (!initializer_zerop (elt
))
10363 /* We need to loop through all elements to handle cases like
10364 "\0" and "\0foobar". */
10365 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10366 if (TREE_STRING_POINTER (init
)[i
] != '\0')
10377 /* Check if vector VEC consists of all the equal elements and
10378 that the number of elements corresponds to the type of VEC.
10379 The function returns first element of the vector
10380 or NULL_TREE if the vector is not uniform. */
10382 uniform_vector_p (const_tree vec
)
10387 if (vec
== NULL_TREE
)
10390 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
10392 if (TREE_CODE (vec
) == VECTOR_CST
)
10394 first
= VECTOR_CST_ELT (vec
, 0);
10395 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
10396 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
10402 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
10404 first
= error_mark_node
;
10406 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
10413 if (!operand_equal_p (first
, t
, 0))
10416 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
10425 /* Build an empty statement at location LOC. */
10428 build_empty_stmt (location_t loc
)
10430 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
10431 SET_EXPR_LOCATION (t
, loc
);
10436 /* Build an OpenMP clause with code CODE. LOC is the location of the
10440 build_omp_clause (location_t loc
, enum omp_clause_code code
)
10445 length
= omp_clause_num_ops
[code
];
10446 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
10448 record_node_allocation_statistics (OMP_CLAUSE
, size
);
10450 t
= (tree
) ggc_internal_alloc (size
);
10451 memset (t
, 0, size
);
10452 TREE_SET_CODE (t
, OMP_CLAUSE
);
10453 OMP_CLAUSE_SET_CODE (t
, code
);
10454 OMP_CLAUSE_LOCATION (t
) = loc
;
10459 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
10460 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
10461 Except for the CODE and operand count field, other storage for the
10462 object is initialized to zeros. */
10465 build_vl_exp (enum tree_code code
, int len MEM_STAT_DECL
)
10468 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
10470 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
10471 gcc_assert (len
>= 1);
10473 record_node_allocation_statistics (code
, length
);
10475 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
10477 TREE_SET_CODE (t
, code
);
10479 /* Can't use TREE_OPERAND to store the length because if checking is
10480 enabled, it will try to check the length before we store it. :-P */
10481 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
10486 /* Helper function for build_call_* functions; build a CALL_EXPR with
10487 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
10488 the argument slots. */
10491 build_call_1 (tree return_type
, tree fn
, int nargs
)
10495 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
10496 TREE_TYPE (t
) = return_type
;
10497 CALL_EXPR_FN (t
) = fn
;
10498 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
10503 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10504 FN and a null static chain slot. NARGS is the number of call arguments
10505 which are specified as "..." arguments. */
10508 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
10512 va_start (args
, nargs
);
10513 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
10518 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10519 FN and a null static chain slot. NARGS is the number of call arguments
10520 which are specified as a va_list ARGS. */
10523 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
10528 t
= build_call_1 (return_type
, fn
, nargs
);
10529 for (i
= 0; i
< nargs
; i
++)
10530 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
10531 process_call_operands (t
);
10535 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
10536 FN and a null static chain slot. NARGS is the number of call arguments
10537 which are specified as a tree array ARGS. */
10540 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
10541 int nargs
, const tree
*args
)
10546 t
= build_call_1 (return_type
, fn
, nargs
);
10547 for (i
= 0; i
< nargs
; i
++)
10548 CALL_EXPR_ARG (t
, i
) = args
[i
];
10549 process_call_operands (t
);
10550 SET_EXPR_LOCATION (t
, loc
);
10554 /* Like build_call_array, but takes a vec. */
10557 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
10562 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
10563 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
10564 CALL_EXPR_ARG (ret
, ix
) = t
;
10565 process_call_operands (ret
);
10569 /* Conveniently construct a function call expression. FNDECL names the
10570 function to be called and N arguments are passed in the array
10574 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
10576 tree fntype
= TREE_TYPE (fndecl
);
10577 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
10579 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
10582 /* Conveniently construct a function call expression. FNDECL names the
10583 function to be called and the arguments are passed in the vector
10587 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
10589 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
10590 vec_safe_address (vec
));
10594 /* Conveniently construct a function call expression. FNDECL names the
10595 function to be called, N is the number of arguments, and the "..."
10596 parameters are the argument expressions. */
10599 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
10602 tree
*argarray
= XALLOCAVEC (tree
, n
);
10606 for (i
= 0; i
< n
; i
++)
10607 argarray
[i
] = va_arg (ap
, tree
);
10609 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10612 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
10613 varargs macros aren't supported by all bootstrap compilers. */
10616 build_call_expr (tree fndecl
, int n
, ...)
10619 tree
*argarray
= XALLOCAVEC (tree
, n
);
10623 for (i
= 0; i
< n
; i
++)
10624 argarray
[i
] = va_arg (ap
, tree
);
10626 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
10629 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
10630 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
10631 It will get gimplified later into an ordinary internal function. */
10634 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
10635 tree type
, int n
, const tree
*args
)
10637 tree t
= build_call_1 (type
, NULL_TREE
, n
);
10638 for (int i
= 0; i
< n
; ++i
)
10639 CALL_EXPR_ARG (t
, i
) = args
[i
];
10640 SET_EXPR_LOCATION (t
, loc
);
10641 CALL_EXPR_IFN (t
) = ifn
;
10645 /* Build internal call expression. This is just like CALL_EXPR, except
10646 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
10647 internal function. */
10650 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
10651 tree type
, int n
, ...)
10654 tree
*argarray
= XALLOCAVEC (tree
, n
);
10658 for (i
= 0; i
< n
; i
++)
10659 argarray
[i
] = va_arg (ap
, tree
);
10661 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10664 /* Return a function call to FN, if the target is guaranteed to support it,
10667 N is the number of arguments, passed in the "...", and TYPE is the
10668 type of the return value. */
10671 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
10675 tree
*argarray
= XALLOCAVEC (tree
, n
);
10679 for (i
= 0; i
< n
; i
++)
10680 argarray
[i
] = va_arg (ap
, tree
);
10682 if (internal_fn_p (fn
))
10684 internal_fn ifn
= as_internal_fn (fn
);
10685 if (direct_internal_fn_p (ifn
))
10687 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
10688 if (!direct_internal_fn_supported_p (ifn
, types
,
10689 OPTIMIZE_FOR_BOTH
))
10692 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
10696 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
10699 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
10703 /* Create a new constant string literal and return a char* pointer to it.
10704 The STRING_CST value is the LEN characters at STR. */
10706 build_string_literal (int len
, const char *str
)
10708 tree t
, elem
, index
, type
;
10710 t
= build_string (len
, str
);
10711 elem
= build_type_variant (char_type_node
, 1, 0);
10712 index
= build_index_type (size_int (len
- 1));
10713 type
= build_array_type (elem
, index
);
10714 TREE_TYPE (t
) = type
;
10715 TREE_CONSTANT (t
) = 1;
10716 TREE_READONLY (t
) = 1;
10717 TREE_STATIC (t
) = 1;
10719 type
= build_pointer_type (elem
);
10720 t
= build1 (ADDR_EXPR
, type
,
10721 build4 (ARRAY_REF
, elem
,
10722 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
10728 /* Return true if T (assumed to be a DECL) must be assigned a memory
10732 needs_to_live_in_memory (const_tree t
)
10734 return (TREE_ADDRESSABLE (t
)
10735 || is_global_var (t
)
10736 || (TREE_CODE (t
) == RESULT_DECL
10737 && !DECL_BY_REFERENCE (t
)
10738 && aggregate_value_p (t
, current_function_decl
)));
10741 /* Return value of a constant X and sign-extend it. */
10744 int_cst_value (const_tree x
)
10746 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
10747 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
10749 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
10750 gcc_assert (cst_and_fits_in_hwi (x
));
10752 if (bits
< HOST_BITS_PER_WIDE_INT
)
10754 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
10756 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
10758 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
10764 /* If TYPE is an integral or pointer type, return an integer type with
10765 the same precision which is unsigned iff UNSIGNEDP is true, or itself
10766 if TYPE is already an integer type of signedness UNSIGNEDP. */
10769 signed_or_unsigned_type_for (int unsignedp
, tree type
)
10771 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
10774 if (TREE_CODE (type
) == VECTOR_TYPE
)
10776 tree inner
= TREE_TYPE (type
);
10777 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
10780 if (inner
== inner2
)
10782 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
10785 if (!INTEGRAL_TYPE_P (type
)
10786 && !POINTER_TYPE_P (type
)
10787 && TREE_CODE (type
) != OFFSET_TYPE
)
10790 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
10793 /* If TYPE is an integral or pointer type, return an integer type with
10794 the same precision which is unsigned, or itself if TYPE is already an
10795 unsigned integer type. */
10798 unsigned_type_for (tree type
)
10800 return signed_or_unsigned_type_for (1, type
);
10803 /* If TYPE is an integral or pointer type, return an integer type with
10804 the same precision which is signed, or itself if TYPE is already a
10805 signed integer type. */
10808 signed_type_for (tree type
)
10810 return signed_or_unsigned_type_for (0, type
);
10813 /* If TYPE is a vector type, return a signed integer vector type with the
10814 same width and number of subparts. Otherwise return boolean_type_node. */
10817 truth_type_for (tree type
)
10819 if (TREE_CODE (type
) == VECTOR_TYPE
)
10821 if (VECTOR_BOOLEAN_TYPE_P (type
))
10823 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
10824 GET_MODE_SIZE (TYPE_MODE (type
)));
10827 return boolean_type_node
;
10830 /* Returns the largest value obtainable by casting something in INNER type to
10834 upper_bound_in_type (tree outer
, tree inner
)
10836 unsigned int det
= 0;
10837 unsigned oprec
= TYPE_PRECISION (outer
);
10838 unsigned iprec
= TYPE_PRECISION (inner
);
10841 /* Compute a unique number for every combination. */
10842 det
|= (oprec
> iprec
) ? 4 : 0;
10843 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
10844 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
10846 /* Determine the exponent to use. */
10851 /* oprec <= iprec, outer: signed, inner: don't care. */
10856 /* oprec <= iprec, outer: unsigned, inner: don't care. */
10860 /* oprec > iprec, outer: signed, inner: signed. */
10864 /* oprec > iprec, outer: signed, inner: unsigned. */
10868 /* oprec > iprec, outer: unsigned, inner: signed. */
10872 /* oprec > iprec, outer: unsigned, inner: unsigned. */
10876 gcc_unreachable ();
10879 return wide_int_to_tree (outer
,
10880 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
10883 /* Returns the smallest value obtainable by casting something in INNER type to
10887 lower_bound_in_type (tree outer
, tree inner
)
10889 unsigned oprec
= TYPE_PRECISION (outer
);
10890 unsigned iprec
= TYPE_PRECISION (inner
);
10892 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
10894 if (TYPE_UNSIGNED (outer
)
10895 /* If we are widening something of an unsigned type, OUTER type
10896 contains all values of INNER type. In particular, both INNER
10897 and OUTER types have zero in common. */
10898 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
10899 return build_int_cst (outer
, 0);
10902 /* If we are widening a signed type to another signed type, we
10903 want to obtain -2^^(iprec-1). If we are keeping the
10904 precision or narrowing to a signed type, we want to obtain
10906 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
10907 return wide_int_to_tree (outer
,
10908 wi::mask (prec
- 1, true,
10909 TYPE_PRECISION (outer
)));
10913 /* Return nonzero if two operands that are suitable for PHI nodes are
10914 necessarily equal. Specifically, both ARG0 and ARG1 must be either
10915 SSA_NAME or invariant. Note that this is strictly an optimization.
10916 That is, callers of this function can directly call operand_equal_p
10917 and get the same result, only slower. */
10920 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
10924 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
10926 return operand_equal_p (arg0
, arg1
, 0);
10929 /* Returns number of zeros at the end of binary representation of X. */
10932 num_ending_zeros (const_tree x
)
10934 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
10938 #define WALK_SUBTREE(NODE) \
10941 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
10947 /* This is a subroutine of walk_tree that walks field of TYPE that are to
10948 be walked whenever a type is seen in the tree. Rest of operands and return
10949 value are as for walk_tree. */
10952 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
10953 hash_set
<tree
> *pset
, walk_tree_lh lh
)
10955 tree result
= NULL_TREE
;
10957 switch (TREE_CODE (type
))
10960 case REFERENCE_TYPE
:
10962 /* We have to worry about mutually recursive pointers. These can't
10963 be written in C. They can in Ada. It's pathological, but
10964 there's an ACATS test (c38102a) that checks it. Deal with this
10965 by checking if we're pointing to another pointer, that one
10966 points to another pointer, that one does too, and we have no htab.
10967 If so, get a hash table. We check three levels deep to avoid
10968 the cost of the hash table if we don't need one. */
10969 if (POINTER_TYPE_P (TREE_TYPE (type
))
10970 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
10971 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
10974 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
10985 WALK_SUBTREE (TREE_TYPE (type
));
10989 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
10991 /* Fall through. */
10993 case FUNCTION_TYPE
:
10994 WALK_SUBTREE (TREE_TYPE (type
));
10998 /* We never want to walk into default arguments. */
10999 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11000 WALK_SUBTREE (TREE_VALUE (arg
));
11005 /* Don't follow this nodes's type if a pointer for fear that
11006 we'll have infinite recursion. If we have a PSET, then we
11009 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11010 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11011 WALK_SUBTREE (TREE_TYPE (type
));
11012 WALK_SUBTREE (TYPE_DOMAIN (type
));
11016 WALK_SUBTREE (TREE_TYPE (type
));
11017 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11027 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11028 called with the DATA and the address of each sub-tree. If FUNC returns a
11029 non-NULL value, the traversal is stopped, and the value returned by FUNC
11030 is returned. If PSET is non-NULL it is used to record the nodes visited,
11031 and to avoid visiting a node more than once. */
11034 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11035 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11037 enum tree_code code
;
11041 #define WALK_SUBTREE_TAIL(NODE) \
11045 goto tail_recurse; \
11050 /* Skip empty subtrees. */
11054 /* Don't walk the same tree twice, if the user has requested
11055 that we avoid doing so. */
11056 if (pset
&& pset
->add (*tp
))
11059 /* Call the function. */
11061 result
= (*func
) (tp
, &walk_subtrees
, data
);
11063 /* If we found something, return it. */
11067 code
= TREE_CODE (*tp
);
11069 /* Even if we didn't, FUNC may have decided that there was nothing
11070 interesting below this point in the tree. */
11071 if (!walk_subtrees
)
11073 /* But we still need to check our siblings. */
11074 if (code
== TREE_LIST
)
11075 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11076 else if (code
== OMP_CLAUSE
)
11077 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11084 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11085 if (result
|| !walk_subtrees
)
11092 case IDENTIFIER_NODE
:
11099 case PLACEHOLDER_EXPR
:
11103 /* None of these have subtrees other than those already walked
11108 WALK_SUBTREE (TREE_VALUE (*tp
));
11109 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11114 int len
= TREE_VEC_LENGTH (*tp
);
11119 /* Walk all elements but the first. */
11121 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11123 /* Now walk the first one as a tail call. */
11124 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11128 WALK_SUBTREE (TREE_REALPART (*tp
));
11129 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11133 unsigned HOST_WIDE_INT idx
;
11134 constructor_elt
*ce
;
11136 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11138 WALK_SUBTREE (ce
->value
);
11143 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11148 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11150 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11151 into declarations that are just mentioned, rather than
11152 declared; they don't really belong to this part of the tree.
11153 And, we can see cycles: the initializer for a declaration
11154 can refer to the declaration itself. */
11155 WALK_SUBTREE (DECL_INITIAL (decl
));
11156 WALK_SUBTREE (DECL_SIZE (decl
));
11157 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11159 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11162 case STATEMENT_LIST
:
11164 tree_stmt_iterator i
;
11165 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11166 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11171 switch (OMP_CLAUSE_CODE (*tp
))
11173 case OMP_CLAUSE_GANG
:
11174 case OMP_CLAUSE__GRIDDIM_
:
11175 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11178 case OMP_CLAUSE_ASYNC
:
11179 case OMP_CLAUSE_WAIT
:
11180 case OMP_CLAUSE_WORKER
:
11181 case OMP_CLAUSE_VECTOR
:
11182 case OMP_CLAUSE_NUM_GANGS
:
11183 case OMP_CLAUSE_NUM_WORKERS
:
11184 case OMP_CLAUSE_VECTOR_LENGTH
:
11185 case OMP_CLAUSE_PRIVATE
:
11186 case OMP_CLAUSE_SHARED
:
11187 case OMP_CLAUSE_FIRSTPRIVATE
:
11188 case OMP_CLAUSE_COPYIN
:
11189 case OMP_CLAUSE_COPYPRIVATE
:
11190 case OMP_CLAUSE_FINAL
:
11191 case OMP_CLAUSE_IF
:
11192 case OMP_CLAUSE_NUM_THREADS
:
11193 case OMP_CLAUSE_SCHEDULE
:
11194 case OMP_CLAUSE_UNIFORM
:
11195 case OMP_CLAUSE_DEPEND
:
11196 case OMP_CLAUSE_NUM_TEAMS
:
11197 case OMP_CLAUSE_THREAD_LIMIT
:
11198 case OMP_CLAUSE_DEVICE
:
11199 case OMP_CLAUSE_DIST_SCHEDULE
:
11200 case OMP_CLAUSE_SAFELEN
:
11201 case OMP_CLAUSE_SIMDLEN
:
11202 case OMP_CLAUSE_ORDERED
:
11203 case OMP_CLAUSE_PRIORITY
:
11204 case OMP_CLAUSE_GRAINSIZE
:
11205 case OMP_CLAUSE_NUM_TASKS
:
11206 case OMP_CLAUSE_HINT
:
11207 case OMP_CLAUSE_TO_DECLARE
:
11208 case OMP_CLAUSE_LINK
:
11209 case OMP_CLAUSE_USE_DEVICE_PTR
:
11210 case OMP_CLAUSE_IS_DEVICE_PTR
:
11211 case OMP_CLAUSE__LOOPTEMP_
:
11212 case OMP_CLAUSE__SIMDUID_
:
11213 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11214 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11217 case OMP_CLAUSE_INDEPENDENT
:
11218 case OMP_CLAUSE_NOWAIT
:
11219 case OMP_CLAUSE_DEFAULT
:
11220 case OMP_CLAUSE_UNTIED
:
11221 case OMP_CLAUSE_MERGEABLE
:
11222 case OMP_CLAUSE_PROC_BIND
:
11223 case OMP_CLAUSE_INBRANCH
:
11224 case OMP_CLAUSE_NOTINBRANCH
:
11225 case OMP_CLAUSE_FOR
:
11226 case OMP_CLAUSE_PARALLEL
:
11227 case OMP_CLAUSE_SECTIONS
:
11228 case OMP_CLAUSE_TASKGROUP
:
11229 case OMP_CLAUSE_NOGROUP
:
11230 case OMP_CLAUSE_THREADS
:
11231 case OMP_CLAUSE_SIMD
:
11232 case OMP_CLAUSE_DEFAULTMAP
:
11233 case OMP_CLAUSE_AUTO
:
11234 case OMP_CLAUSE_SEQ
:
11235 case OMP_CLAUSE_TILE
:
11236 case OMP_CLAUSE__SIMT_
:
11237 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11239 case OMP_CLAUSE_LASTPRIVATE
:
11240 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11241 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11242 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11244 case OMP_CLAUSE_COLLAPSE
:
11247 for (i
= 0; i
< 3; i
++)
11248 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11249 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11252 case OMP_CLAUSE_LINEAR
:
11253 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11254 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11255 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11256 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11258 case OMP_CLAUSE_ALIGNED
:
11259 case OMP_CLAUSE_FROM
:
11260 case OMP_CLAUSE_TO
:
11261 case OMP_CLAUSE_MAP
:
11262 case OMP_CLAUSE__CACHE_
:
11263 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11264 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11265 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11267 case OMP_CLAUSE_REDUCTION
:
11270 for (i
= 0; i
< 5; i
++)
11271 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11272 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11276 gcc_unreachable ();
11284 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11285 But, we only want to walk once. */
11286 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11287 for (i
= 0; i
< len
; ++i
)
11288 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11289 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11293 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11294 defining. We only want to walk into these fields of a type in this
11295 case and not in the general case of a mere reference to the type.
11297 The criterion is as follows: if the field can be an expression, it
11298 must be walked only here. This should be in keeping with the fields
11299 that are directly gimplified in gimplify_type_sizes in order for the
11300 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11301 variable-sized types.
11303 Note that DECLs get walked as part of processing the BIND_EXPR. */
11304 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11306 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11307 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11310 /* Call the function for the type. See if it returns anything or
11311 doesn't want us to continue. If we are to continue, walk both
11312 the normal fields and those for the declaration case. */
11313 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11314 if (result
|| !walk_subtrees
)
11317 /* But do not walk a pointed-to type since it may itself need to
11318 be walked in the declaration case if it isn't anonymous. */
11319 if (!POINTER_TYPE_P (*type_p
))
11321 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11326 /* If this is a record type, also walk the fields. */
11327 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11331 for (field
= TYPE_FIELDS (*type_p
); field
;
11332 field
= DECL_CHAIN (field
))
11334 /* We'd like to look at the type of the field, but we can
11335 easily get infinite recursion. So assume it's pointed
11336 to elsewhere in the tree. Also, ignore things that
11338 if (TREE_CODE (field
) != FIELD_DECL
)
11341 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11342 WALK_SUBTREE (DECL_SIZE (field
));
11343 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11344 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11345 WALK_SUBTREE (DECL_QUALIFIER (field
));
11349 /* Same for scalar types. */
11350 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11351 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11352 || TREE_CODE (*type_p
) == INTEGER_TYPE
11353 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11354 || TREE_CODE (*type_p
) == REAL_TYPE
)
11356 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11357 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11360 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11361 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11366 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11370 /* Walk over all the sub-trees of this operand. */
11371 len
= TREE_OPERAND_LENGTH (*tp
);
11373 /* Go through the subtrees. We need to do this in forward order so
11374 that the scope of a FOR_EXPR is handled properly. */
11377 for (i
= 0; i
< len
- 1; ++i
)
11378 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11379 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
11382 /* If this is a type, walk the needed fields in the type. */
11383 else if (TYPE_P (*tp
))
11384 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
11388 /* We didn't find what we were looking for. */
11391 #undef WALK_SUBTREE_TAIL
11393 #undef WALK_SUBTREE
11395 /* Like walk_tree, but does not walk duplicate nodes more than once. */
11398 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11403 hash_set
<tree
> pset
;
11404 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
11410 tree_block (tree t
)
11412 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11414 if (IS_EXPR_CODE_CLASS (c
))
11415 return LOCATION_BLOCK (t
->exp
.locus
);
11416 gcc_unreachable ();
11421 tree_set_block (tree t
, tree b
)
11423 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
11425 if (IS_EXPR_CODE_CLASS (c
))
11427 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
11430 gcc_unreachable ();
11433 /* Create a nameless artificial label and put it in the current
11434 function context. The label has a location of LOC. Returns the
11435 newly created label. */
11438 create_artificial_label (location_t loc
)
11440 tree lab
= build_decl (loc
,
11441 LABEL_DECL
, NULL_TREE
, void_type_node
);
11443 DECL_ARTIFICIAL (lab
) = 1;
11444 DECL_IGNORED_P (lab
) = 1;
11445 DECL_CONTEXT (lab
) = current_function_decl
;
11449 /* Given a tree, try to return a useful variable name that we can use
11450 to prefix a temporary that is being assigned the value of the tree.
11451 I.E. given <temp> = &A, return A. */
11456 tree stripped_decl
;
11459 STRIP_NOPS (stripped_decl
);
11460 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
11461 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
11462 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
11464 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
11467 return IDENTIFIER_POINTER (name
);
11471 switch (TREE_CODE (stripped_decl
))
11474 return get_name (TREE_OPERAND (stripped_decl
, 0));
11481 /* Return true if TYPE has a variable argument list. */
11484 stdarg_p (const_tree fntype
)
11486 function_args_iterator args_iter
;
11487 tree n
= NULL_TREE
, t
;
11492 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
11497 return n
!= NULL_TREE
&& n
!= void_type_node
;
11500 /* Return true if TYPE has a prototype. */
11503 prototype_p (const_tree fntype
)
11507 gcc_assert (fntype
!= NULL_TREE
);
11509 t
= TYPE_ARG_TYPES (fntype
);
11510 return (t
!= NULL_TREE
);
11513 /* If BLOCK is inlined from an __attribute__((__artificial__))
11514 routine, return pointer to location from where it has been
11517 block_nonartificial_location (tree block
)
11519 location_t
*ret
= NULL
;
11521 while (block
&& TREE_CODE (block
) == BLOCK
11522 && BLOCK_ABSTRACT_ORIGIN (block
))
11524 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
11526 while (TREE_CODE (ao
) == BLOCK
11527 && BLOCK_ABSTRACT_ORIGIN (ao
)
11528 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
11529 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
11531 if (TREE_CODE (ao
) == FUNCTION_DECL
)
11533 /* If AO is an artificial inline, point RET to the
11534 call site locus at which it has been inlined and continue
11535 the loop, in case AO's caller is also an artificial
11537 if (DECL_DECLARED_INLINE_P (ao
)
11538 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
11539 ret
= &BLOCK_SOURCE_LOCATION (block
);
11543 else if (TREE_CODE (ao
) != BLOCK
)
11546 block
= BLOCK_SUPERCONTEXT (block
);
11552 /* If EXP is inlined from an __attribute__((__artificial__))
11553 function, return the location of the original call expression. */
11556 tree_nonartificial_location (tree exp
)
11558 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
11563 return EXPR_LOCATION (exp
);
11567 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
11570 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
11573 cl_option_hasher::hash (tree x
)
11575 const_tree
const t
= x
;
11579 hashval_t hash
= 0;
11581 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
11583 p
= (const char *)TREE_OPTIMIZATION (t
);
11584 len
= sizeof (struct cl_optimization
);
11587 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
11588 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
11591 gcc_unreachable ();
11593 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
11595 for (i
= 0; i
< len
; i
++)
11597 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
11602 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
11603 TARGET_OPTION tree node) is the same as that given by *Y, which is the
11607 cl_option_hasher::equal (tree x
, tree y
)
11609 const_tree
const xt
= x
;
11610 const_tree
const yt
= y
;
11615 if (TREE_CODE (xt
) != TREE_CODE (yt
))
11618 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
11620 xp
= (const char *)TREE_OPTIMIZATION (xt
);
11621 yp
= (const char *)TREE_OPTIMIZATION (yt
);
11622 len
= sizeof (struct cl_optimization
);
11625 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
11627 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
11628 TREE_TARGET_OPTION (yt
));
11632 gcc_unreachable ();
11634 return (memcmp (xp
, yp
, len
) == 0);
11637 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
11640 build_optimization_node (struct gcc_options
*opts
)
11644 /* Use the cache of optimization nodes. */
11646 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
11649 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
11653 /* Insert this one into the hash table. */
11654 t
= cl_optimization_node
;
11657 /* Make a new node for next time round. */
11658 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
11664 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
11667 build_target_option_node (struct gcc_options
*opts
)
11671 /* Use the cache of optimization nodes. */
11673 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
11676 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
11680 /* Insert this one into the hash table. */
11681 t
= cl_target_option_node
;
11684 /* Make a new node for next time round. */
11685 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
11691 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
11692 so that they aren't saved during PCH writing. */
11695 prepare_target_option_nodes_for_pch (void)
11697 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
11698 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
11699 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
11700 TREE_TARGET_GLOBALS (*iter
) = NULL
;
11703 /* Determine the "ultimate origin" of a block. The block may be an inlined
11704 instance of an inlined instance of a block which is local to an inline
11705 function, so we have to trace all of the way back through the origin chain
11706 to find out what sort of node actually served as the original seed for the
11710 block_ultimate_origin (const_tree block
)
11712 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
11714 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
11715 we're trying to output the abstract instance of this function. */
11716 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
11719 if (immediate_origin
== NULL_TREE
)
11724 tree lookahead
= immediate_origin
;
11728 ret_val
= lookahead
;
11729 lookahead
= (TREE_CODE (ret_val
) == BLOCK
11730 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
11732 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
11734 /* The block's abstract origin chain may not be the *ultimate* origin of
11735 the block. It could lead to a DECL that has an abstract origin set.
11736 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
11737 will give us if it has one). Note that DECL's abstract origins are
11738 supposed to be the most distant ancestor (or so decl_ultimate_origin
11739 claims), so we don't need to loop following the DECL origins. */
11740 if (DECL_P (ret_val
))
11741 return DECL_ORIGIN (ret_val
);
11747 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
11751 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
11753 /* Do not strip casts into or out of differing address spaces. */
11754 if (POINTER_TYPE_P (outer_type
)
11755 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
11757 if (!POINTER_TYPE_P (inner_type
)
11758 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
11759 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
11762 else if (POINTER_TYPE_P (inner_type
)
11763 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
11765 /* We already know that outer_type is not a pointer with
11766 a non-generic address space. */
11770 /* Use precision rather then machine mode when we can, which gives
11771 the correct answer even for submode (bit-field) types. */
11772 if ((INTEGRAL_TYPE_P (outer_type
)
11773 || POINTER_TYPE_P (outer_type
)
11774 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
11775 && (INTEGRAL_TYPE_P (inner_type
)
11776 || POINTER_TYPE_P (inner_type
)
11777 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
11778 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
11780 /* Otherwise fall back on comparing machine modes (e.g. for
11781 aggregate types, floats). */
11782 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
11785 /* Return true iff conversion in EXP generates no instruction. Mark
11786 it inline so that we fully inline into the stripping functions even
11787 though we have two uses of this function. */
11790 tree_nop_conversion (const_tree exp
)
11792 tree outer_type
, inner_type
;
11794 if (!CONVERT_EXPR_P (exp
)
11795 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
11797 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
11800 outer_type
= TREE_TYPE (exp
);
11801 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11806 return tree_nop_conversion_p (outer_type
, inner_type
);
11809 /* Return true iff conversion in EXP generates no instruction. Don't
11810 consider conversions changing the signedness. */
11813 tree_sign_nop_conversion (const_tree exp
)
11815 tree outer_type
, inner_type
;
11817 if (!tree_nop_conversion (exp
))
11820 outer_type
= TREE_TYPE (exp
);
11821 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
11823 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
11824 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
11827 /* Strip conversions from EXP according to tree_nop_conversion and
11828 return the resulting expression. */
11831 tree_strip_nop_conversions (tree exp
)
11833 while (tree_nop_conversion (exp
))
11834 exp
= TREE_OPERAND (exp
, 0);
11838 /* Strip conversions from EXP according to tree_sign_nop_conversion
11839 and return the resulting expression. */
11842 tree_strip_sign_nop_conversions (tree exp
)
11844 while (tree_sign_nop_conversion (exp
))
11845 exp
= TREE_OPERAND (exp
, 0);
11849 /* Avoid any floating point extensions from EXP. */
11851 strip_float_extensions (tree exp
)
11853 tree sub
, expt
, subt
;
11855 /* For floating point constant look up the narrowest type that can hold
11856 it properly and handle it like (type)(narrowest_type)constant.
11857 This way we can optimize for instance a=a*2.0 where "a" is float
11858 but 2.0 is double constant. */
11859 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
11861 REAL_VALUE_TYPE orig
;
11864 orig
= TREE_REAL_CST (exp
);
11865 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
11866 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
11867 type
= float_type_node
;
11868 else if (TYPE_PRECISION (TREE_TYPE (exp
))
11869 > TYPE_PRECISION (double_type_node
)
11870 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
11871 type
= double_type_node
;
11873 return build_real_truncate (type
, orig
);
11876 if (!CONVERT_EXPR_P (exp
))
11879 sub
= TREE_OPERAND (exp
, 0);
11880 subt
= TREE_TYPE (sub
);
11881 expt
= TREE_TYPE (exp
);
11883 if (!FLOAT_TYPE_P (subt
))
11886 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
11889 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
11892 return strip_float_extensions (sub
);
11895 /* Strip out all handled components that produce invariant
11899 strip_invariant_refs (const_tree op
)
11901 while (handled_component_p (op
))
11903 switch (TREE_CODE (op
))
11906 case ARRAY_RANGE_REF
:
11907 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
11908 || TREE_OPERAND (op
, 2) != NULL_TREE
11909 || TREE_OPERAND (op
, 3) != NULL_TREE
)
11913 case COMPONENT_REF
:
11914 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
11920 op
= TREE_OPERAND (op
, 0);
11926 static GTY(()) tree gcc_eh_personality_decl
;
11928 /* Return the GCC personality function decl. */
11931 lhd_gcc_personality (void)
11933 if (!gcc_eh_personality_decl
)
11934 gcc_eh_personality_decl
= build_personality_function ("gcc");
11935 return gcc_eh_personality_decl
;
11938 /* TARGET is a call target of GIMPLE call statement
11939 (obtained by gimple_call_fn). Return true if it is
11940 OBJ_TYPE_REF representing an virtual call of C++ method.
11941 (As opposed to OBJ_TYPE_REF representing objc calls
11942 through a cast where middle-end devirtualization machinery
11946 virtual_method_call_p (const_tree target
)
11948 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
11950 tree t
= TREE_TYPE (target
);
11951 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
11953 if (TREE_CODE (t
) == FUNCTION_TYPE
)
11955 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
11956 /* If we do not have BINFO associated, it means that type was built
11957 without devirtualization enabled. Do not consider this a virtual
11959 if (!TYPE_BINFO (obj_type_ref_class (target
)))
11964 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
11967 obj_type_ref_class (const_tree ref
)
11969 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
11970 ref
= TREE_TYPE (ref
);
11971 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11972 ref
= TREE_TYPE (ref
);
11973 /* We look for type THIS points to. ObjC also builds
11974 OBJ_TYPE_REF with non-method calls, Their first parameter
11975 ID however also corresponds to class type. */
11976 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
11977 || TREE_CODE (ref
) == FUNCTION_TYPE
);
11978 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
11979 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
11980 return TREE_TYPE (ref
);
11983 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
11986 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
11989 tree base_binfo
, b
;
11991 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
11992 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
11993 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
11995 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12000 /* Try to find a base info of BINFO that would have its field decl at offset
12001 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12002 found, return, otherwise return NULL_TREE. */
12005 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12007 tree type
= BINFO_TYPE (binfo
);
12011 HOST_WIDE_INT pos
, size
;
12015 if (types_same_for_odr (type
, expected_type
))
12020 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12022 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12025 pos
= int_bit_position (fld
);
12026 size
= tree_to_uhwi (DECL_SIZE (fld
));
12027 if (pos
<= offset
&& (pos
+ size
) > offset
)
12030 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12033 /* Offset 0 indicates the primary base, whose vtable contents are
12034 represented in the binfo for the derived class. */
12035 else if (offset
!= 0)
12037 tree found_binfo
= NULL
, base_binfo
;
12038 /* Offsets in BINFO are in bytes relative to the whole structure
12039 while POS is in bits relative to the containing field. */
12040 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12043 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12044 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12045 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12047 found_binfo
= base_binfo
;
12051 binfo
= found_binfo
;
12053 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12057 type
= TREE_TYPE (fld
);
12062 /* Returns true if X is a typedef decl. */
12065 is_typedef_decl (const_tree x
)
12067 return (x
&& TREE_CODE (x
) == TYPE_DECL
12068 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12071 /* Returns true iff TYPE is a type variant created for a typedef. */
12074 typedef_variant_p (const_tree type
)
12076 return is_typedef_decl (TYPE_NAME (type
));
12079 /* Warn about a use of an identifier which was marked deprecated. */
12081 warn_deprecated_use (tree node
, tree attr
)
12085 if (node
== 0 || !warn_deprecated_decl
)
12091 attr
= DECL_ATTRIBUTES (node
);
12092 else if (TYPE_P (node
))
12094 tree decl
= TYPE_STUB_DECL (node
);
12096 attr
= lookup_attribute ("deprecated",
12097 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12102 attr
= lookup_attribute ("deprecated", attr
);
12105 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12113 w
= warning (OPT_Wdeprecated_declarations
,
12114 "%qD is deprecated: %s", node
, msg
);
12116 w
= warning (OPT_Wdeprecated_declarations
,
12117 "%qD is deprecated", node
);
12119 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12121 else if (TYPE_P (node
))
12123 tree what
= NULL_TREE
;
12124 tree decl
= TYPE_STUB_DECL (node
);
12126 if (TYPE_NAME (node
))
12128 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12129 what
= TYPE_NAME (node
);
12130 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12131 && DECL_NAME (TYPE_NAME (node
)))
12132 what
= DECL_NAME (TYPE_NAME (node
));
12140 w
= warning (OPT_Wdeprecated_declarations
,
12141 "%qE is deprecated: %s", what
, msg
);
12143 w
= warning (OPT_Wdeprecated_declarations
,
12144 "%qE is deprecated", what
);
12149 w
= warning (OPT_Wdeprecated_declarations
,
12150 "type is deprecated: %s", msg
);
12152 w
= warning (OPT_Wdeprecated_declarations
,
12153 "type is deprecated");
12156 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12163 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12166 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12171 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12174 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12180 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12181 somewhere in it. */
12184 contains_bitfld_component_ref_p (const_tree ref
)
12186 while (handled_component_p (ref
))
12188 if (TREE_CODE (ref
) == COMPONENT_REF
12189 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12191 ref
= TREE_OPERAND (ref
, 0);
12197 /* Try to determine whether a TRY_CATCH expression can fall through.
12198 This is a subroutine of block_may_fallthru. */
12201 try_catch_may_fallthru (const_tree stmt
)
12203 tree_stmt_iterator i
;
12205 /* If the TRY block can fall through, the whole TRY_CATCH can
12207 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12210 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12211 switch (TREE_CODE (tsi_stmt (i
)))
12214 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12215 catch expression and a body. The whole TRY_CATCH may fall
12216 through iff any of the catch bodies falls through. */
12217 for (; !tsi_end_p (i
); tsi_next (&i
))
12219 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12224 case EH_FILTER_EXPR
:
12225 /* The exception filter expression only matters if there is an
12226 exception. If the exception does not match EH_FILTER_TYPES,
12227 we will execute EH_FILTER_FAILURE, and we will fall through
12228 if that falls through. If the exception does match
12229 EH_FILTER_TYPES, the stack unwinder will continue up the
12230 stack, so we will not fall through. We don't know whether we
12231 will throw an exception which matches EH_FILTER_TYPES or not,
12232 so we just ignore EH_FILTER_TYPES and assume that we might
12233 throw an exception which doesn't match. */
12234 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12237 /* This case represents statements to be executed when an
12238 exception occurs. Those statements are implicitly followed
12239 by a RESX statement to resume execution after the exception.
12240 So in this case the TRY_CATCH never falls through. */
12245 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12246 need not be 100% accurate; simply be conservative and return true if we
12247 don't know. This is used only to avoid stupidly generating extra code.
12248 If we're wrong, we'll just delete the extra code later. */
12251 block_may_fallthru (const_tree block
)
12253 /* This CONST_CAST is okay because expr_last returns its argument
12254 unmodified and we assign it to a const_tree. */
12255 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12257 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12261 /* Easy cases. If the last statement of the block implies
12262 control transfer, then we can't fall through. */
12266 /* If SWITCH_LABELS is set, this is lowered, and represents a
12267 branch to a selected label and hence can not fall through.
12268 Otherwise SWITCH_BODY is set, and the switch can fall
12270 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12273 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12275 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12278 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12280 case TRY_CATCH_EXPR
:
12281 return try_catch_may_fallthru (stmt
);
12283 case TRY_FINALLY_EXPR
:
12284 /* The finally clause is always executed after the try clause,
12285 so if it does not fall through, then the try-finally will not
12286 fall through. Otherwise, if the try clause does not fall
12287 through, then when the finally clause falls through it will
12288 resume execution wherever the try clause was going. So the
12289 whole try-finally will only fall through if both the try
12290 clause and the finally clause fall through. */
12291 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12292 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12295 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12296 stmt
= TREE_OPERAND (stmt
, 1);
12302 /* Functions that do not return do not fall through. */
12303 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12305 case CLEANUP_POINT_EXPR
:
12306 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12309 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12315 return lang_hooks
.block_may_fallthru (stmt
);
12319 /* True if we are using EH to handle cleanups. */
12320 static bool using_eh_for_cleanups_flag
= false;
12322 /* This routine is called from front ends to indicate eh should be used for
12325 using_eh_for_cleanups (void)
12327 using_eh_for_cleanups_flag
= true;
12330 /* Query whether EH is used for cleanups. */
12332 using_eh_for_cleanups_p (void)
12334 return using_eh_for_cleanups_flag
;
12337 /* Wrapper for tree_code_name to ensure that tree code is valid */
12339 get_tree_code_name (enum tree_code code
)
12341 const char *invalid
= "<invalid tree code>";
12343 if (code
>= MAX_TREE_CODES
)
12346 return tree_code_name
[code
];
12349 /* Drops the TREE_OVERFLOW flag from T. */
12352 drop_tree_overflow (tree t
)
12354 gcc_checking_assert (TREE_OVERFLOW (t
));
12356 /* For tree codes with a sharing machinery re-build the result. */
12357 if (TREE_CODE (t
) == INTEGER_CST
)
12358 return wide_int_to_tree (TREE_TYPE (t
), t
);
12360 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12361 and drop the flag. */
12363 TREE_OVERFLOW (t
) = 0;
12365 /* For constants that contain nested constants, drop the flag
12366 from those as well. */
12367 if (TREE_CODE (t
) == COMPLEX_CST
)
12369 if (TREE_OVERFLOW (TREE_REALPART (t
)))
12370 TREE_REALPART (t
) = drop_tree_overflow (TREE_REALPART (t
));
12371 if (TREE_OVERFLOW (TREE_IMAGPART (t
)))
12372 TREE_IMAGPART (t
) = drop_tree_overflow (TREE_IMAGPART (t
));
12374 if (TREE_CODE (t
) == VECTOR_CST
)
12376 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
12378 tree
& elt
= VECTOR_CST_ELT (t
, i
);
12379 if (TREE_OVERFLOW (elt
))
12380 elt
= drop_tree_overflow (elt
);
12386 /* Given a memory reference expression T, return its base address.
12387 The base address of a memory reference expression is the main
12388 object being referenced. For instance, the base address for
12389 'array[i].fld[j]' is 'array'. You can think of this as stripping
12390 away the offset part from a memory address.
12392 This function calls handled_component_p to strip away all the inner
12393 parts of the memory reference until it reaches the base object. */
12396 get_base_address (tree t
)
12398 while (handled_component_p (t
))
12399 t
= TREE_OPERAND (t
, 0);
12401 if ((TREE_CODE (t
) == MEM_REF
12402 || TREE_CODE (t
) == TARGET_MEM_REF
)
12403 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
12404 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
12406 /* ??? Either the alias oracle or all callers need to properly deal
12407 with WITH_SIZE_EXPRs before we can look through those. */
12408 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
12414 /* Return a tree of sizetype representing the size, in bytes, of the element
12415 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12418 array_ref_element_size (tree exp
)
12420 tree aligned_size
= TREE_OPERAND (exp
, 3);
12421 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12422 location_t loc
= EXPR_LOCATION (exp
);
12424 /* If a size was specified in the ARRAY_REF, it's the size measured
12425 in alignment units of the element type. So multiply by that value. */
12428 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12429 sizetype from another type of the same width and signedness. */
12430 if (TREE_TYPE (aligned_size
) != sizetype
)
12431 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
12432 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
12433 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
12436 /* Otherwise, take the size from that of the element type. Substitute
12437 any PLACEHOLDER_EXPR that we have. */
12439 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
12442 /* Return a tree representing the lower bound of the array mentioned in
12443 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12446 array_ref_low_bound (tree exp
)
12448 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12450 /* If a lower bound is specified in EXP, use it. */
12451 if (TREE_OPERAND (exp
, 2))
12452 return TREE_OPERAND (exp
, 2);
12454 /* Otherwise, if there is a domain type and it has a lower bound, use it,
12455 substituting for a PLACEHOLDER_EXPR as needed. */
12456 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
12457 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
12459 /* Otherwise, return a zero of the appropriate type. */
12460 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
12463 /* Return a tree representing the upper bound of the array mentioned in
12464 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
12467 array_ref_up_bound (tree exp
)
12469 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
12471 /* If there is a domain type and it has an upper bound, use it, substituting
12472 for a PLACEHOLDER_EXPR as needed. */
12473 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
12474 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
12476 /* Otherwise fail. */
12480 /* Returns true if REF is an array reference or a component reference
12481 to an array at the end of a structure.
12482 If this is the case, the array may be allocated larger
12483 than its upper bound implies. */
12486 array_at_struct_end_p (tree ref
)
12490 if (TREE_CODE (ref
) == ARRAY_REF
12491 || TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12493 atype
= TREE_TYPE (TREE_OPERAND (ref
, 0));
12494 ref
= TREE_OPERAND (ref
, 0);
12496 else if (TREE_CODE (ref
) == COMPONENT_REF
12497 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
)
12498 atype
= TREE_TYPE (TREE_OPERAND (ref
, 1));
12502 while (handled_component_p (ref
))
12504 /* If the reference chain contains a component reference to a
12505 non-union type and there follows another field the reference
12506 is not at the end of a structure. */
12507 if (TREE_CODE (ref
) == COMPONENT_REF
)
12509 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
12511 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
12512 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
12513 nextf
= DECL_CHAIN (nextf
);
12518 /* If we have a multi-dimensional array we do not consider
12519 a non-innermost dimension as flex array if the whole
12520 multi-dimensional array is at struct end.
12521 Same for an array of aggregates with a trailing array
12523 else if (TREE_CODE (ref
) == ARRAY_REF
)
12525 else if (TREE_CODE (ref
) == ARRAY_RANGE_REF
)
12527 /* If we view an underlying object as sth else then what we
12528 gathered up to now is what we have to rely on. */
12529 else if (TREE_CODE (ref
) == VIEW_CONVERT_EXPR
)
12532 gcc_unreachable ();
12534 ref
= TREE_OPERAND (ref
, 0);
12537 /* The array now is at struct end. Treat flexible arrays as
12538 always subject to extend, even into just padding constrained by
12539 an underlying decl. */
12540 if (! TYPE_SIZE (atype
))
12545 if (TREE_CODE (ref
) == MEM_REF
12546 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
12548 size
= TYPE_SIZE (TREE_TYPE (ref
));
12549 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
12552 /* If the reference is based on a declared entity, the size of the array
12553 is constrained by its given domain. (Do not trust commons PR/69368). */
12555 /* Be sure the size of MEM_REF target match. For example:
12558 struct foo *str = (struct foo *)&buf;
12560 str->trailin_array[2] = 1;
12562 is valid because BUF allocate enough space. */
12564 && (!size
|| (DECL_SIZE (ref
) != NULL
12565 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
12566 && !(flag_unconstrained_commons
12567 && VAR_P (ref
) && DECL_COMMON (ref
)))
12573 /* Return a tree representing the offset, in bytes, of the field referenced
12574 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
12577 component_ref_field_offset (tree exp
)
12579 tree aligned_offset
= TREE_OPERAND (exp
, 2);
12580 tree field
= TREE_OPERAND (exp
, 1);
12581 location_t loc
= EXPR_LOCATION (exp
);
12583 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
12584 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
12586 if (aligned_offset
)
12588 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
12589 sizetype from another type of the same width and signedness. */
12590 if (TREE_TYPE (aligned_offset
) != sizetype
)
12591 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
12592 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
12593 size_int (DECL_OFFSET_ALIGN (field
)
12597 /* Otherwise, take the offset from that of the field. Substitute
12598 any PLACEHOLDER_EXPR that we have. */
12600 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
12603 /* Return the machine mode of T. For vectors, returns the mode of the
12604 inner type. The main use case is to feed the result to HONOR_NANS,
12605 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
12608 element_mode (const_tree t
)
12612 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
12614 return TYPE_MODE (t
);
12617 /* Vector types need to re-check the target flags each time we report
12618 the machine mode. We need to do this because attribute target can
12619 change the result of vector_mode_supported_p and have_regs_of_mode
12620 on a per-function basis. Thus the TYPE_MODE of a VECTOR_TYPE can
12621 change on a per-function basis. */
12622 /* ??? Possibly a better solution is to run through all the types
12623 referenced by a function and re-compute the TYPE_MODE once, rather
12624 than make the TYPE_MODE macro call a function. */
12627 vector_type_mode (const_tree t
)
12631 gcc_assert (TREE_CODE (t
) == VECTOR_TYPE
);
12633 mode
= t
->type_common
.mode
;
12634 if (VECTOR_MODE_P (mode
)
12635 && (!targetm
.vector_mode_supported_p (mode
)
12636 || !have_regs_of_mode
[mode
]))
12638 scalar_int_mode innermode
;
12640 /* For integers, try mapping it to a same-sized scalar mode. */
12641 if (is_int_mode (TREE_TYPE (t
)->type_common
.mode
, &innermode
))
12643 unsigned int size
= (TYPE_VECTOR_SUBPARTS (t
)
12644 * GET_MODE_BITSIZE (innermode
));
12645 scalar_int_mode mode
;
12646 if (int_mode_for_size (size
, 0).exists (&mode
)
12647 && have_regs_of_mode
[mode
])
12657 /* Verify that basic properties of T match TV and thus T can be a variant of
12658 TV. TV should be the more specified variant (i.e. the main variant). */
12661 verify_type_variant (const_tree t
, tree tv
)
12663 /* Type variant can differ by:
12665 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
12666 ENCODE_QUAL_ADDR_SPACE.
12667 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
12668 in this case some values may not be set in the variant types
12669 (see TYPE_COMPLETE_P checks).
12670 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
12671 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
12672 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
12673 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
12674 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
12675 this is necessary to make it possible to merge types form different TUs
12676 - arrays, pointers and references may have TREE_TYPE that is a variant
12677 of TREE_TYPE of their main variants.
12678 - aggregates may have new TYPE_FIELDS list that list variants of
12679 the main variant TYPE_FIELDS.
12680 - vector types may differ by TYPE_VECTOR_OPAQUE
12683 /* Convenience macro for matching individual fields. */
12684 #define verify_variant_match(flag) \
12686 if (flag (tv) != flag (t)) \
12688 error ("type variant differs by " #flag "."); \
12694 /* tree_base checks. */
12696 verify_variant_match (TREE_CODE
);
12697 /* FIXME: Ada builds non-artificial variants of artificial types. */
12698 if (TYPE_ARTIFICIAL (tv
) && 0)
12699 verify_variant_match (TYPE_ARTIFICIAL
);
12700 if (POINTER_TYPE_P (tv
))
12701 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
12702 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
12703 verify_variant_match (TYPE_UNSIGNED
);
12704 verify_variant_match (TYPE_PACKED
);
12705 if (TREE_CODE (t
) == REFERENCE_TYPE
)
12706 verify_variant_match (TYPE_REF_IS_RVALUE
);
12707 if (AGGREGATE_TYPE_P (t
))
12708 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
12710 verify_variant_match (TYPE_SATURATING
);
12711 /* FIXME: This check trigger during libstdc++ build. */
12712 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
12713 verify_variant_match (TYPE_FINAL_P
);
12715 /* tree_type_common checks. */
12717 if (COMPLETE_TYPE_P (t
))
12719 verify_variant_match (TYPE_MODE
);
12720 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
12721 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
12722 verify_variant_match (TYPE_SIZE
);
12723 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
12724 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
12725 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
))
12727 gcc_assert (!operand_equal_p (TYPE_SIZE_UNIT (t
),
12728 TYPE_SIZE_UNIT (tv
), 0));
12729 error ("type variant has different TYPE_SIZE_UNIT");
12731 error ("type variant's TYPE_SIZE_UNIT");
12732 debug_tree (TYPE_SIZE_UNIT (tv
));
12733 error ("type's TYPE_SIZE_UNIT");
12734 debug_tree (TYPE_SIZE_UNIT (t
));
12738 verify_variant_match (TYPE_PRECISION
);
12739 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
12740 if (RECORD_OR_UNION_TYPE_P (t
))
12741 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
12742 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12743 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
12744 /* During LTO we merge variant lists from diferent translation units
12745 that may differ BY TYPE_CONTEXT that in turn may point
12746 to TRANSLATION_UNIT_DECL.
12747 Ada also builds variants of types with different TYPE_CONTEXT. */
12748 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
12749 verify_variant_match (TYPE_CONTEXT
);
12750 verify_variant_match (TYPE_STRING_FLAG
);
12751 if (TYPE_ALIAS_SET_KNOWN_P (t
))
12753 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
12758 /* tree_type_non_common checks. */
12760 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
12761 and dangle the pointer from time to time. */
12762 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
12763 && (in_lto_p
|| !TYPE_VFIELD (tv
)
12764 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
12766 error ("type variant has different TYPE_VFIELD");
12770 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
12771 || TREE_CODE (t
) == INTEGER_TYPE
12772 || TREE_CODE (t
) == BOOLEAN_TYPE
12773 || TREE_CODE (t
) == REAL_TYPE
12774 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
12776 verify_variant_match (TYPE_MAX_VALUE
);
12777 verify_variant_match (TYPE_MIN_VALUE
);
12779 if (TREE_CODE (t
) == METHOD_TYPE
)
12780 verify_variant_match (TYPE_METHOD_BASETYPE
);
12781 if (TREE_CODE (t
) == OFFSET_TYPE
)
12782 verify_variant_match (TYPE_OFFSET_BASETYPE
);
12783 if (TREE_CODE (t
) == ARRAY_TYPE
)
12784 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
12785 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
12786 or even type's main variant. This is needed to make bootstrap pass
12787 and the bug seems new in GCC 5.
12788 C++ FE should be updated to make this consistent and we should check
12789 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
12790 is a match with main variant.
12792 Also disable the check for Java for now because of parser hack that builds
12793 first an dummy BINFO and then sometimes replace it by real BINFO in some
12795 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
12796 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
12797 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
12798 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
12799 at LTO time only. */
12800 && (in_lto_p
&& odr_type_p (t
)))
12802 error ("type variant has different TYPE_BINFO");
12804 error ("type variant's TYPE_BINFO");
12805 debug_tree (TYPE_BINFO (tv
));
12806 error ("type's TYPE_BINFO");
12807 debug_tree (TYPE_BINFO (t
));
12811 /* Check various uses of TYPE_VALUES_RAW. */
12812 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
12813 verify_variant_match (TYPE_VALUES
);
12814 else if (TREE_CODE (t
) == ARRAY_TYPE
)
12815 verify_variant_match (TYPE_DOMAIN
);
12816 /* Permit incomplete variants of complete type. While FEs may complete
12817 all variants, this does not happen for C++ templates in all cases. */
12818 else if (RECORD_OR_UNION_TYPE_P (t
)
12819 && COMPLETE_TYPE_P (t
)
12820 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
12824 /* Fortran builds qualified variants as new records with items of
12825 qualified type. Verify that they looks same. */
12826 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
12828 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
12829 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
12830 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
12831 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
12832 /* FIXME: gfc_nonrestricted_type builds all types as variants
12833 with exception of pointer types. It deeply copies the type
12834 which means that we may end up with a variant type
12835 referring non-variant pointer. We may change it to
12836 produce types as variants, too, like
12837 objc_get_protocol_qualified_type does. */
12838 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
12839 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
12840 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
12844 error ("type variant has different TYPE_FIELDS");
12846 error ("first mismatch is field");
12848 error ("and field");
12853 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
12854 verify_variant_match (TYPE_ARG_TYPES
);
12855 /* For C++ the qualified variant of array type is really an array type
12856 of qualified TREE_TYPE.
12857 objc builds variants of pointer where pointer to type is a variant, too
12858 in objc_get_protocol_qualified_type. */
12859 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
12860 && ((TREE_CODE (t
) != ARRAY_TYPE
12861 && !POINTER_TYPE_P (t
))
12862 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
12863 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
12865 error ("type variant has different TREE_TYPE");
12867 error ("type variant's TREE_TYPE");
12868 debug_tree (TREE_TYPE (tv
));
12869 error ("type's TREE_TYPE");
12870 debug_tree (TREE_TYPE (t
));
12873 if (type_with_alias_set_p (t
)
12874 && !gimple_canonical_types_compatible_p (t
, tv
, false))
12876 error ("type is not compatible with its variant");
12878 error ("type variant's TREE_TYPE");
12879 debug_tree (TREE_TYPE (tv
));
12880 error ("type's TREE_TYPE");
12881 debug_tree (TREE_TYPE (t
));
12885 #undef verify_variant_match
12889 /* The TYPE_CANONICAL merging machinery. It should closely resemble
12890 the middle-end types_compatible_p function. It needs to avoid
12891 claiming types are different for types that should be treated
12892 the same with respect to TBAA. Canonical types are also used
12893 for IL consistency checks via the useless_type_conversion_p
12894 predicate which does not handle all type kinds itself but falls
12895 back to pointer-comparison of TYPE_CANONICAL for aggregates
12898 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
12899 type calculation because we need to allow inter-operability between signed
12900 and unsigned variants. */
12903 type_with_interoperable_signedness (const_tree type
)
12905 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
12906 signed char and unsigned char. Similarly fortran FE builds
12907 C_SIZE_T as signed type, while C defines it unsigned. */
12909 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
12911 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
12912 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
12915 /* Return true iff T1 and T2 are structurally identical for what
12917 This function is used both by lto.c canonical type merging and by the
12918 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
12919 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
12920 only for LTO because only in these cases TYPE_CANONICAL equivalence
12921 correspond to one defined by gimple_canonical_types_compatible_p. */
12924 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
12925 bool trust_type_canonical
)
12927 /* Type variants should be same as the main variant. When not doing sanity
12928 checking to verify this fact, go to main variants and save some work. */
12929 if (trust_type_canonical
)
12931 t1
= TYPE_MAIN_VARIANT (t1
);
12932 t2
= TYPE_MAIN_VARIANT (t2
);
12935 /* Check first for the obvious case of pointer identity. */
12939 /* Check that we have two types to compare. */
12940 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
12943 /* We consider complete types always compatible with incomplete type.
12944 This does not make sense for canonical type calculation and thus we
12945 need to ensure that we are never called on it.
12947 FIXME: For more correctness the function probably should have three modes
12948 1) mode assuming that types are complete mathcing their structure
12949 2) mode allowing incomplete types but producing equivalence classes
12950 and thus ignoring all info from complete types
12951 3) mode allowing incomplete types to match complete but checking
12952 compatibility between complete types.
12954 1 and 2 can be used for canonical type calculation. 3 is the real
12955 definition of type compatibility that can be used i.e. for warnings during
12956 declaration merging. */
12958 gcc_assert (!trust_type_canonical
12959 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
12960 /* If the types have been previously registered and found equal
12963 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
12964 && trust_type_canonical
)
12966 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
12967 they are always NULL, but they are set to non-NULL for types
12968 constructed by build_pointer_type and variants. In this case the
12969 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
12970 all pointers are considered equal. Be sure to not return false
12972 gcc_checking_assert (canonical_type_used_p (t1
)
12973 && canonical_type_used_p (t2
));
12974 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
12977 /* Can't be the same type if the types don't have the same code. */
12978 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
12979 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
12982 /* Qualifiers do not matter for canonical type comparison purposes. */
12984 /* Void types and nullptr types are always the same. */
12985 if (TREE_CODE (t1
) == VOID_TYPE
12986 || TREE_CODE (t1
) == NULLPTR_TYPE
)
12989 /* Can't be the same type if they have different mode. */
12990 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
12993 /* Non-aggregate types can be handled cheaply. */
12994 if (INTEGRAL_TYPE_P (t1
)
12995 || SCALAR_FLOAT_TYPE_P (t1
)
12996 || FIXED_POINT_TYPE_P (t1
)
12997 || TREE_CODE (t1
) == VECTOR_TYPE
12998 || TREE_CODE (t1
) == COMPLEX_TYPE
12999 || TREE_CODE (t1
) == OFFSET_TYPE
13000 || POINTER_TYPE_P (t1
))
13002 /* Can't be the same type if they have different recision. */
13003 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13006 /* In some cases the signed and unsigned types are required to be
13008 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13009 && !type_with_interoperable_signedness (t1
))
13012 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13013 interoperable with "signed char". Unless all frontends are revisited
13014 to agree on these types, we must ignore the flag completely. */
13016 /* Fortran standard define C_PTR type that is compatible with every
13017 C pointer. For this reason we need to glob all pointers into one.
13018 Still pointers in different address spaces are not compatible. */
13019 if (POINTER_TYPE_P (t1
))
13021 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13022 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13026 /* Tail-recurse to components. */
13027 if (TREE_CODE (t1
) == VECTOR_TYPE
13028 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13029 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13031 trust_type_canonical
);
13036 /* Do type-specific comparisons. */
13037 switch (TREE_CODE (t1
))
13040 /* Array types are the same if the element types are the same and
13041 the number of elements are the same. */
13042 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13043 trust_type_canonical
)
13044 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13045 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13046 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13050 tree i1
= TYPE_DOMAIN (t1
);
13051 tree i2
= TYPE_DOMAIN (t2
);
13053 /* For an incomplete external array, the type domain can be
13054 NULL_TREE. Check this condition also. */
13055 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13057 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13061 tree min1
= TYPE_MIN_VALUE (i1
);
13062 tree min2
= TYPE_MIN_VALUE (i2
);
13063 tree max1
= TYPE_MAX_VALUE (i1
);
13064 tree max2
= TYPE_MAX_VALUE (i2
);
13066 /* The minimum/maximum values have to be the same. */
13069 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13070 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13071 || operand_equal_p (min1
, min2
, 0))))
13074 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13075 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13076 || operand_equal_p (max1
, max2
, 0)))))
13084 case FUNCTION_TYPE
:
13085 /* Function types are the same if the return type and arguments types
13087 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13088 trust_type_canonical
))
13091 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13095 tree parms1
, parms2
;
13097 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13099 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13101 if (!gimple_canonical_types_compatible_p
13102 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13103 trust_type_canonical
))
13107 if (parms1
|| parms2
)
13115 case QUAL_UNION_TYPE
:
13119 /* Don't try to compare variants of an incomplete type, before
13120 TYPE_FIELDS has been copied around. */
13121 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13125 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13128 /* For aggregate types, all the fields must be the same. */
13129 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13131 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13133 /* Skip non-fields and zero-sized fields. */
13134 while (f1
&& (TREE_CODE (f1
) != FIELD_DECL
13136 && integer_zerop (DECL_SIZE (f1
)))))
13137 f1
= TREE_CHAIN (f1
);
13138 while (f2
&& (TREE_CODE (f2
) != FIELD_DECL
13140 && integer_zerop (DECL_SIZE (f2
)))))
13141 f2
= TREE_CHAIN (f2
);
13144 /* The fields must have the same name, offset and type. */
13145 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13146 || !gimple_compare_field_offset (f1
, f2
)
13147 || !gimple_canonical_types_compatible_p
13148 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13149 trust_type_canonical
))
13153 /* If one aggregate has more fields than the other, they
13154 are not the same. */
13162 /* Consider all types with language specific trees in them mutually
13163 compatible. This is executed only from verify_type and false
13164 positives can be tolerated. */
13165 gcc_assert (!in_lto_p
);
13170 /* Verify type T. */
13173 verify_type (const_tree t
)
13175 bool error_found
= false;
13176 tree mv
= TYPE_MAIN_VARIANT (t
);
13179 error ("Main variant is not defined");
13180 error_found
= true;
13182 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13184 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13186 error_found
= true;
13188 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13189 error_found
= true;
13191 tree ct
= TYPE_CANONICAL (t
);
13194 else if (TYPE_CANONICAL (t
) != ct
)
13196 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13198 error_found
= true;
13200 /* Method and function types can not be used to address memory and thus
13201 TYPE_CANONICAL really matters only for determining useless conversions.
13203 FIXME: C++ FE produce declarations of builtin functions that are not
13204 compatible with main variants. */
13205 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13208 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13209 with variably sized arrays because their sizes possibly
13210 gimplified to different variables. */
13211 && !variably_modified_type_p (ct
, NULL
)
13212 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13214 error ("TYPE_CANONICAL is not compatible");
13216 error_found
= true;
13219 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13220 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13222 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13224 error_found
= true;
13226 if (TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13228 error ("TYPE_CANONICAL of main variant is not main variant");
13230 debug_tree (TYPE_MAIN_VARIANT (ct
));
13231 error_found
= true;
13235 /* Check various uses of TYPE_MIN_VALUE_RAW. */
13236 if (RECORD_OR_UNION_TYPE_P (t
))
13238 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13239 and danagle the pointer from time to time. */
13240 if (TYPE_VFIELD (t
)
13241 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13242 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13244 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13245 debug_tree (TYPE_VFIELD (t
));
13246 error_found
= true;
13249 else if (TREE_CODE (t
) == POINTER_TYPE
)
13251 if (TYPE_NEXT_PTR_TO (t
)
13252 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13254 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13255 debug_tree (TYPE_NEXT_PTR_TO (t
));
13256 error_found
= true;
13259 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13261 if (TYPE_NEXT_REF_TO (t
)
13262 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13264 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13265 debug_tree (TYPE_NEXT_REF_TO (t
));
13266 error_found
= true;
13269 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13270 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13272 /* FIXME: The following check should pass:
13273 useless_type_conversion_p (const_cast <tree> (t),
13274 TREE_TYPE (TYPE_MIN_VALUE (t))
13275 but does not for C sizetypes in LTO. */
13278 /* Check various uses of TYPE_MAXVAL_RAW. */
13279 if (RECORD_OR_UNION_TYPE_P (t
))
13281 if (!TYPE_BINFO (t
))
13283 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13285 error ("TYPE_BINFO is not TREE_BINFO");
13286 debug_tree (TYPE_BINFO (t
));
13287 error_found
= true;
13289 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
))
13291 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13292 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13293 error_found
= true;
13296 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13298 if (TYPE_METHOD_BASETYPE (t
)
13299 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13300 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13302 error ("TYPE_METHOD_BASETYPE is not record nor union");
13303 debug_tree (TYPE_METHOD_BASETYPE (t
));
13304 error_found
= true;
13307 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13309 if (TYPE_OFFSET_BASETYPE (t
)
13310 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13311 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13313 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13314 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13315 error_found
= true;
13318 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13319 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13321 /* FIXME: The following check should pass:
13322 useless_type_conversion_p (const_cast <tree> (t),
13323 TREE_TYPE (TYPE_MAX_VALUE (t))
13324 but does not for C sizetypes in LTO. */
13326 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13328 if (TYPE_ARRAY_MAX_SIZE (t
)
13329 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13331 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13332 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13333 error_found
= true;
13336 else if (TYPE_MAX_VALUE_RAW (t
))
13338 error ("TYPE_MAX_VALUE_RAW non-NULL");
13339 debug_tree (TYPE_MAX_VALUE_RAW (t
));
13340 error_found
= true;
13343 if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13345 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13346 debug_tree (TYPE_LANG_SLOT_1 (t
));
13347 error_found
= true;
13350 /* Check various uses of TYPE_VALUES_RAW. */
13351 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13352 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13354 tree value
= TREE_VALUE (l
);
13355 tree name
= TREE_PURPOSE (l
);
13357 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13358 CONST_DECL of ENUMERAL TYPE. */
13359 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13361 error ("Enum value is not CONST_DECL or INTEGER_CST");
13362 debug_tree (value
);
13364 error_found
= true;
13366 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13367 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13369 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13370 debug_tree (value
);
13372 error_found
= true;
13374 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13376 error ("Enum value name is not IDENTIFIER_NODE");
13377 debug_tree (value
);
13379 error_found
= true;
13382 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13384 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13386 error ("Array TYPE_DOMAIN is not integer type");
13387 debug_tree (TYPE_DOMAIN (t
));
13388 error_found
= true;
13391 else if (RECORD_OR_UNION_TYPE_P (t
))
13393 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13395 error ("TYPE_FIELDS defined in incomplete type");
13396 error_found
= true;
13398 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13400 /* TODO: verify properties of decls. */
13401 if (TREE_CODE (fld
) == FIELD_DECL
)
13403 else if (TREE_CODE (fld
) == TYPE_DECL
)
13405 else if (TREE_CODE (fld
) == CONST_DECL
)
13407 else if (VAR_P (fld
))
13409 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13411 else if (TREE_CODE (fld
) == USING_DECL
)
13413 else if (TREE_CODE (fld
) == FUNCTION_DECL
)
13417 error ("Wrong tree in TYPE_FIELDS list");
13419 error_found
= true;
13423 else if (TREE_CODE (t
) == INTEGER_TYPE
13424 || TREE_CODE (t
) == BOOLEAN_TYPE
13425 || TREE_CODE (t
) == OFFSET_TYPE
13426 || TREE_CODE (t
) == REFERENCE_TYPE
13427 || TREE_CODE (t
) == NULLPTR_TYPE
13428 || TREE_CODE (t
) == POINTER_TYPE
)
13430 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13432 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13433 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13434 error_found
= true;
13436 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
13438 error ("TYPE_CACHED_VALUES is not TREE_VEC");
13439 debug_tree (TYPE_CACHED_VALUES (t
));
13440 error_found
= true;
13442 /* Verify just enough of cache to ensure that no one copied it to new type.
13443 All copying should go by copy_node that should clear it. */
13444 else if (TYPE_CACHED_VALUES_P (t
))
13447 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
13448 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
13449 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
13451 error ("wrong TYPE_CACHED_VALUES entry");
13452 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
13453 error_found
= true;
13458 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13459 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
13461 /* C++ FE uses TREE_PURPOSE to store initial values. */
13462 if (TREE_PURPOSE (l
) && in_lto_p
)
13464 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
13466 error_found
= true;
13468 if (!TYPE_P (TREE_VALUE (l
)))
13470 error ("Wrong entry in TYPE_ARG_TYPES list");
13472 error_found
= true;
13475 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
13477 error ("TYPE_VALUES_RAW field is non-NULL");
13478 debug_tree (TYPE_VALUES_RAW (t
));
13479 error_found
= true;
13481 if (TREE_CODE (t
) != INTEGER_TYPE
13482 && TREE_CODE (t
) != BOOLEAN_TYPE
13483 && TREE_CODE (t
) != OFFSET_TYPE
13484 && TREE_CODE (t
) != REFERENCE_TYPE
13485 && TREE_CODE (t
) != NULLPTR_TYPE
13486 && TREE_CODE (t
) != POINTER_TYPE
13487 && TYPE_CACHED_VALUES_P (t
))
13489 error ("TYPE_CACHED_VALUES_P is set while it should not");
13490 error_found
= true;
13492 if (TYPE_STRING_FLAG (t
)
13493 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
13495 error ("TYPE_STRING_FLAG is set on wrong type code");
13496 error_found
= true;
13499 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
13500 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
13502 if (TREE_CODE (t
) == METHOD_TYPE
13503 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
13505 error ("TYPE_METHOD_BASETYPE is not main variant");
13506 error_found
= true;
13511 debug_tree (const_cast <tree
> (t
));
13512 internal_error ("verify_type failed");
13517 /* Return 1 if ARG interpreted as signed in its precision is known to be
13518 always positive or 2 if ARG is known to be always negative, or 3 if
13519 ARG may be positive or negative. */
13522 get_range_pos_neg (tree arg
)
13524 if (arg
== error_mark_node
)
13527 int prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13529 if (TREE_CODE (arg
) == INTEGER_CST
)
13531 wide_int w
= wi::sext (arg
, prec
);
13537 while (CONVERT_EXPR_P (arg
)
13538 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_OPERAND (arg
, 0)))
13539 && TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (arg
, 0))) <= prec
)
13541 arg
= TREE_OPERAND (arg
, 0);
13542 /* Narrower value zero extended into wider type
13543 will always result in positive values. */
13544 if (TYPE_UNSIGNED (TREE_TYPE (arg
))
13545 && TYPE_PRECISION (TREE_TYPE (arg
)) < prec
)
13547 prec
= TYPE_PRECISION (TREE_TYPE (arg
));
13552 if (TREE_CODE (arg
) != SSA_NAME
)
13554 wide_int arg_min
, arg_max
;
13555 while (get_range_info (arg
, &arg_min
, &arg_max
) != VR_RANGE
)
13557 gimple
*g
= SSA_NAME_DEF_STMT (arg
);
13558 if (is_gimple_assign (g
)
13559 && CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (g
)))
13561 tree t
= gimple_assign_rhs1 (g
);
13562 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
13563 && TYPE_PRECISION (TREE_TYPE (t
)) <= prec
)
13565 if (TYPE_UNSIGNED (TREE_TYPE (t
))
13566 && TYPE_PRECISION (TREE_TYPE (t
)) < prec
)
13568 prec
= TYPE_PRECISION (TREE_TYPE (t
));
13577 if (TYPE_UNSIGNED (TREE_TYPE (arg
)))
13579 /* For unsigned values, the "positive" range comes
13580 below the "negative" range. */
13581 if (!wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13583 if (wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13588 if (!wi::neg_p (wi::sext (arg_min
, prec
), SIGNED
))
13590 if (wi::neg_p (wi::sext (arg_max
, prec
), SIGNED
))
13599 /* Return true if ARG is marked with the nonnull attribute in the
13600 current function signature. */
13603 nonnull_arg_p (const_tree arg
)
13605 tree t
, attrs
, fntype
;
13606 unsigned HOST_WIDE_INT arg_num
;
13608 gcc_assert (TREE_CODE (arg
) == PARM_DECL
13609 && (POINTER_TYPE_P (TREE_TYPE (arg
))
13610 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
13612 /* The static chain decl is always non null. */
13613 if (arg
== cfun
->static_chain_decl
)
13616 /* THIS argument of method is always non-NULL. */
13617 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
13618 && arg
== DECL_ARGUMENTS (cfun
->decl
)
13619 && flag_delete_null_pointer_checks
)
13622 /* Values passed by reference are always non-NULL. */
13623 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
13624 && flag_delete_null_pointer_checks
)
13627 fntype
= TREE_TYPE (cfun
->decl
);
13628 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
13630 attrs
= lookup_attribute ("nonnull", attrs
);
13632 /* If "nonnull" wasn't specified, we know nothing about the argument. */
13633 if (attrs
== NULL_TREE
)
13636 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
13637 if (TREE_VALUE (attrs
) == NULL_TREE
)
13640 /* Get the position number for ARG in the function signature. */
13641 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
13643 t
= DECL_CHAIN (t
), arg_num
++)
13649 gcc_assert (t
== arg
);
13651 /* Now see if ARG_NUM is mentioned in the nonnull list. */
13652 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
13654 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
13662 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
13666 set_block (location_t loc
, tree block
)
13668 location_t pure_loc
= get_pure_location (loc
);
13669 source_range src_range
= get_range_from_loc (line_table
, loc
);
13670 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
13674 set_source_range (tree expr
, location_t start
, location_t finish
)
13676 source_range src_range
;
13677 src_range
.m_start
= start
;
13678 src_range
.m_finish
= finish
;
13679 return set_source_range (expr
, src_range
);
13683 set_source_range (tree expr
, source_range src_range
)
13685 if (!EXPR_P (expr
))
13686 return UNKNOWN_LOCATION
;
13688 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
13689 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
13693 SET_EXPR_LOCATION (expr
, adhoc
);
13697 /* Return the name of combined function FN, for debugging purposes. */
13700 combined_fn_name (combined_fn fn
)
13702 if (builtin_fn_p (fn
))
13704 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
13705 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
13708 return internal_fn_name (as_internal_fn (fn
));
13711 /* Return a bitmap with a bit set corresponding to each argument in
13712 a function call type FNTYPE declared with attribute nonnull,
13713 or null if none of the function's argument are nonnull. The caller
13714 must free the bitmap. */
13717 get_nonnull_args (const_tree fntype
)
13719 if (fntype
== NULL_TREE
)
13722 tree attrs
= TYPE_ATTRIBUTES (fntype
);
13726 bitmap argmap
= NULL
;
13728 /* A function declaration can specify multiple attribute nonnull,
13729 each with zero or more arguments. The loop below creates a bitmap
13730 representing a union of all the arguments. An empty (but non-null)
13731 bitmap means that all arguments have been declaraed nonnull. */
13732 for ( ; attrs
; attrs
= TREE_CHAIN (attrs
))
13734 attrs
= lookup_attribute ("nonnull", attrs
);
13739 argmap
= BITMAP_ALLOC (NULL
);
13741 if (!TREE_VALUE (attrs
))
13743 /* Clear the bitmap in case a previous attribute nonnull
13744 set it and this one overrides it for all arguments. */
13745 bitmap_clear (argmap
);
13749 /* Iterate over the indices of the format arguments declared nonnull
13750 and set a bit for each. */
13751 for (tree idx
= TREE_VALUE (attrs
); idx
; idx
= TREE_CHAIN (idx
))
13753 unsigned int val
= TREE_INT_CST_LOW (TREE_VALUE (idx
)) - 1;
13754 bitmap_set_bit (argmap
, val
);
13761 /* List of pointer types used to declare builtins before we have seen their
13764 Keep the size up to date in tree.h ! */
13765 const builtin_structptr_type builtin_structptr_types
[6] =
13767 { fileptr_type_node
, ptr_type_node
, "FILE" },
13768 { const_tm_ptr_type_node
, const_ptr_type_node
, "tm" },
13769 { fenv_t_ptr_type_node
, ptr_type_node
, "fenv_t" },
13770 { const_fenv_t_ptr_type_node
, const_ptr_type_node
, "fenv_t" },
13771 { fexcept_t_ptr_type_node
, ptr_type_node
, "fexcept_t" },
13772 { const_fexcept_t_ptr_type_node
, const_ptr_type_node
, "fexcept_t" }
13777 namespace selftest
{
13779 /* Selftests for tree. */
13781 /* Verify that integer constants are sane. */
13784 test_integer_constants ()
13786 ASSERT_TRUE (integer_type_node
!= NULL
);
13787 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
13789 tree type
= integer_type_node
;
13791 tree zero
= build_zero_cst (type
);
13792 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
13793 ASSERT_EQ (type
, TREE_TYPE (zero
));
13795 tree one
= build_int_cst (type
, 1);
13796 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
13797 ASSERT_EQ (type
, TREE_TYPE (zero
));
13800 /* Verify identifiers. */
13803 test_identifiers ()
13805 tree identifier
= get_identifier ("foo");
13806 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
13807 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
13810 /* Verify LABEL_DECL. */
13815 tree identifier
= get_identifier ("err");
13816 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
13817 identifier
, void_type_node
);
13818 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
13819 ASSERT_FALSE (FORCED_LABEL (label_decl
));
13822 /* Run all of the selftests within this file. */
13827 test_integer_constants ();
13828 test_identifiers ();
13832 } // namespace selftest
13834 #endif /* CHECKING_P */
13836 #include "gt-tree.h"