1 /* Language-independent node constructors for parse phase of GNU compiler.
2 Copyright (C) 1987-2016 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"
66 /* Tree code classes. */
68 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) TYPE,
69 #define END_OF_BASE_TREE_CODES tcc_exceptional,
71 const enum tree_code_class tree_code_type
[] = {
72 #include "all-tree.def"
76 #undef END_OF_BASE_TREE_CODES
78 /* Table indexed by tree code giving number of expression
79 operands beyond the fixed part of the node structure.
80 Not used for types or decls. */
82 #define DEFTREECODE(SYM, NAME, TYPE, LENGTH) LENGTH,
83 #define END_OF_BASE_TREE_CODES 0,
85 const unsigned char tree_code_length
[] = {
86 #include "all-tree.def"
90 #undef END_OF_BASE_TREE_CODES
92 /* Names of tree components.
93 Used for printing out the tree and error messages. */
94 #define DEFTREECODE(SYM, NAME, TYPE, LEN) NAME,
95 #define END_OF_BASE_TREE_CODES "@dummy",
97 static const char *const tree_code_name
[] = {
98 #include "all-tree.def"
102 #undef END_OF_BASE_TREE_CODES
104 /* Each tree code class has an associated string representation.
105 These must correspond to the tree_code_class entries. */
107 const char *const tree_code_class_strings
[] =
122 /* obstack.[ch] explicitly declined to prototype this. */
123 extern int _obstack_allocated_p (struct obstack
*h
, void *obj
);
125 /* Statistics-gathering stuff. */
127 static int tree_code_counts
[MAX_TREE_CODES
];
128 int tree_node_counts
[(int) all_kinds
];
129 int tree_node_sizes
[(int) all_kinds
];
131 /* Keep in sync with tree.h:enum tree_node_kind. */
132 static const char * const tree_node_kind_names
[] = {
151 /* Unique id for next decl created. */
152 static GTY(()) int next_decl_uid
;
153 /* Unique id for next type created. */
154 static GTY(()) int next_type_uid
= 1;
155 /* Unique id for next debug decl created. Use negative numbers,
156 to catch erroneous uses. */
157 static GTY(()) int next_debug_decl_uid
;
159 /* Since we cannot rehash a type after it is in the table, we have to
160 keep the hash code. */
162 struct GTY((for_user
)) type_hash
{
167 /* Initial size of the hash table (rounded to next prime). */
168 #define TYPE_HASH_INITIAL_SIZE 1000
170 struct type_cache_hasher
: ggc_cache_ptr_hash
<type_hash
>
172 static hashval_t
hash (type_hash
*t
) { return t
->hash
; }
173 static bool equal (type_hash
*a
, type_hash
*b
);
176 keep_cache_entry (type_hash
*&t
)
178 return ggc_marked_p (t
->type
);
182 /* Now here is the hash table. When recording a type, it is added to
183 the slot whose index is the hash code. Note that the hash table is
184 used for several kinds of types (function types, array types and
185 array index range types, for now). While all these live in the
186 same table, they are completely independent, and the hash code is
187 computed differently for each of these. */
189 static GTY ((cache
)) hash_table
<type_cache_hasher
> *type_hash_table
;
191 /* Hash table and temporary node for larger integer const values. */
192 static GTY (()) tree int_cst_node
;
194 struct int_cst_hasher
: ggc_cache_ptr_hash
<tree_node
>
196 static hashval_t
hash (tree t
);
197 static bool equal (tree x
, tree y
);
200 static GTY ((cache
)) hash_table
<int_cst_hasher
> *int_cst_hash_table
;
202 /* Hash table for optimization flags and target option flags. Use the same
203 hash table for both sets of options. Nodes for building the current
204 optimization and target option nodes. The assumption is most of the time
205 the options created will already be in the hash table, so we avoid
206 allocating and freeing up a node repeatably. */
207 static GTY (()) tree cl_optimization_node
;
208 static GTY (()) tree cl_target_option_node
;
210 struct cl_option_hasher
: ggc_cache_ptr_hash
<tree_node
>
212 static hashval_t
hash (tree t
);
213 static bool equal (tree x
, tree y
);
216 static GTY ((cache
)) hash_table
<cl_option_hasher
> *cl_option_hash_table
;
218 /* General tree->tree mapping structure for use in hash tables. */
222 hash_table
<tree_decl_map_cache_hasher
> *debug_expr_for_decl
;
225 hash_table
<tree_decl_map_cache_hasher
> *value_expr_for_decl
;
227 struct tree_vec_map_cache_hasher
: ggc_cache_ptr_hash
<tree_vec_map
>
229 static hashval_t
hash (tree_vec_map
*m
) { return DECL_UID (m
->base
.from
); }
232 equal (tree_vec_map
*a
, tree_vec_map
*b
)
234 return a
->base
.from
== b
->base
.from
;
238 keep_cache_entry (tree_vec_map
*&m
)
240 return ggc_marked_p (m
->base
.from
);
245 hash_table
<tree_vec_map_cache_hasher
> *debug_args_for_decl
;
247 static void set_type_quals (tree
, int);
248 static void print_type_hash_statistics (void);
249 static void print_debug_expr_statistics (void);
250 static void print_value_expr_statistics (void);
251 static void type_hash_list (const_tree
, inchash::hash
&);
252 static void attribute_hash_list (const_tree
, inchash::hash
&);
254 tree global_trees
[TI_MAX
];
255 tree integer_types
[itk_none
];
257 bool int_n_enabled_p
[NUM_INT_N_ENTS
];
258 struct int_n_trees_t int_n_trees
[NUM_INT_N_ENTS
];
260 unsigned char tree_contains_struct
[MAX_TREE_CODES
][64];
262 /* Number of operands for each OpenMP clause. */
263 unsigned const char omp_clause_num_ops
[] =
265 0, /* OMP_CLAUSE_ERROR */
266 1, /* OMP_CLAUSE_PRIVATE */
267 1, /* OMP_CLAUSE_SHARED */
268 1, /* OMP_CLAUSE_FIRSTPRIVATE */
269 2, /* OMP_CLAUSE_LASTPRIVATE */
270 5, /* OMP_CLAUSE_REDUCTION */
271 1, /* OMP_CLAUSE_COPYIN */
272 1, /* OMP_CLAUSE_COPYPRIVATE */
273 3, /* OMP_CLAUSE_LINEAR */
274 2, /* OMP_CLAUSE_ALIGNED */
275 1, /* OMP_CLAUSE_DEPEND */
276 1, /* OMP_CLAUSE_UNIFORM */
277 1, /* OMP_CLAUSE_TO_DECLARE */
278 1, /* OMP_CLAUSE_LINK */
279 2, /* OMP_CLAUSE_FROM */
280 2, /* OMP_CLAUSE_TO */
281 2, /* OMP_CLAUSE_MAP */
282 1, /* OMP_CLAUSE_USE_DEVICE_PTR */
283 1, /* OMP_CLAUSE_IS_DEVICE_PTR */
284 2, /* OMP_CLAUSE__CACHE_ */
285 2, /* OMP_CLAUSE_GANG */
286 1, /* OMP_CLAUSE_ASYNC */
287 1, /* OMP_CLAUSE_WAIT */
288 0, /* OMP_CLAUSE_AUTO */
289 0, /* OMP_CLAUSE_SEQ */
290 1, /* OMP_CLAUSE__LOOPTEMP_ */
291 1, /* OMP_CLAUSE_IF */
292 1, /* OMP_CLAUSE_NUM_THREADS */
293 1, /* OMP_CLAUSE_SCHEDULE */
294 0, /* OMP_CLAUSE_NOWAIT */
295 1, /* OMP_CLAUSE_ORDERED */
296 0, /* OMP_CLAUSE_DEFAULT */
297 3, /* OMP_CLAUSE_COLLAPSE */
298 0, /* OMP_CLAUSE_UNTIED */
299 1, /* OMP_CLAUSE_FINAL */
300 0, /* OMP_CLAUSE_MERGEABLE */
301 1, /* OMP_CLAUSE_DEVICE */
302 1, /* OMP_CLAUSE_DIST_SCHEDULE */
303 0, /* OMP_CLAUSE_INBRANCH */
304 0, /* OMP_CLAUSE_NOTINBRANCH */
305 1, /* OMP_CLAUSE_NUM_TEAMS */
306 1, /* OMP_CLAUSE_THREAD_LIMIT */
307 0, /* OMP_CLAUSE_PROC_BIND */
308 1, /* OMP_CLAUSE_SAFELEN */
309 1, /* OMP_CLAUSE_SIMDLEN */
310 0, /* OMP_CLAUSE_FOR */
311 0, /* OMP_CLAUSE_PARALLEL */
312 0, /* OMP_CLAUSE_SECTIONS */
313 0, /* OMP_CLAUSE_TASKGROUP */
314 1, /* OMP_CLAUSE_PRIORITY */
315 1, /* OMP_CLAUSE_GRAINSIZE */
316 1, /* OMP_CLAUSE_NUM_TASKS */
317 0, /* OMP_CLAUSE_NOGROUP */
318 0, /* OMP_CLAUSE_THREADS */
319 0, /* OMP_CLAUSE_SIMD */
320 1, /* OMP_CLAUSE_HINT */
321 0, /* OMP_CLAUSE_DEFALTMAP */
322 1, /* OMP_CLAUSE__SIMDUID_ */
323 1, /* OMP_CLAUSE__CILK_FOR_COUNT_ */
324 0, /* OMP_CLAUSE_INDEPENDENT */
325 1, /* OMP_CLAUSE_WORKER */
326 1, /* OMP_CLAUSE_VECTOR */
327 1, /* OMP_CLAUSE_NUM_GANGS */
328 1, /* OMP_CLAUSE_NUM_WORKERS */
329 1, /* OMP_CLAUSE_VECTOR_LENGTH */
330 1, /* OMP_CLAUSE_TILE */
331 2, /* OMP_CLAUSE__GRIDDIM_ */
334 const char * const omp_clause_code_name
[] =
406 /* Return the tree node structure used by tree code CODE. */
408 static inline enum tree_node_structure_enum
409 tree_node_structure_for_code (enum tree_code code
)
411 switch (TREE_CODE_CLASS (code
))
413 case tcc_declaration
:
418 return TS_FIELD_DECL
;
424 return TS_LABEL_DECL
;
426 return TS_RESULT_DECL
;
427 case DEBUG_EXPR_DECL
:
430 return TS_CONST_DECL
;
434 return TS_FUNCTION_DECL
;
435 case TRANSLATION_UNIT_DECL
:
436 return TS_TRANSLATION_UNIT_DECL
;
438 return TS_DECL_NON_COMMON
;
442 return TS_TYPE_NON_COMMON
;
451 default: /* tcc_constant and tcc_exceptional */
456 /* tcc_constant cases. */
457 case VOID_CST
: return TS_TYPED
;
458 case INTEGER_CST
: return TS_INT_CST
;
459 case REAL_CST
: return TS_REAL_CST
;
460 case FIXED_CST
: return TS_FIXED_CST
;
461 case COMPLEX_CST
: return TS_COMPLEX
;
462 case VECTOR_CST
: return TS_VECTOR
;
463 case STRING_CST
: return TS_STRING
;
464 /* tcc_exceptional cases. */
465 case ERROR_MARK
: return TS_COMMON
;
466 case IDENTIFIER_NODE
: return TS_IDENTIFIER
;
467 case TREE_LIST
: return TS_LIST
;
468 case TREE_VEC
: return TS_VEC
;
469 case SSA_NAME
: return TS_SSA_NAME
;
470 case PLACEHOLDER_EXPR
: return TS_COMMON
;
471 case STATEMENT_LIST
: return TS_STATEMENT_LIST
;
472 case BLOCK
: return TS_BLOCK
;
473 case CONSTRUCTOR
: return TS_CONSTRUCTOR
;
474 case TREE_BINFO
: return TS_BINFO
;
475 case OMP_CLAUSE
: return TS_OMP_CLAUSE
;
476 case OPTIMIZATION_NODE
: return TS_OPTIMIZATION
;
477 case TARGET_OPTION_NODE
: return TS_TARGET_OPTION
;
485 /* Initialize tree_contains_struct to describe the hierarchy of tree
489 initialize_tree_contains_struct (void)
493 for (i
= ERROR_MARK
; i
< LAST_AND_UNUSED_TREE_CODE
; i
++)
496 enum tree_node_structure_enum ts_code
;
498 code
= (enum tree_code
) i
;
499 ts_code
= tree_node_structure_for_code (code
);
501 /* Mark the TS structure itself. */
502 tree_contains_struct
[code
][ts_code
] = 1;
504 /* Mark all the structures that TS is derived from. */
522 case TS_STATEMENT_LIST
:
523 MARK_TS_TYPED (code
);
527 case TS_DECL_MINIMAL
:
533 case TS_OPTIMIZATION
:
534 case TS_TARGET_OPTION
:
535 MARK_TS_COMMON (code
);
538 case TS_TYPE_WITH_LANG_SPECIFIC
:
539 MARK_TS_TYPE_COMMON (code
);
542 case TS_TYPE_NON_COMMON
:
543 MARK_TS_TYPE_WITH_LANG_SPECIFIC (code
);
547 MARK_TS_DECL_MINIMAL (code
);
552 MARK_TS_DECL_COMMON (code
);
555 case TS_DECL_NON_COMMON
:
556 MARK_TS_DECL_WITH_VIS (code
);
559 case TS_DECL_WITH_VIS
:
563 MARK_TS_DECL_WRTL (code
);
567 MARK_TS_DECL_COMMON (code
);
571 MARK_TS_DECL_WITH_VIS (code
);
575 case TS_FUNCTION_DECL
:
576 MARK_TS_DECL_NON_COMMON (code
);
579 case TS_TRANSLATION_UNIT_DECL
:
580 MARK_TS_DECL_COMMON (code
);
588 /* Basic consistency checks for attributes used in fold. */
589 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_NON_COMMON
]);
590 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_NON_COMMON
]);
591 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_COMMON
]);
592 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_COMMON
]);
593 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_COMMON
]);
594 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_COMMON
]);
595 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_COMMON
]);
596 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_COMMON
]);
597 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_COMMON
]);
598 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_COMMON
]);
599 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_COMMON
]);
600 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WRTL
]);
601 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_WRTL
]);
602 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_WRTL
]);
603 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WRTL
]);
604 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_WRTL
]);
605 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_DECL_MINIMAL
]);
606 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_MINIMAL
]);
607 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_DECL_MINIMAL
]);
608 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_DECL_MINIMAL
]);
609 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_MINIMAL
]);
610 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_MINIMAL
]);
611 gcc_assert (tree_contains_struct
[TRANSLATION_UNIT_DECL
][TS_DECL_MINIMAL
]);
612 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_DECL_MINIMAL
]);
613 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_DECL_MINIMAL
]);
614 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_DECL_WITH_VIS
]);
615 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_DECL_WITH_VIS
]);
616 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_DECL_WITH_VIS
]);
617 gcc_assert (tree_contains_struct
[VAR_DECL
][TS_VAR_DECL
]);
618 gcc_assert (tree_contains_struct
[FIELD_DECL
][TS_FIELD_DECL
]);
619 gcc_assert (tree_contains_struct
[PARM_DECL
][TS_PARM_DECL
]);
620 gcc_assert (tree_contains_struct
[LABEL_DECL
][TS_LABEL_DECL
]);
621 gcc_assert (tree_contains_struct
[RESULT_DECL
][TS_RESULT_DECL
]);
622 gcc_assert (tree_contains_struct
[CONST_DECL
][TS_CONST_DECL
]);
623 gcc_assert (tree_contains_struct
[TYPE_DECL
][TS_TYPE_DECL
]);
624 gcc_assert (tree_contains_struct
[FUNCTION_DECL
][TS_FUNCTION_DECL
]);
625 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_MINIMAL
]);
626 gcc_assert (tree_contains_struct
[IMPORTED_DECL
][TS_DECL_COMMON
]);
627 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_MINIMAL
]);
628 gcc_assert (tree_contains_struct
[NAMELIST_DECL
][TS_DECL_COMMON
]);
637 /* Initialize the hash table of types. */
639 = hash_table
<type_cache_hasher
>::create_ggc (TYPE_HASH_INITIAL_SIZE
);
642 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
645 = hash_table
<tree_decl_map_cache_hasher
>::create_ggc (512);
647 int_cst_hash_table
= hash_table
<int_cst_hasher
>::create_ggc (1024);
649 int_cst_node
= make_int_cst (1, 1);
651 cl_option_hash_table
= hash_table
<cl_option_hasher
>::create_ggc (64);
653 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
654 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
656 /* Initialize the tree_contains_struct array. */
657 initialize_tree_contains_struct ();
658 lang_hooks
.init_ts ();
662 /* The name of the object as the assembler will see it (but before any
663 translations made by ASM_OUTPUT_LABELREF). Often this is the same
664 as DECL_NAME. It is an IDENTIFIER_NODE. */
666 decl_assembler_name (tree decl
)
668 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
669 lang_hooks
.set_decl_assembler_name (decl
);
670 return DECL_WITH_VIS_CHECK (decl
)->decl_with_vis
.assembler_name
;
673 /* When the target supports COMDAT groups, this indicates which group the
674 DECL is associated with. This can be either an IDENTIFIER_NODE or a
675 decl, in which case its DECL_ASSEMBLER_NAME identifies the group. */
677 decl_comdat_group (const_tree node
)
679 struct symtab_node
*snode
= symtab_node::get (node
);
682 return snode
->get_comdat_group ();
685 /* Likewise, but make sure it's been reduced to an IDENTIFIER_NODE. */
687 decl_comdat_group_id (const_tree node
)
689 struct symtab_node
*snode
= symtab_node::get (node
);
692 return snode
->get_comdat_group_id ();
695 /* When the target supports named section, return its name as IDENTIFIER_NODE
696 or NULL if it is in no section. */
698 decl_section_name (const_tree node
)
700 struct symtab_node
*snode
= symtab_node::get (node
);
703 return snode
->get_section ();
706 /* Set section name of NODE to VALUE (that is expected to be
709 set_decl_section_name (tree node
, const char *value
)
711 struct symtab_node
*snode
;
715 snode
= symtab_node::get (node
);
719 else if (TREE_CODE (node
) == VAR_DECL
)
720 snode
= varpool_node::get_create (node
);
722 snode
= cgraph_node::get_create (node
);
723 snode
->set_section (value
);
726 /* Return TLS model of a variable NODE. */
728 decl_tls_model (const_tree node
)
730 struct varpool_node
*snode
= varpool_node::get (node
);
732 return TLS_MODEL_NONE
;
733 return snode
->tls_model
;
736 /* Set TLS model of variable NODE to MODEL. */
738 set_decl_tls_model (tree node
, enum tls_model model
)
740 struct varpool_node
*vnode
;
742 if (model
== TLS_MODEL_NONE
)
744 vnode
= varpool_node::get (node
);
749 vnode
= varpool_node::get_create (node
);
750 vnode
->tls_model
= model
;
753 /* Compute the number of bytes occupied by a tree with code CODE.
754 This function cannot be used for nodes that have variable sizes,
755 including TREE_VEC, INTEGER_CST, STRING_CST, and CALL_EXPR. */
757 tree_code_size (enum tree_code code
)
759 switch (TREE_CODE_CLASS (code
))
761 case tcc_declaration
: /* A decl node */
766 return sizeof (struct tree_field_decl
);
768 return sizeof (struct tree_parm_decl
);
770 return sizeof (struct tree_var_decl
);
772 return sizeof (struct tree_label_decl
);
774 return sizeof (struct tree_result_decl
);
776 return sizeof (struct tree_const_decl
);
778 return sizeof (struct tree_type_decl
);
780 return sizeof (struct tree_function_decl
);
781 case DEBUG_EXPR_DECL
:
782 return sizeof (struct tree_decl_with_rtl
);
783 case TRANSLATION_UNIT_DECL
:
784 return sizeof (struct tree_translation_unit_decl
);
788 return sizeof (struct tree_decl_non_common
);
790 return lang_hooks
.tree_size (code
);
794 case tcc_type
: /* a type node */
795 return sizeof (struct tree_type_non_common
);
797 case tcc_reference
: /* a reference */
798 case tcc_expression
: /* an expression */
799 case tcc_statement
: /* an expression with side effects */
800 case tcc_comparison
: /* a comparison expression */
801 case tcc_unary
: /* a unary arithmetic expression */
802 case tcc_binary
: /* a binary arithmetic expression */
803 return (sizeof (struct tree_exp
)
804 + (TREE_CODE_LENGTH (code
) - 1) * sizeof (tree
));
806 case tcc_constant
: /* a constant */
809 case VOID_CST
: return sizeof (struct tree_typed
);
810 case INTEGER_CST
: gcc_unreachable ();
811 case REAL_CST
: return sizeof (struct tree_real_cst
);
812 case FIXED_CST
: return sizeof (struct tree_fixed_cst
);
813 case COMPLEX_CST
: return sizeof (struct tree_complex
);
814 case VECTOR_CST
: return sizeof (struct tree_vector
);
815 case STRING_CST
: gcc_unreachable ();
817 return lang_hooks
.tree_size (code
);
820 case tcc_exceptional
: /* something random, like an identifier. */
823 case IDENTIFIER_NODE
: return lang_hooks
.identifier_size
;
824 case TREE_LIST
: return sizeof (struct tree_list
);
827 case PLACEHOLDER_EXPR
: return sizeof (struct tree_common
);
830 case OMP_CLAUSE
: gcc_unreachable ();
832 case SSA_NAME
: return sizeof (struct tree_ssa_name
);
834 case STATEMENT_LIST
: return sizeof (struct tree_statement_list
);
835 case BLOCK
: return sizeof (struct tree_block
);
836 case CONSTRUCTOR
: return sizeof (struct tree_constructor
);
837 case OPTIMIZATION_NODE
: return sizeof (struct tree_optimization_option
);
838 case TARGET_OPTION_NODE
: return sizeof (struct tree_target_option
);
841 return lang_hooks
.tree_size (code
);
849 /* Compute the number of bytes occupied by NODE. This routine only
850 looks at TREE_CODE, except for those nodes that have variable sizes. */
852 tree_size (const_tree node
)
854 const enum tree_code code
= TREE_CODE (node
);
858 return (sizeof (struct tree_int_cst
)
859 + (TREE_INT_CST_EXT_NUNITS (node
) - 1) * sizeof (HOST_WIDE_INT
));
862 return (offsetof (struct tree_binfo
, base_binfos
)
864 ::embedded_size (BINFO_N_BASE_BINFOS (node
)));
867 return (sizeof (struct tree_vec
)
868 + (TREE_VEC_LENGTH (node
) - 1) * sizeof (tree
));
871 return (sizeof (struct tree_vector
)
872 + (TYPE_VECTOR_SUBPARTS (TREE_TYPE (node
)) - 1) * sizeof (tree
));
875 return TREE_STRING_LENGTH (node
) + offsetof (struct tree_string
, str
) + 1;
878 return (sizeof (struct tree_omp_clause
)
879 + (omp_clause_num_ops
[OMP_CLAUSE_CODE (node
)] - 1)
883 if (TREE_CODE_CLASS (code
) == tcc_vl_exp
)
884 return (sizeof (struct tree_exp
)
885 + (VL_EXP_OPERAND_LENGTH (node
) - 1) * sizeof (tree
));
887 return tree_code_size (code
);
891 /* Record interesting allocation statistics for a tree node with CODE
895 record_node_allocation_statistics (enum tree_code code ATTRIBUTE_UNUSED
,
896 size_t length ATTRIBUTE_UNUSED
)
898 enum tree_code_class type
= TREE_CODE_CLASS (code
);
901 if (!GATHER_STATISTICS
)
906 case tcc_declaration
: /* A decl node */
910 case tcc_type
: /* a type node */
914 case tcc_statement
: /* an expression with side effects */
918 case tcc_reference
: /* a reference */
922 case tcc_expression
: /* an expression */
923 case tcc_comparison
: /* a comparison expression */
924 case tcc_unary
: /* a unary arithmetic expression */
925 case tcc_binary
: /* a binary arithmetic expression */
929 case tcc_constant
: /* a constant */
933 case tcc_exceptional
: /* something random, like an identifier. */
936 case IDENTIFIER_NODE
:
949 kind
= ssa_name_kind
;
961 kind
= omp_clause_kind
;
978 tree_code_counts
[(int) code
]++;
979 tree_node_counts
[(int) kind
]++;
980 tree_node_sizes
[(int) kind
] += length
;
983 /* Allocate and return a new UID from the DECL_UID namespace. */
986 allocate_decl_uid (void)
988 return next_decl_uid
++;
991 /* Return a newly allocated node of code CODE. For decl and type
992 nodes, some other fields are initialized. The rest of the node is
993 initialized to zero. This function cannot be used for TREE_VEC,
994 INTEGER_CST or OMP_CLAUSE nodes, which is enforced by asserts in
997 Achoo! I got a code in the node. */
1000 make_node_stat (enum tree_code code MEM_STAT_DECL
)
1003 enum tree_code_class type
= TREE_CODE_CLASS (code
);
1004 size_t length
= tree_code_size (code
);
1006 record_node_allocation_statistics (code
, length
);
1008 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1009 TREE_SET_CODE (t
, code
);
1014 TREE_SIDE_EFFECTS (t
) = 1;
1017 case tcc_declaration
:
1018 if (CODE_CONTAINS_STRUCT (code
, TS_DECL_COMMON
))
1020 if (code
== FUNCTION_DECL
)
1022 SET_DECL_ALIGN (t
, FUNCTION_BOUNDARY
);
1023 DECL_MODE (t
) = FUNCTION_MODE
;
1026 SET_DECL_ALIGN (t
, 1);
1028 DECL_SOURCE_LOCATION (t
) = input_location
;
1029 if (TREE_CODE (t
) == DEBUG_EXPR_DECL
)
1030 DECL_UID (t
) = --next_debug_decl_uid
;
1033 DECL_UID (t
) = allocate_decl_uid ();
1034 SET_DECL_PT_UID (t
, -1);
1036 if (TREE_CODE (t
) == LABEL_DECL
)
1037 LABEL_DECL_UID (t
) = -1;
1042 TYPE_UID (t
) = next_type_uid
++;
1043 SET_TYPE_ALIGN (t
, BITS_PER_UNIT
);
1044 TYPE_USER_ALIGN (t
) = 0;
1045 TYPE_MAIN_VARIANT (t
) = t
;
1046 TYPE_CANONICAL (t
) = t
;
1048 /* Default to no attributes for type, but let target change that. */
1049 TYPE_ATTRIBUTES (t
) = NULL_TREE
;
1050 targetm
.set_default_type_attributes (t
);
1052 /* We have not yet computed the alias set for this type. */
1053 TYPE_ALIAS_SET (t
) = -1;
1057 TREE_CONSTANT (t
) = 1;
1060 case tcc_expression
:
1066 case PREDECREMENT_EXPR
:
1067 case PREINCREMENT_EXPR
:
1068 case POSTDECREMENT_EXPR
:
1069 case POSTINCREMENT_EXPR
:
1070 /* All of these have side-effects, no matter what their
1072 TREE_SIDE_EFFECTS (t
) = 1;
1080 case tcc_exceptional
:
1083 case TARGET_OPTION_NODE
:
1084 TREE_TARGET_OPTION(t
)
1085 = ggc_cleared_alloc
<struct cl_target_option
> ();
1088 case OPTIMIZATION_NODE
:
1089 TREE_OPTIMIZATION (t
)
1090 = ggc_cleared_alloc
<struct cl_optimization
> ();
1099 /* Other classes need no special treatment. */
1106 /* Free tree node. */
1109 free_node (tree node
)
1111 enum tree_code code
= TREE_CODE (node
);
1112 if (GATHER_STATISTICS
)
1114 tree_code_counts
[(int) TREE_CODE (node
)]--;
1115 tree_node_counts
[(int) t_kind
]--;
1116 tree_node_sizes
[(int) t_kind
] -= tree_size (node
);
1118 if (CODE_CONTAINS_STRUCT (code
, TS_CONSTRUCTOR
))
1119 vec_free (CONSTRUCTOR_ELTS (node
));
1120 else if (code
== BLOCK
)
1121 vec_free (BLOCK_NONLOCALIZED_VARS (node
));
1122 else if (code
== TREE_BINFO
)
1123 vec_free (BINFO_BASE_ACCESSES (node
));
1127 /* Return a new node with the same contents as NODE except that its
1128 TREE_CHAIN, if it has one, is zero and it has a fresh uid. */
1131 copy_node_stat (tree node MEM_STAT_DECL
)
1134 enum tree_code code
= TREE_CODE (node
);
1137 gcc_assert (code
!= STATEMENT_LIST
);
1139 length
= tree_size (node
);
1140 record_node_allocation_statistics (code
, length
);
1141 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
1142 memcpy (t
, node
, length
);
1144 if (CODE_CONTAINS_STRUCT (code
, TS_COMMON
))
1146 TREE_ASM_WRITTEN (t
) = 0;
1147 TREE_VISITED (t
) = 0;
1149 if (TREE_CODE_CLASS (code
) == tcc_declaration
)
1151 if (code
== DEBUG_EXPR_DECL
)
1152 DECL_UID (t
) = --next_debug_decl_uid
;
1155 DECL_UID (t
) = allocate_decl_uid ();
1156 if (DECL_PT_UID_SET_P (node
))
1157 SET_DECL_PT_UID (t
, DECL_PT_UID (node
));
1159 if ((TREE_CODE (node
) == PARM_DECL
|| TREE_CODE (node
) == VAR_DECL
)
1160 && DECL_HAS_VALUE_EXPR_P (node
))
1162 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (node
));
1163 DECL_HAS_VALUE_EXPR_P (t
) = 1;
1165 /* DECL_DEBUG_EXPR is copied explicitely by callers. */
1166 if (TREE_CODE (node
) == VAR_DECL
)
1168 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1169 t
->decl_with_vis
.symtab_node
= NULL
;
1171 if (TREE_CODE (node
) == VAR_DECL
&& DECL_HAS_INIT_PRIORITY_P (node
))
1173 SET_DECL_INIT_PRIORITY (t
, DECL_INIT_PRIORITY (node
));
1174 DECL_HAS_INIT_PRIORITY_P (t
) = 1;
1176 if (TREE_CODE (node
) == FUNCTION_DECL
)
1178 DECL_STRUCT_FUNCTION (t
) = NULL
;
1179 t
->decl_with_vis
.symtab_node
= NULL
;
1182 else if (TREE_CODE_CLASS (code
) == tcc_type
)
1184 TYPE_UID (t
) = next_type_uid
++;
1185 /* The following is so that the debug code for
1186 the copy is different from the original type.
1187 The two statements usually duplicate each other
1188 (because they clear fields of the same union),
1189 but the optimizer should catch that. */
1190 TYPE_SYMTAB_POINTER (t
) = 0;
1191 TYPE_SYMTAB_ADDRESS (t
) = 0;
1193 /* Do not copy the values cache. */
1194 if (TYPE_CACHED_VALUES_P (t
))
1196 TYPE_CACHED_VALUES_P (t
) = 0;
1197 TYPE_CACHED_VALUES (t
) = NULL_TREE
;
1200 else if (code
== TARGET_OPTION_NODE
)
1202 TREE_TARGET_OPTION (t
) = ggc_alloc
<struct cl_target_option
>();
1203 memcpy (TREE_TARGET_OPTION (t
), TREE_TARGET_OPTION (node
),
1204 sizeof (struct cl_target_option
));
1206 else if (code
== OPTIMIZATION_NODE
)
1208 TREE_OPTIMIZATION (t
) = ggc_alloc
<struct cl_optimization
>();
1209 memcpy (TREE_OPTIMIZATION (t
), TREE_OPTIMIZATION (node
),
1210 sizeof (struct cl_optimization
));
1216 /* Return a copy of a chain of nodes, chained through the TREE_CHAIN field.
1217 For example, this can copy a list made of TREE_LIST nodes. */
1220 copy_list (tree list
)
1228 head
= prev
= copy_node (list
);
1229 next
= TREE_CHAIN (list
);
1232 TREE_CHAIN (prev
) = copy_node (next
);
1233 prev
= TREE_CHAIN (prev
);
1234 next
= TREE_CHAIN (next
);
1240 /* Return the value that TREE_INT_CST_EXT_NUNITS should have for an
1241 INTEGER_CST with value CST and type TYPE. */
1244 get_int_cst_ext_nunits (tree type
, const wide_int
&cst
)
1246 gcc_checking_assert (cst
.get_precision () == TYPE_PRECISION (type
));
1247 /* We need extra HWIs if CST is an unsigned integer with its
1249 if (TYPE_UNSIGNED (type
) && wi::neg_p (cst
))
1250 return cst
.get_precision () / HOST_BITS_PER_WIDE_INT
+ 1;
1251 return cst
.get_len ();
1254 /* Return a new INTEGER_CST with value CST and type TYPE. */
1257 build_new_int_cst (tree type
, const wide_int
&cst
)
1259 unsigned int len
= cst
.get_len ();
1260 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1261 tree nt
= make_int_cst (len
, ext_len
);
1266 TREE_INT_CST_ELT (nt
, ext_len
)
1267 = zext_hwi (-1, cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1268 for (unsigned int i
= len
; i
< ext_len
; ++i
)
1269 TREE_INT_CST_ELT (nt
, i
) = -1;
1271 else if (TYPE_UNSIGNED (type
)
1272 && cst
.get_precision () < len
* HOST_BITS_PER_WIDE_INT
)
1275 TREE_INT_CST_ELT (nt
, len
)
1276 = zext_hwi (cst
.elt (len
),
1277 cst
.get_precision () % HOST_BITS_PER_WIDE_INT
);
1280 for (unsigned int i
= 0; i
< len
; i
++)
1281 TREE_INT_CST_ELT (nt
, i
) = cst
.elt (i
);
1282 TREE_TYPE (nt
) = type
;
1286 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1289 build_int_cst (tree type
, HOST_WIDE_INT low
)
1291 /* Support legacy code. */
1293 type
= integer_type_node
;
1295 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1299 build_int_cstu (tree type
, unsigned HOST_WIDE_INT cst
)
1301 return wide_int_to_tree (type
, wi::uhwi (cst
, TYPE_PRECISION (type
)));
1304 /* Create an INT_CST node with a LOW value sign extended to TYPE. */
1307 build_int_cst_type (tree type
, HOST_WIDE_INT low
)
1310 return wide_int_to_tree (type
, wi::shwi (low
, TYPE_PRECISION (type
)));
1313 /* Constructs tree in type TYPE from with value given by CST. Signedness
1314 of CST is assumed to be the same as the signedness of TYPE. */
1317 double_int_to_tree (tree type
, double_int cst
)
1319 return wide_int_to_tree (type
, widest_int::from (cst
, TYPE_SIGN (type
)));
1322 /* We force the wide_int CST to the range of the type TYPE by sign or
1323 zero extending it. OVERFLOWABLE indicates if we are interested in
1324 overflow of the value, when >0 we are only interested in signed
1325 overflow, for <0 we are interested in any overflow. OVERFLOWED
1326 indicates whether overflow has already occurred. CONST_OVERFLOWED
1327 indicates whether constant overflow has already occurred. We force
1328 T's value to be within range of T's type (by setting to 0 or 1 all
1329 the bits outside the type's range). We set TREE_OVERFLOWED if,
1330 OVERFLOWED is nonzero,
1331 or OVERFLOWABLE is >0 and signed overflow occurs
1332 or OVERFLOWABLE is <0 and any overflow occurs
1333 We return a new tree node for the extended wide_int. The node
1334 is shared if no overflow flags are set. */
1338 force_fit_type (tree type
, const wide_int_ref
&cst
,
1339 int overflowable
, bool overflowed
)
1341 signop sign
= TYPE_SIGN (type
);
1343 /* If we need to set overflow flags, return a new unshared node. */
1344 if (overflowed
|| !wi::fits_to_tree_p (cst
, type
))
1348 || (overflowable
> 0 && sign
== SIGNED
))
1350 wide_int tmp
= wide_int::from (cst
, TYPE_PRECISION (type
), sign
);
1351 tree t
= build_new_int_cst (type
, tmp
);
1352 TREE_OVERFLOW (t
) = 1;
1357 /* Else build a shared node. */
1358 return wide_int_to_tree (type
, cst
);
1361 /* These are the hash table functions for the hash table of INTEGER_CST
1362 nodes of a sizetype. */
1364 /* Return the hash code X, an INTEGER_CST. */
1367 int_cst_hasher::hash (tree x
)
1369 const_tree
const t
= x
;
1370 hashval_t code
= TYPE_UID (TREE_TYPE (t
));
1373 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
1374 code
= iterative_hash_host_wide_int (TREE_INT_CST_ELT(t
, i
), code
);
1379 /* Return nonzero if the value represented by *X (an INTEGER_CST tree node)
1380 is the same as that given by *Y, which is the same. */
1383 int_cst_hasher::equal (tree x
, tree y
)
1385 const_tree
const xt
= x
;
1386 const_tree
const yt
= y
;
1388 if (TREE_TYPE (xt
) != TREE_TYPE (yt
)
1389 || TREE_INT_CST_NUNITS (xt
) != TREE_INT_CST_NUNITS (yt
)
1390 || TREE_INT_CST_EXT_NUNITS (xt
) != TREE_INT_CST_EXT_NUNITS (yt
))
1393 for (int i
= 0; i
< TREE_INT_CST_NUNITS (xt
); i
++)
1394 if (TREE_INT_CST_ELT (xt
, i
) != TREE_INT_CST_ELT (yt
, i
))
1400 /* Create an INT_CST node of TYPE and value CST.
1401 The returned node is always shared. For small integers we use a
1402 per-type vector cache, for larger ones we use a single hash table.
1403 The value is extended from its precision according to the sign of
1404 the type to be a multiple of HOST_BITS_PER_WIDE_INT. This defines
1405 the upper bits and ensures that hashing and value equality based
1406 upon the underlying HOST_WIDE_INTs works without masking. */
1409 wide_int_to_tree (tree type
, const wide_int_ref
&pcst
)
1416 unsigned int prec
= TYPE_PRECISION (type
);
1417 signop sgn
= TYPE_SIGN (type
);
1419 /* Verify that everything is canonical. */
1420 int l
= pcst
.get_len ();
1423 if (pcst
.elt (l
- 1) == 0)
1424 gcc_checking_assert (pcst
.elt (l
- 2) < 0);
1425 if (pcst
.elt (l
- 1) == HOST_WIDE_INT_M1
)
1426 gcc_checking_assert (pcst
.elt (l
- 2) >= 0);
1429 wide_int cst
= wide_int::from (pcst
, prec
, sgn
);
1430 unsigned int ext_len
= get_int_cst_ext_nunits (type
, cst
);
1434 /* We just need to store a single HOST_WIDE_INT. */
1436 if (TYPE_UNSIGNED (type
))
1437 hwi
= cst
.to_uhwi ();
1439 hwi
= cst
.to_shwi ();
1441 switch (TREE_CODE (type
))
1444 gcc_assert (hwi
== 0);
1448 case REFERENCE_TYPE
:
1449 case POINTER_BOUNDS_TYPE
:
1450 /* Cache NULL pointer and zero bounds. */
1459 /* Cache false or true. */
1461 if (IN_RANGE (hwi
, 0, 1))
1467 if (TYPE_SIGN (type
) == UNSIGNED
)
1470 limit
= INTEGER_SHARE_LIMIT
;
1471 if (IN_RANGE (hwi
, 0, INTEGER_SHARE_LIMIT
- 1))
1476 /* Cache [-1, N). */
1477 limit
= INTEGER_SHARE_LIMIT
+ 1;
1478 if (IN_RANGE (hwi
, -1, INTEGER_SHARE_LIMIT
- 1))
1492 /* Look for it in the type's vector of small shared ints. */
1493 if (!TYPE_CACHED_VALUES_P (type
))
1495 TYPE_CACHED_VALUES_P (type
) = 1;
1496 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1499 t
= TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
);
1501 /* Make sure no one is clobbering the shared constant. */
1502 gcc_checking_assert (TREE_TYPE (t
) == type
1503 && TREE_INT_CST_NUNITS (t
) == 1
1504 && TREE_INT_CST_OFFSET_NUNITS (t
) == 1
1505 && TREE_INT_CST_EXT_NUNITS (t
) == 1
1506 && TREE_INT_CST_ELT (t
, 0) == hwi
);
1509 /* Create a new shared int. */
1510 t
= build_new_int_cst (type
, cst
);
1511 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1516 /* Use the cache of larger shared ints, using int_cst_node as
1519 TREE_INT_CST_ELT (int_cst_node
, 0) = hwi
;
1520 TREE_TYPE (int_cst_node
) = type
;
1522 tree
*slot
= int_cst_hash_table
->find_slot (int_cst_node
, INSERT
);
1526 /* Insert this one into the hash table. */
1529 /* Make a new node for next time round. */
1530 int_cst_node
= make_int_cst (1, 1);
1536 /* The value either hashes properly or we drop it on the floor
1537 for the gc to take care of. There will not be enough of them
1540 tree nt
= build_new_int_cst (type
, cst
);
1541 tree
*slot
= int_cst_hash_table
->find_slot (nt
, INSERT
);
1545 /* Insert this one into the hash table. */
1555 cache_integer_cst (tree t
)
1557 tree type
= TREE_TYPE (t
);
1560 int prec
= TYPE_PRECISION (type
);
1562 gcc_assert (!TREE_OVERFLOW (t
));
1564 switch (TREE_CODE (type
))
1567 gcc_assert (integer_zerop (t
));
1571 case REFERENCE_TYPE
:
1572 /* Cache NULL pointer. */
1573 if (integer_zerop (t
))
1581 /* Cache false or true. */
1583 if (wi::ltu_p (t
, 2))
1584 ix
= TREE_INT_CST_ELT (t
, 0);
1589 if (TYPE_UNSIGNED (type
))
1592 limit
= INTEGER_SHARE_LIMIT
;
1594 /* This is a little hokie, but if the prec is smaller than
1595 what is necessary to hold INTEGER_SHARE_LIMIT, then the
1596 obvious test will not get the correct answer. */
1597 if (prec
< HOST_BITS_PER_WIDE_INT
)
1599 if (tree_to_uhwi (t
) < (unsigned HOST_WIDE_INT
) INTEGER_SHARE_LIMIT
)
1600 ix
= tree_to_uhwi (t
);
1602 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1603 ix
= tree_to_uhwi (t
);
1608 limit
= INTEGER_SHARE_LIMIT
+ 1;
1610 if (integer_minus_onep (t
))
1612 else if (!wi::neg_p (t
))
1614 if (prec
< HOST_BITS_PER_WIDE_INT
)
1616 if (tree_to_shwi (t
) < INTEGER_SHARE_LIMIT
)
1617 ix
= tree_to_shwi (t
) + 1;
1619 else if (wi::ltu_p (t
, INTEGER_SHARE_LIMIT
))
1620 ix
= tree_to_shwi (t
) + 1;
1634 /* Look for it in the type's vector of small shared ints. */
1635 if (!TYPE_CACHED_VALUES_P (type
))
1637 TYPE_CACHED_VALUES_P (type
) = 1;
1638 TYPE_CACHED_VALUES (type
) = make_tree_vec (limit
);
1641 gcc_assert (TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) == NULL_TREE
);
1642 TREE_VEC_ELT (TYPE_CACHED_VALUES (type
), ix
) = t
;
1646 /* Use the cache of larger shared ints. */
1647 tree
*slot
= int_cst_hash_table
->find_slot (t
, INSERT
);
1648 /* If there is already an entry for the number verify it's the
1651 gcc_assert (wi::eq_p (tree (*slot
), t
));
1653 /* Otherwise insert this one into the hash table. */
1659 /* Builds an integer constant in TYPE such that lowest BITS bits are ones
1660 and the rest are zeros. */
1663 build_low_bits_mask (tree type
, unsigned bits
)
1665 gcc_assert (bits
<= TYPE_PRECISION (type
));
1667 return wide_int_to_tree (type
, wi::mask (bits
, false,
1668 TYPE_PRECISION (type
)));
1671 /* Checks that X is integer constant that can be expressed in (unsigned)
1672 HOST_WIDE_INT without loss of precision. */
1675 cst_and_fits_in_hwi (const_tree x
)
1677 return (TREE_CODE (x
) == INTEGER_CST
1678 && TYPE_PRECISION (TREE_TYPE (x
)) <= HOST_BITS_PER_WIDE_INT
);
1681 /* Build a newly constructed VECTOR_CST node of length LEN. */
1684 make_vector_stat (unsigned len MEM_STAT_DECL
)
1687 unsigned length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vector
);
1689 record_node_allocation_statistics (VECTOR_CST
, length
);
1691 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
1693 TREE_SET_CODE (t
, VECTOR_CST
);
1694 TREE_CONSTANT (t
) = 1;
1699 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1700 are in a list pointed to by VALS. */
1703 build_vector_stat (tree type
, tree
*vals MEM_STAT_DECL
)
1707 tree v
= make_vector (TYPE_VECTOR_SUBPARTS (type
));
1708 TREE_TYPE (v
) = type
;
1710 /* Iterate through elements and check for overflow. */
1711 for (cnt
= 0; cnt
< TYPE_VECTOR_SUBPARTS (type
); ++cnt
)
1713 tree value
= vals
[cnt
];
1715 VECTOR_CST_ELT (v
, cnt
) = value
;
1717 /* Don't crash if we get an address constant. */
1718 if (!CONSTANT_CLASS_P (value
))
1721 over
|= TREE_OVERFLOW (value
);
1724 TREE_OVERFLOW (v
) = over
;
1728 /* Return a new VECTOR_CST node whose type is TYPE and whose values
1729 are extracted from V, a vector of CONSTRUCTOR_ELT. */
1732 build_vector_from_ctor (tree type
, vec
<constructor_elt
, va_gc
> *v
)
1734 tree
*vec
= XALLOCAVEC (tree
, TYPE_VECTOR_SUBPARTS (type
));
1735 unsigned HOST_WIDE_INT idx
, pos
= 0;
1738 FOR_EACH_CONSTRUCTOR_VALUE (v
, idx
, value
)
1740 if (TREE_CODE (value
) == VECTOR_CST
)
1741 for (unsigned i
= 0; i
< VECTOR_CST_NELTS (value
); ++i
)
1742 vec
[pos
++] = VECTOR_CST_ELT (value
, i
);
1746 while (pos
< TYPE_VECTOR_SUBPARTS (type
))
1747 vec
[pos
++] = build_zero_cst (TREE_TYPE (type
));
1749 return build_vector (type
, vec
);
1752 /* Build a vector of type VECTYPE where all the elements are SCs. */
1754 build_vector_from_val (tree vectype
, tree sc
)
1756 int i
, nunits
= TYPE_VECTOR_SUBPARTS (vectype
);
1758 if (sc
== error_mark_node
)
1761 /* Verify that the vector type is suitable for SC. Note that there
1762 is some inconsistency in the type-system with respect to restrict
1763 qualifications of pointers. Vector types always have a main-variant
1764 element type and the qualification is applied to the vector-type.
1765 So TREE_TYPE (vector-type) does not return a properly qualified
1766 vector element-type. */
1767 gcc_checking_assert (types_compatible_p (TYPE_MAIN_VARIANT (TREE_TYPE (sc
)),
1768 TREE_TYPE (vectype
)));
1770 if (CONSTANT_CLASS_P (sc
))
1772 tree
*v
= XALLOCAVEC (tree
, nunits
);
1773 for (i
= 0; i
< nunits
; ++i
)
1775 return build_vector (vectype
, v
);
1779 vec
<constructor_elt
, va_gc
> *v
;
1780 vec_alloc (v
, nunits
);
1781 for (i
= 0; i
< nunits
; ++i
)
1782 CONSTRUCTOR_APPEND_ELT (v
, NULL_TREE
, sc
);
1783 return build_constructor (vectype
, v
);
1787 /* Something has messed with the elements of CONSTRUCTOR C after it was built;
1788 calculate TREE_CONSTANT and TREE_SIDE_EFFECTS. */
1791 recompute_constructor_flags (tree c
)
1795 bool constant_p
= true;
1796 bool side_effects_p
= false;
1797 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1799 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1801 /* Mostly ctors will have elts that don't have side-effects, so
1802 the usual case is to scan all the elements. Hence a single
1803 loop for both const and side effects, rather than one loop
1804 each (with early outs). */
1805 if (!TREE_CONSTANT (val
))
1807 if (TREE_SIDE_EFFECTS (val
))
1808 side_effects_p
= true;
1811 TREE_SIDE_EFFECTS (c
) = side_effects_p
;
1812 TREE_CONSTANT (c
) = constant_p
;
1815 /* Make sure that TREE_CONSTANT and TREE_SIDE_EFFECTS are correct for
1819 verify_constructor_flags (tree c
)
1823 bool constant_p
= TREE_CONSTANT (c
);
1824 bool side_effects_p
= TREE_SIDE_EFFECTS (c
);
1825 vec
<constructor_elt
, va_gc
> *vals
= CONSTRUCTOR_ELTS (c
);
1827 FOR_EACH_CONSTRUCTOR_VALUE (vals
, i
, val
)
1829 if (constant_p
&& !TREE_CONSTANT (val
))
1830 internal_error ("non-constant element in constant CONSTRUCTOR");
1831 if (!side_effects_p
&& TREE_SIDE_EFFECTS (val
))
1832 internal_error ("side-effects element in no-side-effects CONSTRUCTOR");
1836 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1837 are in the vec pointed to by VALS. */
1839 build_constructor (tree type
, vec
<constructor_elt
, va_gc
> *vals
)
1841 tree c
= make_node (CONSTRUCTOR
);
1843 TREE_TYPE (c
) = type
;
1844 CONSTRUCTOR_ELTS (c
) = vals
;
1846 recompute_constructor_flags (c
);
1851 /* Build a CONSTRUCTOR node made of a single initializer, with the specified
1854 build_constructor_single (tree type
, tree index
, tree value
)
1856 vec
<constructor_elt
, va_gc
> *v
;
1857 constructor_elt elt
= {index
, value
};
1860 v
->quick_push (elt
);
1862 return build_constructor (type
, v
);
1866 /* Return a new CONSTRUCTOR node whose type is TYPE and whose values
1867 are in a list pointed to by VALS. */
1869 build_constructor_from_list (tree type
, tree vals
)
1872 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1876 vec_alloc (v
, list_length (vals
));
1877 for (t
= vals
; t
; t
= TREE_CHAIN (t
))
1878 CONSTRUCTOR_APPEND_ELT (v
, TREE_PURPOSE (t
), TREE_VALUE (t
));
1881 return build_constructor (type
, v
);
1884 /* Return a new CONSTRUCTOR node whose type is TYPE. NELTS is the number
1885 of elements, provided as index/value pairs. */
1888 build_constructor_va (tree type
, int nelts
, ...)
1890 vec
<constructor_elt
, va_gc
> *v
= NULL
;
1893 va_start (p
, nelts
);
1894 vec_alloc (v
, nelts
);
1897 tree index
= va_arg (p
, tree
);
1898 tree value
= va_arg (p
, tree
);
1899 CONSTRUCTOR_APPEND_ELT (v
, index
, value
);
1902 return build_constructor (type
, v
);
1905 /* Return a new FIXED_CST node whose type is TYPE and value is F. */
1908 build_fixed (tree type
, FIXED_VALUE_TYPE f
)
1911 FIXED_VALUE_TYPE
*fp
;
1913 v
= make_node (FIXED_CST
);
1914 fp
= ggc_alloc
<fixed_value
> ();
1915 memcpy (fp
, &f
, sizeof (FIXED_VALUE_TYPE
));
1917 TREE_TYPE (v
) = type
;
1918 TREE_FIXED_CST_PTR (v
) = fp
;
1922 /* Return a new REAL_CST node whose type is TYPE and value is D. */
1925 build_real (tree type
, REAL_VALUE_TYPE d
)
1928 REAL_VALUE_TYPE
*dp
;
1931 /* ??? Used to check for overflow here via CHECK_FLOAT_TYPE.
1932 Consider doing it via real_convert now. */
1934 v
= make_node (REAL_CST
);
1935 dp
= ggc_alloc
<real_value
> ();
1936 memcpy (dp
, &d
, sizeof (REAL_VALUE_TYPE
));
1938 TREE_TYPE (v
) = type
;
1939 TREE_REAL_CST_PTR (v
) = dp
;
1940 TREE_OVERFLOW (v
) = overflow
;
1944 /* Like build_real, but first truncate D to the type. */
1947 build_real_truncate (tree type
, REAL_VALUE_TYPE d
)
1949 return build_real (type
, real_value_truncate (TYPE_MODE (type
), d
));
1952 /* Return a new REAL_CST node whose type is TYPE
1953 and whose value is the integer value of the INTEGER_CST node I. */
1956 real_value_from_int_cst (const_tree type
, const_tree i
)
1960 /* Clear all bits of the real value type so that we can later do
1961 bitwise comparisons to see if two values are the same. */
1962 memset (&d
, 0, sizeof d
);
1964 real_from_integer (&d
, type
? TYPE_MODE (type
) : VOIDmode
, i
,
1965 TYPE_SIGN (TREE_TYPE (i
)));
1969 /* Given a tree representing an integer constant I, return a tree
1970 representing the same value as a floating-point constant of type TYPE. */
1973 build_real_from_int_cst (tree type
, const_tree i
)
1976 int overflow
= TREE_OVERFLOW (i
);
1978 v
= build_real (type
, real_value_from_int_cst (type
, i
));
1980 TREE_OVERFLOW (v
) |= overflow
;
1984 /* Return a newly constructed STRING_CST node whose value is
1985 the LEN characters at STR.
1986 Note that for a C string literal, LEN should include the trailing NUL.
1987 The TREE_TYPE is not initialized. */
1990 build_string (int len
, const char *str
)
1995 /* Do not waste bytes provided by padding of struct tree_string. */
1996 length
= len
+ offsetof (struct tree_string
, str
) + 1;
1998 record_node_allocation_statistics (STRING_CST
, length
);
2000 s
= (tree
) ggc_internal_alloc (length
);
2002 memset (s
, 0, sizeof (struct tree_typed
));
2003 TREE_SET_CODE (s
, STRING_CST
);
2004 TREE_CONSTANT (s
) = 1;
2005 TREE_STRING_LENGTH (s
) = len
;
2006 memcpy (s
->string
.str
, str
, len
);
2007 s
->string
.str
[len
] = '\0';
2012 /* Return a newly constructed COMPLEX_CST node whose value is
2013 specified by the real and imaginary parts REAL and IMAG.
2014 Both REAL and IMAG should be constant nodes. TYPE, if specified,
2015 will be the type of the COMPLEX_CST; otherwise a new type will be made. */
2018 build_complex (tree type
, tree real
, tree imag
)
2020 tree t
= make_node (COMPLEX_CST
);
2022 TREE_REALPART (t
) = real
;
2023 TREE_IMAGPART (t
) = imag
;
2024 TREE_TYPE (t
) = type
? type
: build_complex_type (TREE_TYPE (real
));
2025 TREE_OVERFLOW (t
) = TREE_OVERFLOW (real
) | TREE_OVERFLOW (imag
);
2029 /* Build a complex (inf +- 0i), such as for the result of cproj.
2030 TYPE is the complex tree type of the result. If NEG is true, the
2031 imaginary zero is negative. */
2034 build_complex_inf (tree type
, bool neg
)
2036 REAL_VALUE_TYPE rinf
, rzero
= dconst0
;
2040 return build_complex (type
, build_real (TREE_TYPE (type
), rinf
),
2041 build_real (TREE_TYPE (type
), rzero
));
2044 /* Return the constant 1 in type TYPE. If TYPE has several elements, each
2045 element is set to 1. In particular, this is 1 + i for complex types. */
2048 build_each_one_cst (tree type
)
2050 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2052 tree scalar
= build_one_cst (TREE_TYPE (type
));
2053 return build_complex (type
, scalar
, scalar
);
2056 return build_one_cst (type
);
2059 /* Return a constant of arithmetic type TYPE which is the
2060 multiplicative identity of the set TYPE. */
2063 build_one_cst (tree type
)
2065 switch (TREE_CODE (type
))
2067 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2068 case POINTER_TYPE
: case REFERENCE_TYPE
:
2070 return build_int_cst (type
, 1);
2073 return build_real (type
, dconst1
);
2075 case FIXED_POINT_TYPE
:
2076 /* We can only generate 1 for accum types. */
2077 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2078 return build_fixed (type
, FCONST1 (TYPE_MODE (type
)));
2082 tree scalar
= build_one_cst (TREE_TYPE (type
));
2084 return build_vector_from_val (type
, scalar
);
2088 return build_complex (type
,
2089 build_one_cst (TREE_TYPE (type
)),
2090 build_zero_cst (TREE_TYPE (type
)));
2097 /* Return an integer of type TYPE containing all 1's in as much precision as
2098 it contains, or a complex or vector whose subparts are such integers. */
2101 build_all_ones_cst (tree type
)
2103 if (TREE_CODE (type
) == COMPLEX_TYPE
)
2105 tree scalar
= build_all_ones_cst (TREE_TYPE (type
));
2106 return build_complex (type
, scalar
, scalar
);
2109 return build_minus_one_cst (type
);
2112 /* Return a constant of arithmetic type TYPE which is the
2113 opposite of the multiplicative identity of the set TYPE. */
2116 build_minus_one_cst (tree type
)
2118 switch (TREE_CODE (type
))
2120 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2121 case POINTER_TYPE
: case REFERENCE_TYPE
:
2123 return build_int_cst (type
, -1);
2126 return build_real (type
, dconstm1
);
2128 case FIXED_POINT_TYPE
:
2129 /* We can only generate 1 for accum types. */
2130 gcc_assert (ALL_SCALAR_ACCUM_MODE_P (TYPE_MODE (type
)));
2131 return build_fixed (type
, fixed_from_double_int (double_int_minus_one
,
2136 tree scalar
= build_minus_one_cst (TREE_TYPE (type
));
2138 return build_vector_from_val (type
, scalar
);
2142 return build_complex (type
,
2143 build_minus_one_cst (TREE_TYPE (type
)),
2144 build_zero_cst (TREE_TYPE (type
)));
2151 /* Build 0 constant of type TYPE. This is used by constructor folding
2152 and thus the constant should be represented in memory by
2156 build_zero_cst (tree type
)
2158 switch (TREE_CODE (type
))
2160 case INTEGER_TYPE
: case ENUMERAL_TYPE
: case BOOLEAN_TYPE
:
2161 case POINTER_TYPE
: case REFERENCE_TYPE
:
2162 case OFFSET_TYPE
: case NULLPTR_TYPE
:
2163 return build_int_cst (type
, 0);
2166 return build_real (type
, dconst0
);
2168 case FIXED_POINT_TYPE
:
2169 return build_fixed (type
, FCONST0 (TYPE_MODE (type
)));
2173 tree scalar
= build_zero_cst (TREE_TYPE (type
));
2175 return build_vector_from_val (type
, scalar
);
2180 tree zero
= build_zero_cst (TREE_TYPE (type
));
2182 return build_complex (type
, zero
, zero
);
2186 if (!AGGREGATE_TYPE_P (type
))
2187 return fold_convert (type
, integer_zero_node
);
2188 return build_constructor (type
, NULL
);
2193 /* Build a BINFO with LEN language slots. */
2196 make_tree_binfo_stat (unsigned base_binfos MEM_STAT_DECL
)
2199 size_t length
= (offsetof (struct tree_binfo
, base_binfos
)
2200 + vec
<tree
, va_gc
>::embedded_size (base_binfos
));
2202 record_node_allocation_statistics (TREE_BINFO
, length
);
2204 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
2206 memset (t
, 0, offsetof (struct tree_binfo
, base_binfos
));
2208 TREE_SET_CODE (t
, TREE_BINFO
);
2210 BINFO_BASE_BINFOS (t
)->embedded_init (base_binfos
);
2215 /* Create a CASE_LABEL_EXPR tree node and return it. */
2218 build_case_label (tree low_value
, tree high_value
, tree label_decl
)
2220 tree t
= make_node (CASE_LABEL_EXPR
);
2222 TREE_TYPE (t
) = void_type_node
;
2223 SET_EXPR_LOCATION (t
, DECL_SOURCE_LOCATION (label_decl
));
2225 CASE_LOW (t
) = low_value
;
2226 CASE_HIGH (t
) = high_value
;
2227 CASE_LABEL (t
) = label_decl
;
2228 CASE_CHAIN (t
) = NULL_TREE
;
2233 /* Build a newly constructed INTEGER_CST node. LEN and EXT_LEN are the
2234 values of TREE_INT_CST_NUNITS and TREE_INT_CST_EXT_NUNITS respectively.
2235 The latter determines the length of the HOST_WIDE_INT vector. */
2238 make_int_cst_stat (int len
, int ext_len MEM_STAT_DECL
)
2241 int length
= ((ext_len
- 1) * sizeof (HOST_WIDE_INT
)
2242 + sizeof (struct tree_int_cst
));
2245 record_node_allocation_statistics (INTEGER_CST
, length
);
2247 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2249 TREE_SET_CODE (t
, INTEGER_CST
);
2250 TREE_INT_CST_NUNITS (t
) = len
;
2251 TREE_INT_CST_EXT_NUNITS (t
) = ext_len
;
2252 /* to_offset can only be applied to trees that are offset_int-sized
2253 or smaller. EXT_LEN is correct if it fits, otherwise the constant
2254 must be exactly the precision of offset_int and so LEN is correct. */
2255 if (ext_len
<= OFFSET_INT_ELTS
)
2256 TREE_INT_CST_OFFSET_NUNITS (t
) = ext_len
;
2258 TREE_INT_CST_OFFSET_NUNITS (t
) = len
;
2260 TREE_CONSTANT (t
) = 1;
2265 /* Build a newly constructed TREE_VEC node of length LEN. */
2268 make_tree_vec_stat (int len MEM_STAT_DECL
)
2271 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2273 record_node_allocation_statistics (TREE_VEC
, length
);
2275 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
2277 TREE_SET_CODE (t
, TREE_VEC
);
2278 TREE_VEC_LENGTH (t
) = len
;
2283 /* Grow a TREE_VEC node to new length LEN. */
2286 grow_tree_vec_stat (tree v
, int len MEM_STAT_DECL
)
2288 gcc_assert (TREE_CODE (v
) == TREE_VEC
);
2290 int oldlen
= TREE_VEC_LENGTH (v
);
2291 gcc_assert (len
> oldlen
);
2293 int oldlength
= (oldlen
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2294 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_vec
);
2296 record_node_allocation_statistics (TREE_VEC
, length
- oldlength
);
2298 v
= (tree
) ggc_realloc (v
, length PASS_MEM_STAT
);
2300 TREE_VEC_LENGTH (v
) = len
;
2305 /* Return 1 if EXPR is the constant zero, whether it is integral, float or
2306 fixed, and scalar, complex or vector. */
2309 zerop (const_tree expr
)
2311 return (integer_zerop (expr
)
2312 || real_zerop (expr
)
2313 || fixed_zerop (expr
));
2316 /* Return 1 if EXPR is the integer constant zero or a complex constant
2320 integer_zerop (const_tree expr
)
2322 switch (TREE_CODE (expr
))
2325 return wi::eq_p (expr
, 0);
2327 return (integer_zerop (TREE_REALPART (expr
))
2328 && integer_zerop (TREE_IMAGPART (expr
)));
2332 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2333 if (!integer_zerop (VECTOR_CST_ELT (expr
, i
)))
2342 /* Return 1 if EXPR is the integer constant one or the corresponding
2343 complex constant. */
2346 integer_onep (const_tree expr
)
2348 switch (TREE_CODE (expr
))
2351 return wi::eq_p (wi::to_widest (expr
), 1);
2353 return (integer_onep (TREE_REALPART (expr
))
2354 && integer_zerop (TREE_IMAGPART (expr
)));
2358 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2359 if (!integer_onep (VECTOR_CST_ELT (expr
, i
)))
2368 /* Return 1 if EXPR is the integer constant one. For complex and vector,
2369 return 1 if every piece is the integer constant one. */
2372 integer_each_onep (const_tree expr
)
2374 if (TREE_CODE (expr
) == COMPLEX_CST
)
2375 return (integer_onep (TREE_REALPART (expr
))
2376 && integer_onep (TREE_IMAGPART (expr
)));
2378 return integer_onep (expr
);
2381 /* Return 1 if EXPR is an integer containing all 1's in as much precision as
2382 it contains, or a complex or vector whose subparts are such integers. */
2385 integer_all_onesp (const_tree expr
)
2387 if (TREE_CODE (expr
) == COMPLEX_CST
2388 && integer_all_onesp (TREE_REALPART (expr
))
2389 && integer_all_onesp (TREE_IMAGPART (expr
)))
2392 else if (TREE_CODE (expr
) == VECTOR_CST
)
2395 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2396 if (!integer_all_onesp (VECTOR_CST_ELT (expr
, i
)))
2401 else if (TREE_CODE (expr
) != INTEGER_CST
)
2404 return wi::max_value (TYPE_PRECISION (TREE_TYPE (expr
)), UNSIGNED
) == expr
;
2407 /* Return 1 if EXPR is the integer constant minus one. */
2410 integer_minus_onep (const_tree expr
)
2412 if (TREE_CODE (expr
) == COMPLEX_CST
)
2413 return (integer_all_onesp (TREE_REALPART (expr
))
2414 && integer_zerop (TREE_IMAGPART (expr
)));
2416 return integer_all_onesp (expr
);
2419 /* Return 1 if EXPR is an integer constant that is a power of 2 (i.e., has only
2423 integer_pow2p (const_tree expr
)
2425 if (TREE_CODE (expr
) == COMPLEX_CST
2426 && integer_pow2p (TREE_REALPART (expr
))
2427 && integer_zerop (TREE_IMAGPART (expr
)))
2430 if (TREE_CODE (expr
) != INTEGER_CST
)
2433 return wi::popcount (expr
) == 1;
2436 /* Return 1 if EXPR is an integer constant other than zero or a
2437 complex constant other than zero. */
2440 integer_nonzerop (const_tree expr
)
2442 return ((TREE_CODE (expr
) == INTEGER_CST
2443 && !wi::eq_p (expr
, 0))
2444 || (TREE_CODE (expr
) == COMPLEX_CST
2445 && (integer_nonzerop (TREE_REALPART (expr
))
2446 || integer_nonzerop (TREE_IMAGPART (expr
)))));
2449 /* Return 1 if EXPR is the integer constant one. For vector,
2450 return 1 if every piece is the integer constant minus one
2451 (representing the value TRUE). */
2454 integer_truep (const_tree expr
)
2456 if (TREE_CODE (expr
) == VECTOR_CST
)
2457 return integer_all_onesp (expr
);
2458 return integer_onep (expr
);
2461 /* Return 1 if EXPR is the fixed-point constant zero. */
2464 fixed_zerop (const_tree expr
)
2466 return (TREE_CODE (expr
) == FIXED_CST
2467 && TREE_FIXED_CST (expr
).data
.is_zero ());
2470 /* Return the power of two represented by a tree node known to be a
2474 tree_log2 (const_tree expr
)
2476 if (TREE_CODE (expr
) == COMPLEX_CST
)
2477 return tree_log2 (TREE_REALPART (expr
));
2479 return wi::exact_log2 (expr
);
2482 /* Similar, but return the largest integer Y such that 2 ** Y is less
2483 than or equal to EXPR. */
2486 tree_floor_log2 (const_tree expr
)
2488 if (TREE_CODE (expr
) == COMPLEX_CST
)
2489 return tree_log2 (TREE_REALPART (expr
));
2491 return wi::floor_log2 (expr
);
2494 /* Return number of known trailing zero bits in EXPR, or, if the value of
2495 EXPR is known to be zero, the precision of it's type. */
2498 tree_ctz (const_tree expr
)
2500 if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
2501 && !POINTER_TYPE_P (TREE_TYPE (expr
)))
2504 unsigned int ret1
, ret2
, prec
= TYPE_PRECISION (TREE_TYPE (expr
));
2505 switch (TREE_CODE (expr
))
2508 ret1
= wi::ctz (expr
);
2509 return MIN (ret1
, prec
);
2511 ret1
= wi::ctz (get_nonzero_bits (expr
));
2512 return MIN (ret1
, prec
);
2519 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2522 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2523 return MIN (ret1
, ret2
);
2524 case POINTER_PLUS_EXPR
:
2525 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2526 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2527 /* Second operand is sizetype, which could be in theory
2528 wider than pointer's precision. Make sure we never
2529 return more than prec. */
2530 ret2
= MIN (ret2
, prec
);
2531 return MIN (ret1
, ret2
);
2533 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2534 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2535 return MAX (ret1
, ret2
);
2537 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2538 ret2
= tree_ctz (TREE_OPERAND (expr
, 1));
2539 return MIN (ret1
+ ret2
, prec
);
2541 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2542 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2543 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2545 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2546 return MIN (ret1
+ ret2
, prec
);
2550 if (tree_fits_uhwi_p (TREE_OPERAND (expr
, 1))
2551 && (tree_to_uhwi (TREE_OPERAND (expr
, 1)) < prec
))
2553 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2554 ret2
= tree_to_uhwi (TREE_OPERAND (expr
, 1));
2559 case TRUNC_DIV_EXPR
:
2561 case FLOOR_DIV_EXPR
:
2562 case ROUND_DIV_EXPR
:
2563 case EXACT_DIV_EXPR
:
2564 if (TREE_CODE (TREE_OPERAND (expr
, 1)) == INTEGER_CST
2565 && tree_int_cst_sgn (TREE_OPERAND (expr
, 1)) == 1)
2567 int l
= tree_log2 (TREE_OPERAND (expr
, 1));
2570 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2578 ret1
= tree_ctz (TREE_OPERAND (expr
, 0));
2579 if (ret1
&& ret1
== TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (expr
, 0))))
2581 return MIN (ret1
, prec
);
2583 return tree_ctz (TREE_OPERAND (expr
, 0));
2585 ret1
= tree_ctz (TREE_OPERAND (expr
, 1));
2588 ret2
= tree_ctz (TREE_OPERAND (expr
, 2));
2589 return MIN (ret1
, ret2
);
2591 return tree_ctz (TREE_OPERAND (expr
, 1));
2593 ret1
= get_pointer_alignment (CONST_CAST_TREE (expr
));
2594 if (ret1
> BITS_PER_UNIT
)
2596 ret1
= ctz_hwi (ret1
/ BITS_PER_UNIT
);
2597 return MIN (ret1
, prec
);
2605 /* Return 1 if EXPR is the real constant zero. Trailing zeroes matter for
2606 decimal float constants, so don't return 1 for them. */
2609 real_zerop (const_tree expr
)
2611 switch (TREE_CODE (expr
))
2614 return real_equal (&TREE_REAL_CST (expr
), &dconst0
)
2615 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2617 return real_zerop (TREE_REALPART (expr
))
2618 && real_zerop (TREE_IMAGPART (expr
));
2622 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2623 if (!real_zerop (VECTOR_CST_ELT (expr
, i
)))
2632 /* Return 1 if EXPR is the real constant one in real or complex form.
2633 Trailing zeroes matter for decimal float constants, so don't return
2637 real_onep (const_tree expr
)
2639 switch (TREE_CODE (expr
))
2642 return real_equal (&TREE_REAL_CST (expr
), &dconst1
)
2643 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2645 return real_onep (TREE_REALPART (expr
))
2646 && real_zerop (TREE_IMAGPART (expr
));
2650 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2651 if (!real_onep (VECTOR_CST_ELT (expr
, i
)))
2660 /* Return 1 if EXPR is the real constant minus one. Trailing zeroes
2661 matter for decimal float constants, so don't return 1 for them. */
2664 real_minus_onep (const_tree expr
)
2666 switch (TREE_CODE (expr
))
2669 return real_equal (&TREE_REAL_CST (expr
), &dconstm1
)
2670 && !(DECIMAL_FLOAT_MODE_P (TYPE_MODE (TREE_TYPE (expr
))));
2672 return real_minus_onep (TREE_REALPART (expr
))
2673 && real_zerop (TREE_IMAGPART (expr
));
2677 for (i
= 0; i
< VECTOR_CST_NELTS (expr
); ++i
)
2678 if (!real_minus_onep (VECTOR_CST_ELT (expr
, i
)))
2687 /* Nonzero if EXP is a constant or a cast of a constant. */
2690 really_constant_p (const_tree exp
)
2692 /* This is not quite the same as STRIP_NOPS. It does more. */
2693 while (CONVERT_EXPR_P (exp
)
2694 || TREE_CODE (exp
) == NON_LVALUE_EXPR
)
2695 exp
= TREE_OPERAND (exp
, 0);
2696 return TREE_CONSTANT (exp
);
2699 /* Return first list element whose TREE_VALUE is ELEM.
2700 Return 0 if ELEM is not in LIST. */
2703 value_member (tree elem
, tree list
)
2707 if (elem
== TREE_VALUE (list
))
2709 list
= TREE_CHAIN (list
);
2714 /* Return first list element whose TREE_PURPOSE is ELEM.
2715 Return 0 if ELEM is not in LIST. */
2718 purpose_member (const_tree elem
, tree list
)
2722 if (elem
== TREE_PURPOSE (list
))
2724 list
= TREE_CHAIN (list
);
2729 /* Return true if ELEM is in V. */
2732 vec_member (const_tree elem
, vec
<tree
, va_gc
> *v
)
2736 FOR_EACH_VEC_SAFE_ELT (v
, ix
, t
)
2742 /* Returns element number IDX (zero-origin) of chain CHAIN, or
2746 chain_index (int idx
, tree chain
)
2748 for (; chain
&& idx
> 0; --idx
)
2749 chain
= TREE_CHAIN (chain
);
2753 /* Return nonzero if ELEM is part of the chain CHAIN. */
2756 chain_member (const_tree elem
, const_tree chain
)
2762 chain
= DECL_CHAIN (chain
);
2768 /* Return the length of a chain of nodes chained through TREE_CHAIN.
2769 We expect a null pointer to mark the end of the chain.
2770 This is the Lisp primitive `length'. */
2773 list_length (const_tree t
)
2776 #ifdef ENABLE_TREE_CHECKING
2784 #ifdef ENABLE_TREE_CHECKING
2787 gcc_assert (p
!= q
);
2795 /* Returns the first FIELD_DECL in the TYPE_FIELDS of the RECORD_TYPE or
2796 UNION_TYPE TYPE, or NULL_TREE if none. */
2799 first_field (const_tree type
)
2801 tree t
= TYPE_FIELDS (type
);
2802 while (t
&& TREE_CODE (t
) != FIELD_DECL
)
2807 /* Concatenate two chains of nodes (chained through TREE_CHAIN)
2808 by modifying the last node in chain 1 to point to chain 2.
2809 This is the Lisp primitive `nconc'. */
2812 chainon (tree op1
, tree op2
)
2821 for (t1
= op1
; TREE_CHAIN (t1
); t1
= TREE_CHAIN (t1
))
2823 TREE_CHAIN (t1
) = op2
;
2825 #ifdef ENABLE_TREE_CHECKING
2828 for (t2
= op2
; t2
; t2
= TREE_CHAIN (t2
))
2829 gcc_assert (t2
!= t1
);
2836 /* Return the last node in a chain of nodes (chained through TREE_CHAIN). */
2839 tree_last (tree chain
)
2843 while ((next
= TREE_CHAIN (chain
)))
2848 /* Reverse the order of elements in the chain T,
2849 and return the new head of the chain (old last element). */
2854 tree prev
= 0, decl
, next
;
2855 for (decl
= t
; decl
; decl
= next
)
2857 /* We shouldn't be using this function to reverse BLOCK chains; we
2858 have blocks_nreverse for that. */
2859 gcc_checking_assert (TREE_CODE (decl
) != BLOCK
);
2860 next
= TREE_CHAIN (decl
);
2861 TREE_CHAIN (decl
) = prev
;
2867 /* Return a newly created TREE_LIST node whose
2868 purpose and value fields are PARM and VALUE. */
2871 build_tree_list_stat (tree parm
, tree value MEM_STAT_DECL
)
2873 tree t
= make_node_stat (TREE_LIST PASS_MEM_STAT
);
2874 TREE_PURPOSE (t
) = parm
;
2875 TREE_VALUE (t
) = value
;
2879 /* Build a chain of TREE_LIST nodes from a vector. */
2882 build_tree_list_vec_stat (const vec
<tree
, va_gc
> *vec MEM_STAT_DECL
)
2884 tree ret
= NULL_TREE
;
2888 FOR_EACH_VEC_SAFE_ELT (vec
, i
, t
)
2890 *pp
= build_tree_list_stat (NULL
, t PASS_MEM_STAT
);
2891 pp
= &TREE_CHAIN (*pp
);
2896 /* Return a newly created TREE_LIST node whose
2897 purpose and value fields are PURPOSE and VALUE
2898 and whose TREE_CHAIN is CHAIN. */
2901 tree_cons_stat (tree purpose
, tree value
, tree chain MEM_STAT_DECL
)
2905 node
= ggc_alloc_tree_node_stat (sizeof (struct tree_list
) PASS_MEM_STAT
);
2906 memset (node
, 0, sizeof (struct tree_common
));
2908 record_node_allocation_statistics (TREE_LIST
, sizeof (struct tree_list
));
2910 TREE_SET_CODE (node
, TREE_LIST
);
2911 TREE_CHAIN (node
) = chain
;
2912 TREE_PURPOSE (node
) = purpose
;
2913 TREE_VALUE (node
) = value
;
2917 /* Return the values of the elements of a CONSTRUCTOR as a vector of
2921 ctor_to_vec (tree ctor
)
2923 vec
<tree
, va_gc
> *vec
;
2924 vec_alloc (vec
, CONSTRUCTOR_NELTS (ctor
));
2928 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (ctor
), ix
, val
)
2929 vec
->quick_push (val
);
2934 /* Return the size nominally occupied by an object of type TYPE
2935 when it resides in memory. The value is measured in units of bytes,
2936 and its data type is that normally used for type sizes
2937 (which is the first type created by make_signed_type or
2938 make_unsigned_type). */
2941 size_in_bytes_loc (location_t loc
, const_tree type
)
2945 if (type
== error_mark_node
)
2946 return integer_zero_node
;
2948 type
= TYPE_MAIN_VARIANT (type
);
2949 t
= TYPE_SIZE_UNIT (type
);
2953 lang_hooks
.types
.incomplete_type_error (loc
, NULL_TREE
, type
);
2954 return size_zero_node
;
2960 /* Return the size of TYPE (in bytes) as a wide integer
2961 or return -1 if the size can vary or is larger than an integer. */
2964 int_size_in_bytes (const_tree type
)
2968 if (type
== error_mark_node
)
2971 type
= TYPE_MAIN_VARIANT (type
);
2972 t
= TYPE_SIZE_UNIT (type
);
2974 if (t
&& tree_fits_uhwi_p (t
))
2975 return TREE_INT_CST_LOW (t
);
2980 /* Return the maximum size of TYPE (in bytes) as a wide integer
2981 or return -1 if the size can vary or is larger than an integer. */
2984 max_int_size_in_bytes (const_tree type
)
2986 HOST_WIDE_INT size
= -1;
2989 /* If this is an array type, check for a possible MAX_SIZE attached. */
2991 if (TREE_CODE (type
) == ARRAY_TYPE
)
2993 size_tree
= TYPE_ARRAY_MAX_SIZE (type
);
2995 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
2996 size
= tree_to_uhwi (size_tree
);
2999 /* If we still haven't been able to get a size, see if the language
3000 can compute a maximum size. */
3004 size_tree
= lang_hooks
.types
.max_size (type
);
3006 if (size_tree
&& tree_fits_uhwi_p (size_tree
))
3007 size
= tree_to_uhwi (size_tree
);
3013 /* Return the bit position of FIELD, in bits from the start of the record.
3014 This is a tree of type bitsizetype. */
3017 bit_position (const_tree field
)
3019 return bit_from_pos (DECL_FIELD_OFFSET (field
),
3020 DECL_FIELD_BIT_OFFSET (field
));
3023 /* Return the byte position of FIELD, in bytes from the start of the record.
3024 This is a tree of type sizetype. */
3027 byte_position (const_tree field
)
3029 return byte_from_pos (DECL_FIELD_OFFSET (field
),
3030 DECL_FIELD_BIT_OFFSET (field
));
3033 /* Likewise, but return as an integer. It must be representable in
3034 that way (since it could be a signed value, we don't have the
3035 option of returning -1 like int_size_in_byte can. */
3038 int_byte_position (const_tree field
)
3040 return tree_to_shwi (byte_position (field
));
3043 /* Return the strictest alignment, in bits, that T is known to have. */
3046 expr_align (const_tree t
)
3048 unsigned int align0
, align1
;
3050 switch (TREE_CODE (t
))
3052 CASE_CONVERT
: case NON_LVALUE_EXPR
:
3053 /* If we have conversions, we know that the alignment of the
3054 object must meet each of the alignments of the types. */
3055 align0
= expr_align (TREE_OPERAND (t
, 0));
3056 align1
= TYPE_ALIGN (TREE_TYPE (t
));
3057 return MAX (align0
, align1
);
3059 case SAVE_EXPR
: case COMPOUND_EXPR
: case MODIFY_EXPR
:
3060 case INIT_EXPR
: case TARGET_EXPR
: case WITH_CLEANUP_EXPR
:
3061 case CLEANUP_POINT_EXPR
:
3062 /* These don't change the alignment of an object. */
3063 return expr_align (TREE_OPERAND (t
, 0));
3066 /* The best we can do is say that the alignment is the least aligned
3068 align0
= expr_align (TREE_OPERAND (t
, 1));
3069 align1
= expr_align (TREE_OPERAND (t
, 2));
3070 return MIN (align0
, align1
);
3072 /* FIXME: LABEL_DECL and CONST_DECL never have DECL_ALIGN set
3073 meaningfully, it's always 1. */
3074 case LABEL_DECL
: case CONST_DECL
:
3075 case VAR_DECL
: case PARM_DECL
: case RESULT_DECL
:
3077 gcc_assert (DECL_ALIGN (t
) != 0);
3078 return DECL_ALIGN (t
);
3084 /* Otherwise take the alignment from that of the type. */
3085 return TYPE_ALIGN (TREE_TYPE (t
));
3088 /* Return, as a tree node, the number of elements for TYPE (which is an
3089 ARRAY_TYPE) minus one. This counts only elements of the top array. */
3092 array_type_nelts (const_tree type
)
3094 tree index_type
, min
, max
;
3096 /* If they did it with unspecified bounds, then we should have already
3097 given an error about it before we got here. */
3098 if (! TYPE_DOMAIN (type
))
3099 return error_mark_node
;
3101 index_type
= TYPE_DOMAIN (type
);
3102 min
= TYPE_MIN_VALUE (index_type
);
3103 max
= TYPE_MAX_VALUE (index_type
);
3105 /* TYPE_MAX_VALUE may not be set if the array has unknown length. */
3107 return error_mark_node
;
3109 return (integer_zerop (min
)
3111 : fold_build2 (MINUS_EXPR
, TREE_TYPE (max
), max
, min
));
3114 /* If arg is static -- a reference to an object in static storage -- then
3115 return the object. This is not the same as the C meaning of `static'.
3116 If arg isn't static, return NULL. */
3121 switch (TREE_CODE (arg
))
3124 /* Nested functions are static, even though taking their address will
3125 involve a trampoline as we unnest the nested function and create
3126 the trampoline on the tree level. */
3130 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3131 && ! DECL_THREAD_LOCAL_P (arg
)
3132 && ! DECL_DLLIMPORT_P (arg
)
3136 return ((TREE_STATIC (arg
) || DECL_EXTERNAL (arg
))
3140 return TREE_STATIC (arg
) ? arg
: NULL
;
3147 /* If the thing being referenced is not a field, then it is
3148 something language specific. */
3149 gcc_assert (TREE_CODE (TREE_OPERAND (arg
, 1)) == FIELD_DECL
);
3151 /* If we are referencing a bitfield, we can't evaluate an
3152 ADDR_EXPR at compile time and so it isn't a constant. */
3153 if (DECL_BIT_FIELD (TREE_OPERAND (arg
, 1)))
3156 return staticp (TREE_OPERAND (arg
, 0));
3162 return TREE_CONSTANT (TREE_OPERAND (arg
, 0)) ? arg
: NULL
;
3165 case ARRAY_RANGE_REF
:
3166 if (TREE_CODE (TYPE_SIZE (TREE_TYPE (arg
))) == INTEGER_CST
3167 && TREE_CODE (TREE_OPERAND (arg
, 1)) == INTEGER_CST
)
3168 return staticp (TREE_OPERAND (arg
, 0));
3172 case COMPOUND_LITERAL_EXPR
:
3173 return TREE_STATIC (COMPOUND_LITERAL_EXPR_DECL (arg
)) ? arg
: NULL
;
3183 /* Return whether OP is a DECL whose address is function-invariant. */
3186 decl_address_invariant_p (const_tree op
)
3188 /* The conditions below are slightly less strict than the one in
3191 switch (TREE_CODE (op
))
3200 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3201 || DECL_THREAD_LOCAL_P (op
)
3202 || DECL_CONTEXT (op
) == current_function_decl
3203 || decl_function_context (op
) == current_function_decl
)
3208 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3209 || decl_function_context (op
) == current_function_decl
)
3220 /* Return whether OP is a DECL whose address is interprocedural-invariant. */
3223 decl_address_ip_invariant_p (const_tree op
)
3225 /* The conditions below are slightly less strict than the one in
3228 switch (TREE_CODE (op
))
3236 if (((TREE_STATIC (op
) || DECL_EXTERNAL (op
))
3237 && !DECL_DLLIMPORT_P (op
))
3238 || DECL_THREAD_LOCAL_P (op
))
3243 if ((TREE_STATIC (op
) || DECL_EXTERNAL (op
)))
3255 /* Return true if T is function-invariant (internal function, does
3256 not handle arithmetic; that's handled in skip_simple_arithmetic and
3257 tree_invariant_p). */
3260 tree_invariant_p_1 (tree t
)
3264 if (TREE_CONSTANT (t
)
3265 || (TREE_READONLY (t
) && !TREE_SIDE_EFFECTS (t
)))
3268 switch (TREE_CODE (t
))
3274 op
= TREE_OPERAND (t
, 0);
3275 while (handled_component_p (op
))
3277 switch (TREE_CODE (op
))
3280 case ARRAY_RANGE_REF
:
3281 if (!tree_invariant_p (TREE_OPERAND (op
, 1))
3282 || TREE_OPERAND (op
, 2) != NULL_TREE
3283 || TREE_OPERAND (op
, 3) != NULL_TREE
)
3288 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
3294 op
= TREE_OPERAND (op
, 0);
3297 return CONSTANT_CLASS_P (op
) || decl_address_invariant_p (op
);
3306 /* Return true if T is function-invariant. */
3309 tree_invariant_p (tree t
)
3311 tree inner
= skip_simple_arithmetic (t
);
3312 return tree_invariant_p_1 (inner
);
3315 /* Wrap a SAVE_EXPR around EXPR, if appropriate.
3316 Do this to any expression which may be used in more than one place,
3317 but must be evaluated only once.
3319 Normally, expand_expr would reevaluate the expression each time.
3320 Calling save_expr produces something that is evaluated and recorded
3321 the first time expand_expr is called on it. Subsequent calls to
3322 expand_expr just reuse the recorded value.
3324 The call to expand_expr that generates code that actually computes
3325 the value is the first call *at compile time*. Subsequent calls
3326 *at compile time* generate code to use the saved value.
3327 This produces correct result provided that *at run time* control
3328 always flows through the insns made by the first expand_expr
3329 before reaching the other places where the save_expr was evaluated.
3330 You, the caller of save_expr, must make sure this is so.
3332 Constants, and certain read-only nodes, are returned with no
3333 SAVE_EXPR because that is safe. Expressions containing placeholders
3334 are not touched; see tree.def for an explanation of what these
3338 save_expr (tree expr
)
3340 tree t
= fold (expr
);
3343 /* If the tree evaluates to a constant, then we don't want to hide that
3344 fact (i.e. this allows further folding, and direct checks for constants).
3345 However, a read-only object that has side effects cannot be bypassed.
3346 Since it is no problem to reevaluate literals, we just return the
3348 inner
= skip_simple_arithmetic (t
);
3349 if (TREE_CODE (inner
) == ERROR_MARK
)
3352 if (tree_invariant_p_1 (inner
))
3355 /* If INNER contains a PLACEHOLDER_EXPR, we must evaluate it each time, since
3356 it means that the size or offset of some field of an object depends on
3357 the value within another field.
3359 Note that it must not be the case that T contains both a PLACEHOLDER_EXPR
3360 and some variable since it would then need to be both evaluated once and
3361 evaluated more than once. Front-ends must assure this case cannot
3362 happen by surrounding any such subexpressions in their own SAVE_EXPR
3363 and forcing evaluation at the proper time. */
3364 if (contains_placeholder_p (inner
))
3367 t
= build1 (SAVE_EXPR
, TREE_TYPE (expr
), t
);
3368 SET_EXPR_LOCATION (t
, EXPR_LOCATION (expr
));
3370 /* This expression might be placed ahead of a jump to ensure that the
3371 value was computed on both sides of the jump. So make sure it isn't
3372 eliminated as dead. */
3373 TREE_SIDE_EFFECTS (t
) = 1;
3377 /* Look inside EXPR into any simple arithmetic operations. Return the
3378 outermost non-arithmetic or non-invariant node. */
3381 skip_simple_arithmetic (tree expr
)
3383 /* We don't care about whether this can be used as an lvalue in this
3385 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3386 expr
= TREE_OPERAND (expr
, 0);
3388 /* If we have simple operations applied to a SAVE_EXPR or to a SAVE_EXPR and
3389 a constant, it will be more efficient to not make another SAVE_EXPR since
3390 it will allow better simplification and GCSE will be able to merge the
3391 computations if they actually occur. */
3394 if (UNARY_CLASS_P (expr
))
3395 expr
= TREE_OPERAND (expr
, 0);
3396 else if (BINARY_CLASS_P (expr
))
3398 if (tree_invariant_p (TREE_OPERAND (expr
, 1)))
3399 expr
= TREE_OPERAND (expr
, 0);
3400 else if (tree_invariant_p (TREE_OPERAND (expr
, 0)))
3401 expr
= TREE_OPERAND (expr
, 1);
3412 /* Look inside EXPR into simple arithmetic operations involving constants.
3413 Return the outermost non-arithmetic or non-constant node. */
3416 skip_simple_constant_arithmetic (tree expr
)
3418 while (TREE_CODE (expr
) == NON_LVALUE_EXPR
)
3419 expr
= TREE_OPERAND (expr
, 0);
3423 if (UNARY_CLASS_P (expr
))
3424 expr
= TREE_OPERAND (expr
, 0);
3425 else if (BINARY_CLASS_P (expr
))
3427 if (TREE_CONSTANT (TREE_OPERAND (expr
, 1)))
3428 expr
= TREE_OPERAND (expr
, 0);
3429 else if (TREE_CONSTANT (TREE_OPERAND (expr
, 0)))
3430 expr
= TREE_OPERAND (expr
, 1);
3441 /* Return which tree structure is used by T. */
3443 enum tree_node_structure_enum
3444 tree_node_structure (const_tree t
)
3446 const enum tree_code code
= TREE_CODE (t
);
3447 return tree_node_structure_for_code (code
);
3450 /* Set various status flags when building a CALL_EXPR object T. */
3453 process_call_operands (tree t
)
3455 bool side_effects
= TREE_SIDE_EFFECTS (t
);
3456 bool read_only
= false;
3457 int i
= call_expr_flags (t
);
3459 /* Calls have side-effects, except those to const or pure functions. */
3460 if ((i
& ECF_LOOPING_CONST_OR_PURE
) || !(i
& (ECF_CONST
| ECF_PURE
)))
3461 side_effects
= true;
3462 /* Propagate TREE_READONLY of arguments for const functions. */
3466 if (!side_effects
|| read_only
)
3467 for (i
= 1; i
< TREE_OPERAND_LENGTH (t
); i
++)
3469 tree op
= TREE_OPERAND (t
, i
);
3470 if (op
&& TREE_SIDE_EFFECTS (op
))
3471 side_effects
= true;
3472 if (op
&& !TREE_READONLY (op
) && !CONSTANT_CLASS_P (op
))
3476 TREE_SIDE_EFFECTS (t
) = side_effects
;
3477 TREE_READONLY (t
) = read_only
;
3480 /* Return true if EXP contains a PLACEHOLDER_EXPR, i.e. if it represents a
3481 size or offset that depends on a field within a record. */
3484 contains_placeholder_p (const_tree exp
)
3486 enum tree_code code
;
3491 code
= TREE_CODE (exp
);
3492 if (code
== PLACEHOLDER_EXPR
)
3495 switch (TREE_CODE_CLASS (code
))
3498 /* Don't look at any PLACEHOLDER_EXPRs that might be in index or bit
3499 position computations since they will be converted into a
3500 WITH_RECORD_EXPR involving the reference, which will assume
3501 here will be valid. */
3502 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3504 case tcc_exceptional
:
3505 if (code
== TREE_LIST
)
3506 return (CONTAINS_PLACEHOLDER_P (TREE_VALUE (exp
))
3507 || CONTAINS_PLACEHOLDER_P (TREE_CHAIN (exp
)));
3512 case tcc_comparison
:
3513 case tcc_expression
:
3517 /* Ignoring the first operand isn't quite right, but works best. */
3518 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1));
3521 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3522 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1))
3523 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 2)));
3526 /* The save_expr function never wraps anything containing
3527 a PLACEHOLDER_EXPR. */
3534 switch (TREE_CODE_LENGTH (code
))
3537 return CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0));
3539 return (CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 0))
3540 || CONTAINS_PLACEHOLDER_P (TREE_OPERAND (exp
, 1)));
3551 const_call_expr_arg_iterator iter
;
3552 FOR_EACH_CONST_CALL_EXPR_ARG (arg
, iter
, exp
)
3553 if (CONTAINS_PLACEHOLDER_P (arg
))
3567 /* Return true if any part of the structure of TYPE involves a PLACEHOLDER_EXPR
3568 directly. This includes size, bounds, qualifiers (for QUAL_UNION_TYPE) and
3572 type_contains_placeholder_1 (const_tree type
)
3574 /* If the size contains a placeholder or the parent type (component type in
3575 the case of arrays) type involves a placeholder, this type does. */
3576 if (CONTAINS_PLACEHOLDER_P (TYPE_SIZE (type
))
3577 || CONTAINS_PLACEHOLDER_P (TYPE_SIZE_UNIT (type
))
3578 || (!POINTER_TYPE_P (type
)
3580 && type_contains_placeholder_p (TREE_TYPE (type
))))
3583 /* Now do type-specific checks. Note that the last part of the check above
3584 greatly limits what we have to do below. */
3585 switch (TREE_CODE (type
))
3588 case POINTER_BOUNDS_TYPE
:
3594 case REFERENCE_TYPE
:
3603 case FIXED_POINT_TYPE
:
3604 /* Here we just check the bounds. */
3605 return (CONTAINS_PLACEHOLDER_P (TYPE_MIN_VALUE (type
))
3606 || CONTAINS_PLACEHOLDER_P (TYPE_MAX_VALUE (type
)));
3609 /* We have already checked the component type above, so just check
3610 the domain type. Flexible array members have a null domain. */
3611 return TYPE_DOMAIN (type
) ?
3612 type_contains_placeholder_p (TYPE_DOMAIN (type
)) : false;
3616 case QUAL_UNION_TYPE
:
3620 for (field
= TYPE_FIELDS (type
); field
; field
= DECL_CHAIN (field
))
3621 if (TREE_CODE (field
) == FIELD_DECL
3622 && (CONTAINS_PLACEHOLDER_P (DECL_FIELD_OFFSET (field
))
3623 || (TREE_CODE (type
) == QUAL_UNION_TYPE
3624 && CONTAINS_PLACEHOLDER_P (DECL_QUALIFIER (field
)))
3625 || type_contains_placeholder_p (TREE_TYPE (field
))))
3636 /* Wrapper around above function used to cache its result. */
3639 type_contains_placeholder_p (tree type
)
3643 /* If the contains_placeholder_bits field has been initialized,
3644 then we know the answer. */
3645 if (TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) > 0)
3646 return TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) - 1;
3648 /* Indicate that we've seen this type node, and the answer is false.
3649 This is what we want to return if we run into recursion via fields. */
3650 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = 1;
3652 /* Compute the real value. */
3653 result
= type_contains_placeholder_1 (type
);
3655 /* Store the real value. */
3656 TYPE_CONTAINS_PLACEHOLDER_INTERNAL (type
) = result
+ 1;
3661 /* Push tree EXP onto vector QUEUE if it is not already present. */
3664 push_without_duplicates (tree exp
, vec
<tree
> *queue
)
3669 FOR_EACH_VEC_ELT (*queue
, i
, iter
)
3670 if (simple_cst_equal (iter
, exp
) == 1)
3674 queue
->safe_push (exp
);
3677 /* Given a tree EXP, find all occurrences of references to fields
3678 in a PLACEHOLDER_EXPR and place them in vector REFS without
3679 duplicates. Also record VAR_DECLs and CONST_DECLs. Note that
3680 we assume here that EXP contains only arithmetic expressions
3681 or CALL_EXPRs with PLACEHOLDER_EXPRs occurring only in their
3685 find_placeholder_in_expr (tree exp
, vec
<tree
> *refs
)
3687 enum tree_code code
= TREE_CODE (exp
);
3691 /* We handle TREE_LIST and COMPONENT_REF separately. */
3692 if (code
== TREE_LIST
)
3694 FIND_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), refs
);
3695 FIND_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), refs
);
3697 else if (code
== COMPONENT_REF
)
3699 for (inner
= TREE_OPERAND (exp
, 0);
3700 REFERENCE_CLASS_P (inner
);
3701 inner
= TREE_OPERAND (inner
, 0))
3704 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
)
3705 push_without_duplicates (exp
, refs
);
3707 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), refs
);
3710 switch (TREE_CODE_CLASS (code
))
3715 case tcc_declaration
:
3716 /* Variables allocated to static storage can stay. */
3717 if (!TREE_STATIC (exp
))
3718 push_without_duplicates (exp
, refs
);
3721 case tcc_expression
:
3722 /* This is the pattern built in ada/make_aligning_type. */
3723 if (code
== ADDR_EXPR
3724 && TREE_CODE (TREE_OPERAND (exp
, 0)) == PLACEHOLDER_EXPR
)
3726 push_without_duplicates (exp
, refs
);
3732 case tcc_exceptional
:
3735 case tcc_comparison
:
3737 for (i
= 0; i
< TREE_CODE_LENGTH (code
); i
++)
3738 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3742 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3743 FIND_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, i
), refs
);
3751 /* Given a tree EXP, a FIELD_DECL F, and a replacement value R,
3752 return a tree with all occurrences of references to F in a
3753 PLACEHOLDER_EXPR replaced by R. Also handle VAR_DECLs and
3754 CONST_DECLs. Note that we assume here that EXP contains only
3755 arithmetic expressions or CALL_EXPRs with PLACEHOLDER_EXPRs
3756 occurring only in their argument list. */
3759 substitute_in_expr (tree exp
, tree f
, tree r
)
3761 enum tree_code code
= TREE_CODE (exp
);
3762 tree op0
, op1
, op2
, op3
;
3765 /* We handle TREE_LIST and COMPONENT_REF separately. */
3766 if (code
== TREE_LIST
)
3768 op0
= SUBSTITUTE_IN_EXPR (TREE_CHAIN (exp
), f
, r
);
3769 op1
= SUBSTITUTE_IN_EXPR (TREE_VALUE (exp
), f
, r
);
3770 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3773 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3775 else if (code
== COMPONENT_REF
)
3779 /* If this expression is getting a value from a PLACEHOLDER_EXPR
3780 and it is the right field, replace it with R. */
3781 for (inner
= TREE_OPERAND (exp
, 0);
3782 REFERENCE_CLASS_P (inner
);
3783 inner
= TREE_OPERAND (inner
, 0))
3787 op1
= TREE_OPERAND (exp
, 1);
3789 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& op1
== f
)
3792 /* If this expression hasn't been completed let, leave it alone. */
3793 if (TREE_CODE (inner
) == PLACEHOLDER_EXPR
&& !TREE_TYPE (inner
))
3796 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3797 if (op0
== TREE_OPERAND (exp
, 0))
3801 = fold_build3 (COMPONENT_REF
, TREE_TYPE (exp
), op0
, op1
, NULL_TREE
);
3804 switch (TREE_CODE_CLASS (code
))
3809 case tcc_declaration
:
3815 case tcc_expression
:
3821 case tcc_exceptional
:
3824 case tcc_comparison
:
3826 switch (TREE_CODE_LENGTH (code
))
3832 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3833 if (op0
== TREE_OPERAND (exp
, 0))
3836 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
3840 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3841 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3843 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
3846 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
3850 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3851 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3852 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3854 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3855 && op2
== TREE_OPERAND (exp
, 2))
3858 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
3862 op0
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 0), f
, r
);
3863 op1
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 1), f
, r
);
3864 op2
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 2), f
, r
);
3865 op3
= SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp
, 3), f
, r
);
3867 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
3868 && op2
== TREE_OPERAND (exp
, 2)
3869 && op3
== TREE_OPERAND (exp
, 3))
3873 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
3885 new_tree
= NULL_TREE
;
3887 /* If we are trying to replace F with a constant, inline back
3888 functions which do nothing else than computing a value from
3889 the arguments they are passed. This makes it possible to
3890 fold partially or entirely the replacement expression. */
3891 if (CONSTANT_CLASS_P (r
) && code
== CALL_EXPR
)
3893 tree t
= maybe_inline_call_in_expr (exp
);
3895 return SUBSTITUTE_IN_EXPR (t
, f
, r
);
3898 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
3900 tree op
= TREE_OPERAND (exp
, i
);
3901 tree new_op
= SUBSTITUTE_IN_EXPR (op
, f
, r
);
3905 new_tree
= copy_node (exp
);
3906 TREE_OPERAND (new_tree
, i
) = new_op
;
3912 new_tree
= fold (new_tree
);
3913 if (TREE_CODE (new_tree
) == CALL_EXPR
)
3914 process_call_operands (new_tree
);
3925 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
3927 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
3928 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
3933 /* Similar, but look for a PLACEHOLDER_EXPR in EXP and find a replacement
3934 for it within OBJ, a tree that is an object or a chain of references. */
3937 substitute_placeholder_in_expr (tree exp
, tree obj
)
3939 enum tree_code code
= TREE_CODE (exp
);
3940 tree op0
, op1
, op2
, op3
;
3943 /* If this is a PLACEHOLDER_EXPR, see if we find a corresponding type
3944 in the chain of OBJ. */
3945 if (code
== PLACEHOLDER_EXPR
)
3947 tree need_type
= TYPE_MAIN_VARIANT (TREE_TYPE (exp
));
3950 for (elt
= obj
; elt
!= 0;
3951 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3952 || TREE_CODE (elt
) == COND_EXPR
)
3953 ? TREE_OPERAND (elt
, 1)
3954 : (REFERENCE_CLASS_P (elt
)
3955 || UNARY_CLASS_P (elt
)
3956 || BINARY_CLASS_P (elt
)
3957 || VL_EXP_CLASS_P (elt
)
3958 || EXPRESSION_CLASS_P (elt
))
3959 ? TREE_OPERAND (elt
, 0) : 0))
3960 if (TYPE_MAIN_VARIANT (TREE_TYPE (elt
)) == need_type
)
3963 for (elt
= obj
; elt
!= 0;
3964 elt
= ((TREE_CODE (elt
) == COMPOUND_EXPR
3965 || TREE_CODE (elt
) == COND_EXPR
)
3966 ? TREE_OPERAND (elt
, 1)
3967 : (REFERENCE_CLASS_P (elt
)
3968 || UNARY_CLASS_P (elt
)
3969 || BINARY_CLASS_P (elt
)
3970 || VL_EXP_CLASS_P (elt
)
3971 || EXPRESSION_CLASS_P (elt
))
3972 ? TREE_OPERAND (elt
, 0) : 0))
3973 if (POINTER_TYPE_P (TREE_TYPE (elt
))
3974 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (elt
)))
3976 return fold_build1 (INDIRECT_REF
, need_type
, elt
);
3978 /* If we didn't find it, return the original PLACEHOLDER_EXPR. If it
3979 survives until RTL generation, there will be an error. */
3983 /* TREE_LIST is special because we need to look at TREE_VALUE
3984 and TREE_CHAIN, not TREE_OPERANDS. */
3985 else if (code
== TREE_LIST
)
3987 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_CHAIN (exp
), obj
);
3988 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_VALUE (exp
), obj
);
3989 if (op0
== TREE_CHAIN (exp
) && op1
== TREE_VALUE (exp
))
3992 return tree_cons (TREE_PURPOSE (exp
), op1
, op0
);
3995 switch (TREE_CODE_CLASS (code
))
3998 case tcc_declaration
:
4001 case tcc_exceptional
:
4004 case tcc_comparison
:
4005 case tcc_expression
:
4008 switch (TREE_CODE_LENGTH (code
))
4014 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4015 if (op0
== TREE_OPERAND (exp
, 0))
4018 new_tree
= fold_build1 (code
, TREE_TYPE (exp
), op0
);
4022 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4023 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4025 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1))
4028 new_tree
= fold_build2 (code
, TREE_TYPE (exp
), op0
, op1
);
4032 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4033 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4034 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4036 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4037 && op2
== TREE_OPERAND (exp
, 2))
4040 new_tree
= fold_build3 (code
, TREE_TYPE (exp
), op0
, op1
, op2
);
4044 op0
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 0), obj
);
4045 op1
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 1), obj
);
4046 op2
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 2), obj
);
4047 op3
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (TREE_OPERAND (exp
, 3), obj
);
4049 if (op0
== TREE_OPERAND (exp
, 0) && op1
== TREE_OPERAND (exp
, 1)
4050 && op2
== TREE_OPERAND (exp
, 2)
4051 && op3
== TREE_OPERAND (exp
, 3))
4055 = fold (build4 (code
, TREE_TYPE (exp
), op0
, op1
, op2
, op3
));
4067 new_tree
= NULL_TREE
;
4069 for (i
= 1; i
< TREE_OPERAND_LENGTH (exp
); i
++)
4071 tree op
= TREE_OPERAND (exp
, i
);
4072 tree new_op
= SUBSTITUTE_PLACEHOLDER_IN_EXPR (op
, obj
);
4076 new_tree
= copy_node (exp
);
4077 TREE_OPERAND (new_tree
, i
) = new_op
;
4083 new_tree
= fold (new_tree
);
4084 if (TREE_CODE (new_tree
) == CALL_EXPR
)
4085 process_call_operands (new_tree
);
4096 TREE_READONLY (new_tree
) |= TREE_READONLY (exp
);
4098 if (code
== INDIRECT_REF
|| code
== ARRAY_REF
|| code
== ARRAY_RANGE_REF
)
4099 TREE_THIS_NOTRAP (new_tree
) |= TREE_THIS_NOTRAP (exp
);
4105 /* Subroutine of stabilize_reference; this is called for subtrees of
4106 references. Any expression with side-effects must be put in a SAVE_EXPR
4107 to ensure that it is only evaluated once.
4109 We don't put SAVE_EXPR nodes around everything, because assigning very
4110 simple expressions to temporaries causes us to miss good opportunities
4111 for optimizations. Among other things, the opportunity to fold in the
4112 addition of a constant into an addressing mode often gets lost, e.g.
4113 "y[i+1] += x;". In general, we take the approach that we should not make
4114 an assignment unless we are forced into it - i.e., that any non-side effect
4115 operator should be allowed, and that cse should take care of coalescing
4116 multiple utterances of the same expression should that prove fruitful. */
4119 stabilize_reference_1 (tree e
)
4122 enum tree_code code
= TREE_CODE (e
);
4124 /* We cannot ignore const expressions because it might be a reference
4125 to a const array but whose index contains side-effects. But we can
4126 ignore things that are actual constant or that already have been
4127 handled by this function. */
4129 if (tree_invariant_p (e
))
4132 switch (TREE_CODE_CLASS (code
))
4134 case tcc_exceptional
:
4136 case tcc_declaration
:
4137 case tcc_comparison
:
4139 case tcc_expression
:
4142 /* If the expression has side-effects, then encase it in a SAVE_EXPR
4143 so that it will only be evaluated once. */
4144 /* The reference (r) and comparison (<) classes could be handled as
4145 below, but it is generally faster to only evaluate them once. */
4146 if (TREE_SIDE_EFFECTS (e
))
4147 return save_expr (e
);
4151 /* Constants need no processing. In fact, we should never reach
4156 /* Division is slow and tends to be compiled with jumps,
4157 especially the division by powers of 2 that is often
4158 found inside of an array reference. So do it just once. */
4159 if (code
== TRUNC_DIV_EXPR
|| code
== TRUNC_MOD_EXPR
4160 || code
== FLOOR_DIV_EXPR
|| code
== FLOOR_MOD_EXPR
4161 || code
== CEIL_DIV_EXPR
|| code
== CEIL_MOD_EXPR
4162 || code
== ROUND_DIV_EXPR
|| code
== ROUND_MOD_EXPR
)
4163 return save_expr (e
);
4164 /* Recursively stabilize each operand. */
4165 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)),
4166 stabilize_reference_1 (TREE_OPERAND (e
, 1)));
4170 /* Recursively stabilize each operand. */
4171 result
= build_nt (code
, stabilize_reference_1 (TREE_OPERAND (e
, 0)));
4178 TREE_TYPE (result
) = TREE_TYPE (e
);
4179 TREE_READONLY (result
) = TREE_READONLY (e
);
4180 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (e
);
4181 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (e
);
4186 /* Stabilize a reference so that we can use it any number of times
4187 without causing its operands to be evaluated more than once.
4188 Returns the stabilized reference. This works by means of save_expr,
4189 so see the caveats in the comments about save_expr.
4191 Also allows conversion expressions whose operands are references.
4192 Any other kind of expression is returned unchanged. */
4195 stabilize_reference (tree ref
)
4198 enum tree_code code
= TREE_CODE (ref
);
4205 /* No action is needed in this case. */
4210 case FIX_TRUNC_EXPR
:
4211 result
= build_nt (code
, stabilize_reference (TREE_OPERAND (ref
, 0)));
4215 result
= build_nt (INDIRECT_REF
,
4216 stabilize_reference_1 (TREE_OPERAND (ref
, 0)));
4220 result
= build_nt (COMPONENT_REF
,
4221 stabilize_reference (TREE_OPERAND (ref
, 0)),
4222 TREE_OPERAND (ref
, 1), NULL_TREE
);
4226 result
= build_nt (BIT_FIELD_REF
,
4227 stabilize_reference (TREE_OPERAND (ref
, 0)),
4228 TREE_OPERAND (ref
, 1), TREE_OPERAND (ref
, 2));
4229 REF_REVERSE_STORAGE_ORDER (result
) = REF_REVERSE_STORAGE_ORDER (ref
);
4233 result
= build_nt (ARRAY_REF
,
4234 stabilize_reference (TREE_OPERAND (ref
, 0)),
4235 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4236 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4239 case ARRAY_RANGE_REF
:
4240 result
= build_nt (ARRAY_RANGE_REF
,
4241 stabilize_reference (TREE_OPERAND (ref
, 0)),
4242 stabilize_reference_1 (TREE_OPERAND (ref
, 1)),
4243 TREE_OPERAND (ref
, 2), TREE_OPERAND (ref
, 3));
4247 /* We cannot wrap the first expression in a SAVE_EXPR, as then
4248 it wouldn't be ignored. This matters when dealing with
4250 return stabilize_reference_1 (ref
);
4252 /* If arg isn't a kind of lvalue we recognize, make no change.
4253 Caller should recognize the error for an invalid lvalue. */
4258 return error_mark_node
;
4261 TREE_TYPE (result
) = TREE_TYPE (ref
);
4262 TREE_READONLY (result
) = TREE_READONLY (ref
);
4263 TREE_SIDE_EFFECTS (result
) = TREE_SIDE_EFFECTS (ref
);
4264 TREE_THIS_VOLATILE (result
) = TREE_THIS_VOLATILE (ref
);
4269 /* Low-level constructors for expressions. */
4271 /* A helper function for build1 and constant folders. Set TREE_CONSTANT,
4272 and TREE_SIDE_EFFECTS for an ADDR_EXPR. */
4275 recompute_tree_invariant_for_addr_expr (tree t
)
4278 bool tc
= true, se
= false;
4280 gcc_assert (TREE_CODE (t
) == ADDR_EXPR
);
4282 /* We started out assuming this address is both invariant and constant, but
4283 does not have side effects. Now go down any handled components and see if
4284 any of them involve offsets that are either non-constant or non-invariant.
4285 Also check for side-effects.
4287 ??? Note that this code makes no attempt to deal with the case where
4288 taking the address of something causes a copy due to misalignment. */
4290 #define UPDATE_FLAGS(NODE) \
4291 do { tree _node = (NODE); \
4292 if (_node && !TREE_CONSTANT (_node)) tc = false; \
4293 if (_node && TREE_SIDE_EFFECTS (_node)) se = true; } while (0)
4295 for (node
= TREE_OPERAND (t
, 0); handled_component_p (node
);
4296 node
= TREE_OPERAND (node
, 0))
4298 /* If the first operand doesn't have an ARRAY_TYPE, this is a bogus
4299 array reference (probably made temporarily by the G++ front end),
4300 so ignore all the operands. */
4301 if ((TREE_CODE (node
) == ARRAY_REF
4302 || TREE_CODE (node
) == ARRAY_RANGE_REF
)
4303 && TREE_CODE (TREE_TYPE (TREE_OPERAND (node
, 0))) == ARRAY_TYPE
)
4305 UPDATE_FLAGS (TREE_OPERAND (node
, 1));
4306 if (TREE_OPERAND (node
, 2))
4307 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4308 if (TREE_OPERAND (node
, 3))
4309 UPDATE_FLAGS (TREE_OPERAND (node
, 3));
4311 /* Likewise, just because this is a COMPONENT_REF doesn't mean we have a
4312 FIELD_DECL, apparently. The G++ front end can put something else
4313 there, at least temporarily. */
4314 else if (TREE_CODE (node
) == COMPONENT_REF
4315 && TREE_CODE (TREE_OPERAND (node
, 1)) == FIELD_DECL
)
4317 if (TREE_OPERAND (node
, 2))
4318 UPDATE_FLAGS (TREE_OPERAND (node
, 2));
4322 node
= lang_hooks
.expr_to_decl (node
, &tc
, &se
);
4324 /* Now see what's inside. If it's an INDIRECT_REF, copy our properties from
4325 the address, since &(*a)->b is a form of addition. If it's a constant, the
4326 address is constant too. If it's a decl, its address is constant if the
4327 decl is static. Everything else is not constant and, furthermore,
4328 taking the address of a volatile variable is not volatile. */
4329 if (TREE_CODE (node
) == INDIRECT_REF
4330 || TREE_CODE (node
) == MEM_REF
)
4331 UPDATE_FLAGS (TREE_OPERAND (node
, 0));
4332 else if (CONSTANT_CLASS_P (node
))
4334 else if (DECL_P (node
))
4335 tc
&= (staticp (node
) != NULL_TREE
);
4339 se
|= TREE_SIDE_EFFECTS (node
);
4343 TREE_CONSTANT (t
) = tc
;
4344 TREE_SIDE_EFFECTS (t
) = se
;
4348 /* Build an expression of code CODE, data type TYPE, and operands as
4349 specified. Expressions and reference nodes can be created this way.
4350 Constants, decls, types and misc nodes cannot be.
4352 We define 5 non-variadic functions, from 0 to 4 arguments. This is
4353 enough for all extant tree codes. */
4356 build0_stat (enum tree_code code
, tree tt MEM_STAT_DECL
)
4360 gcc_assert (TREE_CODE_LENGTH (code
) == 0);
4362 t
= make_node_stat (code PASS_MEM_STAT
);
4369 build1_stat (enum tree_code code
, tree type
, tree node MEM_STAT_DECL
)
4371 int length
= sizeof (struct tree_exp
);
4374 record_node_allocation_statistics (code
, length
);
4376 gcc_assert (TREE_CODE_LENGTH (code
) == 1);
4378 t
= ggc_alloc_tree_node_stat (length PASS_MEM_STAT
);
4380 memset (t
, 0, sizeof (struct tree_common
));
4382 TREE_SET_CODE (t
, code
);
4384 TREE_TYPE (t
) = type
;
4385 SET_EXPR_LOCATION (t
, UNKNOWN_LOCATION
);
4386 TREE_OPERAND (t
, 0) = node
;
4387 if (node
&& !TYPE_P (node
))
4389 TREE_SIDE_EFFECTS (t
) = TREE_SIDE_EFFECTS (node
);
4390 TREE_READONLY (t
) = TREE_READONLY (node
);
4393 if (TREE_CODE_CLASS (code
) == tcc_statement
)
4394 TREE_SIDE_EFFECTS (t
) = 1;
4398 /* All of these have side-effects, no matter what their
4400 TREE_SIDE_EFFECTS (t
) = 1;
4401 TREE_READONLY (t
) = 0;
4405 /* Whether a dereference is readonly has nothing to do with whether
4406 its operand is readonly. */
4407 TREE_READONLY (t
) = 0;
4412 recompute_tree_invariant_for_addr_expr (t
);
4416 if ((TREE_CODE_CLASS (code
) == tcc_unary
|| code
== VIEW_CONVERT_EXPR
)
4417 && node
&& !TYPE_P (node
)
4418 && TREE_CONSTANT (node
))
4419 TREE_CONSTANT (t
) = 1;
4420 if (TREE_CODE_CLASS (code
) == tcc_reference
4421 && node
&& TREE_THIS_VOLATILE (node
))
4422 TREE_THIS_VOLATILE (t
) = 1;
4429 #define PROCESS_ARG(N) \
4431 TREE_OPERAND (t, N) = arg##N; \
4432 if (arg##N &&!TYPE_P (arg##N)) \
4434 if (TREE_SIDE_EFFECTS (arg##N)) \
4436 if (!TREE_READONLY (arg##N) \
4437 && !CONSTANT_CLASS_P (arg##N)) \
4438 (void) (read_only = 0); \
4439 if (!TREE_CONSTANT (arg##N)) \
4440 (void) (constant = 0); \
4445 build2_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1 MEM_STAT_DECL
)
4447 bool constant
, read_only
, side_effects
;
4450 gcc_assert (TREE_CODE_LENGTH (code
) == 2);
4452 if ((code
== MINUS_EXPR
|| code
== PLUS_EXPR
|| code
== MULT_EXPR
)
4453 && arg0
&& arg1
&& tt
&& POINTER_TYPE_P (tt
)
4454 /* When sizetype precision doesn't match that of pointers
4455 we need to be able to build explicit extensions or truncations
4456 of the offset argument. */
4457 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (tt
))
4458 gcc_assert (TREE_CODE (arg0
) == INTEGER_CST
4459 && TREE_CODE (arg1
) == INTEGER_CST
);
4461 if (code
== POINTER_PLUS_EXPR
&& arg0
&& arg1
&& tt
)
4462 gcc_assert (POINTER_TYPE_P (tt
) && POINTER_TYPE_P (TREE_TYPE (arg0
))
4463 && ptrofftype_p (TREE_TYPE (arg1
)));
4465 t
= make_node_stat (code PASS_MEM_STAT
);
4468 /* Below, we automatically set TREE_SIDE_EFFECTS and TREE_READONLY for the
4469 result based on those same flags for the arguments. But if the
4470 arguments aren't really even `tree' expressions, we shouldn't be trying
4473 /* Expressions without side effects may be constant if their
4474 arguments are as well. */
4475 constant
= (TREE_CODE_CLASS (code
) == tcc_comparison
4476 || TREE_CODE_CLASS (code
) == tcc_binary
);
4478 side_effects
= TREE_SIDE_EFFECTS (t
);
4483 TREE_SIDE_EFFECTS (t
) = side_effects
;
4484 if (code
== MEM_REF
)
4486 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4488 tree o
= TREE_OPERAND (arg0
, 0);
4489 TREE_READONLY (t
) = TREE_READONLY (o
);
4490 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4495 TREE_READONLY (t
) = read_only
;
4496 TREE_CONSTANT (t
) = constant
;
4497 TREE_THIS_VOLATILE (t
)
4498 = (TREE_CODE_CLASS (code
) == tcc_reference
4499 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4507 build3_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4508 tree arg2 MEM_STAT_DECL
)
4510 bool constant
, read_only
, side_effects
;
4513 gcc_assert (TREE_CODE_LENGTH (code
) == 3);
4514 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4516 t
= make_node_stat (code PASS_MEM_STAT
);
4521 /* As a special exception, if COND_EXPR has NULL branches, we
4522 assume that it is a gimple statement and always consider
4523 it to have side effects. */
4524 if (code
== COND_EXPR
4525 && tt
== void_type_node
4526 && arg1
== NULL_TREE
4527 && arg2
== NULL_TREE
)
4528 side_effects
= true;
4530 side_effects
= TREE_SIDE_EFFECTS (t
);
4536 if (code
== COND_EXPR
)
4537 TREE_READONLY (t
) = read_only
;
4539 TREE_SIDE_EFFECTS (t
) = side_effects
;
4540 TREE_THIS_VOLATILE (t
)
4541 = (TREE_CODE_CLASS (code
) == tcc_reference
4542 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4548 build4_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4549 tree arg2
, tree arg3 MEM_STAT_DECL
)
4551 bool constant
, read_only
, side_effects
;
4554 gcc_assert (TREE_CODE_LENGTH (code
) == 4);
4556 t
= make_node_stat (code PASS_MEM_STAT
);
4559 side_effects
= TREE_SIDE_EFFECTS (t
);
4566 TREE_SIDE_EFFECTS (t
) = side_effects
;
4567 TREE_THIS_VOLATILE (t
)
4568 = (TREE_CODE_CLASS (code
) == tcc_reference
4569 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4575 build5_stat (enum tree_code code
, tree tt
, tree arg0
, tree arg1
,
4576 tree arg2
, tree arg3
, tree arg4 MEM_STAT_DECL
)
4578 bool constant
, read_only
, side_effects
;
4581 gcc_assert (TREE_CODE_LENGTH (code
) == 5);
4583 t
= make_node_stat (code PASS_MEM_STAT
);
4586 side_effects
= TREE_SIDE_EFFECTS (t
);
4594 TREE_SIDE_EFFECTS (t
) = side_effects
;
4595 if (code
== TARGET_MEM_REF
)
4597 if (arg0
&& TREE_CODE (arg0
) == ADDR_EXPR
)
4599 tree o
= TREE_OPERAND (arg0
, 0);
4600 TREE_READONLY (t
) = TREE_READONLY (o
);
4601 TREE_THIS_VOLATILE (t
) = TREE_THIS_VOLATILE (o
);
4605 TREE_THIS_VOLATILE (t
)
4606 = (TREE_CODE_CLASS (code
) == tcc_reference
4607 && arg0
&& TREE_THIS_VOLATILE (arg0
));
4612 /* Build a simple MEM_REF tree with the sematics of a plain INDIRECT_REF
4613 on the pointer PTR. */
4616 build_simple_mem_ref_loc (location_t loc
, tree ptr
)
4618 HOST_WIDE_INT offset
= 0;
4619 tree ptype
= TREE_TYPE (ptr
);
4621 /* For convenience allow addresses that collapse to a simple base
4623 if (TREE_CODE (ptr
) == ADDR_EXPR
4624 && (handled_component_p (TREE_OPERAND (ptr
, 0))
4625 || TREE_CODE (TREE_OPERAND (ptr
, 0)) == MEM_REF
))
4627 ptr
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &offset
);
4629 ptr
= build_fold_addr_expr (ptr
);
4630 gcc_assert (is_gimple_reg (ptr
) || is_gimple_min_invariant (ptr
));
4632 tem
= build2 (MEM_REF
, TREE_TYPE (ptype
),
4633 ptr
, build_int_cst (ptype
, offset
));
4634 SET_EXPR_LOCATION (tem
, loc
);
4638 /* Return the constant offset of a MEM_REF or TARGET_MEM_REF tree T. */
4641 mem_ref_offset (const_tree t
)
4643 return offset_int::from (TREE_OPERAND (t
, 1), SIGNED
);
4646 /* Return an invariant ADDR_EXPR of type TYPE taking the address of BASE
4647 offsetted by OFFSET units. */
4650 build_invariant_address (tree type
, tree base
, HOST_WIDE_INT offset
)
4652 tree ref
= fold_build2 (MEM_REF
, TREE_TYPE (type
),
4653 build_fold_addr_expr (base
),
4654 build_int_cst (ptr_type_node
, offset
));
4655 tree addr
= build1 (ADDR_EXPR
, type
, ref
);
4656 recompute_tree_invariant_for_addr_expr (addr
);
4660 /* Similar except don't specify the TREE_TYPE
4661 and leave the TREE_SIDE_EFFECTS as 0.
4662 It is permissible for arguments to be null,
4663 or even garbage if their values do not matter. */
4666 build_nt (enum tree_code code
, ...)
4673 gcc_assert (TREE_CODE_CLASS (code
) != tcc_vl_exp
);
4677 t
= make_node (code
);
4678 length
= TREE_CODE_LENGTH (code
);
4680 for (i
= 0; i
< length
; i
++)
4681 TREE_OPERAND (t
, i
) = va_arg (p
, tree
);
4687 /* Similar to build_nt, but for creating a CALL_EXPR object with a
4691 build_nt_call_vec (tree fn
, vec
<tree
, va_gc
> *args
)
4696 ret
= build_vl_exp (CALL_EXPR
, vec_safe_length (args
) + 3);
4697 CALL_EXPR_FN (ret
) = fn
;
4698 CALL_EXPR_STATIC_CHAIN (ret
) = NULL_TREE
;
4699 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
4700 CALL_EXPR_ARG (ret
, ix
) = t
;
4704 /* Create a DECL_... node of code CODE, name NAME and data type TYPE.
4705 We do NOT enter this node in any sort of symbol table.
4707 LOC is the location of the decl.
4709 layout_decl is used to set up the decl's storage layout.
4710 Other slots are initialized to 0 or null pointers. */
4713 build_decl_stat (location_t loc
, enum tree_code code
, tree name
,
4714 tree type MEM_STAT_DECL
)
4718 t
= make_node_stat (code PASS_MEM_STAT
);
4719 DECL_SOURCE_LOCATION (t
) = loc
;
4721 /* if (type == error_mark_node)
4722 type = integer_type_node; */
4723 /* That is not done, deliberately, so that having error_mark_node
4724 as the type can suppress useless errors in the use of this variable. */
4726 DECL_NAME (t
) = name
;
4727 TREE_TYPE (t
) = type
;
4729 if (code
== VAR_DECL
|| code
== PARM_DECL
|| code
== RESULT_DECL
)
4735 /* Builds and returns function declaration with NAME and TYPE. */
4738 build_fn_decl (const char *name
, tree type
)
4740 tree id
= get_identifier (name
);
4741 tree decl
= build_decl (input_location
, FUNCTION_DECL
, id
, type
);
4743 DECL_EXTERNAL (decl
) = 1;
4744 TREE_PUBLIC (decl
) = 1;
4745 DECL_ARTIFICIAL (decl
) = 1;
4746 TREE_NOTHROW (decl
) = 1;
4751 vec
<tree
, va_gc
> *all_translation_units
;
4753 /* Builds a new translation-unit decl with name NAME, queues it in the
4754 global list of translation-unit decls and returns it. */
4757 build_translation_unit_decl (tree name
)
4759 tree tu
= build_decl (UNKNOWN_LOCATION
, TRANSLATION_UNIT_DECL
,
4761 TRANSLATION_UNIT_LANGUAGE (tu
) = lang_hooks
.name
;
4762 vec_safe_push (all_translation_units
, tu
);
4767 /* BLOCK nodes are used to represent the structure of binding contours
4768 and declarations, once those contours have been exited and their contents
4769 compiled. This information is used for outputting debugging info. */
4772 build_block (tree vars
, tree subblocks
, tree supercontext
, tree chain
)
4774 tree block
= make_node (BLOCK
);
4776 BLOCK_VARS (block
) = vars
;
4777 BLOCK_SUBBLOCKS (block
) = subblocks
;
4778 BLOCK_SUPERCONTEXT (block
) = supercontext
;
4779 BLOCK_CHAIN (block
) = chain
;
4784 /* Like SET_EXPR_LOCATION, but make sure the tree can have a location.
4786 LOC is the location to use in tree T. */
4789 protected_set_expr_location (tree t
, location_t loc
)
4791 if (CAN_HAVE_LOCATION_P (t
))
4792 SET_EXPR_LOCATION (t
, loc
);
4795 /* Return a declaration like DDECL except that its DECL_ATTRIBUTES
4799 build_decl_attribute_variant (tree ddecl
, tree attribute
)
4801 DECL_ATTRIBUTES (ddecl
) = attribute
;
4805 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
4806 is ATTRIBUTE and its qualifiers are QUALS.
4808 Record such modified types already made so we don't make duplicates. */
4811 build_type_attribute_qual_variant (tree ttype
, tree attribute
, int quals
)
4813 if (! attribute_list_equal (TYPE_ATTRIBUTES (ttype
), attribute
))
4815 inchash::hash hstate
;
4819 enum tree_code code
= TREE_CODE (ttype
);
4821 /* Building a distinct copy of a tagged type is inappropriate; it
4822 causes breakage in code that expects there to be a one-to-one
4823 relationship between a struct and its fields.
4824 build_duplicate_type is another solution (as used in
4825 handle_transparent_union_attribute), but that doesn't play well
4826 with the stronger C++ type identity model. */
4827 if (TREE_CODE (ttype
) == RECORD_TYPE
4828 || TREE_CODE (ttype
) == UNION_TYPE
4829 || TREE_CODE (ttype
) == QUAL_UNION_TYPE
4830 || TREE_CODE (ttype
) == ENUMERAL_TYPE
)
4832 warning (OPT_Wattributes
,
4833 "ignoring attributes applied to %qT after definition",
4834 TYPE_MAIN_VARIANT (ttype
));
4835 return build_qualified_type (ttype
, quals
);
4838 ttype
= build_qualified_type (ttype
, TYPE_UNQUALIFIED
);
4839 ntype
= build_distinct_type_copy (ttype
);
4841 TYPE_ATTRIBUTES (ntype
) = attribute
;
4843 hstate
.add_int (code
);
4844 if (TREE_TYPE (ntype
))
4845 hstate
.add_object (TYPE_HASH (TREE_TYPE (ntype
)));
4846 attribute_hash_list (attribute
, hstate
);
4848 switch (TREE_CODE (ntype
))
4851 type_hash_list (TYPE_ARG_TYPES (ntype
), hstate
);
4854 if (TYPE_DOMAIN (ntype
))
4855 hstate
.add_object (TYPE_HASH (TYPE_DOMAIN (ntype
)));
4858 t
= TYPE_MAX_VALUE (ntype
);
4859 for (i
= 0; i
< TREE_INT_CST_NUNITS (t
); i
++)
4860 hstate
.add_object (TREE_INT_CST_ELT (t
, i
));
4863 case FIXED_POINT_TYPE
:
4865 unsigned int precision
= TYPE_PRECISION (ntype
);
4866 hstate
.add_object (precision
);
4873 ntype
= type_hash_canon (hstate
.end(), ntype
);
4875 /* If the target-dependent attributes make NTYPE different from
4876 its canonical type, we will need to use structural equality
4877 checks for this type. */
4878 if (TYPE_STRUCTURAL_EQUALITY_P (ttype
)
4879 || !comp_type_attributes (ntype
, ttype
))
4880 SET_TYPE_STRUCTURAL_EQUALITY (ntype
);
4881 else if (TYPE_CANONICAL (ntype
) == ntype
)
4882 TYPE_CANONICAL (ntype
) = TYPE_CANONICAL (ttype
);
4884 ttype
= build_qualified_type (ntype
, quals
);
4886 else if (TYPE_QUALS (ttype
) != quals
)
4887 ttype
= build_qualified_type (ttype
, quals
);
4892 /* Check if "omp declare simd" attribute arguments, CLAUSES1 and CLAUSES2, are
4896 omp_declare_simd_clauses_equal (tree clauses1
, tree clauses2
)
4899 for (cl1
= clauses1
, cl2
= clauses2
;
4901 cl1
= OMP_CLAUSE_CHAIN (cl1
), cl2
= OMP_CLAUSE_CHAIN (cl2
))
4903 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_CODE (cl2
))
4905 if (OMP_CLAUSE_CODE (cl1
) != OMP_CLAUSE_SIMDLEN
)
4907 if (simple_cst_equal (OMP_CLAUSE_DECL (cl1
),
4908 OMP_CLAUSE_DECL (cl2
)) != 1)
4911 switch (OMP_CLAUSE_CODE (cl1
))
4913 case OMP_CLAUSE_ALIGNED
:
4914 if (simple_cst_equal (OMP_CLAUSE_ALIGNED_ALIGNMENT (cl1
),
4915 OMP_CLAUSE_ALIGNED_ALIGNMENT (cl2
)) != 1)
4918 case OMP_CLAUSE_LINEAR
:
4919 if (simple_cst_equal (OMP_CLAUSE_LINEAR_STEP (cl1
),
4920 OMP_CLAUSE_LINEAR_STEP (cl2
)) != 1)
4923 case OMP_CLAUSE_SIMDLEN
:
4924 if (simple_cst_equal (OMP_CLAUSE_SIMDLEN_EXPR (cl1
),
4925 OMP_CLAUSE_SIMDLEN_EXPR (cl2
)) != 1)
4934 /* Compare two constructor-element-type constants. Return 1 if the lists
4935 are known to be equal; otherwise return 0. */
4938 simple_cst_list_equal (const_tree l1
, const_tree l2
)
4940 while (l1
!= NULL_TREE
&& l2
!= NULL_TREE
)
4942 if (simple_cst_equal (TREE_VALUE (l1
), TREE_VALUE (l2
)) != 1)
4945 l1
= TREE_CHAIN (l1
);
4946 l2
= TREE_CHAIN (l2
);
4952 /* Compare two identifier nodes representing attributes. Either one may
4953 be in wrapped __ATTR__ form. Return true if they are the same, false
4957 cmp_attrib_identifiers (const_tree attr1
, const_tree attr2
)
4959 /* Make sure we're dealing with IDENTIFIER_NODEs. */
4960 gcc_checking_assert (TREE_CODE (attr1
) == IDENTIFIER_NODE
4961 && TREE_CODE (attr2
) == IDENTIFIER_NODE
);
4963 /* Identifiers can be compared directly for equality. */
4967 /* If they are not equal, they may still be one in the form
4968 'text' while the other one is in the form '__text__'. TODO:
4969 If we were storing attributes in normalized 'text' form, then
4970 this could all go away and we could take full advantage of
4971 the fact that we're comparing identifiers. :-) */
4972 const size_t attr1_len
= IDENTIFIER_LENGTH (attr1
);
4973 const size_t attr2_len
= IDENTIFIER_LENGTH (attr2
);
4975 if (attr2_len
== attr1_len
+ 4)
4977 const char *p
= IDENTIFIER_POINTER (attr2
);
4978 const char *q
= IDENTIFIER_POINTER (attr1
);
4979 if (p
[0] == '_' && p
[1] == '_'
4980 && p
[attr2_len
- 2] == '_' && p
[attr2_len
- 1] == '_'
4981 && strncmp (q
, p
+ 2, attr1_len
) == 0)
4984 else if (attr2_len
+ 4 == attr1_len
)
4986 const char *p
= IDENTIFIER_POINTER (attr2
);
4987 const char *q
= IDENTIFIER_POINTER (attr1
);
4988 if (q
[0] == '_' && q
[1] == '_'
4989 && q
[attr1_len
- 2] == '_' && q
[attr1_len
- 1] == '_'
4990 && strncmp (q
+ 2, p
, attr2_len
) == 0)
4997 /* Compare two attributes for their value identity. Return true if the
4998 attribute values are known to be equal; otherwise return false. */
5001 attribute_value_equal (const_tree attr1
, const_tree attr2
)
5003 if (TREE_VALUE (attr1
) == TREE_VALUE (attr2
))
5006 if (TREE_VALUE (attr1
) != NULL_TREE
5007 && TREE_CODE (TREE_VALUE (attr1
)) == TREE_LIST
5008 && TREE_VALUE (attr2
) != NULL_TREE
5009 && TREE_CODE (TREE_VALUE (attr2
)) == TREE_LIST
)
5011 /* Handle attribute format. */
5012 if (is_attribute_p ("format", get_attribute_name (attr1
)))
5014 attr1
= TREE_VALUE (attr1
);
5015 attr2
= TREE_VALUE (attr2
);
5016 /* Compare the archetypes (printf/scanf/strftime/...). */
5017 if (!cmp_attrib_identifiers (TREE_VALUE (attr1
),
5018 TREE_VALUE (attr2
)))
5020 /* Archetypes are the same. Compare the rest. */
5021 return (simple_cst_list_equal (TREE_CHAIN (attr1
),
5022 TREE_CHAIN (attr2
)) == 1);
5024 return (simple_cst_list_equal (TREE_VALUE (attr1
),
5025 TREE_VALUE (attr2
)) == 1);
5028 if ((flag_openmp
|| flag_openmp_simd
)
5029 && TREE_VALUE (attr1
) && TREE_VALUE (attr2
)
5030 && TREE_CODE (TREE_VALUE (attr1
)) == OMP_CLAUSE
5031 && TREE_CODE (TREE_VALUE (attr2
)) == OMP_CLAUSE
)
5032 return omp_declare_simd_clauses_equal (TREE_VALUE (attr1
),
5033 TREE_VALUE (attr2
));
5035 return (simple_cst_equal (TREE_VALUE (attr1
), TREE_VALUE (attr2
)) == 1);
5038 /* Return 0 if the attributes for two types are incompatible, 1 if they
5039 are compatible, and 2 if they are nearly compatible (which causes a
5040 warning to be generated). */
5042 comp_type_attributes (const_tree type1
, const_tree type2
)
5044 const_tree a1
= TYPE_ATTRIBUTES (type1
);
5045 const_tree a2
= TYPE_ATTRIBUTES (type2
);
5050 for (a
= a1
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5052 const struct attribute_spec
*as
;
5055 as
= lookup_attribute_spec (get_attribute_name (a
));
5056 if (!as
|| as
->affects_type_identity
== false)
5059 attr
= lookup_attribute (as
->name
, CONST_CAST_TREE (a2
));
5060 if (!attr
|| !attribute_value_equal (a
, attr
))
5065 for (a
= a2
; a
!= NULL_TREE
; a
= TREE_CHAIN (a
))
5067 const struct attribute_spec
*as
;
5069 as
= lookup_attribute_spec (get_attribute_name (a
));
5070 if (!as
|| as
->affects_type_identity
== false)
5073 if (!lookup_attribute (as
->name
, CONST_CAST_TREE (a1
)))
5075 /* We don't need to compare trees again, as we did this
5076 already in first loop. */
5078 /* All types - affecting identity - are equal, so
5079 there is no need to call target hook for comparison. */
5083 if (lookup_attribute ("transaction_safe", CONST_CAST_TREE (a
)))
5085 /* As some type combinations - like default calling-convention - might
5086 be compatible, we have to call the target hook to get the final result. */
5087 return targetm
.comp_type_attributes (type1
, type2
);
5090 /* Return a type like TTYPE except that its TYPE_ATTRIBUTE
5093 Record such modified types already made so we don't make duplicates. */
5096 build_type_attribute_variant (tree ttype
, tree attribute
)
5098 return build_type_attribute_qual_variant (ttype
, attribute
,
5099 TYPE_QUALS (ttype
));
5103 /* Reset the expression *EXPR_P, a size or position.
5105 ??? We could reset all non-constant sizes or positions. But it's cheap
5106 enough to not do so and refrain from adding workarounds to dwarf2out.c.
5108 We need to reset self-referential sizes or positions because they cannot
5109 be gimplified and thus can contain a CALL_EXPR after the gimplification
5110 is finished, which will run afoul of LTO streaming. And they need to be
5111 reset to something essentially dummy but not constant, so as to preserve
5112 the properties of the object they are attached to. */
5115 free_lang_data_in_one_sizepos (tree
*expr_p
)
5117 tree expr
= *expr_p
;
5118 if (CONTAINS_PLACEHOLDER_P (expr
))
5119 *expr_p
= build0 (PLACEHOLDER_EXPR
, TREE_TYPE (expr
));
5123 /* Reset all the fields in a binfo node BINFO. We only keep
5124 BINFO_VTABLE, which is used by gimple_fold_obj_type_ref. */
5127 free_lang_data_in_binfo (tree binfo
)
5132 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
5134 BINFO_VIRTUALS (binfo
) = NULL_TREE
;
5135 BINFO_BASE_ACCESSES (binfo
) = NULL
;
5136 BINFO_INHERITANCE_CHAIN (binfo
) = NULL_TREE
;
5137 BINFO_SUBVTT_INDEX (binfo
) = NULL_TREE
;
5139 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (binfo
), i
, t
)
5140 free_lang_data_in_binfo (t
);
5144 /* Reset all language specific information still present in TYPE. */
5147 free_lang_data_in_type (tree type
)
5149 gcc_assert (TYPE_P (type
));
5151 /* Give the FE a chance to remove its own data first. */
5152 lang_hooks
.free_lang_data (type
);
5154 TREE_LANG_FLAG_0 (type
) = 0;
5155 TREE_LANG_FLAG_1 (type
) = 0;
5156 TREE_LANG_FLAG_2 (type
) = 0;
5157 TREE_LANG_FLAG_3 (type
) = 0;
5158 TREE_LANG_FLAG_4 (type
) = 0;
5159 TREE_LANG_FLAG_5 (type
) = 0;
5160 TREE_LANG_FLAG_6 (type
) = 0;
5162 if (TREE_CODE (type
) == FUNCTION_TYPE
)
5164 /* Remove the const and volatile qualifiers from arguments. The
5165 C++ front end removes them, but the C front end does not,
5166 leading to false ODR violation errors when merging two
5167 instances of the same function signature compiled by
5168 different front ends. */
5171 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5173 tree arg_type
= TREE_VALUE (p
);
5175 if (TYPE_READONLY (arg_type
) || TYPE_VOLATILE (arg_type
))
5177 int quals
= TYPE_QUALS (arg_type
)
5179 & ~TYPE_QUAL_VOLATILE
;
5180 TREE_VALUE (p
) = build_qualified_type (arg_type
, quals
);
5181 free_lang_data_in_type (TREE_VALUE (p
));
5183 /* C++ FE uses TREE_PURPOSE to store initial values. */
5184 TREE_PURPOSE (p
) = NULL
;
5186 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5187 TYPE_MINVAL (type
) = NULL
;
5189 if (TREE_CODE (type
) == METHOD_TYPE
)
5193 for (p
= TYPE_ARG_TYPES (type
); p
; p
= TREE_CHAIN (p
))
5195 /* C++ FE uses TREE_PURPOSE to store initial values. */
5196 TREE_PURPOSE (p
) = NULL
;
5198 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
5199 TYPE_MINVAL (type
) = NULL
;
5202 /* Remove members that are not actually FIELD_DECLs from the field
5203 list of an aggregate. These occur in C++. */
5204 if (RECORD_OR_UNION_TYPE_P (type
))
5208 /* Note that TYPE_FIELDS can be shared across distinct
5209 TREE_TYPEs. Therefore, if the first field of TYPE_FIELDS is
5210 to be removed, we cannot set its TREE_CHAIN to NULL.
5211 Otherwise, we would not be able to find all the other fields
5212 in the other instances of this TREE_TYPE.
5214 This was causing an ICE in testsuite/g++.dg/lto/20080915.C. */
5216 member
= TYPE_FIELDS (type
);
5219 if (TREE_CODE (member
) == FIELD_DECL
5220 || (TREE_CODE (member
) == TYPE_DECL
5221 && !DECL_IGNORED_P (member
)
5222 && debug_info_level
> DINFO_LEVEL_TERSE
5223 && !is_redundant_typedef (member
)))
5226 TREE_CHAIN (prev
) = member
;
5228 TYPE_FIELDS (type
) = member
;
5232 member
= TREE_CHAIN (member
);
5236 TREE_CHAIN (prev
) = NULL_TREE
;
5238 TYPE_FIELDS (type
) = NULL_TREE
;
5240 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
5241 and danagle the pointer from time to time. */
5242 if (TYPE_VFIELD (type
) && TREE_CODE (TYPE_VFIELD (type
)) != FIELD_DECL
)
5243 TYPE_VFIELD (type
) = NULL_TREE
;
5245 /* Remove TYPE_METHODS list. While it would be nice to keep it
5246 to enable ODR warnings about different method lists, doing so
5247 seems to impractically increase size of LTO data streamed.
5248 Keep the information if TYPE_METHODS was non-NULL. This is used
5249 by function.c and pretty printers. */
5250 if (TYPE_METHODS (type
))
5251 TYPE_METHODS (type
) = error_mark_node
;
5252 if (TYPE_BINFO (type
))
5254 free_lang_data_in_binfo (TYPE_BINFO (type
));
5255 /* We need to preserve link to bases and virtual table for all
5256 polymorphic types to make devirtualization machinery working.
5257 Debug output cares only about bases, but output also
5258 virtual table pointers so merging of -fdevirtualize and
5259 -fno-devirtualize units is easier. */
5260 if ((!BINFO_VTABLE (TYPE_BINFO (type
))
5261 || !flag_devirtualize
)
5262 && ((!BINFO_N_BASE_BINFOS (TYPE_BINFO (type
))
5263 && !BINFO_VTABLE (TYPE_BINFO (type
)))
5264 || debug_info_level
!= DINFO_LEVEL_NONE
))
5265 TYPE_BINFO (type
) = NULL
;
5270 /* For non-aggregate types, clear out the language slot (which
5271 overloads TYPE_BINFO). */
5272 TYPE_LANG_SLOT_1 (type
) = NULL_TREE
;
5274 if (INTEGRAL_TYPE_P (type
)
5275 || SCALAR_FLOAT_TYPE_P (type
)
5276 || FIXED_POINT_TYPE_P (type
))
5278 free_lang_data_in_one_sizepos (&TYPE_MIN_VALUE (type
));
5279 free_lang_data_in_one_sizepos (&TYPE_MAX_VALUE (type
));
5283 free_lang_data_in_one_sizepos (&TYPE_SIZE (type
));
5284 free_lang_data_in_one_sizepos (&TYPE_SIZE_UNIT (type
));
5286 if (TYPE_CONTEXT (type
)
5287 && TREE_CODE (TYPE_CONTEXT (type
)) == BLOCK
)
5289 tree ctx
= TYPE_CONTEXT (type
);
5292 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5294 while (ctx
&& TREE_CODE (ctx
) == BLOCK
);
5295 TYPE_CONTEXT (type
) = ctx
;
5300 /* Return true if DECL may need an assembler name to be set. */
5303 need_assembler_name_p (tree decl
)
5305 /* We use DECL_ASSEMBLER_NAME to hold mangled type names for One Definition
5306 Rule merging. This makes type_odr_p to return true on those types during
5307 LTO and by comparing the mangled name, we can say what types are intended
5308 to be equivalent across compilation unit.
5310 We do not store names of type_in_anonymous_namespace_p.
5312 Record, union and enumeration type have linkage that allows use
5313 to check type_in_anonymous_namespace_p. We do not mangle compound types
5314 that always can be compared structurally.
5316 Similarly for builtin types, we compare properties of their main variant.
5317 A special case are integer types where mangling do make differences
5318 between char/signed char/unsigned char etc. Storing name for these makes
5319 e.g. -fno-signed-char/-fsigned-char mismatches to be handled well.
5320 See cp/mangle.c:write_builtin_type for details. */
5322 if (flag_lto_odr_type_mering
5323 && TREE_CODE (decl
) == TYPE_DECL
5325 && decl
== TYPE_NAME (TREE_TYPE (decl
))
5326 && TYPE_MAIN_VARIANT (TREE_TYPE (decl
)) == TREE_TYPE (decl
)
5327 && !TYPE_ARTIFICIAL (TREE_TYPE (decl
))
5328 && (type_with_linkage_p (TREE_TYPE (decl
))
5329 || TREE_CODE (TREE_TYPE (decl
)) == INTEGER_TYPE
)
5330 && !variably_modified_type_p (TREE_TYPE (decl
), NULL_TREE
))
5331 return !DECL_ASSEMBLER_NAME_SET_P (decl
);
5332 /* Only FUNCTION_DECLs and VAR_DECLs are considered. */
5333 if (TREE_CODE (decl
) != FUNCTION_DECL
5334 && TREE_CODE (decl
) != VAR_DECL
)
5337 /* If DECL already has its assembler name set, it does not need a
5339 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5340 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5343 /* Abstract decls do not need an assembler name. */
5344 if (DECL_ABSTRACT_P (decl
))
5347 /* For VAR_DECLs, only static, public and external symbols need an
5349 if (TREE_CODE (decl
) == VAR_DECL
5350 && !TREE_STATIC (decl
)
5351 && !TREE_PUBLIC (decl
)
5352 && !DECL_EXTERNAL (decl
))
5355 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5357 /* Do not set assembler name on builtins. Allow RTL expansion to
5358 decide whether to expand inline or via a regular call. */
5359 if (DECL_BUILT_IN (decl
)
5360 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5363 /* Functions represented in the callgraph need an assembler name. */
5364 if (cgraph_node::get (decl
) != NULL
)
5367 /* Unused and not public functions don't need an assembler name. */
5368 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5376 /* Reset all language specific information still present in symbol
5380 free_lang_data_in_decl (tree decl
)
5382 gcc_assert (DECL_P (decl
));
5384 /* Give the FE a chance to remove its own data first. */
5385 lang_hooks
.free_lang_data (decl
);
5387 TREE_LANG_FLAG_0 (decl
) = 0;
5388 TREE_LANG_FLAG_1 (decl
) = 0;
5389 TREE_LANG_FLAG_2 (decl
) = 0;
5390 TREE_LANG_FLAG_3 (decl
) = 0;
5391 TREE_LANG_FLAG_4 (decl
) = 0;
5392 TREE_LANG_FLAG_5 (decl
) = 0;
5393 TREE_LANG_FLAG_6 (decl
) = 0;
5395 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5396 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5397 if (TREE_CODE (decl
) == FIELD_DECL
)
5399 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5400 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5401 DECL_QUALIFIER (decl
) = NULL_TREE
;
5404 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5406 struct cgraph_node
*node
;
5407 if (!(node
= cgraph_node::get (decl
))
5408 || (!node
->definition
&& !node
->clones
))
5411 node
->release_body ();
5414 release_function_body (decl
);
5415 DECL_ARGUMENTS (decl
) = NULL
;
5416 DECL_RESULT (decl
) = NULL
;
5417 DECL_INITIAL (decl
) = error_mark_node
;
5420 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5424 /* If DECL has a gimple body, then the context for its
5425 arguments must be DECL. Otherwise, it doesn't really
5426 matter, as we will not be emitting any code for DECL. In
5427 general, there may be other instances of DECL created by
5428 the front end and since PARM_DECLs are generally shared,
5429 their DECL_CONTEXT changes as the replicas of DECL are
5430 created. The only time where DECL_CONTEXT is important
5431 is for the FUNCTION_DECLs that have a gimple body (since
5432 the PARM_DECL will be used in the function's body). */
5433 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5434 DECL_CONTEXT (t
) = decl
;
5435 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5436 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5437 = target_option_default_node
;
5438 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5439 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5440 = optimization_default_node
;
5443 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5444 At this point, it is not needed anymore. */
5445 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5447 /* Clear the abstract origin if it refers to a method. Otherwise
5448 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5449 origin will not be output correctly. */
5450 if (DECL_ABSTRACT_ORIGIN (decl
)
5451 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5452 && RECORD_OR_UNION_TYPE_P
5453 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5454 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5456 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5457 DECL_VINDEX referring to itself into a vtable slot number as it
5458 should. Happens with functions that are copied and then forgotten
5459 about. Just clear it, it won't matter anymore. */
5460 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5461 DECL_VINDEX (decl
) = NULL_TREE
;
5463 else if (TREE_CODE (decl
) == VAR_DECL
)
5465 if ((DECL_EXTERNAL (decl
)
5466 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5467 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5468 DECL_INITIAL (decl
) = NULL_TREE
;
5470 else if (TREE_CODE (decl
) == TYPE_DECL
)
5472 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5473 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5474 DECL_INITIAL (decl
) = NULL_TREE
;
5476 else if (TREE_CODE (decl
) == FIELD_DECL
)
5477 DECL_INITIAL (decl
) = NULL_TREE
;
5478 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5479 && DECL_INITIAL (decl
)
5480 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5482 /* Strip builtins from the translation-unit BLOCK. We still have targets
5483 without builtin_decl_explicit support and also builtins are shared
5484 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5485 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5489 if (TREE_CODE (var
) == FUNCTION_DECL
5490 && DECL_BUILT_IN (var
))
5491 *nextp
= TREE_CHAIN (var
);
5493 nextp
= &TREE_CHAIN (var
);
5499 /* Data used when collecting DECLs and TYPEs for language data removal. */
5501 struct free_lang_data_d
5503 free_lang_data_d () : decls (100), types (100) {}
5505 /* Worklist to avoid excessive recursion. */
5506 auto_vec
<tree
> worklist
;
5508 /* Set of traversed objects. Used to avoid duplicate visits. */
5509 hash_set
<tree
> pset
;
5511 /* Array of symbols to process with free_lang_data_in_decl. */
5512 auto_vec
<tree
> decls
;
5514 /* Array of types to process with free_lang_data_in_type. */
5515 auto_vec
<tree
> types
;
5519 /* Save all language fields needed to generate proper debug information
5520 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5523 save_debug_info_for_decl (tree t
)
5525 /*struct saved_debug_info_d *sdi;*/
5527 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5529 /* FIXME. Partial implementation for saving debug info removed. */
5533 /* Save all language fields needed to generate proper debug information
5534 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5537 save_debug_info_for_type (tree t
)
5539 /*struct saved_debug_info_d *sdi;*/
5541 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5543 /* FIXME. Partial implementation for saving debug info removed. */
5547 /* Add type or decl T to one of the list of tree nodes that need their
5548 language data removed. The lists are held inside FLD. */
5551 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5555 fld
->decls
.safe_push (t
);
5556 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5557 save_debug_info_for_decl (t
);
5559 else if (TYPE_P (t
))
5561 fld
->types
.safe_push (t
);
5562 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5563 save_debug_info_for_type (t
);
5569 /* Push tree node T into FLD->WORKLIST. */
5572 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5574 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5575 fld
->worklist
.safe_push ((t
));
5579 /* Operand callback helper for free_lang_data_in_node. *TP is the
5580 subtree operand being considered. */
5583 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5586 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5588 if (TREE_CODE (t
) == TREE_LIST
)
5591 /* Language specific nodes will be removed, so there is no need
5592 to gather anything under them. */
5593 if (is_lang_specific (t
))
5601 /* Note that walk_tree does not traverse every possible field in
5602 decls, so we have to do our own traversals here. */
5603 add_tree_to_fld_list (t
, fld
);
5605 fld_worklist_push (DECL_NAME (t
), fld
);
5606 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5607 fld_worklist_push (DECL_SIZE (t
), fld
);
5608 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5610 /* We are going to remove everything under DECL_INITIAL for
5611 TYPE_DECLs. No point walking them. */
5612 if (TREE_CODE (t
) != TYPE_DECL
)
5613 fld_worklist_push (DECL_INITIAL (t
), fld
);
5615 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5616 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5618 if (TREE_CODE (t
) == FUNCTION_DECL
)
5620 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5621 fld_worklist_push (DECL_RESULT (t
), fld
);
5623 else if (TREE_CODE (t
) == TYPE_DECL
)
5625 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5627 else if (TREE_CODE (t
) == FIELD_DECL
)
5629 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5630 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5631 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5632 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5635 if ((TREE_CODE (t
) == VAR_DECL
|| TREE_CODE (t
) == PARM_DECL
)
5636 && DECL_HAS_VALUE_EXPR_P (t
))
5637 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5639 if (TREE_CODE (t
) != FIELD_DECL
5640 && TREE_CODE (t
) != TYPE_DECL
)
5641 fld_worklist_push (TREE_CHAIN (t
), fld
);
5644 else if (TYPE_P (t
))
5646 /* Note that walk_tree does not traverse every possible field in
5647 types, so we have to do our own traversals here. */
5648 add_tree_to_fld_list (t
, fld
);
5650 if (!RECORD_OR_UNION_TYPE_P (t
))
5651 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5652 fld_worklist_push (TYPE_SIZE (t
), fld
);
5653 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5654 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5655 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5656 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5657 fld_worklist_push (TYPE_NAME (t
), fld
);
5658 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5659 them and thus do not and want not to reach unused pointer types
5661 if (!POINTER_TYPE_P (t
))
5662 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5663 if (!RECORD_OR_UNION_TYPE_P (t
))
5664 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5665 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5666 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5667 do not and want not to reach unused variants this way. */
5668 if (TYPE_CONTEXT (t
))
5670 tree ctx
= TYPE_CONTEXT (t
);
5671 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5672 So push that instead. */
5673 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5674 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5675 fld_worklist_push (ctx
, fld
);
5677 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5678 and want not to reach unused types this way. */
5680 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5684 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5685 fld_worklist_push (TREE_TYPE (tem
), fld
);
5686 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5688 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5689 && TREE_CODE (tem
) == TREE_LIST
)
5692 fld_worklist_push (TREE_VALUE (tem
), fld
);
5693 tem
= TREE_CHAIN (tem
);
5697 if (RECORD_OR_UNION_TYPE_P (t
))
5700 /* Push all TYPE_FIELDS - there can be interleaving interesting
5701 and non-interesting things. */
5702 tem
= TYPE_FIELDS (t
);
5705 if (TREE_CODE (tem
) == FIELD_DECL
5706 || (TREE_CODE (tem
) == TYPE_DECL
5707 && !DECL_IGNORED_P (tem
)
5708 && debug_info_level
> DINFO_LEVEL_TERSE
5709 && !is_redundant_typedef (tem
)))
5710 fld_worklist_push (tem
, fld
);
5711 tem
= TREE_CHAIN (tem
);
5715 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5718 else if (TREE_CODE (t
) == BLOCK
)
5721 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5722 fld_worklist_push (tem
, fld
);
5723 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5724 fld_worklist_push (tem
, fld
);
5725 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5728 if (TREE_CODE (t
) != IDENTIFIER_NODE
5729 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5730 fld_worklist_push (TREE_TYPE (t
), fld
);
5736 /* Find decls and types in T. */
5739 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5743 if (!fld
->pset
.contains (t
))
5744 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5745 if (fld
->worklist
.is_empty ())
5747 t
= fld
->worklist
.pop ();
5751 /* Translate all the types in LIST with the corresponding runtime
5755 get_eh_types_for_runtime (tree list
)
5759 if (list
== NULL_TREE
)
5762 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5764 list
= TREE_CHAIN (list
);
5767 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5768 TREE_CHAIN (prev
) = n
;
5769 prev
= TREE_CHAIN (prev
);
5770 list
= TREE_CHAIN (list
);
5777 /* Find decls and types referenced in EH region R and store them in
5778 FLD->DECLS and FLD->TYPES. */
5781 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5792 /* The types referenced in each catch must first be changed to the
5793 EH types used at runtime. This removes references to FE types
5795 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5797 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5798 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5803 case ERT_ALLOWED_EXCEPTIONS
:
5804 r
->u
.allowed
.type_list
5805 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5806 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5809 case ERT_MUST_NOT_THROW
:
5810 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5811 find_decls_types_r
, fld
, &fld
->pset
);
5817 /* Find decls and types referenced in cgraph node N and store them in
5818 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5819 look for *every* kind of DECL and TYPE node reachable from N,
5820 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5821 NAMESPACE_DECLs, etc). */
5824 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5827 struct function
*fn
;
5831 find_decls_types (n
->decl
, fld
);
5833 if (!gimple_has_body_p (n
->decl
))
5836 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5838 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5840 /* Traverse locals. */
5841 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5842 find_decls_types (t
, fld
);
5844 /* Traverse EH regions in FN. */
5847 FOR_ALL_EH_REGION_FN (r
, fn
)
5848 find_decls_types_in_eh_region (r
, fld
);
5851 /* Traverse every statement in FN. */
5852 FOR_EACH_BB_FN (bb
, fn
)
5855 gimple_stmt_iterator si
;
5858 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5860 gphi
*phi
= psi
.phi ();
5862 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5864 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5865 find_decls_types (*arg_p
, fld
);
5869 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5871 gimple
*stmt
= gsi_stmt (si
);
5873 if (is_gimple_call (stmt
))
5874 find_decls_types (gimple_call_fntype (stmt
), fld
);
5876 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5878 tree arg
= gimple_op (stmt
, i
);
5879 find_decls_types (arg
, fld
);
5886 /* Find decls and types referenced in varpool node N and store them in
5887 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5888 look for *every* kind of DECL and TYPE node reachable from N,
5889 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5890 NAMESPACE_DECLs, etc). */
5893 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5895 find_decls_types (v
->decl
, fld
);
5898 /* If T needs an assembler name, have one created for it. */
5901 assign_assembler_name_if_neeeded (tree t
)
5903 if (need_assembler_name_p (t
))
5905 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5906 diagnostics that use input_location to show locus
5907 information. The problem here is that, at this point,
5908 input_location is generally anchored to the end of the file
5909 (since the parser is long gone), so we don't have a good
5910 position to pin it to.
5912 To alleviate this problem, this uses the location of T's
5913 declaration. Examples of this are
5914 testsuite/g++.dg/template/cond2.C and
5915 testsuite/g++.dg/template/pr35240.C. */
5916 location_t saved_location
= input_location
;
5917 input_location
= DECL_SOURCE_LOCATION (t
);
5919 decl_assembler_name (t
);
5921 input_location
= saved_location
;
5926 /* Free language specific information for every operand and expression
5927 in every node of the call graph. This process operates in three stages:
5929 1- Every callgraph node and varpool node is traversed looking for
5930 decls and types embedded in them. This is a more exhaustive
5931 search than that done by find_referenced_vars, because it will
5932 also collect individual fields, decls embedded in types, etc.
5934 2- All the decls found are sent to free_lang_data_in_decl.
5936 3- All the types found are sent to free_lang_data_in_type.
5938 The ordering between decls and types is important because
5939 free_lang_data_in_decl sets assembler names, which includes
5940 mangling. So types cannot be freed up until assembler names have
5944 free_lang_data_in_cgraph (void)
5946 struct cgraph_node
*n
;
5948 struct free_lang_data_d fld
;
5953 /* Find decls and types in the body of every function in the callgraph. */
5954 FOR_EACH_FUNCTION (n
)
5955 find_decls_types_in_node (n
, &fld
);
5957 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5958 find_decls_types (p
->decl
, &fld
);
5960 /* Find decls and types in every varpool symbol. */
5961 FOR_EACH_VARIABLE (v
)
5962 find_decls_types_in_var (v
, &fld
);
5964 /* Set the assembler name on every decl found. We need to do this
5965 now because free_lang_data_in_decl will invalidate data needed
5966 for mangling. This breaks mangling on interdependent decls. */
5967 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5968 assign_assembler_name_if_neeeded (t
);
5970 /* Traverse every decl found freeing its language data. */
5971 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5972 free_lang_data_in_decl (t
);
5974 /* Traverse every type found freeing its language data. */
5975 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5976 free_lang_data_in_type (t
);
5979 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5985 /* Free resources that are used by FE but are not needed once they are done. */
5988 free_lang_data (void)
5992 /* If we are the LTO frontend we have freed lang-specific data already. */
5994 || (!flag_generate_lto
&& !flag_generate_offload
))
5997 /* Allocate and assign alias sets to the standard integer types
5998 while the slots are still in the way the frontends generated them. */
5999 for (i
= 0; i
< itk_none
; ++i
)
6000 if (integer_types
[i
])
6001 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6003 /* Traverse the IL resetting language specific information for
6004 operands, expressions, etc. */
6005 free_lang_data_in_cgraph ();
6007 /* Create gimple variants for common types. */
6008 ptrdiff_type_node
= integer_type_node
;
6009 fileptr_type_node
= ptr_type_node
;
6011 /* Reset some langhooks. Do not reset types_compatible_p, it may
6012 still be used indirectly via the get_alias_set langhook. */
6013 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6014 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6015 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6017 /* We do not want the default decl_assembler_name implementation,
6018 rather if we have fixed everything we want a wrapper around it
6019 asserting that all non-local symbols already got their assembler
6020 name and only produce assembler names for local symbols. Or rather
6021 make sure we never call decl_assembler_name on local symbols and
6022 devise a separate, middle-end private scheme for it. */
6024 /* Reset diagnostic machinery. */
6025 tree_diagnostics_defaults (global_dc
);
6033 const pass_data pass_data_ipa_free_lang_data
=
6035 SIMPLE_IPA_PASS
, /* type */
6036 "*free_lang_data", /* name */
6037 OPTGROUP_NONE
, /* optinfo_flags */
6038 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6039 0, /* properties_required */
6040 0, /* properties_provided */
6041 0, /* properties_destroyed */
6042 0, /* todo_flags_start */
6043 0, /* todo_flags_finish */
6046 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6049 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6050 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6053 /* opt_pass methods: */
6054 virtual unsigned int execute (function
*) { return free_lang_data (); }
6056 }; // class pass_ipa_free_lang_data
6060 simple_ipa_opt_pass
*
6061 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6063 return new pass_ipa_free_lang_data (ctxt
);
6066 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6067 ATTR_NAME. Also used internally by remove_attribute(). */
6069 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6071 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6073 if (ident_len
== attr_len
)
6075 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6078 else if (ident_len
== attr_len
+ 4)
6080 /* There is the possibility that ATTR is 'text' and IDENT is
6082 const char *p
= IDENTIFIER_POINTER (ident
);
6083 if (p
[0] == '_' && p
[1] == '_'
6084 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6085 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6092 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6093 of ATTR_NAME, and LIST is not NULL_TREE. */
6095 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6099 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6101 if (ident_len
== attr_len
)
6103 if (!strcmp (attr_name
,
6104 IDENTIFIER_POINTER (get_attribute_name (list
))))
6107 /* TODO: If we made sure that attributes were stored in the
6108 canonical form without '__...__' (ie, as in 'text' as opposed
6109 to '__text__') then we could avoid the following case. */
6110 else if (ident_len
== attr_len
+ 4)
6112 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6113 if (p
[0] == '_' && p
[1] == '_'
6114 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6115 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6118 list
= TREE_CHAIN (list
);
6124 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6125 return a pointer to the attribute's list first element if the attribute
6126 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6130 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6135 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6137 if (attr_len
> ident_len
)
6139 list
= TREE_CHAIN (list
);
6143 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6145 if (strncmp (attr_name
, p
, attr_len
) == 0)
6148 /* TODO: If we made sure that attributes were stored in the
6149 canonical form without '__...__' (ie, as in 'text' as opposed
6150 to '__text__') then we could avoid the following case. */
6151 if (p
[0] == '_' && p
[1] == '_' &&
6152 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6155 list
= TREE_CHAIN (list
);
6162 /* A variant of lookup_attribute() that can be used with an identifier
6163 as the first argument, and where the identifier can be either
6164 'text' or '__text__'.
6166 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6167 return a pointer to the attribute's list element if the attribute
6168 is part of the list, or NULL_TREE if not found. If the attribute
6169 appears more than once, this only returns the first occurrence; the
6170 TREE_CHAIN of the return value should be passed back in if further
6171 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6172 can be in the form 'text' or '__text__'. */
6174 lookup_ident_attribute (tree attr_identifier
, tree list
)
6176 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6180 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6181 == IDENTIFIER_NODE
);
6183 if (cmp_attrib_identifiers (attr_identifier
,
6184 get_attribute_name (list
)))
6187 list
= TREE_CHAIN (list
);
6193 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6197 remove_attribute (const char *attr_name
, tree list
)
6200 size_t attr_len
= strlen (attr_name
);
6202 gcc_checking_assert (attr_name
[0] != '_');
6204 for (p
= &list
; *p
; )
6207 /* TODO: If we were storing attributes in normalized form, here
6208 we could use a simple strcmp(). */
6209 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6210 *p
= TREE_CHAIN (l
);
6212 p
= &TREE_CHAIN (l
);
6218 /* Return an attribute list that is the union of a1 and a2. */
6221 merge_attributes (tree a1
, tree a2
)
6225 /* Either one unset? Take the set one. */
6227 if ((attributes
= a1
) == 0)
6230 /* One that completely contains the other? Take it. */
6232 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6234 if (attribute_list_contained (a2
, a1
))
6238 /* Pick the longest list, and hang on the other list. */
6240 if (list_length (a1
) < list_length (a2
))
6241 attributes
= a2
, a2
= a1
;
6243 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6246 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6248 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6249 a
= lookup_ident_attribute (get_attribute_name (a2
),
6254 a1
= copy_node (a2
);
6255 TREE_CHAIN (a1
) = attributes
;
6264 /* Given types T1 and T2, merge their attributes and return
6268 merge_type_attributes (tree t1
, tree t2
)
6270 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6271 TYPE_ATTRIBUTES (t2
));
6274 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6278 merge_decl_attributes (tree olddecl
, tree newdecl
)
6280 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6281 DECL_ATTRIBUTES (newdecl
));
6284 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6286 /* Specialization of merge_decl_attributes for various Windows targets.
6288 This handles the following situation:
6290 __declspec (dllimport) int foo;
6293 The second instance of `foo' nullifies the dllimport. */
6296 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6299 int delete_dllimport_p
= 1;
6301 /* What we need to do here is remove from `old' dllimport if it doesn't
6302 appear in `new'. dllimport behaves like extern: if a declaration is
6303 marked dllimport and a definition appears later, then the object
6304 is not dllimport'd. We also remove a `new' dllimport if the old list
6305 contains dllexport: dllexport always overrides dllimport, regardless
6306 of the order of declaration. */
6307 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6308 delete_dllimport_p
= 0;
6309 else if (DECL_DLLIMPORT_P (new_tree
)
6310 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6312 DECL_DLLIMPORT_P (new_tree
) = 0;
6313 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6314 "dllimport ignored", new_tree
);
6316 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6318 /* Warn about overriding a symbol that has already been used, e.g.:
6319 extern int __attribute__ ((dllimport)) foo;
6320 int* bar () {return &foo;}
6323 if (TREE_USED (old
))
6325 warning (0, "%q+D redeclared without dllimport attribute "
6326 "after being referenced with dll linkage", new_tree
);
6327 /* If we have used a variable's address with dllimport linkage,
6328 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6329 decl may already have had TREE_CONSTANT computed.
6330 We still remove the attribute so that assembler code refers
6331 to '&foo rather than '_imp__foo'. */
6332 if (TREE_CODE (old
) == VAR_DECL
&& TREE_ADDRESSABLE (old
))
6333 DECL_DLLIMPORT_P (new_tree
) = 1;
6336 /* Let an inline definition silently override the external reference,
6337 but otherwise warn about attribute inconsistency. */
6338 else if (TREE_CODE (new_tree
) == VAR_DECL
6339 || !DECL_DECLARED_INLINE_P (new_tree
))
6340 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6341 "previous dllimport ignored", new_tree
);
6344 delete_dllimport_p
= 0;
6346 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6348 if (delete_dllimport_p
)
6349 a
= remove_attribute ("dllimport", a
);
6354 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6355 struct attribute_spec.handler. */
6358 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6364 /* These attributes may apply to structure and union types being created,
6365 but otherwise should pass to the declaration involved. */
6368 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6369 | (int) ATTR_FLAG_ARRAY_NEXT
))
6371 *no_add_attrs
= true;
6372 return tree_cons (name
, args
, NULL_TREE
);
6374 if (TREE_CODE (node
) == RECORD_TYPE
6375 || TREE_CODE (node
) == UNION_TYPE
)
6377 node
= TYPE_NAME (node
);
6383 warning (OPT_Wattributes
, "%qE attribute ignored",
6385 *no_add_attrs
= true;
6390 if (TREE_CODE (node
) != FUNCTION_DECL
6391 && TREE_CODE (node
) != VAR_DECL
6392 && TREE_CODE (node
) != TYPE_DECL
)
6394 *no_add_attrs
= true;
6395 warning (OPT_Wattributes
, "%qE attribute ignored",
6400 if (TREE_CODE (node
) == TYPE_DECL
6401 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6402 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6404 *no_add_attrs
= true;
6405 warning (OPT_Wattributes
, "%qE attribute ignored",
6410 is_dllimport
= is_attribute_p ("dllimport", name
);
6412 /* Report error on dllimport ambiguities seen now before they cause
6416 /* Honor any target-specific overrides. */
6417 if (!targetm
.valid_dllimport_attribute_p (node
))
6418 *no_add_attrs
= true;
6420 else if (TREE_CODE (node
) == FUNCTION_DECL
6421 && DECL_DECLARED_INLINE_P (node
))
6423 warning (OPT_Wattributes
, "inline function %q+D declared as "
6424 " dllimport: attribute ignored", node
);
6425 *no_add_attrs
= true;
6427 /* Like MS, treat definition of dllimported variables and
6428 non-inlined functions on declaration as syntax errors. */
6429 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6431 error ("function %q+D definition is marked dllimport", node
);
6432 *no_add_attrs
= true;
6435 else if (TREE_CODE (node
) == VAR_DECL
)
6437 if (DECL_INITIAL (node
))
6439 error ("variable %q+D definition is marked dllimport",
6441 *no_add_attrs
= true;
6444 /* `extern' needn't be specified with dllimport.
6445 Specify `extern' now and hope for the best. Sigh. */
6446 DECL_EXTERNAL (node
) = 1;
6447 /* Also, implicitly give dllimport'd variables declared within
6448 a function global scope, unless declared static. */
6449 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6450 TREE_PUBLIC (node
) = 1;
6453 if (*no_add_attrs
== false)
6454 DECL_DLLIMPORT_P (node
) = 1;
6456 else if (TREE_CODE (node
) == FUNCTION_DECL
6457 && DECL_DECLARED_INLINE_P (node
)
6458 && flag_keep_inline_dllexport
)
6459 /* An exported function, even if inline, must be emitted. */
6460 DECL_EXTERNAL (node
) = 0;
6462 /* Report error if symbol is not accessible at global scope. */
6463 if (!TREE_PUBLIC (node
)
6464 && (TREE_CODE (node
) == VAR_DECL
6465 || TREE_CODE (node
) == FUNCTION_DECL
))
6467 error ("external linkage required for symbol %q+D because of "
6468 "%qE attribute", node
, name
);
6469 *no_add_attrs
= true;
6472 /* A dllexport'd entity must have default visibility so that other
6473 program units (shared libraries or the main executable) can see
6474 it. A dllimport'd entity must have default visibility so that
6475 the linker knows that undefined references within this program
6476 unit can be resolved by the dynamic linker. */
6479 if (DECL_VISIBILITY_SPECIFIED (node
)
6480 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6481 error ("%qE implies default visibility, but %qD has already "
6482 "been declared with a different visibility",
6484 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6485 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6491 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6493 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6494 of the various TYPE_QUAL values. */
6497 set_type_quals (tree type
, int type_quals
)
6499 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6500 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6501 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6502 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6503 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6506 /* Returns true iff unqualified CAND and BASE are equivalent. */
6509 check_base_type (const_tree cand
, const_tree base
)
6511 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6512 /* Apparently this is needed for Objective-C. */
6513 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6514 /* Check alignment. */
6515 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6516 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6517 TYPE_ATTRIBUTES (base
)));
6520 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6523 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6525 return (TYPE_QUALS (cand
) == type_quals
6526 && check_base_type (cand
, base
));
6529 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6532 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6534 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6535 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6536 /* Apparently this is needed for Objective-C. */
6537 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6538 /* Check alignment. */
6539 && TYPE_ALIGN (cand
) == align
6540 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6541 TYPE_ATTRIBUTES (base
)));
6544 /* This function checks to see if TYPE matches the size one of the built-in
6545 atomic types, and returns that core atomic type. */
6548 find_atomic_core_type (tree type
)
6550 tree base_atomic_type
;
6552 /* Only handle complete types. */
6553 if (TYPE_SIZE (type
) == NULL_TREE
)
6556 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6560 base_atomic_type
= atomicQI_type_node
;
6564 base_atomic_type
= atomicHI_type_node
;
6568 base_atomic_type
= atomicSI_type_node
;
6572 base_atomic_type
= atomicDI_type_node
;
6576 base_atomic_type
= atomicTI_type_node
;
6580 base_atomic_type
= NULL_TREE
;
6583 return base_atomic_type
;
6586 /* Return a version of the TYPE, qualified as indicated by the
6587 TYPE_QUALS, if one exists. If no qualified version exists yet,
6588 return NULL_TREE. */
6591 get_qualified_type (tree type
, int type_quals
)
6595 if (TYPE_QUALS (type
) == type_quals
)
6598 /* Search the chain of variants to see if there is already one there just
6599 like the one we need to have. If so, use that existing one. We must
6600 preserve the TYPE_NAME, since there is code that depends on this. */
6601 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6602 if (check_qualified_type (t
, type
, type_quals
))
6608 /* Like get_qualified_type, but creates the type if it does not
6609 exist. This function never returns NULL_TREE. */
6612 build_qualified_type (tree type
, int type_quals
)
6616 /* See if we already have the appropriate qualified variant. */
6617 t
= get_qualified_type (type
, type_quals
);
6619 /* If not, build it. */
6622 t
= build_variant_type_copy (type
);
6623 set_type_quals (t
, type_quals
);
6625 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6627 /* See if this object can map to a basic atomic type. */
6628 tree atomic_type
= find_atomic_core_type (type
);
6631 /* Ensure the alignment of this type is compatible with
6632 the required alignment of the atomic type. */
6633 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6634 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6638 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6639 /* Propagate structural equality. */
6640 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6641 else if (TYPE_CANONICAL (type
) != type
)
6642 /* Build the underlying canonical type, since it is different
6645 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6646 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6649 /* T is its own canonical type. */
6650 TYPE_CANONICAL (t
) = t
;
6657 /* Create a variant of type T with alignment ALIGN. */
6660 build_aligned_type (tree type
, unsigned int align
)
6664 if (TYPE_PACKED (type
)
6665 || TYPE_ALIGN (type
) == align
)
6668 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6669 if (check_aligned_type (t
, type
, align
))
6672 t
= build_variant_type_copy (type
);
6673 SET_TYPE_ALIGN (t
, align
);
6678 /* Create a new distinct copy of TYPE. The new type is made its own
6679 MAIN_VARIANT. If TYPE requires structural equality checks, the
6680 resulting type requires structural equality checks; otherwise, its
6681 TYPE_CANONICAL points to itself. */
6684 build_distinct_type_copy (tree type
)
6686 tree t
= copy_node (type
);
6688 TYPE_POINTER_TO (t
) = 0;
6689 TYPE_REFERENCE_TO (t
) = 0;
6691 /* Set the canonical type either to a new equivalence class, or
6692 propagate the need for structural equality checks. */
6693 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6694 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6696 TYPE_CANONICAL (t
) = t
;
6698 /* Make it its own variant. */
6699 TYPE_MAIN_VARIANT (t
) = t
;
6700 TYPE_NEXT_VARIANT (t
) = 0;
6702 /* We do not record methods in type copies nor variants
6703 so we do not need to keep them up to date when new method
6705 if (RECORD_OR_UNION_TYPE_P (t
))
6706 TYPE_METHODS (t
) = NULL_TREE
;
6708 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6709 whose TREE_TYPE is not t. This can also happen in the Ada
6710 frontend when using subtypes. */
6715 /* Create a new variant of TYPE, equivalent but distinct. This is so
6716 the caller can modify it. TYPE_CANONICAL for the return type will
6717 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6718 are considered equal by the language itself (or that both types
6719 require structural equality checks). */
6722 build_variant_type_copy (tree type
)
6724 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6726 t
= build_distinct_type_copy (type
);
6728 /* Since we're building a variant, assume that it is a non-semantic
6729 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6730 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6731 /* Type variants have no alias set defined. */
6732 TYPE_ALIAS_SET (t
) = -1;
6734 /* Add the new type to the chain of variants of TYPE. */
6735 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6736 TYPE_NEXT_VARIANT (m
) = t
;
6737 TYPE_MAIN_VARIANT (t
) = m
;
6742 /* Return true if the from tree in both tree maps are equal. */
6745 tree_map_base_eq (const void *va
, const void *vb
)
6747 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6748 *const b
= (const struct tree_map_base
*) vb
;
6749 return (a
->from
== b
->from
);
6752 /* Hash a from tree in a tree_base_map. */
6755 tree_map_base_hash (const void *item
)
6757 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6760 /* Return true if this tree map structure is marked for garbage collection
6761 purposes. We simply return true if the from tree is marked, so that this
6762 structure goes away when the from tree goes away. */
6765 tree_map_base_marked_p (const void *p
)
6767 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6770 /* Hash a from tree in a tree_map. */
6773 tree_map_hash (const void *item
)
6775 return (((const struct tree_map
*) item
)->hash
);
6778 /* Hash a from tree in a tree_decl_map. */
6781 tree_decl_map_hash (const void *item
)
6783 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6786 /* Return the initialization priority for DECL. */
6789 decl_init_priority_lookup (tree decl
)
6791 symtab_node
*snode
= symtab_node::get (decl
);
6794 return DEFAULT_INIT_PRIORITY
;
6796 snode
->get_init_priority ();
6799 /* Return the finalization priority for DECL. */
6802 decl_fini_priority_lookup (tree decl
)
6804 cgraph_node
*node
= cgraph_node::get (decl
);
6807 return DEFAULT_INIT_PRIORITY
;
6809 node
->get_fini_priority ();
6812 /* Set the initialization priority for DECL to PRIORITY. */
6815 decl_init_priority_insert (tree decl
, priority_type priority
)
6817 struct symtab_node
*snode
;
6819 if (priority
== DEFAULT_INIT_PRIORITY
)
6821 snode
= symtab_node::get (decl
);
6825 else if (TREE_CODE (decl
) == VAR_DECL
)
6826 snode
= varpool_node::get_create (decl
);
6828 snode
= cgraph_node::get_create (decl
);
6829 snode
->set_init_priority (priority
);
6832 /* Set the finalization priority for DECL to PRIORITY. */
6835 decl_fini_priority_insert (tree decl
, priority_type priority
)
6837 struct cgraph_node
*node
;
6839 if (priority
== DEFAULT_INIT_PRIORITY
)
6841 node
= cgraph_node::get (decl
);
6846 node
= cgraph_node::get_create (decl
);
6847 node
->set_fini_priority (priority
);
6850 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6853 print_debug_expr_statistics (void)
6855 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6856 (long) debug_expr_for_decl
->size (),
6857 (long) debug_expr_for_decl
->elements (),
6858 debug_expr_for_decl
->collisions ());
6861 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6864 print_value_expr_statistics (void)
6866 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6867 (long) value_expr_for_decl
->size (),
6868 (long) value_expr_for_decl
->elements (),
6869 value_expr_for_decl
->collisions ());
6872 /* Lookup a debug expression for FROM, and return it if we find one. */
6875 decl_debug_expr_lookup (tree from
)
6877 struct tree_decl_map
*h
, in
;
6878 in
.base
.from
= from
;
6880 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6886 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6889 decl_debug_expr_insert (tree from
, tree to
)
6891 struct tree_decl_map
*h
;
6893 h
= ggc_alloc
<tree_decl_map
> ();
6894 h
->base
.from
= from
;
6896 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6899 /* Lookup a value expression for FROM, and return it if we find one. */
6902 decl_value_expr_lookup (tree from
)
6904 struct tree_decl_map
*h
, in
;
6905 in
.base
.from
= from
;
6907 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6913 /* Insert a mapping FROM->TO in the value expression hashtable. */
6916 decl_value_expr_insert (tree from
, tree to
)
6918 struct tree_decl_map
*h
;
6920 h
= ggc_alloc
<tree_decl_map
> ();
6921 h
->base
.from
= from
;
6923 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6926 /* Lookup a vector of debug arguments for FROM, and return it if we
6930 decl_debug_args_lookup (tree from
)
6932 struct tree_vec_map
*h
, in
;
6934 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6936 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6937 in
.base
.from
= from
;
6938 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6944 /* Insert a mapping FROM->empty vector of debug arguments in the value
6945 expression hashtable. */
6948 decl_debug_args_insert (tree from
)
6950 struct tree_vec_map
*h
;
6953 if (DECL_HAS_DEBUG_ARGS_P (from
))
6954 return decl_debug_args_lookup (from
);
6955 if (debug_args_for_decl
== NULL
)
6956 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6957 h
= ggc_alloc
<tree_vec_map
> ();
6958 h
->base
.from
= from
;
6960 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6962 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6966 /* Hashing of types so that we don't make duplicates.
6967 The entry point is `type_hash_canon'. */
6969 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6970 with types in the TREE_VALUE slots), by adding the hash codes
6971 of the individual types. */
6974 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6978 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6979 if (TREE_VALUE (tail
) != error_mark_node
)
6980 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6983 /* These are the Hashtable callback functions. */
6985 /* Returns true iff the types are equivalent. */
6988 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6990 /* First test the things that are the same for all types. */
6991 if (a
->hash
!= b
->hash
6992 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6993 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6994 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6995 TYPE_ATTRIBUTES (b
->type
))
6996 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6997 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
7000 /* Be careful about comparing arrays before and after the element type
7001 has been completed; don't compare TYPE_ALIGN unless both types are
7003 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
7004 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
7005 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7008 switch (TREE_CODE (a
->type
))
7013 case REFERENCE_TYPE
:
7018 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7021 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7022 && !(TYPE_VALUES (a
->type
)
7023 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7024 && TYPE_VALUES (b
->type
)
7025 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7026 && type_list_equal (TYPE_VALUES (a
->type
),
7027 TYPE_VALUES (b
->type
))))
7035 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7037 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7038 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7039 TYPE_MAX_VALUE (b
->type
)))
7040 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7041 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7042 TYPE_MIN_VALUE (b
->type
))));
7044 case FIXED_POINT_TYPE
:
7045 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7048 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7051 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7052 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7053 || (TYPE_ARG_TYPES (a
->type
)
7054 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7055 && TYPE_ARG_TYPES (b
->type
)
7056 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7057 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7058 TYPE_ARG_TYPES (b
->type
)))))
7062 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7066 case QUAL_UNION_TYPE
:
7067 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7068 || (TYPE_FIELDS (a
->type
)
7069 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7070 && TYPE_FIELDS (b
->type
)
7071 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7072 && type_list_equal (TYPE_FIELDS (a
->type
),
7073 TYPE_FIELDS (b
->type
))));
7076 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7077 || (TYPE_ARG_TYPES (a
->type
)
7078 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7079 && TYPE_ARG_TYPES (b
->type
)
7080 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7081 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7082 TYPE_ARG_TYPES (b
->type
))))
7090 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7091 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7096 /* Given TYPE, and HASHCODE its hash code, return the canonical
7097 object for an identical type if one already exists.
7098 Otherwise, return TYPE, and record it as the canonical object.
7100 To use this function, first create a type of the sort you want.
7101 Then compute its hash code from the fields of the type that
7102 make it different from other similar types.
7103 Then call this function and use the value. */
7106 type_hash_canon (unsigned int hashcode
, tree type
)
7111 /* The hash table only contains main variants, so ensure that's what we're
7113 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7115 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7116 must call that routine before comparing TYPE_ALIGNs. */
7122 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7125 tree t1
= ((type_hash
*) *loc
)->type
;
7126 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7132 struct type_hash
*h
;
7134 h
= ggc_alloc
<type_hash
> ();
7144 print_type_hash_statistics (void)
7146 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7147 (long) type_hash_table
->size (),
7148 (long) type_hash_table
->elements (),
7149 type_hash_table
->collisions ());
7152 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7153 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7154 by adding the hash codes of the individual attributes. */
7157 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7161 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7162 /* ??? Do we want to add in TREE_VALUE too? */
7163 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7166 /* Given two lists of attributes, return true if list l2 is
7167 equivalent to l1. */
7170 attribute_list_equal (const_tree l1
, const_tree l2
)
7175 return attribute_list_contained (l1
, l2
)
7176 && attribute_list_contained (l2
, l1
);
7179 /* Given two lists of attributes, return true if list L2 is
7180 completely contained within L1. */
7181 /* ??? This would be faster if attribute names were stored in a canonicalized
7182 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7183 must be used to show these elements are equivalent (which they are). */
7184 /* ??? It's not clear that attributes with arguments will always be handled
7188 attribute_list_contained (const_tree l1
, const_tree l2
)
7192 /* First check the obvious, maybe the lists are identical. */
7196 /* Maybe the lists are similar. */
7197 for (t1
= l1
, t2
= l2
;
7199 && get_attribute_name (t1
) == get_attribute_name (t2
)
7200 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7201 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7204 /* Maybe the lists are equal. */
7205 if (t1
== 0 && t2
== 0)
7208 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7211 /* This CONST_CAST is okay because lookup_attribute does not
7212 modify its argument and the return value is assigned to a
7214 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7215 CONST_CAST_TREE (l1
));
7216 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7217 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7221 if (attr
== NULL_TREE
)
7228 /* Given two lists of types
7229 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7230 return 1 if the lists contain the same types in the same order.
7231 Also, the TREE_PURPOSEs must match. */
7234 type_list_equal (const_tree l1
, const_tree l2
)
7238 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7239 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7240 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7241 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7242 && (TREE_TYPE (TREE_PURPOSE (t1
))
7243 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7249 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7250 given by TYPE. If the argument list accepts variable arguments,
7251 then this function counts only the ordinary arguments. */
7254 type_num_arguments (const_tree type
)
7259 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7260 /* If the function does not take a variable number of arguments,
7261 the last element in the list will have type `void'. */
7262 if (VOID_TYPE_P (TREE_VALUE (t
)))
7270 /* Nonzero if integer constants T1 and T2
7271 represent the same constant value. */
7274 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7279 if (t1
== 0 || t2
== 0)
7282 if (TREE_CODE (t1
) == INTEGER_CST
7283 && TREE_CODE (t2
) == INTEGER_CST
7284 && wi::to_widest (t1
) == wi::to_widest (t2
))
7290 /* Return true if T is an INTEGER_CST whose numerical value (extended
7291 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7294 tree_fits_shwi_p (const_tree t
)
7296 return (t
!= NULL_TREE
7297 && TREE_CODE (t
) == INTEGER_CST
7298 && wi::fits_shwi_p (wi::to_widest (t
)));
7301 /* Return true if T is an INTEGER_CST whose numerical value (extended
7302 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7305 tree_fits_uhwi_p (const_tree t
)
7307 return (t
!= NULL_TREE
7308 && TREE_CODE (t
) == INTEGER_CST
7309 && wi::fits_uhwi_p (wi::to_widest (t
)));
7312 /* T is an INTEGER_CST whose numerical value (extended according to
7313 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7317 tree_to_shwi (const_tree t
)
7319 gcc_assert (tree_fits_shwi_p (t
));
7320 return TREE_INT_CST_LOW (t
);
7323 /* T is an INTEGER_CST whose numerical value (extended according to
7324 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7327 unsigned HOST_WIDE_INT
7328 tree_to_uhwi (const_tree t
)
7330 gcc_assert (tree_fits_uhwi_p (t
));
7331 return TREE_INT_CST_LOW (t
);
7334 /* Return the most significant (sign) bit of T. */
7337 tree_int_cst_sign_bit (const_tree t
)
7339 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7341 return wi::extract_uhwi (t
, bitno
, 1);
7344 /* Return an indication of the sign of the integer constant T.
7345 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7346 Note that -1 will never be returned if T's type is unsigned. */
7349 tree_int_cst_sgn (const_tree t
)
7351 if (wi::eq_p (t
, 0))
7353 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7355 else if (wi::neg_p (t
))
7361 /* Return the minimum number of bits needed to represent VALUE in a
7362 signed or unsigned type, UNSIGNEDP says which. */
7365 tree_int_cst_min_precision (tree value
, signop sgn
)
7367 /* If the value is negative, compute its negative minus 1. The latter
7368 adjustment is because the absolute value of the largest negative value
7369 is one larger than the largest positive value. This is equivalent to
7370 a bit-wise negation, so use that operation instead. */
7372 if (tree_int_cst_sgn (value
) < 0)
7373 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7375 /* Return the number of bits needed, taking into account the fact
7376 that we need one more bit for a signed than unsigned type.
7377 If value is 0 or -1, the minimum precision is 1 no matter
7378 whether unsignedp is true or false. */
7380 if (integer_zerop (value
))
7383 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7386 /* Return truthvalue of whether T1 is the same tree structure as T2.
7387 Return 1 if they are the same.
7388 Return 0 if they are understandably different.
7389 Return -1 if either contains tree structure not understood by
7393 simple_cst_equal (const_tree t1
, const_tree t2
)
7395 enum tree_code code1
, code2
;
7401 if (t1
== 0 || t2
== 0)
7404 code1
= TREE_CODE (t1
);
7405 code2
= TREE_CODE (t2
);
7407 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7409 if (CONVERT_EXPR_CODE_P (code2
)
7410 || code2
== NON_LVALUE_EXPR
)
7411 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7413 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7416 else if (CONVERT_EXPR_CODE_P (code2
)
7417 || code2
== NON_LVALUE_EXPR
)
7418 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7426 return wi::to_widest (t1
) == wi::to_widest (t2
);
7429 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7432 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7435 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7436 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7437 TREE_STRING_LENGTH (t1
)));
7441 unsigned HOST_WIDE_INT idx
;
7442 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7443 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7445 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7448 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7449 /* ??? Should we handle also fields here? */
7450 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7456 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7459 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7462 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7465 const_tree arg1
, arg2
;
7466 const_call_expr_arg_iterator iter1
, iter2
;
7467 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7468 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7470 arg1
= next_const_call_expr_arg (&iter1
),
7471 arg2
= next_const_call_expr_arg (&iter2
))
7473 cmp
= simple_cst_equal (arg1
, arg2
);
7477 return arg1
== arg2
;
7481 /* Special case: if either target is an unallocated VAR_DECL,
7482 it means that it's going to be unified with whatever the
7483 TARGET_EXPR is really supposed to initialize, so treat it
7484 as being equivalent to anything. */
7485 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7486 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7487 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7488 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7489 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7490 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7493 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7498 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7500 case WITH_CLEANUP_EXPR
:
7501 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7505 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7508 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7509 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7523 /* This general rule works for most tree codes. All exceptions should be
7524 handled above. If this is a language-specific tree code, we can't
7525 trust what might be in the operand, so say we don't know
7527 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7530 switch (TREE_CODE_CLASS (code1
))
7534 case tcc_comparison
:
7535 case tcc_expression
:
7539 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7541 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7553 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7554 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7555 than U, respectively. */
7558 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7560 if (tree_int_cst_sgn (t
) < 0)
7562 else if (!tree_fits_uhwi_p (t
))
7564 else if (TREE_INT_CST_LOW (t
) == u
)
7566 else if (TREE_INT_CST_LOW (t
) < u
)
7572 /* Return true if SIZE represents a constant size that is in bounds of
7573 what the middle-end and the backend accepts (covering not more than
7574 half of the address-space). */
7577 valid_constant_size_p (const_tree size
)
7579 if (! tree_fits_uhwi_p (size
)
7580 || TREE_OVERFLOW (size
)
7581 || tree_int_cst_sign_bit (size
) != 0)
7586 /* Return the precision of the type, or for a complex or vector type the
7587 precision of the type of its elements. */
7590 element_precision (const_tree type
)
7593 type
= TREE_TYPE (type
);
7594 enum tree_code code
= TREE_CODE (type
);
7595 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7596 type
= TREE_TYPE (type
);
7598 return TYPE_PRECISION (type
);
7601 /* Return true if CODE represents an associative tree code. Otherwise
7604 associative_tree_code (enum tree_code code
)
7623 /* Return true if CODE represents a commutative tree code. Otherwise
7626 commutative_tree_code (enum tree_code code
)
7632 case MULT_HIGHPART_EXPR
:
7640 case UNORDERED_EXPR
:
7644 case TRUTH_AND_EXPR
:
7645 case TRUTH_XOR_EXPR
:
7647 case WIDEN_MULT_EXPR
:
7648 case VEC_WIDEN_MULT_HI_EXPR
:
7649 case VEC_WIDEN_MULT_LO_EXPR
:
7650 case VEC_WIDEN_MULT_EVEN_EXPR
:
7651 case VEC_WIDEN_MULT_ODD_EXPR
:
7660 /* Return true if CODE represents a ternary tree code for which the
7661 first two operands are commutative. Otherwise return false. */
7663 commutative_ternary_tree_code (enum tree_code code
)
7667 case WIDEN_MULT_PLUS_EXPR
:
7668 case WIDEN_MULT_MINUS_EXPR
:
7679 /* Returns true if CODE can overflow. */
7682 operation_can_overflow (enum tree_code code
)
7690 /* Can overflow in various ways. */
7692 case TRUNC_DIV_EXPR
:
7693 case EXACT_DIV_EXPR
:
7694 case FLOOR_DIV_EXPR
:
7696 /* For INT_MIN / -1. */
7703 /* These operators cannot overflow. */
7708 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7709 ftrapv doesn't generate trapping insns for CODE. */
7712 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7714 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7716 /* We don't generate instructions that trap on overflow for complex or vector
7718 if (!INTEGRAL_TYPE_P (type
))
7721 if (!TYPE_OVERFLOW_TRAPS (type
))
7731 /* These operators can overflow, and -ftrapv generates trapping code for
7734 case TRUNC_DIV_EXPR
:
7735 case EXACT_DIV_EXPR
:
7736 case FLOOR_DIV_EXPR
:
7739 /* These operators can overflow, but -ftrapv does not generate trapping
7743 /* These operators cannot overflow. */
7751 /* Generate a hash value for an expression. This can be used iteratively
7752 by passing a previous result as the HSTATE argument.
7754 This function is intended to produce the same hash for expressions which
7755 would compare equal using operand_equal_p. */
7757 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7760 enum tree_code code
;
7761 enum tree_code_class tclass
;
7765 hstate
.merge_hash (0);
7769 if (!(flags
& OEP_ADDRESS_OF
))
7772 code
= TREE_CODE (t
);
7776 /* Alas, constants aren't shared, so we can't rely on pointer
7779 hstate
.merge_hash (0);
7782 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7783 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7784 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7789 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7792 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7793 hstate
.merge_hash (val2
);
7798 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7799 hstate
.merge_hash (val2
);
7803 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7804 TREE_STRING_LENGTH (t
));
7807 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7808 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7813 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7814 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7818 /* We can just compare by pointer. */
7819 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7821 case PLACEHOLDER_EXPR
:
7822 /* The node itself doesn't matter. */
7829 /* A list of expressions, for a CALL_EXPR or as the elements of a
7831 for (; t
; t
= TREE_CHAIN (t
))
7832 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7836 unsigned HOST_WIDE_INT idx
;
7838 flags
&= ~OEP_ADDRESS_OF
;
7839 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7841 inchash::add_expr (field
, hstate
, flags
);
7842 inchash::add_expr (value
, hstate
, flags
);
7846 case STATEMENT_LIST
:
7848 tree_stmt_iterator i
;
7849 for (i
= tsi_start (CONST_CAST_TREE (t
));
7850 !tsi_end_p (i
); tsi_next (&i
))
7851 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7855 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7856 Otherwise nodes that compare equal according to operand_equal_p might
7857 get different hash codes. However, don't do this for machine specific
7858 or front end builtins, since the function code is overloaded in those
7860 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7861 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7863 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7864 code
= TREE_CODE (t
);
7868 tclass
= TREE_CODE_CLASS (code
);
7870 if (tclass
== tcc_declaration
)
7872 /* DECL's have a unique ID */
7873 hstate
.add_wide_int (DECL_UID (t
));
7875 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7877 /* For comparisons that can be swapped, use the lower
7879 enum tree_code ccode
= swap_tree_comparison (code
);
7882 hstate
.add_object (ccode
);
7883 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7884 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7886 else if (CONVERT_EXPR_CODE_P (code
))
7888 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7890 enum tree_code ccode
= NOP_EXPR
;
7891 hstate
.add_object (ccode
);
7893 /* Don't hash the type, that can lead to having nodes which
7894 compare equal according to operand_equal_p, but which
7895 have different hash codes. Make sure to include signedness
7896 in the hash computation. */
7897 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7898 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7900 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7901 else if (code
== MEM_REF
7902 && (flags
& OEP_ADDRESS_OF
) != 0
7903 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7904 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7905 && integer_zerop (TREE_OPERAND (t
, 1)))
7906 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7908 /* Don't ICE on FE specific trees, or their arguments etc.
7909 during operand_equal_p hash verification. */
7910 else if (!IS_EXPR_CODE_CLASS (tclass
))
7911 gcc_assert (flags
& OEP_HASH_CHECK
);
7914 unsigned int sflags
= flags
;
7916 hstate
.add_object (code
);
7921 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7922 flags
|= OEP_ADDRESS_OF
;
7928 case TARGET_MEM_REF
:
7929 flags
&= ~OEP_ADDRESS_OF
;
7934 case ARRAY_RANGE_REF
:
7937 sflags
&= ~OEP_ADDRESS_OF
;
7941 flags
&= ~OEP_ADDRESS_OF
;
7945 case WIDEN_MULT_PLUS_EXPR
:
7946 case WIDEN_MULT_MINUS_EXPR
:
7948 /* The multiplication operands are commutative. */
7949 inchash::hash one
, two
;
7950 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7951 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7952 hstate
.add_commutative (one
, two
);
7953 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7958 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7959 hstate
.add_int (CALL_EXPR_IFN (t
));
7963 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7964 Usually different TARGET_EXPRs just should use
7965 different temporaries in their slots. */
7966 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7973 /* Don't hash the type, that can lead to having nodes which
7974 compare equal according to operand_equal_p, but which
7975 have different hash codes. */
7976 if (code
== NON_LVALUE_EXPR
)
7978 /* Make sure to include signness in the hash computation. */
7979 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7980 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7983 else if (commutative_tree_code (code
))
7985 /* It's a commutative expression. We want to hash it the same
7986 however it appears. We do this by first hashing both operands
7987 and then rehashing based on the order of their independent
7989 inchash::hash one
, two
;
7990 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7991 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7992 hstate
.add_commutative (one
, two
);
7995 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7996 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7997 i
== 0 ? flags
: sflags
);
8005 /* Constructors for pointer, array and function types.
8006 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8007 constructed by language-dependent code, not here.) */
8009 /* Construct, lay out and return the type of pointers to TO_TYPE with
8010 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8011 reference all of memory. If such a type has already been
8012 constructed, reuse it. */
8015 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8019 bool could_alias
= can_alias_all
;
8021 if (to_type
== error_mark_node
)
8022 return error_mark_node
;
8024 /* If the pointed-to type has the may_alias attribute set, force
8025 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8026 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8027 can_alias_all
= true;
8029 /* In some cases, languages will have things that aren't a POINTER_TYPE
8030 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8031 In that case, return that type without regard to the rest of our
8034 ??? This is a kludge, but consistent with the way this function has
8035 always operated and there doesn't seem to be a good way to avoid this
8037 if (TYPE_POINTER_TO (to_type
) != 0
8038 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8039 return TYPE_POINTER_TO (to_type
);
8041 /* First, if we already have a type for pointers to TO_TYPE and it's
8042 the proper mode, use it. */
8043 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8044 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8047 t
= make_node (POINTER_TYPE
);
8049 TREE_TYPE (t
) = to_type
;
8050 SET_TYPE_MODE (t
, mode
);
8051 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8052 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8053 TYPE_POINTER_TO (to_type
) = t
;
8055 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8056 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8057 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8058 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8060 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8063 /* Lay out the type. This function has many callers that are concerned
8064 with expression-construction, and this simplifies them all. */
8070 /* By default build pointers in ptr_mode. */
8073 build_pointer_type (tree to_type
)
8075 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8076 : TYPE_ADDR_SPACE (to_type
);
8077 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8078 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8081 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8084 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8088 bool could_alias
= can_alias_all
;
8090 if (to_type
== error_mark_node
)
8091 return error_mark_node
;
8093 /* If the pointed-to type has the may_alias attribute set, force
8094 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8095 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8096 can_alias_all
= true;
8098 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8099 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8100 In that case, return that type without regard to the rest of our
8103 ??? This is a kludge, but consistent with the way this function has
8104 always operated and there doesn't seem to be a good way to avoid this
8106 if (TYPE_REFERENCE_TO (to_type
) != 0
8107 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8108 return TYPE_REFERENCE_TO (to_type
);
8110 /* First, if we already have a type for pointers to TO_TYPE and it's
8111 the proper mode, use it. */
8112 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8113 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8116 t
= make_node (REFERENCE_TYPE
);
8118 TREE_TYPE (t
) = to_type
;
8119 SET_TYPE_MODE (t
, mode
);
8120 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8121 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8122 TYPE_REFERENCE_TO (to_type
) = t
;
8124 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8125 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8126 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8127 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8129 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8138 /* Build the node for the type of references-to-TO_TYPE by default
8142 build_reference_type (tree to_type
)
8144 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8145 : TYPE_ADDR_SPACE (to_type
);
8146 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8147 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8150 #define MAX_INT_CACHED_PREC \
8151 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8152 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8154 /* Builds a signed or unsigned integer type of precision PRECISION.
8155 Used for C bitfields whose precision does not match that of
8156 built-in target types. */
8158 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8164 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8166 if (precision
<= MAX_INT_CACHED_PREC
)
8168 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8173 itype
= make_node (INTEGER_TYPE
);
8174 TYPE_PRECISION (itype
) = precision
;
8177 fixup_unsigned_type (itype
);
8179 fixup_signed_type (itype
);
8182 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8183 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8184 if (precision
<= MAX_INT_CACHED_PREC
)
8185 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8190 #define MAX_BOOL_CACHED_PREC \
8191 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8192 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8194 /* Builds a boolean type of precision PRECISION.
8195 Used for boolean vectors to choose proper vector element size. */
8197 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8201 if (precision
<= MAX_BOOL_CACHED_PREC
)
8203 type
= nonstandard_boolean_type_cache
[precision
];
8208 type
= make_node (BOOLEAN_TYPE
);
8209 TYPE_PRECISION (type
) = precision
;
8210 fixup_signed_type (type
);
8212 if (precision
<= MAX_INT_CACHED_PREC
)
8213 nonstandard_boolean_type_cache
[precision
] = type
;
8218 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8219 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8220 is true, reuse such a type that has already been constructed. */
8223 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8225 tree itype
= make_node (INTEGER_TYPE
);
8226 inchash::hash hstate
;
8228 TREE_TYPE (itype
) = type
;
8230 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8231 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8233 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8234 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8235 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8236 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8237 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8238 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8243 if ((TYPE_MIN_VALUE (itype
)
8244 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8245 || (TYPE_MAX_VALUE (itype
)
8246 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8248 /* Since we cannot reliably merge this type, we need to compare it using
8249 structural equality checks. */
8250 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8254 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8255 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8256 hstate
.merge_hash (TYPE_HASH (type
));
8257 itype
= type_hash_canon (hstate
.end (), itype
);
8262 /* Wrapper around build_range_type_1 with SHARED set to true. */
8265 build_range_type (tree type
, tree lowval
, tree highval
)
8267 return build_range_type_1 (type
, lowval
, highval
, true);
8270 /* Wrapper around build_range_type_1 with SHARED set to false. */
8273 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8275 return build_range_type_1 (type
, lowval
, highval
, false);
8278 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8279 MAXVAL should be the maximum value in the domain
8280 (one less than the length of the array).
8282 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8283 We don't enforce this limit, that is up to caller (e.g. language front end).
8284 The limit exists because the result is a signed type and we don't handle
8285 sizes that use more than one HOST_WIDE_INT. */
8288 build_index_type (tree maxval
)
8290 return build_range_type (sizetype
, size_zero_node
, maxval
);
8293 /* Return true if the debug information for TYPE, a subtype, should be emitted
8294 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8295 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8296 debug info and doesn't reflect the source code. */
8299 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8301 tree base_type
= TREE_TYPE (type
), low
, high
;
8303 /* Subrange types have a base type which is an integral type. */
8304 if (!INTEGRAL_TYPE_P (base_type
))
8307 /* Get the real bounds of the subtype. */
8308 if (lang_hooks
.types
.get_subrange_bounds
)
8309 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8312 low
= TYPE_MIN_VALUE (type
);
8313 high
= TYPE_MAX_VALUE (type
);
8316 /* If the type and its base type have the same representation and the same
8317 name, then the type is not a subrange but a copy of the base type. */
8318 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8319 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8320 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8321 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8322 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8323 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8333 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8334 and number of elements specified by the range of values of INDEX_TYPE.
8335 If SHARED is true, reuse such a type that has already been constructed. */
8338 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8342 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8344 error ("arrays of functions are not meaningful");
8345 elt_type
= integer_type_node
;
8348 t
= make_node (ARRAY_TYPE
);
8349 TREE_TYPE (t
) = elt_type
;
8350 TYPE_DOMAIN (t
) = index_type
;
8351 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8354 /* If the element type is incomplete at this point we get marked for
8355 structural equality. Do not record these types in the canonical
8357 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8362 inchash::hash hstate
;
8363 hstate
.add_object (TYPE_HASH (elt_type
));
8365 hstate
.add_object (TYPE_HASH (index_type
));
8366 t
= type_hash_canon (hstate
.end (), t
);
8369 if (TYPE_CANONICAL (t
) == t
)
8371 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8372 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8374 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8375 else if (TYPE_CANONICAL (elt_type
) != elt_type
8376 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8378 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8380 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8387 /* Wrapper around build_array_type_1 with SHARED set to true. */
8390 build_array_type (tree elt_type
, tree index_type
)
8392 return build_array_type_1 (elt_type
, index_type
, true);
8395 /* Wrapper around build_array_type_1 with SHARED set to false. */
8398 build_nonshared_array_type (tree elt_type
, tree index_type
)
8400 return build_array_type_1 (elt_type
, index_type
, false);
8403 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8407 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8409 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8412 /* Recursively examines the array elements of TYPE, until a non-array
8413 element type is found. */
8416 strip_array_types (tree type
)
8418 while (TREE_CODE (type
) == ARRAY_TYPE
)
8419 type
= TREE_TYPE (type
);
8424 /* Computes the canonical argument types from the argument type list
8427 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8428 on entry to this function, or if any of the ARGTYPES are
8431 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8432 true on entry to this function, or if any of the ARGTYPES are
8435 Returns a canonical argument list, which may be ARGTYPES when the
8436 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8437 true) or would not differ from ARGTYPES. */
8440 maybe_canonicalize_argtypes (tree argtypes
,
8441 bool *any_structural_p
,
8442 bool *any_noncanonical_p
)
8445 bool any_noncanonical_argtypes_p
= false;
8447 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8449 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8450 /* Fail gracefully by stating that the type is structural. */
8451 *any_structural_p
= true;
8452 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8453 *any_structural_p
= true;
8454 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8455 || TREE_PURPOSE (arg
))
8456 /* If the argument has a default argument, we consider it
8457 non-canonical even though the type itself is canonical.
8458 That way, different variants of function and method types
8459 with default arguments will all point to the variant with
8460 no defaults as their canonical type. */
8461 any_noncanonical_argtypes_p
= true;
8464 if (*any_structural_p
)
8467 if (any_noncanonical_argtypes_p
)
8469 /* Build the canonical list of argument types. */
8470 tree canon_argtypes
= NULL_TREE
;
8471 bool is_void
= false;
8473 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8475 if (arg
== void_list_node
)
8478 canon_argtypes
= tree_cons (NULL_TREE
,
8479 TYPE_CANONICAL (TREE_VALUE (arg
)),
8483 canon_argtypes
= nreverse (canon_argtypes
);
8485 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8487 /* There is a non-canonical type. */
8488 *any_noncanonical_p
= true;
8489 return canon_argtypes
;
8492 /* The canonical argument types are the same as ARGTYPES. */
8496 /* Construct, lay out and return
8497 the type of functions returning type VALUE_TYPE
8498 given arguments of types ARG_TYPES.
8499 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8500 are data type nodes for the arguments of the function.
8501 If such a type has already been constructed, reuse it. */
8504 build_function_type (tree value_type
, tree arg_types
)
8507 inchash::hash hstate
;
8508 bool any_structural_p
, any_noncanonical_p
;
8509 tree canon_argtypes
;
8511 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8513 error ("function return type cannot be function");
8514 value_type
= integer_type_node
;
8517 /* Make a node of the sort we want. */
8518 t
= make_node (FUNCTION_TYPE
);
8519 TREE_TYPE (t
) = value_type
;
8520 TYPE_ARG_TYPES (t
) = arg_types
;
8522 /* If we already have such a type, use the old one. */
8523 hstate
.add_object (TYPE_HASH (value_type
));
8524 type_hash_list (arg_types
, hstate
);
8525 t
= type_hash_canon (hstate
.end (), t
);
8527 /* Set up the canonical type. */
8528 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8529 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8530 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8532 &any_noncanonical_p
);
8533 if (any_structural_p
)
8534 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8535 else if (any_noncanonical_p
)
8536 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8539 if (!COMPLETE_TYPE_P (t
))
8544 /* Build a function type. The RETURN_TYPE is the type returned by the
8545 function. If VAARGS is set, no void_type_node is appended to the
8546 list. ARGP must be always be terminated be a NULL_TREE. */
8549 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8553 t
= va_arg (argp
, tree
);
8554 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8555 args
= tree_cons (NULL_TREE
, t
, args
);
8560 if (args
!= NULL_TREE
)
8561 args
= nreverse (args
);
8562 gcc_assert (last
!= void_list_node
);
8564 else if (args
== NULL_TREE
)
8565 args
= void_list_node
;
8569 args
= nreverse (args
);
8570 TREE_CHAIN (last
) = void_list_node
;
8572 args
= build_function_type (return_type
, args
);
8577 /* Build a function type. The RETURN_TYPE is the type returned by the
8578 function. If additional arguments are provided, they are
8579 additional argument types. The list of argument types must always
8580 be terminated by NULL_TREE. */
8583 build_function_type_list (tree return_type
, ...)
8588 va_start (p
, return_type
);
8589 args
= build_function_type_list_1 (false, return_type
, p
);
8594 /* Build a variable argument function type. The RETURN_TYPE is the
8595 type returned by the function. If additional arguments are provided,
8596 they are additional argument types. The list of argument types must
8597 always be terminated by NULL_TREE. */
8600 build_varargs_function_type_list (tree return_type
, ...)
8605 va_start (p
, return_type
);
8606 args
= build_function_type_list_1 (true, return_type
, p
);
8612 /* Build a function type. RETURN_TYPE is the type returned by the
8613 function; VAARGS indicates whether the function takes varargs. The
8614 function takes N named arguments, the types of which are provided in
8618 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8622 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8624 for (i
= n
- 1; i
>= 0; i
--)
8625 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8627 return build_function_type (return_type
, t
);
8630 /* Build a function type. RETURN_TYPE is the type returned by the
8631 function. The function takes N named arguments, the types of which
8632 are provided in ARG_TYPES. */
8635 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8637 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8640 /* Build a variable argument function type. RETURN_TYPE is the type
8641 returned by the function. The function takes N named arguments, the
8642 types of which are provided in ARG_TYPES. */
8645 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8647 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8650 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8651 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8652 for the method. An implicit additional parameter (of type
8653 pointer-to-BASETYPE) is added to the ARGTYPES. */
8656 build_method_type_directly (tree basetype
,
8662 inchash::hash hstate
;
8663 bool any_structural_p
, any_noncanonical_p
;
8664 tree canon_argtypes
;
8666 /* Make a node of the sort we want. */
8667 t
= make_node (METHOD_TYPE
);
8669 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8670 TREE_TYPE (t
) = rettype
;
8671 ptype
= build_pointer_type (basetype
);
8673 /* The actual arglist for this function includes a "hidden" argument
8674 which is "this". Put it into the list of argument types. */
8675 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8676 TYPE_ARG_TYPES (t
) = argtypes
;
8678 /* If we already have such a type, use the old one. */
8679 hstate
.add_object (TYPE_HASH (basetype
));
8680 hstate
.add_object (TYPE_HASH (rettype
));
8681 type_hash_list (argtypes
, hstate
);
8682 t
= type_hash_canon (hstate
.end (), t
);
8684 /* Set up the canonical type. */
8686 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8687 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8689 = (TYPE_CANONICAL (basetype
) != basetype
8690 || TYPE_CANONICAL (rettype
) != rettype
);
8691 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8693 &any_noncanonical_p
);
8694 if (any_structural_p
)
8695 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8696 else if (any_noncanonical_p
)
8698 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8699 TYPE_CANONICAL (rettype
),
8701 if (!COMPLETE_TYPE_P (t
))
8707 /* Construct, lay out and return the type of methods belonging to class
8708 BASETYPE and whose arguments and values are described by TYPE.
8709 If that type exists already, reuse it.
8710 TYPE must be a FUNCTION_TYPE node. */
8713 build_method_type (tree basetype
, tree type
)
8715 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8717 return build_method_type_directly (basetype
,
8719 TYPE_ARG_TYPES (type
));
8722 /* Construct, lay out and return the type of offsets to a value
8723 of type TYPE, within an object of type BASETYPE.
8724 If a suitable offset type exists already, reuse it. */
8727 build_offset_type (tree basetype
, tree type
)
8730 inchash::hash hstate
;
8732 /* Make a node of the sort we want. */
8733 t
= make_node (OFFSET_TYPE
);
8735 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8736 TREE_TYPE (t
) = type
;
8738 /* If we already have such a type, use the old one. */
8739 hstate
.add_object (TYPE_HASH (basetype
));
8740 hstate
.add_object (TYPE_HASH (type
));
8741 t
= type_hash_canon (hstate
.end (), t
);
8743 if (!COMPLETE_TYPE_P (t
))
8746 if (TYPE_CANONICAL (t
) == t
)
8748 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8749 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8750 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8751 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8752 || TYPE_CANONICAL (type
) != type
)
8754 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8755 TYPE_CANONICAL (type
));
8761 /* Create a complex type whose components are COMPONENT_TYPE. */
8764 build_complex_type (tree component_type
)
8767 inchash::hash hstate
;
8769 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8770 || SCALAR_FLOAT_TYPE_P (component_type
)
8771 || FIXED_POINT_TYPE_P (component_type
));
8773 /* Make a node of the sort we want. */
8774 t
= make_node (COMPLEX_TYPE
);
8776 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8778 /* If we already have such a type, use the old one. */
8779 hstate
.add_object (TYPE_HASH (component_type
));
8780 t
= type_hash_canon (hstate
.end (), t
);
8782 if (!COMPLETE_TYPE_P (t
))
8785 if (TYPE_CANONICAL (t
) == t
)
8787 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8788 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8789 else if (TYPE_CANONICAL (component_type
) != component_type
)
8791 = build_complex_type (TYPE_CANONICAL (component_type
));
8794 /* We need to create a name, since complex is a fundamental type. */
8795 if (! TYPE_NAME (t
))
8798 if (component_type
== char_type_node
)
8799 name
= "complex char";
8800 else if (component_type
== signed_char_type_node
)
8801 name
= "complex signed char";
8802 else if (component_type
== unsigned_char_type_node
)
8803 name
= "complex unsigned char";
8804 else if (component_type
== short_integer_type_node
)
8805 name
= "complex short int";
8806 else if (component_type
== short_unsigned_type_node
)
8807 name
= "complex short unsigned int";
8808 else if (component_type
== integer_type_node
)
8809 name
= "complex int";
8810 else if (component_type
== unsigned_type_node
)
8811 name
= "complex unsigned int";
8812 else if (component_type
== long_integer_type_node
)
8813 name
= "complex long int";
8814 else if (component_type
== long_unsigned_type_node
)
8815 name
= "complex long unsigned int";
8816 else if (component_type
== long_long_integer_type_node
)
8817 name
= "complex long long int";
8818 else if (component_type
== long_long_unsigned_type_node
)
8819 name
= "complex long long unsigned int";
8824 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8825 get_identifier (name
), t
);
8828 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8831 /* If TYPE is a real or complex floating-point type and the target
8832 does not directly support arithmetic on TYPE then return the wider
8833 type to be used for arithmetic on TYPE. Otherwise, return
8837 excess_precision_type (tree type
)
8839 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8841 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8842 switch (TREE_CODE (type
))
8845 switch (flt_eval_method
)
8848 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8849 return double_type_node
;
8852 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8853 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8854 return long_double_type_node
;
8861 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8863 switch (flt_eval_method
)
8866 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8867 return complex_double_type_node
;
8870 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8871 || (TYPE_MODE (TREE_TYPE (type
))
8872 == TYPE_MODE (double_type_node
)))
8873 return complex_long_double_type_node
;
8886 /* Return OP, stripped of any conversions to wider types as much as is safe.
8887 Converting the value back to OP's type makes a value equivalent to OP.
8889 If FOR_TYPE is nonzero, we return a value which, if converted to
8890 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8892 OP must have integer, real or enumeral type. Pointers are not allowed!
8894 There are some cases where the obvious value we could return
8895 would regenerate to OP if converted to OP's type,
8896 but would not extend like OP to wider types.
8897 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8898 For example, if OP is (unsigned short)(signed char)-1,
8899 we avoid returning (signed char)-1 if FOR_TYPE is int,
8900 even though extending that to an unsigned short would regenerate OP,
8901 since the result of extending (signed char)-1 to (int)
8902 is different from (int) OP. */
8905 get_unwidened (tree op
, tree for_type
)
8907 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8908 tree type
= TREE_TYPE (op
);
8910 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8912 = (for_type
!= 0 && for_type
!= type
8913 && final_prec
> TYPE_PRECISION (type
)
8914 && TYPE_UNSIGNED (type
));
8917 while (CONVERT_EXPR_P (op
))
8921 /* TYPE_PRECISION on vector types has different meaning
8922 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8923 so avoid them here. */
8924 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8927 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8928 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8930 /* Truncations are many-one so cannot be removed.
8931 Unless we are later going to truncate down even farther. */
8933 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8936 /* See what's inside this conversion. If we decide to strip it,
8938 op
= TREE_OPERAND (op
, 0);
8940 /* If we have not stripped any zero-extensions (uns is 0),
8941 we can strip any kind of extension.
8942 If we have previously stripped a zero-extension,
8943 only zero-extensions can safely be stripped.
8944 Any extension can be stripped if the bits it would produce
8945 are all going to be discarded later by truncating to FOR_TYPE. */
8949 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8951 /* TYPE_UNSIGNED says whether this is a zero-extension.
8952 Let's avoid computing it if it does not affect WIN
8953 and if UNS will not be needed again. */
8955 || CONVERT_EXPR_P (op
))
8956 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8964 /* If we finally reach a constant see if it fits in for_type and
8965 in that case convert it. */
8967 && TREE_CODE (win
) == INTEGER_CST
8968 && TREE_TYPE (win
) != for_type
8969 && int_fits_type_p (win
, for_type
))
8970 win
= fold_convert (for_type
, win
);
8975 /* Return OP or a simpler expression for a narrower value
8976 which can be sign-extended or zero-extended to give back OP.
8977 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8978 or 0 if the value should be sign-extended. */
8981 get_narrower (tree op
, int *unsignedp_ptr
)
8986 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8988 while (TREE_CODE (op
) == NOP_EXPR
)
8991 = (TYPE_PRECISION (TREE_TYPE (op
))
8992 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8994 /* Truncations are many-one so cannot be removed. */
8998 /* See what's inside this conversion. If we decide to strip it,
9003 op
= TREE_OPERAND (op
, 0);
9004 /* An extension: the outermost one can be stripped,
9005 but remember whether it is zero or sign extension. */
9007 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9008 /* Otherwise, if a sign extension has been stripped,
9009 only sign extensions can now be stripped;
9010 if a zero extension has been stripped, only zero-extensions. */
9011 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9015 else /* bitschange == 0 */
9017 /* A change in nominal type can always be stripped, but we must
9018 preserve the unsignedness. */
9020 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9022 op
= TREE_OPERAND (op
, 0);
9023 /* Keep trying to narrow, but don't assign op to win if it
9024 would turn an integral type into something else. */
9025 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9032 if (TREE_CODE (op
) == COMPONENT_REF
9033 /* Since type_for_size always gives an integer type. */
9034 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9035 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9036 /* Ensure field is laid out already. */
9037 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9038 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9040 unsigned HOST_WIDE_INT innerprec
9041 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9042 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9043 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9044 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9046 /* We can get this structure field in a narrower type that fits it,
9047 but the resulting extension to its nominal type (a fullword type)
9048 must satisfy the same conditions as for other extensions.
9050 Do this only for fields that are aligned (not bit-fields),
9051 because when bit-field insns will be used there is no
9052 advantage in doing this. */
9054 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9055 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9056 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9060 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9061 win
= fold_convert (type
, op
);
9065 *unsignedp_ptr
= uns
;
9069 /* Returns true if integer constant C has a value that is permissible
9070 for type TYPE (an INTEGER_TYPE). */
9073 int_fits_type_p (const_tree c
, const_tree type
)
9075 tree type_low_bound
, type_high_bound
;
9076 bool ok_for_low_bound
, ok_for_high_bound
;
9077 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9080 type_low_bound
= TYPE_MIN_VALUE (type
);
9081 type_high_bound
= TYPE_MAX_VALUE (type
);
9083 /* If at least one bound of the type is a constant integer, we can check
9084 ourselves and maybe make a decision. If no such decision is possible, but
9085 this type is a subtype, try checking against that. Otherwise, use
9086 fits_to_tree_p, which checks against the precision.
9088 Compute the status for each possibly constant bound, and return if we see
9089 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9090 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9091 for "constant known to fit". */
9093 /* Check if c >= type_low_bound. */
9094 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9096 if (tree_int_cst_lt (c
, type_low_bound
))
9098 ok_for_low_bound
= true;
9101 ok_for_low_bound
= false;
9103 /* Check if c <= type_high_bound. */
9104 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9106 if (tree_int_cst_lt (type_high_bound
, c
))
9108 ok_for_high_bound
= true;
9111 ok_for_high_bound
= false;
9113 /* If the constant fits both bounds, the result is known. */
9114 if (ok_for_low_bound
&& ok_for_high_bound
)
9117 /* Perform some generic filtering which may allow making a decision
9118 even if the bounds are not constant. First, negative integers
9119 never fit in unsigned types, */
9120 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9123 /* Second, narrower types always fit in wider ones. */
9124 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9127 /* Third, unsigned integers with top bit set never fit signed types. */
9128 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9130 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9131 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9133 /* When a tree_cst is converted to a wide-int, the precision
9134 is taken from the type. However, if the precision of the
9135 mode underneath the type is smaller than that, it is
9136 possible that the value will not fit. The test below
9137 fails if any bit is set between the sign bit of the
9138 underlying mode and the top bit of the type. */
9139 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9142 else if (wi::neg_p (c
))
9146 /* If we haven't been able to decide at this point, there nothing more we
9147 can check ourselves here. Look at the base type if we have one and it
9148 has the same precision. */
9149 if (TREE_CODE (type
) == INTEGER_TYPE
9150 && TREE_TYPE (type
) != 0
9151 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9153 type
= TREE_TYPE (type
);
9157 /* Or to fits_to_tree_p, if nothing else. */
9158 return wi::fits_to_tree_p (c
, type
);
9161 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9162 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9163 represented (assuming two's-complement arithmetic) within the bit
9164 precision of the type are returned instead. */
9167 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9169 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9170 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9171 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9174 if (TYPE_UNSIGNED (type
))
9175 mpz_set_ui (min
, 0);
9178 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9179 wi::to_mpz (mn
, min
, SIGNED
);
9183 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9184 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9185 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9188 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9189 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9193 /* Return true if VAR is an automatic variable defined in function FN. */
9196 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9198 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9199 && ((((TREE_CODE (var
) == VAR_DECL
&& ! DECL_EXTERNAL (var
))
9200 || TREE_CODE (var
) == PARM_DECL
)
9201 && ! TREE_STATIC (var
))
9202 || TREE_CODE (var
) == LABEL_DECL
9203 || TREE_CODE (var
) == RESULT_DECL
));
9206 /* Subprogram of following function. Called by walk_tree.
9208 Return *TP if it is an automatic variable or parameter of the
9209 function passed in as DATA. */
9212 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9214 tree fn
= (tree
) data
;
9219 else if (DECL_P (*tp
)
9220 && auto_var_in_fn_p (*tp
, fn
))
9226 /* Returns true if T is, contains, or refers to a type with variable
9227 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9228 arguments, but not the return type. If FN is nonzero, only return
9229 true if a modifier of the type or position of FN is a variable or
9230 parameter inside FN.
9232 This concept is more general than that of C99 'variably modified types':
9233 in C99, a struct type is never variably modified because a VLA may not
9234 appear as a structure member. However, in GNU C code like:
9236 struct S { int i[f()]; };
9238 is valid, and other languages may define similar constructs. */
9241 variably_modified_type_p (tree type
, tree fn
)
9245 /* Test if T is either variable (if FN is zero) or an expression containing
9246 a variable in FN. If TYPE isn't gimplified, return true also if
9247 gimplify_one_sizepos would gimplify the expression into a local
9249 #define RETURN_TRUE_IF_VAR(T) \
9250 do { tree _t = (T); \
9251 if (_t != NULL_TREE \
9252 && _t != error_mark_node \
9253 && TREE_CODE (_t) != INTEGER_CST \
9254 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9256 || (!TYPE_SIZES_GIMPLIFIED (type) \
9257 && !is_gimple_sizepos (_t)) \
9258 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9259 return true; } while (0)
9261 if (type
== error_mark_node
)
9264 /* If TYPE itself has variable size, it is variably modified. */
9265 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9266 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9268 switch (TREE_CODE (type
))
9271 case REFERENCE_TYPE
:
9273 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9279 /* If TYPE is a function type, it is variably modified if the
9280 return type is variably modified. */
9281 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9287 case FIXED_POINT_TYPE
:
9290 /* Scalar types are variably modified if their end points
9292 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9293 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9298 case QUAL_UNION_TYPE
:
9299 /* We can't see if any of the fields are variably-modified by the
9300 definition we normally use, since that would produce infinite
9301 recursion via pointers. */
9302 /* This is variably modified if some field's type is. */
9303 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9304 if (TREE_CODE (t
) == FIELD_DECL
)
9306 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9307 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9308 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9310 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9311 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9316 /* Do not call ourselves to avoid infinite recursion. This is
9317 variably modified if the element type is. */
9318 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9319 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9326 /* The current language may have other cases to check, but in general,
9327 all other types are not variably modified. */
9328 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9330 #undef RETURN_TRUE_IF_VAR
9333 /* Given a DECL or TYPE, return the scope in which it was declared, or
9334 NULL_TREE if there is no containing scope. */
9337 get_containing_scope (const_tree t
)
9339 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9342 /* Return the innermost context enclosing DECL that is
9343 a FUNCTION_DECL, or zero if none. */
9346 decl_function_context (const_tree decl
)
9350 if (TREE_CODE (decl
) == ERROR_MARK
)
9353 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9354 where we look up the function at runtime. Such functions always take
9355 a first argument of type 'pointer to real context'.
9357 C++ should really be fixed to use DECL_CONTEXT for the real context,
9358 and use something else for the "virtual context". */
9359 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9362 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9364 context
= DECL_CONTEXT (decl
);
9366 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9368 if (TREE_CODE (context
) == BLOCK
)
9369 context
= BLOCK_SUPERCONTEXT (context
);
9371 context
= get_containing_scope (context
);
9377 /* Return the innermost context enclosing DECL that is
9378 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9379 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9382 decl_type_context (const_tree decl
)
9384 tree context
= DECL_CONTEXT (decl
);
9387 switch (TREE_CODE (context
))
9389 case NAMESPACE_DECL
:
9390 case TRANSLATION_UNIT_DECL
:
9395 case QUAL_UNION_TYPE
:
9400 context
= DECL_CONTEXT (context
);
9404 context
= BLOCK_SUPERCONTEXT (context
);
9414 /* CALL is a CALL_EXPR. Return the declaration for the function
9415 called, or NULL_TREE if the called function cannot be
9419 get_callee_fndecl (const_tree call
)
9423 if (call
== error_mark_node
)
9424 return error_mark_node
;
9426 /* It's invalid to call this function with anything but a
9428 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9430 /* The first operand to the CALL is the address of the function
9432 addr
= CALL_EXPR_FN (call
);
9434 /* If there is no function, return early. */
9435 if (addr
== NULL_TREE
)
9440 /* If this is a readonly function pointer, extract its initial value. */
9441 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9442 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9443 && DECL_INITIAL (addr
))
9444 addr
= DECL_INITIAL (addr
);
9446 /* If the address is just `&f' for some function `f', then we know
9447 that `f' is being called. */
9448 if (TREE_CODE (addr
) == ADDR_EXPR
9449 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9450 return TREE_OPERAND (addr
, 0);
9452 /* We couldn't figure out what was being called. */
9456 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9457 return the associated function code, otherwise return CFN_LAST. */
9460 get_call_combined_fn (const_tree call
)
9462 /* It's invalid to call this function with anything but a CALL_EXPR. */
9463 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9465 if (!CALL_EXPR_FN (call
))
9466 return as_combined_fn (CALL_EXPR_IFN (call
));
9468 tree fndecl
= get_callee_fndecl (call
);
9469 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9470 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9475 #define TREE_MEM_USAGE_SPACES 40
9477 /* Print debugging information about tree nodes generated during the compile,
9478 and any language-specific information. */
9481 dump_tree_statistics (void)
9483 if (GATHER_STATISTICS
)
9486 int total_nodes
, total_bytes
;
9487 fprintf (stderr
, "\nKind Nodes Bytes\n");
9488 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9489 total_nodes
= total_bytes
= 0;
9490 for (i
= 0; i
< (int) all_kinds
; i
++)
9492 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9493 tree_node_counts
[i
], tree_node_sizes
[i
]);
9494 total_nodes
+= tree_node_counts
[i
];
9495 total_bytes
+= tree_node_sizes
[i
];
9497 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9498 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9499 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9500 fprintf (stderr
, "Code Nodes\n");
9501 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9502 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9503 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9504 tree_code_counts
[i
]);
9505 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9506 fprintf (stderr
, "\n");
9507 ssanames_print_statistics ();
9508 fprintf (stderr
, "\n");
9509 phinodes_print_statistics ();
9510 fprintf (stderr
, "\n");
9513 fprintf (stderr
, "(No per-node statistics)\n");
9515 print_type_hash_statistics ();
9516 print_debug_expr_statistics ();
9517 print_value_expr_statistics ();
9518 lang_hooks
.print_statistics ();
9521 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9523 /* Generate a crc32 of a byte. */
9526 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9530 for (ix
= bits
; ix
--; value
<<= 1)
9534 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9541 /* Generate a crc32 of a 32-bit unsigned. */
9544 crc32_unsigned (unsigned chksum
, unsigned value
)
9546 return crc32_unsigned_bits (chksum
, value
, 32);
9549 /* Generate a crc32 of a byte. */
9552 crc32_byte (unsigned chksum
, char byte
)
9554 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9557 /* Generate a crc32 of a string. */
9560 crc32_string (unsigned chksum
, const char *string
)
9564 chksum
= crc32_byte (chksum
, *string
);
9570 /* P is a string that will be used in a symbol. Mask out any characters
9571 that are not valid in that context. */
9574 clean_symbol_name (char *p
)
9578 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9581 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9588 /* For anonymous aggregate types, we need some sort of name to
9589 hold on to. In practice, this should not appear, but it should
9590 not be harmful if it does. */
9592 anon_aggrname_p(const_tree id_node
)
9594 #ifndef NO_DOT_IN_LABEL
9595 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9596 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9597 #else /* NO_DOT_IN_LABEL */
9598 #ifndef NO_DOLLAR_IN_LABEL
9599 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9600 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9601 #else /* NO_DOLLAR_IN_LABEL */
9602 #define ANON_AGGRNAME_PREFIX "__anon_"
9603 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9604 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9605 #endif /* NO_DOLLAR_IN_LABEL */
9606 #endif /* NO_DOT_IN_LABEL */
9609 /* Return a format for an anonymous aggregate name. */
9611 anon_aggrname_format()
9613 #ifndef NO_DOT_IN_LABEL
9615 #else /* NO_DOT_IN_LABEL */
9616 #ifndef NO_DOLLAR_IN_LABEL
9618 #else /* NO_DOLLAR_IN_LABEL */
9620 #endif /* NO_DOLLAR_IN_LABEL */
9621 #endif /* NO_DOT_IN_LABEL */
9624 /* Generate a name for a special-purpose function.
9625 The generated name may need to be unique across the whole link.
9626 Changes to this function may also require corresponding changes to
9627 xstrdup_mask_random.
9628 TYPE is some string to identify the purpose of this function to the
9629 linker or collect2; it must start with an uppercase letter,
9631 I - for constructors
9633 N - for C++ anonymous namespaces
9634 F - for DWARF unwind frame information. */
9637 get_file_function_name (const char *type
)
9643 /* If we already have a name we know to be unique, just use that. */
9644 if (first_global_object_name
)
9645 p
= q
= ASTRDUP (first_global_object_name
);
9646 /* If the target is handling the constructors/destructors, they
9647 will be local to this file and the name is only necessary for
9649 We also assign sub_I and sub_D sufixes to constructors called from
9650 the global static constructors. These are always local. */
9651 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9652 || (strncmp (type
, "sub_", 4) == 0
9653 && (type
[4] == 'I' || type
[4] == 'D')))
9655 const char *file
= main_input_filename
;
9657 file
= LOCATION_FILE (input_location
);
9658 /* Just use the file's basename, because the full pathname
9659 might be quite long. */
9660 p
= q
= ASTRDUP (lbasename (file
));
9664 /* Otherwise, the name must be unique across the entire link.
9665 We don't have anything that we know to be unique to this translation
9666 unit, so use what we do have and throw in some randomness. */
9668 const char *name
= weak_global_object_name
;
9669 const char *file
= main_input_filename
;
9674 file
= LOCATION_FILE (input_location
);
9676 len
= strlen (file
);
9677 q
= (char *) alloca (9 + 17 + len
+ 1);
9678 memcpy (q
, file
, len
+ 1);
9680 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9681 crc32_string (0, name
), get_random_seed (false));
9686 clean_symbol_name (q
);
9687 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9690 /* Set up the name of the file-level functions we may need.
9691 Use a global object (which is already required to be unique over
9692 the program) rather than the file name (which imposes extra
9694 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9696 return get_identifier (buf
);
9699 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9701 /* Complain that the tree code of NODE does not match the expected 0
9702 terminated list of trailing codes. The trailing code list can be
9703 empty, for a more vague error message. FILE, LINE, and FUNCTION
9704 are of the caller. */
9707 tree_check_failed (const_tree node
, const char *file
,
9708 int line
, const char *function
, ...)
9712 unsigned length
= 0;
9713 enum tree_code code
;
9715 va_start (args
, function
);
9716 while ((code
= (enum tree_code
) va_arg (args
, int)))
9717 length
+= 4 + strlen (get_tree_code_name (code
));
9722 va_start (args
, function
);
9723 length
+= strlen ("expected ");
9724 buffer
= tmp
= (char *) alloca (length
);
9726 while ((code
= (enum tree_code
) va_arg (args
, int)))
9728 const char *prefix
= length
? " or " : "expected ";
9730 strcpy (tmp
+ length
, prefix
);
9731 length
+= strlen (prefix
);
9732 strcpy (tmp
+ length
, get_tree_code_name (code
));
9733 length
+= strlen (get_tree_code_name (code
));
9738 buffer
= "unexpected node";
9740 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9741 buffer
, get_tree_code_name (TREE_CODE (node
)),
9742 function
, trim_filename (file
), line
);
9745 /* Complain that the tree code of NODE does match the expected 0
9746 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9750 tree_not_check_failed (const_tree node
, const char *file
,
9751 int line
, const char *function
, ...)
9755 unsigned length
= 0;
9756 enum tree_code code
;
9758 va_start (args
, function
);
9759 while ((code
= (enum tree_code
) va_arg (args
, int)))
9760 length
+= 4 + strlen (get_tree_code_name (code
));
9762 va_start (args
, function
);
9763 buffer
= (char *) alloca (length
);
9765 while ((code
= (enum tree_code
) va_arg (args
, int)))
9769 strcpy (buffer
+ length
, " or ");
9772 strcpy (buffer
+ length
, get_tree_code_name (code
));
9773 length
+= strlen (get_tree_code_name (code
));
9777 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9778 buffer
, get_tree_code_name (TREE_CODE (node
)),
9779 function
, trim_filename (file
), line
);
9782 /* Similar to tree_check_failed, except that we check for a class of tree
9783 code, given in CL. */
9786 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9787 const char *file
, int line
, const char *function
)
9790 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9791 TREE_CODE_CLASS_STRING (cl
),
9792 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9793 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9796 /* Similar to tree_check_failed, except that instead of specifying a
9797 dozen codes, use the knowledge that they're all sequential. */
9800 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9801 const char *function
, enum tree_code c1
,
9805 unsigned length
= 0;
9808 for (c
= c1
; c
<= c2
; ++c
)
9809 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9811 length
+= strlen ("expected ");
9812 buffer
= (char *) alloca (length
);
9815 for (c
= c1
; c
<= c2
; ++c
)
9817 const char *prefix
= length
? " or " : "expected ";
9819 strcpy (buffer
+ length
, prefix
);
9820 length
+= strlen (prefix
);
9821 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9822 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9825 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9826 buffer
, get_tree_code_name (TREE_CODE (node
)),
9827 function
, trim_filename (file
), line
);
9831 /* Similar to tree_check_failed, except that we check that a tree does
9832 not have the specified code, given in CL. */
9835 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9836 const char *file
, int line
, const char *function
)
9839 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9840 TREE_CODE_CLASS_STRING (cl
),
9841 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9842 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9846 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9849 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9850 const char *function
, enum omp_clause_code code
)
9852 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9853 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9854 function
, trim_filename (file
), line
);
9858 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9861 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9862 const char *function
, enum omp_clause_code c1
,
9863 enum omp_clause_code c2
)
9866 unsigned length
= 0;
9869 for (c
= c1
; c
<= c2
; ++c
)
9870 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9872 length
+= strlen ("expected ");
9873 buffer
= (char *) alloca (length
);
9876 for (c
= c1
; c
<= c2
; ++c
)
9878 const char *prefix
= length
? " or " : "expected ";
9880 strcpy (buffer
+ length
, prefix
);
9881 length
+= strlen (prefix
);
9882 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9883 length
+= strlen (omp_clause_code_name
[c
]);
9886 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9887 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9888 function
, trim_filename (file
), line
);
9892 #undef DEFTREESTRUCT
9893 #define DEFTREESTRUCT(VAL, NAME) NAME,
9895 static const char *ts_enum_names
[] = {
9896 #include "treestruct.def"
9898 #undef DEFTREESTRUCT
9900 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9902 /* Similar to tree_class_check_failed, except that we check for
9903 whether CODE contains the tree structure identified by EN. */
9906 tree_contains_struct_check_failed (const_tree node
,
9907 const enum tree_node_structure_enum en
,
9908 const char *file
, int line
,
9909 const char *function
)
9912 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9914 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9918 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9919 (dynamically sized) vector. */
9922 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9923 const char *function
)
9926 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9927 idx
+ 1, len
, function
, trim_filename (file
), line
);
9930 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9931 (dynamically sized) vector. */
9934 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9935 const char *function
)
9938 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9939 idx
+ 1, len
, function
, trim_filename (file
), line
);
9942 /* Similar to above, except that the check is for the bounds of the operand
9943 vector of an expression node EXP. */
9946 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9947 int line
, const char *function
)
9949 enum tree_code code
= TREE_CODE (exp
);
9951 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9952 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9953 function
, trim_filename (file
), line
);
9956 /* Similar to above, except that the check is for the number of
9957 operands of an OMP_CLAUSE node. */
9960 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9961 int line
, const char *function
)
9964 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9965 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9966 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9967 trim_filename (file
), line
);
9969 #endif /* ENABLE_TREE_CHECKING */
9971 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9972 and mapped to the machine mode MODE. Initialize its fields and build
9973 the information necessary for debugging output. */
9976 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9979 inchash::hash hstate
;
9980 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9982 t
= make_node (VECTOR_TYPE
);
9983 TREE_TYPE (t
) = mv_innertype
;
9984 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9985 SET_TYPE_MODE (t
, mode
);
9987 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9988 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9989 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9990 || mode
!= VOIDmode
)
9991 && !VECTOR_BOOLEAN_TYPE_P (t
))
9993 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
9997 hstate
.add_wide_int (VECTOR_TYPE
);
9998 hstate
.add_wide_int (nunits
);
9999 hstate
.add_wide_int (mode
);
10000 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
10001 t
= type_hash_canon (hstate
.end (), t
);
10003 /* We have built a main variant, based on the main variant of the
10004 inner type. Use it to build the variant we return. */
10005 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10006 && TREE_TYPE (t
) != innertype
)
10007 return build_type_attribute_qual_variant (t
,
10008 TYPE_ATTRIBUTES (innertype
),
10009 TYPE_QUALS (innertype
));
10015 make_or_reuse_type (unsigned size
, int unsignedp
)
10019 if (size
== INT_TYPE_SIZE
)
10020 return unsignedp
? unsigned_type_node
: integer_type_node
;
10021 if (size
== CHAR_TYPE_SIZE
)
10022 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10023 if (size
== SHORT_TYPE_SIZE
)
10024 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10025 if (size
== LONG_TYPE_SIZE
)
10026 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10027 if (size
== LONG_LONG_TYPE_SIZE
)
10028 return (unsignedp
? long_long_unsigned_type_node
10029 : long_long_integer_type_node
);
10031 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10032 if (size
== int_n_data
[i
].bitsize
10033 && int_n_enabled_p
[i
])
10034 return (unsignedp
? int_n_trees
[i
].unsigned_type
10035 : int_n_trees
[i
].signed_type
);
10038 return make_unsigned_type (size
);
10040 return make_signed_type (size
);
10043 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10046 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10050 if (size
== SHORT_FRACT_TYPE_SIZE
)
10051 return unsignedp
? sat_unsigned_short_fract_type_node
10052 : sat_short_fract_type_node
;
10053 if (size
== FRACT_TYPE_SIZE
)
10054 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10055 if (size
== LONG_FRACT_TYPE_SIZE
)
10056 return unsignedp
? sat_unsigned_long_fract_type_node
10057 : sat_long_fract_type_node
;
10058 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10059 return unsignedp
? sat_unsigned_long_long_fract_type_node
10060 : sat_long_long_fract_type_node
;
10064 if (size
== SHORT_FRACT_TYPE_SIZE
)
10065 return unsignedp
? unsigned_short_fract_type_node
10066 : short_fract_type_node
;
10067 if (size
== FRACT_TYPE_SIZE
)
10068 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10069 if (size
== LONG_FRACT_TYPE_SIZE
)
10070 return unsignedp
? unsigned_long_fract_type_node
10071 : long_fract_type_node
;
10072 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10073 return unsignedp
? unsigned_long_long_fract_type_node
10074 : long_long_fract_type_node
;
10077 return make_fract_type (size
, unsignedp
, satp
);
10080 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10083 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10087 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10088 return unsignedp
? sat_unsigned_short_accum_type_node
10089 : sat_short_accum_type_node
;
10090 if (size
== ACCUM_TYPE_SIZE
)
10091 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10092 if (size
== LONG_ACCUM_TYPE_SIZE
)
10093 return unsignedp
? sat_unsigned_long_accum_type_node
10094 : sat_long_accum_type_node
;
10095 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10096 return unsignedp
? sat_unsigned_long_long_accum_type_node
10097 : sat_long_long_accum_type_node
;
10101 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10102 return unsignedp
? unsigned_short_accum_type_node
10103 : short_accum_type_node
;
10104 if (size
== ACCUM_TYPE_SIZE
)
10105 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10106 if (size
== LONG_ACCUM_TYPE_SIZE
)
10107 return unsignedp
? unsigned_long_accum_type_node
10108 : long_accum_type_node
;
10109 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10110 return unsignedp
? unsigned_long_long_accum_type_node
10111 : long_long_accum_type_node
;
10114 return make_accum_type (size
, unsignedp
, satp
);
10118 /* Create an atomic variant node for TYPE. This routine is called
10119 during initialization of data types to create the 5 basic atomic
10120 types. The generic build_variant_type function requires these to
10121 already be set up in order to function properly, so cannot be
10122 called from there. If ALIGN is non-zero, then ensure alignment is
10123 overridden to this value. */
10126 build_atomic_base (tree type
, unsigned int align
)
10130 /* Make sure its not already registered. */
10131 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10134 t
= build_variant_type_copy (type
);
10135 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10138 SET_TYPE_ALIGN (t
, align
);
10143 /* Information about the _FloatN and _FloatNx types. This must be in
10144 the same order as the corresponding TI_* enum values. */
10145 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10157 /* Create nodes for all integer types (and error_mark_node) using the sizes
10158 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10161 build_common_tree_nodes (bool signed_char
)
10165 error_mark_node
= make_node (ERROR_MARK
);
10166 TREE_TYPE (error_mark_node
) = error_mark_node
;
10168 initialize_sizetypes ();
10170 /* Define both `signed char' and `unsigned char'. */
10171 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10172 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10173 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10174 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10176 /* Define `char', which is like either `signed char' or `unsigned char'
10177 but not the same as either. */
10180 ? make_signed_type (CHAR_TYPE_SIZE
)
10181 : make_unsigned_type (CHAR_TYPE_SIZE
));
10182 TYPE_STRING_FLAG (char_type_node
) = 1;
10184 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10185 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10186 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10187 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10188 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10189 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10190 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10191 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10193 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10195 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10196 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10197 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10198 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10200 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10201 && int_n_enabled_p
[i
])
10203 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10204 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10208 /* Define a boolean type. This type only represents boolean values but
10209 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10210 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10211 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10212 TYPE_PRECISION (boolean_type_node
) = 1;
10213 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10215 /* Define what type to use for size_t. */
10216 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10217 size_type_node
= unsigned_type_node
;
10218 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10219 size_type_node
= long_unsigned_type_node
;
10220 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10221 size_type_node
= long_long_unsigned_type_node
;
10222 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10223 size_type_node
= short_unsigned_type_node
;
10228 size_type_node
= NULL_TREE
;
10229 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10230 if (int_n_enabled_p
[i
])
10233 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10235 if (strcmp (name
, SIZE_TYPE
) == 0)
10237 size_type_node
= int_n_trees
[i
].unsigned_type
;
10240 if (size_type_node
== NULL_TREE
)
10241 gcc_unreachable ();
10244 /* Fill in the rest of the sized types. Reuse existing type nodes
10246 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10247 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10248 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10249 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10250 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10252 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10253 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10254 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10255 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10256 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10258 /* Don't call build_qualified type for atomics. That routine does
10259 special processing for atomics, and until they are initialized
10260 it's better not to make that call.
10262 Check to see if there is a target override for atomic types. */
10264 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10265 targetm
.atomic_align_for_mode (QImode
));
10266 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10267 targetm
.atomic_align_for_mode (HImode
));
10268 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10269 targetm
.atomic_align_for_mode (SImode
));
10270 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10271 targetm
.atomic_align_for_mode (DImode
));
10272 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10273 targetm
.atomic_align_for_mode (TImode
));
10275 access_public_node
= get_identifier ("public");
10276 access_protected_node
= get_identifier ("protected");
10277 access_private_node
= get_identifier ("private");
10279 /* Define these next since types below may used them. */
10280 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10281 integer_one_node
= build_int_cst (integer_type_node
, 1);
10282 integer_three_node
= build_int_cst (integer_type_node
, 3);
10283 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10285 size_zero_node
= size_int (0);
10286 size_one_node
= size_int (1);
10287 bitsize_zero_node
= bitsize_int (0);
10288 bitsize_one_node
= bitsize_int (1);
10289 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10291 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10292 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10294 void_type_node
= make_node (VOID_TYPE
);
10295 layout_type (void_type_node
);
10297 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10299 /* We are not going to have real types in C with less than byte alignment,
10300 so we might as well not have any types that claim to have it. */
10301 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10302 TYPE_USER_ALIGN (void_type_node
) = 0;
10304 void_node
= make_node (VOID_CST
);
10305 TREE_TYPE (void_node
) = void_type_node
;
10307 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10308 layout_type (TREE_TYPE (null_pointer_node
));
10310 ptr_type_node
= build_pointer_type (void_type_node
);
10311 const_ptr_type_node
10312 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10313 fileptr_type_node
= ptr_type_node
;
10315 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10317 float_type_node
= make_node (REAL_TYPE
);
10318 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10319 layout_type (float_type_node
);
10321 double_type_node
= make_node (REAL_TYPE
);
10322 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10323 layout_type (double_type_node
);
10325 long_double_type_node
= make_node (REAL_TYPE
);
10326 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10327 layout_type (long_double_type_node
);
10329 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10331 int n
= floatn_nx_types
[i
].n
;
10332 bool extended
= floatn_nx_types
[i
].extended
;
10333 machine_mode mode
= targetm
.floatn_mode (n
, extended
);
10334 if (mode
== VOIDmode
)
10336 int precision
= GET_MODE_PRECISION (mode
);
10337 /* Work around the rs6000 KFmode having precision 113 not
10339 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10340 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10341 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10343 gcc_assert (min_precision
== n
);
10344 if (precision
< min_precision
)
10345 precision
= min_precision
;
10346 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10347 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10348 layout_type (FLOATN_NX_TYPE_NODE (i
));
10349 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10352 float_ptr_type_node
= build_pointer_type (float_type_node
);
10353 double_ptr_type_node
= build_pointer_type (double_type_node
);
10354 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10355 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10357 /* Fixed size integer types. */
10358 uint16_type_node
= make_or_reuse_type (16, 1);
10359 uint32_type_node
= make_or_reuse_type (32, 1);
10360 uint64_type_node
= make_or_reuse_type (64, 1);
10362 /* Decimal float types. */
10363 dfloat32_type_node
= make_node (REAL_TYPE
);
10364 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10365 layout_type (dfloat32_type_node
);
10366 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10367 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10369 dfloat64_type_node
= make_node (REAL_TYPE
);
10370 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10371 layout_type (dfloat64_type_node
);
10372 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10373 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10375 dfloat128_type_node
= make_node (REAL_TYPE
);
10376 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10377 layout_type (dfloat128_type_node
);
10378 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10379 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10381 complex_integer_type_node
= build_complex_type (integer_type_node
);
10382 complex_float_type_node
= build_complex_type (float_type_node
);
10383 complex_double_type_node
= build_complex_type (double_type_node
);
10384 complex_long_double_type_node
= build_complex_type (long_double_type_node
);
10386 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10388 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10389 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10390 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10393 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10394 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10395 sat_ ## KIND ## _type_node = \
10396 make_sat_signed_ ## KIND ## _type (SIZE); \
10397 sat_unsigned_ ## KIND ## _type_node = \
10398 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10399 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10400 unsigned_ ## KIND ## _type_node = \
10401 make_unsigned_ ## KIND ## _type (SIZE);
10403 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10404 sat_ ## WIDTH ## KIND ## _type_node = \
10405 make_sat_signed_ ## KIND ## _type (SIZE); \
10406 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10407 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10408 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10409 unsigned_ ## WIDTH ## KIND ## _type_node = \
10410 make_unsigned_ ## KIND ## _type (SIZE);
10412 /* Make fixed-point type nodes based on four different widths. */
10413 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10414 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10415 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10416 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10417 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10419 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10420 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10421 NAME ## _type_node = \
10422 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10423 u ## NAME ## _type_node = \
10424 make_or_reuse_unsigned_ ## KIND ## _type \
10425 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10426 sat_ ## NAME ## _type_node = \
10427 make_or_reuse_sat_signed_ ## KIND ## _type \
10428 (GET_MODE_BITSIZE (MODE ## mode)); \
10429 sat_u ## NAME ## _type_node = \
10430 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10431 (GET_MODE_BITSIZE (U ## MODE ## mode));
10433 /* Fixed-point type and mode nodes. */
10434 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10435 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10436 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10437 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10438 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10439 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10440 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10441 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10442 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10443 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10444 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10447 tree t
= targetm
.build_builtin_va_list ();
10449 /* Many back-ends define record types without setting TYPE_NAME.
10450 If we copied the record type here, we'd keep the original
10451 record type without a name. This breaks name mangling. So,
10452 don't copy record types and let c_common_nodes_and_builtins()
10453 declare the type to be __builtin_va_list. */
10454 if (TREE_CODE (t
) != RECORD_TYPE
)
10455 t
= build_variant_type_copy (t
);
10457 va_list_type_node
= t
;
10461 /* Modify DECL for given flags.
10462 TM_PURE attribute is set only on types, so the function will modify
10463 DECL's type when ECF_TM_PURE is used. */
10466 set_call_expr_flags (tree decl
, int flags
)
10468 if (flags
& ECF_NOTHROW
)
10469 TREE_NOTHROW (decl
) = 1;
10470 if (flags
& ECF_CONST
)
10471 TREE_READONLY (decl
) = 1;
10472 if (flags
& ECF_PURE
)
10473 DECL_PURE_P (decl
) = 1;
10474 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10475 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10476 if (flags
& ECF_NOVOPS
)
10477 DECL_IS_NOVOPS (decl
) = 1;
10478 if (flags
& ECF_NORETURN
)
10479 TREE_THIS_VOLATILE (decl
) = 1;
10480 if (flags
& ECF_MALLOC
)
10481 DECL_IS_MALLOC (decl
) = 1;
10482 if (flags
& ECF_RETURNS_TWICE
)
10483 DECL_IS_RETURNS_TWICE (decl
) = 1;
10484 if (flags
& ECF_LEAF
)
10485 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10486 NULL
, DECL_ATTRIBUTES (decl
));
10487 if (flags
& ECF_RET1
)
10488 DECL_ATTRIBUTES (decl
)
10489 = tree_cons (get_identifier ("fn spec"),
10490 build_tree_list (NULL_TREE
, build_string (1, "1")),
10491 DECL_ATTRIBUTES (decl
));
10492 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10493 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10494 /* Looping const or pure is implied by noreturn.
10495 There is currently no way to declare looping const or looping pure alone. */
10496 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10497 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10501 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10504 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10505 const char *library_name
, int ecf_flags
)
10509 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10510 library_name
, NULL_TREE
);
10511 set_call_expr_flags (decl
, ecf_flags
);
10513 set_builtin_decl (code
, decl
, true);
10516 /* Call this function after instantiating all builtins that the language
10517 front end cares about. This will build the rest of the builtins
10518 and internal functions that are relied upon by the tree optimizers and
10522 build_common_builtin_nodes (void)
10527 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10528 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10530 ftype
= build_function_type (void_type_node
, void_list_node
);
10531 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10532 local_define_builtin ("__builtin_unreachable", ftype
,
10533 BUILT_IN_UNREACHABLE
,
10534 "__builtin_unreachable",
10535 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10537 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10538 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10540 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
);
10543 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10544 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10546 ftype
= build_function_type_list (ptr_type_node
,
10547 ptr_type_node
, const_ptr_type_node
,
10548 size_type_node
, NULL_TREE
);
10550 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10551 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10552 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10553 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10554 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10555 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10558 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10560 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10561 const_ptr_type_node
, size_type_node
,
10563 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10564 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10567 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10569 ftype
= build_function_type_list (ptr_type_node
,
10570 ptr_type_node
, integer_type_node
,
10571 size_type_node
, NULL_TREE
);
10572 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10573 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10576 /* If we're checking the stack, `alloca' can throw. */
10577 const int alloca_flags
10578 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10580 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10582 ftype
= build_function_type_list (ptr_type_node
,
10583 size_type_node
, NULL_TREE
);
10584 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10585 "alloca", alloca_flags
);
10588 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10589 size_type_node
, NULL_TREE
);
10590 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10591 BUILT_IN_ALLOCA_WITH_ALIGN
,
10592 "__builtin_alloca_with_align",
10595 ftype
= build_function_type_list (void_type_node
,
10596 ptr_type_node
, ptr_type_node
,
10597 ptr_type_node
, NULL_TREE
);
10598 local_define_builtin ("__builtin_init_trampoline", ftype
,
10599 BUILT_IN_INIT_TRAMPOLINE
,
10600 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10601 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10602 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10603 "__builtin_init_heap_trampoline",
10604 ECF_NOTHROW
| ECF_LEAF
);
10606 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10607 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10608 BUILT_IN_ADJUST_TRAMPOLINE
,
10609 "__builtin_adjust_trampoline",
10610 ECF_CONST
| ECF_NOTHROW
);
10612 ftype
= build_function_type_list (void_type_node
,
10613 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10614 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10615 BUILT_IN_NONLOCAL_GOTO
,
10616 "__builtin_nonlocal_goto",
10617 ECF_NORETURN
| ECF_NOTHROW
);
10619 ftype
= build_function_type_list (void_type_node
,
10620 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10621 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10622 BUILT_IN_SETJMP_SETUP
,
10623 "__builtin_setjmp_setup", ECF_NOTHROW
);
10625 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10626 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10627 BUILT_IN_SETJMP_RECEIVER
,
10628 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10630 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10631 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10632 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10634 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10635 local_define_builtin ("__builtin_stack_restore", ftype
,
10636 BUILT_IN_STACK_RESTORE
,
10637 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10639 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10640 const_ptr_type_node
, size_type_node
,
10642 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10643 "__builtin_memcmp_eq",
10644 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10646 /* If there's a possibility that we might use the ARM EABI, build the
10647 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10648 if (targetm
.arm_eabi_unwinder
)
10650 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10651 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10652 BUILT_IN_CXA_END_CLEANUP
,
10653 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10656 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10657 local_define_builtin ("__builtin_unwind_resume", ftype
,
10658 BUILT_IN_UNWIND_RESUME
,
10659 ((targetm_common
.except_unwind_info (&global_options
)
10661 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10664 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10666 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10668 local_define_builtin ("__builtin_return_address", ftype
,
10669 BUILT_IN_RETURN_ADDRESS
,
10670 "__builtin_return_address",
10674 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10675 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10677 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10678 ptr_type_node
, NULL_TREE
);
10679 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10680 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10681 BUILT_IN_PROFILE_FUNC_ENTER
,
10682 "__cyg_profile_func_enter", 0);
10683 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10684 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10685 BUILT_IN_PROFILE_FUNC_EXIT
,
10686 "__cyg_profile_func_exit", 0);
10689 /* The exception object and filter values from the runtime. The argument
10690 must be zero before exception lowering, i.e. from the front end. After
10691 exception lowering, it will be the region number for the exception
10692 landing pad. These functions are PURE instead of CONST to prevent
10693 them from being hoisted past the exception edge that will initialize
10694 its value in the landing pad. */
10695 ftype
= build_function_type_list (ptr_type_node
,
10696 integer_type_node
, NULL_TREE
);
10697 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10698 /* Only use TM_PURE if we have TM language support. */
10699 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10700 ecf_flags
|= ECF_TM_PURE
;
10701 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10702 "__builtin_eh_pointer", ecf_flags
);
10704 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10705 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10706 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10707 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10709 ftype
= build_function_type_list (void_type_node
,
10710 integer_type_node
, integer_type_node
,
10712 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10713 BUILT_IN_EH_COPY_VALUES
,
10714 "__builtin_eh_copy_values", ECF_NOTHROW
);
10716 /* Complex multiplication and division. These are handled as builtins
10717 rather than optabs because emit_library_call_value doesn't support
10718 complex. Further, we can do slightly better with folding these
10719 beasties if the real and complex parts of the arguments are separate. */
10723 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10725 char mode_name_buf
[4], *q
;
10727 enum built_in_function mcode
, dcode
;
10728 tree type
, inner_type
;
10729 const char *prefix
= "__";
10731 if (targetm
.libfunc_gnu_prefix
)
10734 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10737 inner_type
= TREE_TYPE (type
);
10739 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10740 inner_type
, inner_type
, NULL_TREE
);
10742 mcode
= ((enum built_in_function
)
10743 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10744 dcode
= ((enum built_in_function
)
10745 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10747 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10751 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10753 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10754 built_in_names
[mcode
],
10755 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10757 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10759 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10760 built_in_names
[dcode
],
10761 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10765 init_internal_fns ();
10768 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10771 If we requested a pointer to a vector, build up the pointers that
10772 we stripped off while looking for the inner type. Similarly for
10773 return values from functions.
10775 The argument TYPE is the top of the chain, and BOTTOM is the
10776 new type which we will point to. */
10779 reconstruct_complex_type (tree type
, tree bottom
)
10783 if (TREE_CODE (type
) == POINTER_TYPE
)
10785 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10786 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10787 TYPE_REF_CAN_ALIAS_ALL (type
));
10789 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10791 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10792 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10793 TYPE_REF_CAN_ALIAS_ALL (type
));
10795 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10797 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10798 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10800 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10802 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10803 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10805 else if (TREE_CODE (type
) == METHOD_TYPE
)
10807 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10808 /* The build_method_type_directly() routine prepends 'this' to argument list,
10809 so we must compensate by getting rid of it. */
10811 = build_method_type_directly
10812 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10814 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10816 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10818 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10819 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10824 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10825 TYPE_QUALS (type
));
10828 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10831 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10835 switch (GET_MODE_CLASS (mode
))
10837 case MODE_VECTOR_INT
:
10838 case MODE_VECTOR_FLOAT
:
10839 case MODE_VECTOR_FRACT
:
10840 case MODE_VECTOR_UFRACT
:
10841 case MODE_VECTOR_ACCUM
:
10842 case MODE_VECTOR_UACCUM
:
10843 nunits
= GET_MODE_NUNITS (mode
);
10847 /* Check that there are no leftover bits. */
10848 gcc_assert (GET_MODE_BITSIZE (mode
)
10849 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10851 nunits
= GET_MODE_BITSIZE (mode
)
10852 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10856 gcc_unreachable ();
10859 return make_vector_type (innertype
, nunits
, mode
);
10862 /* Similarly, but takes the inner type and number of units, which must be
10866 build_vector_type (tree innertype
, int nunits
)
10868 return make_vector_type (innertype
, nunits
, VOIDmode
);
10871 /* Build truth vector with specified length and number of units. */
10874 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10876 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10879 gcc_assert (mask_mode
!= VOIDmode
);
10881 unsigned HOST_WIDE_INT vsize
;
10882 if (mask_mode
== BLKmode
)
10883 vsize
= vector_size
* BITS_PER_UNIT
;
10885 vsize
= GET_MODE_BITSIZE (mask_mode
);
10887 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10888 gcc_assert (esize
* nunits
== vsize
);
10890 tree bool_type
= build_nonstandard_boolean_type (esize
);
10892 return make_vector_type (bool_type
, nunits
, mask_mode
);
10895 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10898 build_same_sized_truth_vector_type (tree vectype
)
10900 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10903 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10906 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10908 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10911 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10914 build_opaque_vector_type (tree innertype
, int nunits
)
10916 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10918 /* We always build the non-opaque variant before the opaque one,
10919 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10920 cand
= TYPE_NEXT_VARIANT (t
);
10922 && TYPE_VECTOR_OPAQUE (cand
)
10923 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10925 /* Othewise build a variant type and make sure to queue it after
10926 the non-opaque type. */
10927 cand
= build_distinct_type_copy (t
);
10928 TYPE_VECTOR_OPAQUE (cand
) = true;
10929 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10930 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10931 TYPE_NEXT_VARIANT (t
) = cand
;
10932 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10937 /* Given an initializer INIT, return TRUE if INIT is zero or some
10938 aggregate of zeros. Otherwise return FALSE. */
10940 initializer_zerop (const_tree init
)
10946 switch (TREE_CODE (init
))
10949 return integer_zerop (init
);
10952 /* ??? Note that this is not correct for C4X float formats. There,
10953 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10954 negative exponent. */
10955 return real_zerop (init
)
10956 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10959 return fixed_zerop (init
);
10962 return integer_zerop (init
)
10963 || (real_zerop (init
)
10964 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10965 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10970 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10971 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10978 unsigned HOST_WIDE_INT idx
;
10980 if (TREE_CLOBBER_P (init
))
10982 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10983 if (!initializer_zerop (elt
))
10992 /* We need to loop through all elements to handle cases like
10993 "\0" and "\0foobar". */
10994 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
10995 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11006 /* Check if vector VEC consists of all the equal elements and
11007 that the number of elements corresponds to the type of VEC.
11008 The function returns first element of the vector
11009 or NULL_TREE if the vector is not uniform. */
11011 uniform_vector_p (const_tree vec
)
11016 if (vec
== NULL_TREE
)
11019 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11021 if (TREE_CODE (vec
) == VECTOR_CST
)
11023 first
= VECTOR_CST_ELT (vec
, 0);
11024 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
11025 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
11031 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
11033 first
= error_mark_node
;
11035 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11042 if (!operand_equal_p (first
, t
, 0))
11045 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11054 /* Build an empty statement at location LOC. */
11057 build_empty_stmt (location_t loc
)
11059 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11060 SET_EXPR_LOCATION (t
, loc
);
11065 /* Build an OpenMP clause with code CODE. LOC is the location of the
11069 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11074 length
= omp_clause_num_ops
[code
];
11075 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11077 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11079 t
= (tree
) ggc_internal_alloc (size
);
11080 memset (t
, 0, size
);
11081 TREE_SET_CODE (t
, OMP_CLAUSE
);
11082 OMP_CLAUSE_SET_CODE (t
, code
);
11083 OMP_CLAUSE_LOCATION (t
) = loc
;
11088 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11089 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11090 Except for the CODE and operand count field, other storage for the
11091 object is initialized to zeros. */
11094 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11097 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11099 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11100 gcc_assert (len
>= 1);
11102 record_node_allocation_statistics (code
, length
);
11104 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11106 TREE_SET_CODE (t
, code
);
11108 /* Can't use TREE_OPERAND to store the length because if checking is
11109 enabled, it will try to check the length before we store it. :-P */
11110 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11115 /* Helper function for build_call_* functions; build a CALL_EXPR with
11116 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11117 the argument slots. */
11120 build_call_1 (tree return_type
, tree fn
, int nargs
)
11124 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11125 TREE_TYPE (t
) = return_type
;
11126 CALL_EXPR_FN (t
) = fn
;
11127 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11132 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11133 FN and a null static chain slot. NARGS is the number of call arguments
11134 which are specified as "..." arguments. */
11137 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11141 va_start (args
, nargs
);
11142 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11147 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11148 FN and a null static chain slot. NARGS is the number of call arguments
11149 which are specified as a va_list ARGS. */
11152 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11157 t
= build_call_1 (return_type
, fn
, nargs
);
11158 for (i
= 0; i
< nargs
; i
++)
11159 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11160 process_call_operands (t
);
11164 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11165 FN and a null static chain slot. NARGS is the number of call arguments
11166 which are specified as a tree array ARGS. */
11169 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11170 int nargs
, const tree
*args
)
11175 t
= build_call_1 (return_type
, fn
, nargs
);
11176 for (i
= 0; i
< nargs
; i
++)
11177 CALL_EXPR_ARG (t
, i
) = args
[i
];
11178 process_call_operands (t
);
11179 SET_EXPR_LOCATION (t
, loc
);
11183 /* Like build_call_array, but takes a vec. */
11186 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11191 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11192 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11193 CALL_EXPR_ARG (ret
, ix
) = t
;
11194 process_call_operands (ret
);
11198 /* Conveniently construct a function call expression. FNDECL names the
11199 function to be called and N arguments are passed in the array
11203 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11205 tree fntype
= TREE_TYPE (fndecl
);
11206 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11208 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11211 /* Conveniently construct a function call expression. FNDECL names the
11212 function to be called and the arguments are passed in the vector
11216 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11218 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11219 vec_safe_address (vec
));
11223 /* Conveniently construct a function call expression. FNDECL names the
11224 function to be called, N is the number of arguments, and the "..."
11225 parameters are the argument expressions. */
11228 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11231 tree
*argarray
= XALLOCAVEC (tree
, n
);
11235 for (i
= 0; i
< n
; i
++)
11236 argarray
[i
] = va_arg (ap
, tree
);
11238 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11241 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11242 varargs macros aren't supported by all bootstrap compilers. */
11245 build_call_expr (tree fndecl
, int n
, ...)
11248 tree
*argarray
= XALLOCAVEC (tree
, n
);
11252 for (i
= 0; i
< n
; i
++)
11253 argarray
[i
] = va_arg (ap
, tree
);
11255 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11258 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11259 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11260 It will get gimplified later into an ordinary internal function. */
11263 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11264 tree type
, int n
, const tree
*args
)
11266 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11267 for (int i
= 0; i
< n
; ++i
)
11268 CALL_EXPR_ARG (t
, i
) = args
[i
];
11269 SET_EXPR_LOCATION (t
, loc
);
11270 CALL_EXPR_IFN (t
) = ifn
;
11274 /* Build internal call expression. This is just like CALL_EXPR, except
11275 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11276 internal function. */
11279 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11280 tree type
, int n
, ...)
11283 tree
*argarray
= XALLOCAVEC (tree
, n
);
11287 for (i
= 0; i
< n
; i
++)
11288 argarray
[i
] = va_arg (ap
, tree
);
11290 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11293 /* Return a function call to FN, if the target is guaranteed to support it,
11296 N is the number of arguments, passed in the "...", and TYPE is the
11297 type of the return value. */
11300 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11304 tree
*argarray
= XALLOCAVEC (tree
, n
);
11308 for (i
= 0; i
< n
; i
++)
11309 argarray
[i
] = va_arg (ap
, tree
);
11311 if (internal_fn_p (fn
))
11313 internal_fn ifn
= as_internal_fn (fn
);
11314 if (direct_internal_fn_p (ifn
))
11316 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11317 if (!direct_internal_fn_supported_p (ifn
, types
,
11318 OPTIMIZE_FOR_BOTH
))
11321 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11325 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11328 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11332 /* Create a new constant string literal and return a char* pointer to it.
11333 The STRING_CST value is the LEN characters at STR. */
11335 build_string_literal (int len
, const char *str
)
11337 tree t
, elem
, index
, type
;
11339 t
= build_string (len
, str
);
11340 elem
= build_type_variant (char_type_node
, 1, 0);
11341 index
= build_index_type (size_int (len
- 1));
11342 type
= build_array_type (elem
, index
);
11343 TREE_TYPE (t
) = type
;
11344 TREE_CONSTANT (t
) = 1;
11345 TREE_READONLY (t
) = 1;
11346 TREE_STATIC (t
) = 1;
11348 type
= build_pointer_type (elem
);
11349 t
= build1 (ADDR_EXPR
, type
,
11350 build4 (ARRAY_REF
, elem
,
11351 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11357 /* Return true if T (assumed to be a DECL) must be assigned a memory
11361 needs_to_live_in_memory (const_tree t
)
11363 return (TREE_ADDRESSABLE (t
)
11364 || is_global_var (t
)
11365 || (TREE_CODE (t
) == RESULT_DECL
11366 && !DECL_BY_REFERENCE (t
)
11367 && aggregate_value_p (t
, current_function_decl
)));
11370 /* Return value of a constant X and sign-extend it. */
11373 int_cst_value (const_tree x
)
11375 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11376 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11378 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11379 gcc_assert (cst_and_fits_in_hwi (x
));
11381 if (bits
< HOST_BITS_PER_WIDE_INT
)
11383 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11385 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11387 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11393 /* If TYPE is an integral or pointer type, return an integer type with
11394 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11395 if TYPE is already an integer type of signedness UNSIGNEDP. */
11398 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11400 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11403 if (TREE_CODE (type
) == VECTOR_TYPE
)
11405 tree inner
= TREE_TYPE (type
);
11406 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11409 if (inner
== inner2
)
11411 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11414 if (!INTEGRAL_TYPE_P (type
)
11415 && !POINTER_TYPE_P (type
)
11416 && TREE_CODE (type
) != OFFSET_TYPE
)
11419 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11422 /* If TYPE is an integral or pointer type, return an integer type with
11423 the same precision which is unsigned, or itself if TYPE is already an
11424 unsigned integer type. */
11427 unsigned_type_for (tree type
)
11429 return signed_or_unsigned_type_for (1, type
);
11432 /* If TYPE is an integral or pointer type, return an integer type with
11433 the same precision which is signed, or itself if TYPE is already a
11434 signed integer type. */
11437 signed_type_for (tree type
)
11439 return signed_or_unsigned_type_for (0, type
);
11442 /* If TYPE is a vector type, return a signed integer vector type with the
11443 same width and number of subparts. Otherwise return boolean_type_node. */
11446 truth_type_for (tree type
)
11448 if (TREE_CODE (type
) == VECTOR_TYPE
)
11450 if (VECTOR_BOOLEAN_TYPE_P (type
))
11452 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11453 GET_MODE_SIZE (TYPE_MODE (type
)));
11456 return boolean_type_node
;
11459 /* Returns the largest value obtainable by casting something in INNER type to
11463 upper_bound_in_type (tree outer
, tree inner
)
11465 unsigned int det
= 0;
11466 unsigned oprec
= TYPE_PRECISION (outer
);
11467 unsigned iprec
= TYPE_PRECISION (inner
);
11470 /* Compute a unique number for every combination. */
11471 det
|= (oprec
> iprec
) ? 4 : 0;
11472 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11473 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11475 /* Determine the exponent to use. */
11480 /* oprec <= iprec, outer: signed, inner: don't care. */
11485 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11489 /* oprec > iprec, outer: signed, inner: signed. */
11493 /* oprec > iprec, outer: signed, inner: unsigned. */
11497 /* oprec > iprec, outer: unsigned, inner: signed. */
11501 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11505 gcc_unreachable ();
11508 return wide_int_to_tree (outer
,
11509 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11512 /* Returns the smallest value obtainable by casting something in INNER type to
11516 lower_bound_in_type (tree outer
, tree inner
)
11518 unsigned oprec
= TYPE_PRECISION (outer
);
11519 unsigned iprec
= TYPE_PRECISION (inner
);
11521 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11523 if (TYPE_UNSIGNED (outer
)
11524 /* If we are widening something of an unsigned type, OUTER type
11525 contains all values of INNER type. In particular, both INNER
11526 and OUTER types have zero in common. */
11527 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11528 return build_int_cst (outer
, 0);
11531 /* If we are widening a signed type to another signed type, we
11532 want to obtain -2^^(iprec-1). If we are keeping the
11533 precision or narrowing to a signed type, we want to obtain
11535 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11536 return wide_int_to_tree (outer
,
11537 wi::mask (prec
- 1, true,
11538 TYPE_PRECISION (outer
)));
11542 /* Return nonzero if two operands that are suitable for PHI nodes are
11543 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11544 SSA_NAME or invariant. Note that this is strictly an optimization.
11545 That is, callers of this function can directly call operand_equal_p
11546 and get the same result, only slower. */
11549 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11553 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11555 return operand_equal_p (arg0
, arg1
, 0);
11558 /* Returns number of zeros at the end of binary representation of X. */
11561 num_ending_zeros (const_tree x
)
11563 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11567 #define WALK_SUBTREE(NODE) \
11570 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11576 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11577 be walked whenever a type is seen in the tree. Rest of operands and return
11578 value are as for walk_tree. */
11581 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11582 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11584 tree result
= NULL_TREE
;
11586 switch (TREE_CODE (type
))
11589 case REFERENCE_TYPE
:
11591 /* We have to worry about mutually recursive pointers. These can't
11592 be written in C. They can in Ada. It's pathological, but
11593 there's an ACATS test (c38102a) that checks it. Deal with this
11594 by checking if we're pointing to another pointer, that one
11595 points to another pointer, that one does too, and we have no htab.
11596 If so, get a hash table. We check three levels deep to avoid
11597 the cost of the hash table if we don't need one. */
11598 if (POINTER_TYPE_P (TREE_TYPE (type
))
11599 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11600 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11603 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11614 WALK_SUBTREE (TREE_TYPE (type
));
11618 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11620 /* Fall through. */
11622 case FUNCTION_TYPE
:
11623 WALK_SUBTREE (TREE_TYPE (type
));
11627 /* We never want to walk into default arguments. */
11628 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11629 WALK_SUBTREE (TREE_VALUE (arg
));
11634 /* Don't follow this nodes's type if a pointer for fear that
11635 we'll have infinite recursion. If we have a PSET, then we
11638 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11639 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11640 WALK_SUBTREE (TREE_TYPE (type
));
11641 WALK_SUBTREE (TYPE_DOMAIN (type
));
11645 WALK_SUBTREE (TREE_TYPE (type
));
11646 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11656 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11657 called with the DATA and the address of each sub-tree. If FUNC returns a
11658 non-NULL value, the traversal is stopped, and the value returned by FUNC
11659 is returned. If PSET is non-NULL it is used to record the nodes visited,
11660 and to avoid visiting a node more than once. */
11663 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11664 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11666 enum tree_code code
;
11670 #define WALK_SUBTREE_TAIL(NODE) \
11674 goto tail_recurse; \
11679 /* Skip empty subtrees. */
11683 /* Don't walk the same tree twice, if the user has requested
11684 that we avoid doing so. */
11685 if (pset
&& pset
->add (*tp
))
11688 /* Call the function. */
11690 result
= (*func
) (tp
, &walk_subtrees
, data
);
11692 /* If we found something, return it. */
11696 code
= TREE_CODE (*tp
);
11698 /* Even if we didn't, FUNC may have decided that there was nothing
11699 interesting below this point in the tree. */
11700 if (!walk_subtrees
)
11702 /* But we still need to check our siblings. */
11703 if (code
== TREE_LIST
)
11704 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11705 else if (code
== OMP_CLAUSE
)
11706 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11713 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11714 if (result
|| !walk_subtrees
)
11721 case IDENTIFIER_NODE
:
11728 case PLACEHOLDER_EXPR
:
11732 /* None of these have subtrees other than those already walked
11737 WALK_SUBTREE (TREE_VALUE (*tp
));
11738 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11743 int len
= TREE_VEC_LENGTH (*tp
);
11748 /* Walk all elements but the first. */
11750 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11752 /* Now walk the first one as a tail call. */
11753 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11757 WALK_SUBTREE (TREE_REALPART (*tp
));
11758 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11762 unsigned HOST_WIDE_INT idx
;
11763 constructor_elt
*ce
;
11765 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11767 WALK_SUBTREE (ce
->value
);
11772 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11777 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11779 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11780 into declarations that are just mentioned, rather than
11781 declared; they don't really belong to this part of the tree.
11782 And, we can see cycles: the initializer for a declaration
11783 can refer to the declaration itself. */
11784 WALK_SUBTREE (DECL_INITIAL (decl
));
11785 WALK_SUBTREE (DECL_SIZE (decl
));
11786 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11788 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11791 case STATEMENT_LIST
:
11793 tree_stmt_iterator i
;
11794 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11795 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11800 switch (OMP_CLAUSE_CODE (*tp
))
11802 case OMP_CLAUSE_GANG
:
11803 case OMP_CLAUSE__GRIDDIM_
:
11804 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11807 case OMP_CLAUSE_ASYNC
:
11808 case OMP_CLAUSE_WAIT
:
11809 case OMP_CLAUSE_WORKER
:
11810 case OMP_CLAUSE_VECTOR
:
11811 case OMP_CLAUSE_NUM_GANGS
:
11812 case OMP_CLAUSE_NUM_WORKERS
:
11813 case OMP_CLAUSE_VECTOR_LENGTH
:
11814 case OMP_CLAUSE_PRIVATE
:
11815 case OMP_CLAUSE_SHARED
:
11816 case OMP_CLAUSE_FIRSTPRIVATE
:
11817 case OMP_CLAUSE_COPYIN
:
11818 case OMP_CLAUSE_COPYPRIVATE
:
11819 case OMP_CLAUSE_FINAL
:
11820 case OMP_CLAUSE_IF
:
11821 case OMP_CLAUSE_NUM_THREADS
:
11822 case OMP_CLAUSE_SCHEDULE
:
11823 case OMP_CLAUSE_UNIFORM
:
11824 case OMP_CLAUSE_DEPEND
:
11825 case OMP_CLAUSE_NUM_TEAMS
:
11826 case OMP_CLAUSE_THREAD_LIMIT
:
11827 case OMP_CLAUSE_DEVICE
:
11828 case OMP_CLAUSE_DIST_SCHEDULE
:
11829 case OMP_CLAUSE_SAFELEN
:
11830 case OMP_CLAUSE_SIMDLEN
:
11831 case OMP_CLAUSE_ORDERED
:
11832 case OMP_CLAUSE_PRIORITY
:
11833 case OMP_CLAUSE_GRAINSIZE
:
11834 case OMP_CLAUSE_NUM_TASKS
:
11835 case OMP_CLAUSE_HINT
:
11836 case OMP_CLAUSE_TO_DECLARE
:
11837 case OMP_CLAUSE_LINK
:
11838 case OMP_CLAUSE_USE_DEVICE_PTR
:
11839 case OMP_CLAUSE_IS_DEVICE_PTR
:
11840 case OMP_CLAUSE__LOOPTEMP_
:
11841 case OMP_CLAUSE__SIMDUID_
:
11842 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11843 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11846 case OMP_CLAUSE_INDEPENDENT
:
11847 case OMP_CLAUSE_NOWAIT
:
11848 case OMP_CLAUSE_DEFAULT
:
11849 case OMP_CLAUSE_UNTIED
:
11850 case OMP_CLAUSE_MERGEABLE
:
11851 case OMP_CLAUSE_PROC_BIND
:
11852 case OMP_CLAUSE_INBRANCH
:
11853 case OMP_CLAUSE_NOTINBRANCH
:
11854 case OMP_CLAUSE_FOR
:
11855 case OMP_CLAUSE_PARALLEL
:
11856 case OMP_CLAUSE_SECTIONS
:
11857 case OMP_CLAUSE_TASKGROUP
:
11858 case OMP_CLAUSE_NOGROUP
:
11859 case OMP_CLAUSE_THREADS
:
11860 case OMP_CLAUSE_SIMD
:
11861 case OMP_CLAUSE_DEFAULTMAP
:
11862 case OMP_CLAUSE_AUTO
:
11863 case OMP_CLAUSE_SEQ
:
11864 case OMP_CLAUSE_TILE
:
11865 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11867 case OMP_CLAUSE_LASTPRIVATE
:
11868 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11869 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11870 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11872 case OMP_CLAUSE_COLLAPSE
:
11875 for (i
= 0; i
< 3; i
++)
11876 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11877 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11880 case OMP_CLAUSE_LINEAR
:
11881 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11882 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11883 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11884 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11886 case OMP_CLAUSE_ALIGNED
:
11887 case OMP_CLAUSE_FROM
:
11888 case OMP_CLAUSE_TO
:
11889 case OMP_CLAUSE_MAP
:
11890 case OMP_CLAUSE__CACHE_
:
11891 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11892 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11893 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11895 case OMP_CLAUSE_REDUCTION
:
11898 for (i
= 0; i
< 5; i
++)
11899 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11900 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11904 gcc_unreachable ();
11912 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11913 But, we only want to walk once. */
11914 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11915 for (i
= 0; i
< len
; ++i
)
11916 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11917 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11921 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11922 defining. We only want to walk into these fields of a type in this
11923 case and not in the general case of a mere reference to the type.
11925 The criterion is as follows: if the field can be an expression, it
11926 must be walked only here. This should be in keeping with the fields
11927 that are directly gimplified in gimplify_type_sizes in order for the
11928 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11929 variable-sized types.
11931 Note that DECLs get walked as part of processing the BIND_EXPR. */
11932 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11934 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11935 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11938 /* Call the function for the type. See if it returns anything or
11939 doesn't want us to continue. If we are to continue, walk both
11940 the normal fields and those for the declaration case. */
11941 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11942 if (result
|| !walk_subtrees
)
11945 /* But do not walk a pointed-to type since it may itself need to
11946 be walked in the declaration case if it isn't anonymous. */
11947 if (!POINTER_TYPE_P (*type_p
))
11949 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11954 /* If this is a record type, also walk the fields. */
11955 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11959 for (field
= TYPE_FIELDS (*type_p
); field
;
11960 field
= DECL_CHAIN (field
))
11962 /* We'd like to look at the type of the field, but we can
11963 easily get infinite recursion. So assume it's pointed
11964 to elsewhere in the tree. Also, ignore things that
11966 if (TREE_CODE (field
) != FIELD_DECL
)
11969 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11970 WALK_SUBTREE (DECL_SIZE (field
));
11971 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11972 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11973 WALK_SUBTREE (DECL_QUALIFIER (field
));
11977 /* Same for scalar types. */
11978 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11979 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11980 || TREE_CODE (*type_p
) == INTEGER_TYPE
11981 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11982 || TREE_CODE (*type_p
) == REAL_TYPE
)
11984 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11985 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
11988 WALK_SUBTREE (TYPE_SIZE (*type_p
));
11989 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
11994 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
11998 /* Walk over all the sub-trees of this operand. */
11999 len
= TREE_OPERAND_LENGTH (*tp
);
12001 /* Go through the subtrees. We need to do this in forward order so
12002 that the scope of a FOR_EXPR is handled properly. */
12005 for (i
= 0; i
< len
- 1; ++i
)
12006 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12007 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12010 /* If this is a type, walk the needed fields in the type. */
12011 else if (TYPE_P (*tp
))
12012 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12016 /* We didn't find what we were looking for. */
12019 #undef WALK_SUBTREE_TAIL
12021 #undef WALK_SUBTREE
12023 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12026 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12031 hash_set
<tree
> pset
;
12032 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12038 tree_block (tree t
)
12040 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12042 if (IS_EXPR_CODE_CLASS (c
))
12043 return LOCATION_BLOCK (t
->exp
.locus
);
12044 gcc_unreachable ();
12049 tree_set_block (tree t
, tree b
)
12051 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12053 if (IS_EXPR_CODE_CLASS (c
))
12055 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12058 gcc_unreachable ();
12061 /* Create a nameless artificial label and put it in the current
12062 function context. The label has a location of LOC. Returns the
12063 newly created label. */
12066 create_artificial_label (location_t loc
)
12068 tree lab
= build_decl (loc
,
12069 LABEL_DECL
, NULL_TREE
, void_type_node
);
12071 DECL_ARTIFICIAL (lab
) = 1;
12072 DECL_IGNORED_P (lab
) = 1;
12073 DECL_CONTEXT (lab
) = current_function_decl
;
12077 /* Given a tree, try to return a useful variable name that we can use
12078 to prefix a temporary that is being assigned the value of the tree.
12079 I.E. given <temp> = &A, return A. */
12084 tree stripped_decl
;
12087 STRIP_NOPS (stripped_decl
);
12088 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12089 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12090 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12092 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12095 return IDENTIFIER_POINTER (name
);
12099 switch (TREE_CODE (stripped_decl
))
12102 return get_name (TREE_OPERAND (stripped_decl
, 0));
12109 /* Return true if TYPE has a variable argument list. */
12112 stdarg_p (const_tree fntype
)
12114 function_args_iterator args_iter
;
12115 tree n
= NULL_TREE
, t
;
12120 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12125 return n
!= NULL_TREE
&& n
!= void_type_node
;
12128 /* Return true if TYPE has a prototype. */
12131 prototype_p (const_tree fntype
)
12135 gcc_assert (fntype
!= NULL_TREE
);
12137 t
= TYPE_ARG_TYPES (fntype
);
12138 return (t
!= NULL_TREE
);
12141 /* If BLOCK is inlined from an __attribute__((__artificial__))
12142 routine, return pointer to location from where it has been
12145 block_nonartificial_location (tree block
)
12147 location_t
*ret
= NULL
;
12149 while (block
&& TREE_CODE (block
) == BLOCK
12150 && BLOCK_ABSTRACT_ORIGIN (block
))
12152 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12154 while (TREE_CODE (ao
) == BLOCK
12155 && BLOCK_ABSTRACT_ORIGIN (ao
)
12156 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12157 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12159 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12161 /* If AO is an artificial inline, point RET to the
12162 call site locus at which it has been inlined and continue
12163 the loop, in case AO's caller is also an artificial
12165 if (DECL_DECLARED_INLINE_P (ao
)
12166 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12167 ret
= &BLOCK_SOURCE_LOCATION (block
);
12171 else if (TREE_CODE (ao
) != BLOCK
)
12174 block
= BLOCK_SUPERCONTEXT (block
);
12180 /* If EXP is inlined from an __attribute__((__artificial__))
12181 function, return the location of the original call expression. */
12184 tree_nonartificial_location (tree exp
)
12186 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12191 return EXPR_LOCATION (exp
);
12195 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12198 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12201 cl_option_hasher::hash (tree x
)
12203 const_tree
const t
= x
;
12207 hashval_t hash
= 0;
12209 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12211 p
= (const char *)TREE_OPTIMIZATION (t
);
12212 len
= sizeof (struct cl_optimization
);
12215 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12216 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12219 gcc_unreachable ();
12221 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12223 for (i
= 0; i
< len
; i
++)
12225 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12230 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12231 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12235 cl_option_hasher::equal (tree x
, tree y
)
12237 const_tree
const xt
= x
;
12238 const_tree
const yt
= y
;
12243 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12246 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12248 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12249 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12250 len
= sizeof (struct cl_optimization
);
12253 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12255 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12256 TREE_TARGET_OPTION (yt
));
12260 gcc_unreachable ();
12262 return (memcmp (xp
, yp
, len
) == 0);
12265 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12268 build_optimization_node (struct gcc_options
*opts
)
12272 /* Use the cache of optimization nodes. */
12274 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12277 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12281 /* Insert this one into the hash table. */
12282 t
= cl_optimization_node
;
12285 /* Make a new node for next time round. */
12286 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12292 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12295 build_target_option_node (struct gcc_options
*opts
)
12299 /* Use the cache of optimization nodes. */
12301 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12304 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12308 /* Insert this one into the hash table. */
12309 t
= cl_target_option_node
;
12312 /* Make a new node for next time round. */
12313 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12319 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12320 so that they aren't saved during PCH writing. */
12323 prepare_target_option_nodes_for_pch (void)
12325 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12326 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12327 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12328 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12331 /* Determine the "ultimate origin" of a block. The block may be an inlined
12332 instance of an inlined instance of a block which is local to an inline
12333 function, so we have to trace all of the way back through the origin chain
12334 to find out what sort of node actually served as the original seed for the
12338 block_ultimate_origin (const_tree block
)
12340 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12342 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12343 we're trying to output the abstract instance of this function. */
12344 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12347 if (immediate_origin
== NULL_TREE
)
12352 tree lookahead
= immediate_origin
;
12356 ret_val
= lookahead
;
12357 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12358 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12360 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12362 /* The block's abstract origin chain may not be the *ultimate* origin of
12363 the block. It could lead to a DECL that has an abstract origin set.
12364 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12365 will give us if it has one). Note that DECL's abstract origins are
12366 supposed to be the most distant ancestor (or so decl_ultimate_origin
12367 claims), so we don't need to loop following the DECL origins. */
12368 if (DECL_P (ret_val
))
12369 return DECL_ORIGIN (ret_val
);
12375 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12379 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12381 /* Do not strip casts into or out of differing address spaces. */
12382 if (POINTER_TYPE_P (outer_type
)
12383 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12385 if (!POINTER_TYPE_P (inner_type
)
12386 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12387 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12390 else if (POINTER_TYPE_P (inner_type
)
12391 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12393 /* We already know that outer_type is not a pointer with
12394 a non-generic address space. */
12398 /* Use precision rather then machine mode when we can, which gives
12399 the correct answer even for submode (bit-field) types. */
12400 if ((INTEGRAL_TYPE_P (outer_type
)
12401 || POINTER_TYPE_P (outer_type
)
12402 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12403 && (INTEGRAL_TYPE_P (inner_type
)
12404 || POINTER_TYPE_P (inner_type
)
12405 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12406 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12408 /* Otherwise fall back on comparing machine modes (e.g. for
12409 aggregate types, floats). */
12410 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12413 /* Return true iff conversion in EXP generates no instruction. Mark
12414 it inline so that we fully inline into the stripping functions even
12415 though we have two uses of this function. */
12418 tree_nop_conversion (const_tree exp
)
12420 tree outer_type
, inner_type
;
12422 if (!CONVERT_EXPR_P (exp
)
12423 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12425 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12428 outer_type
= TREE_TYPE (exp
);
12429 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12434 return tree_nop_conversion_p (outer_type
, inner_type
);
12437 /* Return true iff conversion in EXP generates no instruction. Don't
12438 consider conversions changing the signedness. */
12441 tree_sign_nop_conversion (const_tree exp
)
12443 tree outer_type
, inner_type
;
12445 if (!tree_nop_conversion (exp
))
12448 outer_type
= TREE_TYPE (exp
);
12449 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12451 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12452 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12455 /* Strip conversions from EXP according to tree_nop_conversion and
12456 return the resulting expression. */
12459 tree_strip_nop_conversions (tree exp
)
12461 while (tree_nop_conversion (exp
))
12462 exp
= TREE_OPERAND (exp
, 0);
12466 /* Strip conversions from EXP according to tree_sign_nop_conversion
12467 and return the resulting expression. */
12470 tree_strip_sign_nop_conversions (tree exp
)
12472 while (tree_sign_nop_conversion (exp
))
12473 exp
= TREE_OPERAND (exp
, 0);
12477 /* Avoid any floating point extensions from EXP. */
12479 strip_float_extensions (tree exp
)
12481 tree sub
, expt
, subt
;
12483 /* For floating point constant look up the narrowest type that can hold
12484 it properly and handle it like (type)(narrowest_type)constant.
12485 This way we can optimize for instance a=a*2.0 where "a" is float
12486 but 2.0 is double constant. */
12487 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12489 REAL_VALUE_TYPE orig
;
12492 orig
= TREE_REAL_CST (exp
);
12493 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12494 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12495 type
= float_type_node
;
12496 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12497 > TYPE_PRECISION (double_type_node
)
12498 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12499 type
= double_type_node
;
12501 return build_real_truncate (type
, orig
);
12504 if (!CONVERT_EXPR_P (exp
))
12507 sub
= TREE_OPERAND (exp
, 0);
12508 subt
= TREE_TYPE (sub
);
12509 expt
= TREE_TYPE (exp
);
12511 if (!FLOAT_TYPE_P (subt
))
12514 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12517 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12520 return strip_float_extensions (sub
);
12523 /* Strip out all handled components that produce invariant
12527 strip_invariant_refs (const_tree op
)
12529 while (handled_component_p (op
))
12531 switch (TREE_CODE (op
))
12534 case ARRAY_RANGE_REF
:
12535 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12536 || TREE_OPERAND (op
, 2) != NULL_TREE
12537 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12541 case COMPONENT_REF
:
12542 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12548 op
= TREE_OPERAND (op
, 0);
12554 static GTY(()) tree gcc_eh_personality_decl
;
12556 /* Return the GCC personality function decl. */
12559 lhd_gcc_personality (void)
12561 if (!gcc_eh_personality_decl
)
12562 gcc_eh_personality_decl
= build_personality_function ("gcc");
12563 return gcc_eh_personality_decl
;
12566 /* TARGET is a call target of GIMPLE call statement
12567 (obtained by gimple_call_fn). Return true if it is
12568 OBJ_TYPE_REF representing an virtual call of C++ method.
12569 (As opposed to OBJ_TYPE_REF representing objc calls
12570 through a cast where middle-end devirtualization machinery
12574 virtual_method_call_p (const_tree target
)
12576 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12578 tree t
= TREE_TYPE (target
);
12579 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12581 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12583 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12584 /* If we do not have BINFO associated, it means that type was built
12585 without devirtualization enabled. Do not consider this a virtual
12587 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12592 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12595 obj_type_ref_class (const_tree ref
)
12597 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12598 ref
= TREE_TYPE (ref
);
12599 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12600 ref
= TREE_TYPE (ref
);
12601 /* We look for type THIS points to. ObjC also builds
12602 OBJ_TYPE_REF with non-method calls, Their first parameter
12603 ID however also corresponds to class type. */
12604 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12605 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12606 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12607 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12608 return TREE_TYPE (ref
);
12611 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12614 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12617 tree base_binfo
, b
;
12619 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12620 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12621 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12623 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12628 /* Try to find a base info of BINFO that would have its field decl at offset
12629 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12630 found, return, otherwise return NULL_TREE. */
12633 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12635 tree type
= BINFO_TYPE (binfo
);
12639 HOST_WIDE_INT pos
, size
;
12643 if (types_same_for_odr (type
, expected_type
))
12648 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12650 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12653 pos
= int_bit_position (fld
);
12654 size
= tree_to_uhwi (DECL_SIZE (fld
));
12655 if (pos
<= offset
&& (pos
+ size
) > offset
)
12658 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12661 /* Offset 0 indicates the primary base, whose vtable contents are
12662 represented in the binfo for the derived class. */
12663 else if (offset
!= 0)
12665 tree found_binfo
= NULL
, base_binfo
;
12666 /* Offsets in BINFO are in bytes relative to the whole structure
12667 while POS is in bits relative to the containing field. */
12668 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12671 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12672 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12673 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12675 found_binfo
= base_binfo
;
12679 binfo
= found_binfo
;
12681 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12685 type
= TREE_TYPE (fld
);
12690 /* Returns true if X is a typedef decl. */
12693 is_typedef_decl (const_tree x
)
12695 return (x
&& TREE_CODE (x
) == TYPE_DECL
12696 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12699 /* Returns true iff TYPE is a type variant created for a typedef. */
12702 typedef_variant_p (const_tree type
)
12704 return is_typedef_decl (TYPE_NAME (type
));
12707 /* Warn about a use of an identifier which was marked deprecated. */
12709 warn_deprecated_use (tree node
, tree attr
)
12713 if (node
== 0 || !warn_deprecated_decl
)
12719 attr
= DECL_ATTRIBUTES (node
);
12720 else if (TYPE_P (node
))
12722 tree decl
= TYPE_STUB_DECL (node
);
12724 attr
= lookup_attribute ("deprecated",
12725 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12730 attr
= lookup_attribute ("deprecated", attr
);
12733 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12741 w
= warning (OPT_Wdeprecated_declarations
,
12742 "%qD is deprecated: %s", node
, msg
);
12744 w
= warning (OPT_Wdeprecated_declarations
,
12745 "%qD is deprecated", node
);
12747 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12749 else if (TYPE_P (node
))
12751 tree what
= NULL_TREE
;
12752 tree decl
= TYPE_STUB_DECL (node
);
12754 if (TYPE_NAME (node
))
12756 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12757 what
= TYPE_NAME (node
);
12758 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12759 && DECL_NAME (TYPE_NAME (node
)))
12760 what
= DECL_NAME (TYPE_NAME (node
));
12768 w
= warning (OPT_Wdeprecated_declarations
,
12769 "%qE is deprecated: %s", what
, msg
);
12771 w
= warning (OPT_Wdeprecated_declarations
,
12772 "%qE is deprecated", what
);
12777 w
= warning (OPT_Wdeprecated_declarations
,
12778 "type is deprecated: %s", msg
);
12780 w
= warning (OPT_Wdeprecated_declarations
,
12781 "type is deprecated");
12784 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12791 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12794 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12799 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12802 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12808 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12809 somewhere in it. */
12812 contains_bitfld_component_ref_p (const_tree ref
)
12814 while (handled_component_p (ref
))
12816 if (TREE_CODE (ref
) == COMPONENT_REF
12817 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12819 ref
= TREE_OPERAND (ref
, 0);
12825 /* Try to determine whether a TRY_CATCH expression can fall through.
12826 This is a subroutine of block_may_fallthru. */
12829 try_catch_may_fallthru (const_tree stmt
)
12831 tree_stmt_iterator i
;
12833 /* If the TRY block can fall through, the whole TRY_CATCH can
12835 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12838 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12839 switch (TREE_CODE (tsi_stmt (i
)))
12842 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12843 catch expression and a body. The whole TRY_CATCH may fall
12844 through iff any of the catch bodies falls through. */
12845 for (; !tsi_end_p (i
); tsi_next (&i
))
12847 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12852 case EH_FILTER_EXPR
:
12853 /* The exception filter expression only matters if there is an
12854 exception. If the exception does not match EH_FILTER_TYPES,
12855 we will execute EH_FILTER_FAILURE, and we will fall through
12856 if that falls through. If the exception does match
12857 EH_FILTER_TYPES, the stack unwinder will continue up the
12858 stack, so we will not fall through. We don't know whether we
12859 will throw an exception which matches EH_FILTER_TYPES or not,
12860 so we just ignore EH_FILTER_TYPES and assume that we might
12861 throw an exception which doesn't match. */
12862 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12865 /* This case represents statements to be executed when an
12866 exception occurs. Those statements are implicitly followed
12867 by a RESX statement to resume execution after the exception.
12868 So in this case the TRY_CATCH never falls through. */
12873 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12874 need not be 100% accurate; simply be conservative and return true if we
12875 don't know. This is used only to avoid stupidly generating extra code.
12876 If we're wrong, we'll just delete the extra code later. */
12879 block_may_fallthru (const_tree block
)
12881 /* This CONST_CAST is okay because expr_last returns its argument
12882 unmodified and we assign it to a const_tree. */
12883 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12885 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12889 /* Easy cases. If the last statement of the block implies
12890 control transfer, then we can't fall through. */
12894 /* If SWITCH_LABELS is set, this is lowered, and represents a
12895 branch to a selected label and hence can not fall through.
12896 Otherwise SWITCH_BODY is set, and the switch can fall
12898 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12901 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12903 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12906 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12908 case TRY_CATCH_EXPR
:
12909 return try_catch_may_fallthru (stmt
);
12911 case TRY_FINALLY_EXPR
:
12912 /* The finally clause is always executed after the try clause,
12913 so if it does not fall through, then the try-finally will not
12914 fall through. Otherwise, if the try clause does not fall
12915 through, then when the finally clause falls through it will
12916 resume execution wherever the try clause was going. So the
12917 whole try-finally will only fall through if both the try
12918 clause and the finally clause fall through. */
12919 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12920 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12923 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12924 stmt
= TREE_OPERAND (stmt
, 1);
12930 /* Functions that do not return do not fall through. */
12931 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12933 case CLEANUP_POINT_EXPR
:
12934 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12937 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12943 return lang_hooks
.block_may_fallthru (stmt
);
12947 /* True if we are using EH to handle cleanups. */
12948 static bool using_eh_for_cleanups_flag
= false;
12950 /* This routine is called from front ends to indicate eh should be used for
12953 using_eh_for_cleanups (void)
12955 using_eh_for_cleanups_flag
= true;
12958 /* Query whether EH is used for cleanups. */
12960 using_eh_for_cleanups_p (void)
12962 return using_eh_for_cleanups_flag
;
12965 /* Wrapper for tree_code_name to ensure that tree code is valid */
12967 get_tree_code_name (enum tree_code code
)
12969 const char *invalid
= "<invalid tree code>";
12971 if (code
>= MAX_TREE_CODES
)
12974 return tree_code_name
[code
];
12977 /* Drops the TREE_OVERFLOW flag from T. */
12980 drop_tree_overflow (tree t
)
12982 gcc_checking_assert (TREE_OVERFLOW (t
));
12984 /* For tree codes with a sharing machinery re-build the result. */
12985 if (TREE_CODE (t
) == INTEGER_CST
)
12986 return wide_int_to_tree (TREE_TYPE (t
), t
);
12988 /* Otherwise, as all tcc_constants are possibly shared, copy the node
12989 and drop the flag. */
12991 TREE_OVERFLOW (t
) = 0;
12995 /* Given a memory reference expression T, return its base address.
12996 The base address of a memory reference expression is the main
12997 object being referenced. For instance, the base address for
12998 'array[i].fld[j]' is 'array'. You can think of this as stripping
12999 away the offset part from a memory address.
13001 This function calls handled_component_p to strip away all the inner
13002 parts of the memory reference until it reaches the base object. */
13005 get_base_address (tree t
)
13007 while (handled_component_p (t
))
13008 t
= TREE_OPERAND (t
, 0);
13010 if ((TREE_CODE (t
) == MEM_REF
13011 || TREE_CODE (t
) == TARGET_MEM_REF
)
13012 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13013 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13015 /* ??? Either the alias oracle or all callers need to properly deal
13016 with WITH_SIZE_EXPRs before we can look through those. */
13017 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13023 /* Return a tree of sizetype representing the size, in bytes, of the element
13024 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13027 array_ref_element_size (tree exp
)
13029 tree aligned_size
= TREE_OPERAND (exp
, 3);
13030 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13031 location_t loc
= EXPR_LOCATION (exp
);
13033 /* If a size was specified in the ARRAY_REF, it's the size measured
13034 in alignment units of the element type. So multiply by that value. */
13037 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13038 sizetype from another type of the same width and signedness. */
13039 if (TREE_TYPE (aligned_size
) != sizetype
)
13040 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13041 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13042 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13045 /* Otherwise, take the size from that of the element type. Substitute
13046 any PLACEHOLDER_EXPR that we have. */
13048 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13051 /* Return a tree representing the lower bound of the array mentioned in
13052 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13055 array_ref_low_bound (tree exp
)
13057 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13059 /* If a lower bound is specified in EXP, use it. */
13060 if (TREE_OPERAND (exp
, 2))
13061 return TREE_OPERAND (exp
, 2);
13063 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13064 substituting for a PLACEHOLDER_EXPR as needed. */
13065 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13066 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13068 /* Otherwise, return a zero of the appropriate type. */
13069 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13072 /* Return a tree representing the upper bound of the array mentioned in
13073 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13076 array_ref_up_bound (tree exp
)
13078 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13080 /* If there is a domain type and it has an upper bound, use it, substituting
13081 for a PLACEHOLDER_EXPR as needed. */
13082 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13083 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13085 /* Otherwise fail. */
13089 /* Returns true if REF is an array reference to an array at the end of
13090 a structure. If this is the case, the array may be allocated larger
13091 than its upper bound implies. */
13094 array_at_struct_end_p (tree ref
)
13096 if (TREE_CODE (ref
) != ARRAY_REF
13097 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
13100 while (handled_component_p (ref
))
13102 /* If the reference chain contains a component reference to a
13103 non-union type and there follows another field the reference
13104 is not at the end of a structure. */
13105 if (TREE_CODE (ref
) == COMPONENT_REF
13106 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13108 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13109 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13110 nextf
= DECL_CHAIN (nextf
);
13115 ref
= TREE_OPERAND (ref
, 0);
13120 if (TREE_CODE (ref
) == MEM_REF
13121 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13123 size
= TYPE_SIZE (TREE_TYPE (ref
));
13124 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13127 /* If the reference is based on a declared entity, the size of the array
13128 is constrained by its given domain. (Do not trust commons PR/69368). */
13130 /* Be sure the size of MEM_REF target match. For example:
13133 struct foo *str = (struct foo *)&buf;
13135 str->trailin_array[2] = 1;
13137 is valid because BUF allocate enough space. */
13139 && (!size
|| (DECL_SIZE (ref
) != NULL
13140 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13141 && !(flag_unconstrained_commons
13142 && TREE_CODE (ref
) == VAR_DECL
&& DECL_COMMON (ref
)))
13148 /* Return a tree representing the offset, in bytes, of the field referenced
13149 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13152 component_ref_field_offset (tree exp
)
13154 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13155 tree field
= TREE_OPERAND (exp
, 1);
13156 location_t loc
= EXPR_LOCATION (exp
);
13158 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13159 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13161 if (aligned_offset
)
13163 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13164 sizetype from another type of the same width and signedness. */
13165 if (TREE_TYPE (aligned_offset
) != sizetype
)
13166 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13167 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13168 size_int (DECL_OFFSET_ALIGN (field
)
13172 /* Otherwise, take the offset from that of the field. Substitute
13173 any PLACEHOLDER_EXPR that we have. */
13175 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13178 /* Return the machine mode of T. For vectors, returns the mode of the
13179 inner type. The main use case is to feed the result to HONOR_NANS,
13180 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13183 element_mode (const_tree t
)
13187 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13189 return TYPE_MODE (t
);
13193 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13194 TV. TV should be the more specified variant (i.e. the main variant). */
13197 verify_type_variant (const_tree t
, tree tv
)
13199 /* Type variant can differ by:
13201 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13202 ENCODE_QUAL_ADDR_SPACE.
13203 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13204 in this case some values may not be set in the variant types
13205 (see TYPE_COMPLETE_P checks).
13206 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13207 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13208 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13209 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13210 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13211 this is necessary to make it possible to merge types form different TUs
13212 - arrays, pointers and references may have TREE_TYPE that is a variant
13213 of TREE_TYPE of their main variants.
13214 - aggregates may have new TYPE_FIELDS list that list variants of
13215 the main variant TYPE_FIELDS.
13216 - vector types may differ by TYPE_VECTOR_OPAQUE
13217 - TYPE_METHODS is always NULL for vairant types and maintained for
13221 /* Convenience macro for matching individual fields. */
13222 #define verify_variant_match(flag) \
13224 if (flag (tv) != flag (t)) \
13226 error ("type variant differs by " #flag "."); \
13232 /* tree_base checks. */
13234 verify_variant_match (TREE_CODE
);
13235 /* FIXME: Ada builds non-artificial variants of artificial types. */
13236 if (TYPE_ARTIFICIAL (tv
) && 0)
13237 verify_variant_match (TYPE_ARTIFICIAL
);
13238 if (POINTER_TYPE_P (tv
))
13239 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13240 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13241 verify_variant_match (TYPE_UNSIGNED
);
13242 verify_variant_match (TYPE_PACKED
);
13243 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13244 verify_variant_match (TYPE_REF_IS_RVALUE
);
13245 if (AGGREGATE_TYPE_P (t
))
13246 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13248 verify_variant_match (TYPE_SATURATING
);
13249 /* FIXME: This check trigger during libstdc++ build. */
13250 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13251 verify_variant_match (TYPE_FINAL_P
);
13253 /* tree_type_common checks. */
13255 if (COMPLETE_TYPE_P (t
))
13257 verify_variant_match (TYPE_MODE
);
13258 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13259 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13260 verify_variant_match (TYPE_SIZE
);
13261 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13262 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13263 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
13264 /* FIXME: ideally we should compare pointer equality, but java FE
13265 produce variants where size is INTEGER_CST of different type (int
13266 wrt size_type) during libjava biuld. */
13267 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
13269 error ("type variant has different TYPE_SIZE_UNIT");
13271 error ("type variant's TYPE_SIZE_UNIT");
13272 debug_tree (TYPE_SIZE_UNIT (tv
));
13273 error ("type's TYPE_SIZE_UNIT");
13274 debug_tree (TYPE_SIZE_UNIT (t
));
13278 verify_variant_match (TYPE_PRECISION
);
13279 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13280 if (RECORD_OR_UNION_TYPE_P (t
))
13281 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13282 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13283 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13284 /* During LTO we merge variant lists from diferent translation units
13285 that may differ BY TYPE_CONTEXT that in turn may point
13286 to TRANSLATION_UNIT_DECL.
13287 Ada also builds variants of types with different TYPE_CONTEXT. */
13288 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13289 verify_variant_match (TYPE_CONTEXT
);
13290 verify_variant_match (TYPE_STRING_FLAG
);
13291 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13293 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13298 /* tree_type_non_common checks. */
13300 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13301 and dangle the pointer from time to time. */
13302 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13303 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13304 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13306 error ("type variant has different TYPE_VFIELD");
13310 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13311 || TREE_CODE (t
) == INTEGER_TYPE
13312 || TREE_CODE (t
) == BOOLEAN_TYPE
13313 || TREE_CODE (t
) == REAL_TYPE
13314 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13316 verify_variant_match (TYPE_MAX_VALUE
);
13317 verify_variant_match (TYPE_MIN_VALUE
);
13319 if (TREE_CODE (t
) == METHOD_TYPE
)
13320 verify_variant_match (TYPE_METHOD_BASETYPE
);
13321 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13323 error ("type variant has TYPE_METHODS");
13327 if (TREE_CODE (t
) == OFFSET_TYPE
)
13328 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13329 if (TREE_CODE (t
) == ARRAY_TYPE
)
13330 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13331 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13332 or even type's main variant. This is needed to make bootstrap pass
13333 and the bug seems new in GCC 5.
13334 C++ FE should be updated to make this consistent and we should check
13335 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13336 is a match with main variant.
13338 Also disable the check for Java for now because of parser hack that builds
13339 first an dummy BINFO and then sometimes replace it by real BINFO in some
13341 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13342 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13343 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13344 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13345 at LTO time only. */
13346 && (in_lto_p
&& odr_type_p (t
)))
13348 error ("type variant has different TYPE_BINFO");
13350 error ("type variant's TYPE_BINFO");
13351 debug_tree (TYPE_BINFO (tv
));
13352 error ("type's TYPE_BINFO");
13353 debug_tree (TYPE_BINFO (t
));
13357 /* Check various uses of TYPE_VALUES_RAW. */
13358 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13359 verify_variant_match (TYPE_VALUES
);
13360 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13361 verify_variant_match (TYPE_DOMAIN
);
13362 /* Permit incomplete variants of complete type. While FEs may complete
13363 all variants, this does not happen for C++ templates in all cases. */
13364 else if (RECORD_OR_UNION_TYPE_P (t
)
13365 && COMPLETE_TYPE_P (t
)
13366 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13370 /* Fortran builds qualified variants as new records with items of
13371 qualified type. Verify that they looks same. */
13372 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13374 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13375 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13376 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13377 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13378 /* FIXME: gfc_nonrestricted_type builds all types as variants
13379 with exception of pointer types. It deeply copies the type
13380 which means that we may end up with a variant type
13381 referring non-variant pointer. We may change it to
13382 produce types as variants, too, like
13383 objc_get_protocol_qualified_type does. */
13384 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13385 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13386 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13390 error ("type variant has different TYPE_FIELDS");
13392 error ("first mismatch is field");
13394 error ("and field");
13399 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13400 verify_variant_match (TYPE_ARG_TYPES
);
13401 /* For C++ the qualified variant of array type is really an array type
13402 of qualified TREE_TYPE.
13403 objc builds variants of pointer where pointer to type is a variant, too
13404 in objc_get_protocol_qualified_type. */
13405 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13406 && ((TREE_CODE (t
) != ARRAY_TYPE
13407 && !POINTER_TYPE_P (t
))
13408 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13409 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13411 error ("type variant has different TREE_TYPE");
13413 error ("type variant's TREE_TYPE");
13414 debug_tree (TREE_TYPE (tv
));
13415 error ("type's TREE_TYPE");
13416 debug_tree (TREE_TYPE (t
));
13419 if (type_with_alias_set_p (t
)
13420 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13422 error ("type is not compatible with its vairant");
13424 error ("type variant's TREE_TYPE");
13425 debug_tree (TREE_TYPE (tv
));
13426 error ("type's TREE_TYPE");
13427 debug_tree (TREE_TYPE (t
));
13431 #undef verify_variant_match
13435 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13436 the middle-end types_compatible_p function. It needs to avoid
13437 claiming types are different for types that should be treated
13438 the same with respect to TBAA. Canonical types are also used
13439 for IL consistency checks via the useless_type_conversion_p
13440 predicate which does not handle all type kinds itself but falls
13441 back to pointer-comparison of TYPE_CANONICAL for aggregates
13444 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13445 type calculation because we need to allow inter-operability between signed
13446 and unsigned variants. */
13449 type_with_interoperable_signedness (const_tree type
)
13451 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13452 signed char and unsigned char. Similarly fortran FE builds
13453 C_SIZE_T as signed type, while C defines it unsigned. */
13455 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13457 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13458 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13461 /* Return true iff T1 and T2 are structurally identical for what
13463 This function is used both by lto.c canonical type merging and by the
13464 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13465 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13466 only for LTO because only in these cases TYPE_CANONICAL equivalence
13467 correspond to one defined by gimple_canonical_types_compatible_p. */
13470 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13471 bool trust_type_canonical
)
13473 /* Type variants should be same as the main variant. When not doing sanity
13474 checking to verify this fact, go to main variants and save some work. */
13475 if (trust_type_canonical
)
13477 t1
= TYPE_MAIN_VARIANT (t1
);
13478 t2
= TYPE_MAIN_VARIANT (t2
);
13481 /* Check first for the obvious case of pointer identity. */
13485 /* Check that we have two types to compare. */
13486 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13489 /* We consider complete types always compatible with incomplete type.
13490 This does not make sense for canonical type calculation and thus we
13491 need to ensure that we are never called on it.
13493 FIXME: For more correctness the function probably should have three modes
13494 1) mode assuming that types are complete mathcing their structure
13495 2) mode allowing incomplete types but producing equivalence classes
13496 and thus ignoring all info from complete types
13497 3) mode allowing incomplete types to match complete but checking
13498 compatibility between complete types.
13500 1 and 2 can be used for canonical type calculation. 3 is the real
13501 definition of type compatibility that can be used i.e. for warnings during
13502 declaration merging. */
13504 gcc_assert (!trust_type_canonical
13505 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13506 /* If the types have been previously registered and found equal
13509 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13510 && trust_type_canonical
)
13512 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13513 they are always NULL, but they are set to non-NULL for types
13514 constructed by build_pointer_type and variants. In this case the
13515 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13516 all pointers are considered equal. Be sure to not return false
13518 gcc_checking_assert (canonical_type_used_p (t1
)
13519 && canonical_type_used_p (t2
));
13520 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13523 /* Can't be the same type if the types don't have the same code. */
13524 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13525 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13528 /* Qualifiers do not matter for canonical type comparison purposes. */
13530 /* Void types and nullptr types are always the same. */
13531 if (TREE_CODE (t1
) == VOID_TYPE
13532 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13535 /* Can't be the same type if they have different mode. */
13536 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13539 /* Non-aggregate types can be handled cheaply. */
13540 if (INTEGRAL_TYPE_P (t1
)
13541 || SCALAR_FLOAT_TYPE_P (t1
)
13542 || FIXED_POINT_TYPE_P (t1
)
13543 || TREE_CODE (t1
) == VECTOR_TYPE
13544 || TREE_CODE (t1
) == COMPLEX_TYPE
13545 || TREE_CODE (t1
) == OFFSET_TYPE
13546 || POINTER_TYPE_P (t1
))
13548 /* Can't be the same type if they have different recision. */
13549 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13552 /* In some cases the signed and unsigned types are required to be
13554 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13555 && !type_with_interoperable_signedness (t1
))
13558 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13559 interoperable with "signed char". Unless all frontends are revisited
13560 to agree on these types, we must ignore the flag completely. */
13562 /* Fortran standard define C_PTR type that is compatible with every
13563 C pointer. For this reason we need to glob all pointers into one.
13564 Still pointers in different address spaces are not compatible. */
13565 if (POINTER_TYPE_P (t1
))
13567 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13568 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13572 /* Tail-recurse to components. */
13573 if (TREE_CODE (t1
) == VECTOR_TYPE
13574 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13575 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13577 trust_type_canonical
);
13582 /* Do type-specific comparisons. */
13583 switch (TREE_CODE (t1
))
13586 /* Array types are the same if the element types are the same and
13587 the number of elements are the same. */
13588 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13589 trust_type_canonical
)
13590 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13591 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13592 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13596 tree i1
= TYPE_DOMAIN (t1
);
13597 tree i2
= TYPE_DOMAIN (t2
);
13599 /* For an incomplete external array, the type domain can be
13600 NULL_TREE. Check this condition also. */
13601 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13603 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13607 tree min1
= TYPE_MIN_VALUE (i1
);
13608 tree min2
= TYPE_MIN_VALUE (i2
);
13609 tree max1
= TYPE_MAX_VALUE (i1
);
13610 tree max2
= TYPE_MAX_VALUE (i2
);
13612 /* The minimum/maximum values have to be the same. */
13615 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13616 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13617 || operand_equal_p (min1
, min2
, 0))))
13620 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13621 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13622 || operand_equal_p (max1
, max2
, 0)))))
13630 case FUNCTION_TYPE
:
13631 /* Function types are the same if the return type and arguments types
13633 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13634 trust_type_canonical
))
13637 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13641 tree parms1
, parms2
;
13643 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13645 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13647 if (!gimple_canonical_types_compatible_p
13648 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13649 trust_type_canonical
))
13653 if (parms1
|| parms2
)
13661 case QUAL_UNION_TYPE
:
13665 /* Don't try to compare variants of an incomplete type, before
13666 TYPE_FIELDS has been copied around. */
13667 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13671 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13674 /* For aggregate types, all the fields must be the same. */
13675 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13677 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13679 /* Skip non-fields. */
13680 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13681 f1
= TREE_CHAIN (f1
);
13682 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13683 f2
= TREE_CHAIN (f2
);
13686 /* The fields must have the same name, offset and type. */
13687 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13688 || !gimple_compare_field_offset (f1
, f2
)
13689 || !gimple_canonical_types_compatible_p
13690 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13691 trust_type_canonical
))
13695 /* If one aggregate has more fields than the other, they
13696 are not the same. */
13704 /* Consider all types with language specific trees in them mutually
13705 compatible. This is executed only from verify_type and false
13706 positives can be tolerated. */
13707 gcc_assert (!in_lto_p
);
13712 /* Verify type T. */
13715 verify_type (const_tree t
)
13717 bool error_found
= false;
13718 tree mv
= TYPE_MAIN_VARIANT (t
);
13721 error ("Main variant is not defined");
13722 error_found
= true;
13724 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13726 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13728 error_found
= true;
13730 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13731 error_found
= true;
13733 tree ct
= TYPE_CANONICAL (t
);
13736 else if (TYPE_CANONICAL (t
) != ct
)
13738 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13740 error_found
= true;
13742 /* Method and function types can not be used to address memory and thus
13743 TYPE_CANONICAL really matters only for determining useless conversions.
13745 FIXME: C++ FE produce declarations of builtin functions that are not
13746 compatible with main variants. */
13747 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13750 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13751 with variably sized arrays because their sizes possibly
13752 gimplified to different variables. */
13753 && !variably_modified_type_p (ct
, NULL
)
13754 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13756 error ("TYPE_CANONICAL is not compatible");
13758 error_found
= true;
13761 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13762 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13764 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13766 error_found
= true;
13768 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13769 FUNCTION_*_QUALIFIED flags are set. */
13770 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13772 error ("TYPE_CANONICAL of main variant is not main variant");
13774 debug_tree (TYPE_MAIN_VARIANT (ct
));
13775 error_found
= true;
13779 /* Check various uses of TYPE_MINVAL. */
13780 if (RECORD_OR_UNION_TYPE_P (t
))
13782 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13783 and danagle the pointer from time to time. */
13784 if (TYPE_VFIELD (t
)
13785 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13786 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13788 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13789 debug_tree (TYPE_VFIELD (t
));
13790 error_found
= true;
13793 else if (TREE_CODE (t
) == POINTER_TYPE
)
13795 if (TYPE_NEXT_PTR_TO (t
)
13796 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13798 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13799 debug_tree (TYPE_NEXT_PTR_TO (t
));
13800 error_found
= true;
13803 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13805 if (TYPE_NEXT_REF_TO (t
)
13806 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13808 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13809 debug_tree (TYPE_NEXT_REF_TO (t
));
13810 error_found
= true;
13813 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13814 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13816 /* FIXME: The following check should pass:
13817 useless_type_conversion_p (const_cast <tree> (t),
13818 TREE_TYPE (TYPE_MIN_VALUE (t))
13819 but does not for C sizetypes in LTO. */
13821 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13822 else if (TYPE_MINVAL (t
)
13823 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13826 error ("TYPE_MINVAL non-NULL");
13827 debug_tree (TYPE_MINVAL (t
));
13828 error_found
= true;
13831 /* Check various uses of TYPE_MAXVAL. */
13832 if (RECORD_OR_UNION_TYPE_P (t
))
13834 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13835 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13836 && TYPE_METHODS (t
) != error_mark_node
)
13838 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13839 debug_tree (TYPE_METHODS (t
));
13840 error_found
= true;
13843 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13845 if (TYPE_METHOD_BASETYPE (t
)
13846 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13847 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13849 error ("TYPE_METHOD_BASETYPE is not record nor union");
13850 debug_tree (TYPE_METHOD_BASETYPE (t
));
13851 error_found
= true;
13854 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13856 if (TYPE_OFFSET_BASETYPE (t
)
13857 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13858 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13860 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13861 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13862 error_found
= true;
13865 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13866 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13868 /* FIXME: The following check should pass:
13869 useless_type_conversion_p (const_cast <tree> (t),
13870 TREE_TYPE (TYPE_MAX_VALUE (t))
13871 but does not for C sizetypes in LTO. */
13873 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13875 if (TYPE_ARRAY_MAX_SIZE (t
)
13876 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13878 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13879 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13880 error_found
= true;
13883 else if (TYPE_MAXVAL (t
))
13885 error ("TYPE_MAXVAL non-NULL");
13886 debug_tree (TYPE_MAXVAL (t
));
13887 error_found
= true;
13890 /* Check various uses of TYPE_BINFO. */
13891 if (RECORD_OR_UNION_TYPE_P (t
))
13893 if (!TYPE_BINFO (t
))
13895 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13897 error ("TYPE_BINFO is not TREE_BINFO");
13898 debug_tree (TYPE_BINFO (t
));
13899 error_found
= true;
13901 /* FIXME: Java builds invalid empty binfos that do not have
13903 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13905 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13906 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13907 error_found
= true;
13910 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13912 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13913 debug_tree (TYPE_LANG_SLOT_1 (t
));
13914 error_found
= true;
13917 /* Check various uses of TYPE_VALUES_RAW. */
13918 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13919 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13921 tree value
= TREE_VALUE (l
);
13922 tree name
= TREE_PURPOSE (l
);
13924 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13925 CONST_DECL of ENUMERAL TYPE. */
13926 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13928 error ("Enum value is not CONST_DECL or INTEGER_CST");
13929 debug_tree (value
);
13931 error_found
= true;
13933 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13934 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13936 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13937 debug_tree (value
);
13939 error_found
= true;
13941 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13943 error ("Enum value name is not IDENTIFIER_NODE");
13944 debug_tree (value
);
13946 error_found
= true;
13949 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13951 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13953 error ("Array TYPE_DOMAIN is not integer type");
13954 debug_tree (TYPE_DOMAIN (t
));
13955 error_found
= true;
13958 else if (RECORD_OR_UNION_TYPE_P (t
))
13960 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13962 error ("TYPE_FIELDS defined in incomplete type");
13963 error_found
= true;
13965 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13967 /* TODO: verify properties of decls. */
13968 if (TREE_CODE (fld
) == FIELD_DECL
)
13970 else if (TREE_CODE (fld
) == TYPE_DECL
)
13972 else if (TREE_CODE (fld
) == CONST_DECL
)
13974 else if (TREE_CODE (fld
) == VAR_DECL
)
13976 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13978 else if (TREE_CODE (fld
) == USING_DECL
)
13982 error ("Wrong tree in TYPE_FIELDS list");
13984 error_found
= true;
13988 else if (TREE_CODE (t
) == INTEGER_TYPE
13989 || TREE_CODE (t
) == BOOLEAN_TYPE
13990 || TREE_CODE (t
) == OFFSET_TYPE
13991 || TREE_CODE (t
) == REFERENCE_TYPE
13992 || TREE_CODE (t
) == NULLPTR_TYPE
13993 || TREE_CODE (t
) == POINTER_TYPE
)
13995 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
13997 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
13998 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
13999 error_found
= true;
14001 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14003 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14004 debug_tree (TYPE_CACHED_VALUES (t
));
14005 error_found
= true;
14007 /* Verify just enough of cache to ensure that no one copied it to new type.
14008 All copying should go by copy_node that should clear it. */
14009 else if (TYPE_CACHED_VALUES_P (t
))
14012 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14013 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14014 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14016 error ("wrong TYPE_CACHED_VALUES entry");
14017 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14018 error_found
= true;
14023 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14024 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14026 /* C++ FE uses TREE_PURPOSE to store initial values. */
14027 if (TREE_PURPOSE (l
) && in_lto_p
)
14029 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14031 error_found
= true;
14033 if (!TYPE_P (TREE_VALUE (l
)))
14035 error ("Wrong entry in TYPE_ARG_TYPES list");
14037 error_found
= true;
14040 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14042 error ("TYPE_VALUES_RAW field is non-NULL");
14043 debug_tree (TYPE_VALUES_RAW (t
));
14044 error_found
= true;
14046 if (TREE_CODE (t
) != INTEGER_TYPE
14047 && TREE_CODE (t
) != BOOLEAN_TYPE
14048 && TREE_CODE (t
) != OFFSET_TYPE
14049 && TREE_CODE (t
) != REFERENCE_TYPE
14050 && TREE_CODE (t
) != NULLPTR_TYPE
14051 && TREE_CODE (t
) != POINTER_TYPE
14052 && TYPE_CACHED_VALUES_P (t
))
14054 error ("TYPE_CACHED_VALUES_P is set while it should not");
14055 error_found
= true;
14057 if (TYPE_STRING_FLAG (t
)
14058 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14060 error ("TYPE_STRING_FLAG is set on wrong type code");
14061 error_found
= true;
14063 else if (TYPE_STRING_FLAG (t
))
14066 if (TREE_CODE (b
) == ARRAY_TYPE
)
14068 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
14070 if (TREE_CODE (b
) != INTEGER_TYPE
)
14072 error ("TYPE_STRING_FLAG is set on type that does not look like "
14073 "char nor array of chars");
14074 error_found
= true;
14078 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14079 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14081 if (TREE_CODE (t
) == METHOD_TYPE
14082 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14084 error ("TYPE_METHOD_BASETYPE is not main variant");
14085 error_found
= true;
14090 debug_tree (const_cast <tree
> (t
));
14091 internal_error ("verify_type failed");
14096 /* Return true if ARG is marked with the nonnull attribute in the
14097 current function signature. */
14100 nonnull_arg_p (const_tree arg
)
14102 tree t
, attrs
, fntype
;
14103 unsigned HOST_WIDE_INT arg_num
;
14105 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14106 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14107 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14109 /* The static chain decl is always non null. */
14110 if (arg
== cfun
->static_chain_decl
)
14113 /* THIS argument of method is always non-NULL. */
14114 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14115 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14116 && flag_delete_null_pointer_checks
)
14119 /* Values passed by reference are always non-NULL. */
14120 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14121 && flag_delete_null_pointer_checks
)
14124 fntype
= TREE_TYPE (cfun
->decl
);
14125 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14127 attrs
= lookup_attribute ("nonnull", attrs
);
14129 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14130 if (attrs
== NULL_TREE
)
14133 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14134 if (TREE_VALUE (attrs
) == NULL_TREE
)
14137 /* Get the position number for ARG in the function signature. */
14138 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14140 t
= DECL_CHAIN (t
), arg_num
++)
14146 gcc_assert (t
== arg
);
14148 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14149 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14151 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14159 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14163 set_block (location_t loc
, tree block
)
14165 location_t pure_loc
= get_pure_location (loc
);
14166 source_range src_range
= get_range_from_loc (line_table
, loc
);
14167 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14171 set_source_range (tree expr
, location_t start
, location_t finish
)
14173 source_range src_range
;
14174 src_range
.m_start
= start
;
14175 src_range
.m_finish
= finish
;
14176 return set_source_range (expr
, src_range
);
14180 set_source_range (tree expr
, source_range src_range
)
14182 if (!EXPR_P (expr
))
14183 return UNKNOWN_LOCATION
;
14185 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14186 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14190 SET_EXPR_LOCATION (expr
, adhoc
);
14194 /* Return the name of combined function FN, for debugging purposes. */
14197 combined_fn_name (combined_fn fn
)
14199 if (builtin_fn_p (fn
))
14201 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14202 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14205 return internal_fn_name (as_internal_fn (fn
));
14210 namespace selftest
{
14212 /* Selftests for tree. */
14214 /* Verify that integer constants are sane. */
14217 test_integer_constants ()
14219 ASSERT_TRUE (integer_type_node
!= NULL
);
14220 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14222 tree type
= integer_type_node
;
14224 tree zero
= build_zero_cst (type
);
14225 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14226 ASSERT_EQ (type
, TREE_TYPE (zero
));
14228 tree one
= build_int_cst (type
, 1);
14229 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14230 ASSERT_EQ (type
, TREE_TYPE (zero
));
14233 /* Verify identifiers. */
14236 test_identifiers ()
14238 tree identifier
= get_identifier ("foo");
14239 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14240 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14243 /* Verify LABEL_DECL. */
14248 tree identifier
= get_identifier ("err");
14249 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14250 identifier
, void_type_node
);
14251 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14252 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14255 /* Run all of the selftests within this file. */
14260 test_integer_constants ();
14261 test_identifiers ();
14265 } // namespace selftest
14267 #endif /* CHECKING_P */
14269 #include "gt-tree.h"