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 (VAR_P (node
))
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_ALIGNMENT (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
|| VAR_P (node
))
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. */
1168 DECL_HAS_DEBUG_EXPR_P (t
) = 0;
1169 t
->decl_with_vis
.symtab_node
= NULL
;
1171 if (VAR_P (node
) && 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 (!VAR_OR_FUNCTION_DECL_P (decl
))
5336 /* If DECL already has its assembler name set, it does not need a
5338 if (!HAS_DECL_ASSEMBLER_NAME_P (decl
)
5339 || DECL_ASSEMBLER_NAME_SET_P (decl
))
5342 /* Abstract decls do not need an assembler name. */
5343 if (DECL_ABSTRACT_P (decl
))
5346 /* For VAR_DECLs, only static, public and external symbols need an
5349 && !TREE_STATIC (decl
)
5350 && !TREE_PUBLIC (decl
)
5351 && !DECL_EXTERNAL (decl
))
5354 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5356 /* Do not set assembler name on builtins. Allow RTL expansion to
5357 decide whether to expand inline or via a regular call. */
5358 if (DECL_BUILT_IN (decl
)
5359 && DECL_BUILT_IN_CLASS (decl
) != BUILT_IN_FRONTEND
)
5362 /* Functions represented in the callgraph need an assembler name. */
5363 if (cgraph_node::get (decl
) != NULL
)
5366 /* Unused and not public functions don't need an assembler name. */
5367 if (!TREE_USED (decl
) && !TREE_PUBLIC (decl
))
5375 /* Reset all language specific information still present in symbol
5379 free_lang_data_in_decl (tree decl
)
5381 gcc_assert (DECL_P (decl
));
5383 /* Give the FE a chance to remove its own data first. */
5384 lang_hooks
.free_lang_data (decl
);
5386 TREE_LANG_FLAG_0 (decl
) = 0;
5387 TREE_LANG_FLAG_1 (decl
) = 0;
5388 TREE_LANG_FLAG_2 (decl
) = 0;
5389 TREE_LANG_FLAG_3 (decl
) = 0;
5390 TREE_LANG_FLAG_4 (decl
) = 0;
5391 TREE_LANG_FLAG_5 (decl
) = 0;
5392 TREE_LANG_FLAG_6 (decl
) = 0;
5394 free_lang_data_in_one_sizepos (&DECL_SIZE (decl
));
5395 free_lang_data_in_one_sizepos (&DECL_SIZE_UNIT (decl
));
5396 if (TREE_CODE (decl
) == FIELD_DECL
)
5398 free_lang_data_in_one_sizepos (&DECL_FIELD_OFFSET (decl
));
5399 if (TREE_CODE (DECL_CONTEXT (decl
)) == QUAL_UNION_TYPE
)
5400 DECL_QUALIFIER (decl
) = NULL_TREE
;
5403 if (TREE_CODE (decl
) == FUNCTION_DECL
)
5405 struct cgraph_node
*node
;
5406 if (!(node
= cgraph_node::get (decl
))
5407 || (!node
->definition
&& !node
->clones
))
5410 node
->release_body ();
5413 release_function_body (decl
);
5414 DECL_ARGUMENTS (decl
) = NULL
;
5415 DECL_RESULT (decl
) = NULL
;
5416 DECL_INITIAL (decl
) = error_mark_node
;
5419 if (gimple_has_body_p (decl
) || (node
&& node
->thunk
.thunk_p
))
5423 /* If DECL has a gimple body, then the context for its
5424 arguments must be DECL. Otherwise, it doesn't really
5425 matter, as we will not be emitting any code for DECL. In
5426 general, there may be other instances of DECL created by
5427 the front end and since PARM_DECLs are generally shared,
5428 their DECL_CONTEXT changes as the replicas of DECL are
5429 created. The only time where DECL_CONTEXT is important
5430 is for the FUNCTION_DECLs that have a gimple body (since
5431 the PARM_DECL will be used in the function's body). */
5432 for (t
= DECL_ARGUMENTS (decl
); t
; t
= TREE_CHAIN (t
))
5433 DECL_CONTEXT (t
) = decl
;
5434 if (!DECL_FUNCTION_SPECIFIC_TARGET (decl
))
5435 DECL_FUNCTION_SPECIFIC_TARGET (decl
)
5436 = target_option_default_node
;
5437 if (!DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
))
5438 DECL_FUNCTION_SPECIFIC_OPTIMIZATION (decl
)
5439 = optimization_default_node
;
5442 /* DECL_SAVED_TREE holds the GENERIC representation for DECL.
5443 At this point, it is not needed anymore. */
5444 DECL_SAVED_TREE (decl
) = NULL_TREE
;
5446 /* Clear the abstract origin if it refers to a method. Otherwise
5447 dwarf2out.c will ICE as we clear TYPE_METHODS and thus the
5448 origin will not be output correctly. */
5449 if (DECL_ABSTRACT_ORIGIN (decl
)
5450 && DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))
5451 && RECORD_OR_UNION_TYPE_P
5452 (DECL_CONTEXT (DECL_ABSTRACT_ORIGIN (decl
))))
5453 DECL_ABSTRACT_ORIGIN (decl
) = NULL_TREE
;
5455 /* Sometimes the C++ frontend doesn't manage to transform a temporary
5456 DECL_VINDEX referring to itself into a vtable slot number as it
5457 should. Happens with functions that are copied and then forgotten
5458 about. Just clear it, it won't matter anymore. */
5459 if (DECL_VINDEX (decl
) && !tree_fits_shwi_p (DECL_VINDEX (decl
)))
5460 DECL_VINDEX (decl
) = NULL_TREE
;
5462 else if (VAR_P (decl
))
5464 if ((DECL_EXTERNAL (decl
)
5465 && (!TREE_STATIC (decl
) || !TREE_READONLY (decl
)))
5466 || (decl_function_context (decl
) && !TREE_STATIC (decl
)))
5467 DECL_INITIAL (decl
) = NULL_TREE
;
5469 else if (TREE_CODE (decl
) == TYPE_DECL
)
5471 DECL_VISIBILITY (decl
) = VISIBILITY_DEFAULT
;
5472 DECL_VISIBILITY_SPECIFIED (decl
) = 0;
5473 DECL_INITIAL (decl
) = NULL_TREE
;
5475 else if (TREE_CODE (decl
) == FIELD_DECL
)
5476 DECL_INITIAL (decl
) = NULL_TREE
;
5477 else if (TREE_CODE (decl
) == TRANSLATION_UNIT_DECL
5478 && DECL_INITIAL (decl
)
5479 && TREE_CODE (DECL_INITIAL (decl
)) == BLOCK
)
5481 /* Strip builtins from the translation-unit BLOCK. We still have targets
5482 without builtin_decl_explicit support and also builtins are shared
5483 nodes and thus we can't use TREE_CHAIN in multiple lists. */
5484 tree
*nextp
= &BLOCK_VARS (DECL_INITIAL (decl
));
5488 if (TREE_CODE (var
) == FUNCTION_DECL
5489 && DECL_BUILT_IN (var
))
5490 *nextp
= TREE_CHAIN (var
);
5492 nextp
= &TREE_CHAIN (var
);
5498 /* Data used when collecting DECLs and TYPEs for language data removal. */
5500 struct free_lang_data_d
5502 free_lang_data_d () : decls (100), types (100) {}
5504 /* Worklist to avoid excessive recursion. */
5505 auto_vec
<tree
> worklist
;
5507 /* Set of traversed objects. Used to avoid duplicate visits. */
5508 hash_set
<tree
> pset
;
5510 /* Array of symbols to process with free_lang_data_in_decl. */
5511 auto_vec
<tree
> decls
;
5513 /* Array of types to process with free_lang_data_in_type. */
5514 auto_vec
<tree
> types
;
5518 /* Save all language fields needed to generate proper debug information
5519 for DECL. This saves most fields cleared out by free_lang_data_in_decl. */
5522 save_debug_info_for_decl (tree t
)
5524 /*struct saved_debug_info_d *sdi;*/
5526 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& DECL_P (t
));
5528 /* FIXME. Partial implementation for saving debug info removed. */
5532 /* Save all language fields needed to generate proper debug information
5533 for TYPE. This saves most fields cleared out by free_lang_data_in_type. */
5536 save_debug_info_for_type (tree t
)
5538 /*struct saved_debug_info_d *sdi;*/
5540 gcc_assert (debug_info_level
> DINFO_LEVEL_TERSE
&& t
&& TYPE_P (t
));
5542 /* FIXME. Partial implementation for saving debug info removed. */
5546 /* Add type or decl T to one of the list of tree nodes that need their
5547 language data removed. The lists are held inside FLD. */
5550 add_tree_to_fld_list (tree t
, struct free_lang_data_d
*fld
)
5554 fld
->decls
.safe_push (t
);
5555 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5556 save_debug_info_for_decl (t
);
5558 else if (TYPE_P (t
))
5560 fld
->types
.safe_push (t
);
5561 if (debug_info_level
> DINFO_LEVEL_TERSE
)
5562 save_debug_info_for_type (t
);
5568 /* Push tree node T into FLD->WORKLIST. */
5571 fld_worklist_push (tree t
, struct free_lang_data_d
*fld
)
5573 if (t
&& !is_lang_specific (t
) && !fld
->pset
.contains (t
))
5574 fld
->worklist
.safe_push ((t
));
5578 /* Operand callback helper for free_lang_data_in_node. *TP is the
5579 subtree operand being considered. */
5582 find_decls_types_r (tree
*tp
, int *ws
, void *data
)
5585 struct free_lang_data_d
*fld
= (struct free_lang_data_d
*) data
;
5587 if (TREE_CODE (t
) == TREE_LIST
)
5590 /* Language specific nodes will be removed, so there is no need
5591 to gather anything under them. */
5592 if (is_lang_specific (t
))
5600 /* Note that walk_tree does not traverse every possible field in
5601 decls, so we have to do our own traversals here. */
5602 add_tree_to_fld_list (t
, fld
);
5604 fld_worklist_push (DECL_NAME (t
), fld
);
5605 fld_worklist_push (DECL_CONTEXT (t
), fld
);
5606 fld_worklist_push (DECL_SIZE (t
), fld
);
5607 fld_worklist_push (DECL_SIZE_UNIT (t
), fld
);
5609 /* We are going to remove everything under DECL_INITIAL for
5610 TYPE_DECLs. No point walking them. */
5611 if (TREE_CODE (t
) != TYPE_DECL
)
5612 fld_worklist_push (DECL_INITIAL (t
), fld
);
5614 fld_worklist_push (DECL_ATTRIBUTES (t
), fld
);
5615 fld_worklist_push (DECL_ABSTRACT_ORIGIN (t
), fld
);
5617 if (TREE_CODE (t
) == FUNCTION_DECL
)
5619 fld_worklist_push (DECL_ARGUMENTS (t
), fld
);
5620 fld_worklist_push (DECL_RESULT (t
), fld
);
5622 else if (TREE_CODE (t
) == TYPE_DECL
)
5624 fld_worklist_push (DECL_ORIGINAL_TYPE (t
), fld
);
5626 else if (TREE_CODE (t
) == FIELD_DECL
)
5628 fld_worklist_push (DECL_FIELD_OFFSET (t
), fld
);
5629 fld_worklist_push (DECL_BIT_FIELD_TYPE (t
), fld
);
5630 fld_worklist_push (DECL_FIELD_BIT_OFFSET (t
), fld
);
5631 fld_worklist_push (DECL_FCONTEXT (t
), fld
);
5634 if ((VAR_P (t
) || TREE_CODE (t
) == PARM_DECL
)
5635 && DECL_HAS_VALUE_EXPR_P (t
))
5636 fld_worklist_push (DECL_VALUE_EXPR (t
), fld
);
5638 if (TREE_CODE (t
) != FIELD_DECL
5639 && TREE_CODE (t
) != TYPE_DECL
)
5640 fld_worklist_push (TREE_CHAIN (t
), fld
);
5643 else if (TYPE_P (t
))
5645 /* Note that walk_tree does not traverse every possible field in
5646 types, so we have to do our own traversals here. */
5647 add_tree_to_fld_list (t
, fld
);
5649 if (!RECORD_OR_UNION_TYPE_P (t
))
5650 fld_worklist_push (TYPE_CACHED_VALUES (t
), fld
);
5651 fld_worklist_push (TYPE_SIZE (t
), fld
);
5652 fld_worklist_push (TYPE_SIZE_UNIT (t
), fld
);
5653 fld_worklist_push (TYPE_ATTRIBUTES (t
), fld
);
5654 fld_worklist_push (TYPE_POINTER_TO (t
), fld
);
5655 fld_worklist_push (TYPE_REFERENCE_TO (t
), fld
);
5656 fld_worklist_push (TYPE_NAME (t
), fld
);
5657 /* Do not walk TYPE_NEXT_PTR_TO or TYPE_NEXT_REF_TO. We do not stream
5658 them and thus do not and want not to reach unused pointer types
5660 if (!POINTER_TYPE_P (t
))
5661 fld_worklist_push (TYPE_MINVAL (t
), fld
);
5662 if (!RECORD_OR_UNION_TYPE_P (t
))
5663 fld_worklist_push (TYPE_MAXVAL (t
), fld
);
5664 fld_worklist_push (TYPE_MAIN_VARIANT (t
), fld
);
5665 /* Do not walk TYPE_NEXT_VARIANT. We do not stream it and thus
5666 do not and want not to reach unused variants this way. */
5667 if (TYPE_CONTEXT (t
))
5669 tree ctx
= TYPE_CONTEXT (t
);
5670 /* We adjust BLOCK TYPE_CONTEXTs to the innermost non-BLOCK one.
5671 So push that instead. */
5672 while (ctx
&& TREE_CODE (ctx
) == BLOCK
)
5673 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5674 fld_worklist_push (ctx
, fld
);
5676 /* Do not walk TYPE_CANONICAL. We do not stream it and thus do not
5677 and want not to reach unused types this way. */
5679 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
))
5683 FOR_EACH_VEC_ELT (*BINFO_BASE_BINFOS (TYPE_BINFO (t
)), i
, tem
)
5684 fld_worklist_push (TREE_TYPE (tem
), fld
);
5685 tem
= BINFO_VIRTUALS (TYPE_BINFO (t
));
5687 /* The Java FE overloads BINFO_VIRTUALS for its own purpose. */
5688 && TREE_CODE (tem
) == TREE_LIST
)
5691 fld_worklist_push (TREE_VALUE (tem
), fld
);
5692 tem
= TREE_CHAIN (tem
);
5696 if (RECORD_OR_UNION_TYPE_P (t
))
5699 /* Push all TYPE_FIELDS - there can be interleaving interesting
5700 and non-interesting things. */
5701 tem
= TYPE_FIELDS (t
);
5704 if (TREE_CODE (tem
) == FIELD_DECL
5705 || (TREE_CODE (tem
) == TYPE_DECL
5706 && !DECL_IGNORED_P (tem
)
5707 && debug_info_level
> DINFO_LEVEL_TERSE
5708 && !is_redundant_typedef (tem
)))
5709 fld_worklist_push (tem
, fld
);
5710 tem
= TREE_CHAIN (tem
);
5714 fld_worklist_push (TYPE_STUB_DECL (t
), fld
);
5717 else if (TREE_CODE (t
) == BLOCK
)
5720 for (tem
= BLOCK_VARS (t
); tem
; tem
= TREE_CHAIN (tem
))
5721 fld_worklist_push (tem
, fld
);
5722 for (tem
= BLOCK_SUBBLOCKS (t
); tem
; tem
= BLOCK_CHAIN (tem
))
5723 fld_worklist_push (tem
, fld
);
5724 fld_worklist_push (BLOCK_ABSTRACT_ORIGIN (t
), fld
);
5727 if (TREE_CODE (t
) != IDENTIFIER_NODE
5728 && CODE_CONTAINS_STRUCT (TREE_CODE (t
), TS_TYPED
))
5729 fld_worklist_push (TREE_TYPE (t
), fld
);
5735 /* Find decls and types in T. */
5738 find_decls_types (tree t
, struct free_lang_data_d
*fld
)
5742 if (!fld
->pset
.contains (t
))
5743 walk_tree (&t
, find_decls_types_r
, fld
, &fld
->pset
);
5744 if (fld
->worklist
.is_empty ())
5746 t
= fld
->worklist
.pop ();
5750 /* Translate all the types in LIST with the corresponding runtime
5754 get_eh_types_for_runtime (tree list
)
5758 if (list
== NULL_TREE
)
5761 head
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5763 list
= TREE_CHAIN (list
);
5766 tree n
= build_tree_list (0, lookup_type_for_runtime (TREE_VALUE (list
)));
5767 TREE_CHAIN (prev
) = n
;
5768 prev
= TREE_CHAIN (prev
);
5769 list
= TREE_CHAIN (list
);
5776 /* Find decls and types referenced in EH region R and store them in
5777 FLD->DECLS and FLD->TYPES. */
5780 find_decls_types_in_eh_region (eh_region r
, struct free_lang_data_d
*fld
)
5791 /* The types referenced in each catch must first be changed to the
5792 EH types used at runtime. This removes references to FE types
5794 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
5796 c
->type_list
= get_eh_types_for_runtime (c
->type_list
);
5797 walk_tree (&c
->type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5802 case ERT_ALLOWED_EXCEPTIONS
:
5803 r
->u
.allowed
.type_list
5804 = get_eh_types_for_runtime (r
->u
.allowed
.type_list
);
5805 walk_tree (&r
->u
.allowed
.type_list
, find_decls_types_r
, fld
, &fld
->pset
);
5808 case ERT_MUST_NOT_THROW
:
5809 walk_tree (&r
->u
.must_not_throw
.failure_decl
,
5810 find_decls_types_r
, fld
, &fld
->pset
);
5816 /* Find decls and types referenced in cgraph node N and store them in
5817 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5818 look for *every* kind of DECL and TYPE node reachable from N,
5819 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5820 NAMESPACE_DECLs, etc). */
5823 find_decls_types_in_node (struct cgraph_node
*n
, struct free_lang_data_d
*fld
)
5826 struct function
*fn
;
5830 find_decls_types (n
->decl
, fld
);
5832 if (!gimple_has_body_p (n
->decl
))
5835 gcc_assert (current_function_decl
== NULL_TREE
&& cfun
== NULL
);
5837 fn
= DECL_STRUCT_FUNCTION (n
->decl
);
5839 /* Traverse locals. */
5840 FOR_EACH_LOCAL_DECL (fn
, ix
, t
)
5841 find_decls_types (t
, fld
);
5843 /* Traverse EH regions in FN. */
5846 FOR_ALL_EH_REGION_FN (r
, fn
)
5847 find_decls_types_in_eh_region (r
, fld
);
5850 /* Traverse every statement in FN. */
5851 FOR_EACH_BB_FN (bb
, fn
)
5854 gimple_stmt_iterator si
;
5857 for (psi
= gsi_start_phis (bb
); !gsi_end_p (psi
); gsi_next (&psi
))
5859 gphi
*phi
= psi
.phi ();
5861 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5863 tree
*arg_p
= gimple_phi_arg_def_ptr (phi
, i
);
5864 find_decls_types (*arg_p
, fld
);
5868 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
5870 gimple
*stmt
= gsi_stmt (si
);
5872 if (is_gimple_call (stmt
))
5873 find_decls_types (gimple_call_fntype (stmt
), fld
);
5875 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
5877 tree arg
= gimple_op (stmt
, i
);
5878 find_decls_types (arg
, fld
);
5885 /* Find decls and types referenced in varpool node N and store them in
5886 FLD->DECLS and FLD->TYPES. Unlike pass_referenced_vars, this will
5887 look for *every* kind of DECL and TYPE node reachable from N,
5888 including those embedded inside types and decls (i.e,, TYPE_DECLs,
5889 NAMESPACE_DECLs, etc). */
5892 find_decls_types_in_var (varpool_node
*v
, struct free_lang_data_d
*fld
)
5894 find_decls_types (v
->decl
, fld
);
5897 /* If T needs an assembler name, have one created for it. */
5900 assign_assembler_name_if_neeeded (tree t
)
5902 if (need_assembler_name_p (t
))
5904 /* When setting DECL_ASSEMBLER_NAME, the C++ mangler may emit
5905 diagnostics that use input_location to show locus
5906 information. The problem here is that, at this point,
5907 input_location is generally anchored to the end of the file
5908 (since the parser is long gone), so we don't have a good
5909 position to pin it to.
5911 To alleviate this problem, this uses the location of T's
5912 declaration. Examples of this are
5913 testsuite/g++.dg/template/cond2.C and
5914 testsuite/g++.dg/template/pr35240.C. */
5915 location_t saved_location
= input_location
;
5916 input_location
= DECL_SOURCE_LOCATION (t
);
5918 decl_assembler_name (t
);
5920 input_location
= saved_location
;
5925 /* Free language specific information for every operand and expression
5926 in every node of the call graph. This process operates in three stages:
5928 1- Every callgraph node and varpool node is traversed looking for
5929 decls and types embedded in them. This is a more exhaustive
5930 search than that done by find_referenced_vars, because it will
5931 also collect individual fields, decls embedded in types, etc.
5933 2- All the decls found are sent to free_lang_data_in_decl.
5935 3- All the types found are sent to free_lang_data_in_type.
5937 The ordering between decls and types is important because
5938 free_lang_data_in_decl sets assembler names, which includes
5939 mangling. So types cannot be freed up until assembler names have
5943 free_lang_data_in_cgraph (void)
5945 struct cgraph_node
*n
;
5947 struct free_lang_data_d fld
;
5952 /* Find decls and types in the body of every function in the callgraph. */
5953 FOR_EACH_FUNCTION (n
)
5954 find_decls_types_in_node (n
, &fld
);
5956 FOR_EACH_VEC_SAFE_ELT (alias_pairs
, i
, p
)
5957 find_decls_types (p
->decl
, &fld
);
5959 /* Find decls and types in every varpool symbol. */
5960 FOR_EACH_VARIABLE (v
)
5961 find_decls_types_in_var (v
, &fld
);
5963 /* Set the assembler name on every decl found. We need to do this
5964 now because free_lang_data_in_decl will invalidate data needed
5965 for mangling. This breaks mangling on interdependent decls. */
5966 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5967 assign_assembler_name_if_neeeded (t
);
5969 /* Traverse every decl found freeing its language data. */
5970 FOR_EACH_VEC_ELT (fld
.decls
, i
, t
)
5971 free_lang_data_in_decl (t
);
5973 /* Traverse every type found freeing its language data. */
5974 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5975 free_lang_data_in_type (t
);
5978 FOR_EACH_VEC_ELT (fld
.types
, i
, t
)
5984 /* Free resources that are used by FE but are not needed once they are done. */
5987 free_lang_data (void)
5991 /* If we are the LTO frontend we have freed lang-specific data already. */
5993 || (!flag_generate_lto
&& !flag_generate_offload
))
5996 /* Allocate and assign alias sets to the standard integer types
5997 while the slots are still in the way the frontends generated them. */
5998 for (i
= 0; i
< itk_none
; ++i
)
5999 if (integer_types
[i
])
6000 TYPE_ALIAS_SET (integer_types
[i
]) = get_alias_set (integer_types
[i
]);
6002 /* Traverse the IL resetting language specific information for
6003 operands, expressions, etc. */
6004 free_lang_data_in_cgraph ();
6006 /* Create gimple variants for common types. */
6007 ptrdiff_type_node
= integer_type_node
;
6008 fileptr_type_node
= ptr_type_node
;
6010 /* Reset some langhooks. Do not reset types_compatible_p, it may
6011 still be used indirectly via the get_alias_set langhook. */
6012 lang_hooks
.dwarf_name
= lhd_dwarf_name
;
6013 lang_hooks
.decl_printable_name
= gimple_decl_printable_name
;
6014 lang_hooks
.gimplify_expr
= lhd_gimplify_expr
;
6016 /* We do not want the default decl_assembler_name implementation,
6017 rather if we have fixed everything we want a wrapper around it
6018 asserting that all non-local symbols already got their assembler
6019 name and only produce assembler names for local symbols. Or rather
6020 make sure we never call decl_assembler_name on local symbols and
6021 devise a separate, middle-end private scheme for it. */
6023 /* Reset diagnostic machinery. */
6024 tree_diagnostics_defaults (global_dc
);
6032 const pass_data pass_data_ipa_free_lang_data
=
6034 SIMPLE_IPA_PASS
, /* type */
6035 "*free_lang_data", /* name */
6036 OPTGROUP_NONE
, /* optinfo_flags */
6037 TV_IPA_FREE_LANG_DATA
, /* tv_id */
6038 0, /* properties_required */
6039 0, /* properties_provided */
6040 0, /* properties_destroyed */
6041 0, /* todo_flags_start */
6042 0, /* todo_flags_finish */
6045 class pass_ipa_free_lang_data
: public simple_ipa_opt_pass
6048 pass_ipa_free_lang_data (gcc::context
*ctxt
)
6049 : simple_ipa_opt_pass (pass_data_ipa_free_lang_data
, ctxt
)
6052 /* opt_pass methods: */
6053 virtual unsigned int execute (function
*) { return free_lang_data (); }
6055 }; // class pass_ipa_free_lang_data
6059 simple_ipa_opt_pass
*
6060 make_pass_ipa_free_lang_data (gcc::context
*ctxt
)
6062 return new pass_ipa_free_lang_data (ctxt
);
6065 /* The backbone of is_attribute_p(). ATTR_LEN is the string length of
6066 ATTR_NAME. Also used internally by remove_attribute(). */
6068 private_is_attribute_p (const char *attr_name
, size_t attr_len
, const_tree ident
)
6070 size_t ident_len
= IDENTIFIER_LENGTH (ident
);
6072 if (ident_len
== attr_len
)
6074 if (strcmp (attr_name
, IDENTIFIER_POINTER (ident
)) == 0)
6077 else if (ident_len
== attr_len
+ 4)
6079 /* There is the possibility that ATTR is 'text' and IDENT is
6081 const char *p
= IDENTIFIER_POINTER (ident
);
6082 if (p
[0] == '_' && p
[1] == '_'
6083 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6084 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6091 /* The backbone of lookup_attribute(). ATTR_LEN is the string length
6092 of ATTR_NAME, and LIST is not NULL_TREE. */
6094 private_lookup_attribute (const char *attr_name
, size_t attr_len
, tree list
)
6098 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6100 if (ident_len
== attr_len
)
6102 if (!strcmp (attr_name
,
6103 IDENTIFIER_POINTER (get_attribute_name (list
))))
6106 /* TODO: If we made sure that attributes were stored in the
6107 canonical form without '__...__' (ie, as in 'text' as opposed
6108 to '__text__') then we could avoid the following case. */
6109 else if (ident_len
== attr_len
+ 4)
6111 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6112 if (p
[0] == '_' && p
[1] == '_'
6113 && p
[ident_len
- 2] == '_' && p
[ident_len
- 1] == '_'
6114 && strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6117 list
= TREE_CHAIN (list
);
6123 /* Given an attribute name ATTR_NAME and a list of attributes LIST,
6124 return a pointer to the attribute's list first element if the attribute
6125 starts with ATTR_NAME. ATTR_NAME must be in the form 'text' (not
6129 private_lookup_attribute_by_prefix (const char *attr_name
, size_t attr_len
,
6134 size_t ident_len
= IDENTIFIER_LENGTH (get_attribute_name (list
));
6136 if (attr_len
> ident_len
)
6138 list
= TREE_CHAIN (list
);
6142 const char *p
= IDENTIFIER_POINTER (get_attribute_name (list
));
6144 if (strncmp (attr_name
, p
, attr_len
) == 0)
6147 /* TODO: If we made sure that attributes were stored in the
6148 canonical form without '__...__' (ie, as in 'text' as opposed
6149 to '__text__') then we could avoid the following case. */
6150 if (p
[0] == '_' && p
[1] == '_' &&
6151 strncmp (attr_name
, p
+ 2, attr_len
) == 0)
6154 list
= TREE_CHAIN (list
);
6161 /* A variant of lookup_attribute() that can be used with an identifier
6162 as the first argument, and where the identifier can be either
6163 'text' or '__text__'.
6165 Given an attribute ATTR_IDENTIFIER, and a list of attributes LIST,
6166 return a pointer to the attribute's list element if the attribute
6167 is part of the list, or NULL_TREE if not found. If the attribute
6168 appears more than once, this only returns the first occurrence; the
6169 TREE_CHAIN of the return value should be passed back in if further
6170 occurrences are wanted. ATTR_IDENTIFIER must be an identifier but
6171 can be in the form 'text' or '__text__'. */
6173 lookup_ident_attribute (tree attr_identifier
, tree list
)
6175 gcc_checking_assert (TREE_CODE (attr_identifier
) == IDENTIFIER_NODE
);
6179 gcc_checking_assert (TREE_CODE (get_attribute_name (list
))
6180 == IDENTIFIER_NODE
);
6182 if (cmp_attrib_identifiers (attr_identifier
,
6183 get_attribute_name (list
)))
6186 list
= TREE_CHAIN (list
);
6192 /* Remove any instances of attribute ATTR_NAME in LIST and return the
6196 remove_attribute (const char *attr_name
, tree list
)
6199 size_t attr_len
= strlen (attr_name
);
6201 gcc_checking_assert (attr_name
[0] != '_');
6203 for (p
= &list
; *p
; )
6206 /* TODO: If we were storing attributes in normalized form, here
6207 we could use a simple strcmp(). */
6208 if (private_is_attribute_p (attr_name
, attr_len
, get_attribute_name (l
)))
6209 *p
= TREE_CHAIN (l
);
6211 p
= &TREE_CHAIN (l
);
6217 /* Return an attribute list that is the union of a1 and a2. */
6220 merge_attributes (tree a1
, tree a2
)
6224 /* Either one unset? Take the set one. */
6226 if ((attributes
= a1
) == 0)
6229 /* One that completely contains the other? Take it. */
6231 else if (a2
!= 0 && ! attribute_list_contained (a1
, a2
))
6233 if (attribute_list_contained (a2
, a1
))
6237 /* Pick the longest list, and hang on the other list. */
6239 if (list_length (a1
) < list_length (a2
))
6240 attributes
= a2
, a2
= a1
;
6242 for (; a2
!= 0; a2
= TREE_CHAIN (a2
))
6245 for (a
= lookup_ident_attribute (get_attribute_name (a2
),
6247 a
!= NULL_TREE
&& !attribute_value_equal (a
, a2
);
6248 a
= lookup_ident_attribute (get_attribute_name (a2
),
6253 a1
= copy_node (a2
);
6254 TREE_CHAIN (a1
) = attributes
;
6263 /* Given types T1 and T2, merge their attributes and return
6267 merge_type_attributes (tree t1
, tree t2
)
6269 return merge_attributes (TYPE_ATTRIBUTES (t1
),
6270 TYPE_ATTRIBUTES (t2
));
6273 /* Given decls OLDDECL and NEWDECL, merge their attributes and return
6277 merge_decl_attributes (tree olddecl
, tree newdecl
)
6279 return merge_attributes (DECL_ATTRIBUTES (olddecl
),
6280 DECL_ATTRIBUTES (newdecl
));
6283 #if TARGET_DLLIMPORT_DECL_ATTRIBUTES
6285 /* Specialization of merge_decl_attributes for various Windows targets.
6287 This handles the following situation:
6289 __declspec (dllimport) int foo;
6292 The second instance of `foo' nullifies the dllimport. */
6295 merge_dllimport_decl_attributes (tree old
, tree new_tree
)
6298 int delete_dllimport_p
= 1;
6300 /* What we need to do here is remove from `old' dllimport if it doesn't
6301 appear in `new'. dllimport behaves like extern: if a declaration is
6302 marked dllimport and a definition appears later, then the object
6303 is not dllimport'd. We also remove a `new' dllimport if the old list
6304 contains dllexport: dllexport always overrides dllimport, regardless
6305 of the order of declaration. */
6306 if (!VAR_OR_FUNCTION_DECL_P (new_tree
))
6307 delete_dllimport_p
= 0;
6308 else if (DECL_DLLIMPORT_P (new_tree
)
6309 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (old
)))
6311 DECL_DLLIMPORT_P (new_tree
) = 0;
6312 warning (OPT_Wattributes
, "%q+D already declared with dllexport attribute: "
6313 "dllimport ignored", new_tree
);
6315 else if (DECL_DLLIMPORT_P (old
) && !DECL_DLLIMPORT_P (new_tree
))
6317 /* Warn about overriding a symbol that has already been used, e.g.:
6318 extern int __attribute__ ((dllimport)) foo;
6319 int* bar () {return &foo;}
6322 if (TREE_USED (old
))
6324 warning (0, "%q+D redeclared without dllimport attribute "
6325 "after being referenced with dll linkage", new_tree
);
6326 /* If we have used a variable's address with dllimport linkage,
6327 keep the old DECL_DLLIMPORT_P flag: the ADDR_EXPR using the
6328 decl may already have had TREE_CONSTANT computed.
6329 We still remove the attribute so that assembler code refers
6330 to '&foo rather than '_imp__foo'. */
6331 if (VAR_P (old
) && TREE_ADDRESSABLE (old
))
6332 DECL_DLLIMPORT_P (new_tree
) = 1;
6335 /* Let an inline definition silently override the external reference,
6336 but otherwise warn about attribute inconsistency. */
6337 else if (VAR_P (new_tree
) || !DECL_DECLARED_INLINE_P (new_tree
))
6338 warning (OPT_Wattributes
, "%q+D redeclared without dllimport attribute: "
6339 "previous dllimport ignored", new_tree
);
6342 delete_dllimport_p
= 0;
6344 a
= merge_attributes (DECL_ATTRIBUTES (old
), DECL_ATTRIBUTES (new_tree
));
6346 if (delete_dllimport_p
)
6347 a
= remove_attribute ("dllimport", a
);
6352 /* Handle a "dllimport" or "dllexport" attribute; arguments as in
6353 struct attribute_spec.handler. */
6356 handle_dll_attribute (tree
* pnode
, tree name
, tree args
, int flags
,
6362 /* These attributes may apply to structure and union types being created,
6363 but otherwise should pass to the declaration involved. */
6366 if (flags
& ((int) ATTR_FLAG_DECL_NEXT
| (int) ATTR_FLAG_FUNCTION_NEXT
6367 | (int) ATTR_FLAG_ARRAY_NEXT
))
6369 *no_add_attrs
= true;
6370 return tree_cons (name
, args
, NULL_TREE
);
6372 if (TREE_CODE (node
) == RECORD_TYPE
6373 || TREE_CODE (node
) == UNION_TYPE
)
6375 node
= TYPE_NAME (node
);
6381 warning (OPT_Wattributes
, "%qE attribute ignored",
6383 *no_add_attrs
= true;
6388 if (!VAR_OR_FUNCTION_DECL_P (node
) && TREE_CODE (node
) != TYPE_DECL
)
6390 *no_add_attrs
= true;
6391 warning (OPT_Wattributes
, "%qE attribute ignored",
6396 if (TREE_CODE (node
) == TYPE_DECL
6397 && TREE_CODE (TREE_TYPE (node
)) != RECORD_TYPE
6398 && TREE_CODE (TREE_TYPE (node
)) != UNION_TYPE
)
6400 *no_add_attrs
= true;
6401 warning (OPT_Wattributes
, "%qE attribute ignored",
6406 is_dllimport
= is_attribute_p ("dllimport", name
);
6408 /* Report error on dllimport ambiguities seen now before they cause
6412 /* Honor any target-specific overrides. */
6413 if (!targetm
.valid_dllimport_attribute_p (node
))
6414 *no_add_attrs
= true;
6416 else if (TREE_CODE (node
) == FUNCTION_DECL
6417 && DECL_DECLARED_INLINE_P (node
))
6419 warning (OPT_Wattributes
, "inline function %q+D declared as "
6420 " dllimport: attribute ignored", node
);
6421 *no_add_attrs
= true;
6423 /* Like MS, treat definition of dllimported variables and
6424 non-inlined functions on declaration as syntax errors. */
6425 else if (TREE_CODE (node
) == FUNCTION_DECL
&& DECL_INITIAL (node
))
6427 error ("function %q+D definition is marked dllimport", node
);
6428 *no_add_attrs
= true;
6431 else if (VAR_P (node
))
6433 if (DECL_INITIAL (node
))
6435 error ("variable %q+D definition is marked dllimport",
6437 *no_add_attrs
= true;
6440 /* `extern' needn't be specified with dllimport.
6441 Specify `extern' now and hope for the best. Sigh. */
6442 DECL_EXTERNAL (node
) = 1;
6443 /* Also, implicitly give dllimport'd variables declared within
6444 a function global scope, unless declared static. */
6445 if (current_function_decl
!= NULL_TREE
&& !TREE_STATIC (node
))
6446 TREE_PUBLIC (node
) = 1;
6449 if (*no_add_attrs
== false)
6450 DECL_DLLIMPORT_P (node
) = 1;
6452 else if (TREE_CODE (node
) == FUNCTION_DECL
6453 && DECL_DECLARED_INLINE_P (node
)
6454 && flag_keep_inline_dllexport
)
6455 /* An exported function, even if inline, must be emitted. */
6456 DECL_EXTERNAL (node
) = 0;
6458 /* Report error if symbol is not accessible at global scope. */
6459 if (!TREE_PUBLIC (node
) && VAR_OR_FUNCTION_DECL_P (node
))
6461 error ("external linkage required for symbol %q+D because of "
6462 "%qE attribute", node
, name
);
6463 *no_add_attrs
= true;
6466 /* A dllexport'd entity must have default visibility so that other
6467 program units (shared libraries or the main executable) can see
6468 it. A dllimport'd entity must have default visibility so that
6469 the linker knows that undefined references within this program
6470 unit can be resolved by the dynamic linker. */
6473 if (DECL_VISIBILITY_SPECIFIED (node
)
6474 && DECL_VISIBILITY (node
) != VISIBILITY_DEFAULT
)
6475 error ("%qE implies default visibility, but %qD has already "
6476 "been declared with a different visibility",
6478 DECL_VISIBILITY (node
) = VISIBILITY_DEFAULT
;
6479 DECL_VISIBILITY_SPECIFIED (node
) = 1;
6485 #endif /* TARGET_DLLIMPORT_DECL_ATTRIBUTES */
6487 /* Set the type qualifiers for TYPE to TYPE_QUALS, which is a bitmask
6488 of the various TYPE_QUAL values. */
6491 set_type_quals (tree type
, int type_quals
)
6493 TYPE_READONLY (type
) = (type_quals
& TYPE_QUAL_CONST
) != 0;
6494 TYPE_VOLATILE (type
) = (type_quals
& TYPE_QUAL_VOLATILE
) != 0;
6495 TYPE_RESTRICT (type
) = (type_quals
& TYPE_QUAL_RESTRICT
) != 0;
6496 TYPE_ATOMIC (type
) = (type_quals
& TYPE_QUAL_ATOMIC
) != 0;
6497 TYPE_ADDR_SPACE (type
) = DECODE_QUAL_ADDR_SPACE (type_quals
);
6500 /* Returns true iff unqualified CAND and BASE are equivalent. */
6503 check_base_type (const_tree cand
, const_tree base
)
6505 return (TYPE_NAME (cand
) == TYPE_NAME (base
)
6506 /* Apparently this is needed for Objective-C. */
6507 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6508 /* Check alignment. */
6509 && TYPE_ALIGN (cand
) == TYPE_ALIGN (base
)
6510 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6511 TYPE_ATTRIBUTES (base
)));
6514 /* Returns true iff CAND is equivalent to BASE with TYPE_QUALS. */
6517 check_qualified_type (const_tree cand
, const_tree base
, int type_quals
)
6519 return (TYPE_QUALS (cand
) == type_quals
6520 && check_base_type (cand
, base
));
6523 /* Returns true iff CAND is equivalent to BASE with ALIGN. */
6526 check_aligned_type (const_tree cand
, const_tree base
, unsigned int align
)
6528 return (TYPE_QUALS (cand
) == TYPE_QUALS (base
)
6529 && TYPE_NAME (cand
) == TYPE_NAME (base
)
6530 /* Apparently this is needed for Objective-C. */
6531 && TYPE_CONTEXT (cand
) == TYPE_CONTEXT (base
)
6532 /* Check alignment. */
6533 && TYPE_ALIGN (cand
) == align
6534 && attribute_list_equal (TYPE_ATTRIBUTES (cand
),
6535 TYPE_ATTRIBUTES (base
)));
6538 /* This function checks to see if TYPE matches the size one of the built-in
6539 atomic types, and returns that core atomic type. */
6542 find_atomic_core_type (tree type
)
6544 tree base_atomic_type
;
6546 /* Only handle complete types. */
6547 if (TYPE_SIZE (type
) == NULL_TREE
)
6550 HOST_WIDE_INT type_size
= tree_to_uhwi (TYPE_SIZE (type
));
6554 base_atomic_type
= atomicQI_type_node
;
6558 base_atomic_type
= atomicHI_type_node
;
6562 base_atomic_type
= atomicSI_type_node
;
6566 base_atomic_type
= atomicDI_type_node
;
6570 base_atomic_type
= atomicTI_type_node
;
6574 base_atomic_type
= NULL_TREE
;
6577 return base_atomic_type
;
6580 /* Return a version of the TYPE, qualified as indicated by the
6581 TYPE_QUALS, if one exists. If no qualified version exists yet,
6582 return NULL_TREE. */
6585 get_qualified_type (tree type
, int type_quals
)
6589 if (TYPE_QUALS (type
) == type_quals
)
6592 /* Search the chain of variants to see if there is already one there just
6593 like the one we need to have. If so, use that existing one. We must
6594 preserve the TYPE_NAME, since there is code that depends on this. */
6595 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6596 if (check_qualified_type (t
, type
, type_quals
))
6602 /* Like get_qualified_type, but creates the type if it does not
6603 exist. This function never returns NULL_TREE. */
6606 build_qualified_type (tree type
, int type_quals
)
6610 /* See if we already have the appropriate qualified variant. */
6611 t
= get_qualified_type (type
, type_quals
);
6613 /* If not, build it. */
6616 t
= build_variant_type_copy (type
);
6617 set_type_quals (t
, type_quals
);
6619 if (((type_quals
& TYPE_QUAL_ATOMIC
) == TYPE_QUAL_ATOMIC
))
6621 /* See if this object can map to a basic atomic type. */
6622 tree atomic_type
= find_atomic_core_type (type
);
6625 /* Ensure the alignment of this type is compatible with
6626 the required alignment of the atomic type. */
6627 if (TYPE_ALIGN (atomic_type
) > TYPE_ALIGN (t
))
6628 SET_TYPE_ALIGN (t
, TYPE_ALIGN (atomic_type
));
6632 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6633 /* Propagate structural equality. */
6634 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6635 else if (TYPE_CANONICAL (type
) != type
)
6636 /* Build the underlying canonical type, since it is different
6639 tree c
= build_qualified_type (TYPE_CANONICAL (type
), type_quals
);
6640 TYPE_CANONICAL (t
) = TYPE_CANONICAL (c
);
6643 /* T is its own canonical type. */
6644 TYPE_CANONICAL (t
) = t
;
6651 /* Create a variant of type T with alignment ALIGN. */
6654 build_aligned_type (tree type
, unsigned int align
)
6658 if (TYPE_PACKED (type
)
6659 || TYPE_ALIGN (type
) == align
)
6662 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
6663 if (check_aligned_type (t
, type
, align
))
6666 t
= build_variant_type_copy (type
);
6667 SET_TYPE_ALIGN (t
, align
);
6672 /* Create a new distinct copy of TYPE. The new type is made its own
6673 MAIN_VARIANT. If TYPE requires structural equality checks, the
6674 resulting type requires structural equality checks; otherwise, its
6675 TYPE_CANONICAL points to itself. */
6678 build_distinct_type_copy (tree type
)
6680 tree t
= copy_node (type
);
6682 TYPE_POINTER_TO (t
) = 0;
6683 TYPE_REFERENCE_TO (t
) = 0;
6685 /* Set the canonical type either to a new equivalence class, or
6686 propagate the need for structural equality checks. */
6687 if (TYPE_STRUCTURAL_EQUALITY_P (type
))
6688 SET_TYPE_STRUCTURAL_EQUALITY (t
);
6690 TYPE_CANONICAL (t
) = t
;
6692 /* Make it its own variant. */
6693 TYPE_MAIN_VARIANT (t
) = t
;
6694 TYPE_NEXT_VARIANT (t
) = 0;
6696 /* We do not record methods in type copies nor variants
6697 so we do not need to keep them up to date when new method
6699 if (RECORD_OR_UNION_TYPE_P (t
))
6700 TYPE_METHODS (t
) = NULL_TREE
;
6702 /* Note that it is now possible for TYPE_MIN_VALUE to be a value
6703 whose TREE_TYPE is not t. This can also happen in the Ada
6704 frontend when using subtypes. */
6709 /* Create a new variant of TYPE, equivalent but distinct. This is so
6710 the caller can modify it. TYPE_CANONICAL for the return type will
6711 be equivalent to TYPE_CANONICAL of TYPE, indicating that the types
6712 are considered equal by the language itself (or that both types
6713 require structural equality checks). */
6716 build_variant_type_copy (tree type
)
6718 tree t
, m
= TYPE_MAIN_VARIANT (type
);
6720 t
= build_distinct_type_copy (type
);
6722 /* Since we're building a variant, assume that it is a non-semantic
6723 variant. This also propagates TYPE_STRUCTURAL_EQUALITY_P. */
6724 TYPE_CANONICAL (t
) = TYPE_CANONICAL (type
);
6725 /* Type variants have no alias set defined. */
6726 TYPE_ALIAS_SET (t
) = -1;
6728 /* Add the new type to the chain of variants of TYPE. */
6729 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (m
);
6730 TYPE_NEXT_VARIANT (m
) = t
;
6731 TYPE_MAIN_VARIANT (t
) = m
;
6736 /* Return true if the from tree in both tree maps are equal. */
6739 tree_map_base_eq (const void *va
, const void *vb
)
6741 const struct tree_map_base
*const a
= (const struct tree_map_base
*) va
,
6742 *const b
= (const struct tree_map_base
*) vb
;
6743 return (a
->from
== b
->from
);
6746 /* Hash a from tree in a tree_base_map. */
6749 tree_map_base_hash (const void *item
)
6751 return htab_hash_pointer (((const struct tree_map_base
*)item
)->from
);
6754 /* Return true if this tree map structure is marked for garbage collection
6755 purposes. We simply return true if the from tree is marked, so that this
6756 structure goes away when the from tree goes away. */
6759 tree_map_base_marked_p (const void *p
)
6761 return ggc_marked_p (((const struct tree_map_base
*) p
)->from
);
6764 /* Hash a from tree in a tree_map. */
6767 tree_map_hash (const void *item
)
6769 return (((const struct tree_map
*) item
)->hash
);
6772 /* Hash a from tree in a tree_decl_map. */
6775 tree_decl_map_hash (const void *item
)
6777 return DECL_UID (((const struct tree_decl_map
*) item
)->base
.from
);
6780 /* Return the initialization priority for DECL. */
6783 decl_init_priority_lookup (tree decl
)
6785 symtab_node
*snode
= symtab_node::get (decl
);
6788 return DEFAULT_INIT_PRIORITY
;
6790 snode
->get_init_priority ();
6793 /* Return the finalization priority for DECL. */
6796 decl_fini_priority_lookup (tree decl
)
6798 cgraph_node
*node
= cgraph_node::get (decl
);
6801 return DEFAULT_INIT_PRIORITY
;
6803 node
->get_fini_priority ();
6806 /* Set the initialization priority for DECL to PRIORITY. */
6809 decl_init_priority_insert (tree decl
, priority_type priority
)
6811 struct symtab_node
*snode
;
6813 if (priority
== DEFAULT_INIT_PRIORITY
)
6815 snode
= symtab_node::get (decl
);
6819 else if (VAR_P (decl
))
6820 snode
= varpool_node::get_create (decl
);
6822 snode
= cgraph_node::get_create (decl
);
6823 snode
->set_init_priority (priority
);
6826 /* Set the finalization priority for DECL to PRIORITY. */
6829 decl_fini_priority_insert (tree decl
, priority_type priority
)
6831 struct cgraph_node
*node
;
6833 if (priority
== DEFAULT_INIT_PRIORITY
)
6835 node
= cgraph_node::get (decl
);
6840 node
= cgraph_node::get_create (decl
);
6841 node
->set_fini_priority (priority
);
6844 /* Print out the statistics for the DECL_DEBUG_EXPR hash table. */
6847 print_debug_expr_statistics (void)
6849 fprintf (stderr
, "DECL_DEBUG_EXPR hash: size %ld, %ld elements, %f collisions\n",
6850 (long) debug_expr_for_decl
->size (),
6851 (long) debug_expr_for_decl
->elements (),
6852 debug_expr_for_decl
->collisions ());
6855 /* Print out the statistics for the DECL_VALUE_EXPR hash table. */
6858 print_value_expr_statistics (void)
6860 fprintf (stderr
, "DECL_VALUE_EXPR hash: size %ld, %ld elements, %f collisions\n",
6861 (long) value_expr_for_decl
->size (),
6862 (long) value_expr_for_decl
->elements (),
6863 value_expr_for_decl
->collisions ());
6866 /* Lookup a debug expression for FROM, and return it if we find one. */
6869 decl_debug_expr_lookup (tree from
)
6871 struct tree_decl_map
*h
, in
;
6872 in
.base
.from
= from
;
6874 h
= debug_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6880 /* Insert a mapping FROM->TO in the debug expression hashtable. */
6883 decl_debug_expr_insert (tree from
, tree to
)
6885 struct tree_decl_map
*h
;
6887 h
= ggc_alloc
<tree_decl_map
> ();
6888 h
->base
.from
= from
;
6890 *debug_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6893 /* Lookup a value expression for FROM, and return it if we find one. */
6896 decl_value_expr_lookup (tree from
)
6898 struct tree_decl_map
*h
, in
;
6899 in
.base
.from
= from
;
6901 h
= value_expr_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6907 /* Insert a mapping FROM->TO in the value expression hashtable. */
6910 decl_value_expr_insert (tree from
, tree to
)
6912 struct tree_decl_map
*h
;
6914 h
= ggc_alloc
<tree_decl_map
> ();
6915 h
->base
.from
= from
;
6917 *value_expr_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
) = h
;
6920 /* Lookup a vector of debug arguments for FROM, and return it if we
6924 decl_debug_args_lookup (tree from
)
6926 struct tree_vec_map
*h
, in
;
6928 if (!DECL_HAS_DEBUG_ARGS_P (from
))
6930 gcc_checking_assert (debug_args_for_decl
!= NULL
);
6931 in
.base
.from
= from
;
6932 h
= debug_args_for_decl
->find_with_hash (&in
, DECL_UID (from
));
6938 /* Insert a mapping FROM->empty vector of debug arguments in the value
6939 expression hashtable. */
6942 decl_debug_args_insert (tree from
)
6944 struct tree_vec_map
*h
;
6947 if (DECL_HAS_DEBUG_ARGS_P (from
))
6948 return decl_debug_args_lookup (from
);
6949 if (debug_args_for_decl
== NULL
)
6950 debug_args_for_decl
= hash_table
<tree_vec_map_cache_hasher
>::create_ggc (64);
6951 h
= ggc_alloc
<tree_vec_map
> ();
6952 h
->base
.from
= from
;
6954 loc
= debug_args_for_decl
->find_slot_with_hash (h
, DECL_UID (from
), INSERT
);
6956 DECL_HAS_DEBUG_ARGS_P (from
) = 1;
6960 /* Hashing of types so that we don't make duplicates.
6961 The entry point is `type_hash_canon'. */
6963 /* Compute a hash code for a list of types (chain of TREE_LIST nodes
6964 with types in the TREE_VALUE slots), by adding the hash codes
6965 of the individual types. */
6968 type_hash_list (const_tree list
, inchash::hash
&hstate
)
6972 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
6973 if (TREE_VALUE (tail
) != error_mark_node
)
6974 hstate
.add_object (TYPE_HASH (TREE_VALUE (tail
)));
6977 /* These are the Hashtable callback functions. */
6979 /* Returns true iff the types are equivalent. */
6982 type_cache_hasher::equal (type_hash
*a
, type_hash
*b
)
6984 /* First test the things that are the same for all types. */
6985 if (a
->hash
!= b
->hash
6986 || TREE_CODE (a
->type
) != TREE_CODE (b
->type
)
6987 || TREE_TYPE (a
->type
) != TREE_TYPE (b
->type
)
6988 || !attribute_list_equal (TYPE_ATTRIBUTES (a
->type
),
6989 TYPE_ATTRIBUTES (b
->type
))
6990 || (TREE_CODE (a
->type
) != COMPLEX_TYPE
6991 && TYPE_NAME (a
->type
) != TYPE_NAME (b
->type
)))
6994 /* Be careful about comparing arrays before and after the element type
6995 has been completed; don't compare TYPE_ALIGN unless both types are
6997 if (COMPLETE_TYPE_P (a
->type
) && COMPLETE_TYPE_P (b
->type
)
6998 && (TYPE_ALIGN (a
->type
) != TYPE_ALIGN (b
->type
)
6999 || TYPE_MODE (a
->type
) != TYPE_MODE (b
->type
)))
7002 switch (TREE_CODE (a
->type
))
7007 case REFERENCE_TYPE
:
7012 return TYPE_VECTOR_SUBPARTS (a
->type
) == TYPE_VECTOR_SUBPARTS (b
->type
);
7015 if (TYPE_VALUES (a
->type
) != TYPE_VALUES (b
->type
)
7016 && !(TYPE_VALUES (a
->type
)
7017 && TREE_CODE (TYPE_VALUES (a
->type
)) == TREE_LIST
7018 && TYPE_VALUES (b
->type
)
7019 && TREE_CODE (TYPE_VALUES (b
->type
)) == TREE_LIST
7020 && type_list_equal (TYPE_VALUES (a
->type
),
7021 TYPE_VALUES (b
->type
))))
7029 if (TYPE_PRECISION (a
->type
) != TYPE_PRECISION (b
->type
))
7031 return ((TYPE_MAX_VALUE (a
->type
) == TYPE_MAX_VALUE (b
->type
)
7032 || tree_int_cst_equal (TYPE_MAX_VALUE (a
->type
),
7033 TYPE_MAX_VALUE (b
->type
)))
7034 && (TYPE_MIN_VALUE (a
->type
) == TYPE_MIN_VALUE (b
->type
)
7035 || tree_int_cst_equal (TYPE_MIN_VALUE (a
->type
),
7036 TYPE_MIN_VALUE (b
->type
))));
7038 case FIXED_POINT_TYPE
:
7039 return TYPE_SATURATING (a
->type
) == TYPE_SATURATING (b
->type
);
7042 return TYPE_OFFSET_BASETYPE (a
->type
) == TYPE_OFFSET_BASETYPE (b
->type
);
7045 if (TYPE_METHOD_BASETYPE (a
->type
) == TYPE_METHOD_BASETYPE (b
->type
)
7046 && (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7047 || (TYPE_ARG_TYPES (a
->type
)
7048 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7049 && TYPE_ARG_TYPES (b
->type
)
7050 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7051 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7052 TYPE_ARG_TYPES (b
->type
)))))
7056 return TYPE_DOMAIN (a
->type
) == TYPE_DOMAIN (b
->type
);
7060 case QUAL_UNION_TYPE
:
7061 return (TYPE_FIELDS (a
->type
) == TYPE_FIELDS (b
->type
)
7062 || (TYPE_FIELDS (a
->type
)
7063 && TREE_CODE (TYPE_FIELDS (a
->type
)) == TREE_LIST
7064 && TYPE_FIELDS (b
->type
)
7065 && TREE_CODE (TYPE_FIELDS (b
->type
)) == TREE_LIST
7066 && type_list_equal (TYPE_FIELDS (a
->type
),
7067 TYPE_FIELDS (b
->type
))));
7070 if (TYPE_ARG_TYPES (a
->type
) == TYPE_ARG_TYPES (b
->type
)
7071 || (TYPE_ARG_TYPES (a
->type
)
7072 && TREE_CODE (TYPE_ARG_TYPES (a
->type
)) == TREE_LIST
7073 && TYPE_ARG_TYPES (b
->type
)
7074 && TREE_CODE (TYPE_ARG_TYPES (b
->type
)) == TREE_LIST
7075 && type_list_equal (TYPE_ARG_TYPES (a
->type
),
7076 TYPE_ARG_TYPES (b
->type
))))
7084 if (lang_hooks
.types
.type_hash_eq
!= NULL
)
7085 return lang_hooks
.types
.type_hash_eq (a
->type
, b
->type
);
7090 /* Given TYPE, and HASHCODE its hash code, return the canonical
7091 object for an identical type if one already exists.
7092 Otherwise, return TYPE, and record it as the canonical object.
7094 To use this function, first create a type of the sort you want.
7095 Then compute its hash code from the fields of the type that
7096 make it different from other similar types.
7097 Then call this function and use the value. */
7100 type_hash_canon (unsigned int hashcode
, tree type
)
7105 /* The hash table only contains main variants, so ensure that's what we're
7107 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
7109 /* The TYPE_ALIGN field of a type is set by layout_type(), so we
7110 must call that routine before comparing TYPE_ALIGNs. */
7116 loc
= type_hash_table
->find_slot_with_hash (&in
, hashcode
, INSERT
);
7119 tree t1
= ((type_hash
*) *loc
)->type
;
7120 gcc_assert (TYPE_MAIN_VARIANT (t1
) == t1
);
7126 struct type_hash
*h
;
7128 h
= ggc_alloc
<type_hash
> ();
7138 print_type_hash_statistics (void)
7140 fprintf (stderr
, "Type hash: size %ld, %ld elements, %f collisions\n",
7141 (long) type_hash_table
->size (),
7142 (long) type_hash_table
->elements (),
7143 type_hash_table
->collisions ());
7146 /* Compute a hash code for a list of attributes (chain of TREE_LIST nodes
7147 with names in the TREE_PURPOSE slots and args in the TREE_VALUE slots),
7148 by adding the hash codes of the individual attributes. */
7151 attribute_hash_list (const_tree list
, inchash::hash
&hstate
)
7155 for (tail
= list
; tail
; tail
= TREE_CHAIN (tail
))
7156 /* ??? Do we want to add in TREE_VALUE too? */
7157 hstate
.add_object (IDENTIFIER_HASH_VALUE (get_attribute_name (tail
)));
7160 /* Given two lists of attributes, return true if list l2 is
7161 equivalent to l1. */
7164 attribute_list_equal (const_tree l1
, const_tree l2
)
7169 return attribute_list_contained (l1
, l2
)
7170 && attribute_list_contained (l2
, l1
);
7173 /* Given two lists of attributes, return true if list L2 is
7174 completely contained within L1. */
7175 /* ??? This would be faster if attribute names were stored in a canonicalized
7176 form. Otherwise, if L1 uses `foo' and L2 uses `__foo__', the long method
7177 must be used to show these elements are equivalent (which they are). */
7178 /* ??? It's not clear that attributes with arguments will always be handled
7182 attribute_list_contained (const_tree l1
, const_tree l2
)
7186 /* First check the obvious, maybe the lists are identical. */
7190 /* Maybe the lists are similar. */
7191 for (t1
= l1
, t2
= l2
;
7193 && get_attribute_name (t1
) == get_attribute_name (t2
)
7194 && TREE_VALUE (t1
) == TREE_VALUE (t2
);
7195 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7198 /* Maybe the lists are equal. */
7199 if (t1
== 0 && t2
== 0)
7202 for (; t2
!= 0; t2
= TREE_CHAIN (t2
))
7205 /* This CONST_CAST is okay because lookup_attribute does not
7206 modify its argument and the return value is assigned to a
7208 for (attr
= lookup_ident_attribute (get_attribute_name (t2
),
7209 CONST_CAST_TREE (l1
));
7210 attr
!= NULL_TREE
&& !attribute_value_equal (t2
, attr
);
7211 attr
= lookup_ident_attribute (get_attribute_name (t2
),
7215 if (attr
== NULL_TREE
)
7222 /* Given two lists of types
7223 (chains of TREE_LIST nodes with types in the TREE_VALUE slots)
7224 return 1 if the lists contain the same types in the same order.
7225 Also, the TREE_PURPOSEs must match. */
7228 type_list_equal (const_tree l1
, const_tree l2
)
7232 for (t1
= l1
, t2
= l2
; t1
&& t2
; t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
))
7233 if (TREE_VALUE (t1
) != TREE_VALUE (t2
)
7234 || (TREE_PURPOSE (t1
) != TREE_PURPOSE (t2
)
7235 && ! (1 == simple_cst_equal (TREE_PURPOSE (t1
), TREE_PURPOSE (t2
))
7236 && (TREE_TYPE (TREE_PURPOSE (t1
))
7237 == TREE_TYPE (TREE_PURPOSE (t2
))))))
7243 /* Returns the number of arguments to the FUNCTION_TYPE or METHOD_TYPE
7244 given by TYPE. If the argument list accepts variable arguments,
7245 then this function counts only the ordinary arguments. */
7248 type_num_arguments (const_tree type
)
7253 for (t
= TYPE_ARG_TYPES (type
); t
; t
= TREE_CHAIN (t
))
7254 /* If the function does not take a variable number of arguments,
7255 the last element in the list will have type `void'. */
7256 if (VOID_TYPE_P (TREE_VALUE (t
)))
7264 /* Nonzero if integer constants T1 and T2
7265 represent the same constant value. */
7268 tree_int_cst_equal (const_tree t1
, const_tree t2
)
7273 if (t1
== 0 || t2
== 0)
7276 if (TREE_CODE (t1
) == INTEGER_CST
7277 && TREE_CODE (t2
) == INTEGER_CST
7278 && wi::to_widest (t1
) == wi::to_widest (t2
))
7284 /* Return true if T is an INTEGER_CST whose numerical value (extended
7285 according to TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. */
7288 tree_fits_shwi_p (const_tree t
)
7290 return (t
!= NULL_TREE
7291 && TREE_CODE (t
) == INTEGER_CST
7292 && wi::fits_shwi_p (wi::to_widest (t
)));
7295 /* Return true if T is an INTEGER_CST whose numerical value (extended
7296 according to TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. */
7299 tree_fits_uhwi_p (const_tree t
)
7301 return (t
!= NULL_TREE
7302 && TREE_CODE (t
) == INTEGER_CST
7303 && wi::fits_uhwi_p (wi::to_widest (t
)));
7306 /* T is an INTEGER_CST whose numerical value (extended according to
7307 TYPE_UNSIGNED) fits in a signed HOST_WIDE_INT. Return that
7311 tree_to_shwi (const_tree t
)
7313 gcc_assert (tree_fits_shwi_p (t
));
7314 return TREE_INT_CST_LOW (t
);
7317 /* T is an INTEGER_CST whose numerical value (extended according to
7318 TYPE_UNSIGNED) fits in an unsigned HOST_WIDE_INT. Return that
7321 unsigned HOST_WIDE_INT
7322 tree_to_uhwi (const_tree t
)
7324 gcc_assert (tree_fits_uhwi_p (t
));
7325 return TREE_INT_CST_LOW (t
);
7328 /* Return the most significant (sign) bit of T. */
7331 tree_int_cst_sign_bit (const_tree t
)
7333 unsigned bitno
= TYPE_PRECISION (TREE_TYPE (t
)) - 1;
7335 return wi::extract_uhwi (t
, bitno
, 1);
7338 /* Return an indication of the sign of the integer constant T.
7339 The return value is -1 if T < 0, 0 if T == 0, and 1 if T > 0.
7340 Note that -1 will never be returned if T's type is unsigned. */
7343 tree_int_cst_sgn (const_tree t
)
7345 if (wi::eq_p (t
, 0))
7347 else if (TYPE_UNSIGNED (TREE_TYPE (t
)))
7349 else if (wi::neg_p (t
))
7355 /* Return the minimum number of bits needed to represent VALUE in a
7356 signed or unsigned type, UNSIGNEDP says which. */
7359 tree_int_cst_min_precision (tree value
, signop sgn
)
7361 /* If the value is negative, compute its negative minus 1. The latter
7362 adjustment is because the absolute value of the largest negative value
7363 is one larger than the largest positive value. This is equivalent to
7364 a bit-wise negation, so use that operation instead. */
7366 if (tree_int_cst_sgn (value
) < 0)
7367 value
= fold_build1 (BIT_NOT_EXPR
, TREE_TYPE (value
), value
);
7369 /* Return the number of bits needed, taking into account the fact
7370 that we need one more bit for a signed than unsigned type.
7371 If value is 0 or -1, the minimum precision is 1 no matter
7372 whether unsignedp is true or false. */
7374 if (integer_zerop (value
))
7377 return tree_floor_log2 (value
) + 1 + (sgn
== SIGNED
? 1 : 0) ;
7380 /* Return truthvalue of whether T1 is the same tree structure as T2.
7381 Return 1 if they are the same.
7382 Return 0 if they are understandably different.
7383 Return -1 if either contains tree structure not understood by
7387 simple_cst_equal (const_tree t1
, const_tree t2
)
7389 enum tree_code code1
, code2
;
7395 if (t1
== 0 || t2
== 0)
7398 code1
= TREE_CODE (t1
);
7399 code2
= TREE_CODE (t2
);
7401 if (CONVERT_EXPR_CODE_P (code1
) || code1
== NON_LVALUE_EXPR
)
7403 if (CONVERT_EXPR_CODE_P (code2
)
7404 || code2
== NON_LVALUE_EXPR
)
7405 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7407 return simple_cst_equal (TREE_OPERAND (t1
, 0), t2
);
7410 else if (CONVERT_EXPR_CODE_P (code2
)
7411 || code2
== NON_LVALUE_EXPR
)
7412 return simple_cst_equal (t1
, TREE_OPERAND (t2
, 0));
7420 return wi::to_widest (t1
) == wi::to_widest (t2
);
7423 return real_identical (&TREE_REAL_CST (t1
), &TREE_REAL_CST (t2
));
7426 return FIXED_VALUES_IDENTICAL (TREE_FIXED_CST (t1
), TREE_FIXED_CST (t2
));
7429 return (TREE_STRING_LENGTH (t1
) == TREE_STRING_LENGTH (t2
)
7430 && ! memcmp (TREE_STRING_POINTER (t1
), TREE_STRING_POINTER (t2
),
7431 TREE_STRING_LENGTH (t1
)));
7435 unsigned HOST_WIDE_INT idx
;
7436 vec
<constructor_elt
, va_gc
> *v1
= CONSTRUCTOR_ELTS (t1
);
7437 vec
<constructor_elt
, va_gc
> *v2
= CONSTRUCTOR_ELTS (t2
);
7439 if (vec_safe_length (v1
) != vec_safe_length (v2
))
7442 for (idx
= 0; idx
< vec_safe_length (v1
); ++idx
)
7443 /* ??? Should we handle also fields here? */
7444 if (!simple_cst_equal ((*v1
)[idx
].value
, (*v2
)[idx
].value
))
7450 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7453 cmp
= simple_cst_equal (CALL_EXPR_FN (t1
), CALL_EXPR_FN (t2
));
7456 if (call_expr_nargs (t1
) != call_expr_nargs (t2
))
7459 const_tree arg1
, arg2
;
7460 const_call_expr_arg_iterator iter1
, iter2
;
7461 for (arg1
= first_const_call_expr_arg (t1
, &iter1
),
7462 arg2
= first_const_call_expr_arg (t2
, &iter2
);
7464 arg1
= next_const_call_expr_arg (&iter1
),
7465 arg2
= next_const_call_expr_arg (&iter2
))
7467 cmp
= simple_cst_equal (arg1
, arg2
);
7471 return arg1
== arg2
;
7475 /* Special case: if either target is an unallocated VAR_DECL,
7476 it means that it's going to be unified with whatever the
7477 TARGET_EXPR is really supposed to initialize, so treat it
7478 as being equivalent to anything. */
7479 if ((TREE_CODE (TREE_OPERAND (t1
, 0)) == VAR_DECL
7480 && DECL_NAME (TREE_OPERAND (t1
, 0)) == NULL_TREE
7481 && !DECL_RTL_SET_P (TREE_OPERAND (t1
, 0)))
7482 || (TREE_CODE (TREE_OPERAND (t2
, 0)) == VAR_DECL
7483 && DECL_NAME (TREE_OPERAND (t2
, 0)) == NULL_TREE
7484 && !DECL_RTL_SET_P (TREE_OPERAND (t2
, 0))))
7487 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7492 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t2
, 1));
7494 case WITH_CLEANUP_EXPR
:
7495 cmp
= simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7499 return simple_cst_equal (TREE_OPERAND (t1
, 1), TREE_OPERAND (t1
, 1));
7502 if (TREE_OPERAND (t1
, 1) == TREE_OPERAND (t2
, 1))
7503 return simple_cst_equal (TREE_OPERAND (t1
, 0), TREE_OPERAND (t2
, 0));
7517 /* This general rule works for most tree codes. All exceptions should be
7518 handled above. If this is a language-specific tree code, we can't
7519 trust what might be in the operand, so say we don't know
7521 if ((int) code1
>= (int) LAST_AND_UNUSED_TREE_CODE
)
7524 switch (TREE_CODE_CLASS (code1
))
7528 case tcc_comparison
:
7529 case tcc_expression
:
7533 for (i
= 0; i
< TREE_CODE_LENGTH (code1
); i
++)
7535 cmp
= simple_cst_equal (TREE_OPERAND (t1
, i
), TREE_OPERAND (t2
, i
));
7547 /* Compare the value of T, an INTEGER_CST, with U, an unsigned integer value.
7548 Return -1, 0, or 1 if the value of T is less than, equal to, or greater
7549 than U, respectively. */
7552 compare_tree_int (const_tree t
, unsigned HOST_WIDE_INT u
)
7554 if (tree_int_cst_sgn (t
) < 0)
7556 else if (!tree_fits_uhwi_p (t
))
7558 else if (TREE_INT_CST_LOW (t
) == u
)
7560 else if (TREE_INT_CST_LOW (t
) < u
)
7566 /* Return true if SIZE represents a constant size that is in bounds of
7567 what the middle-end and the backend accepts (covering not more than
7568 half of the address-space). */
7571 valid_constant_size_p (const_tree size
)
7573 if (! tree_fits_uhwi_p (size
)
7574 || TREE_OVERFLOW (size
)
7575 || tree_int_cst_sign_bit (size
) != 0)
7580 /* Return the precision of the type, or for a complex or vector type the
7581 precision of the type of its elements. */
7584 element_precision (const_tree type
)
7587 type
= TREE_TYPE (type
);
7588 enum tree_code code
= TREE_CODE (type
);
7589 if (code
== COMPLEX_TYPE
|| code
== VECTOR_TYPE
)
7590 type
= TREE_TYPE (type
);
7592 return TYPE_PRECISION (type
);
7595 /* Return true if CODE represents an associative tree code. Otherwise
7598 associative_tree_code (enum tree_code code
)
7617 /* Return true if CODE represents a commutative tree code. Otherwise
7620 commutative_tree_code (enum tree_code code
)
7626 case MULT_HIGHPART_EXPR
:
7634 case UNORDERED_EXPR
:
7638 case TRUTH_AND_EXPR
:
7639 case TRUTH_XOR_EXPR
:
7641 case WIDEN_MULT_EXPR
:
7642 case VEC_WIDEN_MULT_HI_EXPR
:
7643 case VEC_WIDEN_MULT_LO_EXPR
:
7644 case VEC_WIDEN_MULT_EVEN_EXPR
:
7645 case VEC_WIDEN_MULT_ODD_EXPR
:
7654 /* Return true if CODE represents a ternary tree code for which the
7655 first two operands are commutative. Otherwise return false. */
7657 commutative_ternary_tree_code (enum tree_code code
)
7661 case WIDEN_MULT_PLUS_EXPR
:
7662 case WIDEN_MULT_MINUS_EXPR
:
7673 /* Returns true if CODE can overflow. */
7676 operation_can_overflow (enum tree_code code
)
7684 /* Can overflow in various ways. */
7686 case TRUNC_DIV_EXPR
:
7687 case EXACT_DIV_EXPR
:
7688 case FLOOR_DIV_EXPR
:
7690 /* For INT_MIN / -1. */
7697 /* These operators cannot overflow. */
7702 /* Returns true if CODE operating on operands of type TYPE doesn't overflow, or
7703 ftrapv doesn't generate trapping insns for CODE. */
7706 operation_no_trapping_overflow (tree type
, enum tree_code code
)
7708 gcc_checking_assert (ANY_INTEGRAL_TYPE_P (type
));
7710 /* We don't generate instructions that trap on overflow for complex or vector
7712 if (!INTEGRAL_TYPE_P (type
))
7715 if (!TYPE_OVERFLOW_TRAPS (type
))
7725 /* These operators can overflow, and -ftrapv generates trapping code for
7728 case TRUNC_DIV_EXPR
:
7729 case EXACT_DIV_EXPR
:
7730 case FLOOR_DIV_EXPR
:
7733 /* These operators can overflow, but -ftrapv does not generate trapping
7737 /* These operators cannot overflow. */
7745 /* Generate a hash value for an expression. This can be used iteratively
7746 by passing a previous result as the HSTATE argument.
7748 This function is intended to produce the same hash for expressions which
7749 would compare equal using operand_equal_p. */
7751 add_expr (const_tree t
, inchash::hash
&hstate
, unsigned int flags
)
7754 enum tree_code code
;
7755 enum tree_code_class tclass
;
7759 hstate
.merge_hash (0);
7763 if (!(flags
& OEP_ADDRESS_OF
))
7766 code
= TREE_CODE (t
);
7770 /* Alas, constants aren't shared, so we can't rely on pointer
7773 hstate
.merge_hash (0);
7776 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7777 for (i
= 0; i
< TREE_INT_CST_EXT_NUNITS (t
); i
++)
7778 hstate
.add_wide_int (TREE_INT_CST_ELT (t
, i
));
7783 if (!HONOR_SIGNED_ZEROS (t
) && real_zerop (t
))
7786 val2
= real_hash (TREE_REAL_CST_PTR (t
));
7787 hstate
.merge_hash (val2
);
7792 unsigned int val2
= fixed_hash (TREE_FIXED_CST_PTR (t
));
7793 hstate
.merge_hash (val2
);
7797 hstate
.add ((const void *) TREE_STRING_POINTER (t
),
7798 TREE_STRING_LENGTH (t
));
7801 inchash::add_expr (TREE_REALPART (t
), hstate
, flags
);
7802 inchash::add_expr (TREE_IMAGPART (t
), hstate
, flags
);
7807 for (i
= 0; i
< VECTOR_CST_NELTS (t
); ++i
)
7808 inchash::add_expr (VECTOR_CST_ELT (t
, i
), hstate
, flags
);
7812 /* We can just compare by pointer. */
7813 hstate
.add_wide_int (SSA_NAME_VERSION (t
));
7815 case PLACEHOLDER_EXPR
:
7816 /* The node itself doesn't matter. */
7823 /* A list of expressions, for a CALL_EXPR or as the elements of a
7825 for (; t
; t
= TREE_CHAIN (t
))
7826 inchash::add_expr (TREE_VALUE (t
), hstate
, flags
);
7830 unsigned HOST_WIDE_INT idx
;
7832 flags
&= ~OEP_ADDRESS_OF
;
7833 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (t
), idx
, field
, value
)
7835 inchash::add_expr (field
, hstate
, flags
);
7836 inchash::add_expr (value
, hstate
, flags
);
7840 case STATEMENT_LIST
:
7842 tree_stmt_iterator i
;
7843 for (i
= tsi_start (CONST_CAST_TREE (t
));
7844 !tsi_end_p (i
); tsi_next (&i
))
7845 inchash::add_expr (tsi_stmt (i
), hstate
, flags
);
7849 /* When referring to a built-in FUNCTION_DECL, use the __builtin__ form.
7850 Otherwise nodes that compare equal according to operand_equal_p might
7851 get different hash codes. However, don't do this for machine specific
7852 or front end builtins, since the function code is overloaded in those
7854 if (DECL_BUILT_IN_CLASS (t
) == BUILT_IN_NORMAL
7855 && builtin_decl_explicit_p (DECL_FUNCTION_CODE (t
)))
7857 t
= builtin_decl_explicit (DECL_FUNCTION_CODE (t
));
7858 code
= TREE_CODE (t
);
7862 tclass
= TREE_CODE_CLASS (code
);
7864 if (tclass
== tcc_declaration
)
7866 /* DECL's have a unique ID */
7867 hstate
.add_wide_int (DECL_UID (t
));
7869 else if (tclass
== tcc_comparison
&& !commutative_tree_code (code
))
7871 /* For comparisons that can be swapped, use the lower
7873 enum tree_code ccode
= swap_tree_comparison (code
);
7876 hstate
.add_object (ccode
);
7877 inchash::add_expr (TREE_OPERAND (t
, ccode
!= code
), hstate
, flags
);
7878 inchash::add_expr (TREE_OPERAND (t
, ccode
== code
), hstate
, flags
);
7880 else if (CONVERT_EXPR_CODE_P (code
))
7882 /* NOP_EXPR and CONVERT_EXPR are considered equal by
7884 enum tree_code ccode
= NOP_EXPR
;
7885 hstate
.add_object (ccode
);
7887 /* Don't hash the type, that can lead to having nodes which
7888 compare equal according to operand_equal_p, but which
7889 have different hash codes. Make sure to include signedness
7890 in the hash computation. */
7891 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7892 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7894 /* For OEP_ADDRESS_OF, hash MEM_EXPR[&decl, 0] the same as decl. */
7895 else if (code
== MEM_REF
7896 && (flags
& OEP_ADDRESS_OF
) != 0
7897 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
7898 && DECL_P (TREE_OPERAND (TREE_OPERAND (t
, 0), 0))
7899 && integer_zerop (TREE_OPERAND (t
, 1)))
7900 inchash::add_expr (TREE_OPERAND (TREE_OPERAND (t
, 0), 0),
7902 /* Don't ICE on FE specific trees, or their arguments etc.
7903 during operand_equal_p hash verification. */
7904 else if (!IS_EXPR_CODE_CLASS (tclass
))
7905 gcc_assert (flags
& OEP_HASH_CHECK
);
7908 unsigned int sflags
= flags
;
7910 hstate
.add_object (code
);
7915 gcc_checking_assert (!(flags
& OEP_ADDRESS_OF
));
7916 flags
|= OEP_ADDRESS_OF
;
7922 case TARGET_MEM_REF
:
7923 flags
&= ~OEP_ADDRESS_OF
;
7928 case ARRAY_RANGE_REF
:
7931 sflags
&= ~OEP_ADDRESS_OF
;
7935 flags
&= ~OEP_ADDRESS_OF
;
7939 case WIDEN_MULT_PLUS_EXPR
:
7940 case WIDEN_MULT_MINUS_EXPR
:
7942 /* The multiplication operands are commutative. */
7943 inchash::hash one
, two
;
7944 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7945 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7946 hstate
.add_commutative (one
, two
);
7947 inchash::add_expr (TREE_OPERAND (t
, 2), two
, flags
);
7952 if (CALL_EXPR_FN (t
) == NULL_TREE
)
7953 hstate
.add_int (CALL_EXPR_IFN (t
));
7957 /* For TARGET_EXPR, just hash on the TARGET_EXPR_SLOT.
7958 Usually different TARGET_EXPRs just should use
7959 different temporaries in their slots. */
7960 inchash::add_expr (TARGET_EXPR_SLOT (t
), hstate
, flags
);
7967 /* Don't hash the type, that can lead to having nodes which
7968 compare equal according to operand_equal_p, but which
7969 have different hash codes. */
7970 if (code
== NON_LVALUE_EXPR
)
7972 /* Make sure to include signness in the hash computation. */
7973 hstate
.add_int (TYPE_UNSIGNED (TREE_TYPE (t
)));
7974 inchash::add_expr (TREE_OPERAND (t
, 0), hstate
, flags
);
7977 else if (commutative_tree_code (code
))
7979 /* It's a commutative expression. We want to hash it the same
7980 however it appears. We do this by first hashing both operands
7981 and then rehashing based on the order of their independent
7983 inchash::hash one
, two
;
7984 inchash::add_expr (TREE_OPERAND (t
, 0), one
, flags
);
7985 inchash::add_expr (TREE_OPERAND (t
, 1), two
, flags
);
7986 hstate
.add_commutative (one
, two
);
7989 for (i
= TREE_OPERAND_LENGTH (t
) - 1; i
>= 0; --i
)
7990 inchash::add_expr (TREE_OPERAND (t
, i
), hstate
,
7991 i
== 0 ? flags
: sflags
);
7999 /* Constructors for pointer, array and function types.
8000 (RECORD_TYPE, UNION_TYPE and ENUMERAL_TYPE nodes are
8001 constructed by language-dependent code, not here.) */
8003 /* Construct, lay out and return the type of pointers to TO_TYPE with
8004 mode MODE. If CAN_ALIAS_ALL is TRUE, indicate this type can
8005 reference all of memory. If such a type has already been
8006 constructed, reuse it. */
8009 build_pointer_type_for_mode (tree to_type
, machine_mode mode
,
8013 bool could_alias
= can_alias_all
;
8015 if (to_type
== error_mark_node
)
8016 return error_mark_node
;
8018 /* If the pointed-to type has the may_alias attribute set, force
8019 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8020 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8021 can_alias_all
= true;
8023 /* In some cases, languages will have things that aren't a POINTER_TYPE
8024 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_POINTER_TO.
8025 In that case, return that type without regard to the rest of our
8028 ??? This is a kludge, but consistent with the way this function has
8029 always operated and there doesn't seem to be a good way to avoid this
8031 if (TYPE_POINTER_TO (to_type
) != 0
8032 && TREE_CODE (TYPE_POINTER_TO (to_type
)) != POINTER_TYPE
)
8033 return TYPE_POINTER_TO (to_type
);
8035 /* First, if we already have a type for pointers to TO_TYPE and it's
8036 the proper mode, use it. */
8037 for (t
= TYPE_POINTER_TO (to_type
); t
; t
= TYPE_NEXT_PTR_TO (t
))
8038 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8041 t
= make_node (POINTER_TYPE
);
8043 TREE_TYPE (t
) = to_type
;
8044 SET_TYPE_MODE (t
, mode
);
8045 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8046 TYPE_NEXT_PTR_TO (t
) = TYPE_POINTER_TO (to_type
);
8047 TYPE_POINTER_TO (to_type
) = t
;
8049 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8050 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8051 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8052 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8054 = build_pointer_type_for_mode (TYPE_CANONICAL (to_type
),
8057 /* Lay out the type. This function has many callers that are concerned
8058 with expression-construction, and this simplifies them all. */
8064 /* By default build pointers in ptr_mode. */
8067 build_pointer_type (tree to_type
)
8069 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8070 : TYPE_ADDR_SPACE (to_type
);
8071 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8072 return build_pointer_type_for_mode (to_type
, pointer_mode
, false);
8075 /* Same as build_pointer_type_for_mode, but for REFERENCE_TYPE. */
8078 build_reference_type_for_mode (tree to_type
, machine_mode mode
,
8082 bool could_alias
= can_alias_all
;
8084 if (to_type
== error_mark_node
)
8085 return error_mark_node
;
8087 /* If the pointed-to type has the may_alias attribute set, force
8088 a TYPE_REF_CAN_ALIAS_ALL pointer to be generated. */
8089 if (lookup_attribute ("may_alias", TYPE_ATTRIBUTES (to_type
)))
8090 can_alias_all
= true;
8092 /* In some cases, languages will have things that aren't a REFERENCE_TYPE
8093 (such as a RECORD_TYPE for fat pointers in Ada) as TYPE_REFERENCE_TO.
8094 In that case, return that type without regard to the rest of our
8097 ??? This is a kludge, but consistent with the way this function has
8098 always operated and there doesn't seem to be a good way to avoid this
8100 if (TYPE_REFERENCE_TO (to_type
) != 0
8101 && TREE_CODE (TYPE_REFERENCE_TO (to_type
)) != REFERENCE_TYPE
)
8102 return TYPE_REFERENCE_TO (to_type
);
8104 /* First, if we already have a type for pointers to TO_TYPE and it's
8105 the proper mode, use it. */
8106 for (t
= TYPE_REFERENCE_TO (to_type
); t
; t
= TYPE_NEXT_REF_TO (t
))
8107 if (TYPE_MODE (t
) == mode
&& TYPE_REF_CAN_ALIAS_ALL (t
) == can_alias_all
)
8110 t
= make_node (REFERENCE_TYPE
);
8112 TREE_TYPE (t
) = to_type
;
8113 SET_TYPE_MODE (t
, mode
);
8114 TYPE_REF_CAN_ALIAS_ALL (t
) = can_alias_all
;
8115 TYPE_NEXT_REF_TO (t
) = TYPE_REFERENCE_TO (to_type
);
8116 TYPE_REFERENCE_TO (to_type
) = t
;
8118 /* During LTO we do not set TYPE_CANONICAL of pointers and references. */
8119 if (TYPE_STRUCTURAL_EQUALITY_P (to_type
) || in_lto_p
)
8120 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8121 else if (TYPE_CANONICAL (to_type
) != to_type
|| could_alias
)
8123 = build_reference_type_for_mode (TYPE_CANONICAL (to_type
),
8132 /* Build the node for the type of references-to-TO_TYPE by default
8136 build_reference_type (tree to_type
)
8138 addr_space_t as
= to_type
== error_mark_node
? ADDR_SPACE_GENERIC
8139 : TYPE_ADDR_SPACE (to_type
);
8140 machine_mode pointer_mode
= targetm
.addr_space
.pointer_mode (as
);
8141 return build_reference_type_for_mode (to_type
, pointer_mode
, false);
8144 #define MAX_INT_CACHED_PREC \
8145 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8146 static GTY(()) tree nonstandard_integer_type_cache
[2 * MAX_INT_CACHED_PREC
+ 2];
8148 /* Builds a signed or unsigned integer type of precision PRECISION.
8149 Used for C bitfields whose precision does not match that of
8150 built-in target types. */
8152 build_nonstandard_integer_type (unsigned HOST_WIDE_INT precision
,
8158 unsignedp
= MAX_INT_CACHED_PREC
+ 1;
8160 if (precision
<= MAX_INT_CACHED_PREC
)
8162 itype
= nonstandard_integer_type_cache
[precision
+ unsignedp
];
8167 itype
= make_node (INTEGER_TYPE
);
8168 TYPE_PRECISION (itype
) = precision
;
8171 fixup_unsigned_type (itype
);
8173 fixup_signed_type (itype
);
8176 if (tree_fits_uhwi_p (TYPE_MAX_VALUE (itype
)))
8177 ret
= type_hash_canon (tree_to_uhwi (TYPE_MAX_VALUE (itype
)), itype
);
8178 if (precision
<= MAX_INT_CACHED_PREC
)
8179 nonstandard_integer_type_cache
[precision
+ unsignedp
] = ret
;
8184 #define MAX_BOOL_CACHED_PREC \
8185 (HOST_BITS_PER_WIDE_INT > 64 ? HOST_BITS_PER_WIDE_INT : 64)
8186 static GTY(()) tree nonstandard_boolean_type_cache
[MAX_BOOL_CACHED_PREC
+ 1];
8188 /* Builds a boolean type of precision PRECISION.
8189 Used for boolean vectors to choose proper vector element size. */
8191 build_nonstandard_boolean_type (unsigned HOST_WIDE_INT precision
)
8195 if (precision
<= MAX_BOOL_CACHED_PREC
)
8197 type
= nonstandard_boolean_type_cache
[precision
];
8202 type
= make_node (BOOLEAN_TYPE
);
8203 TYPE_PRECISION (type
) = precision
;
8204 fixup_signed_type (type
);
8206 if (precision
<= MAX_INT_CACHED_PREC
)
8207 nonstandard_boolean_type_cache
[precision
] = type
;
8212 /* Create a range of some discrete type TYPE (an INTEGER_TYPE, ENUMERAL_TYPE
8213 or BOOLEAN_TYPE) with low bound LOWVAL and high bound HIGHVAL. If SHARED
8214 is true, reuse such a type that has already been constructed. */
8217 build_range_type_1 (tree type
, tree lowval
, tree highval
, bool shared
)
8219 tree itype
= make_node (INTEGER_TYPE
);
8220 inchash::hash hstate
;
8222 TREE_TYPE (itype
) = type
;
8224 TYPE_MIN_VALUE (itype
) = fold_convert (type
, lowval
);
8225 TYPE_MAX_VALUE (itype
) = highval
? fold_convert (type
, highval
) : NULL
;
8227 TYPE_PRECISION (itype
) = TYPE_PRECISION (type
);
8228 SET_TYPE_MODE (itype
, TYPE_MODE (type
));
8229 TYPE_SIZE (itype
) = TYPE_SIZE (type
);
8230 TYPE_SIZE_UNIT (itype
) = TYPE_SIZE_UNIT (type
);
8231 SET_TYPE_ALIGN (itype
, TYPE_ALIGN (type
));
8232 TYPE_USER_ALIGN (itype
) = TYPE_USER_ALIGN (type
);
8237 if ((TYPE_MIN_VALUE (itype
)
8238 && TREE_CODE (TYPE_MIN_VALUE (itype
)) != INTEGER_CST
)
8239 || (TYPE_MAX_VALUE (itype
)
8240 && TREE_CODE (TYPE_MAX_VALUE (itype
)) != INTEGER_CST
))
8242 /* Since we cannot reliably merge this type, we need to compare it using
8243 structural equality checks. */
8244 SET_TYPE_STRUCTURAL_EQUALITY (itype
);
8248 inchash::add_expr (TYPE_MIN_VALUE (itype
), hstate
);
8249 inchash::add_expr (TYPE_MAX_VALUE (itype
), hstate
);
8250 hstate
.merge_hash (TYPE_HASH (type
));
8251 itype
= type_hash_canon (hstate
.end (), itype
);
8256 /* Wrapper around build_range_type_1 with SHARED set to true. */
8259 build_range_type (tree type
, tree lowval
, tree highval
)
8261 return build_range_type_1 (type
, lowval
, highval
, true);
8264 /* Wrapper around build_range_type_1 with SHARED set to false. */
8267 build_nonshared_range_type (tree type
, tree lowval
, tree highval
)
8269 return build_range_type_1 (type
, lowval
, highval
, false);
8272 /* Create a type of integers to be the TYPE_DOMAIN of an ARRAY_TYPE.
8273 MAXVAL should be the maximum value in the domain
8274 (one less than the length of the array).
8276 The maximum value that MAXVAL can have is INT_MAX for a HOST_WIDE_INT.
8277 We don't enforce this limit, that is up to caller (e.g. language front end).
8278 The limit exists because the result is a signed type and we don't handle
8279 sizes that use more than one HOST_WIDE_INT. */
8282 build_index_type (tree maxval
)
8284 return build_range_type (sizetype
, size_zero_node
, maxval
);
8287 /* Return true if the debug information for TYPE, a subtype, should be emitted
8288 as a subrange type. If so, set LOWVAL to the low bound and HIGHVAL to the
8289 high bound, respectively. Sometimes doing so unnecessarily obfuscates the
8290 debug info and doesn't reflect the source code. */
8293 subrange_type_for_debug_p (const_tree type
, tree
*lowval
, tree
*highval
)
8295 tree base_type
= TREE_TYPE (type
), low
, high
;
8297 /* Subrange types have a base type which is an integral type. */
8298 if (!INTEGRAL_TYPE_P (base_type
))
8301 /* Get the real bounds of the subtype. */
8302 if (lang_hooks
.types
.get_subrange_bounds
)
8303 lang_hooks
.types
.get_subrange_bounds (type
, &low
, &high
);
8306 low
= TYPE_MIN_VALUE (type
);
8307 high
= TYPE_MAX_VALUE (type
);
8310 /* If the type and its base type have the same representation and the same
8311 name, then the type is not a subrange but a copy of the base type. */
8312 if ((TREE_CODE (base_type
) == INTEGER_TYPE
8313 || TREE_CODE (base_type
) == BOOLEAN_TYPE
)
8314 && int_size_in_bytes (type
) == int_size_in_bytes (base_type
)
8315 && tree_int_cst_equal (low
, TYPE_MIN_VALUE (base_type
))
8316 && tree_int_cst_equal (high
, TYPE_MAX_VALUE (base_type
))
8317 && TYPE_IDENTIFIER (type
) == TYPE_IDENTIFIER (base_type
))
8327 /* Construct, lay out and return the type of arrays of elements with ELT_TYPE
8328 and number of elements specified by the range of values of INDEX_TYPE.
8329 If SHARED is true, reuse such a type that has already been constructed. */
8332 build_array_type_1 (tree elt_type
, tree index_type
, bool shared
)
8336 if (TREE_CODE (elt_type
) == FUNCTION_TYPE
)
8338 error ("arrays of functions are not meaningful");
8339 elt_type
= integer_type_node
;
8342 t
= make_node (ARRAY_TYPE
);
8343 TREE_TYPE (t
) = elt_type
;
8344 TYPE_DOMAIN (t
) = index_type
;
8345 TYPE_ADDR_SPACE (t
) = TYPE_ADDR_SPACE (elt_type
);
8348 /* If the element type is incomplete at this point we get marked for
8349 structural equality. Do not record these types in the canonical
8351 if (TYPE_STRUCTURAL_EQUALITY_P (t
))
8356 inchash::hash hstate
;
8357 hstate
.add_object (TYPE_HASH (elt_type
));
8359 hstate
.add_object (TYPE_HASH (index_type
));
8360 t
= type_hash_canon (hstate
.end (), t
);
8363 if (TYPE_CANONICAL (t
) == t
)
8365 if (TYPE_STRUCTURAL_EQUALITY_P (elt_type
)
8366 || (index_type
&& TYPE_STRUCTURAL_EQUALITY_P (index_type
))
8368 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8369 else if (TYPE_CANONICAL (elt_type
) != elt_type
8370 || (index_type
&& TYPE_CANONICAL (index_type
) != index_type
))
8372 = build_array_type_1 (TYPE_CANONICAL (elt_type
),
8374 ? TYPE_CANONICAL (index_type
) : NULL_TREE
,
8381 /* Wrapper around build_array_type_1 with SHARED set to true. */
8384 build_array_type (tree elt_type
, tree index_type
)
8386 return build_array_type_1 (elt_type
, index_type
, true);
8389 /* Wrapper around build_array_type_1 with SHARED set to false. */
8392 build_nonshared_array_type (tree elt_type
, tree index_type
)
8394 return build_array_type_1 (elt_type
, index_type
, false);
8397 /* Return a representation of ELT_TYPE[NELTS], using indices of type
8401 build_array_type_nelts (tree elt_type
, unsigned HOST_WIDE_INT nelts
)
8403 return build_array_type (elt_type
, build_index_type (size_int (nelts
- 1)));
8406 /* Recursively examines the array elements of TYPE, until a non-array
8407 element type is found. */
8410 strip_array_types (tree type
)
8412 while (TREE_CODE (type
) == ARRAY_TYPE
)
8413 type
= TREE_TYPE (type
);
8418 /* Computes the canonical argument types from the argument type list
8421 Upon return, *ANY_STRUCTURAL_P will be true iff either it was true
8422 on entry to this function, or if any of the ARGTYPES are
8425 Upon return, *ANY_NONCANONICAL_P will be true iff either it was
8426 true on entry to this function, or if any of the ARGTYPES are
8429 Returns a canonical argument list, which may be ARGTYPES when the
8430 canonical argument list is unneeded (i.e., *ANY_STRUCTURAL_P is
8431 true) or would not differ from ARGTYPES. */
8434 maybe_canonicalize_argtypes (tree argtypes
,
8435 bool *any_structural_p
,
8436 bool *any_noncanonical_p
)
8439 bool any_noncanonical_argtypes_p
= false;
8441 for (arg
= argtypes
; arg
&& !(*any_structural_p
); arg
= TREE_CHAIN (arg
))
8443 if (!TREE_VALUE (arg
) || TREE_VALUE (arg
) == error_mark_node
)
8444 /* Fail gracefully by stating that the type is structural. */
8445 *any_structural_p
= true;
8446 else if (TYPE_STRUCTURAL_EQUALITY_P (TREE_VALUE (arg
)))
8447 *any_structural_p
= true;
8448 else if (TYPE_CANONICAL (TREE_VALUE (arg
)) != TREE_VALUE (arg
)
8449 || TREE_PURPOSE (arg
))
8450 /* If the argument has a default argument, we consider it
8451 non-canonical even though the type itself is canonical.
8452 That way, different variants of function and method types
8453 with default arguments will all point to the variant with
8454 no defaults as their canonical type. */
8455 any_noncanonical_argtypes_p
= true;
8458 if (*any_structural_p
)
8461 if (any_noncanonical_argtypes_p
)
8463 /* Build the canonical list of argument types. */
8464 tree canon_argtypes
= NULL_TREE
;
8465 bool is_void
= false;
8467 for (arg
= argtypes
; arg
; arg
= TREE_CHAIN (arg
))
8469 if (arg
== void_list_node
)
8472 canon_argtypes
= tree_cons (NULL_TREE
,
8473 TYPE_CANONICAL (TREE_VALUE (arg
)),
8477 canon_argtypes
= nreverse (canon_argtypes
);
8479 canon_argtypes
= chainon (canon_argtypes
, void_list_node
);
8481 /* There is a non-canonical type. */
8482 *any_noncanonical_p
= true;
8483 return canon_argtypes
;
8486 /* The canonical argument types are the same as ARGTYPES. */
8490 /* Construct, lay out and return
8491 the type of functions returning type VALUE_TYPE
8492 given arguments of types ARG_TYPES.
8493 ARG_TYPES is a chain of TREE_LIST nodes whose TREE_VALUEs
8494 are data type nodes for the arguments of the function.
8495 If such a type has already been constructed, reuse it. */
8498 build_function_type (tree value_type
, tree arg_types
)
8501 inchash::hash hstate
;
8502 bool any_structural_p
, any_noncanonical_p
;
8503 tree canon_argtypes
;
8505 if (TREE_CODE (value_type
) == FUNCTION_TYPE
)
8507 error ("function return type cannot be function");
8508 value_type
= integer_type_node
;
8511 /* Make a node of the sort we want. */
8512 t
= make_node (FUNCTION_TYPE
);
8513 TREE_TYPE (t
) = value_type
;
8514 TYPE_ARG_TYPES (t
) = arg_types
;
8516 /* If we already have such a type, use the old one. */
8517 hstate
.add_object (TYPE_HASH (value_type
));
8518 type_hash_list (arg_types
, hstate
);
8519 t
= type_hash_canon (hstate
.end (), t
);
8521 /* Set up the canonical type. */
8522 any_structural_p
= TYPE_STRUCTURAL_EQUALITY_P (value_type
);
8523 any_noncanonical_p
= TYPE_CANONICAL (value_type
) != value_type
;
8524 canon_argtypes
= maybe_canonicalize_argtypes (arg_types
,
8526 &any_noncanonical_p
);
8527 if (any_structural_p
)
8528 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8529 else if (any_noncanonical_p
)
8530 TYPE_CANONICAL (t
) = build_function_type (TYPE_CANONICAL (value_type
),
8533 if (!COMPLETE_TYPE_P (t
))
8538 /* Build a function type. The RETURN_TYPE is the type returned by the
8539 function. If VAARGS is set, no void_type_node is appended to the
8540 list. ARGP must be always be terminated be a NULL_TREE. */
8543 build_function_type_list_1 (bool vaargs
, tree return_type
, va_list argp
)
8547 t
= va_arg (argp
, tree
);
8548 for (args
= NULL_TREE
; t
!= NULL_TREE
; t
= va_arg (argp
, tree
))
8549 args
= tree_cons (NULL_TREE
, t
, args
);
8554 if (args
!= NULL_TREE
)
8555 args
= nreverse (args
);
8556 gcc_assert (last
!= void_list_node
);
8558 else if (args
== NULL_TREE
)
8559 args
= void_list_node
;
8563 args
= nreverse (args
);
8564 TREE_CHAIN (last
) = void_list_node
;
8566 args
= build_function_type (return_type
, args
);
8571 /* Build a function type. The RETURN_TYPE is the type returned by the
8572 function. If additional arguments are provided, they are
8573 additional argument types. The list of argument types must always
8574 be terminated by NULL_TREE. */
8577 build_function_type_list (tree return_type
, ...)
8582 va_start (p
, return_type
);
8583 args
= build_function_type_list_1 (false, return_type
, p
);
8588 /* Build a variable argument function type. The RETURN_TYPE is the
8589 type returned by the function. If additional arguments are provided,
8590 they are additional argument types. The list of argument types must
8591 always be terminated by NULL_TREE. */
8594 build_varargs_function_type_list (tree return_type
, ...)
8599 va_start (p
, return_type
);
8600 args
= build_function_type_list_1 (true, return_type
, p
);
8606 /* Build a function type. RETURN_TYPE is the type returned by the
8607 function; VAARGS indicates whether the function takes varargs. The
8608 function takes N named arguments, the types of which are provided in
8612 build_function_type_array_1 (bool vaargs
, tree return_type
, int n
,
8616 tree t
= vaargs
? NULL_TREE
: void_list_node
;
8618 for (i
= n
- 1; i
>= 0; i
--)
8619 t
= tree_cons (NULL_TREE
, arg_types
[i
], t
);
8621 return build_function_type (return_type
, t
);
8624 /* Build a function type. RETURN_TYPE is the type returned by the
8625 function. The function takes N named arguments, the types of which
8626 are provided in ARG_TYPES. */
8629 build_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8631 return build_function_type_array_1 (false, return_type
, n
, arg_types
);
8634 /* Build a variable argument function type. RETURN_TYPE is the type
8635 returned by the function. The function takes N named arguments, the
8636 types of which are provided in ARG_TYPES. */
8639 build_varargs_function_type_array (tree return_type
, int n
, tree
*arg_types
)
8641 return build_function_type_array_1 (true, return_type
, n
, arg_types
);
8644 /* Build a METHOD_TYPE for a member of BASETYPE. The RETTYPE (a TYPE)
8645 and ARGTYPES (a TREE_LIST) are the return type and arguments types
8646 for the method. An implicit additional parameter (of type
8647 pointer-to-BASETYPE) is added to the ARGTYPES. */
8650 build_method_type_directly (tree basetype
,
8656 inchash::hash hstate
;
8657 bool any_structural_p
, any_noncanonical_p
;
8658 tree canon_argtypes
;
8660 /* Make a node of the sort we want. */
8661 t
= make_node (METHOD_TYPE
);
8663 TYPE_METHOD_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8664 TREE_TYPE (t
) = rettype
;
8665 ptype
= build_pointer_type (basetype
);
8667 /* The actual arglist for this function includes a "hidden" argument
8668 which is "this". Put it into the list of argument types. */
8669 argtypes
= tree_cons (NULL_TREE
, ptype
, argtypes
);
8670 TYPE_ARG_TYPES (t
) = argtypes
;
8672 /* If we already have such a type, use the old one. */
8673 hstate
.add_object (TYPE_HASH (basetype
));
8674 hstate
.add_object (TYPE_HASH (rettype
));
8675 type_hash_list (argtypes
, hstate
);
8676 t
= type_hash_canon (hstate
.end (), t
);
8678 /* Set up the canonical type. */
8680 = (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8681 || TYPE_STRUCTURAL_EQUALITY_P (rettype
));
8683 = (TYPE_CANONICAL (basetype
) != basetype
8684 || TYPE_CANONICAL (rettype
) != rettype
);
8685 canon_argtypes
= maybe_canonicalize_argtypes (TREE_CHAIN (argtypes
),
8687 &any_noncanonical_p
);
8688 if (any_structural_p
)
8689 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8690 else if (any_noncanonical_p
)
8692 = build_method_type_directly (TYPE_CANONICAL (basetype
),
8693 TYPE_CANONICAL (rettype
),
8695 if (!COMPLETE_TYPE_P (t
))
8701 /* Construct, lay out and return the type of methods belonging to class
8702 BASETYPE and whose arguments and values are described by TYPE.
8703 If that type exists already, reuse it.
8704 TYPE must be a FUNCTION_TYPE node. */
8707 build_method_type (tree basetype
, tree type
)
8709 gcc_assert (TREE_CODE (type
) == FUNCTION_TYPE
);
8711 return build_method_type_directly (basetype
,
8713 TYPE_ARG_TYPES (type
));
8716 /* Construct, lay out and return the type of offsets to a value
8717 of type TYPE, within an object of type BASETYPE.
8718 If a suitable offset type exists already, reuse it. */
8721 build_offset_type (tree basetype
, tree type
)
8724 inchash::hash hstate
;
8726 /* Make a node of the sort we want. */
8727 t
= make_node (OFFSET_TYPE
);
8729 TYPE_OFFSET_BASETYPE (t
) = TYPE_MAIN_VARIANT (basetype
);
8730 TREE_TYPE (t
) = type
;
8732 /* If we already have such a type, use the old one. */
8733 hstate
.add_object (TYPE_HASH (basetype
));
8734 hstate
.add_object (TYPE_HASH (type
));
8735 t
= type_hash_canon (hstate
.end (), t
);
8737 if (!COMPLETE_TYPE_P (t
))
8740 if (TYPE_CANONICAL (t
) == t
)
8742 if (TYPE_STRUCTURAL_EQUALITY_P (basetype
)
8743 || TYPE_STRUCTURAL_EQUALITY_P (type
))
8744 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8745 else if (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)) != basetype
8746 || TYPE_CANONICAL (type
) != type
)
8748 = build_offset_type (TYPE_CANONICAL (TYPE_MAIN_VARIANT (basetype
)),
8749 TYPE_CANONICAL (type
));
8755 /* Create a complex type whose components are COMPONENT_TYPE.
8757 If NAMED is true, the type is given a TYPE_NAME. We do not always
8758 do so because this creates a DECL node and thus make the DECL_UIDs
8759 dependent on the type canonicalization hashtable, which is GC-ed,
8760 so the DECL_UIDs would not be stable wrt garbage collection. */
8763 build_complex_type (tree component_type
, bool named
)
8766 inchash::hash hstate
;
8768 gcc_assert (INTEGRAL_TYPE_P (component_type
)
8769 || SCALAR_FLOAT_TYPE_P (component_type
)
8770 || FIXED_POINT_TYPE_P (component_type
));
8772 /* Make a node of the sort we want. */
8773 t
= make_node (COMPLEX_TYPE
);
8775 TREE_TYPE (t
) = TYPE_MAIN_VARIANT (component_type
);
8777 /* If we already have such a type, use the old one. */
8778 hstate
.add_object (TYPE_HASH (component_type
));
8779 t
= type_hash_canon (hstate
.end (), t
);
8781 if (!COMPLETE_TYPE_P (t
))
8784 if (TYPE_CANONICAL (t
) == t
)
8786 if (TYPE_STRUCTURAL_EQUALITY_P (component_type
))
8787 SET_TYPE_STRUCTURAL_EQUALITY (t
);
8788 else if (TYPE_CANONICAL (component_type
) != component_type
)
8790 = build_complex_type (TYPE_CANONICAL (component_type
), named
);
8793 /* We need to create a name, since complex is a fundamental type. */
8794 if (!TYPE_NAME (t
) && named
)
8797 if (component_type
== char_type_node
)
8798 name
= "complex char";
8799 else if (component_type
== signed_char_type_node
)
8800 name
= "complex signed char";
8801 else if (component_type
== unsigned_char_type_node
)
8802 name
= "complex unsigned char";
8803 else if (component_type
== short_integer_type_node
)
8804 name
= "complex short int";
8805 else if (component_type
== short_unsigned_type_node
)
8806 name
= "complex short unsigned int";
8807 else if (component_type
== integer_type_node
)
8808 name
= "complex int";
8809 else if (component_type
== unsigned_type_node
)
8810 name
= "complex unsigned int";
8811 else if (component_type
== long_integer_type_node
)
8812 name
= "complex long int";
8813 else if (component_type
== long_unsigned_type_node
)
8814 name
= "complex long unsigned int";
8815 else if (component_type
== long_long_integer_type_node
)
8816 name
= "complex long long int";
8817 else if (component_type
== long_long_unsigned_type_node
)
8818 name
= "complex long long unsigned int";
8823 TYPE_NAME (t
) = build_decl (UNKNOWN_LOCATION
, TYPE_DECL
,
8824 get_identifier (name
), t
);
8827 return build_qualified_type (t
, TYPE_QUALS (component_type
));
8830 /* If TYPE is a real or complex floating-point type and the target
8831 does not directly support arithmetic on TYPE then return the wider
8832 type to be used for arithmetic on TYPE. Otherwise, return
8836 excess_precision_type (tree type
)
8838 if (flag_excess_precision
!= EXCESS_PRECISION_FAST
)
8840 int flt_eval_method
= TARGET_FLT_EVAL_METHOD
;
8841 switch (TREE_CODE (type
))
8844 switch (flt_eval_method
)
8847 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
))
8848 return double_type_node
;
8851 if (TYPE_MODE (type
) == TYPE_MODE (float_type_node
)
8852 || TYPE_MODE (type
) == TYPE_MODE (double_type_node
))
8853 return long_double_type_node
;
8860 if (TREE_CODE (TREE_TYPE (type
)) != REAL_TYPE
)
8862 switch (flt_eval_method
)
8865 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
))
8866 return complex_double_type_node
;
8869 if (TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (float_type_node
)
8870 || (TYPE_MODE (TREE_TYPE (type
))
8871 == TYPE_MODE (double_type_node
)))
8872 return complex_long_double_type_node
;
8885 /* Return OP, stripped of any conversions to wider types as much as is safe.
8886 Converting the value back to OP's type makes a value equivalent to OP.
8888 If FOR_TYPE is nonzero, we return a value which, if converted to
8889 type FOR_TYPE, would be equivalent to converting OP to type FOR_TYPE.
8891 OP must have integer, real or enumeral type. Pointers are not allowed!
8893 There are some cases where the obvious value we could return
8894 would regenerate to OP if converted to OP's type,
8895 but would not extend like OP to wider types.
8896 If FOR_TYPE indicates such extension is contemplated, we eschew such values.
8897 For example, if OP is (unsigned short)(signed char)-1,
8898 we avoid returning (signed char)-1 if FOR_TYPE is int,
8899 even though extending that to an unsigned short would regenerate OP,
8900 since the result of extending (signed char)-1 to (int)
8901 is different from (int) OP. */
8904 get_unwidened (tree op
, tree for_type
)
8906 /* Set UNS initially if converting OP to FOR_TYPE is a zero-extension. */
8907 tree type
= TREE_TYPE (op
);
8909 = TYPE_PRECISION (for_type
!= 0 ? for_type
: type
);
8911 = (for_type
!= 0 && for_type
!= type
8912 && final_prec
> TYPE_PRECISION (type
)
8913 && TYPE_UNSIGNED (type
));
8916 while (CONVERT_EXPR_P (op
))
8920 /* TYPE_PRECISION on vector types has different meaning
8921 (TYPE_VECTOR_SUBPARTS) and casts from vectors are view conversions,
8922 so avoid them here. */
8923 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (op
, 0))) == VECTOR_TYPE
)
8926 bitschange
= TYPE_PRECISION (TREE_TYPE (op
))
8927 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0)));
8929 /* Truncations are many-one so cannot be removed.
8930 Unless we are later going to truncate down even farther. */
8932 && final_prec
> TYPE_PRECISION (TREE_TYPE (op
)))
8935 /* See what's inside this conversion. If we decide to strip it,
8937 op
= TREE_OPERAND (op
, 0);
8939 /* If we have not stripped any zero-extensions (uns is 0),
8940 we can strip any kind of extension.
8941 If we have previously stripped a zero-extension,
8942 only zero-extensions can safely be stripped.
8943 Any extension can be stripped if the bits it would produce
8944 are all going to be discarded later by truncating to FOR_TYPE. */
8948 if (! uns
|| final_prec
<= TYPE_PRECISION (TREE_TYPE (op
)))
8950 /* TYPE_UNSIGNED says whether this is a zero-extension.
8951 Let's avoid computing it if it does not affect WIN
8952 and if UNS will not be needed again. */
8954 || CONVERT_EXPR_P (op
))
8955 && TYPE_UNSIGNED (TREE_TYPE (op
)))
8963 /* If we finally reach a constant see if it fits in for_type and
8964 in that case convert it. */
8966 && TREE_CODE (win
) == INTEGER_CST
8967 && TREE_TYPE (win
) != for_type
8968 && int_fits_type_p (win
, for_type
))
8969 win
= fold_convert (for_type
, win
);
8974 /* Return OP or a simpler expression for a narrower value
8975 which can be sign-extended or zero-extended to give back OP.
8976 Store in *UNSIGNEDP_PTR either 1 if the value should be zero-extended
8977 or 0 if the value should be sign-extended. */
8980 get_narrower (tree op
, int *unsignedp_ptr
)
8985 bool integral_p
= INTEGRAL_TYPE_P (TREE_TYPE (op
));
8987 while (TREE_CODE (op
) == NOP_EXPR
)
8990 = (TYPE_PRECISION (TREE_TYPE (op
))
8991 - TYPE_PRECISION (TREE_TYPE (TREE_OPERAND (op
, 0))));
8993 /* Truncations are many-one so cannot be removed. */
8997 /* See what's inside this conversion. If we decide to strip it,
9002 op
= TREE_OPERAND (op
, 0);
9003 /* An extension: the outermost one can be stripped,
9004 but remember whether it is zero or sign extension. */
9006 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9007 /* Otherwise, if a sign extension has been stripped,
9008 only sign extensions can now be stripped;
9009 if a zero extension has been stripped, only zero-extensions. */
9010 else if (uns
!= TYPE_UNSIGNED (TREE_TYPE (op
)))
9014 else /* bitschange == 0 */
9016 /* A change in nominal type can always be stripped, but we must
9017 preserve the unsignedness. */
9019 uns
= TYPE_UNSIGNED (TREE_TYPE (op
));
9021 op
= TREE_OPERAND (op
, 0);
9022 /* Keep trying to narrow, but don't assign op to win if it
9023 would turn an integral type into something else. */
9024 if (INTEGRAL_TYPE_P (TREE_TYPE (op
)) != integral_p
)
9031 if (TREE_CODE (op
) == COMPONENT_REF
9032 /* Since type_for_size always gives an integer type. */
9033 && TREE_CODE (TREE_TYPE (op
)) != REAL_TYPE
9034 && TREE_CODE (TREE_TYPE (op
)) != FIXED_POINT_TYPE
9035 /* Ensure field is laid out already. */
9036 && DECL_SIZE (TREE_OPERAND (op
, 1)) != 0
9037 && tree_fits_uhwi_p (DECL_SIZE (TREE_OPERAND (op
, 1))))
9039 unsigned HOST_WIDE_INT innerprec
9040 = tree_to_uhwi (DECL_SIZE (TREE_OPERAND (op
, 1)));
9041 int unsignedp
= (DECL_UNSIGNED (TREE_OPERAND (op
, 1))
9042 || TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (op
, 1))));
9043 tree type
= lang_hooks
.types
.type_for_size (innerprec
, unsignedp
);
9045 /* We can get this structure field in a narrower type that fits it,
9046 but the resulting extension to its nominal type (a fullword type)
9047 must satisfy the same conditions as for other extensions.
9049 Do this only for fields that are aligned (not bit-fields),
9050 because when bit-field insns will be used there is no
9051 advantage in doing this. */
9053 if (innerprec
< TYPE_PRECISION (TREE_TYPE (op
))
9054 && ! DECL_BIT_FIELD (TREE_OPERAND (op
, 1))
9055 && (first
|| uns
== DECL_UNSIGNED (TREE_OPERAND (op
, 1)))
9059 uns
= DECL_UNSIGNED (TREE_OPERAND (op
, 1));
9060 win
= fold_convert (type
, op
);
9064 *unsignedp_ptr
= uns
;
9068 /* Return true if integer constant C has a value that is permissible
9069 for TYPE, an integral type. */
9072 int_fits_type_p (const_tree c
, const_tree type
)
9074 tree type_low_bound
, type_high_bound
;
9075 bool ok_for_low_bound
, ok_for_high_bound
;
9076 signop sgn_c
= TYPE_SIGN (TREE_TYPE (c
));
9078 /* Short-circuit boolean types since various transformations assume that
9079 they can only take values 0 and 1. */
9080 if (TREE_CODE (type
) == BOOLEAN_TYPE
)
9081 return integer_zerop (c
) || integer_onep (c
);
9084 type_low_bound
= TYPE_MIN_VALUE (type
);
9085 type_high_bound
= TYPE_MAX_VALUE (type
);
9087 /* If at least one bound of the type is a constant integer, we can check
9088 ourselves and maybe make a decision. If no such decision is possible, but
9089 this type is a subtype, try checking against that. Otherwise, use
9090 fits_to_tree_p, which checks against the precision.
9092 Compute the status for each possibly constant bound, and return if we see
9093 one does not match. Use ok_for_xxx_bound for this purpose, assigning -1
9094 for "unknown if constant fits", 0 for "constant known *not* to fit" and 1
9095 for "constant known to fit". */
9097 /* Check if c >= type_low_bound. */
9098 if (type_low_bound
&& TREE_CODE (type_low_bound
) == INTEGER_CST
)
9100 if (tree_int_cst_lt (c
, type_low_bound
))
9102 ok_for_low_bound
= true;
9105 ok_for_low_bound
= false;
9107 /* Check if c <= type_high_bound. */
9108 if (type_high_bound
&& TREE_CODE (type_high_bound
) == INTEGER_CST
)
9110 if (tree_int_cst_lt (type_high_bound
, c
))
9112 ok_for_high_bound
= true;
9115 ok_for_high_bound
= false;
9117 /* If the constant fits both bounds, the result is known. */
9118 if (ok_for_low_bound
&& ok_for_high_bound
)
9121 /* Perform some generic filtering which may allow making a decision
9122 even if the bounds are not constant. First, negative integers
9123 never fit in unsigned types, */
9124 if (TYPE_UNSIGNED (type
) && sgn_c
== SIGNED
&& wi::neg_p (c
))
9127 /* Second, narrower types always fit in wider ones. */
9128 if (TYPE_PRECISION (type
) > TYPE_PRECISION (TREE_TYPE (c
)))
9131 /* Third, unsigned integers with top bit set never fit signed types. */
9132 if (!TYPE_UNSIGNED (type
) && sgn_c
== UNSIGNED
)
9134 int prec
= GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (c
))) - 1;
9135 if (prec
< TYPE_PRECISION (TREE_TYPE (c
)))
9137 /* When a tree_cst is converted to a wide-int, the precision
9138 is taken from the type. However, if the precision of the
9139 mode underneath the type is smaller than that, it is
9140 possible that the value will not fit. The test below
9141 fails if any bit is set between the sign bit of the
9142 underlying mode and the top bit of the type. */
9143 if (wi::ne_p (wi::zext (c
, prec
- 1), c
))
9146 else if (wi::neg_p (c
))
9150 /* If we haven't been able to decide at this point, there nothing more we
9151 can check ourselves here. Look at the base type if we have one and it
9152 has the same precision. */
9153 if (TREE_CODE (type
) == INTEGER_TYPE
9154 && TREE_TYPE (type
) != 0
9155 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (type
)))
9157 type
= TREE_TYPE (type
);
9161 /* Or to fits_to_tree_p, if nothing else. */
9162 return wi::fits_to_tree_p (c
, type
);
9165 /* Stores bounds of an integer TYPE in MIN and MAX. If TYPE has non-constant
9166 bounds or is a POINTER_TYPE, the maximum and/or minimum values that can be
9167 represented (assuming two's-complement arithmetic) within the bit
9168 precision of the type are returned instead. */
9171 get_type_static_bounds (const_tree type
, mpz_t min
, mpz_t max
)
9173 if (!POINTER_TYPE_P (type
) && TYPE_MIN_VALUE (type
)
9174 && TREE_CODE (TYPE_MIN_VALUE (type
)) == INTEGER_CST
)
9175 wi::to_mpz (TYPE_MIN_VALUE (type
), min
, TYPE_SIGN (type
));
9178 if (TYPE_UNSIGNED (type
))
9179 mpz_set_ui (min
, 0);
9182 wide_int mn
= wi::min_value (TYPE_PRECISION (type
), SIGNED
);
9183 wi::to_mpz (mn
, min
, SIGNED
);
9187 if (!POINTER_TYPE_P (type
) && TYPE_MAX_VALUE (type
)
9188 && TREE_CODE (TYPE_MAX_VALUE (type
)) == INTEGER_CST
)
9189 wi::to_mpz (TYPE_MAX_VALUE (type
), max
, TYPE_SIGN (type
));
9192 wide_int mn
= wi::max_value (TYPE_PRECISION (type
), TYPE_SIGN (type
));
9193 wi::to_mpz (mn
, max
, TYPE_SIGN (type
));
9197 /* Return true if VAR is an automatic variable defined in function FN. */
9200 auto_var_in_fn_p (const_tree var
, const_tree fn
)
9202 return (DECL_P (var
) && DECL_CONTEXT (var
) == fn
9203 && ((((VAR_P (var
) && ! DECL_EXTERNAL (var
))
9204 || TREE_CODE (var
) == PARM_DECL
)
9205 && ! TREE_STATIC (var
))
9206 || TREE_CODE (var
) == LABEL_DECL
9207 || TREE_CODE (var
) == RESULT_DECL
));
9210 /* Subprogram of following function. Called by walk_tree.
9212 Return *TP if it is an automatic variable or parameter of the
9213 function passed in as DATA. */
9216 find_var_from_fn (tree
*tp
, int *walk_subtrees
, void *data
)
9218 tree fn
= (tree
) data
;
9223 else if (DECL_P (*tp
)
9224 && auto_var_in_fn_p (*tp
, fn
))
9230 /* Returns true if T is, contains, or refers to a type with variable
9231 size. For METHOD_TYPEs and FUNCTION_TYPEs we exclude the
9232 arguments, but not the return type. If FN is nonzero, only return
9233 true if a modifier of the type or position of FN is a variable or
9234 parameter inside FN.
9236 This concept is more general than that of C99 'variably modified types':
9237 in C99, a struct type is never variably modified because a VLA may not
9238 appear as a structure member. However, in GNU C code like:
9240 struct S { int i[f()]; };
9242 is valid, and other languages may define similar constructs. */
9245 variably_modified_type_p (tree type
, tree fn
)
9249 /* Test if T is either variable (if FN is zero) or an expression containing
9250 a variable in FN. If TYPE isn't gimplified, return true also if
9251 gimplify_one_sizepos would gimplify the expression into a local
9253 #define RETURN_TRUE_IF_VAR(T) \
9254 do { tree _t = (T); \
9255 if (_t != NULL_TREE \
9256 && _t != error_mark_node \
9257 && TREE_CODE (_t) != INTEGER_CST \
9258 && TREE_CODE (_t) != PLACEHOLDER_EXPR \
9260 || (!TYPE_SIZES_GIMPLIFIED (type) \
9261 && !is_gimple_sizepos (_t)) \
9262 || walk_tree (&_t, find_var_from_fn, fn, NULL))) \
9263 return true; } while (0)
9265 if (type
== error_mark_node
)
9268 /* If TYPE itself has variable size, it is variably modified. */
9269 RETURN_TRUE_IF_VAR (TYPE_SIZE (type
));
9270 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (type
));
9272 switch (TREE_CODE (type
))
9275 case REFERENCE_TYPE
:
9277 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9283 /* If TYPE is a function type, it is variably modified if the
9284 return type is variably modified. */
9285 if (variably_modified_type_p (TREE_TYPE (type
), fn
))
9291 case FIXED_POINT_TYPE
:
9294 /* Scalar types are variably modified if their end points
9296 RETURN_TRUE_IF_VAR (TYPE_MIN_VALUE (type
));
9297 RETURN_TRUE_IF_VAR (TYPE_MAX_VALUE (type
));
9302 case QUAL_UNION_TYPE
:
9303 /* We can't see if any of the fields are variably-modified by the
9304 definition we normally use, since that would produce infinite
9305 recursion via pointers. */
9306 /* This is variably modified if some field's type is. */
9307 for (t
= TYPE_FIELDS (type
); t
; t
= DECL_CHAIN (t
))
9308 if (TREE_CODE (t
) == FIELD_DECL
)
9310 RETURN_TRUE_IF_VAR (DECL_FIELD_OFFSET (t
));
9311 RETURN_TRUE_IF_VAR (DECL_SIZE (t
));
9312 RETURN_TRUE_IF_VAR (DECL_SIZE_UNIT (t
));
9314 if (TREE_CODE (type
) == QUAL_UNION_TYPE
)
9315 RETURN_TRUE_IF_VAR (DECL_QUALIFIER (t
));
9320 /* Do not call ourselves to avoid infinite recursion. This is
9321 variably modified if the element type is. */
9322 RETURN_TRUE_IF_VAR (TYPE_SIZE (TREE_TYPE (type
)));
9323 RETURN_TRUE_IF_VAR (TYPE_SIZE_UNIT (TREE_TYPE (type
)));
9330 /* The current language may have other cases to check, but in general,
9331 all other types are not variably modified. */
9332 return lang_hooks
.tree_inlining
.var_mod_type_p (type
, fn
);
9334 #undef RETURN_TRUE_IF_VAR
9337 /* Given a DECL or TYPE, return the scope in which it was declared, or
9338 NULL_TREE if there is no containing scope. */
9341 get_containing_scope (const_tree t
)
9343 return (TYPE_P (t
) ? TYPE_CONTEXT (t
) : DECL_CONTEXT (t
));
9346 /* Return the innermost context enclosing DECL that is
9347 a FUNCTION_DECL, or zero if none. */
9350 decl_function_context (const_tree decl
)
9354 if (TREE_CODE (decl
) == ERROR_MARK
)
9357 /* C++ virtual functions use DECL_CONTEXT for the class of the vtable
9358 where we look up the function at runtime. Such functions always take
9359 a first argument of type 'pointer to real context'.
9361 C++ should really be fixed to use DECL_CONTEXT for the real context,
9362 and use something else for the "virtual context". */
9363 else if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VINDEX (decl
))
9366 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
9368 context
= DECL_CONTEXT (decl
);
9370 while (context
&& TREE_CODE (context
) != FUNCTION_DECL
)
9372 if (TREE_CODE (context
) == BLOCK
)
9373 context
= BLOCK_SUPERCONTEXT (context
);
9375 context
= get_containing_scope (context
);
9381 /* Return the innermost context enclosing DECL that is
9382 a RECORD_TYPE, UNION_TYPE or QUAL_UNION_TYPE, or zero if none.
9383 TYPE_DECLs and FUNCTION_DECLs are transparent to this function. */
9386 decl_type_context (const_tree decl
)
9388 tree context
= DECL_CONTEXT (decl
);
9391 switch (TREE_CODE (context
))
9393 case NAMESPACE_DECL
:
9394 case TRANSLATION_UNIT_DECL
:
9399 case QUAL_UNION_TYPE
:
9404 context
= DECL_CONTEXT (context
);
9408 context
= BLOCK_SUPERCONTEXT (context
);
9418 /* CALL is a CALL_EXPR. Return the declaration for the function
9419 called, or NULL_TREE if the called function cannot be
9423 get_callee_fndecl (const_tree call
)
9427 if (call
== error_mark_node
)
9428 return error_mark_node
;
9430 /* It's invalid to call this function with anything but a
9432 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9434 /* The first operand to the CALL is the address of the function
9436 addr
= CALL_EXPR_FN (call
);
9438 /* If there is no function, return early. */
9439 if (addr
== NULL_TREE
)
9444 /* If this is a readonly function pointer, extract its initial value. */
9445 if (DECL_P (addr
) && TREE_CODE (addr
) != FUNCTION_DECL
9446 && TREE_READONLY (addr
) && ! TREE_THIS_VOLATILE (addr
)
9447 && DECL_INITIAL (addr
))
9448 addr
= DECL_INITIAL (addr
);
9450 /* If the address is just `&f' for some function `f', then we know
9451 that `f' is being called. */
9452 if (TREE_CODE (addr
) == ADDR_EXPR
9453 && TREE_CODE (TREE_OPERAND (addr
, 0)) == FUNCTION_DECL
)
9454 return TREE_OPERAND (addr
, 0);
9456 /* We couldn't figure out what was being called. */
9460 /* If CALL_EXPR CALL calls a normal built-in function or an internal function,
9461 return the associated function code, otherwise return CFN_LAST. */
9464 get_call_combined_fn (const_tree call
)
9466 /* It's invalid to call this function with anything but a CALL_EXPR. */
9467 gcc_assert (TREE_CODE (call
) == CALL_EXPR
);
9469 if (!CALL_EXPR_FN (call
))
9470 return as_combined_fn (CALL_EXPR_IFN (call
));
9472 tree fndecl
= get_callee_fndecl (call
);
9473 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
9474 return as_combined_fn (DECL_FUNCTION_CODE (fndecl
));
9479 #define TREE_MEM_USAGE_SPACES 40
9481 /* Print debugging information about tree nodes generated during the compile,
9482 and any language-specific information. */
9485 dump_tree_statistics (void)
9487 if (GATHER_STATISTICS
)
9490 int total_nodes
, total_bytes
;
9491 fprintf (stderr
, "\nKind Nodes Bytes\n");
9492 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9493 total_nodes
= total_bytes
= 0;
9494 for (i
= 0; i
< (int) all_kinds
; i
++)
9496 fprintf (stderr
, "%-20s %7d %10d\n", tree_node_kind_names
[i
],
9497 tree_node_counts
[i
], tree_node_sizes
[i
]);
9498 total_nodes
+= tree_node_counts
[i
];
9499 total_bytes
+= tree_node_sizes
[i
];
9501 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9502 fprintf (stderr
, "%-20s %7d %10d\n", "Total", total_nodes
, total_bytes
);
9503 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9504 fprintf (stderr
, "Code Nodes\n");
9505 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9506 for (i
= 0; i
< (int) MAX_TREE_CODES
; i
++)
9507 fprintf (stderr
, "%-32s %7d\n", get_tree_code_name ((enum tree_code
) i
),
9508 tree_code_counts
[i
]);
9509 mem_usage::print_dash_line (TREE_MEM_USAGE_SPACES
);
9510 fprintf (stderr
, "\n");
9511 ssanames_print_statistics ();
9512 fprintf (stderr
, "\n");
9513 phinodes_print_statistics ();
9514 fprintf (stderr
, "\n");
9517 fprintf (stderr
, "(No per-node statistics)\n");
9519 print_type_hash_statistics ();
9520 print_debug_expr_statistics ();
9521 print_value_expr_statistics ();
9522 lang_hooks
.print_statistics ();
9525 #define FILE_FUNCTION_FORMAT "_GLOBAL__%s_%s"
9527 /* Generate a crc32 of a byte. */
9530 crc32_unsigned_bits (unsigned chksum
, unsigned value
, unsigned bits
)
9534 for (ix
= bits
; ix
--; value
<<= 1)
9538 feedback
= (value
^ chksum
) & 0x80000000 ? 0x04c11db7 : 0;
9545 /* Generate a crc32 of a 32-bit unsigned. */
9548 crc32_unsigned (unsigned chksum
, unsigned value
)
9550 return crc32_unsigned_bits (chksum
, value
, 32);
9553 /* Generate a crc32 of a byte. */
9556 crc32_byte (unsigned chksum
, char byte
)
9558 return crc32_unsigned_bits (chksum
, (unsigned) byte
<< 24, 8);
9561 /* Generate a crc32 of a string. */
9564 crc32_string (unsigned chksum
, const char *string
)
9568 chksum
= crc32_byte (chksum
, *string
);
9574 /* P is a string that will be used in a symbol. Mask out any characters
9575 that are not valid in that context. */
9578 clean_symbol_name (char *p
)
9582 #ifndef NO_DOLLAR_IN_LABEL /* this for `$'; unlikely, but... -- kr */
9585 #ifndef NO_DOT_IN_LABEL /* this for `.'; unlikely, but... */
9592 /* For anonymous aggregate types, we need some sort of name to
9593 hold on to. In practice, this should not appear, but it should
9594 not be harmful if it does. */
9596 anon_aggrname_p(const_tree id_node
)
9598 #ifndef NO_DOT_IN_LABEL
9599 return (IDENTIFIER_POINTER (id_node
)[0] == '.'
9600 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9601 #else /* NO_DOT_IN_LABEL */
9602 #ifndef NO_DOLLAR_IN_LABEL
9603 return (IDENTIFIER_POINTER (id_node
)[0] == '$' \
9604 && IDENTIFIER_POINTER (id_node
)[1] == '_');
9605 #else /* NO_DOLLAR_IN_LABEL */
9606 #define ANON_AGGRNAME_PREFIX "__anon_"
9607 return (!strncmp (IDENTIFIER_POINTER (id_node
), ANON_AGGRNAME_PREFIX
,
9608 sizeof (ANON_AGGRNAME_PREFIX
) - 1));
9609 #endif /* NO_DOLLAR_IN_LABEL */
9610 #endif /* NO_DOT_IN_LABEL */
9613 /* Return a format for an anonymous aggregate name. */
9615 anon_aggrname_format()
9617 #ifndef NO_DOT_IN_LABEL
9619 #else /* NO_DOT_IN_LABEL */
9620 #ifndef NO_DOLLAR_IN_LABEL
9622 #else /* NO_DOLLAR_IN_LABEL */
9624 #endif /* NO_DOLLAR_IN_LABEL */
9625 #endif /* NO_DOT_IN_LABEL */
9628 /* Generate a name for a special-purpose function.
9629 The generated name may need to be unique across the whole link.
9630 Changes to this function may also require corresponding changes to
9631 xstrdup_mask_random.
9632 TYPE is some string to identify the purpose of this function to the
9633 linker or collect2; it must start with an uppercase letter,
9635 I - for constructors
9637 N - for C++ anonymous namespaces
9638 F - for DWARF unwind frame information. */
9641 get_file_function_name (const char *type
)
9647 /* If we already have a name we know to be unique, just use that. */
9648 if (first_global_object_name
)
9649 p
= q
= ASTRDUP (first_global_object_name
);
9650 /* If the target is handling the constructors/destructors, they
9651 will be local to this file and the name is only necessary for
9653 We also assign sub_I and sub_D sufixes to constructors called from
9654 the global static constructors. These are always local. */
9655 else if (((type
[0] == 'I' || type
[0] == 'D') && targetm
.have_ctors_dtors
)
9656 || (strncmp (type
, "sub_", 4) == 0
9657 && (type
[4] == 'I' || type
[4] == 'D')))
9659 const char *file
= main_input_filename
;
9661 file
= LOCATION_FILE (input_location
);
9662 /* Just use the file's basename, because the full pathname
9663 might be quite long. */
9664 p
= q
= ASTRDUP (lbasename (file
));
9668 /* Otherwise, the name must be unique across the entire link.
9669 We don't have anything that we know to be unique to this translation
9670 unit, so use what we do have and throw in some randomness. */
9672 const char *name
= weak_global_object_name
;
9673 const char *file
= main_input_filename
;
9678 file
= LOCATION_FILE (input_location
);
9680 len
= strlen (file
);
9681 q
= (char *) alloca (9 + 17 + len
+ 1);
9682 memcpy (q
, file
, len
+ 1);
9684 snprintf (q
+ len
, 9 + 17 + 1, "_%08X_" HOST_WIDE_INT_PRINT_HEX
,
9685 crc32_string (0, name
), get_random_seed (false));
9690 clean_symbol_name (q
);
9691 buf
= (char *) alloca (sizeof (FILE_FUNCTION_FORMAT
) + strlen (p
)
9694 /* Set up the name of the file-level functions we may need.
9695 Use a global object (which is already required to be unique over
9696 the program) rather than the file name (which imposes extra
9698 sprintf (buf
, FILE_FUNCTION_FORMAT
, type
, p
);
9700 return get_identifier (buf
);
9703 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
9705 /* Complain that the tree code of NODE does not match the expected 0
9706 terminated list of trailing codes. The trailing code list can be
9707 empty, for a more vague error message. FILE, LINE, and FUNCTION
9708 are of the caller. */
9711 tree_check_failed (const_tree node
, const char *file
,
9712 int line
, const char *function
, ...)
9716 unsigned length
= 0;
9717 enum tree_code code
;
9719 va_start (args
, function
);
9720 while ((code
= (enum tree_code
) va_arg (args
, int)))
9721 length
+= 4 + strlen (get_tree_code_name (code
));
9726 va_start (args
, function
);
9727 length
+= strlen ("expected ");
9728 buffer
= tmp
= (char *) alloca (length
);
9730 while ((code
= (enum tree_code
) va_arg (args
, int)))
9732 const char *prefix
= length
? " or " : "expected ";
9734 strcpy (tmp
+ length
, prefix
);
9735 length
+= strlen (prefix
);
9736 strcpy (tmp
+ length
, get_tree_code_name (code
));
9737 length
+= strlen (get_tree_code_name (code
));
9742 buffer
= "unexpected node";
9744 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9745 buffer
, get_tree_code_name (TREE_CODE (node
)),
9746 function
, trim_filename (file
), line
);
9749 /* Complain that the tree code of NODE does match the expected 0
9750 terminated list of trailing codes. FILE, LINE, and FUNCTION are of
9754 tree_not_check_failed (const_tree node
, const char *file
,
9755 int line
, const char *function
, ...)
9759 unsigned length
= 0;
9760 enum tree_code code
;
9762 va_start (args
, function
);
9763 while ((code
= (enum tree_code
) va_arg (args
, int)))
9764 length
+= 4 + strlen (get_tree_code_name (code
));
9766 va_start (args
, function
);
9767 buffer
= (char *) alloca (length
);
9769 while ((code
= (enum tree_code
) va_arg (args
, int)))
9773 strcpy (buffer
+ length
, " or ");
9776 strcpy (buffer
+ length
, get_tree_code_name (code
));
9777 length
+= strlen (get_tree_code_name (code
));
9781 internal_error ("tree check: expected none of %s, have %s in %s, at %s:%d",
9782 buffer
, get_tree_code_name (TREE_CODE (node
)),
9783 function
, trim_filename (file
), line
);
9786 /* Similar to tree_check_failed, except that we check for a class of tree
9787 code, given in CL. */
9790 tree_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9791 const char *file
, int line
, const char *function
)
9794 ("tree check: expected class %qs, have %qs (%s) in %s, at %s:%d",
9795 TREE_CODE_CLASS_STRING (cl
),
9796 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9797 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9800 /* Similar to tree_check_failed, except that instead of specifying a
9801 dozen codes, use the knowledge that they're all sequential. */
9804 tree_range_check_failed (const_tree node
, const char *file
, int line
,
9805 const char *function
, enum tree_code c1
,
9809 unsigned length
= 0;
9812 for (c
= c1
; c
<= c2
; ++c
)
9813 length
+= 4 + strlen (get_tree_code_name ((enum tree_code
) c
));
9815 length
+= strlen ("expected ");
9816 buffer
= (char *) alloca (length
);
9819 for (c
= c1
; c
<= c2
; ++c
)
9821 const char *prefix
= length
? " or " : "expected ";
9823 strcpy (buffer
+ length
, prefix
);
9824 length
+= strlen (prefix
);
9825 strcpy (buffer
+ length
, get_tree_code_name ((enum tree_code
) c
));
9826 length
+= strlen (get_tree_code_name ((enum tree_code
) c
));
9829 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9830 buffer
, get_tree_code_name (TREE_CODE (node
)),
9831 function
, trim_filename (file
), line
);
9835 /* Similar to tree_check_failed, except that we check that a tree does
9836 not have the specified code, given in CL. */
9839 tree_not_class_check_failed (const_tree node
, const enum tree_code_class cl
,
9840 const char *file
, int line
, const char *function
)
9843 ("tree check: did not expect class %qs, have %qs (%s) in %s, at %s:%d",
9844 TREE_CODE_CLASS_STRING (cl
),
9845 TREE_CODE_CLASS_STRING (TREE_CODE_CLASS (TREE_CODE (node
))),
9846 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9850 /* Similar to tree_check_failed but applied to OMP_CLAUSE codes. */
9853 omp_clause_check_failed (const_tree node
, const char *file
, int line
,
9854 const char *function
, enum omp_clause_code code
)
9856 internal_error ("tree check: expected omp_clause %s, have %s in %s, at %s:%d",
9857 omp_clause_code_name
[code
], get_tree_code_name (TREE_CODE (node
)),
9858 function
, trim_filename (file
), line
);
9862 /* Similar to tree_range_check_failed but applied to OMP_CLAUSE codes. */
9865 omp_clause_range_check_failed (const_tree node
, const char *file
, int line
,
9866 const char *function
, enum omp_clause_code c1
,
9867 enum omp_clause_code c2
)
9870 unsigned length
= 0;
9873 for (c
= c1
; c
<= c2
; ++c
)
9874 length
+= 4 + strlen (omp_clause_code_name
[c
]);
9876 length
+= strlen ("expected ");
9877 buffer
= (char *) alloca (length
);
9880 for (c
= c1
; c
<= c2
; ++c
)
9882 const char *prefix
= length
? " or " : "expected ";
9884 strcpy (buffer
+ length
, prefix
);
9885 length
+= strlen (prefix
);
9886 strcpy (buffer
+ length
, omp_clause_code_name
[c
]);
9887 length
+= strlen (omp_clause_code_name
[c
]);
9890 internal_error ("tree check: %s, have %s in %s, at %s:%d",
9891 buffer
, omp_clause_code_name
[TREE_CODE (node
)],
9892 function
, trim_filename (file
), line
);
9896 #undef DEFTREESTRUCT
9897 #define DEFTREESTRUCT(VAL, NAME) NAME,
9899 static const char *ts_enum_names
[] = {
9900 #include "treestruct.def"
9902 #undef DEFTREESTRUCT
9904 #define TS_ENUM_NAME(EN) (ts_enum_names[(EN)])
9906 /* Similar to tree_class_check_failed, except that we check for
9907 whether CODE contains the tree structure identified by EN. */
9910 tree_contains_struct_check_failed (const_tree node
,
9911 const enum tree_node_structure_enum en
,
9912 const char *file
, int line
,
9913 const char *function
)
9916 ("tree check: expected tree that contains %qs structure, have %qs in %s, at %s:%d",
9918 get_tree_code_name (TREE_CODE (node
)), function
, trim_filename (file
), line
);
9922 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9923 (dynamically sized) vector. */
9926 tree_int_cst_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9927 const char *function
)
9930 ("tree check: accessed elt %d of tree_int_cst with %d elts in %s, at %s:%d",
9931 idx
+ 1, len
, function
, trim_filename (file
), line
);
9934 /* Similar to above, except that the check is for the bounds of a TREE_VEC's
9935 (dynamically sized) vector. */
9938 tree_vec_elt_check_failed (int idx
, int len
, const char *file
, int line
,
9939 const char *function
)
9942 ("tree check: accessed elt %d of tree_vec with %d elts in %s, at %s:%d",
9943 idx
+ 1, len
, function
, trim_filename (file
), line
);
9946 /* Similar to above, except that the check is for the bounds of the operand
9947 vector of an expression node EXP. */
9950 tree_operand_check_failed (int idx
, const_tree exp
, const char *file
,
9951 int line
, const char *function
)
9953 enum tree_code code
= TREE_CODE (exp
);
9955 ("tree check: accessed operand %d of %s with %d operands in %s, at %s:%d",
9956 idx
+ 1, get_tree_code_name (code
), TREE_OPERAND_LENGTH (exp
),
9957 function
, trim_filename (file
), line
);
9960 /* Similar to above, except that the check is for the number of
9961 operands of an OMP_CLAUSE node. */
9964 omp_clause_operand_check_failed (int idx
, const_tree t
, const char *file
,
9965 int line
, const char *function
)
9968 ("tree check: accessed operand %d of omp_clause %s with %d operands "
9969 "in %s, at %s:%d", idx
+ 1, omp_clause_code_name
[OMP_CLAUSE_CODE (t
)],
9970 omp_clause_num_ops
[OMP_CLAUSE_CODE (t
)], function
,
9971 trim_filename (file
), line
);
9973 #endif /* ENABLE_TREE_CHECKING */
9975 /* Create a new vector type node holding SUBPARTS units of type INNERTYPE,
9976 and mapped to the machine mode MODE. Initialize its fields and build
9977 the information necessary for debugging output. */
9980 make_vector_type (tree innertype
, int nunits
, machine_mode mode
)
9983 inchash::hash hstate
;
9984 tree mv_innertype
= TYPE_MAIN_VARIANT (innertype
);
9986 t
= make_node (VECTOR_TYPE
);
9987 TREE_TYPE (t
) = mv_innertype
;
9988 SET_TYPE_VECTOR_SUBPARTS (t
, nunits
);
9989 SET_TYPE_MODE (t
, mode
);
9991 if (TYPE_STRUCTURAL_EQUALITY_P (mv_innertype
) || in_lto_p
)
9992 SET_TYPE_STRUCTURAL_EQUALITY (t
);
9993 else if ((TYPE_CANONICAL (mv_innertype
) != innertype
9994 || mode
!= VOIDmode
)
9995 && !VECTOR_BOOLEAN_TYPE_P (t
))
9997 = make_vector_type (TYPE_CANONICAL (mv_innertype
), nunits
, VOIDmode
);
10001 hstate
.add_wide_int (VECTOR_TYPE
);
10002 hstate
.add_wide_int (nunits
);
10003 hstate
.add_wide_int (mode
);
10004 hstate
.add_object (TYPE_HASH (TREE_TYPE (t
)));
10005 t
= type_hash_canon (hstate
.end (), t
);
10007 /* We have built a main variant, based on the main variant of the
10008 inner type. Use it to build the variant we return. */
10009 if ((TYPE_ATTRIBUTES (innertype
) || TYPE_QUALS (innertype
))
10010 && TREE_TYPE (t
) != innertype
)
10011 return build_type_attribute_qual_variant (t
,
10012 TYPE_ATTRIBUTES (innertype
),
10013 TYPE_QUALS (innertype
));
10019 make_or_reuse_type (unsigned size
, int unsignedp
)
10023 if (size
== INT_TYPE_SIZE
)
10024 return unsignedp
? unsigned_type_node
: integer_type_node
;
10025 if (size
== CHAR_TYPE_SIZE
)
10026 return unsignedp
? unsigned_char_type_node
: signed_char_type_node
;
10027 if (size
== SHORT_TYPE_SIZE
)
10028 return unsignedp
? short_unsigned_type_node
: short_integer_type_node
;
10029 if (size
== LONG_TYPE_SIZE
)
10030 return unsignedp
? long_unsigned_type_node
: long_integer_type_node
;
10031 if (size
== LONG_LONG_TYPE_SIZE
)
10032 return (unsignedp
? long_long_unsigned_type_node
10033 : long_long_integer_type_node
);
10035 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10036 if (size
== int_n_data
[i
].bitsize
10037 && int_n_enabled_p
[i
])
10038 return (unsignedp
? int_n_trees
[i
].unsigned_type
10039 : int_n_trees
[i
].signed_type
);
10042 return make_unsigned_type (size
);
10044 return make_signed_type (size
);
10047 /* Create or reuse a fract type by SIZE, UNSIGNEDP, and SATP. */
10050 make_or_reuse_fract_type (unsigned size
, int unsignedp
, int satp
)
10054 if (size
== SHORT_FRACT_TYPE_SIZE
)
10055 return unsignedp
? sat_unsigned_short_fract_type_node
10056 : sat_short_fract_type_node
;
10057 if (size
== FRACT_TYPE_SIZE
)
10058 return unsignedp
? sat_unsigned_fract_type_node
: sat_fract_type_node
;
10059 if (size
== LONG_FRACT_TYPE_SIZE
)
10060 return unsignedp
? sat_unsigned_long_fract_type_node
10061 : sat_long_fract_type_node
;
10062 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10063 return unsignedp
? sat_unsigned_long_long_fract_type_node
10064 : sat_long_long_fract_type_node
;
10068 if (size
== SHORT_FRACT_TYPE_SIZE
)
10069 return unsignedp
? unsigned_short_fract_type_node
10070 : short_fract_type_node
;
10071 if (size
== FRACT_TYPE_SIZE
)
10072 return unsignedp
? unsigned_fract_type_node
: fract_type_node
;
10073 if (size
== LONG_FRACT_TYPE_SIZE
)
10074 return unsignedp
? unsigned_long_fract_type_node
10075 : long_fract_type_node
;
10076 if (size
== LONG_LONG_FRACT_TYPE_SIZE
)
10077 return unsignedp
? unsigned_long_long_fract_type_node
10078 : long_long_fract_type_node
;
10081 return make_fract_type (size
, unsignedp
, satp
);
10084 /* Create or reuse an accum type by SIZE, UNSIGNEDP, and SATP. */
10087 make_or_reuse_accum_type (unsigned size
, int unsignedp
, int satp
)
10091 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10092 return unsignedp
? sat_unsigned_short_accum_type_node
10093 : sat_short_accum_type_node
;
10094 if (size
== ACCUM_TYPE_SIZE
)
10095 return unsignedp
? sat_unsigned_accum_type_node
: sat_accum_type_node
;
10096 if (size
== LONG_ACCUM_TYPE_SIZE
)
10097 return unsignedp
? sat_unsigned_long_accum_type_node
10098 : sat_long_accum_type_node
;
10099 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10100 return unsignedp
? sat_unsigned_long_long_accum_type_node
10101 : sat_long_long_accum_type_node
;
10105 if (size
== SHORT_ACCUM_TYPE_SIZE
)
10106 return unsignedp
? unsigned_short_accum_type_node
10107 : short_accum_type_node
;
10108 if (size
== ACCUM_TYPE_SIZE
)
10109 return unsignedp
? unsigned_accum_type_node
: accum_type_node
;
10110 if (size
== LONG_ACCUM_TYPE_SIZE
)
10111 return unsignedp
? unsigned_long_accum_type_node
10112 : long_accum_type_node
;
10113 if (size
== LONG_LONG_ACCUM_TYPE_SIZE
)
10114 return unsignedp
? unsigned_long_long_accum_type_node
10115 : long_long_accum_type_node
;
10118 return make_accum_type (size
, unsignedp
, satp
);
10122 /* Create an atomic variant node for TYPE. This routine is called
10123 during initialization of data types to create the 5 basic atomic
10124 types. The generic build_variant_type function requires these to
10125 already be set up in order to function properly, so cannot be
10126 called from there. If ALIGN is non-zero, then ensure alignment is
10127 overridden to this value. */
10130 build_atomic_base (tree type
, unsigned int align
)
10134 /* Make sure its not already registered. */
10135 if ((t
= get_qualified_type (type
, TYPE_QUAL_ATOMIC
)))
10138 t
= build_variant_type_copy (type
);
10139 set_type_quals (t
, TYPE_QUAL_ATOMIC
);
10142 SET_TYPE_ALIGN (t
, align
);
10147 /* Information about the _FloatN and _FloatNx types. This must be in
10148 the same order as the corresponding TI_* enum values. */
10149 const floatn_type_info floatn_nx_types
[NUM_FLOATN_NX_TYPES
] =
10161 /* Create nodes for all integer types (and error_mark_node) using the sizes
10162 of C datatypes. SIGNED_CHAR specifies whether char is signed. */
10165 build_common_tree_nodes (bool signed_char
)
10169 error_mark_node
= make_node (ERROR_MARK
);
10170 TREE_TYPE (error_mark_node
) = error_mark_node
;
10172 initialize_sizetypes ();
10174 /* Define both `signed char' and `unsigned char'. */
10175 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
10176 TYPE_STRING_FLAG (signed_char_type_node
) = 1;
10177 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
10178 TYPE_STRING_FLAG (unsigned_char_type_node
) = 1;
10180 /* Define `char', which is like either `signed char' or `unsigned char'
10181 but not the same as either. */
10184 ? make_signed_type (CHAR_TYPE_SIZE
)
10185 : make_unsigned_type (CHAR_TYPE_SIZE
));
10186 TYPE_STRING_FLAG (char_type_node
) = 1;
10188 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
10189 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
10190 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
10191 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
10192 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
10193 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
10194 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
10195 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
10197 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10199 int_n_trees
[i
].signed_type
= make_signed_type (int_n_data
[i
].bitsize
);
10200 int_n_trees
[i
].unsigned_type
= make_unsigned_type (int_n_data
[i
].bitsize
);
10201 TYPE_SIZE (int_n_trees
[i
].signed_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10202 TYPE_SIZE (int_n_trees
[i
].unsigned_type
) = bitsize_int (int_n_data
[i
].bitsize
);
10204 if (int_n_data
[i
].bitsize
> LONG_LONG_TYPE_SIZE
10205 && int_n_enabled_p
[i
])
10207 integer_types
[itk_intN_0
+ i
* 2] = int_n_trees
[i
].signed_type
;
10208 integer_types
[itk_unsigned_intN_0
+ i
* 2] = int_n_trees
[i
].unsigned_type
;
10212 /* Define a boolean type. This type only represents boolean values but
10213 may be larger than char depending on the value of BOOL_TYPE_SIZE. */
10214 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
10215 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
10216 TYPE_PRECISION (boolean_type_node
) = 1;
10217 TYPE_MAX_VALUE (boolean_type_node
) = build_int_cst (boolean_type_node
, 1);
10219 /* Define what type to use for size_t. */
10220 if (strcmp (SIZE_TYPE
, "unsigned int") == 0)
10221 size_type_node
= unsigned_type_node
;
10222 else if (strcmp (SIZE_TYPE
, "long unsigned int") == 0)
10223 size_type_node
= long_unsigned_type_node
;
10224 else if (strcmp (SIZE_TYPE
, "long long unsigned int") == 0)
10225 size_type_node
= long_long_unsigned_type_node
;
10226 else if (strcmp (SIZE_TYPE
, "short unsigned int") == 0)
10227 size_type_node
= short_unsigned_type_node
;
10232 size_type_node
= NULL_TREE
;
10233 for (i
= 0; i
< NUM_INT_N_ENTS
; i
++)
10234 if (int_n_enabled_p
[i
])
10237 sprintf (name
, "__int%d unsigned", int_n_data
[i
].bitsize
);
10239 if (strcmp (name
, SIZE_TYPE
) == 0)
10241 size_type_node
= int_n_trees
[i
].unsigned_type
;
10244 if (size_type_node
== NULL_TREE
)
10245 gcc_unreachable ();
10248 /* Fill in the rest of the sized types. Reuse existing type nodes
10250 intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 0);
10251 intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 0);
10252 intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 0);
10253 intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 0);
10254 intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 0);
10256 unsigned_intQI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (QImode
), 1);
10257 unsigned_intHI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (HImode
), 1);
10258 unsigned_intSI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (SImode
), 1);
10259 unsigned_intDI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (DImode
), 1);
10260 unsigned_intTI_type_node
= make_or_reuse_type (GET_MODE_BITSIZE (TImode
), 1);
10262 /* Don't call build_qualified type for atomics. That routine does
10263 special processing for atomics, and until they are initialized
10264 it's better not to make that call.
10266 Check to see if there is a target override for atomic types. */
10268 atomicQI_type_node
= build_atomic_base (unsigned_intQI_type_node
,
10269 targetm
.atomic_align_for_mode (QImode
));
10270 atomicHI_type_node
= build_atomic_base (unsigned_intHI_type_node
,
10271 targetm
.atomic_align_for_mode (HImode
));
10272 atomicSI_type_node
= build_atomic_base (unsigned_intSI_type_node
,
10273 targetm
.atomic_align_for_mode (SImode
));
10274 atomicDI_type_node
= build_atomic_base (unsigned_intDI_type_node
,
10275 targetm
.atomic_align_for_mode (DImode
));
10276 atomicTI_type_node
= build_atomic_base (unsigned_intTI_type_node
,
10277 targetm
.atomic_align_for_mode (TImode
));
10279 access_public_node
= get_identifier ("public");
10280 access_protected_node
= get_identifier ("protected");
10281 access_private_node
= get_identifier ("private");
10283 /* Define these next since types below may used them. */
10284 integer_zero_node
= build_int_cst (integer_type_node
, 0);
10285 integer_one_node
= build_int_cst (integer_type_node
, 1);
10286 integer_three_node
= build_int_cst (integer_type_node
, 3);
10287 integer_minus_one_node
= build_int_cst (integer_type_node
, -1);
10289 size_zero_node
= size_int (0);
10290 size_one_node
= size_int (1);
10291 bitsize_zero_node
= bitsize_int (0);
10292 bitsize_one_node
= bitsize_int (1);
10293 bitsize_unit_node
= bitsize_int (BITS_PER_UNIT
);
10295 boolean_false_node
= TYPE_MIN_VALUE (boolean_type_node
);
10296 boolean_true_node
= TYPE_MAX_VALUE (boolean_type_node
);
10298 void_type_node
= make_node (VOID_TYPE
);
10299 layout_type (void_type_node
);
10301 pointer_bounds_type_node
= targetm
.chkp_bound_type ();
10303 /* We are not going to have real types in C with less than byte alignment,
10304 so we might as well not have any types that claim to have it. */
10305 SET_TYPE_ALIGN (void_type_node
, BITS_PER_UNIT
);
10306 TYPE_USER_ALIGN (void_type_node
) = 0;
10308 void_node
= make_node (VOID_CST
);
10309 TREE_TYPE (void_node
) = void_type_node
;
10311 null_pointer_node
= build_int_cst (build_pointer_type (void_type_node
), 0);
10312 layout_type (TREE_TYPE (null_pointer_node
));
10314 ptr_type_node
= build_pointer_type (void_type_node
);
10315 const_ptr_type_node
10316 = build_pointer_type (build_type_variant (void_type_node
, 1, 0));
10317 fileptr_type_node
= ptr_type_node
;
10319 pointer_sized_int_node
= build_nonstandard_integer_type (POINTER_SIZE
, 1);
10321 float_type_node
= make_node (REAL_TYPE
);
10322 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
10323 layout_type (float_type_node
);
10325 double_type_node
= make_node (REAL_TYPE
);
10326 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
10327 layout_type (double_type_node
);
10329 long_double_type_node
= make_node (REAL_TYPE
);
10330 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
10331 layout_type (long_double_type_node
);
10333 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10335 int n
= floatn_nx_types
[i
].n
;
10336 bool extended
= floatn_nx_types
[i
].extended
;
10337 machine_mode mode
= targetm
.floatn_mode (n
, extended
);
10338 if (mode
== VOIDmode
)
10340 int precision
= GET_MODE_PRECISION (mode
);
10341 /* Work around the rs6000 KFmode having precision 113 not
10343 const struct real_format
*fmt
= REAL_MODE_FORMAT (mode
);
10344 gcc_assert (fmt
->b
== 2 && fmt
->emin
+ fmt
->emax
== 3);
10345 int min_precision
= fmt
->p
+ ceil_log2 (fmt
->emax
- fmt
->emin
);
10347 gcc_assert (min_precision
== n
);
10348 if (precision
< min_precision
)
10349 precision
= min_precision
;
10350 FLOATN_NX_TYPE_NODE (i
) = make_node (REAL_TYPE
);
10351 TYPE_PRECISION (FLOATN_NX_TYPE_NODE (i
)) = precision
;
10352 layout_type (FLOATN_NX_TYPE_NODE (i
));
10353 SET_TYPE_MODE (FLOATN_NX_TYPE_NODE (i
), mode
);
10356 float_ptr_type_node
= build_pointer_type (float_type_node
);
10357 double_ptr_type_node
= build_pointer_type (double_type_node
);
10358 long_double_ptr_type_node
= build_pointer_type (long_double_type_node
);
10359 integer_ptr_type_node
= build_pointer_type (integer_type_node
);
10361 /* Fixed size integer types. */
10362 uint16_type_node
= make_or_reuse_type (16, 1);
10363 uint32_type_node
= make_or_reuse_type (32, 1);
10364 uint64_type_node
= make_or_reuse_type (64, 1);
10366 /* Decimal float types. */
10367 dfloat32_type_node
= make_node (REAL_TYPE
);
10368 TYPE_PRECISION (dfloat32_type_node
) = DECIMAL32_TYPE_SIZE
;
10369 layout_type (dfloat32_type_node
);
10370 SET_TYPE_MODE (dfloat32_type_node
, SDmode
);
10371 dfloat32_ptr_type_node
= build_pointer_type (dfloat32_type_node
);
10373 dfloat64_type_node
= make_node (REAL_TYPE
);
10374 TYPE_PRECISION (dfloat64_type_node
) = DECIMAL64_TYPE_SIZE
;
10375 layout_type (dfloat64_type_node
);
10376 SET_TYPE_MODE (dfloat64_type_node
, DDmode
);
10377 dfloat64_ptr_type_node
= build_pointer_type (dfloat64_type_node
);
10379 dfloat128_type_node
= make_node (REAL_TYPE
);
10380 TYPE_PRECISION (dfloat128_type_node
) = DECIMAL128_TYPE_SIZE
;
10381 layout_type (dfloat128_type_node
);
10382 SET_TYPE_MODE (dfloat128_type_node
, TDmode
);
10383 dfloat128_ptr_type_node
= build_pointer_type (dfloat128_type_node
);
10385 complex_integer_type_node
= build_complex_type (integer_type_node
, true);
10386 complex_float_type_node
= build_complex_type (float_type_node
, true);
10387 complex_double_type_node
= build_complex_type (double_type_node
, true);
10388 complex_long_double_type_node
= build_complex_type (long_double_type_node
,
10391 for (i
= 0; i
< NUM_FLOATN_NX_TYPES
; i
++)
10393 if (FLOATN_NX_TYPE_NODE (i
) != NULL_TREE
)
10394 COMPLEX_FLOATN_NX_TYPE_NODE (i
)
10395 = build_complex_type (FLOATN_NX_TYPE_NODE (i
));
10398 /* Make fixed-point nodes based on sat/non-sat and signed/unsigned. */
10399 #define MAKE_FIXED_TYPE_NODE(KIND,SIZE) \
10400 sat_ ## KIND ## _type_node = \
10401 make_sat_signed_ ## KIND ## _type (SIZE); \
10402 sat_unsigned_ ## KIND ## _type_node = \
10403 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10404 KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10405 unsigned_ ## KIND ## _type_node = \
10406 make_unsigned_ ## KIND ## _type (SIZE);
10408 #define MAKE_FIXED_TYPE_NODE_WIDTH(KIND,WIDTH,SIZE) \
10409 sat_ ## WIDTH ## KIND ## _type_node = \
10410 make_sat_signed_ ## KIND ## _type (SIZE); \
10411 sat_unsigned_ ## WIDTH ## KIND ## _type_node = \
10412 make_sat_unsigned_ ## KIND ## _type (SIZE); \
10413 WIDTH ## KIND ## _type_node = make_signed_ ## KIND ## _type (SIZE); \
10414 unsigned_ ## WIDTH ## KIND ## _type_node = \
10415 make_unsigned_ ## KIND ## _type (SIZE);
10417 /* Make fixed-point type nodes based on four different widths. */
10418 #define MAKE_FIXED_TYPE_NODE_FAMILY(N1,N2) \
10419 MAKE_FIXED_TYPE_NODE_WIDTH (N1, short_, SHORT_ ## N2 ## _TYPE_SIZE) \
10420 MAKE_FIXED_TYPE_NODE (N1, N2 ## _TYPE_SIZE) \
10421 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_, LONG_ ## N2 ## _TYPE_SIZE) \
10422 MAKE_FIXED_TYPE_NODE_WIDTH (N1, long_long_, LONG_LONG_ ## N2 ## _TYPE_SIZE)
10424 /* Make fixed-point mode nodes based on sat/non-sat and signed/unsigned. */
10425 #define MAKE_FIXED_MODE_NODE(KIND,NAME,MODE) \
10426 NAME ## _type_node = \
10427 make_or_reuse_signed_ ## KIND ## _type (GET_MODE_BITSIZE (MODE ## mode)); \
10428 u ## NAME ## _type_node = \
10429 make_or_reuse_unsigned_ ## KIND ## _type \
10430 (GET_MODE_BITSIZE (U ## MODE ## mode)); \
10431 sat_ ## NAME ## _type_node = \
10432 make_or_reuse_sat_signed_ ## KIND ## _type \
10433 (GET_MODE_BITSIZE (MODE ## mode)); \
10434 sat_u ## NAME ## _type_node = \
10435 make_or_reuse_sat_unsigned_ ## KIND ## _type \
10436 (GET_MODE_BITSIZE (U ## MODE ## mode));
10438 /* Fixed-point type and mode nodes. */
10439 MAKE_FIXED_TYPE_NODE_FAMILY (fract
, FRACT
)
10440 MAKE_FIXED_TYPE_NODE_FAMILY (accum
, ACCUM
)
10441 MAKE_FIXED_MODE_NODE (fract
, qq
, QQ
)
10442 MAKE_FIXED_MODE_NODE (fract
, hq
, HQ
)
10443 MAKE_FIXED_MODE_NODE (fract
, sq
, SQ
)
10444 MAKE_FIXED_MODE_NODE (fract
, dq
, DQ
)
10445 MAKE_FIXED_MODE_NODE (fract
, tq
, TQ
)
10446 MAKE_FIXED_MODE_NODE (accum
, ha
, HA
)
10447 MAKE_FIXED_MODE_NODE (accum
, sa
, SA
)
10448 MAKE_FIXED_MODE_NODE (accum
, da
, DA
)
10449 MAKE_FIXED_MODE_NODE (accum
, ta
, TA
)
10452 tree t
= targetm
.build_builtin_va_list ();
10454 /* Many back-ends define record types without setting TYPE_NAME.
10455 If we copied the record type here, we'd keep the original
10456 record type without a name. This breaks name mangling. So,
10457 don't copy record types and let c_common_nodes_and_builtins()
10458 declare the type to be __builtin_va_list. */
10459 if (TREE_CODE (t
) != RECORD_TYPE
)
10460 t
= build_variant_type_copy (t
);
10462 va_list_type_node
= t
;
10466 /* Modify DECL for given flags.
10467 TM_PURE attribute is set only on types, so the function will modify
10468 DECL's type when ECF_TM_PURE is used. */
10471 set_call_expr_flags (tree decl
, int flags
)
10473 if (flags
& ECF_NOTHROW
)
10474 TREE_NOTHROW (decl
) = 1;
10475 if (flags
& ECF_CONST
)
10476 TREE_READONLY (decl
) = 1;
10477 if (flags
& ECF_PURE
)
10478 DECL_PURE_P (decl
) = 1;
10479 if (flags
& ECF_LOOPING_CONST_OR_PURE
)
10480 DECL_LOOPING_CONST_OR_PURE_P (decl
) = 1;
10481 if (flags
& ECF_NOVOPS
)
10482 DECL_IS_NOVOPS (decl
) = 1;
10483 if (flags
& ECF_NORETURN
)
10484 TREE_THIS_VOLATILE (decl
) = 1;
10485 if (flags
& ECF_MALLOC
)
10486 DECL_IS_MALLOC (decl
) = 1;
10487 if (flags
& ECF_RETURNS_TWICE
)
10488 DECL_IS_RETURNS_TWICE (decl
) = 1;
10489 if (flags
& ECF_LEAF
)
10490 DECL_ATTRIBUTES (decl
) = tree_cons (get_identifier ("leaf"),
10491 NULL
, DECL_ATTRIBUTES (decl
));
10492 if (flags
& ECF_RET1
)
10493 DECL_ATTRIBUTES (decl
)
10494 = tree_cons (get_identifier ("fn spec"),
10495 build_tree_list (NULL_TREE
, build_string (1, "1")),
10496 DECL_ATTRIBUTES (decl
));
10497 if ((flags
& ECF_TM_PURE
) && flag_tm
)
10498 apply_tm_attr (decl
, get_identifier ("transaction_pure"));
10499 /* Looping const or pure is implied by noreturn.
10500 There is currently no way to declare looping const or looping pure alone. */
10501 gcc_assert (!(flags
& ECF_LOOPING_CONST_OR_PURE
)
10502 || ((flags
& ECF_NORETURN
) && (flags
& (ECF_CONST
| ECF_PURE
))));
10506 /* A subroutine of build_common_builtin_nodes. Define a builtin function. */
10509 local_define_builtin (const char *name
, tree type
, enum built_in_function code
,
10510 const char *library_name
, int ecf_flags
)
10514 decl
= add_builtin_function (name
, type
, code
, BUILT_IN_NORMAL
,
10515 library_name
, NULL_TREE
);
10516 set_call_expr_flags (decl
, ecf_flags
);
10518 set_builtin_decl (code
, decl
, true);
10521 /* Call this function after instantiating all builtins that the language
10522 front end cares about. This will build the rest of the builtins
10523 and internal functions that are relied upon by the tree optimizers and
10527 build_common_builtin_nodes (void)
10532 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
)
10533 || !builtin_decl_explicit_p (BUILT_IN_ABORT
))
10535 ftype
= build_function_type (void_type_node
, void_list_node
);
10536 if (!builtin_decl_explicit_p (BUILT_IN_UNREACHABLE
))
10537 local_define_builtin ("__builtin_unreachable", ftype
,
10538 BUILT_IN_UNREACHABLE
,
10539 "__builtin_unreachable",
10540 ECF_NOTHROW
| ECF_LEAF
| ECF_NORETURN
10542 if (!builtin_decl_explicit_p (BUILT_IN_ABORT
))
10543 local_define_builtin ("__builtin_abort", ftype
, BUILT_IN_ABORT
,
10545 ECF_LEAF
| ECF_NORETURN
| ECF_CONST
);
10548 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
)
10549 || !builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10551 ftype
= build_function_type_list (ptr_type_node
,
10552 ptr_type_node
, const_ptr_type_node
,
10553 size_type_node
, NULL_TREE
);
10555 if (!builtin_decl_explicit_p (BUILT_IN_MEMCPY
))
10556 local_define_builtin ("__builtin_memcpy", ftype
, BUILT_IN_MEMCPY
,
10557 "memcpy", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10558 if (!builtin_decl_explicit_p (BUILT_IN_MEMMOVE
))
10559 local_define_builtin ("__builtin_memmove", ftype
, BUILT_IN_MEMMOVE
,
10560 "memmove", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10563 if (!builtin_decl_explicit_p (BUILT_IN_MEMCMP
))
10565 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10566 const_ptr_type_node
, size_type_node
,
10568 local_define_builtin ("__builtin_memcmp", ftype
, BUILT_IN_MEMCMP
,
10569 "memcmp", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10572 if (!builtin_decl_explicit_p (BUILT_IN_MEMSET
))
10574 ftype
= build_function_type_list (ptr_type_node
,
10575 ptr_type_node
, integer_type_node
,
10576 size_type_node
, NULL_TREE
);
10577 local_define_builtin ("__builtin_memset", ftype
, BUILT_IN_MEMSET
,
10578 "memset", ECF_NOTHROW
| ECF_LEAF
| ECF_RET1
);
10581 /* If we're checking the stack, `alloca' can throw. */
10582 const int alloca_flags
10583 = ECF_MALLOC
| ECF_LEAF
| (flag_stack_check
? 0 : ECF_NOTHROW
);
10585 if (!builtin_decl_explicit_p (BUILT_IN_ALLOCA
))
10587 ftype
= build_function_type_list (ptr_type_node
,
10588 size_type_node
, NULL_TREE
);
10589 local_define_builtin ("__builtin_alloca", ftype
, BUILT_IN_ALLOCA
,
10590 "alloca", alloca_flags
);
10593 ftype
= build_function_type_list (ptr_type_node
, size_type_node
,
10594 size_type_node
, NULL_TREE
);
10595 local_define_builtin ("__builtin_alloca_with_align", ftype
,
10596 BUILT_IN_ALLOCA_WITH_ALIGN
,
10597 "__builtin_alloca_with_align",
10600 ftype
= build_function_type_list (void_type_node
,
10601 ptr_type_node
, ptr_type_node
,
10602 ptr_type_node
, NULL_TREE
);
10603 local_define_builtin ("__builtin_init_trampoline", ftype
,
10604 BUILT_IN_INIT_TRAMPOLINE
,
10605 "__builtin_init_trampoline", ECF_NOTHROW
| ECF_LEAF
);
10606 local_define_builtin ("__builtin_init_heap_trampoline", ftype
,
10607 BUILT_IN_INIT_HEAP_TRAMPOLINE
,
10608 "__builtin_init_heap_trampoline",
10609 ECF_NOTHROW
| ECF_LEAF
);
10610 local_define_builtin ("__builtin_init_descriptor", ftype
,
10611 BUILT_IN_INIT_DESCRIPTOR
,
10612 "__builtin_init_descriptor", ECF_NOTHROW
| ECF_LEAF
);
10614 ftype
= build_function_type_list (ptr_type_node
, ptr_type_node
, NULL_TREE
);
10615 local_define_builtin ("__builtin_adjust_trampoline", ftype
,
10616 BUILT_IN_ADJUST_TRAMPOLINE
,
10617 "__builtin_adjust_trampoline",
10618 ECF_CONST
| ECF_NOTHROW
);
10619 local_define_builtin ("__builtin_adjust_descriptor", ftype
,
10620 BUILT_IN_ADJUST_DESCRIPTOR
,
10621 "__builtin_adjust_descriptor",
10622 ECF_CONST
| ECF_NOTHROW
);
10624 ftype
= build_function_type_list (void_type_node
,
10625 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10626 local_define_builtin ("__builtin_nonlocal_goto", ftype
,
10627 BUILT_IN_NONLOCAL_GOTO
,
10628 "__builtin_nonlocal_goto",
10629 ECF_NORETURN
| ECF_NOTHROW
);
10631 ftype
= build_function_type_list (void_type_node
,
10632 ptr_type_node
, ptr_type_node
, NULL_TREE
);
10633 local_define_builtin ("__builtin_setjmp_setup", ftype
,
10634 BUILT_IN_SETJMP_SETUP
,
10635 "__builtin_setjmp_setup", ECF_NOTHROW
);
10637 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10638 local_define_builtin ("__builtin_setjmp_receiver", ftype
,
10639 BUILT_IN_SETJMP_RECEIVER
,
10640 "__builtin_setjmp_receiver", ECF_NOTHROW
| ECF_LEAF
);
10642 ftype
= build_function_type_list (ptr_type_node
, NULL_TREE
);
10643 local_define_builtin ("__builtin_stack_save", ftype
, BUILT_IN_STACK_SAVE
,
10644 "__builtin_stack_save", ECF_NOTHROW
| ECF_LEAF
);
10646 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10647 local_define_builtin ("__builtin_stack_restore", ftype
,
10648 BUILT_IN_STACK_RESTORE
,
10649 "__builtin_stack_restore", ECF_NOTHROW
| ECF_LEAF
);
10651 ftype
= build_function_type_list (integer_type_node
, const_ptr_type_node
,
10652 const_ptr_type_node
, size_type_node
,
10654 local_define_builtin ("__builtin_memcmp_eq", ftype
, BUILT_IN_MEMCMP_EQ
,
10655 "__builtin_memcmp_eq",
10656 ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10658 /* If there's a possibility that we might use the ARM EABI, build the
10659 alternate __cxa_end_cleanup node used to resume from C++ and Java. */
10660 if (targetm
.arm_eabi_unwinder
)
10662 ftype
= build_function_type_list (void_type_node
, NULL_TREE
);
10663 local_define_builtin ("__builtin_cxa_end_cleanup", ftype
,
10664 BUILT_IN_CXA_END_CLEANUP
,
10665 "__cxa_end_cleanup", ECF_NORETURN
| ECF_LEAF
);
10668 ftype
= build_function_type_list (void_type_node
, ptr_type_node
, NULL_TREE
);
10669 local_define_builtin ("__builtin_unwind_resume", ftype
,
10670 BUILT_IN_UNWIND_RESUME
,
10671 ((targetm_common
.except_unwind_info (&global_options
)
10673 ? "_Unwind_SjLj_Resume" : "_Unwind_Resume"),
10676 if (builtin_decl_explicit (BUILT_IN_RETURN_ADDRESS
) == NULL_TREE
)
10678 ftype
= build_function_type_list (ptr_type_node
, integer_type_node
,
10680 local_define_builtin ("__builtin_return_address", ftype
,
10681 BUILT_IN_RETURN_ADDRESS
,
10682 "__builtin_return_address",
10686 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
)
10687 || !builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10689 ftype
= build_function_type_list (void_type_node
, ptr_type_node
,
10690 ptr_type_node
, NULL_TREE
);
10691 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_ENTER
))
10692 local_define_builtin ("__cyg_profile_func_enter", ftype
,
10693 BUILT_IN_PROFILE_FUNC_ENTER
,
10694 "__cyg_profile_func_enter", 0);
10695 if (!builtin_decl_explicit_p (BUILT_IN_PROFILE_FUNC_EXIT
))
10696 local_define_builtin ("__cyg_profile_func_exit", ftype
,
10697 BUILT_IN_PROFILE_FUNC_EXIT
,
10698 "__cyg_profile_func_exit", 0);
10701 /* The exception object and filter values from the runtime. The argument
10702 must be zero before exception lowering, i.e. from the front end. After
10703 exception lowering, it will be the region number for the exception
10704 landing pad. These functions are PURE instead of CONST to prevent
10705 them from being hoisted past the exception edge that will initialize
10706 its value in the landing pad. */
10707 ftype
= build_function_type_list (ptr_type_node
,
10708 integer_type_node
, NULL_TREE
);
10709 ecf_flags
= ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
;
10710 /* Only use TM_PURE if we have TM language support. */
10711 if (builtin_decl_explicit_p (BUILT_IN_TM_LOAD_1
))
10712 ecf_flags
|= ECF_TM_PURE
;
10713 local_define_builtin ("__builtin_eh_pointer", ftype
, BUILT_IN_EH_POINTER
,
10714 "__builtin_eh_pointer", ecf_flags
);
10716 tmp
= lang_hooks
.types
.type_for_mode (targetm
.eh_return_filter_mode (), 0);
10717 ftype
= build_function_type_list (tmp
, integer_type_node
, NULL_TREE
);
10718 local_define_builtin ("__builtin_eh_filter", ftype
, BUILT_IN_EH_FILTER
,
10719 "__builtin_eh_filter", ECF_PURE
| ECF_NOTHROW
| ECF_LEAF
);
10721 ftype
= build_function_type_list (void_type_node
,
10722 integer_type_node
, integer_type_node
,
10724 local_define_builtin ("__builtin_eh_copy_values", ftype
,
10725 BUILT_IN_EH_COPY_VALUES
,
10726 "__builtin_eh_copy_values", ECF_NOTHROW
);
10728 /* Complex multiplication and division. These are handled as builtins
10729 rather than optabs because emit_library_call_value doesn't support
10730 complex. Further, we can do slightly better with folding these
10731 beasties if the real and complex parts of the arguments are separate. */
10735 for (mode
= MIN_MODE_COMPLEX_FLOAT
; mode
<= MAX_MODE_COMPLEX_FLOAT
; ++mode
)
10737 char mode_name_buf
[4], *q
;
10739 enum built_in_function mcode
, dcode
;
10740 tree type
, inner_type
;
10741 const char *prefix
= "__";
10743 if (targetm
.libfunc_gnu_prefix
)
10746 type
= lang_hooks
.types
.type_for_mode ((machine_mode
) mode
, 0);
10749 inner_type
= TREE_TYPE (type
);
10751 ftype
= build_function_type_list (type
, inner_type
, inner_type
,
10752 inner_type
, inner_type
, NULL_TREE
);
10754 mcode
= ((enum built_in_function
)
10755 (BUILT_IN_COMPLEX_MUL_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10756 dcode
= ((enum built_in_function
)
10757 (BUILT_IN_COMPLEX_DIV_MIN
+ mode
- MIN_MODE_COMPLEX_FLOAT
));
10759 for (p
= GET_MODE_NAME (mode
), q
= mode_name_buf
; *p
; p
++, q
++)
10763 built_in_names
[mcode
] = concat (prefix
, "mul", mode_name_buf
, "3",
10765 local_define_builtin (built_in_names
[mcode
], ftype
, mcode
,
10766 built_in_names
[mcode
],
10767 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10769 built_in_names
[dcode
] = concat (prefix
, "div", mode_name_buf
, "3",
10771 local_define_builtin (built_in_names
[dcode
], ftype
, dcode
,
10772 built_in_names
[dcode
],
10773 ECF_CONST
| ECF_NOTHROW
| ECF_LEAF
);
10777 init_internal_fns ();
10780 /* HACK. GROSS. This is absolutely disgusting. I wish there was a
10783 If we requested a pointer to a vector, build up the pointers that
10784 we stripped off while looking for the inner type. Similarly for
10785 return values from functions.
10787 The argument TYPE is the top of the chain, and BOTTOM is the
10788 new type which we will point to. */
10791 reconstruct_complex_type (tree type
, tree bottom
)
10795 if (TREE_CODE (type
) == POINTER_TYPE
)
10797 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10798 outer
= build_pointer_type_for_mode (inner
, TYPE_MODE (type
),
10799 TYPE_REF_CAN_ALIAS_ALL (type
));
10801 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
10803 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10804 outer
= build_reference_type_for_mode (inner
, TYPE_MODE (type
),
10805 TYPE_REF_CAN_ALIAS_ALL (type
));
10807 else if (TREE_CODE (type
) == ARRAY_TYPE
)
10809 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10810 outer
= build_array_type (inner
, TYPE_DOMAIN (type
));
10812 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10814 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10815 outer
= build_function_type (inner
, TYPE_ARG_TYPES (type
));
10817 else if (TREE_CODE (type
) == METHOD_TYPE
)
10819 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10820 /* The build_method_type_directly() routine prepends 'this' to argument list,
10821 so we must compensate by getting rid of it. */
10823 = build_method_type_directly
10824 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
))),
10826 TREE_CHAIN (TYPE_ARG_TYPES (type
)));
10828 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10830 inner
= reconstruct_complex_type (TREE_TYPE (type
), bottom
);
10831 outer
= build_offset_type (TYPE_OFFSET_BASETYPE (type
), inner
);
10836 return build_type_attribute_qual_variant (outer
, TYPE_ATTRIBUTES (type
),
10837 TYPE_QUALS (type
));
10840 /* Returns a vector tree node given a mode (integer, vector, or BLKmode) and
10843 build_vector_type_for_mode (tree innertype
, machine_mode mode
)
10847 switch (GET_MODE_CLASS (mode
))
10849 case MODE_VECTOR_INT
:
10850 case MODE_VECTOR_FLOAT
:
10851 case MODE_VECTOR_FRACT
:
10852 case MODE_VECTOR_UFRACT
:
10853 case MODE_VECTOR_ACCUM
:
10854 case MODE_VECTOR_UACCUM
:
10855 nunits
= GET_MODE_NUNITS (mode
);
10859 /* Check that there are no leftover bits. */
10860 gcc_assert (GET_MODE_BITSIZE (mode
)
10861 % TREE_INT_CST_LOW (TYPE_SIZE (innertype
)) == 0);
10863 nunits
= GET_MODE_BITSIZE (mode
)
10864 / TREE_INT_CST_LOW (TYPE_SIZE (innertype
));
10868 gcc_unreachable ();
10871 return make_vector_type (innertype
, nunits
, mode
);
10874 /* Similarly, but takes the inner type and number of units, which must be
10878 build_vector_type (tree innertype
, int nunits
)
10880 return make_vector_type (innertype
, nunits
, VOIDmode
);
10883 /* Build truth vector with specified length and number of units. */
10886 build_truth_vector_type (unsigned nunits
, unsigned vector_size
)
10888 machine_mode mask_mode
= targetm
.vectorize
.get_mask_mode (nunits
,
10891 gcc_assert (mask_mode
!= VOIDmode
);
10893 unsigned HOST_WIDE_INT vsize
;
10894 if (mask_mode
== BLKmode
)
10895 vsize
= vector_size
* BITS_PER_UNIT
;
10897 vsize
= GET_MODE_BITSIZE (mask_mode
);
10899 unsigned HOST_WIDE_INT esize
= vsize
/ nunits
;
10900 gcc_assert (esize
* nunits
== vsize
);
10902 tree bool_type
= build_nonstandard_boolean_type (esize
);
10904 return make_vector_type (bool_type
, nunits
, mask_mode
);
10907 /* Returns a vector type corresponding to a comparison of VECTYPE. */
10910 build_same_sized_truth_vector_type (tree vectype
)
10912 if (VECTOR_BOOLEAN_TYPE_P (vectype
))
10915 unsigned HOST_WIDE_INT size
= GET_MODE_SIZE (TYPE_MODE (vectype
));
10918 size
= tree_to_uhwi (TYPE_SIZE_UNIT (vectype
));
10920 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (vectype
), size
);
10923 /* Similarly, but builds a variant type with TYPE_VECTOR_OPAQUE set. */
10926 build_opaque_vector_type (tree innertype
, int nunits
)
10928 tree t
= make_vector_type (innertype
, nunits
, VOIDmode
);
10930 /* We always build the non-opaque variant before the opaque one,
10931 so if it already exists, it is TYPE_NEXT_VARIANT of this one. */
10932 cand
= TYPE_NEXT_VARIANT (t
);
10934 && TYPE_VECTOR_OPAQUE (cand
)
10935 && check_qualified_type (cand
, t
, TYPE_QUALS (t
)))
10937 /* Othewise build a variant type and make sure to queue it after
10938 the non-opaque type. */
10939 cand
= build_distinct_type_copy (t
);
10940 TYPE_VECTOR_OPAQUE (cand
) = true;
10941 TYPE_CANONICAL (cand
) = TYPE_CANONICAL (t
);
10942 TYPE_NEXT_VARIANT (cand
) = TYPE_NEXT_VARIANT (t
);
10943 TYPE_NEXT_VARIANT (t
) = cand
;
10944 TYPE_MAIN_VARIANT (cand
) = TYPE_MAIN_VARIANT (t
);
10949 /* Given an initializer INIT, return TRUE if INIT is zero or some
10950 aggregate of zeros. Otherwise return FALSE. */
10952 initializer_zerop (const_tree init
)
10958 switch (TREE_CODE (init
))
10961 return integer_zerop (init
);
10964 /* ??? Note that this is not correct for C4X float formats. There,
10965 a bit pattern of all zeros is 1.0; 0.0 is encoded with the most
10966 negative exponent. */
10967 return real_zerop (init
)
10968 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (init
));
10971 return fixed_zerop (init
);
10974 return integer_zerop (init
)
10975 || (real_zerop (init
)
10976 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_REALPART (init
)))
10977 && ! REAL_VALUE_MINUS_ZERO (TREE_REAL_CST (TREE_IMAGPART (init
))));
10982 for (i
= 0; i
< VECTOR_CST_NELTS (init
); ++i
)
10983 if (!initializer_zerop (VECTOR_CST_ELT (init
, i
)))
10990 unsigned HOST_WIDE_INT idx
;
10992 if (TREE_CLOBBER_P (init
))
10994 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (init
), idx
, elt
)
10995 if (!initializer_zerop (elt
))
11004 /* We need to loop through all elements to handle cases like
11005 "\0" and "\0foobar". */
11006 for (i
= 0; i
< TREE_STRING_LENGTH (init
); ++i
)
11007 if (TREE_STRING_POINTER (init
)[i
] != '\0')
11018 /* Check if vector VEC consists of all the equal elements and
11019 that the number of elements corresponds to the type of VEC.
11020 The function returns first element of the vector
11021 or NULL_TREE if the vector is not uniform. */
11023 uniform_vector_p (const_tree vec
)
11028 if (vec
== NULL_TREE
)
11031 gcc_assert (VECTOR_TYPE_P (TREE_TYPE (vec
)));
11033 if (TREE_CODE (vec
) == VECTOR_CST
)
11035 first
= VECTOR_CST_ELT (vec
, 0);
11036 for (i
= 1; i
< VECTOR_CST_NELTS (vec
); ++i
)
11037 if (!operand_equal_p (first
, VECTOR_CST_ELT (vec
, i
), 0))
11043 else if (TREE_CODE (vec
) == CONSTRUCTOR
)
11045 first
= error_mark_node
;
11047 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (vec
), i
, t
)
11054 if (!operand_equal_p (first
, t
, 0))
11057 if (i
!= TYPE_VECTOR_SUBPARTS (TREE_TYPE (vec
)))
11066 /* Build an empty statement at location LOC. */
11069 build_empty_stmt (location_t loc
)
11071 tree t
= build1 (NOP_EXPR
, void_type_node
, size_zero_node
);
11072 SET_EXPR_LOCATION (t
, loc
);
11077 /* Build an OpenMP clause with code CODE. LOC is the location of the
11081 build_omp_clause (location_t loc
, enum omp_clause_code code
)
11086 length
= omp_clause_num_ops
[code
];
11087 size
= (sizeof (struct tree_omp_clause
) + (length
- 1) * sizeof (tree
));
11089 record_node_allocation_statistics (OMP_CLAUSE
, size
);
11091 t
= (tree
) ggc_internal_alloc (size
);
11092 memset (t
, 0, size
);
11093 TREE_SET_CODE (t
, OMP_CLAUSE
);
11094 OMP_CLAUSE_SET_CODE (t
, code
);
11095 OMP_CLAUSE_LOCATION (t
) = loc
;
11100 /* Build a tcc_vl_exp object with code CODE and room for LEN operands. LEN
11101 includes the implicit operand count in TREE_OPERAND 0, and so must be >= 1.
11102 Except for the CODE and operand count field, other storage for the
11103 object is initialized to zeros. */
11106 build_vl_exp_stat (enum tree_code code
, int len MEM_STAT_DECL
)
11109 int length
= (len
- 1) * sizeof (tree
) + sizeof (struct tree_exp
);
11111 gcc_assert (TREE_CODE_CLASS (code
) == tcc_vl_exp
);
11112 gcc_assert (len
>= 1);
11114 record_node_allocation_statistics (code
, length
);
11116 t
= ggc_alloc_cleared_tree_node_stat (length PASS_MEM_STAT
);
11118 TREE_SET_CODE (t
, code
);
11120 /* Can't use TREE_OPERAND to store the length because if checking is
11121 enabled, it will try to check the length before we store it. :-P */
11122 t
->exp
.operands
[0] = build_int_cst (sizetype
, len
);
11127 /* Helper function for build_call_* functions; build a CALL_EXPR with
11128 indicated RETURN_TYPE, FN, and NARGS, but do not initialize any of
11129 the argument slots. */
11132 build_call_1 (tree return_type
, tree fn
, int nargs
)
11136 t
= build_vl_exp (CALL_EXPR
, nargs
+ 3);
11137 TREE_TYPE (t
) = return_type
;
11138 CALL_EXPR_FN (t
) = fn
;
11139 CALL_EXPR_STATIC_CHAIN (t
) = NULL
;
11144 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11145 FN and a null static chain slot. NARGS is the number of call arguments
11146 which are specified as "..." arguments. */
11149 build_call_nary (tree return_type
, tree fn
, int nargs
, ...)
11153 va_start (args
, nargs
);
11154 ret
= build_call_valist (return_type
, fn
, nargs
, args
);
11159 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11160 FN and a null static chain slot. NARGS is the number of call arguments
11161 which are specified as a va_list ARGS. */
11164 build_call_valist (tree return_type
, tree fn
, int nargs
, va_list args
)
11169 t
= build_call_1 (return_type
, fn
, nargs
);
11170 for (i
= 0; i
< nargs
; i
++)
11171 CALL_EXPR_ARG (t
, i
) = va_arg (args
, tree
);
11172 process_call_operands (t
);
11176 /* Build a CALL_EXPR of class tcc_vl_exp with the indicated RETURN_TYPE and
11177 FN and a null static chain slot. NARGS is the number of call arguments
11178 which are specified as a tree array ARGS. */
11181 build_call_array_loc (location_t loc
, tree return_type
, tree fn
,
11182 int nargs
, const tree
*args
)
11187 t
= build_call_1 (return_type
, fn
, nargs
);
11188 for (i
= 0; i
< nargs
; i
++)
11189 CALL_EXPR_ARG (t
, i
) = args
[i
];
11190 process_call_operands (t
);
11191 SET_EXPR_LOCATION (t
, loc
);
11195 /* Like build_call_array, but takes a vec. */
11198 build_call_vec (tree return_type
, tree fn
, vec
<tree
, va_gc
> *args
)
11203 ret
= build_call_1 (return_type
, fn
, vec_safe_length (args
));
11204 FOR_EACH_VEC_SAFE_ELT (args
, ix
, t
)
11205 CALL_EXPR_ARG (ret
, ix
) = t
;
11206 process_call_operands (ret
);
11210 /* Conveniently construct a function call expression. FNDECL names the
11211 function to be called and N arguments are passed in the array
11215 build_call_expr_loc_array (location_t loc
, tree fndecl
, int n
, tree
*argarray
)
11217 tree fntype
= TREE_TYPE (fndecl
);
11218 tree fn
= build1 (ADDR_EXPR
, build_pointer_type (fntype
), fndecl
);
11220 return fold_build_call_array_loc (loc
, TREE_TYPE (fntype
), fn
, n
, argarray
);
11223 /* Conveniently construct a function call expression. FNDECL names the
11224 function to be called and the arguments are passed in the vector
11228 build_call_expr_loc_vec (location_t loc
, tree fndecl
, vec
<tree
, va_gc
> *vec
)
11230 return build_call_expr_loc_array (loc
, fndecl
, vec_safe_length (vec
),
11231 vec_safe_address (vec
));
11235 /* Conveniently construct a function call expression. FNDECL names the
11236 function to be called, N is the number of arguments, and the "..."
11237 parameters are the argument expressions. */
11240 build_call_expr_loc (location_t loc
, tree fndecl
, int n
, ...)
11243 tree
*argarray
= XALLOCAVEC (tree
, n
);
11247 for (i
= 0; i
< n
; i
++)
11248 argarray
[i
] = va_arg (ap
, tree
);
11250 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11253 /* Like build_call_expr_loc (UNKNOWN_LOCATION, ...). Duplicated because
11254 varargs macros aren't supported by all bootstrap compilers. */
11257 build_call_expr (tree fndecl
, int n
, ...)
11260 tree
*argarray
= XALLOCAVEC (tree
, n
);
11264 for (i
= 0; i
< n
; i
++)
11265 argarray
[i
] = va_arg (ap
, tree
);
11267 return build_call_expr_loc_array (UNKNOWN_LOCATION
, fndecl
, n
, argarray
);
11270 /* Build an internal call to IFN, with arguments ARGS[0:N-1] and with return
11271 type TYPE. This is just like CALL_EXPR, except its CALL_EXPR_FN is NULL.
11272 It will get gimplified later into an ordinary internal function. */
11275 build_call_expr_internal_loc_array (location_t loc
, internal_fn ifn
,
11276 tree type
, int n
, const tree
*args
)
11278 tree t
= build_call_1 (type
, NULL_TREE
, n
);
11279 for (int i
= 0; i
< n
; ++i
)
11280 CALL_EXPR_ARG (t
, i
) = args
[i
];
11281 SET_EXPR_LOCATION (t
, loc
);
11282 CALL_EXPR_IFN (t
) = ifn
;
11286 /* Build internal call expression. This is just like CALL_EXPR, except
11287 its CALL_EXPR_FN is NULL. It will get gimplified later into ordinary
11288 internal function. */
11291 build_call_expr_internal_loc (location_t loc
, enum internal_fn ifn
,
11292 tree type
, int n
, ...)
11295 tree
*argarray
= XALLOCAVEC (tree
, n
);
11299 for (i
= 0; i
< n
; i
++)
11300 argarray
[i
] = va_arg (ap
, tree
);
11302 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11305 /* Return a function call to FN, if the target is guaranteed to support it,
11308 N is the number of arguments, passed in the "...", and TYPE is the
11309 type of the return value. */
11312 maybe_build_call_expr_loc (location_t loc
, combined_fn fn
, tree type
,
11316 tree
*argarray
= XALLOCAVEC (tree
, n
);
11320 for (i
= 0; i
< n
; i
++)
11321 argarray
[i
] = va_arg (ap
, tree
);
11323 if (internal_fn_p (fn
))
11325 internal_fn ifn
= as_internal_fn (fn
);
11326 if (direct_internal_fn_p (ifn
))
11328 tree_pair types
= direct_internal_fn_types (ifn
, type
, argarray
);
11329 if (!direct_internal_fn_supported_p (ifn
, types
,
11330 OPTIMIZE_FOR_BOTH
))
11333 return build_call_expr_internal_loc_array (loc
, ifn
, type
, n
, argarray
);
11337 tree fndecl
= builtin_decl_implicit (as_builtin_fn (fn
));
11340 return build_call_expr_loc_array (loc
, fndecl
, n
, argarray
);
11344 /* Create a new constant string literal and return a char* pointer to it.
11345 The STRING_CST value is the LEN characters at STR. */
11347 build_string_literal (int len
, const char *str
)
11349 tree t
, elem
, index
, type
;
11351 t
= build_string (len
, str
);
11352 elem
= build_type_variant (char_type_node
, 1, 0);
11353 index
= build_index_type (size_int (len
- 1));
11354 type
= build_array_type (elem
, index
);
11355 TREE_TYPE (t
) = type
;
11356 TREE_CONSTANT (t
) = 1;
11357 TREE_READONLY (t
) = 1;
11358 TREE_STATIC (t
) = 1;
11360 type
= build_pointer_type (elem
);
11361 t
= build1 (ADDR_EXPR
, type
,
11362 build4 (ARRAY_REF
, elem
,
11363 t
, integer_zero_node
, NULL_TREE
, NULL_TREE
));
11369 /* Return true if T (assumed to be a DECL) must be assigned a memory
11373 needs_to_live_in_memory (const_tree t
)
11375 return (TREE_ADDRESSABLE (t
)
11376 || is_global_var (t
)
11377 || (TREE_CODE (t
) == RESULT_DECL
11378 && !DECL_BY_REFERENCE (t
)
11379 && aggregate_value_p (t
, current_function_decl
)));
11382 /* Return value of a constant X and sign-extend it. */
11385 int_cst_value (const_tree x
)
11387 unsigned bits
= TYPE_PRECISION (TREE_TYPE (x
));
11388 unsigned HOST_WIDE_INT val
= TREE_INT_CST_LOW (x
);
11390 /* Make sure the sign-extended value will fit in a HOST_WIDE_INT. */
11391 gcc_assert (cst_and_fits_in_hwi (x
));
11393 if (bits
< HOST_BITS_PER_WIDE_INT
)
11395 bool negative
= ((val
>> (bits
- 1)) & 1) != 0;
11397 val
|= HOST_WIDE_INT_M1U
<< (bits
- 1) << 1;
11399 val
&= ~(HOST_WIDE_INT_M1U
<< (bits
- 1) << 1);
11405 /* If TYPE is an integral or pointer type, return an integer type with
11406 the same precision which is unsigned iff UNSIGNEDP is true, or itself
11407 if TYPE is already an integer type of signedness UNSIGNEDP. */
11410 signed_or_unsigned_type_for (int unsignedp
, tree type
)
11412 if (TREE_CODE (type
) == INTEGER_TYPE
&& TYPE_UNSIGNED (type
) == unsignedp
)
11415 if (TREE_CODE (type
) == VECTOR_TYPE
)
11417 tree inner
= TREE_TYPE (type
);
11418 tree inner2
= signed_or_unsigned_type_for (unsignedp
, inner
);
11421 if (inner
== inner2
)
11423 return build_vector_type (inner2
, TYPE_VECTOR_SUBPARTS (type
));
11426 if (!INTEGRAL_TYPE_P (type
)
11427 && !POINTER_TYPE_P (type
)
11428 && TREE_CODE (type
) != OFFSET_TYPE
)
11431 return build_nonstandard_integer_type (TYPE_PRECISION (type
), unsignedp
);
11434 /* If TYPE is an integral or pointer type, return an integer type with
11435 the same precision which is unsigned, or itself if TYPE is already an
11436 unsigned integer type. */
11439 unsigned_type_for (tree type
)
11441 return signed_or_unsigned_type_for (1, type
);
11444 /* If TYPE is an integral or pointer type, return an integer type with
11445 the same precision which is signed, or itself if TYPE is already a
11446 signed integer type. */
11449 signed_type_for (tree type
)
11451 return signed_or_unsigned_type_for (0, type
);
11454 /* If TYPE is a vector type, return a signed integer vector type with the
11455 same width and number of subparts. Otherwise return boolean_type_node. */
11458 truth_type_for (tree type
)
11460 if (TREE_CODE (type
) == VECTOR_TYPE
)
11462 if (VECTOR_BOOLEAN_TYPE_P (type
))
11464 return build_truth_vector_type (TYPE_VECTOR_SUBPARTS (type
),
11465 GET_MODE_SIZE (TYPE_MODE (type
)));
11468 return boolean_type_node
;
11471 /* Returns the largest value obtainable by casting something in INNER type to
11475 upper_bound_in_type (tree outer
, tree inner
)
11477 unsigned int det
= 0;
11478 unsigned oprec
= TYPE_PRECISION (outer
);
11479 unsigned iprec
= TYPE_PRECISION (inner
);
11482 /* Compute a unique number for every combination. */
11483 det
|= (oprec
> iprec
) ? 4 : 0;
11484 det
|= TYPE_UNSIGNED (outer
) ? 2 : 0;
11485 det
|= TYPE_UNSIGNED (inner
) ? 1 : 0;
11487 /* Determine the exponent to use. */
11492 /* oprec <= iprec, outer: signed, inner: don't care. */
11497 /* oprec <= iprec, outer: unsigned, inner: don't care. */
11501 /* oprec > iprec, outer: signed, inner: signed. */
11505 /* oprec > iprec, outer: signed, inner: unsigned. */
11509 /* oprec > iprec, outer: unsigned, inner: signed. */
11513 /* oprec > iprec, outer: unsigned, inner: unsigned. */
11517 gcc_unreachable ();
11520 return wide_int_to_tree (outer
,
11521 wi::mask (prec
, false, TYPE_PRECISION (outer
)));
11524 /* Returns the smallest value obtainable by casting something in INNER type to
11528 lower_bound_in_type (tree outer
, tree inner
)
11530 unsigned oprec
= TYPE_PRECISION (outer
);
11531 unsigned iprec
= TYPE_PRECISION (inner
);
11533 /* If OUTER type is unsigned, we can definitely cast 0 to OUTER type
11535 if (TYPE_UNSIGNED (outer
)
11536 /* If we are widening something of an unsigned type, OUTER type
11537 contains all values of INNER type. In particular, both INNER
11538 and OUTER types have zero in common. */
11539 || (oprec
> iprec
&& TYPE_UNSIGNED (inner
)))
11540 return build_int_cst (outer
, 0);
11543 /* If we are widening a signed type to another signed type, we
11544 want to obtain -2^^(iprec-1). If we are keeping the
11545 precision or narrowing to a signed type, we want to obtain
11547 unsigned prec
= oprec
> iprec
? iprec
: oprec
;
11548 return wide_int_to_tree (outer
,
11549 wi::mask (prec
- 1, true,
11550 TYPE_PRECISION (outer
)));
11554 /* Return nonzero if two operands that are suitable for PHI nodes are
11555 necessarily equal. Specifically, both ARG0 and ARG1 must be either
11556 SSA_NAME or invariant. Note that this is strictly an optimization.
11557 That is, callers of this function can directly call operand_equal_p
11558 and get the same result, only slower. */
11561 operand_equal_for_phi_arg_p (const_tree arg0
, const_tree arg1
)
11565 if (TREE_CODE (arg0
) == SSA_NAME
|| TREE_CODE (arg1
) == SSA_NAME
)
11567 return operand_equal_p (arg0
, arg1
, 0);
11570 /* Returns number of zeros at the end of binary representation of X. */
11573 num_ending_zeros (const_tree x
)
11575 return build_int_cst (TREE_TYPE (x
), wi::ctz (x
));
11579 #define WALK_SUBTREE(NODE) \
11582 result = walk_tree_1 (&(NODE), func, data, pset, lh); \
11588 /* This is a subroutine of walk_tree that walks field of TYPE that are to
11589 be walked whenever a type is seen in the tree. Rest of operands and return
11590 value are as for walk_tree. */
11593 walk_type_fields (tree type
, walk_tree_fn func
, void *data
,
11594 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11596 tree result
= NULL_TREE
;
11598 switch (TREE_CODE (type
))
11601 case REFERENCE_TYPE
:
11603 /* We have to worry about mutually recursive pointers. These can't
11604 be written in C. They can in Ada. It's pathological, but
11605 there's an ACATS test (c38102a) that checks it. Deal with this
11606 by checking if we're pointing to another pointer, that one
11607 points to another pointer, that one does too, and we have no htab.
11608 If so, get a hash table. We check three levels deep to avoid
11609 the cost of the hash table if we don't need one. */
11610 if (POINTER_TYPE_P (TREE_TYPE (type
))
11611 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (type
)))
11612 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (TREE_TYPE (type
))))
11615 result
= walk_tree_without_duplicates (&TREE_TYPE (type
),
11626 WALK_SUBTREE (TREE_TYPE (type
));
11630 WALK_SUBTREE (TYPE_METHOD_BASETYPE (type
));
11632 /* Fall through. */
11634 case FUNCTION_TYPE
:
11635 WALK_SUBTREE (TREE_TYPE (type
));
11639 /* We never want to walk into default arguments. */
11640 for (arg
= TYPE_ARG_TYPES (type
); arg
; arg
= TREE_CHAIN (arg
))
11641 WALK_SUBTREE (TREE_VALUE (arg
));
11646 /* Don't follow this nodes's type if a pointer for fear that
11647 we'll have infinite recursion. If we have a PSET, then we
11650 || (!POINTER_TYPE_P (TREE_TYPE (type
))
11651 && TREE_CODE (TREE_TYPE (type
)) != OFFSET_TYPE
))
11652 WALK_SUBTREE (TREE_TYPE (type
));
11653 WALK_SUBTREE (TYPE_DOMAIN (type
));
11657 WALK_SUBTREE (TREE_TYPE (type
));
11658 WALK_SUBTREE (TYPE_OFFSET_BASETYPE (type
));
11668 /* Apply FUNC to all the sub-trees of TP in a pre-order traversal. FUNC is
11669 called with the DATA and the address of each sub-tree. If FUNC returns a
11670 non-NULL value, the traversal is stopped, and the value returned by FUNC
11671 is returned. If PSET is non-NULL it is used to record the nodes visited,
11672 and to avoid visiting a node more than once. */
11675 walk_tree_1 (tree
*tp
, walk_tree_fn func
, void *data
,
11676 hash_set
<tree
> *pset
, walk_tree_lh lh
)
11678 enum tree_code code
;
11682 #define WALK_SUBTREE_TAIL(NODE) \
11686 goto tail_recurse; \
11691 /* Skip empty subtrees. */
11695 /* Don't walk the same tree twice, if the user has requested
11696 that we avoid doing so. */
11697 if (pset
&& pset
->add (*tp
))
11700 /* Call the function. */
11702 result
= (*func
) (tp
, &walk_subtrees
, data
);
11704 /* If we found something, return it. */
11708 code
= TREE_CODE (*tp
);
11710 /* Even if we didn't, FUNC may have decided that there was nothing
11711 interesting below this point in the tree. */
11712 if (!walk_subtrees
)
11714 /* But we still need to check our siblings. */
11715 if (code
== TREE_LIST
)
11716 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11717 else if (code
== OMP_CLAUSE
)
11718 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11725 result
= (*lh
) (tp
, &walk_subtrees
, func
, data
, pset
);
11726 if (result
|| !walk_subtrees
)
11733 case IDENTIFIER_NODE
:
11740 case PLACEHOLDER_EXPR
:
11744 /* None of these have subtrees other than those already walked
11749 WALK_SUBTREE (TREE_VALUE (*tp
));
11750 WALK_SUBTREE_TAIL (TREE_CHAIN (*tp
));
11755 int len
= TREE_VEC_LENGTH (*tp
);
11760 /* Walk all elements but the first. */
11762 WALK_SUBTREE (TREE_VEC_ELT (*tp
, len
));
11764 /* Now walk the first one as a tail call. */
11765 WALK_SUBTREE_TAIL (TREE_VEC_ELT (*tp
, 0));
11769 WALK_SUBTREE (TREE_REALPART (*tp
));
11770 WALK_SUBTREE_TAIL (TREE_IMAGPART (*tp
));
11774 unsigned HOST_WIDE_INT idx
;
11775 constructor_elt
*ce
;
11777 for (idx
= 0; vec_safe_iterate (CONSTRUCTOR_ELTS (*tp
), idx
, &ce
);
11779 WALK_SUBTREE (ce
->value
);
11784 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, 0));
11789 for (decl
= BIND_EXPR_VARS (*tp
); decl
; decl
= DECL_CHAIN (decl
))
11791 /* Walk the DECL_INITIAL and DECL_SIZE. We don't want to walk
11792 into declarations that are just mentioned, rather than
11793 declared; they don't really belong to this part of the tree.
11794 And, we can see cycles: the initializer for a declaration
11795 can refer to the declaration itself. */
11796 WALK_SUBTREE (DECL_INITIAL (decl
));
11797 WALK_SUBTREE (DECL_SIZE (decl
));
11798 WALK_SUBTREE (DECL_SIZE_UNIT (decl
));
11800 WALK_SUBTREE_TAIL (BIND_EXPR_BODY (*tp
));
11803 case STATEMENT_LIST
:
11805 tree_stmt_iterator i
;
11806 for (i
= tsi_start (*tp
); !tsi_end_p (i
); tsi_next (&i
))
11807 WALK_SUBTREE (*tsi_stmt_ptr (i
));
11812 switch (OMP_CLAUSE_CODE (*tp
))
11814 case OMP_CLAUSE_GANG
:
11815 case OMP_CLAUSE__GRIDDIM_
:
11816 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11819 case OMP_CLAUSE_ASYNC
:
11820 case OMP_CLAUSE_WAIT
:
11821 case OMP_CLAUSE_WORKER
:
11822 case OMP_CLAUSE_VECTOR
:
11823 case OMP_CLAUSE_NUM_GANGS
:
11824 case OMP_CLAUSE_NUM_WORKERS
:
11825 case OMP_CLAUSE_VECTOR_LENGTH
:
11826 case OMP_CLAUSE_PRIVATE
:
11827 case OMP_CLAUSE_SHARED
:
11828 case OMP_CLAUSE_FIRSTPRIVATE
:
11829 case OMP_CLAUSE_COPYIN
:
11830 case OMP_CLAUSE_COPYPRIVATE
:
11831 case OMP_CLAUSE_FINAL
:
11832 case OMP_CLAUSE_IF
:
11833 case OMP_CLAUSE_NUM_THREADS
:
11834 case OMP_CLAUSE_SCHEDULE
:
11835 case OMP_CLAUSE_UNIFORM
:
11836 case OMP_CLAUSE_DEPEND
:
11837 case OMP_CLAUSE_NUM_TEAMS
:
11838 case OMP_CLAUSE_THREAD_LIMIT
:
11839 case OMP_CLAUSE_DEVICE
:
11840 case OMP_CLAUSE_DIST_SCHEDULE
:
11841 case OMP_CLAUSE_SAFELEN
:
11842 case OMP_CLAUSE_SIMDLEN
:
11843 case OMP_CLAUSE_ORDERED
:
11844 case OMP_CLAUSE_PRIORITY
:
11845 case OMP_CLAUSE_GRAINSIZE
:
11846 case OMP_CLAUSE_NUM_TASKS
:
11847 case OMP_CLAUSE_HINT
:
11848 case OMP_CLAUSE_TO_DECLARE
:
11849 case OMP_CLAUSE_LINK
:
11850 case OMP_CLAUSE_USE_DEVICE_PTR
:
11851 case OMP_CLAUSE_IS_DEVICE_PTR
:
11852 case OMP_CLAUSE__LOOPTEMP_
:
11853 case OMP_CLAUSE__SIMDUID_
:
11854 case OMP_CLAUSE__CILK_FOR_COUNT_
:
11855 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 0));
11858 case OMP_CLAUSE_INDEPENDENT
:
11859 case OMP_CLAUSE_NOWAIT
:
11860 case OMP_CLAUSE_DEFAULT
:
11861 case OMP_CLAUSE_UNTIED
:
11862 case OMP_CLAUSE_MERGEABLE
:
11863 case OMP_CLAUSE_PROC_BIND
:
11864 case OMP_CLAUSE_INBRANCH
:
11865 case OMP_CLAUSE_NOTINBRANCH
:
11866 case OMP_CLAUSE_FOR
:
11867 case OMP_CLAUSE_PARALLEL
:
11868 case OMP_CLAUSE_SECTIONS
:
11869 case OMP_CLAUSE_TASKGROUP
:
11870 case OMP_CLAUSE_NOGROUP
:
11871 case OMP_CLAUSE_THREADS
:
11872 case OMP_CLAUSE_SIMD
:
11873 case OMP_CLAUSE_DEFAULTMAP
:
11874 case OMP_CLAUSE_AUTO
:
11875 case OMP_CLAUSE_SEQ
:
11876 case OMP_CLAUSE_TILE
:
11877 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11879 case OMP_CLAUSE_LASTPRIVATE
:
11880 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11881 WALK_SUBTREE (OMP_CLAUSE_LASTPRIVATE_STMT (*tp
));
11882 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11884 case OMP_CLAUSE_COLLAPSE
:
11887 for (i
= 0; i
< 3; i
++)
11888 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11889 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11892 case OMP_CLAUSE_LINEAR
:
11893 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11894 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STEP (*tp
));
11895 WALK_SUBTREE (OMP_CLAUSE_LINEAR_STMT (*tp
));
11896 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11898 case OMP_CLAUSE_ALIGNED
:
11899 case OMP_CLAUSE_FROM
:
11900 case OMP_CLAUSE_TO
:
11901 case OMP_CLAUSE_MAP
:
11902 case OMP_CLAUSE__CACHE_
:
11903 WALK_SUBTREE (OMP_CLAUSE_DECL (*tp
));
11904 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, 1));
11905 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11907 case OMP_CLAUSE_REDUCTION
:
11910 for (i
= 0; i
< 5; i
++)
11911 WALK_SUBTREE (OMP_CLAUSE_OPERAND (*tp
, i
));
11912 WALK_SUBTREE_TAIL (OMP_CLAUSE_CHAIN (*tp
));
11916 gcc_unreachable ();
11924 /* TARGET_EXPRs are peculiar: operands 1 and 3 can be the same.
11925 But, we only want to walk once. */
11926 len
= (TREE_OPERAND (*tp
, 3) == TREE_OPERAND (*tp
, 1)) ? 2 : 3;
11927 for (i
= 0; i
< len
; ++i
)
11928 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
11929 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
));
11933 /* If this is a TYPE_DECL, walk into the fields of the type that it's
11934 defining. We only want to walk into these fields of a type in this
11935 case and not in the general case of a mere reference to the type.
11937 The criterion is as follows: if the field can be an expression, it
11938 must be walked only here. This should be in keeping with the fields
11939 that are directly gimplified in gimplify_type_sizes in order for the
11940 mark/copy-if-shared/unmark machinery of the gimplifier to work with
11941 variable-sized types.
11943 Note that DECLs get walked as part of processing the BIND_EXPR. */
11944 if (TREE_CODE (DECL_EXPR_DECL (*tp
)) == TYPE_DECL
)
11946 tree
*type_p
= &TREE_TYPE (DECL_EXPR_DECL (*tp
));
11947 if (TREE_CODE (*type_p
) == ERROR_MARK
)
11950 /* Call the function for the type. See if it returns anything or
11951 doesn't want us to continue. If we are to continue, walk both
11952 the normal fields and those for the declaration case. */
11953 result
= (*func
) (type_p
, &walk_subtrees
, data
);
11954 if (result
|| !walk_subtrees
)
11957 /* But do not walk a pointed-to type since it may itself need to
11958 be walked in the declaration case if it isn't anonymous. */
11959 if (!POINTER_TYPE_P (*type_p
))
11961 result
= walk_type_fields (*type_p
, func
, data
, pset
, lh
);
11966 /* If this is a record type, also walk the fields. */
11967 if (RECORD_OR_UNION_TYPE_P (*type_p
))
11971 for (field
= TYPE_FIELDS (*type_p
); field
;
11972 field
= DECL_CHAIN (field
))
11974 /* We'd like to look at the type of the field, but we can
11975 easily get infinite recursion. So assume it's pointed
11976 to elsewhere in the tree. Also, ignore things that
11978 if (TREE_CODE (field
) != FIELD_DECL
)
11981 WALK_SUBTREE (DECL_FIELD_OFFSET (field
));
11982 WALK_SUBTREE (DECL_SIZE (field
));
11983 WALK_SUBTREE (DECL_SIZE_UNIT (field
));
11984 if (TREE_CODE (*type_p
) == QUAL_UNION_TYPE
)
11985 WALK_SUBTREE (DECL_QUALIFIER (field
));
11989 /* Same for scalar types. */
11990 else if (TREE_CODE (*type_p
) == BOOLEAN_TYPE
11991 || TREE_CODE (*type_p
) == ENUMERAL_TYPE
11992 || TREE_CODE (*type_p
) == INTEGER_TYPE
11993 || TREE_CODE (*type_p
) == FIXED_POINT_TYPE
11994 || TREE_CODE (*type_p
) == REAL_TYPE
)
11996 WALK_SUBTREE (TYPE_MIN_VALUE (*type_p
));
11997 WALK_SUBTREE (TYPE_MAX_VALUE (*type_p
));
12000 WALK_SUBTREE (TYPE_SIZE (*type_p
));
12001 WALK_SUBTREE_TAIL (TYPE_SIZE_UNIT (*type_p
));
12006 if (IS_EXPR_CODE_CLASS (TREE_CODE_CLASS (code
)))
12010 /* Walk over all the sub-trees of this operand. */
12011 len
= TREE_OPERAND_LENGTH (*tp
);
12013 /* Go through the subtrees. We need to do this in forward order so
12014 that the scope of a FOR_EXPR is handled properly. */
12017 for (i
= 0; i
< len
- 1; ++i
)
12018 WALK_SUBTREE (TREE_OPERAND (*tp
, i
));
12019 WALK_SUBTREE_TAIL (TREE_OPERAND (*tp
, len
- 1));
12022 /* If this is a type, walk the needed fields in the type. */
12023 else if (TYPE_P (*tp
))
12024 return walk_type_fields (*tp
, func
, data
, pset
, lh
);
12028 /* We didn't find what we were looking for. */
12031 #undef WALK_SUBTREE_TAIL
12033 #undef WALK_SUBTREE
12035 /* Like walk_tree, but does not walk duplicate nodes more than once. */
12038 walk_tree_without_duplicates_1 (tree
*tp
, walk_tree_fn func
, void *data
,
12043 hash_set
<tree
> pset
;
12044 result
= walk_tree_1 (tp
, func
, data
, &pset
, lh
);
12050 tree_block (tree t
)
12052 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12054 if (IS_EXPR_CODE_CLASS (c
))
12055 return LOCATION_BLOCK (t
->exp
.locus
);
12056 gcc_unreachable ();
12061 tree_set_block (tree t
, tree b
)
12063 const enum tree_code_class c
= TREE_CODE_CLASS (TREE_CODE (t
));
12065 if (IS_EXPR_CODE_CLASS (c
))
12067 t
->exp
.locus
= set_block (t
->exp
.locus
, b
);
12070 gcc_unreachable ();
12073 /* Create a nameless artificial label and put it in the current
12074 function context. The label has a location of LOC. Returns the
12075 newly created label. */
12078 create_artificial_label (location_t loc
)
12080 tree lab
= build_decl (loc
,
12081 LABEL_DECL
, NULL_TREE
, void_type_node
);
12083 DECL_ARTIFICIAL (lab
) = 1;
12084 DECL_IGNORED_P (lab
) = 1;
12085 DECL_CONTEXT (lab
) = current_function_decl
;
12089 /* Given a tree, try to return a useful variable name that we can use
12090 to prefix a temporary that is being assigned the value of the tree.
12091 I.E. given <temp> = &A, return A. */
12096 tree stripped_decl
;
12099 STRIP_NOPS (stripped_decl
);
12100 if (DECL_P (stripped_decl
) && DECL_NAME (stripped_decl
))
12101 return IDENTIFIER_POINTER (DECL_NAME (stripped_decl
));
12102 else if (TREE_CODE (stripped_decl
) == SSA_NAME
)
12104 tree name
= SSA_NAME_IDENTIFIER (stripped_decl
);
12107 return IDENTIFIER_POINTER (name
);
12111 switch (TREE_CODE (stripped_decl
))
12114 return get_name (TREE_OPERAND (stripped_decl
, 0));
12121 /* Return true if TYPE has a variable argument list. */
12124 stdarg_p (const_tree fntype
)
12126 function_args_iterator args_iter
;
12127 tree n
= NULL_TREE
, t
;
12132 FOREACH_FUNCTION_ARGS (fntype
, t
, args_iter
)
12137 return n
!= NULL_TREE
&& n
!= void_type_node
;
12140 /* Return true if TYPE has a prototype. */
12143 prototype_p (const_tree fntype
)
12147 gcc_assert (fntype
!= NULL_TREE
);
12149 t
= TYPE_ARG_TYPES (fntype
);
12150 return (t
!= NULL_TREE
);
12153 /* If BLOCK is inlined from an __attribute__((__artificial__))
12154 routine, return pointer to location from where it has been
12157 block_nonartificial_location (tree block
)
12159 location_t
*ret
= NULL
;
12161 while (block
&& TREE_CODE (block
) == BLOCK
12162 && BLOCK_ABSTRACT_ORIGIN (block
))
12164 tree ao
= BLOCK_ABSTRACT_ORIGIN (block
);
12166 while (TREE_CODE (ao
) == BLOCK
12167 && BLOCK_ABSTRACT_ORIGIN (ao
)
12168 && BLOCK_ABSTRACT_ORIGIN (ao
) != ao
)
12169 ao
= BLOCK_ABSTRACT_ORIGIN (ao
);
12171 if (TREE_CODE (ao
) == FUNCTION_DECL
)
12173 /* If AO is an artificial inline, point RET to the
12174 call site locus at which it has been inlined and continue
12175 the loop, in case AO's caller is also an artificial
12177 if (DECL_DECLARED_INLINE_P (ao
)
12178 && lookup_attribute ("artificial", DECL_ATTRIBUTES (ao
)))
12179 ret
= &BLOCK_SOURCE_LOCATION (block
);
12183 else if (TREE_CODE (ao
) != BLOCK
)
12186 block
= BLOCK_SUPERCONTEXT (block
);
12192 /* If EXP is inlined from an __attribute__((__artificial__))
12193 function, return the location of the original call expression. */
12196 tree_nonartificial_location (tree exp
)
12198 location_t
*loc
= block_nonartificial_location (TREE_BLOCK (exp
));
12203 return EXPR_LOCATION (exp
);
12207 /* These are the hash table functions for the hash table of OPTIMIZATION_NODEq
12210 /* Return the hash code X, an OPTIMIZATION_NODE or TARGET_OPTION code. */
12213 cl_option_hasher::hash (tree x
)
12215 const_tree
const t
= x
;
12219 hashval_t hash
= 0;
12221 if (TREE_CODE (t
) == OPTIMIZATION_NODE
)
12223 p
= (const char *)TREE_OPTIMIZATION (t
);
12224 len
= sizeof (struct cl_optimization
);
12227 else if (TREE_CODE (t
) == TARGET_OPTION_NODE
)
12228 return cl_target_option_hash (TREE_TARGET_OPTION (t
));
12231 gcc_unreachable ();
12233 /* assume most opt flags are just 0/1, some are 2-3, and a few might be
12235 for (i
= 0; i
< len
; i
++)
12237 hash
= (hash
<< 4) ^ ((i
<< 2) | p
[i
]);
12242 /* Return nonzero if the value represented by *X (an OPTIMIZATION or
12243 TARGET_OPTION tree node) is the same as that given by *Y, which is the
12247 cl_option_hasher::equal (tree x
, tree y
)
12249 const_tree
const xt
= x
;
12250 const_tree
const yt
= y
;
12255 if (TREE_CODE (xt
) != TREE_CODE (yt
))
12258 if (TREE_CODE (xt
) == OPTIMIZATION_NODE
)
12260 xp
= (const char *)TREE_OPTIMIZATION (xt
);
12261 yp
= (const char *)TREE_OPTIMIZATION (yt
);
12262 len
= sizeof (struct cl_optimization
);
12265 else if (TREE_CODE (xt
) == TARGET_OPTION_NODE
)
12267 return cl_target_option_eq (TREE_TARGET_OPTION (xt
),
12268 TREE_TARGET_OPTION (yt
));
12272 gcc_unreachable ();
12274 return (memcmp (xp
, yp
, len
) == 0);
12277 /* Build an OPTIMIZATION_NODE based on the options in OPTS. */
12280 build_optimization_node (struct gcc_options
*opts
)
12284 /* Use the cache of optimization nodes. */
12286 cl_optimization_save (TREE_OPTIMIZATION (cl_optimization_node
),
12289 tree
*slot
= cl_option_hash_table
->find_slot (cl_optimization_node
, INSERT
);
12293 /* Insert this one into the hash table. */
12294 t
= cl_optimization_node
;
12297 /* Make a new node for next time round. */
12298 cl_optimization_node
= make_node (OPTIMIZATION_NODE
);
12304 /* Build a TARGET_OPTION_NODE based on the options in OPTS. */
12307 build_target_option_node (struct gcc_options
*opts
)
12311 /* Use the cache of optimization nodes. */
12313 cl_target_option_save (TREE_TARGET_OPTION (cl_target_option_node
),
12316 tree
*slot
= cl_option_hash_table
->find_slot (cl_target_option_node
, INSERT
);
12320 /* Insert this one into the hash table. */
12321 t
= cl_target_option_node
;
12324 /* Make a new node for next time round. */
12325 cl_target_option_node
= make_node (TARGET_OPTION_NODE
);
12331 /* Clear TREE_TARGET_GLOBALS of all TARGET_OPTION_NODE trees,
12332 so that they aren't saved during PCH writing. */
12335 prepare_target_option_nodes_for_pch (void)
12337 hash_table
<cl_option_hasher
>::iterator iter
= cl_option_hash_table
->begin ();
12338 for (; iter
!= cl_option_hash_table
->end (); ++iter
)
12339 if (TREE_CODE (*iter
) == TARGET_OPTION_NODE
)
12340 TREE_TARGET_GLOBALS (*iter
) = NULL
;
12343 /* Determine the "ultimate origin" of a block. The block may be an inlined
12344 instance of an inlined instance of a block which is local to an inline
12345 function, so we have to trace all of the way back through the origin chain
12346 to find out what sort of node actually served as the original seed for the
12350 block_ultimate_origin (const_tree block
)
12352 tree immediate_origin
= BLOCK_ABSTRACT_ORIGIN (block
);
12354 /* BLOCK_ABSTRACT_ORIGIN can point to itself; ignore that if
12355 we're trying to output the abstract instance of this function. */
12356 if (BLOCK_ABSTRACT (block
) && immediate_origin
== block
)
12359 if (immediate_origin
== NULL_TREE
)
12364 tree lookahead
= immediate_origin
;
12368 ret_val
= lookahead
;
12369 lookahead
= (TREE_CODE (ret_val
) == BLOCK
12370 ? BLOCK_ABSTRACT_ORIGIN (ret_val
) : NULL
);
12372 while (lookahead
!= NULL
&& lookahead
!= ret_val
);
12374 /* The block's abstract origin chain may not be the *ultimate* origin of
12375 the block. It could lead to a DECL that has an abstract origin set.
12376 If so, we want that DECL's abstract origin (which is what DECL_ORIGIN
12377 will give us if it has one). Note that DECL's abstract origins are
12378 supposed to be the most distant ancestor (or so decl_ultimate_origin
12379 claims), so we don't need to loop following the DECL origins. */
12380 if (DECL_P (ret_val
))
12381 return DECL_ORIGIN (ret_val
);
12387 /* Return true iff conversion from INNER_TYPE to OUTER_TYPE generates
12391 tree_nop_conversion_p (const_tree outer_type
, const_tree inner_type
)
12393 /* Do not strip casts into or out of differing address spaces. */
12394 if (POINTER_TYPE_P (outer_type
)
12395 && TYPE_ADDR_SPACE (TREE_TYPE (outer_type
)) != ADDR_SPACE_GENERIC
)
12397 if (!POINTER_TYPE_P (inner_type
)
12398 || (TYPE_ADDR_SPACE (TREE_TYPE (outer_type
))
12399 != TYPE_ADDR_SPACE (TREE_TYPE (inner_type
))))
12402 else if (POINTER_TYPE_P (inner_type
)
12403 && TYPE_ADDR_SPACE (TREE_TYPE (inner_type
)) != ADDR_SPACE_GENERIC
)
12405 /* We already know that outer_type is not a pointer with
12406 a non-generic address space. */
12410 /* Use precision rather then machine mode when we can, which gives
12411 the correct answer even for submode (bit-field) types. */
12412 if ((INTEGRAL_TYPE_P (outer_type
)
12413 || POINTER_TYPE_P (outer_type
)
12414 || TREE_CODE (outer_type
) == OFFSET_TYPE
)
12415 && (INTEGRAL_TYPE_P (inner_type
)
12416 || POINTER_TYPE_P (inner_type
)
12417 || TREE_CODE (inner_type
) == OFFSET_TYPE
))
12418 return TYPE_PRECISION (outer_type
) == TYPE_PRECISION (inner_type
);
12420 /* Otherwise fall back on comparing machine modes (e.g. for
12421 aggregate types, floats). */
12422 return TYPE_MODE (outer_type
) == TYPE_MODE (inner_type
);
12425 /* Return true iff conversion in EXP generates no instruction. Mark
12426 it inline so that we fully inline into the stripping functions even
12427 though we have two uses of this function. */
12430 tree_nop_conversion (const_tree exp
)
12432 tree outer_type
, inner_type
;
12434 if (!CONVERT_EXPR_P (exp
)
12435 && TREE_CODE (exp
) != NON_LVALUE_EXPR
)
12437 if (TREE_OPERAND (exp
, 0) == error_mark_node
)
12440 outer_type
= TREE_TYPE (exp
);
12441 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12446 return tree_nop_conversion_p (outer_type
, inner_type
);
12449 /* Return true iff conversion in EXP generates no instruction. Don't
12450 consider conversions changing the signedness. */
12453 tree_sign_nop_conversion (const_tree exp
)
12455 tree outer_type
, inner_type
;
12457 if (!tree_nop_conversion (exp
))
12460 outer_type
= TREE_TYPE (exp
);
12461 inner_type
= TREE_TYPE (TREE_OPERAND (exp
, 0));
12463 return (TYPE_UNSIGNED (outer_type
) == TYPE_UNSIGNED (inner_type
)
12464 && POINTER_TYPE_P (outer_type
) == POINTER_TYPE_P (inner_type
));
12467 /* Strip conversions from EXP according to tree_nop_conversion and
12468 return the resulting expression. */
12471 tree_strip_nop_conversions (tree exp
)
12473 while (tree_nop_conversion (exp
))
12474 exp
= TREE_OPERAND (exp
, 0);
12478 /* Strip conversions from EXP according to tree_sign_nop_conversion
12479 and return the resulting expression. */
12482 tree_strip_sign_nop_conversions (tree exp
)
12484 while (tree_sign_nop_conversion (exp
))
12485 exp
= TREE_OPERAND (exp
, 0);
12489 /* Avoid any floating point extensions from EXP. */
12491 strip_float_extensions (tree exp
)
12493 tree sub
, expt
, subt
;
12495 /* For floating point constant look up the narrowest type that can hold
12496 it properly and handle it like (type)(narrowest_type)constant.
12497 This way we can optimize for instance a=a*2.0 where "a" is float
12498 but 2.0 is double constant. */
12499 if (TREE_CODE (exp
) == REAL_CST
&& !DECIMAL_FLOAT_TYPE_P (TREE_TYPE (exp
)))
12501 REAL_VALUE_TYPE orig
;
12504 orig
= TREE_REAL_CST (exp
);
12505 if (TYPE_PRECISION (TREE_TYPE (exp
)) > TYPE_PRECISION (float_type_node
)
12506 && exact_real_truncate (TYPE_MODE (float_type_node
), &orig
))
12507 type
= float_type_node
;
12508 else if (TYPE_PRECISION (TREE_TYPE (exp
))
12509 > TYPE_PRECISION (double_type_node
)
12510 && exact_real_truncate (TYPE_MODE (double_type_node
), &orig
))
12511 type
= double_type_node
;
12513 return build_real_truncate (type
, orig
);
12516 if (!CONVERT_EXPR_P (exp
))
12519 sub
= TREE_OPERAND (exp
, 0);
12520 subt
= TREE_TYPE (sub
);
12521 expt
= TREE_TYPE (exp
);
12523 if (!FLOAT_TYPE_P (subt
))
12526 if (DECIMAL_FLOAT_TYPE_P (expt
) != DECIMAL_FLOAT_TYPE_P (subt
))
12529 if (TYPE_PRECISION (subt
) > TYPE_PRECISION (expt
))
12532 return strip_float_extensions (sub
);
12535 /* Strip out all handled components that produce invariant
12539 strip_invariant_refs (const_tree op
)
12541 while (handled_component_p (op
))
12543 switch (TREE_CODE (op
))
12546 case ARRAY_RANGE_REF
:
12547 if (!is_gimple_constant (TREE_OPERAND (op
, 1))
12548 || TREE_OPERAND (op
, 2) != NULL_TREE
12549 || TREE_OPERAND (op
, 3) != NULL_TREE
)
12553 case COMPONENT_REF
:
12554 if (TREE_OPERAND (op
, 2) != NULL_TREE
)
12560 op
= TREE_OPERAND (op
, 0);
12566 static GTY(()) tree gcc_eh_personality_decl
;
12568 /* Return the GCC personality function decl. */
12571 lhd_gcc_personality (void)
12573 if (!gcc_eh_personality_decl
)
12574 gcc_eh_personality_decl
= build_personality_function ("gcc");
12575 return gcc_eh_personality_decl
;
12578 /* TARGET is a call target of GIMPLE call statement
12579 (obtained by gimple_call_fn). Return true if it is
12580 OBJ_TYPE_REF representing an virtual call of C++ method.
12581 (As opposed to OBJ_TYPE_REF representing objc calls
12582 through a cast where middle-end devirtualization machinery
12586 virtual_method_call_p (const_tree target
)
12588 if (TREE_CODE (target
) != OBJ_TYPE_REF
)
12590 tree t
= TREE_TYPE (target
);
12591 gcc_checking_assert (TREE_CODE (t
) == POINTER_TYPE
);
12593 if (TREE_CODE (t
) == FUNCTION_TYPE
)
12595 gcc_checking_assert (TREE_CODE (t
) == METHOD_TYPE
);
12596 /* If we do not have BINFO associated, it means that type was built
12597 without devirtualization enabled. Do not consider this a virtual
12599 if (!TYPE_BINFO (obj_type_ref_class (target
)))
12604 /* REF is OBJ_TYPE_REF, return the class the ref corresponds to. */
12607 obj_type_ref_class (const_tree ref
)
12609 gcc_checking_assert (TREE_CODE (ref
) == OBJ_TYPE_REF
);
12610 ref
= TREE_TYPE (ref
);
12611 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12612 ref
= TREE_TYPE (ref
);
12613 /* We look for type THIS points to. ObjC also builds
12614 OBJ_TYPE_REF with non-method calls, Their first parameter
12615 ID however also corresponds to class type. */
12616 gcc_checking_assert (TREE_CODE (ref
) == METHOD_TYPE
12617 || TREE_CODE (ref
) == FUNCTION_TYPE
);
12618 ref
= TREE_VALUE (TYPE_ARG_TYPES (ref
));
12619 gcc_checking_assert (TREE_CODE (ref
) == POINTER_TYPE
);
12620 return TREE_TYPE (ref
);
12623 /* Lookup sub-BINFO of BINFO of TYPE at offset POS. */
12626 lookup_binfo_at_offset (tree binfo
, tree type
, HOST_WIDE_INT pos
)
12629 tree base_binfo
, b
;
12631 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12632 if (pos
== tree_to_shwi (BINFO_OFFSET (base_binfo
))
12633 && types_same_for_odr (TREE_TYPE (base_binfo
), type
))
12635 else if ((b
= lookup_binfo_at_offset (base_binfo
, type
, pos
)) != NULL
)
12640 /* Try to find a base info of BINFO that would have its field decl at offset
12641 OFFSET within the BINFO type and which is of EXPECTED_TYPE. If it can be
12642 found, return, otherwise return NULL_TREE. */
12645 get_binfo_at_offset (tree binfo
, HOST_WIDE_INT offset
, tree expected_type
)
12647 tree type
= BINFO_TYPE (binfo
);
12651 HOST_WIDE_INT pos
, size
;
12655 if (types_same_for_odr (type
, expected_type
))
12660 for (fld
= TYPE_FIELDS (type
); fld
; fld
= DECL_CHAIN (fld
))
12662 if (TREE_CODE (fld
) != FIELD_DECL
|| !DECL_ARTIFICIAL (fld
))
12665 pos
= int_bit_position (fld
);
12666 size
= tree_to_uhwi (DECL_SIZE (fld
));
12667 if (pos
<= offset
&& (pos
+ size
) > offset
)
12670 if (!fld
|| TREE_CODE (TREE_TYPE (fld
)) != RECORD_TYPE
)
12673 /* Offset 0 indicates the primary base, whose vtable contents are
12674 represented in the binfo for the derived class. */
12675 else if (offset
!= 0)
12677 tree found_binfo
= NULL
, base_binfo
;
12678 /* Offsets in BINFO are in bytes relative to the whole structure
12679 while POS is in bits relative to the containing field. */
12680 int binfo_offset
= (tree_to_shwi (BINFO_OFFSET (binfo
)) + pos
12683 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base_binfo
); i
++)
12684 if (tree_to_shwi (BINFO_OFFSET (base_binfo
)) == binfo_offset
12685 && types_same_for_odr (TREE_TYPE (base_binfo
), TREE_TYPE (fld
)))
12687 found_binfo
= base_binfo
;
12691 binfo
= found_binfo
;
12693 binfo
= lookup_binfo_at_offset (binfo
, TREE_TYPE (fld
),
12697 type
= TREE_TYPE (fld
);
12702 /* Returns true if X is a typedef decl. */
12705 is_typedef_decl (const_tree x
)
12707 return (x
&& TREE_CODE (x
) == TYPE_DECL
12708 && DECL_ORIGINAL_TYPE (x
) != NULL_TREE
);
12711 /* Returns true iff TYPE is a type variant created for a typedef. */
12714 typedef_variant_p (const_tree type
)
12716 return is_typedef_decl (TYPE_NAME (type
));
12719 /* Warn about a use of an identifier which was marked deprecated. */
12721 warn_deprecated_use (tree node
, tree attr
)
12725 if (node
== 0 || !warn_deprecated_decl
)
12731 attr
= DECL_ATTRIBUTES (node
);
12732 else if (TYPE_P (node
))
12734 tree decl
= TYPE_STUB_DECL (node
);
12736 attr
= lookup_attribute ("deprecated",
12737 TYPE_ATTRIBUTES (TREE_TYPE (decl
)));
12742 attr
= lookup_attribute ("deprecated", attr
);
12745 msg
= TREE_STRING_POINTER (TREE_VALUE (TREE_VALUE (attr
)));
12753 w
= warning (OPT_Wdeprecated_declarations
,
12754 "%qD is deprecated: %s", node
, msg
);
12756 w
= warning (OPT_Wdeprecated_declarations
,
12757 "%qD is deprecated", node
);
12759 inform (DECL_SOURCE_LOCATION (node
), "declared here");
12761 else if (TYPE_P (node
))
12763 tree what
= NULL_TREE
;
12764 tree decl
= TYPE_STUB_DECL (node
);
12766 if (TYPE_NAME (node
))
12768 if (TREE_CODE (TYPE_NAME (node
)) == IDENTIFIER_NODE
)
12769 what
= TYPE_NAME (node
);
12770 else if (TREE_CODE (TYPE_NAME (node
)) == TYPE_DECL
12771 && DECL_NAME (TYPE_NAME (node
)))
12772 what
= DECL_NAME (TYPE_NAME (node
));
12780 w
= warning (OPT_Wdeprecated_declarations
,
12781 "%qE is deprecated: %s", what
, msg
);
12783 w
= warning (OPT_Wdeprecated_declarations
,
12784 "%qE is deprecated", what
);
12789 w
= warning (OPT_Wdeprecated_declarations
,
12790 "type is deprecated: %s", msg
);
12792 w
= warning (OPT_Wdeprecated_declarations
,
12793 "type is deprecated");
12796 inform (DECL_SOURCE_LOCATION (decl
), "declared here");
12803 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated: %s",
12806 warning (OPT_Wdeprecated_declarations
, "%qE is deprecated", what
);
12811 warning (OPT_Wdeprecated_declarations
, "type is deprecated: %s",
12814 warning (OPT_Wdeprecated_declarations
, "type is deprecated");
12820 /* Return true if REF has a COMPONENT_REF with a bit-field field declaration
12821 somewhere in it. */
12824 contains_bitfld_component_ref_p (const_tree ref
)
12826 while (handled_component_p (ref
))
12828 if (TREE_CODE (ref
) == COMPONENT_REF
12829 && DECL_BIT_FIELD (TREE_OPERAND (ref
, 1)))
12831 ref
= TREE_OPERAND (ref
, 0);
12837 /* Try to determine whether a TRY_CATCH expression can fall through.
12838 This is a subroutine of block_may_fallthru. */
12841 try_catch_may_fallthru (const_tree stmt
)
12843 tree_stmt_iterator i
;
12845 /* If the TRY block can fall through, the whole TRY_CATCH can
12847 if (block_may_fallthru (TREE_OPERAND (stmt
, 0)))
12850 i
= tsi_start (TREE_OPERAND (stmt
, 1));
12851 switch (TREE_CODE (tsi_stmt (i
)))
12854 /* We expect to see a sequence of CATCH_EXPR trees, each with a
12855 catch expression and a body. The whole TRY_CATCH may fall
12856 through iff any of the catch bodies falls through. */
12857 for (; !tsi_end_p (i
); tsi_next (&i
))
12859 if (block_may_fallthru (CATCH_BODY (tsi_stmt (i
))))
12864 case EH_FILTER_EXPR
:
12865 /* The exception filter expression only matters if there is an
12866 exception. If the exception does not match EH_FILTER_TYPES,
12867 we will execute EH_FILTER_FAILURE, and we will fall through
12868 if that falls through. If the exception does match
12869 EH_FILTER_TYPES, the stack unwinder will continue up the
12870 stack, so we will not fall through. We don't know whether we
12871 will throw an exception which matches EH_FILTER_TYPES or not,
12872 so we just ignore EH_FILTER_TYPES and assume that we might
12873 throw an exception which doesn't match. */
12874 return block_may_fallthru (EH_FILTER_FAILURE (tsi_stmt (i
)));
12877 /* This case represents statements to be executed when an
12878 exception occurs. Those statements are implicitly followed
12879 by a RESX statement to resume execution after the exception.
12880 So in this case the TRY_CATCH never falls through. */
12885 /* Try to determine if we can fall out of the bottom of BLOCK. This guess
12886 need not be 100% accurate; simply be conservative and return true if we
12887 don't know. This is used only to avoid stupidly generating extra code.
12888 If we're wrong, we'll just delete the extra code later. */
12891 block_may_fallthru (const_tree block
)
12893 /* This CONST_CAST is okay because expr_last returns its argument
12894 unmodified and we assign it to a const_tree. */
12895 const_tree stmt
= expr_last (CONST_CAST_TREE (block
));
12897 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
12901 /* Easy cases. If the last statement of the block implies
12902 control transfer, then we can't fall through. */
12906 /* If SWITCH_LABELS is set, this is lowered, and represents a
12907 branch to a selected label and hence can not fall through.
12908 Otherwise SWITCH_BODY is set, and the switch can fall
12910 return SWITCH_LABELS (stmt
) == NULL_TREE
;
12913 if (block_may_fallthru (COND_EXPR_THEN (stmt
)))
12915 return block_may_fallthru (COND_EXPR_ELSE (stmt
));
12918 return block_may_fallthru (BIND_EXPR_BODY (stmt
));
12920 case TRY_CATCH_EXPR
:
12921 return try_catch_may_fallthru (stmt
);
12923 case TRY_FINALLY_EXPR
:
12924 /* The finally clause is always executed after the try clause,
12925 so if it does not fall through, then the try-finally will not
12926 fall through. Otherwise, if the try clause does not fall
12927 through, then when the finally clause falls through it will
12928 resume execution wherever the try clause was going. So the
12929 whole try-finally will only fall through if both the try
12930 clause and the finally clause fall through. */
12931 return (block_may_fallthru (TREE_OPERAND (stmt
, 0))
12932 && block_may_fallthru (TREE_OPERAND (stmt
, 1)));
12935 if (TREE_CODE (TREE_OPERAND (stmt
, 1)) == CALL_EXPR
)
12936 stmt
= TREE_OPERAND (stmt
, 1);
12942 /* Functions that do not return do not fall through. */
12943 return (call_expr_flags (stmt
) & ECF_NORETURN
) == 0;
12945 case CLEANUP_POINT_EXPR
:
12946 return block_may_fallthru (TREE_OPERAND (stmt
, 0));
12949 return block_may_fallthru (TREE_OPERAND (stmt
, 1));
12955 return lang_hooks
.block_may_fallthru (stmt
);
12959 /* True if we are using EH to handle cleanups. */
12960 static bool using_eh_for_cleanups_flag
= false;
12962 /* This routine is called from front ends to indicate eh should be used for
12965 using_eh_for_cleanups (void)
12967 using_eh_for_cleanups_flag
= true;
12970 /* Query whether EH is used for cleanups. */
12972 using_eh_for_cleanups_p (void)
12974 return using_eh_for_cleanups_flag
;
12977 /* Wrapper for tree_code_name to ensure that tree code is valid */
12979 get_tree_code_name (enum tree_code code
)
12981 const char *invalid
= "<invalid tree code>";
12983 if (code
>= MAX_TREE_CODES
)
12986 return tree_code_name
[code
];
12989 /* Drops the TREE_OVERFLOW flag from T. */
12992 drop_tree_overflow (tree t
)
12994 gcc_checking_assert (TREE_OVERFLOW (t
));
12996 /* For tree codes with a sharing machinery re-build the result. */
12997 if (TREE_CODE (t
) == INTEGER_CST
)
12998 return wide_int_to_tree (TREE_TYPE (t
), t
);
13000 /* Otherwise, as all tcc_constants are possibly shared, copy the node
13001 and drop the flag. */
13003 TREE_OVERFLOW (t
) = 0;
13007 /* Given a memory reference expression T, return its base address.
13008 The base address of a memory reference expression is the main
13009 object being referenced. For instance, the base address for
13010 'array[i].fld[j]' is 'array'. You can think of this as stripping
13011 away the offset part from a memory address.
13013 This function calls handled_component_p to strip away all the inner
13014 parts of the memory reference until it reaches the base object. */
13017 get_base_address (tree t
)
13019 while (handled_component_p (t
))
13020 t
= TREE_OPERAND (t
, 0);
13022 if ((TREE_CODE (t
) == MEM_REF
13023 || TREE_CODE (t
) == TARGET_MEM_REF
)
13024 && TREE_CODE (TREE_OPERAND (t
, 0)) == ADDR_EXPR
)
13025 t
= TREE_OPERAND (TREE_OPERAND (t
, 0), 0);
13027 /* ??? Either the alias oracle or all callers need to properly deal
13028 with WITH_SIZE_EXPRs before we can look through those. */
13029 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
13035 /* Return a tree of sizetype representing the size, in bytes, of the element
13036 of EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13039 array_ref_element_size (tree exp
)
13041 tree aligned_size
= TREE_OPERAND (exp
, 3);
13042 tree elmt_type
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13043 location_t loc
= EXPR_LOCATION (exp
);
13045 /* If a size was specified in the ARRAY_REF, it's the size measured
13046 in alignment units of the element type. So multiply by that value. */
13049 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13050 sizetype from another type of the same width and signedness. */
13051 if (TREE_TYPE (aligned_size
) != sizetype
)
13052 aligned_size
= fold_convert_loc (loc
, sizetype
, aligned_size
);
13053 return size_binop_loc (loc
, MULT_EXPR
, aligned_size
,
13054 size_int (TYPE_ALIGN_UNIT (elmt_type
)));
13057 /* Otherwise, take the size from that of the element type. Substitute
13058 any PLACEHOLDER_EXPR that we have. */
13060 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_SIZE_UNIT (elmt_type
), exp
);
13063 /* Return a tree representing the lower bound of the array mentioned in
13064 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13067 array_ref_low_bound (tree exp
)
13069 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13071 /* If a lower bound is specified in EXP, use it. */
13072 if (TREE_OPERAND (exp
, 2))
13073 return TREE_OPERAND (exp
, 2);
13075 /* Otherwise, if there is a domain type and it has a lower bound, use it,
13076 substituting for a PLACEHOLDER_EXPR as needed. */
13077 if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
13078 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MIN_VALUE (domain_type
), exp
);
13080 /* Otherwise, return a zero of the appropriate type. */
13081 return build_int_cst (TREE_TYPE (TREE_OPERAND (exp
, 1)), 0);
13084 /* Return a tree representing the upper bound of the array mentioned in
13085 EXP, an ARRAY_REF or an ARRAY_RANGE_REF. */
13088 array_ref_up_bound (tree exp
)
13090 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (exp
, 0)));
13092 /* If there is a domain type and it has an upper bound, use it, substituting
13093 for a PLACEHOLDER_EXPR as needed. */
13094 if (domain_type
&& TYPE_MAX_VALUE (domain_type
))
13095 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (TYPE_MAX_VALUE (domain_type
), exp
);
13097 /* Otherwise fail. */
13101 /* Returns true if REF is an array reference to an array at the end of
13102 a structure. If this is the case, the array may be allocated larger
13103 than its upper bound implies. */
13106 array_at_struct_end_p (tree ref
)
13108 if (TREE_CODE (ref
) != ARRAY_REF
13109 && TREE_CODE (ref
) != ARRAY_RANGE_REF
)
13112 while (handled_component_p (ref
))
13114 /* If the reference chain contains a component reference to a
13115 non-union type and there follows another field the reference
13116 is not at the end of a structure. */
13117 if (TREE_CODE (ref
) == COMPONENT_REF
13118 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 0))) == RECORD_TYPE
)
13120 tree nextf
= DECL_CHAIN (TREE_OPERAND (ref
, 1));
13121 while (nextf
&& TREE_CODE (nextf
) != FIELD_DECL
)
13122 nextf
= DECL_CHAIN (nextf
);
13127 ref
= TREE_OPERAND (ref
, 0);
13132 if (TREE_CODE (ref
) == MEM_REF
13133 && TREE_CODE (TREE_OPERAND (ref
, 0)) == ADDR_EXPR
)
13135 size
= TYPE_SIZE (TREE_TYPE (ref
));
13136 ref
= TREE_OPERAND (TREE_OPERAND (ref
, 0), 0);
13139 /* If the reference is based on a declared entity, the size of the array
13140 is constrained by its given domain. (Do not trust commons PR/69368). */
13142 /* Be sure the size of MEM_REF target match. For example:
13145 struct foo *str = (struct foo *)&buf;
13147 str->trailin_array[2] = 1;
13149 is valid because BUF allocate enough space. */
13151 && (!size
|| (DECL_SIZE (ref
) != NULL
13152 && operand_equal_p (DECL_SIZE (ref
), size
, 0)))
13153 && !(flag_unconstrained_commons
13154 && VAR_P (ref
) && DECL_COMMON (ref
)))
13160 /* Return a tree representing the offset, in bytes, of the field referenced
13161 by EXP. This does not include any offset in DECL_FIELD_BIT_OFFSET. */
13164 component_ref_field_offset (tree exp
)
13166 tree aligned_offset
= TREE_OPERAND (exp
, 2);
13167 tree field
= TREE_OPERAND (exp
, 1);
13168 location_t loc
= EXPR_LOCATION (exp
);
13170 /* If an offset was specified in the COMPONENT_REF, it's the offset measured
13171 in units of DECL_OFFSET_ALIGN / BITS_PER_UNIT. So multiply by that
13173 if (aligned_offset
)
13175 /* ??? tree_ssa_useless_type_conversion will eliminate casts to
13176 sizetype from another type of the same width and signedness. */
13177 if (TREE_TYPE (aligned_offset
) != sizetype
)
13178 aligned_offset
= fold_convert_loc (loc
, sizetype
, aligned_offset
);
13179 return size_binop_loc (loc
, MULT_EXPR
, aligned_offset
,
13180 size_int (DECL_OFFSET_ALIGN (field
)
13184 /* Otherwise, take the offset from that of the field. Substitute
13185 any PLACEHOLDER_EXPR that we have. */
13187 return SUBSTITUTE_PLACEHOLDER_IN_EXPR (DECL_FIELD_OFFSET (field
), exp
);
13190 /* Return the machine mode of T. For vectors, returns the mode of the
13191 inner type. The main use case is to feed the result to HONOR_NANS,
13192 avoiding the BLKmode that a direct TYPE_MODE (T) might return. */
13195 element_mode (const_tree t
)
13199 if (VECTOR_TYPE_P (t
) || TREE_CODE (t
) == COMPLEX_TYPE
)
13201 return TYPE_MODE (t
);
13205 /* Veirfy that basic properties of T match TV and thus T can be a variant of
13206 TV. TV should be the more specified variant (i.e. the main variant). */
13209 verify_type_variant (const_tree t
, tree tv
)
13211 /* Type variant can differ by:
13213 - TYPE_QUALS: TYPE_READONLY, TYPE_VOLATILE, TYPE_ATOMIC, TYPE_RESTRICT,
13214 ENCODE_QUAL_ADDR_SPACE.
13215 - main variant may be TYPE_COMPLETE_P and variant types !TYPE_COMPLETE_P
13216 in this case some values may not be set in the variant types
13217 (see TYPE_COMPLETE_P checks).
13218 - it is possible to have TYPE_ARTIFICIAL variant of non-artifical type
13219 - by TYPE_NAME and attributes (i.e. when variant originate by typedef)
13220 - TYPE_CANONICAL (TYPE_ALIAS_SET is the same among variants)
13221 - by the alignment: TYPE_ALIGN and TYPE_USER_ALIGN
13222 - during LTO by TYPE_CONTEXT if type is TYPE_FILE_SCOPE_P
13223 this is necessary to make it possible to merge types form different TUs
13224 - arrays, pointers and references may have TREE_TYPE that is a variant
13225 of TREE_TYPE of their main variants.
13226 - aggregates may have new TYPE_FIELDS list that list variants of
13227 the main variant TYPE_FIELDS.
13228 - vector types may differ by TYPE_VECTOR_OPAQUE
13229 - TYPE_METHODS is always NULL for vairant types and maintained for
13233 /* Convenience macro for matching individual fields. */
13234 #define verify_variant_match(flag) \
13236 if (flag (tv) != flag (t)) \
13238 error ("type variant differs by " #flag "."); \
13244 /* tree_base checks. */
13246 verify_variant_match (TREE_CODE
);
13247 /* FIXME: Ada builds non-artificial variants of artificial types. */
13248 if (TYPE_ARTIFICIAL (tv
) && 0)
13249 verify_variant_match (TYPE_ARTIFICIAL
);
13250 if (POINTER_TYPE_P (tv
))
13251 verify_variant_match (TYPE_REF_CAN_ALIAS_ALL
);
13252 /* FIXME: TYPE_SIZES_GIMPLIFIED may differs for Ada build. */
13253 verify_variant_match (TYPE_UNSIGNED
);
13254 verify_variant_match (TYPE_PACKED
);
13255 if (TREE_CODE (t
) == REFERENCE_TYPE
)
13256 verify_variant_match (TYPE_REF_IS_RVALUE
);
13257 if (AGGREGATE_TYPE_P (t
))
13258 verify_variant_match (TYPE_REVERSE_STORAGE_ORDER
);
13260 verify_variant_match (TYPE_SATURATING
);
13261 /* FIXME: This check trigger during libstdc++ build. */
13262 if (RECORD_OR_UNION_TYPE_P (t
) && COMPLETE_TYPE_P (t
) && 0)
13263 verify_variant_match (TYPE_FINAL_P
);
13265 /* tree_type_common checks. */
13267 if (COMPLETE_TYPE_P (t
))
13269 verify_variant_match (TYPE_MODE
);
13270 if (TREE_CODE (TYPE_SIZE (t
)) != PLACEHOLDER_EXPR
13271 && TREE_CODE (TYPE_SIZE (tv
)) != PLACEHOLDER_EXPR
)
13272 verify_variant_match (TYPE_SIZE
);
13273 if (TREE_CODE (TYPE_SIZE_UNIT (t
)) != PLACEHOLDER_EXPR
13274 && TREE_CODE (TYPE_SIZE_UNIT (tv
)) != PLACEHOLDER_EXPR
13275 && TYPE_SIZE_UNIT (t
) != TYPE_SIZE_UNIT (tv
)
13276 /* FIXME: ideally we should compare pointer equality, but java FE
13277 produce variants where size is INTEGER_CST of different type (int
13278 wrt size_type) during libjava biuld. */
13279 && !operand_equal_p (TYPE_SIZE_UNIT (t
), TYPE_SIZE_UNIT (tv
), 0))
13281 error ("type variant has different TYPE_SIZE_UNIT");
13283 error ("type variant's TYPE_SIZE_UNIT");
13284 debug_tree (TYPE_SIZE_UNIT (tv
));
13285 error ("type's TYPE_SIZE_UNIT");
13286 debug_tree (TYPE_SIZE_UNIT (t
));
13290 verify_variant_match (TYPE_PRECISION
);
13291 verify_variant_match (TYPE_NEEDS_CONSTRUCTING
);
13292 if (RECORD_OR_UNION_TYPE_P (t
))
13293 verify_variant_match (TYPE_TRANSPARENT_AGGR
);
13294 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13295 verify_variant_match (TYPE_NONALIASED_COMPONENT
);
13296 /* During LTO we merge variant lists from diferent translation units
13297 that may differ BY TYPE_CONTEXT that in turn may point
13298 to TRANSLATION_UNIT_DECL.
13299 Ada also builds variants of types with different TYPE_CONTEXT. */
13300 if ((!in_lto_p
|| !TYPE_FILE_SCOPE_P (t
)) && 0)
13301 verify_variant_match (TYPE_CONTEXT
);
13302 verify_variant_match (TYPE_STRING_FLAG
);
13303 if (TYPE_ALIAS_SET_KNOWN_P (t
))
13305 error ("type variant with TYPE_ALIAS_SET_KNOWN_P");
13310 /* tree_type_non_common checks. */
13312 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13313 and dangle the pointer from time to time. */
13314 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_VFIELD (t
) != TYPE_VFIELD (tv
)
13315 && (in_lto_p
|| !TYPE_VFIELD (tv
)
13316 || TREE_CODE (TYPE_VFIELD (tv
)) != TREE_LIST
))
13318 error ("type variant has different TYPE_VFIELD");
13322 if ((TREE_CODE (t
) == ENUMERAL_TYPE
&& COMPLETE_TYPE_P (t
))
13323 || TREE_CODE (t
) == INTEGER_TYPE
13324 || TREE_CODE (t
) == BOOLEAN_TYPE
13325 || TREE_CODE (t
) == REAL_TYPE
13326 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13328 verify_variant_match (TYPE_MAX_VALUE
);
13329 verify_variant_match (TYPE_MIN_VALUE
);
13331 if (TREE_CODE (t
) == METHOD_TYPE
)
13332 verify_variant_match (TYPE_METHOD_BASETYPE
);
13333 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_METHODS (t
))
13335 error ("type variant has TYPE_METHODS");
13339 if (TREE_CODE (t
) == OFFSET_TYPE
)
13340 verify_variant_match (TYPE_OFFSET_BASETYPE
);
13341 if (TREE_CODE (t
) == ARRAY_TYPE
)
13342 verify_variant_match (TYPE_ARRAY_MAX_SIZE
);
13343 /* FIXME: Be lax and allow TYPE_BINFO to be missing in variant types
13344 or even type's main variant. This is needed to make bootstrap pass
13345 and the bug seems new in GCC 5.
13346 C++ FE should be updated to make this consistent and we should check
13347 that TYPE_BINFO is always NULL for !COMPLETE_TYPE_P and otherwise there
13348 is a match with main variant.
13350 Also disable the check for Java for now because of parser hack that builds
13351 first an dummy BINFO and then sometimes replace it by real BINFO in some
13353 if (RECORD_OR_UNION_TYPE_P (t
) && TYPE_BINFO (t
) && TYPE_BINFO (tv
)
13354 && TYPE_BINFO (t
) != TYPE_BINFO (tv
)
13355 /* FIXME: Java sometimes keep dump TYPE_BINFOs on variant types.
13356 Since there is no cheap way to tell C++/Java type w/o LTO, do checking
13357 at LTO time only. */
13358 && (in_lto_p
&& odr_type_p (t
)))
13360 error ("type variant has different TYPE_BINFO");
13362 error ("type variant's TYPE_BINFO");
13363 debug_tree (TYPE_BINFO (tv
));
13364 error ("type's TYPE_BINFO");
13365 debug_tree (TYPE_BINFO (t
));
13369 /* Check various uses of TYPE_VALUES_RAW. */
13370 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13371 verify_variant_match (TYPE_VALUES
);
13372 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13373 verify_variant_match (TYPE_DOMAIN
);
13374 /* Permit incomplete variants of complete type. While FEs may complete
13375 all variants, this does not happen for C++ templates in all cases. */
13376 else if (RECORD_OR_UNION_TYPE_P (t
)
13377 && COMPLETE_TYPE_P (t
)
13378 && TYPE_FIELDS (t
) != TYPE_FIELDS (tv
))
13382 /* Fortran builds qualified variants as new records with items of
13383 qualified type. Verify that they looks same. */
13384 for (f1
= TYPE_FIELDS (t
), f2
= TYPE_FIELDS (tv
);
13386 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13387 if (TREE_CODE (f1
) != FIELD_DECL
|| TREE_CODE (f2
) != FIELD_DECL
13388 || (TYPE_MAIN_VARIANT (TREE_TYPE (f1
))
13389 != TYPE_MAIN_VARIANT (TREE_TYPE (f2
))
13390 /* FIXME: gfc_nonrestricted_type builds all types as variants
13391 with exception of pointer types. It deeply copies the type
13392 which means that we may end up with a variant type
13393 referring non-variant pointer. We may change it to
13394 produce types as variants, too, like
13395 objc_get_protocol_qualified_type does. */
13396 && !POINTER_TYPE_P (TREE_TYPE (f1
)))
13397 || DECL_FIELD_OFFSET (f1
) != DECL_FIELD_OFFSET (f2
)
13398 || DECL_FIELD_BIT_OFFSET (f1
) != DECL_FIELD_BIT_OFFSET (f2
))
13402 error ("type variant has different TYPE_FIELDS");
13404 error ("first mismatch is field");
13406 error ("and field");
13411 else if ((TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
))
13412 verify_variant_match (TYPE_ARG_TYPES
);
13413 /* For C++ the qualified variant of array type is really an array type
13414 of qualified TREE_TYPE.
13415 objc builds variants of pointer where pointer to type is a variant, too
13416 in objc_get_protocol_qualified_type. */
13417 if (TREE_TYPE (t
) != TREE_TYPE (tv
)
13418 && ((TREE_CODE (t
) != ARRAY_TYPE
13419 && !POINTER_TYPE_P (t
))
13420 || TYPE_MAIN_VARIANT (TREE_TYPE (t
))
13421 != TYPE_MAIN_VARIANT (TREE_TYPE (tv
))))
13423 error ("type variant has different TREE_TYPE");
13425 error ("type variant's TREE_TYPE");
13426 debug_tree (TREE_TYPE (tv
));
13427 error ("type's TREE_TYPE");
13428 debug_tree (TREE_TYPE (t
));
13431 if (type_with_alias_set_p (t
)
13432 && !gimple_canonical_types_compatible_p (t
, tv
, false))
13434 error ("type is not compatible with its vairant");
13436 error ("type variant's TREE_TYPE");
13437 debug_tree (TREE_TYPE (tv
));
13438 error ("type's TREE_TYPE");
13439 debug_tree (TREE_TYPE (t
));
13443 #undef verify_variant_match
13447 /* The TYPE_CANONICAL merging machinery. It should closely resemble
13448 the middle-end types_compatible_p function. It needs to avoid
13449 claiming types are different for types that should be treated
13450 the same with respect to TBAA. Canonical types are also used
13451 for IL consistency checks via the useless_type_conversion_p
13452 predicate which does not handle all type kinds itself but falls
13453 back to pointer-comparison of TYPE_CANONICAL for aggregates
13456 /* Return true if TYPE_UNSIGNED of TYPE should be ignored for canonical
13457 type calculation because we need to allow inter-operability between signed
13458 and unsigned variants. */
13461 type_with_interoperable_signedness (const_tree type
)
13463 /* Fortran standard require C_SIGNED_CHAR to be interoperable with both
13464 signed char and unsigned char. Similarly fortran FE builds
13465 C_SIZE_T as signed type, while C defines it unsigned. */
13467 return tree_code_for_canonical_type_merging (TREE_CODE (type
))
13469 && (TYPE_PRECISION (type
) == TYPE_PRECISION (signed_char_type_node
)
13470 || TYPE_PRECISION (type
) == TYPE_PRECISION (size_type_node
));
13473 /* Return true iff T1 and T2 are structurally identical for what
13475 This function is used both by lto.c canonical type merging and by the
13476 verifier. If TRUST_TYPE_CANONICAL we do not look into structure of types
13477 that have TYPE_CANONICAL defined and assume them equivalent. This is useful
13478 only for LTO because only in these cases TYPE_CANONICAL equivalence
13479 correspond to one defined by gimple_canonical_types_compatible_p. */
13482 gimple_canonical_types_compatible_p (const_tree t1
, const_tree t2
,
13483 bool trust_type_canonical
)
13485 /* Type variants should be same as the main variant. When not doing sanity
13486 checking to verify this fact, go to main variants and save some work. */
13487 if (trust_type_canonical
)
13489 t1
= TYPE_MAIN_VARIANT (t1
);
13490 t2
= TYPE_MAIN_VARIANT (t2
);
13493 /* Check first for the obvious case of pointer identity. */
13497 /* Check that we have two types to compare. */
13498 if (t1
== NULL_TREE
|| t2
== NULL_TREE
)
13501 /* We consider complete types always compatible with incomplete type.
13502 This does not make sense for canonical type calculation and thus we
13503 need to ensure that we are never called on it.
13505 FIXME: For more correctness the function probably should have three modes
13506 1) mode assuming that types are complete mathcing their structure
13507 2) mode allowing incomplete types but producing equivalence classes
13508 and thus ignoring all info from complete types
13509 3) mode allowing incomplete types to match complete but checking
13510 compatibility between complete types.
13512 1 and 2 can be used for canonical type calculation. 3 is the real
13513 definition of type compatibility that can be used i.e. for warnings during
13514 declaration merging. */
13516 gcc_assert (!trust_type_canonical
13517 || (type_with_alias_set_p (t1
) && type_with_alias_set_p (t2
)));
13518 /* If the types have been previously registered and found equal
13521 if (TYPE_CANONICAL (t1
) && TYPE_CANONICAL (t2
)
13522 && trust_type_canonical
)
13524 /* Do not use TYPE_CANONICAL of pointer types. For LTO streamed types
13525 they are always NULL, but they are set to non-NULL for types
13526 constructed by build_pointer_type and variants. In this case the
13527 TYPE_CANONICAL is more fine grained than the equivalnce we test (where
13528 all pointers are considered equal. Be sure to not return false
13530 gcc_checking_assert (canonical_type_used_p (t1
)
13531 && canonical_type_used_p (t2
));
13532 return TYPE_CANONICAL (t1
) == TYPE_CANONICAL (t2
);
13535 /* Can't be the same type if the types don't have the same code. */
13536 enum tree_code code
= tree_code_for_canonical_type_merging (TREE_CODE (t1
));
13537 if (code
!= tree_code_for_canonical_type_merging (TREE_CODE (t2
)))
13540 /* Qualifiers do not matter for canonical type comparison purposes. */
13542 /* Void types and nullptr types are always the same. */
13543 if (TREE_CODE (t1
) == VOID_TYPE
13544 || TREE_CODE (t1
) == NULLPTR_TYPE
)
13547 /* Can't be the same type if they have different mode. */
13548 if (TYPE_MODE (t1
) != TYPE_MODE (t2
))
13551 /* Non-aggregate types can be handled cheaply. */
13552 if (INTEGRAL_TYPE_P (t1
)
13553 || SCALAR_FLOAT_TYPE_P (t1
)
13554 || FIXED_POINT_TYPE_P (t1
)
13555 || TREE_CODE (t1
) == VECTOR_TYPE
13556 || TREE_CODE (t1
) == COMPLEX_TYPE
13557 || TREE_CODE (t1
) == OFFSET_TYPE
13558 || POINTER_TYPE_P (t1
))
13560 /* Can't be the same type if they have different recision. */
13561 if (TYPE_PRECISION (t1
) != TYPE_PRECISION (t2
))
13564 /* In some cases the signed and unsigned types are required to be
13566 if (TYPE_UNSIGNED (t1
) != TYPE_UNSIGNED (t2
)
13567 && !type_with_interoperable_signedness (t1
))
13570 /* Fortran's C_SIGNED_CHAR is !TYPE_STRING_FLAG but needs to be
13571 interoperable with "signed char". Unless all frontends are revisited
13572 to agree on these types, we must ignore the flag completely. */
13574 /* Fortran standard define C_PTR type that is compatible with every
13575 C pointer. For this reason we need to glob all pointers into one.
13576 Still pointers in different address spaces are not compatible. */
13577 if (POINTER_TYPE_P (t1
))
13579 if (TYPE_ADDR_SPACE (TREE_TYPE (t1
))
13580 != TYPE_ADDR_SPACE (TREE_TYPE (t2
)))
13584 /* Tail-recurse to components. */
13585 if (TREE_CODE (t1
) == VECTOR_TYPE
13586 || TREE_CODE (t1
) == COMPLEX_TYPE
)
13587 return gimple_canonical_types_compatible_p (TREE_TYPE (t1
),
13589 trust_type_canonical
);
13594 /* Do type-specific comparisons. */
13595 switch (TREE_CODE (t1
))
13598 /* Array types are the same if the element types are the same and
13599 the number of elements are the same. */
13600 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13601 trust_type_canonical
)
13602 || TYPE_STRING_FLAG (t1
) != TYPE_STRING_FLAG (t2
)
13603 || TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
)
13604 || TYPE_NONALIASED_COMPONENT (t1
) != TYPE_NONALIASED_COMPONENT (t2
))
13608 tree i1
= TYPE_DOMAIN (t1
);
13609 tree i2
= TYPE_DOMAIN (t2
);
13611 /* For an incomplete external array, the type domain can be
13612 NULL_TREE. Check this condition also. */
13613 if (i1
== NULL_TREE
&& i2
== NULL_TREE
)
13615 else if (i1
== NULL_TREE
|| i2
== NULL_TREE
)
13619 tree min1
= TYPE_MIN_VALUE (i1
);
13620 tree min2
= TYPE_MIN_VALUE (i2
);
13621 tree max1
= TYPE_MAX_VALUE (i1
);
13622 tree max2
= TYPE_MAX_VALUE (i2
);
13624 /* The minimum/maximum values have to be the same. */
13627 && ((TREE_CODE (min1
) == PLACEHOLDER_EXPR
13628 && TREE_CODE (min2
) == PLACEHOLDER_EXPR
)
13629 || operand_equal_p (min1
, min2
, 0))))
13632 && ((TREE_CODE (max1
) == PLACEHOLDER_EXPR
13633 && TREE_CODE (max2
) == PLACEHOLDER_EXPR
)
13634 || operand_equal_p (max1
, max2
, 0)))))
13642 case FUNCTION_TYPE
:
13643 /* Function types are the same if the return type and arguments types
13645 if (!gimple_canonical_types_compatible_p (TREE_TYPE (t1
), TREE_TYPE (t2
),
13646 trust_type_canonical
))
13649 if (TYPE_ARG_TYPES (t1
) == TYPE_ARG_TYPES (t2
))
13653 tree parms1
, parms2
;
13655 for (parms1
= TYPE_ARG_TYPES (t1
), parms2
= TYPE_ARG_TYPES (t2
);
13657 parms1
= TREE_CHAIN (parms1
), parms2
= TREE_CHAIN (parms2
))
13659 if (!gimple_canonical_types_compatible_p
13660 (TREE_VALUE (parms1
), TREE_VALUE (parms2
),
13661 trust_type_canonical
))
13665 if (parms1
|| parms2
)
13673 case QUAL_UNION_TYPE
:
13677 /* Don't try to compare variants of an incomplete type, before
13678 TYPE_FIELDS has been copied around. */
13679 if (!COMPLETE_TYPE_P (t1
) && !COMPLETE_TYPE_P (t2
))
13683 if (TYPE_REVERSE_STORAGE_ORDER (t1
) != TYPE_REVERSE_STORAGE_ORDER (t2
))
13686 /* For aggregate types, all the fields must be the same. */
13687 for (f1
= TYPE_FIELDS (t1
), f2
= TYPE_FIELDS (t2
);
13689 f1
= TREE_CHAIN (f1
), f2
= TREE_CHAIN (f2
))
13691 /* Skip non-fields. */
13692 while (f1
&& TREE_CODE (f1
) != FIELD_DECL
)
13693 f1
= TREE_CHAIN (f1
);
13694 while (f2
&& TREE_CODE (f2
) != FIELD_DECL
)
13695 f2
= TREE_CHAIN (f2
);
13698 /* The fields must have the same name, offset and type. */
13699 if (DECL_NONADDRESSABLE_P (f1
) != DECL_NONADDRESSABLE_P (f2
)
13700 || !gimple_compare_field_offset (f1
, f2
)
13701 || !gimple_canonical_types_compatible_p
13702 (TREE_TYPE (f1
), TREE_TYPE (f2
),
13703 trust_type_canonical
))
13707 /* If one aggregate has more fields than the other, they
13708 are not the same. */
13716 /* Consider all types with language specific trees in them mutually
13717 compatible. This is executed only from verify_type and false
13718 positives can be tolerated. */
13719 gcc_assert (!in_lto_p
);
13724 /* Verify type T. */
13727 verify_type (const_tree t
)
13729 bool error_found
= false;
13730 tree mv
= TYPE_MAIN_VARIANT (t
);
13733 error ("Main variant is not defined");
13734 error_found
= true;
13736 else if (mv
!= TYPE_MAIN_VARIANT (mv
))
13738 error ("TYPE_MAIN_VARIANT has different TYPE_MAIN_VARIANT");
13740 error_found
= true;
13742 else if (t
!= mv
&& !verify_type_variant (t
, mv
))
13743 error_found
= true;
13745 tree ct
= TYPE_CANONICAL (t
);
13748 else if (TYPE_CANONICAL (t
) != ct
)
13750 error ("TYPE_CANONICAL has different TYPE_CANONICAL");
13752 error_found
= true;
13754 /* Method and function types can not be used to address memory and thus
13755 TYPE_CANONICAL really matters only for determining useless conversions.
13757 FIXME: C++ FE produce declarations of builtin functions that are not
13758 compatible with main variants. */
13759 else if (TREE_CODE (t
) == FUNCTION_TYPE
)
13762 /* FIXME: gimple_canonical_types_compatible_p can not compare types
13763 with variably sized arrays because their sizes possibly
13764 gimplified to different variables. */
13765 && !variably_modified_type_p (ct
, NULL
)
13766 && !gimple_canonical_types_compatible_p (t
, ct
, false))
13768 error ("TYPE_CANONICAL is not compatible");
13770 error_found
= true;
13773 if (COMPLETE_TYPE_P (t
) && TYPE_CANONICAL (t
)
13774 && TYPE_MODE (t
) != TYPE_MODE (TYPE_CANONICAL (t
)))
13776 error ("TYPE_MODE of TYPE_CANONICAL is not compatible");
13778 error_found
= true;
13780 /* FIXME: this is violated by the C++ FE as discussed in PR70029, when
13781 FUNCTION_*_QUALIFIED flags are set. */
13782 if (0 && TYPE_MAIN_VARIANT (t
) == t
&& ct
&& TYPE_MAIN_VARIANT (ct
) != ct
)
13784 error ("TYPE_CANONICAL of main variant is not main variant");
13786 debug_tree (TYPE_MAIN_VARIANT (ct
));
13787 error_found
= true;
13791 /* Check various uses of TYPE_MINVAL. */
13792 if (RECORD_OR_UNION_TYPE_P (t
))
13794 /* FIXME: C FE uses TYPE_VFIELD to record C_TYPE_INCOMPLETE_VARS
13795 and danagle the pointer from time to time. */
13796 if (TYPE_VFIELD (t
)
13797 && TREE_CODE (TYPE_VFIELD (t
)) != FIELD_DECL
13798 && TREE_CODE (TYPE_VFIELD (t
)) != TREE_LIST
)
13800 error ("TYPE_VFIELD is not FIELD_DECL nor TREE_LIST");
13801 debug_tree (TYPE_VFIELD (t
));
13802 error_found
= true;
13805 else if (TREE_CODE (t
) == POINTER_TYPE
)
13807 if (TYPE_NEXT_PTR_TO (t
)
13808 && TREE_CODE (TYPE_NEXT_PTR_TO (t
)) != POINTER_TYPE
)
13810 error ("TYPE_NEXT_PTR_TO is not POINTER_TYPE");
13811 debug_tree (TYPE_NEXT_PTR_TO (t
));
13812 error_found
= true;
13815 else if (TREE_CODE (t
) == REFERENCE_TYPE
)
13817 if (TYPE_NEXT_REF_TO (t
)
13818 && TREE_CODE (TYPE_NEXT_REF_TO (t
)) != REFERENCE_TYPE
)
13820 error ("TYPE_NEXT_REF_TO is not REFERENCE_TYPE");
13821 debug_tree (TYPE_NEXT_REF_TO (t
));
13822 error_found
= true;
13825 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13826 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13828 /* FIXME: The following check should pass:
13829 useless_type_conversion_p (const_cast <tree> (t),
13830 TREE_TYPE (TYPE_MIN_VALUE (t))
13831 but does not for C sizetypes in LTO. */
13833 /* Java uses TYPE_MINVAL for TYPE_ARGUMENT_SIGNATURE. */
13834 else if (TYPE_MINVAL (t
)
13835 && ((TREE_CODE (t
) != METHOD_TYPE
&& TREE_CODE (t
) != FUNCTION_TYPE
)
13838 error ("TYPE_MINVAL non-NULL");
13839 debug_tree (TYPE_MINVAL (t
));
13840 error_found
= true;
13843 /* Check various uses of TYPE_MAXVAL. */
13844 if (RECORD_OR_UNION_TYPE_P (t
))
13846 if (TYPE_METHODS (t
) && TREE_CODE (TYPE_METHODS (t
)) != FUNCTION_DECL
13847 && TREE_CODE (TYPE_METHODS (t
)) != TEMPLATE_DECL
13848 && TYPE_METHODS (t
) != error_mark_node
)
13850 error ("TYPE_METHODS is not FUNCTION_DECL, TEMPLATE_DECL nor error_mark_node");
13851 debug_tree (TYPE_METHODS (t
));
13852 error_found
= true;
13855 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
13857 if (TYPE_METHOD_BASETYPE (t
)
13858 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != RECORD_TYPE
13859 && TREE_CODE (TYPE_METHOD_BASETYPE (t
)) != UNION_TYPE
)
13861 error ("TYPE_METHOD_BASETYPE is not record nor union");
13862 debug_tree (TYPE_METHOD_BASETYPE (t
));
13863 error_found
= true;
13866 else if (TREE_CODE (t
) == OFFSET_TYPE
)
13868 if (TYPE_OFFSET_BASETYPE (t
)
13869 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != RECORD_TYPE
13870 && TREE_CODE (TYPE_OFFSET_BASETYPE (t
)) != UNION_TYPE
)
13872 error ("TYPE_OFFSET_BASETYPE is not record nor union");
13873 debug_tree (TYPE_OFFSET_BASETYPE (t
));
13874 error_found
= true;
13877 else if (INTEGRAL_TYPE_P (t
) || TREE_CODE (t
) == REAL_TYPE
13878 || TREE_CODE (t
) == FIXED_POINT_TYPE
)
13880 /* FIXME: The following check should pass:
13881 useless_type_conversion_p (const_cast <tree> (t),
13882 TREE_TYPE (TYPE_MAX_VALUE (t))
13883 but does not for C sizetypes in LTO. */
13885 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13887 if (TYPE_ARRAY_MAX_SIZE (t
)
13888 && TREE_CODE (TYPE_ARRAY_MAX_SIZE (t
)) != INTEGER_CST
)
13890 error ("TYPE_ARRAY_MAX_SIZE not INTEGER_CST");
13891 debug_tree (TYPE_ARRAY_MAX_SIZE (t
));
13892 error_found
= true;
13895 else if (TYPE_MAXVAL (t
))
13897 error ("TYPE_MAXVAL non-NULL");
13898 debug_tree (TYPE_MAXVAL (t
));
13899 error_found
= true;
13902 /* Check various uses of TYPE_BINFO. */
13903 if (RECORD_OR_UNION_TYPE_P (t
))
13905 if (!TYPE_BINFO (t
))
13907 else if (TREE_CODE (TYPE_BINFO (t
)) != TREE_BINFO
)
13909 error ("TYPE_BINFO is not TREE_BINFO");
13910 debug_tree (TYPE_BINFO (t
));
13911 error_found
= true;
13913 /* FIXME: Java builds invalid empty binfos that do not have
13915 else if (TREE_TYPE (TYPE_BINFO (t
)) != TYPE_MAIN_VARIANT (t
) && 0)
13917 error ("TYPE_BINFO type is not TYPE_MAIN_VARIANT");
13918 debug_tree (TREE_TYPE (TYPE_BINFO (t
)));
13919 error_found
= true;
13922 else if (TYPE_LANG_SLOT_1 (t
) && in_lto_p
)
13924 error ("TYPE_LANG_SLOT_1 (binfo) field is non-NULL");
13925 debug_tree (TYPE_LANG_SLOT_1 (t
));
13926 error_found
= true;
13929 /* Check various uses of TYPE_VALUES_RAW. */
13930 if (TREE_CODE (t
) == ENUMERAL_TYPE
)
13931 for (tree l
= TYPE_VALUES (t
); l
; l
= TREE_CHAIN (l
))
13933 tree value
= TREE_VALUE (l
);
13934 tree name
= TREE_PURPOSE (l
);
13936 /* C FE porduce INTEGER_CST of INTEGER_TYPE, while C++ FE uses
13937 CONST_DECL of ENUMERAL TYPE. */
13938 if (TREE_CODE (value
) != INTEGER_CST
&& TREE_CODE (value
) != CONST_DECL
)
13940 error ("Enum value is not CONST_DECL or INTEGER_CST");
13941 debug_tree (value
);
13943 error_found
= true;
13945 if (TREE_CODE (TREE_TYPE (value
)) != INTEGER_TYPE
13946 && !useless_type_conversion_p (const_cast <tree
> (t
), TREE_TYPE (value
)))
13948 error ("Enum value type is not INTEGER_TYPE nor convertible to the enum");
13949 debug_tree (value
);
13951 error_found
= true;
13953 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
13955 error ("Enum value name is not IDENTIFIER_NODE");
13956 debug_tree (value
);
13958 error_found
= true;
13961 else if (TREE_CODE (t
) == ARRAY_TYPE
)
13963 if (TYPE_DOMAIN (t
) && TREE_CODE (TYPE_DOMAIN (t
)) != INTEGER_TYPE
)
13965 error ("Array TYPE_DOMAIN is not integer type");
13966 debug_tree (TYPE_DOMAIN (t
));
13967 error_found
= true;
13970 else if (RECORD_OR_UNION_TYPE_P (t
))
13972 if (TYPE_FIELDS (t
) && !COMPLETE_TYPE_P (t
) && in_lto_p
)
13974 error ("TYPE_FIELDS defined in incomplete type");
13975 error_found
= true;
13977 for (tree fld
= TYPE_FIELDS (t
); fld
; fld
= TREE_CHAIN (fld
))
13979 /* TODO: verify properties of decls. */
13980 if (TREE_CODE (fld
) == FIELD_DECL
)
13982 else if (TREE_CODE (fld
) == TYPE_DECL
)
13984 else if (TREE_CODE (fld
) == CONST_DECL
)
13986 else if (VAR_P (fld
))
13988 else if (TREE_CODE (fld
) == TEMPLATE_DECL
)
13990 else if (TREE_CODE (fld
) == USING_DECL
)
13994 error ("Wrong tree in TYPE_FIELDS list");
13996 error_found
= true;
14000 else if (TREE_CODE (t
) == INTEGER_TYPE
14001 || TREE_CODE (t
) == BOOLEAN_TYPE
14002 || TREE_CODE (t
) == OFFSET_TYPE
14003 || TREE_CODE (t
) == REFERENCE_TYPE
14004 || TREE_CODE (t
) == NULLPTR_TYPE
14005 || TREE_CODE (t
) == POINTER_TYPE
)
14007 if (TYPE_CACHED_VALUES_P (t
) != (TYPE_CACHED_VALUES (t
) != NULL
))
14009 error ("TYPE_CACHED_VALUES_P is %i while TYPE_CACHED_VALUES is %p",
14010 TYPE_CACHED_VALUES_P (t
), (void *)TYPE_CACHED_VALUES (t
));
14011 error_found
= true;
14013 else if (TYPE_CACHED_VALUES_P (t
) && TREE_CODE (TYPE_CACHED_VALUES (t
)) != TREE_VEC
)
14015 error ("TYPE_CACHED_VALUES is not TREE_VEC");
14016 debug_tree (TYPE_CACHED_VALUES (t
));
14017 error_found
= true;
14019 /* Verify just enough of cache to ensure that no one copied it to new type.
14020 All copying should go by copy_node that should clear it. */
14021 else if (TYPE_CACHED_VALUES_P (t
))
14024 for (i
= 0; i
< TREE_VEC_LENGTH (TYPE_CACHED_VALUES (t
)); i
++)
14025 if (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)
14026 && TREE_TYPE (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
)) != t
)
14028 error ("wrong TYPE_CACHED_VALUES entry");
14029 debug_tree (TREE_VEC_ELT (TYPE_CACHED_VALUES (t
), i
));
14030 error_found
= true;
14035 else if (TREE_CODE (t
) == FUNCTION_TYPE
|| TREE_CODE (t
) == METHOD_TYPE
)
14036 for (tree l
= TYPE_ARG_TYPES (t
); l
; l
= TREE_CHAIN (l
))
14038 /* C++ FE uses TREE_PURPOSE to store initial values. */
14039 if (TREE_PURPOSE (l
) && in_lto_p
)
14041 error ("TREE_PURPOSE is non-NULL in TYPE_ARG_TYPES list");
14043 error_found
= true;
14045 if (!TYPE_P (TREE_VALUE (l
)))
14047 error ("Wrong entry in TYPE_ARG_TYPES list");
14049 error_found
= true;
14052 else if (!is_lang_specific (t
) && TYPE_VALUES_RAW (t
))
14054 error ("TYPE_VALUES_RAW field is non-NULL");
14055 debug_tree (TYPE_VALUES_RAW (t
));
14056 error_found
= true;
14058 if (TREE_CODE (t
) != INTEGER_TYPE
14059 && TREE_CODE (t
) != BOOLEAN_TYPE
14060 && TREE_CODE (t
) != OFFSET_TYPE
14061 && TREE_CODE (t
) != REFERENCE_TYPE
14062 && TREE_CODE (t
) != NULLPTR_TYPE
14063 && TREE_CODE (t
) != POINTER_TYPE
14064 && TYPE_CACHED_VALUES_P (t
))
14066 error ("TYPE_CACHED_VALUES_P is set while it should not");
14067 error_found
= true;
14069 if (TYPE_STRING_FLAG (t
)
14070 && TREE_CODE (t
) != ARRAY_TYPE
&& TREE_CODE (t
) != INTEGER_TYPE
)
14072 error ("TYPE_STRING_FLAG is set on wrong type code");
14073 error_found
= true;
14075 else if (TYPE_STRING_FLAG (t
))
14078 if (TREE_CODE (b
) == ARRAY_TYPE
)
14080 /* Java builds arrays with TYPE_STRING_FLAG of promoted_char_type
14082 if (TREE_CODE (b
) != INTEGER_TYPE
)
14084 error ("TYPE_STRING_FLAG is set on type that does not look like "
14085 "char nor array of chars");
14086 error_found
= true;
14090 /* ipa-devirt makes an assumption that TYPE_METHOD_BASETYPE is always
14091 TYPE_MAIN_VARIANT and it would be odd to add methods only to variatns
14093 if (TREE_CODE (t
) == METHOD_TYPE
14094 && TYPE_MAIN_VARIANT (TYPE_METHOD_BASETYPE (t
)) != TYPE_METHOD_BASETYPE (t
))
14096 error ("TYPE_METHOD_BASETYPE is not main variant");
14097 error_found
= true;
14102 debug_tree (const_cast <tree
> (t
));
14103 internal_error ("verify_type failed");
14108 /* Return true if ARG is marked with the nonnull attribute in the
14109 current function signature. */
14112 nonnull_arg_p (const_tree arg
)
14114 tree t
, attrs
, fntype
;
14115 unsigned HOST_WIDE_INT arg_num
;
14117 gcc_assert (TREE_CODE (arg
) == PARM_DECL
14118 && (POINTER_TYPE_P (TREE_TYPE (arg
))
14119 || TREE_CODE (TREE_TYPE (arg
)) == OFFSET_TYPE
));
14121 /* The static chain decl is always non null. */
14122 if (arg
== cfun
->static_chain_decl
)
14125 /* THIS argument of method is always non-NULL. */
14126 if (TREE_CODE (TREE_TYPE (cfun
->decl
)) == METHOD_TYPE
14127 && arg
== DECL_ARGUMENTS (cfun
->decl
)
14128 && flag_delete_null_pointer_checks
)
14131 /* Values passed by reference are always non-NULL. */
14132 if (TREE_CODE (TREE_TYPE (arg
)) == REFERENCE_TYPE
14133 && flag_delete_null_pointer_checks
)
14136 fntype
= TREE_TYPE (cfun
->decl
);
14137 for (attrs
= TYPE_ATTRIBUTES (fntype
); attrs
; attrs
= TREE_CHAIN (attrs
))
14139 attrs
= lookup_attribute ("nonnull", attrs
);
14141 /* If "nonnull" wasn't specified, we know nothing about the argument. */
14142 if (attrs
== NULL_TREE
)
14145 /* If "nonnull" applies to all the arguments, then ARG is non-null. */
14146 if (TREE_VALUE (attrs
) == NULL_TREE
)
14149 /* Get the position number for ARG in the function signature. */
14150 for (arg_num
= 1, t
= DECL_ARGUMENTS (cfun
->decl
);
14152 t
= DECL_CHAIN (t
), arg_num
++)
14158 gcc_assert (t
== arg
);
14160 /* Now see if ARG_NUM is mentioned in the nonnull list. */
14161 for (t
= TREE_VALUE (attrs
); t
; t
= TREE_CHAIN (t
))
14163 if (compare_tree_int (TREE_VALUE (t
), arg_num
) == 0)
14171 /* Combine LOC and BLOCK to a combined adhoc loc, retaining any range
14175 set_block (location_t loc
, tree block
)
14177 location_t pure_loc
= get_pure_location (loc
);
14178 source_range src_range
= get_range_from_loc (line_table
, loc
);
14179 return COMBINE_LOCATION_DATA (line_table
, pure_loc
, src_range
, block
);
14183 set_source_range (tree expr
, location_t start
, location_t finish
)
14185 source_range src_range
;
14186 src_range
.m_start
= start
;
14187 src_range
.m_finish
= finish
;
14188 return set_source_range (expr
, src_range
);
14192 set_source_range (tree expr
, source_range src_range
)
14194 if (!EXPR_P (expr
))
14195 return UNKNOWN_LOCATION
;
14197 location_t pure_loc
= get_pure_location (EXPR_LOCATION (expr
));
14198 location_t adhoc
= COMBINE_LOCATION_DATA (line_table
,
14202 SET_EXPR_LOCATION (expr
, adhoc
);
14206 /* Return the name of combined function FN, for debugging purposes. */
14209 combined_fn_name (combined_fn fn
)
14211 if (builtin_fn_p (fn
))
14213 tree fndecl
= builtin_decl_explicit (as_builtin_fn (fn
));
14214 return IDENTIFIER_POINTER (DECL_NAME (fndecl
));
14217 return internal_fn_name (as_internal_fn (fn
));
14222 namespace selftest
{
14224 /* Selftests for tree. */
14226 /* Verify that integer constants are sane. */
14229 test_integer_constants ()
14231 ASSERT_TRUE (integer_type_node
!= NULL
);
14232 ASSERT_TRUE (build_int_cst (integer_type_node
, 0) != NULL
);
14234 tree type
= integer_type_node
;
14236 tree zero
= build_zero_cst (type
);
14237 ASSERT_EQ (INTEGER_CST
, TREE_CODE (zero
));
14238 ASSERT_EQ (type
, TREE_TYPE (zero
));
14240 tree one
= build_int_cst (type
, 1);
14241 ASSERT_EQ (INTEGER_CST
, TREE_CODE (one
));
14242 ASSERT_EQ (type
, TREE_TYPE (zero
));
14245 /* Verify identifiers. */
14248 test_identifiers ()
14250 tree identifier
= get_identifier ("foo");
14251 ASSERT_EQ (3, IDENTIFIER_LENGTH (identifier
));
14252 ASSERT_STREQ ("foo", IDENTIFIER_POINTER (identifier
));
14255 /* Verify LABEL_DECL. */
14260 tree identifier
= get_identifier ("err");
14261 tree label_decl
= build_decl (UNKNOWN_LOCATION
, LABEL_DECL
,
14262 identifier
, void_type_node
);
14263 ASSERT_EQ (-1, LABEL_DECL_UID (label_decl
));
14264 ASSERT_FALSE (FORCED_LABEL (label_decl
));
14267 /* Run all of the selftests within this file. */
14272 test_integer_constants ();
14273 test_identifiers ();
14277 } // namespace selftest
14279 #endif /* CHECKING_P */
14281 #include "gt-tree.h"